東華大學圖書館 |

SOFSEM 2016 = theory and practice of computer science : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	SOFSEM 2016/ edited by Rusins Martins Freivalds, Gregor Engels, Barbara Catania.
其他題名:	theory and practice of computer science : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016 : proceedings /
其他題名:	SOFSEM 2016
其他作者:	Freivalds, Rusins Martins.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2016.,
面頁冊數:	xv, 630 p. :ill., digital ;24 cm.
內容註:	Foundations of Computer Science -- Cryptography in a Quantum World -- Relating Sublinear Space Computability among Graph Connectivity and Related Problems -- Learning Automatic Families of Languages -- Software Engineering: Methods, Tools, Applications From ESSENCE to Theory Oriented Software Engineering -- Incremental Queries and Transformations: From Concepts to Industrial Applications -- Data, Information, and Knowledge Engineering Big Sequence Management: A Glimpse on the Past, the Present, and the Future -- Pay-as-you-go Data Integration: Experiences and Recurring Themes -- Foundations of Computer Science -- Robust Recoverable Path Using Backup Nodes -- On Contact Graphs with Cubes and Proportional Boxes -- Orthogonal Layout with Optimal Face Complexity -- L-Drawings of Directed Graphs -- A Combinatorial Model of Two-sided Search -- On the Power of Laconic Advice in Communication Complexity -- Using Attribute Grammars to Model Nested Workflows with Extra Constraints -- A Natural Counting of Lambda Terms -- Online Minimum Spanning Tree with Advice -- Subsequence Automata with Default Transitions -- Run-Time Checking Multi-threaded Java Programs -- Online Graph Coloring with Advice and Randomized Adversary -- Pseudoknot-Generating Operation -- Capabilities of Ultrametric Automata with One, Two, and Three States -- The Complexity of Paging Against a Probabilistic Adversary -- On Parity Game Preorders and the Logic of Matching Plays -- A PTAS for Scheduling Unrelated Machines of Few Different Types -- Compacting a Dynamic Edit Distance Table by RLE Compression -- Walking Automata in Free Inverse Monoids -- Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique -- Grover's Search with Faults on Some Marked Elements -- Reachability problems for PAMs -- On the Effects of Nondeterminism on Ordered Restarting Automata -- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations -- How to Smooth Entropy? -- Bounded TSO-to-SC Linearizability is Decidable -- Probabilistic Autoreductions -- Software Engineering: Methods, Tools, Applications ABS: A High-Level Modeling Language for Cloud-Aware Programming -- Aspect, Rich, and Anemic Domain Models in Enterprise Information Systems -- Finding Optimal Compatible Set of Software Components Using Integer Linear Programming -- Effective Parallel Multicore-optimized K-mers Counting Algorithm -- Meta-Evolution Style for Software Architecture Evolution -- The Simulation Relation for Formal e-contracts -- Data, Information, and Knowledge Engineering Solving the Problem of Selecting Suitable Objective Measures by Clustering Association Rules through the Measures Themselves -- Survey On Concern Separation in Service Integration -- Utilizing Vector Models for Automatic Text Lemmatization -- Improving Keyword Extraction from Movie Subtitles by Utilizing Temporal Properties -- Identification of Navigation Lead Candidates Using Citation and Co-Citation Analysis -- Summarizing Online User Reviews Using Bicliques -- Post-Processing Association Rules: a Network Based Label Propagation Approach -- Application of Multiple Sound Representations in Multipitch Estimation Using Shift-Invariant Probabilistic Latent Component Analysis -- Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams -- Evaluation of Static/Dynamic Cache for Similarity Search Engines.
Contained By:	Springer eBooks
標題:	Computer science -
電子資源:	http://dx.doi.org/10.1007/978-3-662-49192-8
ISBN:	9783662491928$q(electronic bk.)

SOFSEM 2016 = theory and practice of computer science : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016 : proceedings /
SOFSEM 2016theory and practice of computer science : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016 : proceedings /[electronic resource] :SOFSEM 2016edited by Rusins Martins Freivalds, Gregor Engels, Barbara Catania. - Berlin, Heidelberg :Springer Berlin Heidelberg :2016. - xv, 630 p. :ill., digital ;24 cm. - Lecture notes in computer science,95870302-9743 ;. - Lecture notes in computer science ;5353..

