Search

the theme of this paper is to have a platform independent 8-bit soft core. Paper speaks about implementation of the Picoblaze Processor, a 8-bit soft processor core from Xilinx Inc. on FPGA platforms of other vendors. PicoBlaze is based on a RISC architecture of 8 bits. The design was originally named KCPSM which stands for "Constant (K) Coded Programmable State Machine" (formerly "Ken Chapman's PSM"). It is a well optimized processor designed by Xilinx, which occupies 2% resources of Xilinx Spartan III FPGA. Original design uses the Xilinx primitives, which are replaced by standard generic logics like gates, flipflops, multiplexers etc.. Authors have used KCPSM3 (PicoBlaze3) version of the processor. As a test case the generic design is implemented on Altera FPGA platform. Altera Development and Education (DE2) board is used to verify the platform independent PicoBlaze design, which provides an ideal vehicle for learning about digital logic, computer organization, and FPGAs, Featuring an Altera Cyclone® II FPGA, DE2 board offers state-of-the-art technology suitable for wide range of design projects, as well as sophisticated digital system development. Altera offers NIOS II soft processor with SOPC builder software suite. This paper presents the comparison of PicoBlaze and Nios II processor on Altera platform for small applications. Authors have shown implementation of data transfer through UART using PicoBlaze and Nios II on Altera DE2. Xilinx synthesis tool version 9.1 and Altera quartus II version 7.1 are used. KCPSM3 assembler is used for compilation of PicoBlaze assembly language programs. A small utility program is developed for porting the ROM code generated by the assembler to Altera compatible code. [ABSTRACT FROM AUTHOR]

Computer recognition of sign language is an important research problem for enabling communication with hearing impaired people. This paper introduces an efficient and fast algorithm for identification of the number of fingers opened in a gesture representing an alphabet of the American Sign Language. Finger Detection is accomplished based on the concept of Boundary Tracing and Finger Tip Detection. The system does not require the hand to be perfectly aligned to the camera or use any special markers or input gloves on the hand. [ABSTRACT FROM AUTHOR]

This paper proposes a content based image retrieval system that uses semantic labels for determining image similarity. Thus, it aims to bridge the semantic gap between human perception and low-level features. Our approach works in two stages. Image segments, obtained from a subset of images in the database by an adaptive k-means clustering algorithm, are labelled manually during the training stage. The training information is used to label all the images in the database during the second stage. When a query is given, it is also segmented and each segment is labelled using the information available from the training stage. Similarity score between the query and a database image is based on the labels associated with the two images. Our results on two test databases show that region labelling helps in increasing the retrieval precision when compared to feature-based matching. [ABSTRACT FROM AUTHOR]

Intrusion Detection system has become the main research focus in the area of information security. Last few years have witnessed a large variety of technique and model to provide increasingly efficient intrusion detection solutions. We advocate here that the intrusive behavior of a process is highly localized characteristics of the process. There are certain smaller episodes in a process that make the process intrusive in an otherwise normal stream. As a result it is unnecessary and most often misleading to consider the whole process in totality and to attempt to characterize its abnormal features. In the present work we establish that subsequences of reasonably small length of sequence of system calls would suffice to identify abnormality in a process. We make use of rough set theory to demonstrate this concept. Rough set theory also facilitates identifying rules for intrusion detection. The main contributions of the paper are the following- (a) It is established that very small subsequence of system call is sufficient to identify intrusive behavior with high accuracy. We demonstrate our result using DARPA'98 BSM data; (b) A rough set based system is developed that can extract rules for intrusion detection; (c) An algorithm is presented that can determine the status of a process as either normal or abnormal on-line. Keywords: Data mining, Decision Table, Rough Set, Intrusion Detection, Anomaly, Misuse. [ABSTRACT FROM AUTHOR]

Masquerade detection is one of major concerns of system security research due to two main reasons. Such an attack cannot be detected at the time of access and any detection technique relies on user's signature and even a legitimate user is likely to deviate from its usual usage pattern. In the recent years, there have been several proposals to efficiently detect masquerader while keeping the false alarm rate as low as possible. One of the recent technique, Naive Bayes with truncated command line, has been very successful in maintaining low false alarm rate. This method depends on probability of individual commands. It is more appropriate to consider meaningful groups of commands rather than individual commands. In this paper we propose a method of masquerade detection by considering episodes, meaningful subsequences of commands. The main contributions of the present work are (i) an algorithm to determine episode from a long sequence of commands, and (ii) a technique to use these episodes to detect masquerade block of commands. Our experiments with standard datasets such as SEA dataset reveal that the episode based detection is a more useful masquerade detection technique. [ABSTRACT FROM AUTHOR]

The significance of representing duration information along with the qualitative information of the time intervals is well argued in the literature. A new framework INDu (INterval and DUration) network consisting of 25 basic relations, is proposed here. INDu can handle qualitative information of time interval and duration in one single structure. It inherits many interesting properties of Allen's Interval Algebra (of 13 basic relations) but it also exhibits severed interesting additional features. We present several representations of INDu (ORD-clause, Geometric and Lattice) and characterise its tractable subclasses such as the Convex and Pre-convex classes. The important contribution of the current study is to show that for the tractable subclasses (Convex as well as Pre-convex) 4-consistency is necessary to guarantee global consistency of INDu-network. [ABSTRACT FROM AUTHOR]