A General Route to Nanoparticle Thin Films and Coatings

Nanoparticles thin films have wide range of applications such as nanoelectronics, magnetic storage devices, SERS substrate fabrication, optical grating and antireflective coating. Present work describes a method to prepare large area nanoparticles thin film of the order of few square centimeters. Thin film deposition has been done successfully on a wide range of conducting as well as non conducting substrates such as carbon-coated copper grid, silicon, m-plane of alumina, glass and (100) plane of NaCl single crystal. SEM, TEM and AFM studies have been done for microstructural characterization of the thin films. A basic mechanism has been proposed towards the understanding of the deposition process.

Fault-Tolerant Average Execution Time Optimization for General Purpose Multi-Processor System-on Chips

Fault-tolerance is due to the semiconductor technology development important, not only for safety-critical systems but also for general-purpose (non-safety critical) systems. However, instead of guaranteeing that deadlines always are met, it is for general-purpose systems important to minimize the average execution time (AET) while ensuring fault-tolerance. For a given job and a soft (transient) error probability, we define mathematical formulas for AET that includes bus communication overhead for both voting (active replication) and rollback-recovery with checkpointing (RRC). And, for a given multi-processor system-on-chip (MPSoC), we define integer linear programming (ILP) models that minimize AET including bus communication overhead when: (1) selecting the number of checkpoints when using RRC, (2) finding the number of processors and job-to-processor assignment when using voting, and (3) defining fault-tolerance scheme (voting or RRC) per job and defining its usage for each job. Experiments demonstrate significant savings in AET.

Topological analysis of general linear networks

A new method of network analysis, a generalization in several different senses of existing methods and applicable to all networks for which a branch-admittance (or impedance) matrix can be formed, is presented. The treatment of network determinants is very general and essentially four terminal rather than three terminal, and leads to simple expressions based on trees of a simple graph associated with the network and matrix, and involving products of low-order, usually(2 times 2)determinants of tree-branch admittances, in addition to tree-branch products as in existing methods. By comparison with existing methods, the total number of trees and of tree pairs is usually considerably reduced, and this fact, together with an easy method of tree-pair sign determination which is also presented, makes the new method simpler in general. The method can be very easily adapted, by the use of infinite parameters, to accommodate ideal transformers, operational amplifiers, and other forms of network constraint; in fact, is thought to be applicable to all linear networks.

A general construction of space-time trellis codes for PSK signal sets

The diversity order and coding gain are crucial for the performance of a multiple antenna communication system. It is known that space-time trellis codes (STTC) can be used to achieve these objectives. In particular, we can use STTCs to obtain large coding gains. Many attempts have been made to construct STTCs which achieve full-diversity and good coding gains, though a general method of construction does not exist. Delay diversity code (rate-1) is known to achieve full-diversity, for any number of transmit antennas and any signal set, but does not give a good coding gain. A product distance code based delay diversity scheme (Tarokh, V. et al., IEEE Trans. Inform. Theory, vol.44, p.744-65, 1998) enables one to improve the coding gain and construct STTCs for any given number of states using coding in conjunction with delay diversity; it was stated as an open problem. We achieve such a construction. We assume a shift register based model to construct an STTC for any state complexity. We derive a sufficient condition for this STTC to achieve full-diversity, based on the delay diversity scheme. This condition provides a framework to do coding in conjunction with delay diversity for any signal constellation. Using this condition, we provide a formal rate-1 STTC construction scheme for PSK signal sets, for any number of transmit antennas and any given number of states, which achieves full-diversity and gives a good coding gain.

Formulas for algorithmic computation of impedance matrix using general circuit constants

A set of formulas is derived from general circuit constants which facilitates formation of the impedance matrix of a power system by the bus-impedance method. The errors associated with the lumpedparameter representation of a transmission line are thereby eliminated. The formulas are valid for short lines also, if the relevant general circuit constants are employed. The mutual impedance between the added line and the existing system is not considered, but the approach suggested can well be extended to it.

Association rule mining activity : A general formalism

Mining association rules from a large collection of databases is based on two main tasks. One is generation of large itemsets; and the other is finding associations between the discovered large itemsets. Existing formalism for association rules are based on a single transaction database which is not sufficient to describe the association rules based on multiple database environment. In this paper, we give a general characterization of association rules and also give a framework for knowledge-based mining of multiple databases for association rules.

General classical theory of spinning particles in a meson field

