SOFSEM 2002: Theory and Practice of Informatics

29th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 22-29, 2002, Proceedings
Author: William I. Grosky,Frantisek Plasil
Publisher: Springer
ISBN: 3540361375
Category: Computers
Page: 294
View: 2591

Continue Reading →

Forthe29thtime,SOFSEM(SOFtwareSEMinar)washeld.Havingtransformed over the years from a local event to a fully international conference, the c- temporary SOFSEM is a mix of a winter school and a conference striving for multidisciplinarity in computer science, accompaniedby workshops dedicated to a narrow ?eld (this year multimedia and softcomputing) and a student forum. This volume constitutes the proceedings of SOFSEM 2002 held in Milovy, Czech Republic, November 22–29, 2002. This year, 23 papers were submitted from 11 countries. The selection of the 11 best papers accepted by the Program Committee was based on their contribution to the state of the art, technical soundness, clarity of presentation, and relevance of bibliography. The Steering Committee supported by the Advisory Board recommended 12 invited talks focusedonthefollowingkeytopicareas:distributedandparallelsystems,system design and testing, databases and information systems, and fundamentals. SOFSEM is the result of considerable e?ort by a number of people. It is our pleasure to record our thanks to the Advisory Board for its support, to the Steering Committee for its general guidance, and to the Organizing Committee for making SOFSEM 2002 happen. It has been an honor for us to work with the members of the Program Committee and other referees who devoted a lot of e?ort to reviewing the submitted papers.

SOFSEM 2004: Theory and Practice of Computer Science

30th Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 24-30, 2004
Author: Peter Van Emde Boas,Jaroslav Pokorny,Maria Bielikova,Julius Stuller
Publisher: Springer
ISBN: N.A
Category: Computers
Page: 385
View: 4639

Continue Reading →

This book constitutes the refereed proceedings of the 30th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2004, held in Merín, Czech Republic, in January 2004. The volume presents 10 invited lectures and 22 full papers selected from 136 submissions. Among the topics covered are computer science theory, programming theory, database systems, information systems, cognitive technologies and Web technologies.

ERCIM/CologNet 2002


Author: Barry O'Sullivan
Publisher: Springer Science & Business Media
ISBN: 3540009868
Category: Business & Economics
Page: 199
View: 9784

Continue Reading →

This book constitutes the thoroughly refereed post-proceedings of the Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, held in Cork, Ireland in June 2002. The 14 revised full papers presented were carefully selected for inclusion in the book during two rounds of reviewing and revision. Among the topics addressed are verification and debugging of constraint logic programs, modeling and solving CSPs, explanation generation, inference and inconsistency processing, SAT and 0/1 encodings of CSPs, soft constraints and constraint relaxation, real-world applications, and distributed constraint solving.

IUTAM Symposium on Evolutionary Methods in Mechanics

Proceedings of the IUTAM Symposium held in Cracow, Poland, 24–27 September, 2002
Author: Tadeusz Burczynski,Andrzej Osyczka
Publisher: Springer Science & Business Media
ISBN: 1402022670
Category: Science
Page: 366
View: 1087

Continue Reading →

Proceedings of the IUTAM Symposium held in Cracow, Poland, 24-27 September 2002

Integrated Region-Based Image Retrieval


Author: James Z. Wang
Publisher: Springer Science & Business Media
ISBN: 9780792373506
Category: Computers
Page: 178
View: 1568

Continue Reading →

The need for efficient content-based image retrieval has increased tremendously in areas such as biomedicine, military, commerce, education, and Web image classification and searching. In the biomedical domain, content-based image retrieval can be used in patient digital libraries, clinical diagnosis, searching of 2-D electrophoresis gels, and pathology slides. Integrated Region-Based Image Retrieval presents a wavelet-based approach for feature extraction, combined with integrated region matching. An image in the database, or a portion of an image, is represented by a set of regions, roughly corresponding to objects, which are characterized by color, texture, shape, and location. A measure for the overall similarity between images is developed as a region-matching scheme that integrates properties of all the regions in the images. The advantage of using this "soft matching" is that it makes the metric robust to poor segmentation, an important property that previous research has not solved. Integrated Region-Based Image Retrieval demonstrates an experimental image retrieval system called SIMPLIcity (Semantics-sensitive Integrated Matching for Picture LIbraries). This system validates these methods on various image databases, proving that such methods perform much better and much faster than existing ones. The system is exceptionally robust to image alterations such as intensity variation, sharpness variation, intentional distortions, cropping, shifting, and rotation. These features are extremely important to biomedical image databases since visual features in the query image are not exactly the same as the visual features in the images in the database. Integrated Region-Based Image Retrieval is an excellent reference for researchers in the fields of image retrieval, multimedia, computer vision and image processing.

