Archives-September 2011

This paper will presents a method of finding a relations between similar speeches signals which are speaker independent taken from common set of samples of Chhattisgarhi language and dialects commonly spoken at different regions of Chhattisgarh. The objective of this paper is to detect similar and dissimilar patterns of different Chhattisgarhi dialects through wavelet analysis methods which are useful for complex speech signal analysis. Through wavelet transforms parameters are extracted from speech corpus and then relations are established.

The improvement of current Question Answering (QA) systems relies on finding ways to support the traditional statistic approach to QA with logic reasoning. In this presentation we show one way of supporting an Interactive Question answering system with logic reasoning. The most likely answer to a question by searching a predicate format of topic-arranged question patterns and responses. Answer Finder is a framework for the development of question-answering systems. Answer Finder is currently being used to test the applicability of graph representations for the detection and extraction of answers. In this paper we briefly describe Answer Finder and introduce our method to learn graph patterns that link questions with their corresponding answers in arbitrary sentences. The method is based on the translation of the logical forms of questions and answer sentences into graphs, and the application of operations based on graph overlaps and the construction of paths within graphs. The method is general and can be applied to any graph-based representation of the contents of questions and answers.

A time series database is a collection of data that are generated in series as time goes on and constitutes a large portion of data stored in computers like stock-price movements, weather data, bio-medical measurements, video data etc., Two time sequences of same length are said to be similar if the Euclidean distance is less or equal to a given threshold. The main issue of similarity search in time series databases is to improve the search performance since time sequences are usually of high dimension. So it is important to reduce the search space for efficient processing of similarity search in large time series databases. We have used Adaptive Framework for the data reduction purpose which improves the search performance in Recent-Biased time series databases. We have applied a set of linear transformations on the reduced sequence that can be used as the basis for similarity queries on time series data. We have also formalized the intuitive notions of exact and approximate similarity in time series data. Our experiments show that the performance of this method is competitive to that of processing ordinary queries using the index and much faster than sequential scanning.

Face recognition technology has evolved as a popular identification technique to perform verification of human identity. By using the feature extraction methods and dimensionality reduction techniques in the pattern recognition applications, a number of facial recognition systems have been produced with distinct measure of success. Various face recognition algorithms and their extensions; have been proposed in the past two decades. However, face recognition faces challenging problems in real life applications because of the variation in the illumination of the face images, facial expression and background variation. This paper provides a classification of back ground variation includes uniform background and non-uniform background along with facial expression, orientation of the image and illumination invariant using Principal Component Analysis (PCA) and Linear Discriminate Analysis (LDA) face recognition system.

A new architecture of multiplier-and-accumulator (MAC) for high-speed arithmetic. In this by combining multiplication with accumulation and devising a hybrid type of carry save adder (CSA), the performance was improved. The CSA tree uses 1’s-complement- based radix-2. Modified Booth’s algorithm (MBA) and has the modified array for the sign extension in order to increase the bit density of the operands. The CSA propagates the carries to the least significant bits of the partial products and generates the least significant bits in advance to decrease the number of the input bits of the final adder. The MAC accumulates the intermediate results in the type of sum and carry bits instead of the output of the final adder, which made it possible to optimize the pipeline scheme to improve the performance.

The problem of Reoptimization of Steiner Tree is a NP Hard problem. Given a graph and a optimal solution of the Steiner tree and then after a slight modification is done in the initial instance, then a new Steiner minimal tree is to be determined. This is known as reoptimization of Steiner Tree. Several cases of reoptimization of Steiner tree have been discussed. This paper presents a comparative analysis of some of the previous work done on reoptimization of Steiner Tree.

The simple 4D- hyperchaotic dynamics of an autonomous oscillator circuit was studied by measuring its responsible in the form of phase-portrait, power spectrum and hyperchaotic time series. The circuit consists of just four linear elements (two capacitors and two inductors), one linear negative conductance and two ideal diodes. The power spectrums are presented to confirm the strong hyperchaotic nature of the oscillations of the circuit. The performance of the circuit is investigated by means of experimental and numerical confirmation of the appropriate differential equations. The features of the obtained results are respected for various engineering system such as chaos based secure communication systems with robustness against various interferences.

The simple third-order chaotic dynamics of a new autonomous oscillator circuit was studied by measuring its responsible in the form of phase-portrait, power spectrum and chaotic time series. The circuit consists of just three linear elements (two capacitors and one inductor), one linear negative conductance and cubic nonlinearity exhibiting the symmetrical piecewise-linear v-i characteristics. The power spectrums are presented to confirm the lower dimensions of strong chaotic nature of the oscillations of the circuit. The performance of the circuit is investigated by means of experimental and numerical confirmation of the appropriate differential equations. The features of the obtained results are respected for various engineering system such as chaos communication systems with robustness against various interferences.

Equalization techniques compensate for the time dispersion introduced by communication channels and combat the resulting inter-symbol interference (ISI) effect. The purpose of an adaptive equalizer is to operate on the channel output such that the cascade connection of the channel and the equalizer provides an approximation to an ideal transmission medium. This paper compares existing adaptive algorithm for channel equalisation for both DFT and DCT based OFDM system. Simulations results show that performance of Transform Domain Variable stepsize Griffith LMS(TVGLMS) algorithm in channel equalization performs with better convergence speed and better error misadjustment than the LMS algorithm. Further simulation results shows that DCT based OFDM system outperforms DFT –OFDM in terms of BER and PAPR .

The synthesis of various substituted 4-methoxy-1H-quinolin-2-thiones from various substituted aniline with malonicacid, phosphorous-oxychloride, sodium methoxide glacial acetic acid and thiourea under different conditions is described. The title compounds were synthesized from four steps; the first step involved the synthesis of substituted 2, 4-dichloro quinoline from aniline (substituted), with malonicacid and phosphorous-oxychloride. In the second step, the substituted 2, 4 Dichloro compound was heated with freshly prepared methanolic sodium methoxide solution to give 2, 4-dimethoxy quinoline compounds, it was then refluxed with glacial acetic acid and hydrochloric acid to get the substituted 4-methoxy-1H-quinolin-2-one. The final steps involves with an objective of introducing a chloro in the position 2 of the quinolone system, the substituted 4-methoxy-1H-quinolin-2-one was refluxed with distilled Pocl3 chloroform. The substituted 2-chloro-4-methoxy quinoline was then refluxed with thiourea and alcohol to get the titled compounds. The purity of the synthesized compound was judged by their C, H and N analysis and the structure was analyzed on the basics of Mass, FT-IR, and 1H NMR.