Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
DNA Computing [[electronic resource] ] : 8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers / / edited by Masami Hagiya, Azuma Ohuchi
| DNA Computing [[electronic resource] ] : 8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers / / edited by Masami Hagiya, Azuma Ohuchi |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 344 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computers Algorithms Artificial intelligence Bioinformatics Mathematical Logic and Foundations Computation by Abstract Devices Algorithm Analysis and Problem Complexity Artificial Intelligence |
| ISBN | 3-540-36440-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-assembly and Autonomous Molecular Computation -- Self-assembling DNA Graphs -- DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice -- The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA -- Cascading Whiplash PCR with a Nicking Enzyme -- Molecular Evolution and Application to Biotechnology -- A PNA-mediated Whiplash PCR-based Program for In Vitro Protein Evolution -- Engineering Signal Processing in Cells: Towards Molecular Concentration Band Detection -- Applications to Mathematical Problems -- Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges -- Shortening the Computational Time of the Fluorescent DNA Computing -- How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top? -- Hierarchical DNA Memory Based on Nested PCR -- Binary Arithmetic for DNA Computers -- Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules -- Version Space Learning with DNA Molecules -- DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic -- Universal Biochip Readout of Directed Hamiltonian Path Problems -- Nucleic Acid Sequence Design -- Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure -- A PCR-based Protocol for In Vitro Selection of Non-crosshybridizing Oligonucleotides -- On Template Method for DNA Sequence Design -- From RNA Secondary Structure to Coding Theory: A Combinatorial Approach -- Stochastic Local Search Algorithms for DNA Word Design -- NACST/Seq: A Sequence Design System with Multiobjective Optimization -- A Software Tool for Generating Non-crosshybridizing Libraries of DNA Oligonucleotides -- Theory -- Splicing Systems: Regularity and Below -- On the Computational Power of Insertion-Deletion Systems -- Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport -- Conformons-P Systems -- Parallel Rewriting P Systems with Deadlock -- A DNA-based Computational Model Using a Specific Type of Restriction Enzyme -- Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. |
| Record Nr. | UNISA-996465328903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
DNA Computing : 8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers / / edited by Masami Hagiya, Azuma Ohuchi
| DNA Computing : 8th International Workshop on DNA Based Computers, DNA8, Sapporo, Japan, June 10-13, 2002, Revised Papers / / edited by Masami Hagiya, Azuma Ohuchi |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 344 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computers Algorithms Artificial intelligence Bioinformatics Mathematical Logic and Foundations Computation by Abstract Devices Algorithm Analysis and Problem Complexity Artificial Intelligence |
| ISBN | 3-540-36440-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-assembly and Autonomous Molecular Computation -- Self-assembling DNA Graphs -- DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice -- The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA -- Cascading Whiplash PCR with a Nicking Enzyme -- Molecular Evolution and Application to Biotechnology -- A PNA-mediated Whiplash PCR-based Program for In Vitro Protein Evolution -- Engineering Signal Processing in Cells: Towards Molecular Concentration Band Detection -- Applications to Mathematical Problems -- Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges -- Shortening the Computational Time of the Fluorescent DNA Computing -- How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top? -- Hierarchical DNA Memory Based on Nested PCR -- Binary Arithmetic for DNA Computers -- Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules -- Version Space Learning with DNA Molecules -- DNA Implementation of Theorem Proving with Resolution Refutation in Propositional Logic -- Universal Biochip Readout of Directed Hamiltonian Path Problems -- Nucleic Acid Sequence Design -- Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure -- A PCR-based Protocol for In Vitro Selection of Non-crosshybridizing Oligonucleotides -- On Template Method for DNA Sequence Design -- From RNA Secondary Structure to Coding Theory: A Combinatorial Approach -- Stochastic Local Search Algorithms for DNA Word Design -- NACST/Seq: A Sequence Design System with Multiobjective Optimization -- A Software Tool for Generating Non-crosshybridizing Libraries of DNA Oligonucleotides -- Theory -- Splicing Systems: Regularity and Below -- On the Computational Power of Insertion-Deletion Systems -- Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport -- Conformons-P Systems -- Parallel Rewriting P Systems with Deadlock -- A DNA-based Computational Model Using a Specific Type of Restriction Enzyme -- Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. |
| Record Nr. | UNINA-9910143885603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Functional and Logic Programming [[electronic resource] ] : 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006, Proceedings / / edited by Masami Hagiya, Philip Wadler
| Functional and Logic Programming [[electronic resource] ] : 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006, Proceedings / / edited by Masami Hagiya, Philip Wadler |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (X, 298 p.) |
| Disciplina | 005.1/14 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Computer programming
Programming languages (Electronic computers) Computer logic Mathematical logic Artificial intelligence Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Artificial Intelligence |
| ISBN | 3-540-33439-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Parallel Programming and Parallel Abstractions in Fortress -- Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place -- Refereed Papers -- “Scrap Your Boilerplate” Reloaded -- Ruler: Programming Type Rules -- A Framework for Extended Algebraic Data Types -- Lock Free Data Structures Using STM in Haskell -- XML Type Checking Using High-Level Tree Transducer -- A Computational Approach to Pocklington Certificates in Type Theory -- Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant -- Soutei, a Logic-Based Trust-Management System -- A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems -- Resource Analysis by Sup-interpretation -- Lazy Set-Sharing Analysis -- Size-Change Termination and Bound Analysis -- Typed Contracts for Functional Programming -- Contracts as Pairs of Projections -- iData for the World Wide Web – Programming Interconnected Web Forms -- Crossing State Lines: Adapting Object-Oriented Frameworks to Functional Reactive Languages -- WASH Server Pages. |
| Record Nr. | UNISA-996466134303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic, Language and Computation [[electronic resource] ] : Festschrift in Honor of Satoru Takasu / / edited by Neil Jones, Masami Hagiya, Masahiko Sato
| Logic, Language and Computation [[electronic resource] ] : Festschrift in Honor of Satoru Takasu / / edited by Neil Jones, Masami Hagiya, Masahiko Sato |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XIII, 269 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computers Architecture, Computer Computer logic Programming languages (Electronic computers) Mathematical Logic and Formal Languages Theory of Computation Computer System Implementation Logics and Meanings of Programs Computation by Abstract Devices Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-48391-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lifschitz's logic of calculable numbers and optimizations in program extraction -- On implicit arguments -- A functional system with transfinitely defined types -- The non-deterministic catch and throw mechanism and its subject reduction property -- Conservativeness of ? over ??-calculus -- ML with first-class environments and its type inference algorithm -- A simple proof of the genericity lemma -- The logic of FOL systems: Formulated in set theory -- Well-ordering of algebras and Kruskal's theorem -- On locomorphism in analytical equivalence theory -- Analysis of a software/hardware system by tense arithmetic -- The essence of program transformation by partial evaluation and driving -- Program transformation via contextual assertions -- On coding theorems with modified length functions -- Thirty four comparisons are required to sort 13 items. |
| Record Nr. | UNISA-996466244303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recent Advances in Natural Computing : Selected Results from the IWNC 8 Symposium / / edited by Yasuhiro Suzuki, Masami Hagiya
| Recent Advances in Natural Computing : Selected Results from the IWNC 8 Symposium / / edited by Yasuhiro Suzuki, Masami Hagiya |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Tokyo : , : Springer Japan : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (123 p.) |
| Disciplina | 620 |
| Collana | Mathematics for Industry |
| Soggetto topico |
Computational intelligence
Computer simulation Computer mathematics Statistics Bioinformatics Computational Intelligence Simulation and Modeling Computational Science and Engineering Statistics and Computing/Statistics Programs Computational Biology/Bioinformatics |
| ISBN | 4-431-55429-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-Organized 3D-Printing Patterns Simulated by Cellular Automata -- Cellular Automata Automatically Constructed from a Bioconvection Pattern -- A Comparison of Grouping Behaviors on Rule-Based and Learning-Based Multi-agent Systems -- Measurements of Negative Joint Probabilities in Optical Quantum System -- Brownian Motion Applied to Macroscopic Group Robots Without Mutual Communication -- Comparison of Tactile Score with Some Prescriptions in Artworks: From the Point of Media Transformation -- Drawing as the Relative Movement Between Subject and Medium: Using a Robot to Show the Subjectivity in Dynamic Flows of Consciousness -- Evolution of Honest Signal and Cry Wolf Signal in an Ecological system. |
| Record Nr. | UNINA-9910254178603321 |
| Tokyo : , : Springer Japan : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Recent Advances in Natural Computing : Selected Results from the IWNC 7 Symposium / / edited by Yasuhiro Suzuki, Masami Hagiya
| Recent Advances in Natural Computing : Selected Results from the IWNC 7 Symposium / / edited by Yasuhiro Suzuki, Masami Hagiya |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Tokyo : , : Springer Japan : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (139 p.) |
| Disciplina |
003.3
006.3 |
| Collana | Mathematics for Industry |
| Soggetto topico |
Computational intelligence
Computer simulation Computer mathematics Statistics Bioinformatics Computational Intelligence Simulation and Modeling Computational Science and Engineering Statistics and Computing/Statistics Programs Computational Biology/Bioinformatics |
| Soggetto genere / forma | Conference papers and proceedings. |
| ISBN | 4-431-55105-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent Developments on Reaction Automata Theory; A Survey -- Comparison of Two Interval Models for Fuzzy-valued Genetic Algorithm -- Convergence of asynchronous cellular automata (under null boundary condition) and their application in pattern classification -- Science, So Close and Yet So Far Away; How People View Science, Science Subjects and Scientists -- Towards Cyber-Phenomenology: Aesthetics and Natural Computing in Multi-Level Information Systems -- Toward Another Possible Visualization of Massaging; The First Short Step from Klee to Scientific Visualization -- The Generation of Emotional Transmission via Medium-Perceiving Drawing System and The Plasticity of Subjects -- Fat as Soft Architecture; The Spontaneous Transformation of Lipids into Organic Geometries with Predefined Biophysical Properties -- Breeding-Back of Goldfish as a Practice that Mediates Between Experimental Biology and Aesthetics. |
| Record Nr. | UNINA-9910299685903321 |
| Tokyo : , : Springer Japan : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical Aspects of Computer Software [[electronic resource] ] : International Symposium TACS ’94 Sendai, Japan, April 19–22, 1994 Proceedings / / edited by Masami Hagiya, John C. Mitchell
| Theoretical Aspects of Computer Software [[electronic resource] ] : International Symposium TACS ’94 Sendai, Japan, April 19–22, 1994 Proceedings / / edited by Masami Hagiya, John C. Mitchell |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XI, 892 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Application software Computer logic Programming languages (Electronic computers) Computer programming Software Engineering/Programming and Operating Systems Computer Applications Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Software Engineering Programming Techniques |
| ISBN | 3-540-48383-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Full Abstraction for PCF (extended abstract) -- Fully abstract semantics for concurrent ?-calculus -- An operational approach to combining classical set theory and functional programming languages -- ML typing, explicit polymorphism and qualified types -- Extensions to type systems can preserve operational equivalences -- Constraint programming and database query languages -- Intuitionistic resolution for a logic programming language with scoping constructs -- Proof by pointing -- A computer-checked verification of Milner's scheduler -- A purely functional language with encapsulated assignment -- Simple termination of hierarchical combinations of term rewriting systems -- Separate abstract interpretation for control-flow analysis -- Extensible denotational language specifications -- A normalizing calculus with overloading and subtyping -- A theory of primitive objects -- Programming objects with ML-ART an extension to ML with abstract and record types -- A type system for a lambda calculus with assignments -- Theory and practice of Concurrent Object-Oriented Computing -- The family relation in Interaction Systems -- On syntactic and semantic action refinement -- Locality and true-concurrency in calculi for mobile processes -- Term rewriting properties of SOS axiomatisations -- The tyft/tyxt format reduces to tree rules -- Undecidable equivalences for basic parallel processes -- Normal proofs and their grammar -- A symmetric lambda calculus for “classical” program extraction -- The ? ?-calculus -- Syntactic definitions of undefined: On defining the undefined -- Discovering needed reductions using type theory -- Nontraditional applications of automata theory -- Abstract pre-orders -- Categorical models of relational databases I: Fibrational formulation, schema integration -- Petri nets, Horn programs, Linear Logic, and vector games -- A complete type inference system for subtyped recursive types -- Subtyping with union types, intersection types and recursive types -- A decidable intersection type system based on relevance -- Temporal verification diagrams -- A semantic theory for Concurrent ML -- Replication in concurrent combinators -- Transitions as interrupts: A new semantics for timed statecharts -- Relating multifunctions and predicate transformers through closure operators -- Notes on typed object-oriented programming -- Observing truly concurrent processes. |
| Record Nr. | UNISA-996466267403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics [[electronic resource] ] : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
| Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics [[electronic resource] ] : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 636 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Programming languages (Electronic computers) Computers Computer graphics Computer communication systems Data Structures and Information Theory Programming Languages, Compilers, Interpreters Theory of Computation Data Structures Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44929-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Breaking and fixing the Needham-Schroeder public-key protocol using FDR -- Reconciling Two Views of Cryptography -- Theory and Construction of Molecular Computers -- Theory and Construction of Molecular Computers -- On the hardness of the permanent -- List Decoding: Algorithms and Applications -- Approximation Algorithms for String Folding Problems -- Approximation Algorithms for String Folding Problems -- Fast multi-dimensional approximate string matching -- An Index for Two Dimensional String Matching Allowing Rotations -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- Reducibility among combinatorial problems -- Task Distributions on Multiprocessor Systems -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Steganography Using Modern Arts -- Steganography Using Modern Arts -- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs -- Trade-Offs between Density and Robustness in Random Interconnection Graphs -- An effcient way for edge-connectivity augmentation -- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph -- On the Approximability of NP-complete Optimization Problems -- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem -- How Many People Can Hide in a Terrain ? -- Maximum Clique and Minimum Clique Partition in Visibility Graphs -- Language recognition and the synchronization of cellular automata -- Real-Time Language Recognition by Alternating Cellular Automata -- Inducing an order on cellular automata by a grouping operation -- Damage Spreading and ?-Sensitivity on Cellular Automata -- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods -- Discrepancy Theory and Its Application to Finance -- Fully consistent extensions of partially defined Boolean functions with missing bits -- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv -- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key -- Characterization of Optimal Key Set Protocols -- Algebraic Complexity Theory -- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model -- On Logarithmic Simulated Annealing -- On Logarithmic Simulated Annealing -- Specification and verification of concurrent programs in CESAR -- Hierarchical State Machines -- Validating firewalls in mobile ambients -- Ambient Groups and Mobility Types -- Multiway synchronization verified with coupled simulation -- An Asynchronous, Distributed Implementation of Mobile Ambients -- Graph types for monadic mobile processes -- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness -- Aliasing Models for Mobile Objects -- Local ?-Calculus at Work: Mobile Objects as Mobile Processes -- Typed concurrent objects -- An Interpretation of Typed Concurrent Objects in the Blue Calculus -- Inductive definitions in the system coq. rules and properties -- A Higher-Order Specification of the ?-Calculus -- Compositionality through an operational semantics of contexts -- Open Ended Systems, Dynamic Bisimulation and Tile Logic -- Observe behaviour categorically -- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems -- The Equivalence Problem for Deterministic Pushdown Automata is Decidable -- On the Complexity of Bisimulation Problems for Pushdown Automata -- Session 2.4 -- A Type-Theoretic Study on Partial Continuations -- Partially Typed Terms between Church-Style and Curry-Style -- Alternating Automata and Logics over Infinite Words -- Hypothesis Support for Information Integration in Four-Valued Logics -- Invited Talk 2.2 -- Masaccio: A Formal Model for Embedded Components -- Session 2.5 -- A Single Complete Refinement Rule for Demonic Specifications -- Reasoning about Composition Using Property Transformers and Their Conjugates -- Invited Talk 2.3 -- Some New Directions in the Syntax and Semantics of Formal Languages -- Panel Discussion on New Challanges for TCS -- New Challenges for Theoretical Computer Science -- Algorithm Design Challenges -- Quantumization of Theoretical Informatics -- Two Problems in Wide Area Network Programming -- New Challenges for Computational Models -- Towards a Computational Theory of Everything -- Open Lectures -- On the Power of Interactive Computing -- The Varieties of Programming Language Semantics. |
| Record Nr. | UNISA-996465430603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
| Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 636 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Programming languages (Electronic computers) Computers Computer graphics Computer communication systems Data Structures and Information Theory Programming Languages, Compilers, Interpreters Theory of Computation Data Structures Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44929-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Breaking and fixing the Needham-Schroeder public-key protocol using FDR -- Reconciling Two Views of Cryptography -- Theory and Construction of Molecular Computers -- Theory and Construction of Molecular Computers -- On the hardness of the permanent -- List Decoding: Algorithms and Applications -- Approximation Algorithms for String Folding Problems -- Approximation Algorithms for String Folding Problems -- Fast multi-dimensional approximate string matching -- An Index for Two Dimensional String Matching Allowing Rotations -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- Reducibility among combinatorial problems -- Task Distributions on Multiprocessor Systems -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Steganography Using Modern Arts -- Steganography Using Modern Arts -- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs -- Trade-Offs between Density and Robustness in Random Interconnection Graphs -- An effcient way for edge-connectivity augmentation -- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph -- On the Approximability of NP-complete Optimization Problems -- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem -- How Many People Can Hide in a Terrain ? -- Maximum Clique and Minimum Clique Partition in Visibility Graphs -- Language recognition and the synchronization of cellular automata -- Real-Time Language Recognition by Alternating Cellular Automata -- Inducing an order on cellular automata by a grouping operation -- Damage Spreading and ?-Sensitivity on Cellular Automata -- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods -- Discrepancy Theory and Its Application to Finance -- Fully consistent extensions of partially defined Boolean functions with missing bits -- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv -- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key -- Characterization of Optimal Key Set Protocols -- Algebraic Complexity Theory -- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model -- On Logarithmic Simulated Annealing -- On Logarithmic Simulated Annealing -- Specification and verification of concurrent programs in CESAR -- Hierarchical State Machines -- Validating firewalls in mobile ambients -- Ambient Groups and Mobility Types -- Multiway synchronization verified with coupled simulation -- An Asynchronous, Distributed Implementation of Mobile Ambients -- Graph types for monadic mobile processes -- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness -- Aliasing Models for Mobile Objects -- Local ?-Calculus at Work: Mobile Objects as Mobile Processes -- Typed concurrent objects -- An Interpretation of Typed Concurrent Objects in the Blue Calculus -- Inductive definitions in the system coq. rules and properties -- A Higher-Order Specification of the ?-Calculus -- Compositionality through an operational semantics of contexts -- Open Ended Systems, Dynamic Bisimulation and Tile Logic -- Observe behaviour categorically -- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems -- The Equivalence Problem for Deterministic Pushdown Automata is Decidable -- On the Complexity of Bisimulation Problems for Pushdown Automata -- Session 2.4 -- A Type-Theoretic Study on Partial Continuations -- Partially Typed Terms between Church-Style and Curry-Style -- Alternating Automata and Logics over Infinite Words -- Hypothesis Support for Information Integration in Four-Valued Logics -- Invited Talk 2.2 -- Masaccio: A Formal Model for Embedded Components -- Session 2.5 -- A Single Complete Refinement Rule for Demonic Specifications -- Reasoning about Composition Using Property Transformers and Their Conjugates -- Invited Talk 2.3 -- Some New Directions in the Syntax and Semantics of Formal Languages -- Panel Discussion on New Challanges for TCS -- New Challenges for Theoretical Computer Science -- Algorithm Design Challenges -- Quantumization of Theoretical Informatics -- Two Problems in Wide Area Network Programming -- New Challenges for Computational Models -- Towards a Computational Theory of Everything -- Open Lectures -- On the Power of Interactive Computing -- The Varieties of Programming Language Semantics. |
| Record Nr. | UNINA-9910767552203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional Computation [[electronic resource] ] : 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010, Proceedings / / edited by Christian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jonathan Timmis
| Unconventional Computation [[electronic resource] ] : 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010, Proceedings / / edited by Christian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jonathan Timmis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 195 p. 68 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Life sciences Computer programming Computer science Algorithms Machine theory Artificial Intelligence Life Sciences Programming Techniques Theory of Computation Formal Languages and Automata Theory |
| ISBN |
1-280-38702-5
9786613564948 3-642-13523-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Computations Inspired from the Brain -- Algebras and Languages for Molecular Programming -- A Computational Journey into Nonlinearity -- Computable Scientists, Uncomputable World -- Regular Contributions -- Finite State Transducers with Intuition -- Reversibility and Determinism in Sequential Multiset Rewriting -- Synchronization in P Modules -- On Universality of Radius 1/2 Number-Conserving Cellular Automata -- DNA Origami as Self-assembling Circuit Boards -- Tug-of-War Model for Multi-armed Bandit Problem -- Characterising Enzymes for Information Processing: Towards an Artificial Experimenter -- Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345 -- Solving Partial Differential Equation via Stochastic Process -- Postselection Finite Quantum Automata -- A New Representation of Chaitin ? Number Based on Compressible Strings -- Quantum Query Algorithms for Conjunctions -- Universal Continuous Variable Quantum Computation in the Micromaser -- Quantum Computation with Devices Whose Contents Are Never Read -- The Extended Glider-Eater Machine in the Spiral Rule -- Posters -- Formalizing the Behavior of Biological Processes with Mobility -- Quantum Finite State Automata over Infinite Words -- A Geometrical Allosteric DNA Switch -- Properties of “Planar Binary (Butchi Number)” -- Characterising Enzymes for Information Processing: Microfluidics for Autonomous Experimentation -- Inference with DNA Molecules -- A Network-Based Computational Model with Learning -- Image Processing with Neuron-Like Branching Elements (POSTER). |
| Record Nr. | UNISA-996466438403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||