الصفحة 26
الصفحة 26
Cooperative Information Agents XI ; Matthias Klusch, Koen V. Hindriks, Mike P. Papazoglou, Leon Sterling
In today’s world of ubiquitously connected heterogeneous information systems and computing devices, the intelligent coordination and provision of relevant added-value information at any time, anywhere is of key importance to a va- ety of applications. This challenge is envisioned to be coped with by means of appropriate intelligent and cooperative information agents. An information agent is a computational software entity that has access to one or multiple heterogeneous and geographically dispersed data and infor- tion sources. It pro-actively searches for and maintains information on behalf of its human users, or other agents preferably just in time. In other words, it is managing and overcoming the di?culties associated with information overload in open, pervasive information and service landscapes. Each component of a modern cooperative information system is represented by an appropriate intelligent information agent capable of resolving system and semantic heterogeneities in a given context on demand. Cooperative infor- tion agents are supposed to accomplish both individual and shared joint goals depending on the actual user preferences in line with given or deduced limits of time, budget and resources available.
Cooperative Information Agents X ; 10th International Workshop, CIA 2006, Edinburgh, UK, September 11-13, 2006, Proceedings
This book constitutes the refereed proceedings of the 10th International Workshop on Cooperative Information Agents, CIA 2006, held in Edinburgh, UK in September 2006. The 29 revised full papers presented together with four invited papers were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections.
Cooperative Design, Visualization, and Engineering ; 5th International Conference, CDVE 2008 Calvià, Mallorca, Spain, September 21-25, 2008 Proceedings
This book constitutes the refereed proceedings of the 5th International Conference on Cooperative Design, Visualization, and Engineering, CDVE 2008, held in Calvià, Mallorca, Spain, in September 2008.
Converged communications : Evolution from telephony to 5G mobile internet
The central theme of the book is to build deeper understanding about incremental technological progress by introducing both state of the art and their predecessor technologies. The book explores four main areas, including fixed telephone systems, data communication systems, mobile cellular systems, and IP multimedia systems. It clearly explains architectures, protocols, and functional procedures, and discusses a variety of topics ranging from physical layer processes to system level interactions. Converged Communications offers: In-depth treatments of fixed telephone and transmission systems, including operation of telephone exchanges and signaling systems Comprehensive explorations of data communication systems, including transmission of data over telephone lines and data network technologies, such as Ethernet and TCP/IP Incisive discussions of mobile cellular systems, including GSM, 3G, LTE, VoLTE and 5G Insightful analysis of incremental system evolution to justify various design choices made The book is supported with extensive online appendices, which covers communication system concepts, an overview of standardization, various technologies used in the past, state-of-the art technologies such as WLAN, cable modems, and FTTx, complementing the other systems described in the book which have evolved from the fixed telephone network.
Control Reconfiguration of Dynamical Systems : Linear Approaches and Structural Tests
The book addresses advanced engineering students, developers and researchers that have a specific interest in control reconfiguration. A good understanding of multi-variable dynamic systems is helpful, but the second part is accessible even without this.
Control of Redundant Robot Manipulators : Theory and Experiments
This monograph provides a comprehensive and thorough treatment of the problem of controlling a redundant robot manipulator. It presents the latest research from the field with a good balance between theory and practice. All theoretical developments are verified both via simulation and experimental work on an actual prototype redundant robot manipulator
Contributions to Simulation Speed-Up : Rare Event Simulation and Short-Term Dynamic Simulation for Mobile Network Planning
Eugen Lamers explains the principle of simulation speed-up in general, demonstrates the technique RESTART for the simulation of rare events, and addresses its efficiency on distributed systems.
Continuous System Simulation
Continuous System Simulation describes systematically and methodically how mathematical models of dynamic systems, usually described by sets of either ordinary or partial differential equations possibly coupled with algebraic equations, can be simulated on a digital computer.
Content based image retrieval systems
With an advent of technology, huge collection of digital images is formed as repositories on crime prevention, medical diagnosis, military, face finding, satellites and remote sensing. The task of searching for similar images in the repository is difficult. The data is growing enormously which makes it difficult to store and manage. The traditional image retrieval technique is inefficient in retrieving these images. Content-based image retrieval is an approach from data mining community, which provides the solution of managing this huge quantity of data. In this research, a Content-Based Image Retrieval (CBIR) system has been developed using color and texture as retrieval features from the image repository. The system allows the user to search for an image based on any of the two features alone or in combination by assigning weights to the features. The histogram and color moments approach is used to extract the color feature, texture feature is extracted using statistical moments and co-occurrence matrix method and the shape feature is extracted using the morphological operations. The images and the extracted feature vectors are stored in the Pickle file. The system is robust as it provides search based on the multiple features. The performance of the system was evaluated by analyzing the retrieval results using precision and recall.
Contemporary Cryptology
The aim of this text is to treat selected topics of the subject of contemporary cryptology, structured in five quite independent but related themes: Efficient distributed computation modulo a shared secret / Multiparty computation / Foundations of modern cryptography / Provable security for public key schemes / Efficient and secure public-key cryptosystems.
Consuming Music Together : Social and Collaborative Aspects of Music Consumption Technologies
This book collects together the most recent studies of music consumption, and new developments in music technology. It combines the perspectives of both social scientists and technology designers, uncovering how new music technologies are actually being used, along with discussions of new music technologies still in development. With a specific focus on the social nature of music.
Constraint solving and language processing
Contains selected and thoroughly revised papers plus contributions from invited speakers presented at the First International Workshop on C- straint Solving and Language Processing, held in Roskilde, Denmark, September 1–3, 2004. Constraint Programming and Constraint Solving, in particular Constraint Logic Programming, appear to be a very promising platform, perhaps the most promising present platform, for bringing forward the state of the art in natural language processing, this due to the naturalness in speci?cation and the direct relation to e?cient implementation. Language, in the present context, may - fer to written and spoken language, formal and semiformal language, and even general input data to multimodal and pervasive systems, which can be handled in very much the same ways using constraint programming. The notion of constraints, with slightly differing meanings, apply in the characterization of linguistic and cognitive phenomena, in formalized linguistic m- els as well as in implementation-oriented frameworks. Programming techniques for constraint solving have been, and still are, in a period with rapid devel- ment of new eficient methods and paradigms from which language processing can prompt. A common metaphor for human language processing is one big c- straint solving process in which the differently specified linguistic and cognitive phases take place in parallel and with mutual cooperation, which ?ts quite well with current constraint programming paradigms.
Constraint satisfaction techniques for agent-based reasoning
Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to the modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains such as transportation, production, supply-chains, network management and human resource management. In this book we study new techniques for solving constraint satisfaction problems, with a special focus on solution adaptation applied to agent reasoning.
Constraint handling rules : Current research topics
The Constraint Handling Rules (CHR) language is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs. The aim of this volume was to attract high-quality research papers on these recent advances in Constraint Handling Rules.
Concurrent Zero-Knowledge : With Additional Background by Oded Goldreich
Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory de?nition; ze- knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a predetermined protocol. In addition to their direct applicability in cr- tography, zero-knowledge proofs serve as a good benchmark for the study of variousproblemsregardingcryptographicprotocols(e.g.,“securecomposition of protocols”).
Concurrency Theory : Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory is a synthesis of one of the major threads of theoretical computer science research focusing on languages and graphical notations for describing collections of simultaneously evolving components that interact through synchronous communication. The main specification notation focused on in this book is LOTOS. An extensive introduction to this particular process calculus is given, highlighting how the approach differs from competitor techniques, such as CCS and CSP.
CONCUR 2008 - Concurrency Theory ; 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings
This book constitutes the refereed proceedings of the 19th International Conference on Concurrency Theory, CONCUR 2008, held in Toronto, Canada, August 19-22, 2008.
CONCUR 2007 – Concurrency Theory ; 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings
This book includes model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.
CONCUR 2006 - Concurrency Theory ; 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006
This volume contains the proceedings of the 17th International Conference on Concurrency Theory (CONCUR) held in Bonn, Germany, August 27–30, 2006. The scope of CONCUR covers all areas of semantics, logics, and verification techniques for concurrent systems.
Computing and combinatorics ; Vol. 3595 ; 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings
The papers in this volume were presented at theEleventh Annual InternationalComputing and Combinatorics Conference(COCOON 2005), The topics cover most aspects of theoretical computerscience and combinatorics related to computing.Submissions to the conference this year were conducted electronically. A totalof 353 papers were submitted, of which 96 were accepted.
