Solving a part classification problem using simulated annealing-like hybrid

Part classification and coding is still considered as laborious and time-consuming exercise. Keeping in view, the crucial role, which it plays, in developing automated CAPP systems, the attempts have been made in this article to automate a few elements of this exercise using a shape analysis model. In this study, a 24-vector directional template is contemplated to represent the feature elements of the parts (candidate and prototype). Various transformation processes such as deformation, straightening, bypassing, insertion and deletion are embedded in the proposed simulated annealing (SA)-like hybrid algorithm to match the candidate part with their prototype. For a candidate part, searching its matching prototype from the information data is computationally expensive and requires large search space. However, the proposed SA-like hybrid algorithm for solving the part classification problem considerably minimizes the search space and ensures early convergence of the solution. The application of the proposed approach is illustrated by an example part. The proposed approach is applied for the classification of 100 candidate parts and their prototypes to demonstrate the effectiveness of the algorithm. (C) 2003 Elsevier Science Ltd. All rights reserved.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.

A Seven-Level Inverter Topology for Induction Motor Drive Using Two-Level Inverters and Floating Capacitor Fed H-Bridges

A multilevel inverter topology for seven-level space vector generation is proposed in this paper. In this topology, the seven-level structure is realized using two conventional two-level inverters and six capacitor-fed H-bridge cells. It needs only two isolated dc-voltage sources of voltage rating V(dc)/2 where V(dc) is the dc voltage magnitude required by the conventional neutral point clamped (NPC) seven-level topology. The proposed topology is capable of maintaining the H-bridge capacitor voltages at the required level of V(dc)/6 under all operating conditions, covering the entire linear modulation and overmodulation regions, by making use of the switching state redundancies. In the event of any switch failure in H-bridges, this inverter can operate in three-level mode, a feature that enhances the reliability of the drive system. The two-level inverters, which operate at a higher voltage level of V(dc)/2, switch less compared to the H-bridges, which operate at a lower voltage level of V(dc)/6, resulting in switching loss reduction. The experimental verification of the proposed topology is carried out for the entire modulation range, under steady state as well as transient conditions.

Transient analysis in Al-doped barium strontium titanate thin films grown by pulsed laser deposition

Thin films of (Ba0.5Sr0.5)TiO3 (BST) with different concentrations of Al doping were grown using a pulsed laser deposition technique. dc leakage properties were studied as a function of Al doping level and compared to that of undoped BST films. With an initial Al doping level of 0.1 at. % which substitutes Ti in the lattice site, the films showed a decrease in the leakage current, however, for 1 at. % Al doping level the leakage current was found to be relatively higher. Current time measurements at elevated temperatures on 1 at. % Al doped BST films revealed space-charge transient type characteristics. A complete analysis of the transient characteristics was carried out to identify the charge transport process through variation of applied electric field and ambient temperature. The result revealed a very low mobility process comparable to ionic motion, and was found responsible for the observed feature. Calculation from ionic diffusivity and charge transport revealed a conduction process associated with an activation energy of around 1 eV. The low mobility charge carriers were identified as oxygen vacancies in motion under the application of electric field. Thus a comprehensive understanding of the charge transport process in highly acceptor doped BST was developed and it was conclusive that the excess of oxygen vacancies created by intentional Al doping give rise to space-charge transient type characteristics. © 2001 American Institute of Physics.

Geomagnetic Storms Over India: A Close Look at Historic Space Weather at Mumbai

The swirling colors of aurorae, familiar to many in polar communities, can occasionally be seen at middle latitudes in locations such as southern Canada and central Europe. But in rare instances, aurorae can even be seen in the tropics. On 6 February 1872, news of the sighting of one such aurora was carried by the Times of India newspaper. The aurora occurred on 4 February 1872 and, as noted, was also observed over the Middle East.

An Adaptive Feature Based Low Power Motion Estimation Algorithm

