980 resultados para gaussian-basis sets
Resumo:
Results are reported of comparative measurements made in 14 HV (high-voltage) laboratories in ten different countries. The theory of the proposed methods of characterizing the dynamic behavior is given, and the parameters to be used are discussed. Comparative measurements made using 95 systems based on 53 dividers are analyzed. This analysis shows that many of the system now in use, even though they fulfil the basic response requirements of the standards, do not meet the accuracy requirements. Because no transfer measurements were made between laboratories, there is no way to detect similar errors in both the system under test and the reference system. Hence, the situation may be worse than reported. This has led to the recommendation that comparative measurements should be the main route for quantifying industrial impulse measuring systems
Resumo:
Some wild isolates of Neurospora show microcycle conidiation in liquid culture under continuous agitation. Macroconidia from agar-grown mycelial cultures germinated in liquid and the germlings spontaneously produced conidia with no intervening mycelial phase. Three types of microcycle conidiation were seen among progeny of N. crassa Vickramam A x N. crassa a wild-type: (1) multinucleate blastoconidia produced by apical budding and septation, (2) multinucleate arthroconidia produced by holothallic septation and disarticulation of cells, and (3) uninucleate microconidia produced directly from conidiogenous cells of the germlings. Two genes were identified which control specific patterns of microcycle conidiogenesis. A single gene mcb in linkage group VR near al-3 (3.2% recombination) controls blastoconidiation. This gene is epistatic to gene mcm located in linkage group IIL, very near ro-7 (1.4%). mcm controls both microconidiation and arthroconidiation depending on temperature. Strains of genotype mcm produce microconidia almost exclusively at 18-22 degrees C, but arthroconidia with few or no microconidia at 30 degrees C. Because they result in rapid and synchronized conidiation in liquid culture, the two genes should be useful for studies of developmental gene regulation. mcm makes it possible to obtain large quantities of pure microconidia rapidly for experimentation.
Resumo:
In this paper I will offer a novel understanding of a priori knowledge. My claim is that the sharp distinction that is usually made between a priori and a posteriori knowledge is groundless. It will be argued that a plausible understanding of a priori and a posteriori knowledge has to acknowledge that they are in a constant bootstrapping relationship. It is also crucial that we distinguish between a priori propositions that hold in the actual world and merely possible, non-actual a priori propositions, as we will see when considering cases like Euclidean geometry. Furthermore, contrary to what Kripke seems to suggest, a priori knowledge is intimately connected with metaphysical modality, indeed, grounded in it. The task of a priori reasoning, according to this account, is to delimit the space of metaphysically possible worlds in order for us to be able to determine what is actual.
Resumo:
The most prominent objective of the thesis is the development of the generalized descriptive set theory, as we call it. There, we study the space of all functions from a fixed uncountable cardinal to itself, or to a finite set of size two. These correspond to generalized notions of the universal Baire space (functions from natural numbers to themselves with the product topology) and the Cantor space (functions from natural numbers to the {0,1}-set) respectively. We generalize the notion of Borel sets in three different ways and study the corresponding Borel structures with the aims of generalizing classical theorems of descriptive set theory or providing counter examples. In particular we are interested in equivalence relations on these spaces and their Borel reducibility to each other. The last chapter shows, using game-theoretic techniques, that the order of Borel equivalence relations under Borel reduciblity has very high complexity. The techniques in the above described set theoretical side of the thesis include forcing, general topological notions such as meager sets and combinatorial games of infinite length. By coding uncountable models to functions, we are able to apply the understanding of the generalized descriptive set theory to the model theory of uncountable models. The links between the theorems of model theory (including Shelah's classification theory) and the theorems in pure set theory are provided using game theoretic techniques from Ehrenfeucht-Fraïssé games in model theory to cub-games in set theory. The bottom line of the research declairs that the descriptive (set theoretic) complexity of an isomorphism relation of a first-order definable model class goes in synch with the stability theoretical complexity of the corresponding first-order theory. The first chapter of the thesis has slightly different focus and is purely concerned with a certain modification of the well known Ehrenfeucht-Fraïssé games. There we (me and my supervisor Tapani Hyttinen) answer some natural questions about that game mainly concerning determinacy and its relation to the standard EF-game
Resumo:
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.
Resumo:
Let O be a monomial curve in the affine algebraic e-space over a field K and P be the relation ideal of O. If O is defined by a sequence of e positive integers some e - 1 of which form an arithmetic sequence then we construct a minimal set of generators for P and write an explicit formula for mu(P).
Resumo:
The modularity of the supramolecular synthon is used to obtain transferability of charge density derived multipolar parameters for structural fragments, thus creating an opportunity to derive charge density maps for new compounds. On the basis of high resolution X-ray diffraction data obtained at 100 K for three compounds methoxybenzoic acid, acetanilide, and 4-methyl-benzoic acid, multipole parameters for O-H center dot center dot center dot O carboxylic acid dimer and N-H center dot center dot center dot O amide infinite chain synthon fragments have been derived. The robustness associated with these supramolecular synthons has been used to model charge density derived multipolar parameters for 4-(acetylamino)benzoic acid and 4-methylacetanilide. The study provides pointers to the design and fabrication of a synthon library of high resolution X-ray diffraction data sets. It has been demonstrated that the derived charge density features can be exploited in both intra- and intermolecular space for any organic compound based on transferability of multipole parameters. The supramolecular synthon based fragments approach (SBFA) has been compared with experimental charge density data to check the reliability of use of this methodology for transferring charge density derived multipole parameters.
Resumo:
Symmetry?adapted linear combinations of valence?bond (VB) diagrams are constructed for arbitrary point groups and total spin S using diagrammatic VB methods. VB diagrams are related uniquely to invariant subspaces whose size reflects the number of group elements; their nonorthogonality leads to sparser matrices and is fully incorporated into a binary integer representation. Symmetry?adapated linear combinations of VB diagrams are constructed for the 1764 singlets of a half?filled cube of eight sites, the 2.8 million ??electron singlets of anthracene, and for illustrative S?0 systems.
Resumo:
Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Multiple Access schemes (NO-MA) and Orthogonal Multiple Access schemes (O-MA). For NO-MA schemes, a metric is proposed to compute the angle(s) of rotation between the input constellations such that the CC capacity regions are maximally enlarged. Further, code pairs based on Trellis Coded Modulation (TCM) are designed with PSK constellation pairs and PAM constellation pairs such that any rate pair within the CC capacity region can be approached. Such a NO-MA scheme which employs CC capacity approaching trellis codes is referred to as Trellis Coded Multiple Access (TCMA). Then, CC capacity regions of O-MA schemes such as Frequency Division Multiple Access (FDMA) and Time Division Multiple Access (TDMA) are also computed and it is shown that, unlike the Gaussian distributed continuous constellations case, the CC capacity regions with FDMA are strictly contained inside the CC capacity regions with TCMA. Hence, for finite constellations, a NO-MA scheme such as TCMA is better than FDMA and TDMA which makes NO-MA schemes worth pursuing in practice for two-user GMAC. Then, the idea of introducing rotations between the input constellations is used to construct Space-Time Block Code (STBC) pairs for two-user Multiple-Input Single-Output (MISO) fading MAC. The proposed STBCs are shown to have reduced Maximum Likelihood (ML) decoding complexity and information-losslessness property. Finally, STBC pairs with reduced sphere decoding complexity are proposed for two-user Multiple-Input Multiple-Output (MIMO) fading MAC.
Resumo:
Random Access Scan, which addresses individual flip-flops in a design using a memory array like row and column decoder architecture, has recently attracted widespread attention, due to its potential for lower test application time, test data volume and test power dissipation when compared to traditional Serial Scan. This is because typically only a very limited number of random ``care'' bits in a test response need be modified to create the next test vector. Unlike traditional scan, most flip-flops need not be updated. Test application efficiency can be further improved by organizing the access by word instead of by bit. In this paper we present a new decoder structure that takes advantage of basis vectors and linear algebra to further significantly optimize test application in RAS by performing the write operations on multiple bits consecutively. Simulations performed on benchmark circuits show an average of 2-3 times speed up in test write time compared to conventional RAS.
Resumo:
The basis set dependence of the topographical structure of the molecular electrostatic potential (MESP), as well as the effect of substituents on the MESP distribution, has been investigated with substituted benzenes as test cases. The molecules are studied at HF-SCF 3�21G and 6�31G** levels, with a further MESP topographical investigation at the 3�21G, double-zeta, 6�31G*, 6�31G**, double-zeta polarized and triple-zeta polarized levels. The MESP critical points for a 3�21G optimized/6�31G** basis are similar to the corresponding 6�31G** optimized/6�31G** ones. More generally, the qualitative features of the MESP topography computed at the polarized level are independent of the level at which optimization is carried out. For a proper representation of oxygen lone pairs, however, optimization using a polarized basis set is required. The nature of the substituent drastically changes the MESP distribution over the phenyl ring. The values and positions of MESP minima indicate the most active site for electrophilic attack. This point is strengthened by a study of disubstituted benzenes.