Deadline Scheduling for Real-Time Systems

EDF and Related Algorithms
Author: John A. Stankovic,Marco Spuri,Krithi Ramamritham,Giorgio C Buttazzo
Publisher: Springer Science & Business Media
ISBN: 1461555353
Category: Computers
Page: 273
View: 2480

Continue Reading →

Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static scheduling algorithms are quite restrictive and inflexible. For example, highly automated agile manufacturing, command, control and communications, and distributed real-time multimedia applications all operate over long lifetimes and in highly non-deterministic environments. Dynamic real-time scheduling algorithms are more appropriate for these systems and are used in such systems. Many of these algorithms are based on earliest deadline first (EDF) policies. There exists a wealth of literature on EDF-based scheduling with many extensions to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processors, and distributed systems. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all-inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult. In general, it is very difficult to codify and taxonomize scheduling knowledge because there are many performance metrics, task characteristics, and system configurations. Also, adding to the complexity is the fact that a variety of algorithms have been designed for different combinations of these considerations. In spite of the recent advances there are still gaps in the solution space and there is a need to integrate the available solutions. For example, a list of issues to consider includes: preemptive versus non-preemptive tasks, uni-processors versus multi-processors, using EDF at dispatch time versus EDF-based planning, precedence constraints among tasks, resource constraints, periodic versus aperiodic versus sporadic tasks, scheduling during overload, fault tolerance requirements, and providing guarantees and levels of guarantees (meeting quality of service requirements). Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline-based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field.

Jewels of Stringology

Text Algorithms
Author: Maxime Crochemore,Wojciech Rytter
Publisher: World Scientific
ISBN: 9789810248970
Category: Algorithms
Page: 310
View: 4367

Continue Reading →

The term ?stringology? is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as ?algorithmic jewels? and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.

Syntax-Directed Semantics

Formal Models Based on Tree Transducers
Author: Zoltan Fülöp,Heiko Vogler
Publisher: Springer Science & Business Media
ISBN: 3642722482
Category: Mathematics
Page: 269
View: 6242

Continue Reading →

This is a motivated presentation of recent results on tree transducers, applied to studying the general properties of formal models and for providing semantics to context-free languages. The authors consider top-down tree transducers, macro tree transducers, attributed tree transducers, and macro attributed tree transducers. A unified terminology is used to define them, and their transformational capacities are compared. This handbook on tree transducers will serve as a base for further research.

Search Theory

A Game Theoretic Perspective
Author: Steve Alpern,Robbert Fokkink,Leszek Gąsieniec,Roy Lindelauf,V.S. Subrahmanian
Publisher: Springer Science & Business Media
ISBN: 1461468256
Category: Computers
Page: 303
View: 1546

Continue Reading →

Search games and rendezvous problems have received growing attention in computer science within the past few years. Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory. Furthermore, modern topics such as the spreading of gossip or disease in social networks have lead to new challenging problems in search and rendezvous. Search Theory: A Game Theoretic Perspective introduces the first integrated approach to Search and Rendezvous from the perspectives of biologists, computer scientists and mathematicians. This contributed volume covers a wide range of topics including rendezvous problems and solutions, rendezvous on graphs, search games on biology, mobility in governed social networks, search and security, and more. Most chapters also include case studies or a survey, in addition to a chapter on the future direction of Search and Rendezvous research. This book targets researchers and practitioners working in computer science, mathematics and biology as a reference book. Advanced level students focused on these fields will also find this book valuable as a secondary text book or reference.

Graph Structure and Monadic Second-Order Logic

A Language-Theoretic Approach
Author: Bruno Courcelle,Joost Engelfriet
Publisher: Cambridge University Press
ISBN: 1139644009
Category: Mathematics
Page: N.A
View: 1318

