SOFSEM 2007 - Theory and Practice of Computer Science : 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 2007 - Proceedings

by Leeuwen, J. Van; Italiano, Giuseppe F.; Van Der Hoek, Wiebe; Meinel, Christoph; Sack, Harald

• ISBN13: 9783540695066
• ISBN10: 3540695060
• Format: Paperback
• Copyright: 2007-03-06
• Publisher: Springer-Verlag New York Inc

Summary

This book constitutes the refereed proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007, held in Harrachov, Czech Republic in January 2007. The 69 revised full papers, presented together with 11 invited contributions were carefully reviewed and selected from 283 submissions. The papers were organized in four topical tracks on foundations of computer science, multi-agent systems, emerging Web technologies, as well as dependable software and systems.

Table of Contents

Graphs from search engine queries	p. 1
Model-checking large finite-state systems and beyond	p. 9
Interaction and readability	p. 29
A short introduction to computational social choice	p. 51
Distributed models and algorithms for mobile robot systems	p. 70
Point-to-point shortest path algorithms with preprocessing	p. 88
Games, time, and probability : graph models for system design and analysis	p. 103
Agreement technologies	p. 111
Automatic testing of object-oriented software	p. 114
Architecture-based reasoning about performability in component-based systems	p. 130
Multimedia retrieval algorithmics	p. 138
Size of quantum finite state transducers	p. 155
Weighted nearest neighbor algorithms for the graph exploration problem on cycles	p. 164
Straightening drawings of clustered hierarchical graphs	p. 176
Improved upper bounds for [lambda]-backbone colorings along matching and stars	p. 188
About the termination detection in the asynchronous message passing model	p. 200
Fast approximate point set matching for information retrieval	p. 212
A software architecture for shared resource management in mobile ad hoc networks	p. 224
Compressed prefix sums	p. 235
On optimal solutions for the bottleneck tower of Hanoi problem	p. 248
Competitive maintenance of minimum spanning trees in dynamic graphs	p. 260
Exact max 2-SAT : easier and faster	p. 272
Maximum finding in the symmetric radio networks with collision detection	p. 284
An approach to modelling and verification of component based systems	p. 295
Improved undecidability results on the emptiness problem of probabilistic and quantum cut-point languages	p. 309
On the (high) undecidability of distributed synthesis problems	p. 320
Maximum rigid components as means for direction-based localization in sensor networks	p. 330
Online service management algorithm for cellular/WALN multimedia networks	p. 342
A simple algorithm for stable minimum storage merging	p. 347
Generating high dimensional data and query sets	p. 357
Partial vs. complete domination : t-dominating set	p. 367
Estimates of data complexity in neural-network learning	p. 377
Concurrent and located synchronizations in [pi]-calculus	p. 388
Efficient group key agreement for dynamic TETRA networks	p. 400
Algorithmic aspects of minimum energy edge-disjoint paths in wireless networks	p. 410
The P[subscript k] partition problem and related problems in bipartite graphs	p. 422
Spatial selection of sparse pivots for similarity search in metric spaces	p. 434
A model of an amorphous computer and its communication protocol	p. 446
A branch-and-bound algorithm to solve large scale integer quadratic multi-knapsack problems	p. 456
Indexing factors with gaps	p. 465
Information efficiency	p. 475
Deterministic simulation of a NFA with k-symbol lookahead	p. 488
Mobility management using virtual domain in IPv6-based cellular networks	p. 498
Restarting tree automata	p. 510
A polynomial time constructible hitting set for restricted 1-branching programs of width 3	p. 522
Formal translation directed by parallel LLP parsing	p. 532
Self-adaptive Lagrange relaxation algorithm for aggregated multicast	p. 544
A language for reliable service composition	p. 554
Operational semantics of framed temporal logic programs	p. 566
Constraints for argument filterings	p. 579
Performance analysis of a multiagent architecture for passenger transportation	p. 591
Teacher-directed learning with mixture of experts for view-independent face recognition	p. 601
FTTH-enhanced mini-system mTBCP-based overlay construction and evaluation	p. 612
On efficient resource allocation in communication networks	p. 624
Protecting agent from attack in grid computing[superscript III]	p. 636
Incremental learning of planning operators in stochastic domains	p. 644
Competitive contract net protocol	p. 656
Agent oriented methodology construction and customization with HDA	p. 669
Building an ontological base for experimental evaluation of semantic Web applications	p. 682
Semantic Web approach in designing a collaborative e-item bank system	p. 693
A hybrid region weighting approach for relevance feedback in region-based image search on the Web	p. 705
Rapid development of Web interfaces to heterogeneous systems	p. 716
Enhancing security by embedding biometric data in IP header	p. 726
Runtime-efficient approach for multiple continuous filtering in XML message brokers	p. 738
A semantic peer-to-peer overlay for Web services discovery	p. 750
Multi-document summarization based on cluster using non-negative matrix factorization	p. 761
A program slicing based method to filter XML/DTD documents	p. 771
A hybrid approach for XML similarity	p. 783
Personalized presentation in Web-based information systems	p. 796
Immune-inspired online method for service interactions detection	p. 808
Separation of concerns and consistent integration in requirements modelling	p. 819
Checking interaction consistency in MARMOT component refinements	p. 832
Towards a versatile contract model to organize behavioral specifications	p. 844
Improved processing of textual use cases : deriving behavior specifications	p. 856
A dialogue-based NLIDB system in a schedule management domain	p. 869
Experimental assessment of the practicality of a fault-tolerant system	p. 878
A polynomial-time checkable sufficient condition for deadlock-freedom of component-based systems	p. 888
Extracting Zing models from C source code	p. 900
Parameterised extra-functional prediction of component-based control systems - industrial experience	p. 911
Explicit connectors in component based software engineering for distributed embedded systems	p. 923
Table of Contents provided by Blackwell. All Rights Reserved.