LEADER 02497nam 2200349 n 450 001 996385825903316 005 20200824120933.0 035 $a(CKB)4940000000071771 035 $a(EEBO)2264194261 035 $a(UnM)99859969_130501-01e 035 $a(UnM)99859969_130501-01 035 $a(EXLCZ)994940000000071771 100 $a19850515d1642 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 02$aA catalogue of the names of the dukes, marquesses, earles and lords, that have absented themselves from the Parliament, and are now with His Maiesty$b[electronic resource] $eAnd of the names of the lords that subscribed to levie horse to assist His Majestie with. A copie of all the cavaliers of his Majesties marching army, with the number of captaines in each severall regiment; every regiment containing a thousand souldiers. As also, a list of the army of his Excellency, Robert, Earle of Essex: with the names of the troops of horse under the command of William Earle of Bedford. Each troop consisting of sixtie horse; besides two trumpetters, three corporalls, a sadler, and a farrier. With the instructions sent by the Parliament to his Excellency. A list of the navie royall, and merchants ships: the names of the captaines, and lievtenants; their men and burdens, for the guard of the narrow-seas, and for Ireland. Moreover, the names of the orthodox divines, presented by the knights and burgesses, as fit persons to be consulted with by the Parliament touching the reformation of church government and liturgie. Lastly, the field officers chosen for the Irish expedition, for the regiments of 5000. foote and 500. horse 210 $a[London $cs.n.]$dPrinted 1642 215 $a[2], 22 p 300 $aPlace of publication from Wing. 300 $aA different work from Wing C1392. 300 $aA variant has portrait of Charles I on verso of title page. 300 $aAnnotation on Thomason copy E.83[9]: "Decemb: 22". 300 $aReproduction of the original in the British Library. 330 $aeebo-0018 606 $aRoyalists$zEngland$y17th century$vEarly works to 1800 607 $aGreat Britain$xHistory$yCivil War, 1642-1649$vRegisters$vEarly works to 1800 615 0$aRoyalists 801 0$bCu-RivES 906 $aBOOK 912 $a996385825903316 996 $aA catalogue of the names of the dukes, marquesses, earles and lords, that have absented themselves from the Parliament, and are now with His Maiesty$92305009 997 $aUNISA LEADER 04808nam 22007095 450 001 996465406103316 005 20200704113630.0 010 $a3-540-46369-0 024 7 $a10.1007/3-540-53863-1 035 $a(CKB)1000000000233627 035 $a(SSID)ssj0000321013 035 $a(PQKBManifestationID)11256244 035 $a(PQKBTitleCode)TC0000321013 035 $a(PQKBWorkID)10263517 035 $a(PQKB)10026911 035 $a(DE-He213)978-3-540-46369-6 035 $a(PPN)155200208 035 $a(EXLCZ)991000000000233627 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Petri Nets 1990$b[electronic resource] /$fedited by Grzegorz Rozenberg 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (VIII, 516 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v483 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-53863-1 327 $aA survey of behaviour and equivalence preserving refinements of petri nets -- A distributed simulator for high order Petri nets -- Petri nets with uncertain markings -- Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows -- Improving the linearly based characterization of P/T nets -- Linear invariants in commutative high level nets -- Vicinity respecting net morphisms -- Regular stochastic petri nets -- Circuits, handles, bridges and nets -- On the analysis and synthesis of free choice systems -- Petri net models of a distributed election protocol on a unidirectional ring -- Hierarchies in coloured petri nets -- Coloured petri nets: A high level language for system design and analysis -- A simulation system architecture for graph models -- A state transformation preorder over a class of EN systems -- Composition of nets via a communication medium -- ?Trellis: A system for writing and browsing petri-net-based hypertext -- Stubborn sets for reduced state space generation. 330 $aThe main idea behind the series of volumes Advances in Petri Nets is to present to the general computer science community recent results which are the most representative and significant for the development of the area. The papers for the volumes are drawn mainly from the annual International Conferences on Applications and Theory of Petri Nets. Selected papers from the latest conference are independently refereed, and revised and extended as necessary. Some further papers submitted directly to the editor are included. Advances in Petri Nets 1990 covers the Tenth International Conference on Applications and Theory of Petri Nets held in Bonn, Germany, in June 1989. Additional highlights of this volume include a tutorial on refinements of Petri nets by W. Brauer, R. Gold, and W. Vogler, and a tutorial on analysis and synthesis of free choice systems by J. Esparza and M. Silva, both prepared in the framework of the ESPRIT Basic Research Actions Project DEMON. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v483 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aMicroprocessors 606 $aComputer communication systems 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aProcessor Architectures$3https://scigraph.springernature.com/ontologies/product-market-codes/I13014 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMicroprocessors. 615 0$aComputer communication systems. 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aProcessor Architectures. 615 24$aComputer Communication Networks. 676 $a004.0151 702 $aRozenberg$b Grzegorz$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465406103316 996 $aAdvances in Petri Nets 1990$92831479 997 $aUNISA LEADER 05518nam 2200721 a 450 001 9910144708103321 005 20170810191427.0 010 $a1-280-52086-8 010 $a9786610520862 010 $a3-527-60600-9 010 $a3-527-60608-4 035 $a(CKB)1000000000377381 035 $a(EBL)481705 035 $a(OCoLC)69157728 035 $a(SSID)ssj0000231314 035 $a(PQKBManifestationID)11175158 035 $a(PQKBTitleCode)TC0000231314 035 $a(PQKBWorkID)10198467 035 $a(PQKB)10340976 035 $a(SSID)ssj0000307489 035 $a(PQKBManifestationID)11263805 035 $a(PQKBTitleCode)TC0000307489 035 $a(PQKBWorkID)10244520 035 $a(PQKB)10917387 035 $a(MiAaPQ)EBC481705 035 $a(PPN)226207374 035 $a(EXLCZ)991000000000377381 100 $a20060807d2005 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aQuantum information processing$b[electronic resource] /$fedited by Thomas Beth, Gerd Leuchs 205 $a2nd rev. and enlarged ed. 210 $aWeinheim $cWiley-VCH$dc2005 215 $a1 online resource (473 p.) 300 $aDescription based upon print version of record. 311 $a3-527-40541-0 320 $aIncludes bibliographical references and index. 327 $aQuantum Information Processing 2., revised and enlarged Edition; Contents; Preface to the First Edition; Preface to the Second Edition; List of Contributors; 1 Algorithms for Quantum Systems - Quantum Algorithms; 1.1 Introduction; 1.2 Fast Quantum Signal Transforms; 1.3 Quantum Error-correcting Codes; 1.4 Efficient Decomposition of Quantum Operations into Given One-parameter Groups; 1.5 Simulation of Hamiltonians; References; 2 Quantum Information Processing and Error Correction with Jump Codes; 2.1 Introduction; 2.2 Invertible Quantum Operations and Error Correction 327 $a2.3 Quantum Error Correction by Jump Codes2.3.1 Spontaneous Decay and Quantum Trajectories; 2.3.2 Jump Codes; 2.4 Universal Quantum Gates in Code Spaces; 2.4.1 Universal Sets of Quantum Gates for Qudit-Systems; 2.4.2 Universal One-Qutrit Gates; 2.4.3 A Universal Entanglement Gate; 2.5 Summary and Outlook; References; 3 Computational Model for the One-Way Quantum Computer: Concepts and Summary; 3.1 Introduction; 3.2 The QC(C) as a Universal Simulator of Quantum Logic Networks; 3.3 Non-Network Character of the QC(C); 3.4 Computational Model; 3.5 Conclusion; References 327 $a4 Quantum Correlations as Basic Resource for Quantum Key Distribution4.1 Introduction; 4.2 Background of Classical Information Theoretic Security; 4.3 Link Between Classical and Quantum; 4.4 Searching for Effective Entanglement; 4.5 Verification Sets; 4.5.1 6-state Protocol; 4.5.2 4-state Protocol; 4.5.3 2-state Protocol; 4.6 Examples for Evaluation; 4.7 Realistic Experiments; 4.8 Conclusions; References; 5 Increasing the Size of NMR Quantum Computers; 5.1 Introduction; 5.2 Suitable Molecules; 5.3 Scaling Problem for Experiments Based on Pseudo-pure States; 5.4 Approaching Pure States 327 $a5.5 Scalable NMR Quantum Computing Based on the Thermal Density Operator5.6 Time-optimal Implementation of Quantum Gates; 5.7 Conclusion; References; 6 On Lossless Quantum Data Compression and Quantum Variable-length Codes; 6.1 Introduction; 6.2 Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound; 6.2.1 The Codes; 6.2.2 Length Observable and Average Length of Codewords; 6.2.3 Kraft Inequality and von Neumann Entropy Bound; 6.2.4 Base Length; 6.3 Construct Long Codes from Variable-length Codes; 6.4 Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths 327 $a6.5 Code Analysis Based on the Base Length6.6 Lossless Quantum Data Compression with a Classical Helper; 6.7 Lossless Quantum Data Compression for Mixed State Sources; 6.8 A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression; References; 7 Entanglement Properties of Composite Quantum Systems; 7.1 Introduction; 7.2 Separability of Composite Quantum Systems; 7.2.1 The Separability Problem; 7.2.2 Results on The Separability Problem; 7.3 The Distillability Problem; 7.3.1 Results on the Distillability Problem 327 $a7.4 Witness Operators for the Detection of Entanglement 330 $aQuantum processing and communication is emerging as a challenging technique at the beginning of the new millennium. This is an up-to-date insight into the current research of quantum superposition, entanglement, and the quantum measurement process - the key ingredients of quantum information processing. The authors further address quantum protocols and algorithms. Complementary to similar programmes in other countries and at the European level, the German Research Foundation (DFG) started a focused research program on quantum information in 1999. The contributions - written by leading experts 606 $aQuantum computers 606 $aQuantum theory 606 $aInformation theory 615 0$aQuantum computers. 615 0$aQuantum theory. 615 0$aInformation theory. 676 $a004.1 701 $aBeth$b Thomas$f1949-$054469 701 $aLeuchs$b Gerd$0927305 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144708103321 996 $aQuantum information processing$92221357 997 $aUNINA