1000 resultados para GENERATION
Resumo:
This paper describes a methodology of obtaining only third harmonic along with the fundamental using shaped superconductors. It also indicates how one can design a nonlinear superconducting resistor with the required current versus resistance variation.
Resumo:
Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.
Resumo:
Five tartrate-amine complexes have been studied in terms of crystal packing and hydrogen bonding frameworks. The salts are 3-bromoanilinium-L-monohydrogen tartrate 1, 3-fluoroanilinium-D-dibenzoylmonohydrogen tartrate 2, 1-nonylium-D-dibenzoylmonohydrogen tartrate 3, 1 -decylium-D-dibenzoylmonohydrogen tartrate 4, and 1,4-diaminobutanium-D-dibenzoyl tartrate trihydrate 5. The results indicate that there are no halogen-halogen interactions in the haloaromatic-tartrate complexes. The anionic framework allows accomodation of ammonium ions that bear alkyl chain residues of variable lengths. The long chain amines in these structures remain disordered while the short chain amines form multidirectional hydrogen bonds on either side.
Resumo:
The magnitude and stability of the induced dipolar orientation of 2-methyl-4-nitroaniline (MNA)/poly(methyl methacrylate) (PMMA) guest/host system is investigated. The chromophores are aligned using both the corona discharge and contact electrode poling techniques. The magnitude of order parameter (also an indicator for the second order nonlinear susceptibility) is measured by recording absorbances of the poled (by the two different techniques) and unpoled PMMA films at different concentrations of MNA. Under the same conditions the corona poling technique creates a higher alignment of molecules along the field direction. The time dependence of the second harmonic intensity of the MNA/PMMA film prepared by the two techniques can be described by a Kohlrausch-Williams-Watts stretched exponential. The temperature dependence of the decay time constant is found to generally follow a modified Williams-Landel-Ferry (WLF) or Vogel-Tamann-Fulcher (VTF) equation. The glass transition temperature seems to be the single most important parameter for determining the relaxation time tau(T).
Resumo:
Cheap and readily available iodotrichlorosilane (SiCl4 / NaI) readily regenerates aldehydes and ketones from cyclic and acyclic acetals and ketals, in 20–60 min at ambient temperature. The reaction is highly chemoselective as phenolic ethers and esters are not cleaved. The pathway for the process is unlike any previously proposed.
Resumo:
Some conventional finite elements suffer from drawbacks, such as shear locking, membrane locking, etc. To overcome them researchers have developed various techniques, termed as tricks by some and variational crimes by others. Many attempts have been made, but satisfactory explanations for why some of these techniques work have not been obtained, especially in the case of solid elements. This paper attempts a simple non-conforming solid element using assumed displacement fields which satisfy the Navier equation exactly. Its behaviour under simple loadings like bending, torsion and tension is examined and comparisons are made with existing elements.
Resumo:
Several substituted anilines were converted to binary salts with L-tartaric acid. Second harmonic generation (SHG) activities of these salts were determined. The crystal packing in two structures, (i) m-anisidinium-L-tartrate monohydrate (i) and (ii) p-toluidinium-L-tartrate (2), studied using X-ray diffraction demonstrates that extensive hydrogen bonding steers the components into a framework which has a direct bearing on the SHG activity
Resumo:
Ten different mouse cell lines were examined for Japanese encephalitis virus (JEV) infection in vitro and then tested for their ability to generate virus specific cytotoxic T lymphocytes (CTL). Among all cell lines examined, Neuro La (a neuroblastoma) was readily infected with JEV as examined by immunofluorescence and viral replication. Among other cells, P388D1, RAW 264.7 (Macrophage origin), Sp2/0 (B-cell Hybridoma), YAC-1 (T-cell lymphoma), and L929 (Fibroblast) were semipermissive to JEV infection. The cytopathic effects caused by progressive JEV infection varied from cell line to cell line. In the case of YAC-1 cells long-term viral antigen expression was observed without significant alterations in cell viability. Intermediate degrees of cytopathicity are seen in RAW 264.7 and L929 cells while infection of PS, Neuro 2a, P388D1 and Sp2/0 caused major viability losses. All infected cell lines were able to prime adult BALB/c (H-2(d)) mice for the generation of secondary JEV specific CTL. In contrast to YAC-1, the permissive neuroblastoma cell line Neuro 2a (H-2K(k)D(d)) was found to be least efficient in its ability to stimulate anti-viral CTL generation. Cold target competition studies demonstrated that both Neuro 2a and YAC-1 (H-2K(k)D(d)) cells expressed similar viral determinants that are recognised by CTL, suggesting that the reason for the lower ability of Neuro 2a to stimulate anti-viral CTL was not due to lack of viral CTL determinants. These findings demonstrate that a variety of mouse cell lines can be infected with Japanese encephalitis virus, and that these infected cells could be utilised to generate virus specific CTL in BALB/c mice.
Resumo:
A mechanism is presented here for the amplification of large-scale nonaxisymmetric magnetic fields as a manifestation of the dynamo effect. We generalize a result on restrictions of dynamo actions due to laminar flow originally derived by Zeldovich, Ruzmaikin, and Sokolov [Magnetic Fields in Astrophysics (Gordon and Breach, New York, 1983)]. We show how a screwlike motion having phi and z components of velocity can help to grow a magnetic field. This model postulates a large-scale flow having phi and z components with radial dependences (helical flow). Shear in the radial field, because of a near-flux-freezing condition, causes amplification of the phi component of the magnetic field. The radial and axial components grow due to the presence of turbulent diffusion. The shear in the large scale flow induces an indefinite growth of magnetic field without the a effect; nevertheless, turbulent diffusion forms an important part in the overall mechanism.
Resumo:
Trace processors rely on hierarchy, replication, and prediction to dramatically increase the execution speed of ordinary sequential programs. The authors describe some of the processors will meet future technology demands.
Resumo:
This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.
Resumo:
A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding are forced to do inter-generation network coding, as a result of which the problem of some or all sinks requiring a large amount of memory for decoding is faced. In this work, we address this problem by utilizing memory elements at the internal nodes of the network also, which results in the reduction of the number of memory elements used at the sinks. We give an algorithm which employs memory at all the nodes of the network to achieve single- generation network coding. For fixed latency, our algorithm reduces the total number of memory elements used in the network to achieve single- generation network coding. We also discuss the advantages of employing single-generation network coding together with convolutional network-error correction codes (CNECCs) for networks with unit- delay and illustrate the performance gain of CNECCs by using memory at the intermediate nodes using simulations on an example network under a probabilistic network error model.
Resumo:
This paper formulates the automatic generation control (AGC) problem as a stochastic multistage decision problem. A strategy for solving this new AGC problem formulation is presented by using a reinforcement learning (RL) approach This method of obtaining an AGC controller does not depend on any knowledge of the system model and more importantly it admits considerable flexibility in defining the control objective. Two specific RL based AGC algorithms are presented. The first algorithm uses the traditional control objective of limiting area control error (ACE) excursions, where as, in the second algorithm, the controller can restore the load-generation balance by only monitoring deviation in tie line flows and system frequency and it does not need to know or estimate the composite ACE signal as is done by all current approaches. The effectiveness and versatility of the approaches has been demonstrated using a two area AGC model. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
In this paper, a wind energy conversion system (WECS) using grid-connected wound rotor induction machine controlled from the rotor side is compared with both fixed speed and variable speed systems using cage rotor induction machine. The comparison is done on the basis of (I) major hardware components required, (II) operating region, and (III) energy output due to a defined wind function using the characteristics of a practical wind turbine. Although a fixed speed system is more simple and reliable, it severely limits the energy output of a wind turbine. In case of variable speed systems, comparison shows that using a wound rotor induction machine of similar rating can significantly enhance energy capture. This comes about due to the ability to operate with rated torque even at supersynchronous speeds; power is then generated out of the rotor as well as the stator. Moreover, with rotor side control, the voltage rating of the power devices and dc bus capacitor bank is reduced. The size of the line side inductor also decreasesd. Results are presented to show the substantial advantages of the doubly fed system.