| 1. |
- Jones, Richard W., et al.
(författare)
-
A framework for intelligent medical diagnosis using the theory of evidence
- 2002
-
Ingår i: Knowledge-Based Systems. - 0950-7051 .- 1872-7409. ; 15:1-2, s. 77-84
-
Tidskriftsartikel (refereegranskat)abstract
- In designing fuzzy logic systems for fault diagnosis, problems can be encountered in the choice of symptoms to use fuzzy operators and an inability to convey the reliability of the diagnosis using just one degree of membership for the conclusion. By turning to an evidential framework, these problems can be resolved whilst still preserving a fuzzy relational model structure. The theory of evidence allows for utilisation of all available information. Relationships between sources of evidence determine appropriate combination rules. By generating belief and plausibility measures it also communicates the reliability of the diagnosis, and completeness of information. In this contribution medical diagnosis is considered using the theory of evidence, in particular the diagnosis of inadequate analgesia is considered
|
|
| 2. |
- Kruusmaa, Maarja, et al.
(författare)
-
Covering the path space : a casebase analysis for mobile robot path planning
- 2003
-
Ingår i: Knowledge-Based Systems. - Guildford, Surrey : Elsevier. - 0950-7051 .- 1872-7409. ; 16:5-6, s. 235-242
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents a theoretical analysis of a casebase used for mobile robot path planning in dynamic environments. Unlike other case-based path planning approaches, we use a grid map to represent the environment that permits the robot to operate in unstructured environments. The objective of the mobile robot is to learn to choose paths that are less risky to follow. Our experiments with real robots have shown the efficiency of our concept. In this paper, we replace a heuristic path planning algorithm of the mobile robot with a seed casebase and prove the upper and lower bounds for the cardinality of the casebase. The proofs indicate that it is realistic to seed the casebase with some solutions to a path-finding problem so that no possible solution differs too much from some path in the casebase. This guarantees that the robot would theoretically find all paths from start to goal. The proof of the upper bound of the casebase cardinality shows that the casebase would in a long run grow too large and all possible solutions cannot be stored. In order to keep only the most efficient solutions the casebase has to be revised at run-time or some other measure of path difference has to be considered.
|
|
| 3. |
- Verikas, Antanas, et al.
(författare)
-
An intelligent system for tuning magnetic field of a cathode ray tube deflection yoke
- 2003
-
Ingår i: Knowledge-Based Systems. - Amsterdam : Elsevier Science. - 0950-7051 .- 1872-7409. ; 16:3, s. 161-164
-
Tidskriftsartikel (refereegranskat)abstract
- This short communication concerns identification of the number of magnetic correction shunts and their positions for deflection yoke tuning to correct the misconvergence of colours of a cathode ray tube. The misconvergence of colours is characterised by the distances measured between the traces of red and blue beams. The method proposed consists of two phases, namely, learning and optimisation. In the learning phase, the radial basis function neural network is trained to learn a mapping: correction shunt position→changes in misconvergence. In the optimisation phase, the trained neural network is used to predict changes in misconvergence depending on a correction shunt position. An optimisation procedure based on the predictions returned by the neural net is then executed in order to find the minimal number of correction shunts needed and their positions. During the experimental investigations, 98% of the deflection yokes analysed have been tuned successfully using the technique proposed.
|
|
| 4. |
- Amon, B., et al.
(författare)
-
From first-order logic to automated word generation for Lyee
- 2003
-
Ingår i: Knowledge-Based Systems. - : Elsevier BV. - 0950-7051 .- 1872-7409. ; 16:07-8, s. 413-429
-
Tidskriftsartikel (refereegranskat)abstract
- A conceptual schema can be viewed as a language to describe the phenomena in a system to be modelled, i.e. a set of derivation rules and integrity constraints as well as a set of event-rules describing the behaviour of an object system. In this paper, we investigate the relationship between the Lyee software requirements concepts with various constructs in conceptual modelling. Within our work we choose the Unified Modelling Language (UML) as a modelling notation for explaining conceptual models. The result obtained models a fully expressive set of UML and First Order Logic constructs mapped into Lyee concepts.
|
|
| 5. |
- Ekenberg, Love, et al.
(författare)
-
A framework for determining design correctness
- 2004
-
Ingår i: Knowledge-Based Systems. - : Elsevier BV. - 0950-7051 .- 1872-7409. ; 17:07-8, s. 249-262
-
Tidskriftsartikel (refereegranskat)abstract
- Quality is one of the main concerns in today's systems and software development and use. One important instrument in verification is the use of formal methods, which means that requirements and designs are analyzed formally to determine their relationships. Furthermore, since professional software design is to an increasing extent a distributed process, the issue of integrating different systems to an entity is of great importance in modem system development and design. Various candidates for formalizing system development and integration have prevailed, but very often, particularly for dynamic conflict detection, these introduce non-standard objects and formalisms, leading to severe confusion, both regarding the semantics and the computability. In contrast to such, we introduce a framework for defining requirement fulfillment by designs, detecting conflicts of various kinds as well as integration of heterogeneous schemata. The framework introduced transcends ordinary logical consequence, as it takes into account static and dynamic aspects of design consistency and, in particular, the specific features of the state space of a specification. Another feature of the approach is that it provides a unifying framework for design conflict analysis and schema integration.
|
|
| 6. |
|
|
| 7. |
- Dahlstrand, F
(författare)
-
Consequence analysis theory for alarm analysis
- 2002
-
Ingår i: Knowledge-Based Systems. - 0950-7051. ; 15:1-2, s. 27-36
-
Tidskriftsartikel (refereegranskat)abstract
- Alarm analysis is the task of finding the root cause of a failure situation in an industrial process. In this article, a new approach for performing alarm analysis using multilevel flow models (MFM) is introduced. This approach is compared with existing methods for alarm analysis using MFM. The result of the alarm analysis presented in this article is a set of explanations that fits the observed state of the process. Furthermore, it is shown that the old alarm analysis algorithms are a special case of the method presented here. (C) 2002 Elsevier Science B.V. All rights reserved.
|
|
| 8. |
- Larsson, Jan Eric
(författare)
-
Diagnostic reasoning based on means-end models: experiences and future prospects
- 2002
-
Ingår i: Knowledge-Based Systems. - 0950-7051. ; 15:1-2, s. 103-110
-
Tidskriftsartikel (refereegranskat)abstract
- Multilevel flow models (MFM) are graphical models of goals and functions of technical systems. MFM was invented by Morten Lind at the Technical University of Denmark and several new algorithms and implementations have been contributed by the group headed by Jan Eric Larsson at Lund Institute of Technology. MFM has several properties which makes for a relatively easy knowledge engineering task, compared to mathematical models as used in classical control theory and compared to the rule bases used in standard expert systems. In addition, MFM allows for diagnostic algorithms with excellent real-time properties. This paper gives an overview of existing MFM algorithms, and different MFM projects which have been performed, or are currently in progress.
|
|
