In this paper, the problem of identifying a predictor model for an unknown system is studied. Instead of standard models returning a prediction value as output, we consider models returning prediction intervals. Identification is performed according to some optimality criteria, and, thanks to this approach, we are able to provide, independently of the data generation mechanism, an exact evaluat...

Due to the erratic nature, the value of a function argument in one normal program execution could become illegal in another normal execution context. Attacks utilizing such erratic arguments are able to evade detections as fine-grained context information is unavailable in many existing detection schemes. In order to obtain such fine-grained context information, a precise model on the internal ...

This paper proposes a system that controls and generates a humanoid robot’s dance motion in real-time using the timing of beats in musical audio signals. The system tracks changes in tempo and calculate the integration value of a decibel by analyzing audio signals in real-time. It uses the information to add changes to the robot’s dance motion. Beat intervals and the integration value of decibe...

The wide adoption of the Z39.50 protocol from the Libraries exposes their abilities to participate in a distributed environment. In spite of the protocol specification of a unified global access mechanism, query failures and/or inconsistent answers are the pending issues when searching many sources due to the variant or poor implementations. The elimination of these issues heavily depends on th...

This paper describes a 1-out-of-N oblivious transfer (OT) extension protocol with active security, which achieves very low overhead on top of the passively secure protocol of Kolesnikov and Kumaresan (Crypto 2011). Our protocol obtains active security using a consistency check which requires only simple computation and has a communication overhead that is independent of the total number of OTs ...

specification of a component C, a set of components K relevant to C and called candidate solution SO, and a set of pre-selected components from SO, called solution SN. Sc(i) represents the map associated to the input value i defined in the domain of Sc. This map should provide a valid value on the output domain of Sc, i.e. there is no empty maps or invalid associations. A similar assumption is ...

Model based learning systems usually face to a problem of forgetting as a result of the incremental learning of new instances. Normally, the systems have to re-learn past instances to avoid this problem. However, the re-learning process wastes substantial learning time. To reduce learning time, we propose a novel incremental learning system, which consists of two neural networks: a main-learnin...

We propose a novel method for binarization of color documents whereby the foreground text is output as black and the background as white regardless of the polarity of foreground-background shades. The method employs an edge-based connected component approach and automatically determines a threshold for each component. It has several advantages over existing binarization methods. Firstly, it can...

Although the goal of clustering is intuitively compelling and its notion arises in many fields, it has been difficult to define a unified approach to address the clustering problem and thus diverse clustering approaches abound in the research community. These approaches are based on different clustering principles and assumptions and they often lead to qualitatively different results. As a cons...

We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution μ over {1, . . . , n}. Initially, the token is placed in a random position in A. In round t, a random value d is chosen according to μ. If the token is in position a ≥ d, then it is moved to position a − d. Otherwise it stays put. Let T be the number of rounds until th...