168 resultados para Group algebra
Resumo:
An enantiospecific synthesis of the angular triquinane system present in the sesquiterpenes cameroonanes and silphiperfolanes has been accomplished, starting from 5-isopropenyl-2-methylcyclopent-1-ene-1-methanol [readily available in three steps from (R)-limonene] employing an intramolecular rhodium carbenoid insertion into the C-H bond of a tertiary methyl group for the construction of the triquinane system.
Resumo:
A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.
Resumo:
A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or more engineers is generally taken by the lead, based on customer delivery deadlines and a guided complexity assessment from each maintenance engineer. The key challenge in such a scenario is two folds, un-truthful (hiked up) elicitation of ticket complexity by each engineer to the lead and the decision of allocating the ticket to a group of engineers who will solve the ticket with in customer deadline. The decision of allocation should ensure Individual and Coalitional Rationality along with Coalitional Stability. In this paper we use game theory to examine the issue of truthful elicitation of ticket complexities by engineers for solving ticket as a group given a specific customer delivery deadline. We formulate this problem as strategic form game and propose two mechanisms, (1) Division of Labor (DOL) and (2) Extended Second Price (ESP). In the proposed mechanisms we show that truth telling by each engineer constitutes a Dominant Strategy Nash Equilibrium of the underlying game. Also we analyze the existence of Individual Rationality (IR) and Coalitional Rationality (CR) properties to motivate voluntary and group participation. We use Core, solution concept from co-operative game theory to analyze the stability of the proposed group based on the allocation and payments.
Resumo:
Background: The present paper documents the uses of plants in traditional herbal medicine for human and veterinary ailments, and those used for dietary supplements, religious purpose, local beverage, and plants used to poison fish and wild animals. Traditional botanical medicine is the primary mode of healthcare for most of the rural population in Arunachal Pradesh. Materials and methods: Field research was conducted between April 2006 and March 2009 with randomly selected 124 key informants using semi-structured questionnaire. The data obtained was analyzed through informant consensus factor (F(IC)) to determine the homogeneity of informant's knowledge on medicinal plants. Results: We documented 50 plants species belonging to 29 families used for treating 22 human and 4 veterinary ailments. Of the medicinal plants reported, the most common growth form was herbs (40%) followed by shrubs, trees, and climbers. Leaves were most frequently used plant parts. The consensus analysis revealed that the dermatological ailments have the highest F(IC) (0.56) and the gastro-intestinal diseases have F(IC) (0.43). F(IC) values indicated that there was high agreement in the use of plants in dermatological and gastro-intestinal ailments category among the users. Gymnocladus assamicus is a critically rare and endangered species used as disinfectant for cleaning wounds and parasites like leeches and lice on livestocks. Two plant species (Illicium griffithii and Rubia cordifolia) are commonly used for traditional dyeing of clothes and food items. Some of the edible plants recorded in this study were known for their treatment against high blood pressure (Clerodendron colebrookianum), diabetes mellitus (Momordica charantia), and intestinal parasitic worms like round and tape worms (Lindera neesiana, Solanum etiopicum, and Solanum indicum). The Monpas of Arunachal Pradesh have traditionally been using Daphne papyracea for preparing hand-made paper for painting and writing religious scripts in Buddhist monasteries. Three plant species (Derris scandens, Aesculus assamica, and Polygonum hydropiper) were frequently used to poison fish during the month of June-July every year and the underground tuber of Aconitum ferrox is widely used in arrow poisoning to kill ferocious animals like bear, wild pigs, gaur and deer. The most frequently cited plant species; Buddleja asiatica and Hedyotis scandens were used as common growth supplements during the preparation of fermentation starter cultures. Conclusion: The traditional pharmacopoeia of the Monpa ethnic group incorporates a myriad of diverse botanical flora. Traditional knowledge of the remedies is passed down through oral traditions without any written document. This traditional knowledge is however, currently threatened mainly due to acculturation and deforestation due to continuing traditional shifting cultivation. This study reveals that the rural populations in Arunachal Pradesh have a rich knowledge of forest-based natural resources and consumption of wild edible plants is still an integral part of their socio-cultural life. Findings of this documentation study can be used as an ethnopharmacological basis for selecting plants for future phytochemical and pharmaceutical studies.
Resumo:
Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.
Resumo:
Numerical Linear Algebra (NLA) kernels are at the heart of all computational problems. These kernels require hardware acceleration for increased throughput. NLA Solvers for dense and sparse matrices differ in the way the matrices are stored and operated upon although they exhibit similar computational properties. While ASIC solutions for NLA Solvers can deliver high performance, they are not scalable, and hence are not commercially viable. In this paper, we show how NLA kernels can be accelerated on REDEFINE, a scalable runtime reconfigurable hardware platform. Compared to a software implementation, Direct Solver (Modified Faddeev's algorithm) on REDEFINE shows a 29X improvement on an average and Iterative Solver (Conjugate Gradient algorithm) shows a 15-20% improvement. We further show that solution on REDEFINE is scalable over larger problem sizes without any notable degradation in performance.
Resumo:
In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.
Resumo:
Abstract | In this article the shuffling of cards is studied by using the concept of a group action. We use some fundamental results in Elementary Number Theory to obtain formulas for the orders of some special shufflings, namely the Faro and Monge shufflings and give necessary and sufficient conditions for the Monge shuffling to be a cycle. In the final section we extend the considerations to the shuffling of multisets.
Resumo:
We show that the Wiener Tauberian property holds for the Heisenberg Motion group TnB
Resumo:
We investigate the effect of static electron-phonon coupling on real-time dynamics of spin and charge transport in pi-conjugated polyene chains. The polyene chain is modeled by the Pariser-Parr-Pople Hamiltonian with dimerized nearest-neighbor parameter t(0)(1 + delta) for short bonds and t(0)(1 - delta) for long bonds, and long-range electron-electron interactions. We follow the time evolution of the spin and charge using time-dependent density matrix renormalization group technique when a hole is injected at one end of the chain in its ground state. We find that spin and charge dynamics followed through spin and charge velocities depend both on chain length and extent of dimerization delta. Analysis of the results requires focusing on physical quantities such as average spin and charge polarizations, particularly in the large dimerization limit. In the dimerization range 0.0 <= delta <= 0.15, spin-charge dynamics is found to have a well-defined behavior, with spin-charge separation (measured as the ratio of charge velocity to spin velocity) as well as the total amount of charge and spin transported in a given time along the chain decreasing as dimerization increases. However, in the range 0.3 <= delta <= 0.5, it is observed that the dynamics of spin and charge transport becomes complicated. It is observed that, for large delta values, spin-charge separation is suppressed and the injected hole fails to travel the entire length of the chain.
Resumo:
The symmetrized density matrix renormalization group method is used to study linear and nonlinear optical properties of free base porphine and metalloporphine. Long-range interacting model, namely, Pariser-Parr-Pople model is employed to capture the quantum many-body effect in these systems. The nonlinear optical coefficients are computed within the correction vector method. The computed singlet and triplet low-lying excited state energies and their charge densities are in excellent agreement with experimental as well as many other theoretical results. The rearrangement of the charge density at carbon and nitrogen sites, on excitation, is discussed. From our bond order calculation, we conclude that porphine is well described by the 18-annulenic structure in the ground state and the molecule expands upon excitation. We have modeled the regular metalloporphine by taking an effective electric field due to the metal ion and computed the excitation spectrum. Metalloporphines have D(4h) symmetry and hence have more degenerate excited states. The ground state of metalloporphines shows 20-annulenic structure, as the charge on the metal ion increases. The linear polarizability seems to increase with the charge initially and then saturates. The same trend is observed in third order polarizability coefficients. (C) 2012 American Institute of Physics. [doi: 10.1063/1.3671946]
Resumo:
In this paper we investigate the effect of terminal substituents on the dynamics of spin and charge transport in donor-acceptor substituted polyenes [D-(CH)(x)-A] chains, also known as push-pull polyenes. We employ a long-range correlated model Hamiltonian for the D-(CH)(x)-A system, and time-dependent density matrix renormalization group technique for time propagating the wave packet obtained by injecting a hole at a terminal site, in the ground state of the system. Our studies reveal that the end groups do not affect spin and charge velocities in any significant way, but change the amount of charge transported. We have compared these push-pull systems with donor-acceptor substituted polymethine imine (PMI), D-(CHN)(x)-A, systems in which besides electron affinities, the nature of p(z) orbitals in conjugation also alternate from site to site. We note that spin and charge dynamics in the PMIs are very different from that observed in the case of push-pull polyenes, and within the time scale of our studies, transport of spin and charge leads to the formation of a ``quasi-static'' state.