339 resultados para virtual topology, decomposition, hex meshing algorithms
Resumo:
By employing EXAFS and magnetic measurements, it is shown that nanoparticles of nickel along with those of NiO are incorporated between the layers of a-zirconium phosphate (ZrP) by the thermal decomposition of nickel acetate intercalated in ZrP. The nickel nanoparticles are superparamagnetic. Hydrogen reduction produces small ferromagnetic nickel particles, most of which appear to be outside the interlayer space of ZrP.
Resumo:
We present a complete solution to the problem of coherent-mode decomposition of the most general anisotropic Gaussian Schell-model (AGSM) beams, which constitute a ten-parameter family. Our approach is based on symmetry considerations. Concepts and techniques familiar from the context of quantum mechanics in the two-dimensional plane are used to exploit the Sp(4, R) dynamical symmetry underlying the AGSM problem. We take advantage of the fact that the symplectic group of first-order optical system acts unitarily through the metaplectic operators on the Hilbert space of wave amplitudes over the transverse plane, and, using the Iwasawa decomposition for the metaplectic operator and the classic theorem of Williamson on the normal forms of positive definite symmetric matrices under linear canonical transformations, we demonstrate the unitary equivalence of the AGSM problem to a separable problem earlier studied by Li and Wolf [Opt. Lett. 7, 256 (1982)] and Gori and Guattari [Opt. Commun. 48, 7 (1983)]. This conn ction enables one to write down, almost by inspection, the coherent-mode decomposition of the general AGSM beam. A universal feature of the eigenvalue spectrum of the AGSM family is noted.
Resumo:
A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.
Resumo:
C17H19ClO, M(r) = 274.7, triclinic, P1BAR, a = 11.154 (3), b = 12.685 (2), c = 12.713 (2) angstrom, alpha = 100.68 (1), beta = 113.58 (1), gamma = 104.50 (2)-degrees, V = 1511.1 (6) angstrom3, Z = 4, D(m) = 1.22, D(x) = 1.215 Mg m-3, Cu K-alpha, lambda = 1.5418 angstrom, mu = 2.16 mm-1, F(000) = 584, T = 293 K, R = 0.057 for 3481 observed reflections. The title compound is photostable in the crystalline state and lattice-energy calculations have been employed to rationalize the photobehaviour. The well-known beta-steering ability of the chloro group is not operative in this system as there are no Cl...Cl interactions in the crystal lattice. All five benzylidene-DL-piperitone structures so far studied are alpha-packed and the molecular topology appears to be a deciding factor even in the presence of steering groups.
Resumo:
The decomposition of the beta phase in rapidly quenched Ti-2.8 at. pet Co, Ti-5.4 at. pet Ni, Ti-4.5 at. pet, and 5.5 at. pet Cu alloys has been investigated by electron microscopy. During rapid quenching, two competitive phase transformations, namely martensitic and eutectoid transformation, have occurred, and the region of eutectoid transformation is extended due to the high cooling rates involved. The beta phase decomposed into nonlamellar eutectoid product (bainite) having a globular morphology in Ti-2.8 pet Co and Ti-4.5 pet Cu (hypoeutectoid) alloys. In the near-eutectoid Ti-5.5 pet Cu alloy, the decomposition occurred by a lamellar (pearlite) type, whereas in Ti-5.4 pct Ni (hypereutectoid), both morphologies were observed. The interfaces between the proeutectoid alpha and the intermetallic compound in the nonlamellar type as well as between the proeutectoid alpha and the pearlite were often found to be partially coherent. These findings are in agreement with the Lee and Aaronson model proposed recently for the evolution of bainite and pearlite structures during the solid-state transformations of some titanium-eutectoid alloys. The evolution of the Ti2Cu phase during rapid quenching involved the formation of a metastable phase closely related to an ''omega-type'' phase before the equilibrium phase formed. Further, the lamellar intermetallic compound Ti2Cu was found to evolve by a sympathetic nucleation process. Evidence is established for the sympathetic nucleation of the proeutectoid alpha crystals formed during rapid quenching.
Resumo:
An important tool in signal processing is the use of eigenvalue and singular value decompositions for extracting information from time-series/sensor array data. These tools are used in the so-called subspace methods that underlie solutions to the harmonic retrieval problem in time series and the directions-of-arrival (DOA) estimation problem in array processing. The subspace methods require the knowledge of eigenvectors of the underlying covariance matrix to estimate the parameters of interest. Eigenstructure estimation in signal processing has two important classes: (i) estimating the eigenstructure of the given covariance matrix and (ii) updating the eigenstructure estimates given the current estimate and new data. In this paper, we survey some algorithms for both these classes useful for harmonic retrieval and DOA estimation problems. We begin by surveying key results in the literature and then describe, in some detail, energy function minimization approaches that underlie a class of feedback neural networks. Our approaches estimate some or all of the eigenvectors corresponding to the repeated minimum eigenvalue and also multiple orthogonal eigenvectors corresponding to the ordered eigenvalues of the covariance matrix. Our presentation includes some supporting analysis and simulation results. We may point out here that eigensubspace estimation is a vast area and all aspects of this cannot be fully covered in a single paper. (C) 1995 Academic Press, Inc.
Resumo:
In this paper, the classical problem of homogenization of elliptic operators in arbitrary domains with periodically oscillating coefficients is considered. Using Bloch wave decomposition, a new proof of convergence is furnished. It sheds new light and offers an alternate way to view the classical results. In a natural way, this method leads us to work in the Fourier space and thus in a framework dual to the one used by L. Tartar [Problemes d'Homogeneisation dans les Equations aux: Derivees Partielles, Cours Peccot au College de Prance, 1977] in his method of homogenization. Further, this technique offers a nontraditional way of calculating the homogenized coefficients which is easy to implement in the computer.
Resumo:
Vapor-phase pyrolysis of Fe(CO)(5) in the presence of another carbon source such as CO or Ca He yields iron-filled or hollow nanotubes depending on the relative concentration of the carbon source. Essentially single-walled nanotubes are obtained when the C6H6/Fe(CO)(5) ratio is high. Pyrolysis of metallocenes yields metal-filled nanotubes and hollow nanotubes are obtained when metallocenes are pyrolyzed along with benzene. Metal-decorated nanotubes are also obtained by this method.
Resumo:
Genetic algorithms (GAs) are search methods that are being employed in a multitude of applications with extremely large search spaces. Recently, there has been considerable interest among GA researchers in understanding and formalizing the working of GAs. In an earlier paper, we have introduced the notion of binomially distributed populations as the central idea behind an exact ''populationary'' model of the large-population dynamics of the GA operators for objective functions called ''functions of unitation.'' In this paper, we extend this populationary model of GA dynamics to a more general class of objective functions called functions of unitation variables. We generalize the notion of a binomially distributed population to a generalized binomially distributed population (GBDP). We show that the effects of selection, crossover, and mutation can be exactly modelled after decomposing the population into GBDPs. Based on this generalized model, we have implemented a GA simulator for functions of two unitation variables-GASIM 2, and the distributions predicted by GASIM 2 match with those obtained from actual GA runs. The generalized populationary model of GA dynamics not only presents a novel and natural way of interpreting the workings of GAs with large populations, but it also provides for an efficient implementation of the model as a GA simulator. (C) Elsevier Science Inc. 1997.
Resumo:
We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length, Results are extended to the multiserver queue. Some illustrative numerical examples are provided.
Resumo:
Thin films of barium strontium titanate (BST) including BaTiO3 and SrTiO3 end members were deposited using the metallo-organic decomposition (MOD) technique. Processing parameters such as nonstoichiometry, annealing temperature and time, film thickness and doping concentration were correlated with the structural and electrical properties of the films. A random polycrystalline structure was observed for all MOD films under the processing conditions in this study. The microstructures of the films showed multi-grains structure through the film thickness. A dielectric constant of 563 was observed for (Ba0.7Sr0.3)TiO3 films rapid thermal annealed at 750 degrees C for 60 s. The dielectric constant increased with annealing temperature and film thickness, while the dielectric constant could reach the bulk values for thicknesses as thin as similar to 0.3 mu m. Nonstoichiometry and doping in the films resulted in a lowering of the dielectric constant. For near-stoichiometric films, a small dielectric dispersion obeying the Curie-von Schweidler type dielectric response was observed. This behavior may be attributed to the presence of the high density of disordered grain boundaries. All MOD processed films showed trap-distributed space-charge limited conduction (SCLC) behavior with slope of similar to 7.5-10 regardless of the chemistry and processing parameter due to the presence of main boundaries through the film thickness. The grain boundaries masked the effect of donor-doping, so that all films showed distributed-trap SCLC behavior without discrete-traps. Donor-doping could significantly improve the time-dependent dielectric breakdown behavior of BST thin films, mostly likely due to the lower oxygen vacancy concentration resulted from donor-doping. From the results of charge storage density, leakage current and time-dependent dielectric breakdown behavior, BST thin films are found to be promising candidates for 64 and 256Mb ULSI DRAM applications. (C) 1997 Elsevier Science S.A.
Resumo:
The aim of logic synthesis is to produce circuits which satisfy the given boolean function while meeting timing constraints and requiring the minimum silicon area. Logic synthesis involves two steps namely logic decomposition and technology mapping. Existing methods treat the two as separate operation. The traditional approach is to minimize the number of literals without considering the target technology during the decomposition phase. The decomposed expressions are then mapped on to the target technology to optimize the area, Timing optimization is carried out subsequently, A new approach which treats logic decomposition and technology maping as a single operation is presented. The logic decomposition is based on the parameters of the target technology. The area and timing optimization is carried out during logic decomposition phase itself. Results using MCNC circuits are presented to show that this method produces circuits which are 38% faster while requiring 14% increase in area.
Resumo:
ASICs offer the best realization of DSP algorithms in terms of performance, but the cost is prohibitive, especially when the volumes involved are low. However, if the architecture synthesis trajectory for such algorithms is such that the target architecture can be identified as an interconnection of elementary parameterized computational structures, then it is possible to attain a close match, both in terms of performance and power with respect to an ASIC, for any algorithmic parameters of the given algorithm. Such an architecture is weakly programmable (configurable) and can be viewed as an application specific integrated processor (ASIP). In this work, we present a methodology to synthesize ASIPs for DSP algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.
Resumo:
This paper presents a general methodology for the synthesis of the external boundary of the workspaces of a planar manipulator with arbitrary topology. Both the desired workspace and the manipulator workspaces are identified by their boundaries and are treated as simple closed polygons. The paper introduces the concept of best match configuration and shows that the corresponding transformation can be obtained by using the concept of shape normalization available in image processing literature. Introduction of the concept of shape in workspace synthesis allows highly accurate synthesis with fewer numbers of design variables. This paper uses a new global property based vector representation for the shape of the workspaces which is computationally efficient because six out of the seven elements of this vector are obtained as a by-product of the shape normalization procedure. The synthesis of workspaces is formulated as an optimization problem where the distance between the shape vector of the desired workspace and that of the workspace of the manipulator at hand are minimized by changing the dimensional parameters of the manipulator. In view of the irregular nature of the error manifold, the statistical optimization procedure of simulated annealing has been used. A number of worked-out examples illustrate the generality and efficiency of the present method. (C) 1998 Elsevier Science Ltd. All rights reserved.
Resumo:
This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.