Foundations of Computer Science -- Cryptography in a Quantum World -- Relating Sublinear Space Computability among Graph Connectivity and Related Problems -- Learning Automatic Families of Languages -- Software Engineering: Methods, Tools, Applications From ESSENCE to Theory Oriented Software Engineering -- Incremental Queries and Transformations: From Concepts to Industrial Applications -- Data, Information, and Knowledge Engineering Big Sequence Management: A Glimpse on the Past, the Present, and the Future -- Pay-as-you-go Data Integration: Experiences and Recurring Themes -- Foundations of Computer Science -- Robust Recoverable Path Using Backup Nodes -- On Contact Graphs with Cubes and Proportional Boxes -- Orthogonal Layout with Optimal Face Complexity -- L-Drawings of Directed Graphs -- A Combinatorial Model of Two-sided Search -- On the Power of Laconic Advice in Communication Complexity -- Using Attribute Grammars to Model Nested Workflows with Extra Constraints -- A Natural Counting of Lambda Terms -- Online Minimum Spanning Tree with Advice -- Subsequence Automata with Default Transitions -- Run-Time Checking Multi-threaded Java Programs -- Online Graph Coloring with Advice and Randomized Adversary -- Pseudoknot-Generating Operation -- Capabilities of Ultrametric Automata with One, Two, and Three States -- The Complexity of Paging Against a Probabilistic Adversary -- On Parity Game Preorders and the Logic of Matching Plays -- A PTAS for Scheduling Unrelated Machines of Few Different Types -- Compacting a Dynamic Edit Distance Table by RLE Compression -- Walking Automata in Free Inverse Monoids -- Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique -- Grover's Search with Faults on Some Marked Elements -- Reachability problems for PAMs -- On the Effects of Nondeterminism on Ordered Restarting Automata -- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations -- How to Smooth Entropy? -- Bounded TSO-to-SC Linearizability is Decidable -- Probabilistic Autoreductions -- Software Engineering: Methods, Tools, Applications ABS: A High-Level Modeling Language for Cloud-Aware Programming -- Aspect, Rich, and Anemic Domain Models in Enterprise Information Systems -- Finding Optimal Compatible Set of Software Components Using Integer Linear Programming -- Effective Parallel Multicore-optimized K-mers Counting Algorithm -- Meta-Evolution Style for Software Architecture Evolution -- The Simulation Relation for Formal e-contracts -- Data, Information, and Knowledge Engineering Solving the Problem of Selecting Suitable Objective Measures by Clustering Association Rules through the Measures Themselves -- Survey On Concern Separation in Service Integration -- Utilizing Vector Models for Automatic Text Lemmatization -- Improving Keyword Extraction from Movie Subtitles by Utilizing Temporal Properties -- Identification of Navigation Lead Candidates Using Citation and Co-Citation Analysis -- Summarizing Online User Reviews Using Bicliques -- Post-Processing Association Rules: a Network Based Label Propagation Approach -- Application of Multiple Sound Representations in Multipitch Estimation Using Shift-Invariant Probabilistic Latent Component Analysis -- Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams -- Evaluation of Static/Dynamic Cache for Similarity Search Engines.

This book constitutes the proceedings of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016, held in Harrachov, Czech Republic, in January 2016. The 43 full papers presented in this volume were carefully reviewed and selected from 116 submissions. They are organized in topical sections named: foundations of computer science; software engineering: methods, tools, applications; and data, information, and knowledge engineering. The volume also contains 7 invited talks in full paper length.

ISBN: 9783662491928$q(electronic bk.)

Standard No.: 10.1007/978-3-662-49192-8doiSubjects--Topical Terms:

893650
Computer science

LC Class. No.: QA75.5 / .S66 2016

Dewey Class. No.: 004

