000 06275nam a22006495i 4500
001 978-3-319-04298-5
003 DE-He213
005 20200421111205.0
007 cr nn 008mamaa
008 140120s2014 gw | s |||| 0|eng d
020 _a9783319042985
_9978-3-319-04298-5
024 7 _a10.1007/978-3-319-04298-5
_2doi
050 4 _aQA76.9.M35
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aSOFSEM 2014: Theory and Practice of Computer Science
_h[electronic resource] :
_b40th International Conference on Current Trends in Theory and Practice of Computer Science, Nov�y Smokovec, Slovakia, January 26-29, 2014, Proceedings /
_cedited by Viliam Geffert, Bart Preneel, Branislav Rovan, J�ulius Štuller, A Min Tjoa.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXXIV, 528 p. 103 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8327
505 0 _aInvited 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 _aThis 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�y 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 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aInformation storage and retrieval.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aSoftware Engineering.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aData Structures.
700 1 _aGeffert, Viliam.
_eeditor.
700 1 _aPreneel, Bart.
_eeditor.
700 1 _aRovan, Branislav.
_eeditor.
700 1 _aŠtuller, J�ulius.
_eeditor.
700 1 _aTjoa, A Min.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319042978
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8327
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-04298-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54119
_d54119