Fixed Point Decimal Multiplication Using RPS Algorithm

Decimal multiplication is an integral part of financial, commercial, and internet-based computations. A novel design for single digit decimal multiplication that reduces the critical path delay and area for an iterative multiplier is proposed in this research. The partial products are generated using single digit multipliers, and are accumulated based on a novel RPS algorithm. This design uses n single digit multipliers for an n × n multiplication. The latency for the multiplication of two n-digit Binary Coded Decimal (BCD) operands is (n + 1) cycles and a new multiplication can begin every n cycle. The accumulation of final partial products and the first iteration of partial product generation for next set of inputs are done simultaneously. This iterative decimal multiplier offers low latency and high throughput, and can be extended for decimal floating-point multiplication.

Genetic algorithm based indicator sequence method for exon prediction

Considerable research effort has been devoted in predicting the exon regions of genes. The binary indicator (BI), Electron ion interaction pseudo potential (EIIP), Filter method are some of the methods. All these methods make use of the period three behavior of the exon region. Even though the method suggested in this paper is similar to above mentioned methods , it introduces a set of sequences for mapping the nucleotides selected by applying genetic algorithm and found to be more promising

An Improved Design of Combinational Digital Circuits with Multiplexers using Genetic Algorithm

This paper presents a new approach to the design of combinational digital circuits with multiplexers using Evolutionary techniques. Genetic Algorithm (GA) is used as the optimization tool. Several circuits are synthesized with this method and compared with two design techniques such as standard implementation of logic functions using multiplexers and implementation using Shannon’s decomposition technique using GA. With the proposed method complexity of the circuit and the associated delay can be reduced significantly

Array pattern nulling by element position perturbations using a genetic algorithm

A genetic algorithm has been used for null steering in phased and adaptive arrays . It has been shown that it is possible to steer the array null s precisely to the required interference directions and to achieve any prescribed null depths . A comparison with the results obtained from the analytic solution shows the advantages of using the genetic algorithm for null steering in linear array patterns

Dynamic mechanical analysis of binary and ternary polymer blends based on nylon copolymer/EPDM rubber and EPM grafted maleic anhydride compatibilizer

The dynamic mechanical properties such as storage modulus, loss modulus and damping properties of blends of nylon copolymer (PA6,66) with ethylene propylene diene (EPDM) rubber was investigated with special reference to the effect of blend ratio and compatibilisation over a temperature range –100°C to 150°C at different frequencies. The effect of change in the composition of the polymer blends on tanδ was studied to understand the extent of polymer miscibility and damping characteristics. The loss tangent curve of the blends exhibited two transition peaks, corresponding to the glass transition temperature (Tg) of individual components indicating incompatibility of the blend systems. The morphology of the blends has been examined by using scanning electron microscopy. The Arrhenius relationship was used to calculate the activation energy for the glass transition of the blends. Finally, attempts have been made to compare the experimental data with theoretical models.

Studies on New Binary Accelerator Systems in Rubber Vulcanisation

Department of Polymer Science and Rubber Technology, Cochin University of Science and Technology

Acid-Base, Surface electron donating and catalytic properties of binary oxides of Zr with rare earth elements

Department of Applied Chemistry, Cochin University of Science and Technology

Acid base characteristics of binary oxides of Zr with Ce and La

The surface acidity and basicity of binary oxides of Zr with Ce and La are determined using a series of Hammet indicators and Ho,,max values are reported. The generation of new acid sites habe been ascribed to the charge imbalance of M1-O-M2 bonds, where M1 and M2 are metal atoms. Both Bronsted and Lewis acid sites contribute to the acidity of the oxides

Study on acceleratore in rubber vulcanization with special reference to the binary systems containing substituted dithiobiurets

The thesis entitled Study on Accelerators in Rubber Vulcanization with Special Reference to the Binary Systems Containing Substituted Dithiobiurets. It includes a detailed study on the binary accelerator systems containing substituted dithiobiurets in natural rubber and NR latex and dithiobiurets in SBR and NR-SBR blends vulcanization systems. It deals with the experimental procedure adopted for the preparation of DTB-II and DTB-III; the procedure for compounding and vulcanization and determination of physical properties like modulus, tensile strength, elongation at break, hardness, compression set, heat build up etc. The results indicate that there is efficient acceleration activity of the dithiobiurets in the vulcanization of natural rubber latex containing TMT. The study of dithiobiurets in natural rubber and NR latex reveal that they are having definite accelerating effect in SBR vulcanization systems.

Multi-objective assembly job shop scheduling using genetic algorithm and tabu search

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.

Acid-Base. Surface Electron Donatin6 &.Catai.Ytlc Properties Of Some Binary Mixed Oxides Containing Rare Earth Elements

Catalysis research underpins the science of modern chemical processing and fuel technologies. Catalysis is commercially one of the most important technologies in national economies. Solid state heterogeneous catalyst materials such as metal oxides and metal particles on ceramic oxide substrates are most common. They are typically used with commodity gases and liquid reactants. Selective oxidation catalysts of hydrocarbon feedstocks is the dominant process of converting them to key industrial chemicals, polymers and energy sources.[1] In the absence of a unique successfiil theory of heterogeneous catalysis, attempts are being made to correlate catalytic activity with some specific properties of the solid surface. Such correlations help to narrow down the search for a good catalyst for a given reaction. The heterogeneous catalytic performance of material depends on many factors such as [2] Crystal and surface structure of the catalyst. Thermodynamic stability of the catalyst and the reactant. Acid- base properties of the solid surface. Surface defect properties of the catalyst.Electronic and semiconducting properties and the band structure. Co-existence of dilferent types of ions or structures. Adsorption sites and adsorbed species such as oxygen.Preparation method of catalyst , surface area and nature of heat treatment. Molecular structure of the reactants. Many systematic investigations have been performed to correlate catalytic performances with the above mentioned properties. Many of these investigations remain isolated and further research is needed to bridge the gap in the present knowledge of the field.

A Novel Decision Tree Algorithm for Numeric Datasets - C 4.5*Stat

Decision trees are very powerful tools for classification in data mining tasks that involves different types of attributes. When coming to handling numeric data sets, usually they are converted first to categorical types and then classified using information gain concepts. Information gain is a very popular and useful concept which tells you, whether any benefit occurs after splitting with a given attribute as far as information content is concerned. But this process is computationally intensive for large data sets. Also popular decision tree algorithms like ID3 cannot handle numeric data sets. This paper proposes statistical variance as an alternative to information gain as well as statistical mean to split attributes in completely numerical data sets. The new algorithm has been proved to be competent with respect to its information gain counterpart C4.5 and competent with many existing decision tree algorithms against the standard UCI benchmarking datasets using the ANOVA test in statistics. The specific advantages of this proposed new algorithm are that it avoids the computational overhead of information gain computation for large data sets with many attributes, as well as it avoids the conversion to categorical data from huge numeric data sets which also is a time consuming task. So as a summary, huge numeric datasets can be directly submitted to this algorithm without any attribute mappings or information gain computations. It also blends the two closely related fields statistics and data mining

Ultrasound Image Despeckling using Local Binary Pattern Weighted Linear Filtering

Speckle noise formed as a result of the coherent nature of ultrasound imaging affects the lesion detectability. We have proposed a new weighted linear filtering approach using Local Binary Patterns (LBP) for reducing the speckle noise in ultrasound images. The new filter achieves good results in reducing the noise without affecting the image content. The performance of the proposed filter has been compared with some of the commonly used denoising filters. The proposed filter outperforms the existing filters in terms of quantitative analysis and in edge preservation. The experimental analysis is done using various ultrasound images