In this paper we present the POCEMON platform, a platform aiming to the early prognosis and diagnosis of autoimmune diseases at any point of care, even the primary. The objective of the POCEMON platform is the develop...
详细信息
In this paper we present the POCEMON platform, a platform aiming to the early prognosis and diagnosis of autoimmune diseases at any point of care, even the primary. The objective of the POCEMON platform is the development of a diagnostic lab-on-chip device based on genomic microarrays of HLA-typing. The POCEMON is going to advance and promote the primary health care across Europe by supporting a) point-of-care diagnostics, b) monitoring of immune system status and c) management of the chronic multiple sclerosis (MS) and rheumatoid arthritis (RA) autoimmune diseases. The platform combines high-end Information and Communication Technologies based on microfluidics, microelectronics, microarrays and intelligent diagnosis algorithms.
In networked control systems (NCS), it is considered essential to design a robust controller such that the networked-system is stable against data dropouts during the network transfer. It has been shown that there is ...
In networked control systems (NCS), it is considered essential to design a robust controller such that the networked-system is stable against data dropouts during the network transfer. It has been shown that there is a critical data dropout rate over which the networked-system could be unstable; hence the desired task cannot be achieved. This paper shows that a desired task or trajectories can be still achieved even though there are feedback signal dropouts if the desired task is repetitive, as in the iterative learning control case. Specifically this paper shows how to design stochastic iterative learning control systems such that the networked-system with a repetitive task is robust stable against measurement and process noises and independent, intermittent output channel dropouts.
Implementing and fleshing out a number of psychological and neuroscience theories of cognition, the LIDA conceptual model aims at being a cognitive "theory of everything." With modules or processes for perce...
详细信息
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree. Function tags are extra functional in...
详细信息
In this paper, we present LIDA, a working model of, and theoretical foundation for, machine consciousness. LIDA's architecture and mechanisms were inspired by a variety of computational paradigms and LIDA implemen...
详细信息
In this work, we propose a novel technique for evolving transistor netlists from truth table descriptions of arbitrary digital circuits. The proposed methods incorporate the effective use of Genetic Algorithms (GAs). ...
详细信息
In many applications, transaction data arrive in the form of high speed data streams. These data contain a lot of information about customers that needs to be carefully managed to protect customers' privacy. In th...
详细信息
ISBN:
(纸本)1424413176
In many applications, transaction data arrive in the form of high speed data streams. These data contain a lot of information about customers that needs to be carefully managed to protect customers' privacy. In this paper, we consider the problem of preserving customer's privacy on the sliding window of transaction data streams. This problem is challenging because sliding window is updated frequently and rapidly. We propose a novel approach, SWAF (Sliding Window Anonymization Framework), to solve this problem by continuously facilitating kanonymity on the sliding window. Three advantages make SWAF practical: (1) Small processing time for each tuple of data steam. (2) Small memory requirement. (3) Both privacy protection and utility of anonymized sliding window are carefully considered. Theoretical analysis and experimental results show that SWAF is efficient and effective.
The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} ...
详细信息
The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} is shift-orthogonal if there exist prewavelets with finite decomposition and finite reconstruction, i.e., non-trivial prewavelets with finite decomposition and finite reconstruction does not exist. As an example, when r = 2 we construct a prewavelet with finite decomposition and finite reconstruction where the scale function is not shift-orthogonal, which demonstrate that there exist vector prewavelets with finite decomposition and finite reconstruction.
We discuss strategies for maintaining connectivity in a system consisting of a stationary base station and a mobile explorer. For this purpose we introduce the concept of mobile relay stations, which form a chain betw...
详细信息
ISBN:
(纸本)159593667X
We discuss strategies for maintaining connectivity in a system consisting of a stationary base station and a mobile explorer. For this purpose we introduce the concept of mobile relay stations, which form a chain between the base station and the explorer and forward all communication. In order to cope with the mobility of the explorer, relay stations must adapt their positions. We investigate strategies which allow the relay stations to self-organize in order to maintain a chain of small length. For a plane without obstacles, the optimal positions are on a line connecting the base station with the explorer;in a setting with obstacles it is a curve around some of the obstacles. Our goal is to keep the relay stations as close to this line/curve as possible. A crucial requirement for strategies is that they are able to work with imprecise or without localization and odometry information. Furthermore, strategies should be local, i.e., relay stations should not need to know about the state of the system as a whole. The performance measures for strategies are the number of relay stations used (in comparision to the optimal number) and the allowed speed of the explorer (in comparision to its maximum attainable speed). We contribute by analyzing the performance of an already known strategy Go-To-The-Middle. This strategy assumes a very weak robot model and needs hardly any localization information, but sacrifices perfomance. Our main contribution is a new strategy, the Chase-Explorer strategy, and its analysis. It needs more advanced robots than Go-To-The-Middle, but achieves near-optimal performance. We further extend it to exploring terrains with obstacles. Copyright 2007 ACM.
暂无评论