987 resultados para funding models
Resumo:
A phenomenological model of spin sharing by the constituents of a proton is constructed, based on the recent EMC measurement of the spin dependent structure function and knowledge of the unpolarized parton densities.
Resumo:
We report novel results obtained for the Hubbard and t-J models by various mean-field approximations.
Resumo:
The excitation gaps in the singlet and triplet manifolds for finite Hubbard models in one, two and three dimensions have been obtained using different approximate configuration interaction (CI) schemes, as a function of the correlation strength, by using valence bond (VB) functions constructed over the molecular orbital (MO) basis. These are compared with numerically exact results and it is found that the scheme in which all particle hole excitations below a given threshold are included is the method of choice. The excitation energies are well reproduced, in trend as well as magnitude, particularly when the threshold equals the bandwidth of the corresponding noninteracting system.
Resumo:
We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.
Resumo:
Multiband Hubbard and Pariser-Parr-Pople calculations have been carried out on mixed donor-acceptor (DA) stacks with doubly degenerate acceptor orbitals and nondegenerate donor orbitals at two-thirds filling. Model exact results for 2, 3, and 4 DA units show that McConnell's prediction of high-spin ground states in these systems is, in general, incorrect. The larger phase space available for the low-spin states leads to their kinetic stabilization in preference to high-spin states. However, for large electron-correlation strengths, the direct exchange dominates over the kinetic exchange resulting in a high-spin ground state
Resumo:
Load-deflection curves for a notched beam under three-point load are determined using the Fictitious Crack Model (FCM) and Blunt Crack Model (BCM). Two values of fracture energy GF are used in this analysis: (i) GF obtained from the size effect law and (ii) GF obtained independently of the size effect. The predicted load-deflection diagrams are compared with the experimental ones obtained for the beams tested by Jenq and Shah. In addition, the values of maximum load (Pmax) obtained by the analyses are compared with the experimental ones for beams tested by Jenq and Shah and by Bažant and Pfeiffer. The results indicate that the descending portion of the load-deflection curve is very sensitive to the GF value used.
Resumo:
In this paper we present simple methods for construction and evaluation of finite-state spell-checking tools using an existing finite-state lexical automaton, freely available finite-state tools and Internet corpora acquired from projects such as Wikipedia. As an example, we use a freely available open-source implementation of Finnish morphology, made with traditional finite-state morphology tools, and demonstrate rapid building of Northern Sámi and English spell checkers from tools and resources available from the Internet.
Resumo:
We analyze here the occurrence of antiferromagnetic (AFM) correlations in the half-filled Hubbard model in one and two space dimensions using a natural fermionic representation of the model and a newly proposed way of implementing the half-filling constraint. We find that our way of implementing the constraint is capable of enforcing it exactly already at the lowest levels of approximation. We discuss how to develop a systematic adiabatic expansion for the model and how Berry's phase contributions arise quite naturally from the adiabatic expansion. At low temperatures and in the continuum limit the model gets mapped onto an O(3) nonlinear sigma model (NLsigma). A topological, Wess-Zumino term is present in the effective action of the ID NLsigma as expected, while no topological terms are present in 2D. Some specific difficulties that arise in connection with the implementation of an adiabatic expansion scheme within a thermodynamic context are also discussed, and we hint at possible solutions.
Resumo:
The phenomenological theory of hemispherical growth in the context of phase formation with more than one component is presented. The model discusses in a unified manner both instantaneous and progressive nucleation (at the substrate) as well as arbitrary growth rates (e.g. constant and diffusion controlled growth rates). A generalized version of Avrami ansatz (a mean field description) is used to tackle the ''overlap'' aspects arising from the growing multicentres of the many components involved, observing that the nucleation is confined to the substrate plane only. The time evolution of the total extent of macrogrowth as well as those of the individual components are discussed explicitly for the case of two phases. The asymptotic expressions for macrogrowth are derived. Such analysis depicts a saturation limit (i.e. the maximum extent of growth possible) for the slower growing component and its dependence on the kinetic parameters which, in the electrochemical context, can be controlled through potential. The significance of this model in the context of multicomponent alloy deposition and possible future directions for further development are pointed out.
Resumo:
The bending rigidity kappa of bilayer membranes was studied with coarse grained soft repulsive potentials using dissipative particle dynamics (DPD) simulations. Using a modified Andersen barostat to maintain the bilayers in a tensionless state, the bending rigidity was obtained from a Fourier analysis of the height fluctuations. From simulations carried out over a wide range of membrane thickness, the continuum scaling relation kappa proportional to d(2) was captured for both the L-alpha and L-beta phases. For membranes with 4 to 6 tail beads, the bending rigidity in the L-beta phase was found to be 10-15 times higher than that observed for the L-alpha phase. From the quadratic scalings obtained, a six fold increase in the area stretch modulus, k(A) was observed across the transition. The magnitude of increase in both kappa and k(A) from the L-alpha to the L-beta phase is consistent with current experimental observations in lipid bilayers and to our knowledge provides for the first time a direct evaluation of the mechanical properties in the L-beta phase.