Motion Estimation is one of the most power hungry operations in video coding. While optimal search (eg. full search)methods give best quality, non optimal methods are often used in order to reduce cost and power. Various algorithms have been used in practice that trade off quality vs. complexity. Global elimination is an algorithm based on pixel averaging to reduce complexity of motion search while keeping performance close to that of full search. We propose an adaptive version of the global elimination algorithm that extracts individual macro-block features using Hadamard transform to optimize the search. Performance achieved is close to the full search method and global elimination. Operational complexity and hence power is reduced by 30% to 45% compared to global elimination method.

Efficiently Approximating Query Optimizer Plan Diagrams

Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the optimizer over the query parameter space. These diagrams have proved to be a powerful metaphor for the analysis and redesign of modern optimizers, and are gaining currency in diverse industrial and academic institutions. However, their utility is adversely impacted by the impractically large computational overheads incurred when standard brute-force exhaustive approaches are used for producing fine-grained diagrams on high-dimensional query templates. In this paper, we investigate strategies for efficiently producing close approximations to complex plan diagrams. Our techniques are customized to the features available in the optimizer's API, ranging from the generic optimizers that provide only the optimal plan for a query, to those that also support costing of sub-optimal plans and enumerating rank-ordered lists of plans. The techniques collectively feature both random and grid sampling, as well as inference techniques based on nearest-neighbor classifiers, parametric query optimization and plan cost monotonicity. Extensive experimentation with a representative set of TPC-H and TPC-DS-based query templates on industrial-strength optimizers indicates that our techniques are capable of delivering 90% accurate diagrams while incurring less than 15% of the computational overheads of the exhaustive approach. In fact, for full-featured optimizers, we can guarantee zero error with less than 10% overheads. These approximation techniques have been implemented in the publicly available Picasso optimizer visualization tool.

Memory Architecture Exploration Framework for Cache Based Embedded SoC

Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and lower energy consumption. The memory architecture of the embedded system strongly influences critical system design objectives like area, power and performance. Hence the embedded system designer performs a complete memory architecture exploration to custom design a memory architecture for a given set of applications. Further, the designer would be interested in multiple optimal design points to address various market segments. However, tight time-to-market constraints enforces short design cycle time. In this paper we address the multi-level multi-objective memory architecture exploration problem through a combination of exhaustive-search based memory exploration at the outer level and a two step based integrated data layout for SPRAM-Cache based architectures at the inner level. We present a two step integrated approach for data layout for SPRAM-Cache based hybrid architectures with the first step as data-partitioning that partitions data between SPRAM and Cache, and the second step is the cache conscious data layout. We formulate the cache-conscious data layout as a graph partitioning problem and show that our approach gives up to 34% improvement over an existing approach and also optimizes the off-chip memory address space. We experimented our approach with 3 embedded multimedia applications and our approach explores several hundred memory configurations for each application, yielding several optimal design points in a few hours of computation on a standard desktop.

Structural Variability in the Monofluoroethynylbenzenes Mediated through Interactions Involving ``Organic'' Fluorine

Competition among weak intermolecular interactions can lead to polymorphism, the appearance of various crystalline forms of a substance with comparable cohesive energies. The crystal structures of 2-fluorophenylacetylene (2FPA) and 3-fluorophenylacetylene (3FPA), both of which are liquids at ambient conditions, have been determined by in situ cryocrystallization. Both compounds exhibit dimorphs, with one of the forms observed in common, P2(1), Z = 2 and the other form being Pna2(1), Z = 4 for 2FPA and P2(1)/c, Z = 12 for 3FPA. Variations in the crystal structures of the dimorphs of each of these compounds arise from subtle differences in the way in which weak intermolecular interactions such as C-H center dot center dot center dot pi and C-H center dot center dot center dot F are manifested. The interactions involving ``organic'' fluorine, are entirely different from those in the known structure of 4-fluorophenylacetylene (4FPA), space group P2(1)/c, Z = 4. The commonalities and differences in these polymorphs of 2FPA and 3FPA have been analyzed in terms of supramolecular synthons and extended long-range synthon aufbau module (LSAM) patterns. These structures are compared with the three polymorphs of phenylacetylene, in terms of the T-shaped C-H center dot center dot center dot pi interaction, a feature common to all these structures.