Minimal pathset and minimal cutsets using search technique

Application of graph theory to reliability analysis was first made in 1970 ^[1]. Over the years, a large number of computer programmes have been developed to determine the spanning trees, the minimal paths and cutsets, which are essential for determining the reliability of the network. In recent years, there has been an interest 2., 4. in developing small desk top calculators for specific purposes, which could be used by the designers of transportation systems, communication systems, etc. In this article the authors present an approach to design a microprocessor based equipment to determine minimal pathset and minimal cutset from the incidence matrix of the graph. The authors have presented a new design approach, based on search technique. The salient feature of the new approach is a novel tracing process in which the desired graph is traced by operating a set of constraints. The new design approach has already been used by the authors to develop a microprocessor based spanning tree generator 2., 3..     

An intrinsic dimensionality estimator from near-neighbor information

The intrinsic dimensionality of a set of patterns is important in determining an appropriate number of features for representing the data and whether a reasonable two- or three-dimensional representation of the data exists. We propose an intuitively appealing, noniterative estimator for intrinsic dimensionality which is based on nearneighbor information. We give plausible arguments supporting the consistency of this estimator. The method works well in identifying the true dimensionality for a variety of artificial data sets and is fairly insensitive to the number of samples and to the algorithmic parameters. Comparisons between this new method and the global eigenvalue approach demonstrate the utility of our estimator.     

Optical properties of CdS sintered film

Chemical method has been used to prepare cadmium sulphide by using cadmium, hydrochloric acid and H₂S. The reflection spectra of covered and uncovered sintered films of CdS have been recorded by ‘Hitachi spectrophotometer’ over the wavelength range 300–700 nm. The energy band gaps of these films have been calculated from reflection spectra. It is found that the energy band gap of both films is same as 2.41 eV. It is indicated that energy band gap of these films does not change. This value of band gap is in good agreement with the value reported by other workers. The measurement of photocurrent has also been carried out using Keithley High Resistance meter/ Electrometer. This film shows the high photosensitivity and high photocurrent decay. Thus so obtained films are suitable for fabrication of photo detectors and solar cells.     

Hybridization of stochastic reduced basis methods with polynomial chaos expansions

We propose a hybrid formulation combining stochastic reduced basis methods with polynomial chaos expansions for solving linear random algebraic equations arising from discretization of stochastic partial differential equations. Our objective is to generalize stochastic reduced basis projection schemes to non-Gaussian uncertainty models and simplify the implementation of higher-order approximations. We employ basis vectors spanning the preconditioned stochastic Krylov subspace to represent the solution process. In the present formulation, the polynomial chaos decomposition technique is used to represent the stochastic basis vectors in terms of multidimensional Hermite polynomials. The Galerkin projection scheme is then employed to compute the undetermined coefficients in the reduced basis approximation. We present numerical studies on a linear structural problem where the Youngs modulus is represented using Gaussian as well as lognormal models to illustrate the performance of the hybrid stochastic reduced basis projection scheme. Comparison studies with the spectral stochastic finite element method suggest that the proposed hybrid formulation gives results of comparable accuracy at a lower computational cost.     

Integrated starter generator for 42-V powernet using induction machine and direct torque control technique

This paper describes an integrated starter generator (ISG) for automobile applications with 42-V powernet. This system is based on an induction machine which is directly mounted on the engine crankshaft and controlled using the technique of direct torque control (DTC). The suitability of the technique for ISG application is explained. The control structure of DTC for ISG application is described. Detailed experimental results from a 1.4-1 diesel engine are presented demonstrating the performance of the system during cranking as well as generation. The ISG also incorporates the feature of "on the fly start" during generation mode. Details of a low voltage high current power converter developed for this application are also given.     

Generating discriminating cartoon faces using interacting snakes

As a computational bridge between the high-level a priori knowledge of object shape and the low-level image data, active contours (or snakes) are useful models for the extraction of deformable objects. We propose an approach for manipulating multiple snakes iteratively, called interacting snakes, that minimizes the attraction energy functionals on both contours and enclosed regions of individual snakes and the repulsion energy functionals among multiple snakes that interact with each other. We implement the interacting snakes through explicit curve (parametric active contours) representation in the domain of face recognition. We represent human faces semantically via facial components such as eyes, mouth, face outline, and the hair outline. Each facial component is encoded by a closed (or open) snake that is drawn from a 3D generic face model. A collection of semantic facial components form a hypergraph, called semantic face graph, which employs interacting snakes to align the general facial topology onto the sensed face images. Experimental results show that a successful interaction among multiple snakes associated with facial components makes the semantic face graph a useful model for face representation, including cartoon faces and caricatures, and recognition.     

Parallel implementation of time-dependent density functional theory

We present a massively parallel implementation of time-dependent density functional theory in real space, aimed at computing optical absorption spectra of realistic systems with hundreds of atoms from first principles. We provide details of the formalism and discuss its implementation, optimization, and efficient parallelization, as well as remaining limitations, in detail. The capabilities of the code are illustrated by calculations of optical properties of hydrogenated silicon quantum dots.     

Integrating faces and fingerprints for personal identification

An automatic personal identification system based solely on fingerprints or faces is often not able to meet the system performance requirements. We have developed a prototype biometrics system which integrates faces and fingerprints. The system overcomes the limitations of face recognition systems as well as fingerprint verification systems. The integrated prototype system operates in the identification mode with an admissible response time. The identity established by the system is more reliable than the identity established by a face recognition system. In addition, the proposed decision fusion scheme enables performance improvement by integrating multiple cues with different confidence measures. Experimental results demonstrate that our system performs very well. It meets the response time as well as the accuracy requirements     

Optimal registration of object views using range data

This paper deals with robust registration of object views in the presence of uncertainties and noise in depth data. Errors in registration of multiple views of a 3D object severely affect view integration during automatic construction of object models. We derive a minimum variance estimator (MVE) for computing the view transformation parameters accurately from range data of two views of a 3D object. The results of our experiments show that view transformation estimates obtained using MVE are significantly more accurate than those computed with an unweighted error criterion for registration