LEADER 07040nam 22007455 450 001 996466157403316 005 20200705030959.0 010 $a3-540-46763-7 024 7 $a10.1007/3-540-55179-4 035 $a(CKB)1000000000548804 035 $a(SSID)ssj0000322076 035 $a(PQKBManifestationID)11279115 035 $a(PQKBTitleCode)TC0000322076 035 $a(PQKBWorkID)10280817 035 $a(PQKB)10103609 035 $a(DE-He213)978-3-540-46763-2 035 $a(PPN)155231499 035 $a(EXLCZ)991000000000548804 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Aided Verification$b[electronic resource] $e3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings /$fedited by Kim G. Larsen, Arne Skou 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (XI, 493 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v575 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55179-4 327 $aTaming infinite state spaces -- Silence is golden: Branching bisimilarity is decidable for context-free processes -- Computing distinguishing formulas for branching bisimulation -- Compositional checking of satisfaction -- An action based framework for verifying logical and behavioural properties of concurrent systems -- A linear-time model-checking algorithm for the alternation-free modal mu-calculus -- Automatic temporal verification of buffer systems -- Mechanically checked proofs of kernel specifications -- A top down approach to the formal specification of SCI cache coherence -- Integer programming in the analysis of concurrent systems -- The lotos model of a fault protected system and its verification using a petri net based approach -- Error diagnosis in finite communicating systems -- Temporal precondition verification of design transformations -- PAM: A process algebra manipulator -- The Concurrency Workbench with priorities -- A proof assistant for PSF -- Avoiding state explosion by composition of minimal covering graphs -- ?On the fly? verification of behavioural equivalences and preorders -- Bounded-memory algorithms for verification on-the-fly -- Generating BDDs for symbolic model checking in CCS -- Vectorized symbolic model checking of computation tree logic for sequential machine verification -- Functional extension of symbolic model checking -- An automated proof technique for finite-state machine equivalence -- From data structure to process structure -- Checking for language inclusion using simulation preorders -- A semantic driven method to check the fineteness of CCS processes -- Using the HOL prove assistant for proving the correctness of term rewriting rules reducing terms of sequential behavior -- Mechanizing a proof by induction of process algebra specifications in higher order logic -- A two-level formal verification methodology using HOL and COSMOS -- Efficient algorithms for verification of equivalences for probabilistic processes -- Partial-order model checking: A guide for the perplexed -- Using partial orders for the efficient verification of deadlock freedom and safety properties -- Complexity results for POMSET languages -- Mechanically verifying safety and liveness properties of delay insensitive circuits -- Automating most parts of hardware proofs in HOL -- An overview and synthesis on timed process algebras -- Minimum and maximum delay problems in realtime systems -- Formal verification of speed-dependent asynchronous circuits using symbolic model checking of Branching Time Regular Temporal Logic -- Verifying properties of HMS machine specifications of real-time systems -- A linear time process algebra -- Deciding properties of regular real timed processes -- An algebra of Boolean processes -- Comparing generic state machines -- An automata theoretic approach to Temporal Logic. 330 $aThis volume contains the proceedings of the third International Workshop on Computer Aided Verification, CAV '91, held in Aalborg, Denmark, July 1-4, 1991. The objective of this series of workshops is to bring together researchers and practitioners interested in the development and use of methods, tools and theories for automatic verification of (finite) state systems. The workshop provides a unique opportunity for comparing the numerous verification methods and associated verification tools, and the extent to which they may be utilized in application design. The emphasis is not only on new research results but also on the application of existing results to real verification problems. The papers in the volume areorganized into sections on equivalence checking, model checking, applications, tools for process algebras, the state explosion problem, symbolic model checking, verification and transformation techniques, higher order logic, partial order approaches, hardware verification, timed specification and verification, and automata. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v575 606 $aComputers 606 $aSoftware engineering 606 $aArchitecture, Computer 606 $aComputer logic 606 $aMathematical logic 606 $aSpecial purpose computers 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aSpecial Purpose and Application-Based Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I13030 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aArchitecture, Computer. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aSpecial purpose computers. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aComputer System Implementation. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aSpecial Purpose and Application-Based Systems. 676 $a004.0151 702 $aLarsen$b Kim G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSkou$b Arne$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466157403316 996 $aComputer Aided Verification$9772228 997 $aUNISA LEADER 03165nam 22006495 450 001 9910728944303321 005 20251008144929.0 010 $a9783031322426 010 $a3031322428 024 7 $a10.1007/978-3-031-32242-6 035 $a(MiAaPQ)EBC30558369 035 $a(Au-PeEL)EBL30558369 035 $a(OCoLC)1381096978 035 $a(DE-He213)978-3-031-32242-6 035 $a(BIP)090182091 035 $a(PPN)270615180 035 $a(CKB)26816389100041 035 $a(EXLCZ)9926816389100041 100 $a20230531d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aIntroduction to Bayesian Tracking and Particle Filters /$fby Lawrence D. Stone, Roy L. Streit, Stephen L. Anderson 205 $a1st ed. 2023. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2023. 215 $a1 online resource (124 pages) 225 1 $aStudies in Big Data,$x2197-6511 ;$v126 311 08$aPrint version: Stone, Lawrence D. Introduction to Bayesian Tracking and Particle Filters Cham : Springer International Publishing AG,c2023 9783031322419 327 $aIntroduction -- Bayesian Single Target Tracking -- Bayesian Particle Filtering -- Simple Multiple Target Tracking -- Intensity Filters. 330 $aThis book provides a quick but insightful introduction to Bayesian tracking and particle filtering for a person who has some background in probability and statistics and wishes to learn the basics of single-target tracking. It also introduces the reader to multiple target tracking by presenting useful approximate methods that are easy to implement compared to full-blown multiple target trackers. The book presents the basic concepts of Bayesian inference and demonstrates the power of the Bayesian method through numerous applications of particle filters to tracking and smoothing problems. It emphasizes target motion models that incorporate knowledge about the target?s behavior in a natural fashion rather than assumptions made for mathematical convenience. The background provided by this book allows a person to quickly become a productive member of a project team using Bayesian filtering and to develop new methods and techniques for problems the team may face. 410 0$aStudies in Big Data,$x2197-6511 ;$v126 606 $aEngineering$xData processing 606 $aStatistics 606 $aBig data 606 $aData Engineering 606 $aBayesian Inference 606 $aBig Data 615 0$aEngineering$xData processing. 615 0$aStatistics. 615 0$aBig data. 615 14$aData Engineering. 615 24$aBayesian Inference. 615 24$aBig Data. 676 $a620.00285 676 $a519.542 700 $aStone$b Lawrence D$059128 701 $aStreit$b Roy L$01367147 701 $aAnderson$b Stephen L$0162681 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910728944303321 996 $aIntroduction to Bayesian Tracking and Particle Filters$93389872 997 $aUNINA LEADER 08089nam 22007695 450 001 9910768465703321 005 20251226203056.0 024 7 $a10.1007/b136461 035 $a(CKB)1000000000212984 035 $a(SSID)ssj0000317599 035 $a(PQKBManifestationID)11224126 035 $a(PQKBTitleCode)TC0000317599 035 $a(PQKBWorkID)10293897 035 $a(PQKB)10358695 035 $a(DE-He213)978-3-540-32078-4 035 $a(MiAaPQ)EBC3067646 035 $a(PPN)123094593 035 $a(BIP)12317483 035 $a(EXLCZ)991000000000212984 100 $a20100714d2005 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental and Efficient Algorithms $e4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings /$fedited by Sotiris E. Nikoletseas 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XVI, 628 p.) 225 1 $aProgramming and Software Engineering,$x2945-9168 ;$v3503 300 $aIncludes index. 311 08$aPrinted edition: 9783540259206 327 $aInvited Talks -- T? ??? ?í ? ??í?? ? The Interaction Between Algorithms and Game Theory -- Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization -- High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology -- Contributed Regular Papers -- The ?Real? Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting -- Implementing Minimum Cycle Basis Algorithms -- Rounding to an Integral Program -- Rectangle Covers Revisited Computationally -- Don?t Compare Averages -- Experimental Results for Stackelberg Scheduling Strategies -- An Improved Branch-and-Bound Algorithm for the Test Cover Problem -- Degree-Based Treewidth Lower Bounds -- Inferring AS Relationships: Dead End or Lively Beginning? -- Acceleration of Shortest Path and Constrained Shortest Path Computation -- A General Buffer Scheme for the Windows Scheduling Problem -- Implementation of Approximation Algorithms for the Multicast Congestion Problem -- Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes -- From Static Code Distribution to More Shrinkage for the Multiterminal Cut -- Partitioning Graphs to Speed Up Dijkstra?s Algorithm -- Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games -- New Upper Bound Heuristics for Treewidth -- Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline Alliance -- Algorithm Engineering for Optimal Graph Bipartization -- Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid -- Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces -- On Symbolic Scheduling Independent Tasks with Restricted Execution Times -- A Simple Randomizedk-Local Election Algorithm for Local Computations -- Generating and Radiocoloring Families of Perfect Graphs -- Efficient Implementation of Rank and Select Functions for Succinct Representation -- Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem -- A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol -- A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables -- GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem -- New Bit-Parallel Indel-Distance Algorithm -- Dynamic Application Placement Under Service and Memory Constraints -- Integrating Coordinated Checkpointing and Recovery Mechanisms into DSM Synchronization Barriers -- Synchronization Fault Cryptanalysis for Breaking A5/1 -- An Efficient Algorithm for ?-Approximate Matching with ?-Bounded Gaps in Musical Sequences -- The Necessity of Timekeeping in Adversarial Queueing -- BDDs in a Branch and Cut Framework -- Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of Workstations -- Fast Algorithms for Weighted Bipartite Matching -- A Practical Minimal Perfect Hashing Method -- Efficient and Experimental Meta-heuristics for MAX-SAT Problems -- Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs -- Local Clustering of Large Graphs by Approximate Fiedler Vectors -- Almost FPRAS for Lattice Models of Protein Folding -- Vertex Cover Approximations: Experiments and Observations -- GRASP with Path-Relinking for the Maximum Diversity Problem -- How to Splay for loglogN-Competitiveness -- Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms -- Contributed Short Papers -- Optimal Competitive OnlineRay Search with an Error-Prone Robot -- An Empirical Study for Inversions-Sensitive Sorting Algorithms -- Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs -- Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study -- Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching -- Developing Novel Statistical Bandwidths for Communication Networks with Incomplete Information -- Dynamic Quality of Service Support in Virtual Private Networks. 330 $aThis proceedings volume contains the accepted papers and invited talks p- sented at the 4th International Workshop of E'cient and Experimental Al- rithms (WEA 2005), that was held May 10-13, on Santorini Island, Greece. The WEA events are intended to be an international forum for research on the design, analysis and especially the experimental implementation, evaluation and engineering of algorithms, as well as on combinatorial optimization and its applications. The'rstthreeworkshopsinthisserieswereheldinRiga(2001),MonteVerita (2003) and Rio de Janeiro (2004). Thisvolumecontains3invitedpapersrelatedtocorrespondingkeynotetalks: by Prof. Christos Papadimitriou (University of California at Berkeley, USA), Prof. David Bader (University of New Mexico, USA) and Prof. Celso Ribeiro (University of Rio de Janeiro, Brazil). This proceedings includes 54 papers (47 regular and 7 short), selected out of a record number of 176 submissions. Each paper was reviewed by at least 2 Program Committee members, while many papers got 3 or 4 reviews. A total number of 419 reviews were solicited, with the help of trusted external referees. In addition to the 54 papers included in this volume, 6papers were accepted as poster presentations: these papers were published in a separate poster p- ceedings volume by CTI Press and a major publisher in Greece, "Ellinika Gr- mata." The presentation of these posters at the event was expected to create a fruitful discussion on interesting ideas. 410 0$aProgramming and Software Engineering,$x2945-9168 ;$v3503 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer graphics 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 676 $a005.1 701 $aNikoletseas$b Sotiris$0878400 712 12$aWEA 2005 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768465703321 996 $aExperimental and efficient algorithms$94187664 997 $aUNINA