Continue Reading →

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

Randomized Algorithms


Author: Rajeev Motwani,Prabhakar Raghavan
Publisher: Cambridge University Press
ISBN: 1139643134
Category: Computers
Page: N.A
View: 3150

Continue Reading →

For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.

Data Mining: Concepts and Techniques


Author: Jiawei Han,Jian Pei,Micheline Kamber
Publisher: Elsevier
ISBN: 9780123814807
Category: Computers
Page: 744
View: 4587

Continue Reading →

Data Mining: Concepts and Techniques provides the concepts and techniques in processing gathered data or information, which will be used in various applications. Specifically, it explains data mining and the tools used in discovering knowledge from the collected data. This book is referred as the knowledge discovery from data (KDD). It focuses on the feasibility, usefulness, effectiveness, and scalability of techniques of large data sets. After describing data mining, this edition explains the methods of knowing, preprocessing, processing, and warehousing data. It then presents information about data warehouses, online analytical processing (OLAP), and data cube technology. Then, the methods involved in mining frequent patterns, associations, and correlations for large data sets are described. The book details the methods for data classification and introduces the concepts and methods for data clustering. The remaining chapters discuss the outlier detection and the trends, applications, and research frontiers in data mining. This book is intended for Computer Science students, application developers, business professionals, and researchers who seek information on data mining. Presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects Addresses advanced topics such as mining object-relational databases, spatial databases, multimedia databases, time-series databases, text databases, the World Wide Web, and applications in several fields Provides a comprehensive, practical look at the concepts and techniques you need to get the most out of your data

Structures in Logic and Computer Science

A Selection of Essays in Honor of A. Ehrenfeucht
Author: Jan Mycielski,Grzegorz Rozenberg,Arto Salomaa
Publisher: Springer Science & Business Media
ISBN: 9783540632467
Category: Computers
Page: 370
View: 7492

Continue Reading →

The book summarises contemporary knowledge about the theory of atomic and molecular clusters. New results are discussed on a high theoretical level. Access to this field of research is given by an explanation of the various subjects in introductory chapters.

The Theory of Search Games and Rendezvous


Author: Steve Alpern,Shmuel Gal
Publisher: Springer Science & Business Media
ISBN: 0306482126
Category: Mathematics
Page: 319
View: 987

Continue Reading →

Search Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a Searcher who wishes to minimize the time required to find a hidden object, or “target. ” The Searcher chooses a path in the “search space” and finds the target when he is sufficiently close to it. Traditionally, the target is assumed to have no motives of its own regarding when it is found; it is simply stationary and hidden according to a known distribution (e. g. , oil), or its motion is determined stochastically by known rules (e. g. , a fox in a forest). The problems dealt with in this book assume, on the contrary, that the “target” is an independent player of equal status to the Searcher, who cares about when he is found. We consider two possible motives of the target, and divide the book accordingly. Book I considers the zero-sum game that results when the target (here called the Hider) does not want to be found. Such problems have been called Search Games (with the “ze- sum” qualifier understood). Book II considers the opposite motive of the target, namely, that he wants to be found. In this case the Searcher and the Hider can be thought of as a team of agents (simply called Player I and Player II) with identical aims, and the coordination problem they jointly face is called the Rendezvous Search Problem.

Cloud Computing and Software Services

Theory and Techniques
Author: Syed A. Ahson,Mohammad Ilyas
Publisher: CRC Press
ISBN: 9781439803165
Category: Computers
Page: 458
View: 4471

Continue Reading →

Whether you’re already in the cloud, or determining whether or not it makes sense for your organization, Cloud Computing and Software Services: Theory and Techniques provides the technical understanding needed to develop and maintain state-of-the-art cloud computing and software services. From basic concepts and recent research findings to future directions, it gathers the insight of 50 experts from around to present a global perspective on the range of technical topics related to cloud computing and Software as a Service (SaaS). The book also: Reviews real cases and applications of cloud computing Discusses the infrastructure cloud and Infrastructure as a Service (IaaS) Considers data- and compute-intensive environments Examines security and reliability in the cloud Witten in a manner that makes this complex subject easy to understand, this is an ideal one-stop reference for anyone interested in cloud computing. The accessible language and wealth of illustrations also make it suitable for academic and research-oriented settings. The comprehensive coverage supplies you with the understanding of cloud computing technologies and trends in parallel computing needed to establish and maintain effective and efficient computing and software services.

