LEADER 00000nam a22006255i 4500 
001    978-3-319-04298-5 
003    DE-He213 
005    20151204174224.0 
007    cr nn 008mamaa 
008    140120s2014    gw |    s    |||| 0|eng d 
020    9783319042985|9978-3-319-04298-5 
024 7  10.1007/978-3-319-04298-5|2doi 
040    |dES-ZaU 
072  7 PBD|2bicssc 
072  7 UYAM|2bicssc 
072  7 COM018000|2bisacsh 
072  7 MAT008000|2bisacsh 
082 04 004.0151|223 
245 00 SOFSEM 2014: Theory and Practice of Computer Science
       |h[electronic resource] :|b40th International Conference 
       on Current Trends in Theory and Practice of Computer 
       Science, Nový Smokovec, Slovakia, January 26-29, 2014, 
       Proceedings /|cedited by Viliam Geffert, Bart Preneel, 
       Branislav Rovan, Július ¿䵬ler, A Min Tjoa. 
264  1 Cham :|bSpringer International Publishing :|bImprint: 
       Springer,|c2014. 
300    XXIV, 528 p. 103 illus.|bonline resource. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
347    text file|bPDF|2rda 
490 1  Lecture Notes in Computer Science,|x0302-9743 ;|v8327 
490 0  Springer eBooks.|aComputer Science 
505 0  Invited Papers -- Open Services for Software Process 
       Compliance Engineering -- Episode-Centric Conceptual 
       Modeling -- Towards a Higher-Dimensional String Theory for
       the Modeling of Computerized Systems -- Advice Complexity:
       Quantitative Approach to A-Priori Information -- Matching 
       of Images of Non-Planar Objects with View Synthesis -- 
       Agile Requirements Engineering: A Research Perspective -- 
       Contributed Papers -- Fitting Planar Graphs on Planar Maps
       -- Minimum Activation Cost Node-Disjoint Paths in Graphs 
       with Bounded Treewidth -- Tight Bounds for the Advice 
       Complexity of the Online Minimum Steiner Tree Problem -- 
       On the Power of Advice and Randomization for the Disjoint 
       Path Allocation Problem -- Goal-Based Establishment of an 
       Information Security Management System Compliant to ISO 
       27001 -- ProofBook: An Online Social Network Based on 
       Proof-of-Work and Friend-Propagation -- Platform 
       Independent Software Development Monitoring: Design of an 
       Architecture -- Towards Unlocking the Full Potential of 
       Multileaf Collimators -- Parameterized Complexity of the 
       Sparsest k-Subgraph Problem in Chordal Graphs -- Error-
       Pruning in Interface Automata -- Aspect-Driven Design of 
       Information Systems -- Exact Algorithms to Clique-Colour 
       Graphs -- Supporting Non-Functional Requirements in 
       Services Software Development Process: an MDD Approach -- 
       Safety Contracts for Timed Reactive Components in SysML --
       Graph Clustering with Surprise: Complexity and Exact 
       Solutions -- On Lower Bounds for the Time and the Bit 
       Complexity of Some Probabilistic Distributed Graph 
       Algorithms -- Active Learning of Recursive Functions by 
       Ultrametric Algorithms -- Efficient Error-Correcting Codes
       for Sliding Windows -- Integrating UML Composite 
       Structures and fUML -- Deciding the Value 1 Problem for #-
       Acyclic Partially Observable Markov Decision Processes -- 
       Bidimensionality of Geometric Intersection Graphs -- 
       Attack Against a Pairing Based Anonymous Authentication 
       Protocol -- Finding Disjoint Paths in Split Graphs -- A 
       New Asymptotic Approximation Algorithm for 3-Dimensional 
       Strip Packing -- A Stronger Square Conjecture on Binary 
       Words -- DSL Based Platform for Business Process 
       Management -- Bounded Occurrence Edit Distance: A New 
       Metric for String Similarity Joins with Edit Distance 
       Constraints -- Deterministic Verification of Integer 
       Matrix Multiplication in Quadratic Time -- Comparison of 
       Genetic Algorithms for Trading Strategies -- Probabilistic
       Admissible Encoding on Elliptic Curves -Towards PACE with 
       Generalized Integrated Mapping -- An Algebraic Framework 
       for Modeling of Reactive Rule-Based Intelligent Agents -- 
       Parameterized Prefix Distance Between Regular Languages --
       Ordered Restarting Automata for Picture Languages -- Unary
       NFAs with Limited Nondeterminism -- Recommending for 
       Disloyal Customers with Low Consumption Rate -- Security 
       Constraints in Modeling of Access Control Rules for 
       Dynamic Information Systems -- A New Plane-Sweep Algorithm
       for the K-Closest-Pairs Query -- Mastering Erosion of 
       Software Architecture in Automotive Software Product Lines
       -- Shortest Unique Substrings Queries in Optimal Time -- 
       Oracle Pushdown Automata, Nondeterministic Reducibilities,
       and the Hierarchy over the Family of Context-Free 
       Languages. 
520    This book constitutes the refereed proceedings of the 40th
       International Conference on Current Trends in Theory and 
       Practice of Computer Science, SOFSEM 2014, held in Nový 
       Smokovec, Slovakia, in January 2014. The 40 revised full 
       papers presented in this volume were carefully reviewed 
       and selected from 104 submissions. The book also contains 
       6 invited talks. The contributions covers topics as: 
       Foundations of Computer Science, Software and Web 
       Engineering, as well as Data, Information, and Knowledge 
       Engineering, and Cryptography, Security, and Verification.
650  0 Computer science. 
650  0 Software engineering. 
650  0 Data structures (Computer science). 
650  0 Algorithms. 
650  0 Computer science|xMathematics. 
650  0 Information storage and retrieval. 
650  0 Artificial intelligence. 
650 14 Computer Science. 
650 24 Discrete Mathematics in Computer Science. 
650 24 Algorithm Analysis and Problem Complexity. 
650 24 Information Storage and Retrieval. 
650 24 Software Engineering. 
650 24 Artificial Intelligence (incl. Robotics). 
650 24 Data Structures. 
700 1  Geffert, Viliam.,|eeditor. 
700 1  Preneel, Bart.,|eeditor. 
700 1  Rovan, Branislav.,|eeditor. 
700 1  ¿䵬ler, Július.,|eeditor. 
700 1  Tjoa, A Min.,|eeditor. 
710 2  SpringerLink (Online service) 
773 0  |tSpringer eBooks 
776 08 |iPrinted edition:|z9783319042978 
830  0 Lecture Notes in Computer Science,|x0302-9743 ;|v8327 
856 40 |uhttps://cuarzo.unizar.es:9443/login?url=https://
       dx.doi.org/10.1007/978-3-319-04298-5|zAcceso al texto 
       completo