Basically, the medical diagnosis process can be interpreted as a decision-making process, during which the physician induces the diagnosis of a new and unknown case from an available set of clinical data and from his/...
详细信息
Basically, the medical diagnosis process can be interpreted as a decision-making process, during which the physician induces the diagnosis of a new and unknown case from an available set of clinical data and from his/her clinical experience. This process can be computerized in order to present medical diagnostic procedures in a rational, objective, accurate and fast way. In fact, in the last two or three decades, diagnostic decision support systems have become a well-established component of medical technology. In this paper, we address our attention to the early detection of cancer on the basis of a small amount of clinical information. In order to develop a decision support system in this specific context, we emphasise the powerful efficiency and effectiveness of mathematical programming approaches as basic tools for developing medical diagnostic decision support systems.
Hardware/software codesign requires an accurate way of evaluating candidate architectures. Architecture exploration (which can be used to automate hardware/software codesign) requires an automatic way of evaluating ca...
详细信息
Hardware/software codesign requires an accurate way of evaluating candidate architectures. Architecture exploration (which can be used to automate hardware/software codesign) requires an automatic way of evaluating candidate architectures, otherwise a substantial programming effort must be expended on each iteration. We present a system that automatically generates an instruction level simulator (ILS) and a hardware implementation model given a description of a candidate architecture. Accurate cycle counts can be obtained for specific applications using the ILS. At the same time, the hardware implementation model can be used to obtain cycle length, die size, and power consumption estimates. These measurements allow an accurate performance evaluation to be constructed for each candidate architecture. We use the machine description language ISDL to support the generation of the ILS and the hardware model, as well as other tools which form the core of our hardware/software codesign system.
The paper addresses the problem of automatically programming cooperative behaviors in a group of autonomous robots. The specific task that we consider here is for a group of distributed autonomous robots to cooperativ...
详细信息
The paper addresses the problem of automatically programming cooperative behaviors in a group of autonomous robots. The specific task that we consider here is for a group of distributed autonomous robots to cooperatively push an object toward a goal location. The difficulty of this task lies in that the task configurations of the robots with respect to the object do not follow any explicit, global control command, primarily due to certain modeling limitations as well as planning costs as in many real life applications. In such a case, it is important that the individual robots locally modify their motion strategies, and at the same time, create a desirable collective interaction between the distributed robot group and the object that can successfully bring the object to the goal location. In order to solve this problem, we have developed an evolutionary computation approach in which no centralized modeling and control is involved except a high level criterion for measuring the quality of robot task performance. The evolutionary approach to distributed robot behavioral programming is based on a fittest preserved genetic algorithm that takes into account the current positions and orientations of the robots relative to the object and the goal, and a weak global feedback on the collective task performing effect in relation to the goal if some new local motion strategies are employed by the robots.
We show that many open and challenging problems in control theory belong to the class of concave minimization programs. More precisely, these problems can be recast as the minimization of a concave objective function ...
详细信息
We show that many open and challenging problems in control theory belong to the class of concave minimization programs. More precisely, these problems can be recast as the minimization of a concave objective function over convex linear matrix inequality (LMI) constraints. In this setting, these problems can then be efficiently handled using local and/or global optimization techniques.
Bit-reversals are representative and important data reordering operations in many scientific computations. Performance degradation is mainly caused by cache conflict misses. Bit-reversals are often repeatedly used as ...
详细信息
Bit-reversals are representative and important data reordering operations in many scientific computations. Performance degradation is mainly caused by cache conflict misses. Bit-reversals are often repeatedly used as fundamental subroutines for many scientific programs. Thus, in order to gain the best performance, cache-optimal methods and their implementations should be carefully and precisely done at the programming level. This type of performance programming for some special programs, such as the data reorderings, may significantly outperform an optimization from an automatic tool, such as a compiler. In this paper, we examine different methods using techniques of blocking, buffering, and padding for efficient implementations. We evaluate the merits and limits of each technique and their application and architecture-dependent conditions for developing cache-optimal methods. We present two contributions in this paper: (1) Our integrated blocking methods, which match cache associativity and TLB cache size and which fully use the available registers are cache-optimal and fast. (2) We show that our padding methods outperform other software oriented methods, and believe they are the fastest in terms of minimizing both CPU and memory access cycles. Since the padding methods are almost independent of hardware, they could be widely used on many uniprocessor workstations and SMP multiprocessors.
Understanding manipulative hand movements is a critical step toward automatic programming of dexterous robot hands, which, given their large number of degrees of freedom, are difficult to program. Our working hypothes...
详细信息
Understanding manipulative hand movements is a critical step toward automatic programming of dexterous robot hands, which, given their large number of degrees of freedom, are difficult to program. Our working hypothesis is that the units of manipulative hand movements are coordinated patterns of movement, and that most of the stable patterns of coordination are either in-phase (zero relative phase) or anti-phase (half-a-cycle relative phase). The phase-plane trajectories projected by these patterns of coordination are straight lines, with either positive or negative slope, respectively. In this paper we develop and demonstrate a method for segmenting the phase-plane trajectories, and thereby the movement, accordingly.
This paper presents the major language issues facing the development of the Information Power Grid. The paper presents examples of the types of parallelisms desired in the Grid and gives Java solutions to those proble...
详细信息
This paper presents the major language issues facing the development of the Information Power Grid. The paper presents examples of the types of parallelisms desired in the Grid and gives Java solutions to those problems. The Java solutions contain artifacts of the design of parallel solutions. The same problems are recast in the high level language SequenceL, in which parallelisms are implied. The SequenceL approach seems to be a good candidate for a Grid Oriented Language, in that the abstraction relieves the problem solver of much of the burden normally required in development of parallel problem solutions.
A control scheme for unity power factor automatic current shapers operating in discontinuous conduction mode uses constant-frequency peak current mode programming instead of the conventional low-bandwidth voltage mode...
详细信息
A control scheme for unity power factor automatic current shapers operating in discontinuous conduction mode uses constant-frequency peak current mode programming instead of the conventional low-bandwidth voltage mode programming control. The main advantage is that an input current with very low harmonic distortion (THD<1.5%) can be obtained. A potential stability problem of the control is identified and an elegant solution suggested.
Test-program generators play a key role in hardware functional verification of large scale processors. However, in the DSP domain, the usage of full-blown test-program generators is much less popular, mainly due to th...
详细信息
Test-program generators play a key role in hardware functional verification of large scale processors. However, in the DSP domain, the usage of full-blown test-program generators is much less popular, mainly due to the limited resources (time and money) available when developing such systems. This paper describes a work-model for the fast, low cost construction of a test-program generator for DSPs. The core technology uses Genesys, a known test program generator that, until now, has been used for the verification of large scale processor families, such as PowerPC and x86. We developed the model while using Genesys for verification of the IBM C54XDSP, a fixed-point DSP. The case study shows that it is possible to build a full test-program generator in a very short time and thus achieve better verification coverage in spite of the shorter development time.
We describe the implementation of a distributed garbage collector for a group of object oriented databases. We start by considering the issues that led to the choice of algorithm and why garbage collection in a databa...
详细信息
We describe the implementation of a distributed garbage collector for a group of object oriented databases. We start by considering the issues that led to the choice of algorithm and why garbage collection in a database is more difficult than in memory. We describe the algorithm and how it was implemented in Eiffel, using PVM (Parallel Virtual Machine) and the Versant ODBMS.
暂无评论