942 resultados para Maximum Principles
Resumo:
This paper addresses the problem of maximum margin classification given the moments of class conditional densities and the false positive and false negative error rates. Using Chebyshev inequalities, the problem can be posed as a second order cone programming problem. The dual of the formulation leads to a geometric optimization problem, that of computing the distance between two ellipsoids, which is solved by an iterative algorithm. The formulation is extended to non-linear classifiers using kernel methods. The resultant classifiers are applied to the case of classification of unbalanced datasets with asymmetric costs for misclassification. Experimental results on benchmark datasets show the efficacy of the proposed method.
Resumo:
The free surface effects on stacking fault and twin formation in fcc metals (Al, Cu, and Ni) were examined by first-principles calculations based on density functional theory (DFT). It is found that the generalized planar fault (GPF) energies of Ni are much larger than bulk Ni with respect to Al and Cu. The discrepancy is attributed to the localized relaxation of Ni nanofilm to accommodate the large expansion of the inter-planar separation induced at the fault plane. The localized relaxation can be coupled to the electronic structure of Ni nanofilms. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
In this work, we explore simultaneous design and material selection by posing it as an optimization problem. The underlying principles for our approach are Ashby's material selection procedure and structural optimization. For the simplicity and ease of initial implementation of the general procedure, truss structures under static load are considered in this work in view of maximum stiffness, minimum weight/cost and safety against failure. Along the lines of Ashby's material indices, a new design index is derived for trusses. This helps in choosing the most suitable material for any design of a truss. Using this, both the design space and material database are searched simultaneously using optimization algorithms. The important feature of our approach is that the formulated optimization problem is continuous even though the material selection is an inherently discrete problem.
Resumo:
It has been shown recently that the maximum rate of a 2-real-symbol (single-complex-symbol) maximum likelihood (ML) decodable, square space-time block codes (STBCs) with unitary weight matrices is 2a/2a complex symbols per channel use (cspcu) for 2a number of transmit antennas [1]. These STBCs are obtained from Unitary Weight Designs (UWDs). In this paper, we show that the maximum rates for 3- and 4-real-symbol (2-complex-symbol) ML decodable square STBCs from UWDs, for 2a transmit antennas, are 3(a-1)/2a and 4(a-1)/2a cspcu, respectively. STBCs achieving this maximum rate are constructed. A set of sufficient conditions on the signal set, required for these codes to achieve full-diversity are derived along with expressions for their coding gain.
Resumo:
It is well known that the space-time block codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the unitary matrix representations of Clifford Algebras when the number of transmit antennas n is a power of 2. The rate of the square CODs for n = 2(a) has been shown to be a+1/2(a) complex symbols per channel use. However, SSD codes having unitary-weight matrices need not be CODs, an example being the minimum-decoding-complexity STBCs from quasi-orthogonal designs. In this paper, an achievable upper bound on the rate of any unitary-weight SSD code is derived to be a/2(a)-1 complex symbols per channel use for 2(a) antennas, and this upper bound is larger than that of the CODs. By way of code construction, the interrelationship between the weight matrices of unitary-weight SSD codes is studied. Also, the coding gain of all unitary-weight SSD codes is proved to be the same for QAM constellations and conditions that are necessary for unitary-weight SSD codes to achieve full transmit diversity and optimum coding gain are presented.
Resumo:
A new technique is presented using principles of multisignal relaying for the synthesis of a universal-type quadrilateral polar characteristic. The modus operandi consists in the determination of the phase sequence of a set of voltage phasors and the provision of a trip signal for one sequence while blocking for the other. Two versions, one using ferrite-core logic and another using transistor logic, are described in detail. The former version has the merit of simplicity and has the added advantage of not requiring any d.c. supply. The unit is flexible, as it permits independent control of the characteristic along the resistance and reactance axis through suitable adjustments of replica impedance angles. The maximum operating time is about 20ms for all switching angles, and with faults within 95% of the protected section. The maximum transient overreach is about 8%.
Resumo:
We show with the aid of first-principles electronic structure calculations that suitable choice of the capping ligands may be an important control parameter for crystal structure engineering of nanoparticles. Our calculations on CdS nanocrystals reveal that the binding energy of model trioctylphosphine molecules on the (001) facets of zincblende nanocrystals is larger compared to that on wurtzite facets. Similarly, the binding energy of model cis-oleic acid is found to be dominant for the (10 (1) over bar0) facets of wurtzite structure. As a consequence, trioctylphosphine as a capping agent stabilizes the zincblende structure while cis-oleic acid stabilizes the wurtzite phase by influencing the surface energy, which has a sizable contribution to the energetics of a nanocrystal. Our detailed analysis suggests that the binding of molecules on the nanocrystalline facets depends on the surface topology of the facets, the coordination of the surface atoms where the capping molecule is likely to attach, and the conformation of the capping molecule.
Resumo:
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.
Resumo:
When a light beam passes through any medium, the effects of interaction of light with the material depend on the field intensity. At low light intensities the response of materials remain linear to the amplitude of the applied electromagnetic field. But for sufficiently high intensities, the optical properties of materials are no longer linear to the amplitude of applied electromagnetic field. In such cases, the interaction of light waves with matter can result in the generation of new frequencies due to nonlinear processes such as higher harmonic generation and mixing of incident fields. One such nonlinear process, namely, the third order nonlinear spectroscopy has become a popular tool to study molecular structure. Thus, the spectroscopy based on the third order optical nonlinearity called stimulated Raman spectroscopy (SRS) is a tool to extract the structural and dynamical information about a molecular system. Ultrafast Raman loss spectroscopy (URLS) is analogous to SRS but is more sensitive than SRS. In this paper, we present the theoretical basis of SRS (URLS) techniques which have been developed in our laboratory.
Resumo:
We determine the nature of coupled phonons and magnetic excitations in AlFeO3 using inelastic light scattering from 5 to 315 K covering a spectral range from 100 to 2200 cm(-1) and complementary first-principles density functional theory-based calculations. A strong spin-phonon coupling and magnetic ordering-induced phonon renormalization are evident in (1) anomalous temperature dependence of many modes with frequencies below 850 cm(-1), particularly near the magnetic transition temperature T-c approximate to 250 K, and (2) distinct changes in band positions of high-frequency Raman bands between 1100 and 1800 cm(-1); in particular, a broad mode near 1250 cm(-1) appears only below T-c, attributed to the two-magnon Raman scattering. We also observe weak anomalies in the mode frequencies similar to 100 K due to a magnetically driven ferroelectric phase transition. Understanding of these experimental observations has been possible on the basis of first-principles calculations of the phonons' spectrum and their coupling with spins.
Resumo:
In this paper we study constrained maximum entropy and minimum divergence optimization problems, in the cases where integer valued sufficient statistics exists, using tools from computational commutative algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. We give an implicit description of maximum entropy models by embedding them in algebraic varieties for which we give a Grobner basis method to compute it. In the cases of minimum KL-divergence models we show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner basis method to embed minimum KL-divergence models in algebraic varieties. (C) 2012 Elsevier Inc. All rights reserved.
Resumo:
A review of various contributions of first principles calculations in the area of hydrogen storage, particularly for the carbon-based sorption materials, is presented. Carbon-based sorption materials are considered as promising hydrogen storage media due to their light weight and large surface area. Depending upon the hybridization state of carbon, these materials can bind the hydrogen via various mechanisms, including physisorption, Kubas and chemical bonding. While attractive binding energy range of Kubas bonding has led to design of several promising storage systems, in reality the experiments remain very few due to materials design challenges that are yet to be overcome. Finally, we will discuss the spillover process, which deals with the catalytic chemisorption of hydrogen, and arguably is the most promising approach for reversibly storing hydrogen under ambient conditions.
Resumo:
The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.