Combining classifiers under probabilistic models: experimental comparative analysis of methods

This work will present a review of the concept of classifier combination based on the combined discriminant function. We will present a Bayesian approach, in which the discriminant function assumes the role of the posterior probability. We will propose a probabilistic interpretation of expert rules and conditions of knowledge consistency for expert rules and learning sets. We will suggest how to measure the quality of learning materials and we will use the measure mentioned above for an algorithm that eliminates contradictions in the rule set. In this work several recognition algorithms will be described, based on either: (i) pure rules, or; (ii) rules together with learning sets. Furthermore, the original concept of information unification, which enables the formation of rules on the basis of learning set or learning set on the basis of rules will be proposed. The obtained conclusions will serve as a spring‐board for the formulation of new project guidelines for this type of decision‐making system. At the end, experimental results of the proposed algorithms will be presented, both from computer generated data and for a real problem from the medical diagnostics field.     

Crack and flaw identification in elastodynamics using Kalman filter techniques

Filter-driven optimization based on the extended Kalman filter concept is used here for the numerical solution of crack and flaw identification problems in elastodynamics. The mechanical modeling of the studied two-dimensional problem, which includes the effect of unilateral contact along the sides of the crack, is done with the help of the boundary element method. The effect of various dynamical test loads and the applicability of this method for crack and defect identification in disks are investigated. The work has been supported by the German Research Foundation (DFG). Partial support has been provided by a Greek-German Research Cooperation Grant (IKYDA2001). This support is greatfully acknowledged.     

Defect identification in 3-D elastostatics using a genetic algorithm

An inverse problem in engineering mechanics is considered where the position and the geometry of three-dimensional, ellipsoidal defects are identified by using measurements of the mechanical response under static loading on the external surface of the structure. The problem is solved by appropriate combination of genetic optimization (GO) and boundary element method (BEM) and following previously published two-dimensional problems. The three-dimensional case presents some additional difficulties. Furthermore, the function of several genetic operators and the effect of the parameters of genetic optimization on the efficiency of the solution has been numerically examined.     

Direct Segmentation of Algebraic Models for Reverse Engineering

In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate consecutive steps as surface fitting. In this paper we present a segmentation method with subsequent classification of simple algebraic surfaces. Our method is direct in the sense that it operates directly on the point set in contrast to other approaches that are based on a triangulation of the data set. The segmentation process involves a fast algorithm for k-nearest neighbors search and an estimation of first and second order surface properties. The first order segmentation, that is based on normal vectors, provides an initial subdivision of the surface and detects sharp edges as well as flat or highly curved areas. One of the main features of our method is to proceed by alternating the steps of segmentation and normal vector estimation. The second order segmentation subdivides the surface according to principal curvatures and provides a sufficient foundation for the classification of simple algebraic surfaces. If the boundary of the original object contains such surfaces the segmentation is optimized based on the result of a surface fitting procedure.     

Wave propagation in delaminated beam

The wave propagation model investigated herein is based on the known fact that material discontinuities affect the propagation of elastic waves in solids. The change in certain material characteristics, such as a local change in stiffness or inertia caused by a crack or the presence of material damage, will affect the propagation of transmitted elastic waves and will modify the received signal. Wave frequencies associated with the highest detection sensitivity depend, among other things, on the type of structure, the type of material, and the type of damage. This paper presents a method of wave propagation, which can be further used to detect small delaminations in beam-like structures. The considered beam is modelled by spectral finite elements.     

Constraint Lingo: towards high‐level constraint programming

Logic programming requires that the programmer convert a problem into a set of constraints based on predicates. Choosing the predicates and introducing appropriate constraints can be intricate and error prone. If the problem domain is structured enough, we can let the programmer express the problem in terms of more abstract, higher‐level constraints. A compiler can then convert the higher‐level program into a logic‐programming formalism. The compiler writer can experiment with alternative low‐level representations of the higher‐level constraints in order to achieve a high‐quality translation. The programmer can then take advantage of both a reduction in complexity and an improvement in runtime speed for all problems within the domain. We apply this analysis to the domain of tabular constraint‐satisfaction problems. Examples of such problems include logic puzzles solvable on a hatch grid and combinatorial problems such as graph coloring and independent sets. The proper abstractions for these problems are rows, columns, entries, and their interactions. We present a higher‐level language, Constraint Lingo, dedicated to problems in this domain. We also describe how we translate programs from Constraint Lingo into lower‐level logic formalisms such as the logic of propositional schemata. These translations require that we choose among competing lower‐level representations in order to produce efficient results. The overall effectiveness of our approach depends on the appropriateness of Constraint Lingo, our ability to translate Constraint Lingo programs into high‐quality representations in logic formalisms, and the efficiency with which logic engines can compute answer sets. We comment on our computational experience with these tools in solving both graph problems and logic puzzles. Copyright © 2004 John Wiley & Sons, Ltd.     

Wireless link prediction and triggering using modified Ornstein–Uhlenbeck jump diffusion process

Through time domain observation, typical wireless signal strength values seems to exhibit some forms of mean-reverting and discontinuous “jumps” behaviour. Motivated by this fact, we propose a wireless link prediction and triggering (LPT) technique using a modified mean-reverting Ornstein–Uhlenbeck (OU) jump diffusion process. The proposed technique which we refer as OU-LPT is an integral component of wireless mesh network monitoring system developed by ICT FP7 CARrier grade wireless MEsh Network project. In particular, we demonstrate how this technique can be applied in the context of wireless mesh networks to support link switching or handover in the event of predicted link degradation or failure. The proposed technique has also been implemented and evaluated in a real-time experimental testbed. The results show that OU-LPT technique can significantly enhance the reliability of wireless links by reducing the rate of false triggers compared to a conventional linear prediction technique and therefore offers a new direction on how wireless link prediction, triggering and switching process can be conducted in the future.     

Existence of optimal solutions of two-directionally continuous linear repetitive processes

In the paper, an existence theorem for a Lagrange optimal control problem connected with a two-directionally continuous variant of a linear autonomous repetitive process is derived. As a corollary, existence of an optimal solution in the case of cost functional depending on a fixed ??end-function?? is obtained.