An exact classical theory of the motion of a point dipole in a meson field is given which takes into account the effects of the reaction of the emitted meson field. The meson field is characterized by a constant $\chi =\mu /\hslash $ of the dimensions of a reciprocal length, $\mu $ being the meson mass, and as $\chi \rightarrow $ 0 the theory of this paper goes over continuously into the theory of the preceding paper for the motion of a spinning particle in a Maxwell field. The mass of the particle and the spin angular momentum are arbitrary mechanical constants. The field contributes a small finite addition to the mass, and a negative moment of inertia about an axis perpendicular to the spin axis. A cross-section (formula (88 a)) is given for the scattering of transversely polarized neutral mesons by the rotation of the spin of the neutron or proton which should be valid up to energies of 10$^{9}$ eV. For low energies E it agrees completely with the old quantum cross-section, having a dependence on energy proportional to p$^{4}$/E$^{2}$ (p being the meson momentum). At higher energies it deviates completely from the quantum cross-section, which it supersedes by taking into account the effects of radiation reaction on the rotation of the spin. The cross-section is a maximum at E $\sim $ 3$\cdot $5$\mu $, its value at this point being 3 $\times $ 10$^{-26}$ cm.$^{2}$, after which it decreases rapidly, becoming proportional to E$^{-2}$ at high energies. Thus the quantum theory of the interaction of neutrons with mesons goes wrong for E $\gtrsim $ 3$\mu $. The scattering of longitudinally polarized mesons is due to the translational but not the rotational motion of the dipole and is at least twenty thousand times smaller. With the assumption previously made by the present author that the heavy partilesc may exist in states of any integral charge, and in particular that protons of charge 2e and - e may occur in nature, the above results can be applied to charged mesons. Thus transversely polarised mesons should undergo a very big scattering and consequent absorption at energies near 3$\cdot $5$\mu $. Hence the energy spectrum of transversely polarized mesons should fall off rapidly for energies below about 3$\mu $. Scattering plays a relatively unimportant part in the absorption of longitudinally polarized mesons, and they are therefore much more penetrating. The theory does not lead to Heisenberg explosions and multiple processes.

Discovering injective episodes with general partial orders

Frequent episode discovery is a popular framework for temporal pattern discovery in event streams. An episode is a partially ordered set of nodes with each node associated with an event type. Currently algorithms exist for episode discovery only when the associated partial order is total order (serial episode) or trivial (parallel episode). In this paper, we propose efficient algorithms for discovering frequent episodes with unrestricted partial orders when the associated event-types are unique. These algorithms can be easily specialized to discover only serial or parallel episodes. Also, the algorithms are flexible enough to be specialized for mining in the space of certain interesting subclasses of partial orders. We point out that frequency alone is not a sufficient measure of interestingness in the context of partial order mining. We propose a new interestingness measure for episodes with unrestricted partial orders which, when used along with frequency, results in an efficient scheme of data mining. Simulations are presented to demonstrate the effectiveness of our algorithms.

Vertical uplift capacity of a group of two coaxial anchors in a general c-phi soil

The vertical uplift resistance of a group of two horizontal coaxial strip anchors, embedded in a general c-phi soil (where c is the unit cohesion and phi is the soil friction angle), has been determined by using the lower bound finite element limit analysis. The variation of uplift factors F-c and F-gamma, due to the components of soil cohesion and unit weight, respectively, with changes in depth (H)/width (B) has been established for different values of vertical spacing (S)/B. As compared to a single isolated anchor, the group of two anchors provides a significantly greater magnitude of F-c for phi <= 20 degrees and with H/B >= 3. The magnitude of F-c becomes almost maximum when S/B is kept closer to 0.5H/B. On the other hand, with the same H/B, as compared to a single anchor, hardly any increase in F-gamma occurs for a group of two anchors.

A tracking-based general framework to image halftoning

Existing approches to digital halftoning of image are based primarily on thresholding. We propose a general framework fot image halftoning whcrc some function uf the output halftone tracks another function of the input gray-tone.This appcoach is shown lo unify most existing algorithms and to provide useful insights. Further, the new intcrpretation allows us to remedy problems in existing aigorithrms such as the error dlffusion, and sohsequently to achieve halftones haavmg superior quality. The proposed method is very general nature is an advantage since it offers a wide choice of three Cilters and a update rule. An intercstmg product of this framework is that equally good, or better, half-tones are possible ro be obtained by thresholding a noise proccess instead of the image itself.

General-sum stochastic games: Verifiability conditions for Nash equilibria

Unlike zero-sum stochastic games, a difficult problem in general-sum stochastic games is to obtain verifiable conditions for Nash equilibria. We show in this paper that by splitting an associated non-linear optimization problem into several sub-problems, characterization of Nash equilibria in a general-sum discounted stochastic games is possible. Using the aforementioned sub-problems, we in fact derive a set of necessary and sufficient verifiable conditions (termed KKT-SP conditions) for a strategy-pair to result in Nash equilibrium. Also, we show that any algorithm which tracks the zero of the gradient of the Lagrangian of every sub-problem provides a Nash strategy-pair. (c) 2012 Elsevier Ltd. All rights reserved.

Nearly constant switching frequency hysteresis current controller for general n-level inverter fed induction motor drive

A current-error space phasor based hysteresis controller with nearly constant switching frequency is proposed for a general n-level voltage source inverter fed three-phase induction motor drive. Like voltage-controlled space vector PWM (SVPWM), the proposed controller can precisely detect sub-sector changes and for switching it selects only the nearest switching voltage vectors using the information of the estimated fundamental stator voltages along α and β axes. It provides smooth transition between voltage levels, including operation in over modulation region. Due to adjacent switching amongst the nearest switching vectors forming a triangular sub-sector, in which tip of the fundamental stator voltage vector of the machine lies, switching loss is reduced while keeping the current-error space phasor within the varying parabolic boundary. Appropriate dimension and orientation of this parabolic boundary ensures similar switching frequency spectrum like constant switching frequency SVPWM-based induction motor (IM) drive. Inherent advantages of multi-level inverter and space phasor based current hysteresis controller are retained. The proposed controller is simulated as well as implemented on a 5-level inverter fed 7.5 kW open-end winding IM drive.