SOFSEM 2007: Theory and Practice of Computer Science: 33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, ProceedingsJan Leeuwen 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. |
Contents
Graphs from Search Engine Queries | 1 |
ModelChecking Large FiniteState Systems and Beyond | 9 |
Interaction and Realizability | 29 |
A Short Introduction to Computational Social Choice | 51 |
Distributed Models and Algorithms for Mobile Robot Systems | 70 |
PointtoPoint Shortest Path Algorithms with Preprocessing | 88 |
Graph Models for System Design and Analysis | 103 |
Agreement Technologies | 111 |
Mobility Management Using Virtual Domain in IPv6Based Cellular Networks | 498 |
Restarting Tree Automata | 510 |
A Polynomial Time Constructible Hitting Set for Restricted 1Branching Programs of Width 3 | 522 |
Formal Translation Directed by Parallel LLP Parsing | 532 |
Selfadaptive Lagrange Relaxation Algorithm for Aggregated Multicast | 544 |
A Language for Reliable Service Composition | 554 |
Operational Semantics of Framed Temporal Logic Programs | 566 |
Constraints for Argument Filterings | 579 |
ArchitectureBased Reasoning About Performability in ComponentBased Systems | 130 |
Multimedia Retrieval Algorithmics | 138 |
Size of Quantum Finite State Transducers | 155 |
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles | 164 |
Straightening Drawings of Clustered Hierarchical Graphs | 176 |
Improved Upper Bounds for λBackbone Colorings Along Matchings and Stars | 188 |
About the Termination Detection in the Asynchronous Message Passing Model | 200 |
Fast Approximate Point Set Matching for Information Retrieval | 212 |
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks | 224 |
Compressed Prefix Sums | 235 |
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem | 248 |
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs | 260 |
Easier and Faster | 272 |
Maximum Finding in the Symmetric Radio Networks with Collision Detection | 284 |
An Approach to Modelling and Verification of Component Based Systems | 295 |
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum CutPoint Languages | 309 |
On the High Undecidability of Distributed Synthesis Problems | 320 |
Maximum Rigid Components as Means for DirectionBased Localization in Sensor Networks | 330 |
Online Service Management Algorithm for CellularWALN Multimedia Networks | 342 |
A Simple Algorithm for Stable Minimum Storage Merging | 347 |
Generating High Dimensional Data and Query Sets | 357 |
tDominating Set | 367 |
Estimates of Data Complexity in NeuralNetwork Learning | 377 |
Concurrent and Located Synchronizations in πCalculus | 388 |
Efficient Group Key Agreement for Dynamic TETRA Networks | 400 |
Algorithmic Aspects of Minimum Energy EdgeDisjoint Paths in Wireless Networks | 410 |
The Pk Partition Problem and Related Problems in Bipartite Graphs | 422 |
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces | 434 |
A Model of an Amorphous Computer and Its Communication Protocol | 446 |
A BranchandBound Algorithm to Solve Large Scale Integer Quadratic MultiKnapsack Problems | 456 |
Indexing Factors with Gaps | 465 |
Information Efficiency | 475 |
Deterministic Simulation of a NFA with kSymbol Lookahead | 488 |
Performance Analysis of a Multiagent Architecture for Passenger Transportation | 591 |
TeacherDirected Learning with Mixture of Experts for ViewIndependent Face Recognition | 601 |
FTTHEnhanced MiniSystem mTBCPBased Overlay Construction and Evaluation | 612 |
On Efficient Resource Allocation in Communication Networks | 624 |
Protecting Agent from Attack in Grid Computing | 636 |
Incremental Learning of Planning Operators in Stochastic Domains | 644 |
Competitive Contract Net Protocol | 656 |
Agent Oriented Methodology Construction and Customization with HDA | 669 |
Building an Ontological Base for Experimental Evaluation of Semantic Web Applications | 682 |
Semantic Web Approach in Designing a Collaborative EItem Bank System | 693 |
A Hybrid Region Weighting Approach for Relevance Feedback in RegionBased Image Search on theWeb | 705 |
Rapid Development of Web Interfaces to Heterogeneous Systems | 716 |
Enhancing Security by Embedding Biometric Data in IP Header | 726 |
RuntimeEfficient Approach for Multiple Continuous Filtering in XML Message Brokers | 738 |
A Semantic PeertoPeer Overlay for Web Services Discovery | 750 |
Multidocument Summarization Based on Cluster Using Nonnegative Matrix Factorization | 761 |
A Program Slicing Based Method to Filter XMLDTD Documents | 771 |
A Hybrid Approach for XML Similarity | 783 |
Personalized Presentation in WebBased Information Systems | 796 |
ImmuneInspired Online Method for Service Interactions Detection | 808 |
Separation of Concerns and Consistent Integration in Requirements Modelling | 819 |
Checking Interaction Consistency in MARMOT Component Refinements | 832 |
Towards a Versatile Contract Model to Organize Behavioral Specifications | 844 |
DerivingBehavior Specifications | 856 |
A DialogueBased NLIDB System in a Schedule Management Domain | 869 |
Experimental Assessment of the Practicality of a FaultTolerant System | 878 |
A PolynomialTime Checkable Sufficient Condition for DeadlockFreedom of ComponentBased Systems | 888 |
Extracting Zing Models from C Source Code | 900 |
Parameterised ExtraFunctional Prediction of ComponentBased Control Systems Industrial Experience | 911 |
Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems | 923 |
| 935 | |
Other editions - View all
Common terms and phrases
action agents algorithm application approach architecture assignment behavior bound called changing checking cluster color communication complexity component Computer condition consider consists construct contains contract corresponding data structure defined denote described different direction distance distributed documents edge elements evaluation example exists experts first function given graph implementation initial input instance integrated interaction label language layer length machine matching means method node Note objects operation optimal output path performance position possible present problem Proceedings Proof properties proposed query References represent respect robots rules Science selected semantic sequence similarity Software space specific step string structure symbols techniques Theorem transition tree variables vertex vertices weight