國立虎尾科技大學 |

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: Theory and Practice of Computer Science/ edited by Rūsiņš Mārtiņš Freivalds, Gregor Engels, Barbara Catania.
其他題名:	42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings /
其他作者:	Freivalds, Rūsiņš Mārtiņš.
面頁冊數:	XV, 630 p. 150 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer science—Mathematics. -
電子資源:	https://doi.org/10.1007/978-3-662-49192-8
ISBN:	9783662491928

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 2016: Theory and Practice of Computer Science42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings /[electronic resource] :edited by Rūsiņš Mārtiņš Freivalds, Gregor Engels, Barbara Catania. - 1st ed. 2016. - XV, 630 p. 150 illus. in color.online resource. - Theoretical Computer Science and General Issues ;9587. - Theoretical Computer Science and General Issues ;9163.

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

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

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

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:05579nam a22004215i 4500 001 981226
003 DE-He213
005 20200705165710.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783662491928 $9 978-3-662-49192-8
024 7 $a 10.1007/978-3-662-49192-8 $2 doi
035 $a 978-3-662-49192-8
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a SOFSEM 2016: Theory and Practice of Computer Science $h [electronic resource] : $b 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings / $c edited by Rūsiņš Mārtiņš Freivalds, Gregor Engels, Barbara Catania.
250 $a 1st ed. 2016.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2016.
300 $a XV, 630 p. 150 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $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—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Information storage and retrieval. $3 1069252
650 0 $a Software engineering. $3 562952
650 0 $a Artificial intelligence. $3 559380
650 0 $a Data encryption (Computer science). $3 1051084
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Information Storage and Retrieval. $3 593926
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Cryptology. $3 1211076
700 1 $a Freivalds, Rūsiņš Mārtiņš. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1273727
700 1 $a Engels, Gregor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1104674
700 1 $a Catania, Barbara. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1019754
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662491911
776 0 8 $i Printed edition: $z 9783662491935
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-662-49192-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)