Catálogo de publicaciones - libros
Computer Aided Systems Theory: EUROCAST 2005: 10th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 7-11, 2005, Revised Selected Papers
Roberto Moreno Díaz ; Franz Pichler ; Alexis Quesada Arencibia (eds.)
En conferencia: 10º International Conference on Computer Aided Systems Theory (EUROCAST) . Las Palmas de Gran Canaria, Spain . February 7, 2005 - February 11, 2005
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
No disponibles.
Disponibilidad
Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
---|---|---|---|---|
No detectada | 2005 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-29002-5
ISBN electrónico
978-3-540-31829-3
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2005
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2005
Tabla de contenidos
doi: 10.1007/11556985_31
Fuzzy Adaptive Objects (Logic of Monitors)
Germano Resconi; Javier Alonso; Raul Izquierdo
The active semantic in Adaptive Object-Model (AOM) is only one example of the more complex active semantics at different orders. When we violate the integrity of the system, uncertainty grows up in the system. When monitors are conflicting worlds in the modal logic, we can study uncertainty with the logic of the monitors that is comparable with the logic in the fuzzy set theory. Fuzzy values (integration degree) of a concatenation of interactive objects can be computed by fuzzy AND, OR and NOT operators presented in this paper.
- Information Applications Components | Pp. 235-240
doi: 10.1007/11556985_32
A Model-Based Architecture for Fuzzy Temporal Diagnosis
J. M. Juarez; J. Palma; M. Campos; J. Salort; A. Morales; R. Marin
The application of Model Based Diagnosis (MBD) techniques together with Knowledge Base Systems, points out the need of general modelling frameworks in domains where time management is important. The development of this kind of systems, far from becoming simpler, reveals the additional complexity inherent in each specific domain. This paper describes a general architecture for this purpose using a model based approach for developping temporal knowledge based systems in different domains. This work also relates our experience in applying this architecture in the concrete domain of Intensive Care Units.
- Information Applications Components | Pp. 241-246
doi: 10.1007/11556985_33
Extension of Ontologies Assisted by Automated Reasoning Systems
Joaquín Borrego-Díaz; Antonia M. Chávez-González
A method to extend ontologies with the assistance of automated reasoning systems and preserving a kind of completeness with respect to their associate conceptualizations is presented. The use of such systems makes feasible the of new concepts, but it is necessary to re-interpret the older ones with respect to new ontological commitments. We illustrate the method extending a well-known ontology about spatial relationships, the called .
- Information Applications Components | Pp. 247-253
doi: 10.1007/11556985_34
A Software Architecture for Effective Document Identifier Reassignment
Roi Blanco; Álvaro Barreiro
This works presents a software solution for enhancing inverted file compression based on the reassignment of document identifiers. We introduce different techniques recently presented in the Information Retrieval forums to address this problem. We give further details on how it is possible to perform the reassignment efficiently by applying a dimensionality reduction to the original inverted file and on the evaluation results obtained with this technique. This paper is devoted to the software architecture and design practises taken into account for this particular task. Here, we show that making use of design patterns and reusing software components leads to better research applications for Information Retrieval.
- Information Applications Components | Pp. 254-262
doi: 10.1007/11556985_35
An Ontology for Reusing Synthetic Tasks
Abraham Rodríguez-Rodríguez; Francisca Quintana-Domínguez
Problem Solving Methods are valuable structures that facilitate reusing components for building Knowledge-Based Systems. We explain the vocabulary used to describe a synthetic PSM which was successfully applied to four different domains. The main classes of the ontology will be described, in particular those required to map the concepts of the domain with the PSM method.
- Information Applications Components | Pp. 263-268
doi: 10.1007/11556985_36
A Tractable Subclass of Fuzzy Constraint Networks
Alfonso Bosch; Francisco Guil; Roque Marin
The Fuzzy Constraint Networks model, a generalization of the Disjunctive Temporal Fuzzy Constraint Networks, is a framework that allows representing and reasoning with fuzzy qualitative and quantitative complex constraints. However, its general complexity is exponential, and we need to find tractable subclasses. In this paper we propose two algorithms to deal with a tractable subclass named Series-Parallel Fuzzy Constraint Networks.
- Information Applications Components | Pp. 269-274
doi: 10.1007/11556985_37
Parallel State Space Generation and Exploration on Shared-Memory Architectures
Milan Češka; Bohuslav Křena; Tomáš Vojnar
is a technique for an automated formal verification of correctness of various classes of systems. Compared to the more traditional approaches to this problem based on simulation and testing, the main advantage of model checking is that the desirable behavioural properties of the considered system are checked in such a way that all the reachable states which may affect the given property are guaranteed to be covered. The disadvantage of model checking is that it may have very high computational time and space requirements. That is why various ways of dealing with the computational complexity of model checking are sought.
- Information Applications Components | Pp. 275-280
doi: 10.1007/11556985_38
Towards Automated Controlling of Human Projectworking Based on Multiagent Systems
Manfred Mauerkirchner; Gerhard Hoefer
Calculating optimized project plans, consisting of an arbitrary number of activities of different types and within a dynamic available pool of human resources characterized by specific profiles can be a most challenging task. We focus mainly on the project control process based on such project plans, which also provide the possibility to integrate different types of external disturbances that normally influence a project workflow. Observed deviations of precalculated time intervals of activities immediately lead to the activation of the so-called self learning components, which automatically tune the personal parameters of each involved workgroup member. At least there are two processes to observe and to synchronize permanently: Real project workflow (the so-called Real System) and its realtime emulation (the so-called Simulation System). Due to all these dynamic requirements and to gain scalability of the system, the implementation selected is based on the usage of different intelligent software agents.
- Information Applications Components | Pp. 281-290
doi: 10.1007/11556985_39
Tree-Structured Legendre Multi-wavelets
Ekaterina Pogossova; Karen Egiazarian; Atanas Gotchev; Jaakko Astola
We address the problem of constructing multi-wavelets, that is, wavelets with more than one scaling and wavelet function. We generalize the algorithm, proposed by Alpert [1] for generating discrete Legendre multi-wavelets to the case of arbitrary, non-dyadic time interval splitting.
- Cryptography and Spectral Analysis | Pp. 291-300
doi: 10.1007/11556985_40
Remarks on Calculation of Autocorrelation on Finite Dyadic Groups by Local Transformations of Decision Diagrams
Radomir S. Stanković; Mark G. Karpovsky
The paper considers calculation of autocorrelation functions on finite dyadic groups over decision diagrams. The methods exploit recursive structure of both autocorrelation matrices and decision diagrams. First, it is discussed calculation of the autocorrelation through the Wiener-Khinchin theorem implemented over decision diagrams. Then, it is proposed a method for calculation of separate autocorrelation coefficients over decision diagrams with permuted labels at the edges. For the case of restricted memory resources, a procedure with in-place calculations over the decision diagram for the function processed has been defined.
- Cryptography and Spectral Analysis | Pp. 301-310