Refactoring

Improving the Design of Existing Code
Author: Martin Fowler,Kent Beck,John Brant,William Opdyke,Don Roberts
Publisher: Addison-Wesley
ISBN: 013306526X
Category: Computers
Page: 455
View: 3998

Continue Reading →

As the application of object technology--particularly the Java programming language--has become commonplace, a new problem has emerged to confront the software development community. Significant numbers of poorly designed programs have been created by less-experienced developers, resulting in applications that are inefficient and hard to maintain and extend. Increasingly, software system professionals are discovering just how difficult it is to work with these inherited, "non-optimal" applications. For several years, expert-level object programmers have employed a growing collection of techniques to improve the structural integrity and performance of such existing software programs. Referred to as "refactoring," these practices have remained in the domain of experts because no attempt has been made to transcribe the lore into a form that all developers could use. . .until now. In Refactoring: Improving the Design of Existing Code, renowned object technology mentor Martin Fowler breaks new ground, demystifying these master practices and demonstrating how software practitioners can realize the significant benefits of this new process. With proper training a skilled system designer can take a bad design and rework it into well-designed, robust code. In this book, Martin Fowler shows you where opportunities for refactoring typically can be found, and how to go about reworking a bad design into a good one. Each refactoring step is simple--seemingly too simple to be worth doing. Refactoring may involve moving a field from one class to another, or pulling some code out of a method to turn it into its own method, or even pushing some code up or down a hierarchy. While these individual steps may seem elementary, the cumulative effect of such small changes can radically improve the design. Refactoring is a proven way to prevent software decay. In addition to discussing the various techniques of refactoring, the author provides a detailed catalog of more than seventy proven refactorings with helpful pointers that teach you when to apply them; step-by-step instructions for applying each refactoring; and an example illustrating how the refactoring works. The illustrative examples are written in Java, but the ideas are applicable to any object-oriented programming language.

AspectJ in Action

Enterprise AOP with Spring Applications
Author: Ramnivas Laddad
Publisher: Manning Publications Company
ISBN: 9781933988054
Category: Computers
Page: 519
View: 5036

Continue Reading →

AspectJ shows its real power when combined with Spring. This new edition focuses on Spring-AspectJ integration, which is a major feature of Spring 2.5. Readers will find this edition immensely helpful in answering questions like: What are the ways to leverage these technologies? What applications is AOP suitable for? What are the best practices and traps? Which kind of weaving should you use? When to use Spring AOP and AspectJ AOP? Expert author Ramnivas Laddad shows how to combine technologies such as Spring, Hibernate, Swing, and JDBC with AspectJ. The book fully covers the latest AspectJ 6 features. The applications and reusable code presented in this book show how AOP vastly simplifies enterprise development. This book is for developers who have experience in AOP and AspectJ, but also for those who are new to both.

Online Computation and Competitive Analysis


Author: Allan Borodin,Ran El-Yaniv
Publisher: Cambridge University Press
ISBN: 9780521619462
Category: Computers
Page: 414
View: 4860

Continue Reading →

Contains theoretical foundations, applications, and examples of competitive analysis for online algorithms.

Recommender Systems for Learning


Author: Nikos Manouselis,Hendrik Drachsler,Katrien Verbert,Erik Duval
Publisher: Springer Science & Business Media
ISBN: 146144361X
Category: Computers
Page: 76
View: 6411

Continue Reading →

Technology enhanced learning (TEL) aims to design, develop and test sociotechnical innovations that will support and enhance learning practices of both individuals and organisations. It is therefore an application domain that generally covers technologies that support all forms of teaching and learning activities. Since information retrieval (in terms of searching for relevant learning resources to support teachers or learners) is a pivotal activity in TEL, the deployment of recommender systems has attracted increased interest. This brief attempts to provide an introduction to recommender systems for TEL settings, as well as to highlight their particularities compared to recommender systems for other application domains.