| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465962303316 |
|
|
Titolo |
Information Security and Privacy [[electronic resource] ] : 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings / / edited by Willy Susilo, Guomin Yang |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2018.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XV, 833 p. 127 illus.) |
|
|
|
|
|
|
Collana |
|
Security and Cryptology ; ; 10946 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer security |
Data encryption (Computer science) |
Coding theory |
Information theory |
Computers and civilization |
Computers |
Law and legislation |
Computer communication systems |
Systems and Data Security |
Cryptology |
Coding and Information Theory |
Computers and Society |
Legal Aspects of Computing |
Computer Communication Networks |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 23rd Australasian Conference on Information Security and Privacy, ACISP 2018, held in Wollongong, Australia, in July 2018. The 41 revised full papers and 10 short papers presented were carefully revised and selected from 136 submissions. The papers present theories, techniques, implementations, applications and practical experiences on |
|
|
|
|
|
|
|
|
|
|
|
|
|
a variety of topics such as foundations, symmetric-key cryptography, public-key cryptography, cloud security, post-quantum cryptography, security protocol, system and network security, and blockchain and cryptocurrency. |
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996465760503316 |
|
|
Titolo |
Theoretical Computer Science [[electronic resource] ] : 7th IFIP TC1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012, Proceedings / / edited by Jos C.M. Baeten, Tom Ball, Frank S. de Boer |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2012.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 393 p. 76 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 7604 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Machine theory |
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Theory of Computation |
Formal Languages and Automata Theory |
Discrete Mathematics in Computer Science |
Mathematics of Computing |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
International conference proceedings. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and author index. |
|
|
|
|
|
|
Nota di contenuto |
|
Computability and Non-computability Issues in Amorphous Computing -- Static Single Information Form for Abstract Compilation.- Input-Driven Stack Automata.- Probabilistic Inference and Monadic Second Order Logic.- Cinderella versus the Wicked Stepmother.- Worst- and Average-Case Privacy Breaches in Randomization Mechanisms.- Weak Bisimulations for Coalgebras over Ordered Functors.- A Context-Free |
|
|
|
|
|
|
|
|
|
|
|
Linear Ordering with an Undecidable First-Order Theory.- Open Bisimulation for Quantum Processes.- A Modular LTS for Open Reactive Systems.- Unidirectional Channel Systems Can Be Tested.- On Properties and State Complexity of Deterministic State-Partition Automata.- On Union-Free and Deterministic Union-Free Languages.- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions.- Formal Verification of Distributed Algorithms: From Pseudo Code to Checked Proofs.- A Temporal Logic for Multi-threaded Programs.- The Algorithmic Complexity of k-Domatic Partition of Graphs.- Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.- Modal Interface Automata.- Proofs as Executions.- Efficient Algorithms for the max k-vertex cover Problem.- A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words..- Compositional Abstraction Techniques for Probabilistic Automata -- Broadcast Abstraction in a Stochastic Calculus for Mobile Networks.- An Intersection Type System for Deterministic Pushdown Automata.- An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus: Extended Abstract. Static Single Information Form for Abstract Compilation.- Input-Driven Stack Automata.- Probabilistic Inference and Monadic Second Order Logic.- Cinderella versus the Wicked Stepmother.- Worst- and Average-Case Privacy Breaches in Randomization Mechanisms.- Weak Bisimulations for Coalgebras over Ordered Functors.- A Context-Free Linear Ordering with an Undecidable First-Order Theory.- Open Bisimulation for Quantum Processes.- A Modular LTS for Open Reactive Systems.- Unidirectional Channel Systems Can Be Tested.- On Properties and State Complexity of Deterministic State-Partition Automata.- On Union-Free and Deterministic Union-Free Languages.- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions.- Formal Verification of Distributed Algorithms: From Pseudo Code to Checked Proofs.- A Temporal Logic for Multi-threaded Programs.- The Algorithmic Complexity of k-Domatic Partition of Graphs.- Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics.- Modal Interface Automata.- Proofs as Executions.- Efficient Algorithms for the max k-vertex cover Problem.- A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words..- Compositional Abstraction Techniques for Probabilistic Automata -- Broadcast Abstraction in a Stochastic Calculus for Mobile Networks.- An Intersection Type System for Deterministic Pushdown Automata.- An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus: Extended Abstract. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 7th FIP WG 2.2 International Conference, TCS 2012, held in Amsterdam, The Netherlands, in September 2012. The 25 revised full papers presented, together with one invited talk, were carefully reviewed and selected from 48 submissions. New results of computation theory are presented and more broadly experts in theoretical computer science meet to share insights and ask questions about the future directions of the field. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNISA996551960103316 |
|
|
Autore |
BERVEGLIERI, Roberto |
|
|
Titolo |
Ingegnosi artificij : trecento anni di storia della scienza, della tecnica e dell’innovazione : (1474-1788) / Roberto Berveglieri |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Scienze - Storia - Venezia - 1474-1788 - Fonti archivistiche |
|
|
|
|
|
|
Collocazione |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Prima del titolo: Serenissima repubblica di Venezia |
|
|
|
|
|
|
Nota di contenuto |
|
Vol. 1. - 837 p., XL p. di tav. |
|
|
|
|
|
| |