SOFSEM 2016 = theory and practice of computer science : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016 : proceedings /
LDR:05257nmm a2200361 a 4500 001 2030254
003 DE-He213
005 20160817140516.0
006 m d
007 cr nn 008maaau
008 160908s2016 gw s 0 eng d
020 $a 9783662491928$q(electronic bk.)
020 $a 9783662491911$q(paper)
024 7 $a 10.1007/978-3-662-49192-8 $2 doi
035 $a 978-3-662-49192-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5 $b .S66 2016
072 7 $a PBD $2 bicssc
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT008000 $2 bisacsh
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .S681 2016
245 1 0 $a SOFSEM 2016 $h [electronic resource] : $b theory and practice of computer science : 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016 : proceedings / $c edited by Rusins Martins Freivalds, Gregor Engels, Barbara Catania.
246 3 $a SOFSEM 2016
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2016.
300 $a xv, 630 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9587
505 0 $a Foundations of Computer Science -- Cryptography in a Quantum World -- Relating Sublinear Space Computability among Graph Connectivity and Related Problems -- Learning Automatic Families of Languages -- Software Engineering: Methods, Tools, Applications From ESSENCE to Theory Oriented Software Engineering -- Incremental Queries and Transformations: From Concepts to Industrial Applications -- Data, Information, and Knowledge Engineering Big Sequence Management: A Glimpse on the Past, the Present, and the Future -- Pay-as-you-go Data Integration: Experiences and Recurring Themes -- Foundations of Computer Science -- Robust Recoverable Path Using Backup Nodes -- On Contact Graphs with Cubes and Proportional Boxes -- Orthogonal Layout with Optimal Face Complexity -- L-Drawings of Directed Graphs -- A Combinatorial Model of Two-sided Search -- On the Power of Laconic Advice in Communication Complexity -- Using Attribute Grammars to Model Nested Workflows with Extra Constraints -- A Natural Counting of Lambda Terms -- Online Minimum Spanning Tree with Advice -- Subsequence Automata with Default Transitions -- Run-Time Checking Multi-threaded Java Programs -- Online Graph Coloring with Advice and Randomized Adversary -- Pseudoknot-Generating Operation -- Capabilities of Ultrametric Automata with One, Two, and Three States -- The Complexity of Paging Against a Probabilistic Adversary -- On Parity Game Preorders and the Logic of Matching Plays -- A PTAS for Scheduling Unrelated Machines of Few Different Types -- Compacting a Dynamic Edit Distance Table by RLE Compression -- Walking Automata in Free Inverse Monoids -- Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique -- Grover's Search with Faults on Some Marked Elements -- Reachability problems for PAMs -- On the Effects of Nondeterminism on Ordered Restarting Automata -- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations -- How to Smooth Entropy? -- Bounded TSO-to-SC Linearizability is Decidable -- Probabilistic Autoreductions -- Software Engineering: Methods, Tools, Applications ABS: A High-Level Modeling Language for Cloud-Aware Programming -- Aspect, Rich, and Anemic Domain Models in Enterprise Information Systems -- Finding Optimal Compatible Set of Software Components Using Integer Linear Programming -- Effective Parallel Multicore-optimized K-mers Counting Algorithm -- Meta-Evolution Style for Software Architecture Evolution -- The Simulation Relation for Formal e-contracts -- Data, Information, and Knowledge Engineering Solving the Problem of Selecting Suitable Objective Measures by Clustering Association Rules through the Measures Themselves -- Survey On Concern Separation in Service Integration -- Utilizing Vector Models for Automatic Text Lemmatization -- Improving Keyword Extraction from Movie Subtitles by Utilizing Temporal Properties -- Identification of Navigation Lead Candidates Using Citation and Co-Citation Analysis -- Summarizing Online User Reviews Using Bicliques -- Post-Processing Association Rules: a Network Based Label Propagation Approach -- Application of Multiple Sound Representations in Multipitch Estimation Using Shift-Invariant Probabilistic Latent Component Analysis -- Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams -- Evaluation of Static/Dynamic Cache for Similarity Search Engines.
520 $a This book constitutes the proceedings of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016, held in Harrachov, Czech Republic, in January 2016. The 43 full papers presented in this volume were carefully reviewed and selected from 116 submissions. They are organized in topical sections named: foundations of computer science; software engineering: methods, tools, applications; and data, information, and knowledge engineering. The volume also contains 7 invited talks in full paper length.
650 0 $a Computer science $3 893650
650 0 $a Software engineering $v Congresses. $3 1243492
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Information Storage and Retrieval. $3 761906
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a Data Encryption. $3 891254
700 1 $a Freivalds, Rusins Martins. $3 2181738
700 1 $a Engels, Gregor. $3 1245613
700 1 $a Catania, Barbara. $3 2054712
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-49192-8
950 $a Computer Science (Springer-11645)