879 resultados para Fama-French 3-factor model
Resumo:
The factorization theorem for exclusive processes in perturbative QCD predicts the behavior of the pion electromagnetic form factor F(t) at asymptotic spacelike momenta t(= -Q(2)) < 0. We address the question of the onset energy using a suitable mathematical framework of analytic continuation, which uses as input the phase of the form factor below the first inelastic threshold, known with great precision through the Fermi-Watson theorem from pi pi elastic scattering, and the modulus measured from threshold up to 3 GeV by the BABAR Collaboration. The method leads to almost model-independent upper and lower bounds on the spacelike form factor. Further inclusion of the value of the charge radius and the experimental value at -2.45 GeV2 measured at JLab considerably increases the strength of the bounds in the region Q(2) less than or similar to 10 GeV2, excluding the onset of the asymptotic perturbative QCD regime for Q(2) < 7 GeV2. We also compare the bounds with available experimental data and with several theoretical models proposed for the low and intermediate spacelike region.
Resumo:
The effect of gem-dialkyl substituents on the backbone conformations of beta-amino acid residues in peptides has been investigated by using four model peptides: Boc-Xxx-beta 2,2Ac6c(1-aminomethylcyclohexanecarboxylic acid)-NHMe (Xxx=Leu (1), Phe (2); Boc=tert-butyloxycarbonyl) and Boc-Xxx-beta 3,3Ac6c(1-aminocyclohexaneacetic acid)-NHMe (Xxx=Leu (3), Phe (4)). Tetrasubstituted carbon atoms restrict the ranges of stereochemically allowed conformations about flanking single bonds. The crystal structure of Boc-Leu-beta 2,2Ac6c-NHMe (1) established a C11 hydrogen-bonded turn in the a beta-hybrid sequence. The observed torsion angles (a(similar to-60 degrees, similar to-30 degrees), beta(similar to-90 degrees, similar to 60 degrees, similar to-90 degrees)) corresponded to a C11 helical turn, which was a backbone-expanded analogue of the type III beta turn in aa sequences. The crystal structure of the peptide Boc-Phe-beta 3,3Ac6c-NHMe (4) established a C11 hydrogen-bonded turn with distinctly different backbone torsion angles (a(similar to-60 degrees, similar to 120 degrees), beta(similar to 60 degrees, ?60 degrees, similar to-60 degrees)), which corresponded to a backbone-expanded analogue of the type II beta turn observed in aa sequences. In peptide 4, the two molecules in the asymmetric unit adopted backbone torsion angles of opposite signs. In one of the molecules, the Phe residue adopted an unfavorable backbone conformation, with the energetic penalty being offset by a favorable aromatic interaction between proximal molecules in the crystal. NMR spectroscopy studies provided evidence for the maintenance of folded structures in solution in these a beta-hybrid sequences.
Resumo:
We calculate upper and lower bounds on the modulus of the pion electromagnetic form factor on the unitarity cut below the omega pi inelastic threshold, using as input the phase in the elastic region known via the Fermi-Watson theorem from the pi pi P-wave phase shift, and a suitably weighted integral of the modulus squared above the inelastic threshold. The normalization at t = 0, the pion charge radius and experimental values at spacelike momenta are used as additional input information. The bounds are model independent, in the sense that they do not rely on specific parametrizations and do not require assumptions on the phase of the form factor above the inelastic threshold. The results provide nontrivial consistency checks on the recent experimental data on the modulus available below the omega pi threshold from e(+)e(-) annihilation and tau-decay experiments. In particular, at low energies the calculated bounds offer a more precise description of the modulus than the experimental data.
Resumo:
Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.
Resumo:
This paper presents a novel, soft computing based solution to a complex optimal control or dynamic optimization problem that requires the solution to be available in real-time. The complexities in this problem of optimal guidance of interceptors launched with high initial heading errors include the more involved physics of a three dimensional missile-target engagement, and those posed by the assumption of a realistic dynamic model such as time-varying missile speed, thrust, drag and mass, besides gravity, and upper bound on the lateral acceleration. The classic, pure proportional navigation law is augmented with a polynomial function of the heading error, and the values of the coefficients of the polynomial are determined using differential evolution (DE). The performance of the proposed DE enhanced guidance law is compared against the existing conventional laws in the literature, on the criteria of time and energy optimality, peak lateral acceleration demanded, terminal speed and robustness to unanticipated target maneuvers, to illustrate the superiority of the proposed law. (C) 2013 Elsevier B. V. All rights reserved.
Resumo:
It is shown that every hyperbolic rigid polynomial domain in C-3 of finite-type, with abelian automorphism group is equivalent to a domain that is balanced with respect to some weight.
Resumo:
The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
We performed Gaussian network model based normal mode analysis of 3-dimensional structures of multiple active and inactive forms of protein kinases. In 14 different kinases, a more number of residues (1095) show higher structural fluctuations in inactive states than those in active states (525), suggesting that, in general, mobility of inactive states is higher than active states. This statistically significant difference is consistent with higher crystallographic B-factors and conformational energies for inactive than active states, suggesting lower stability of inactive forms. Only a small number of inactive conformations with the DFG motif in the ``in'' state were found to have fluctuation magnitudes comparable to the active conformation. Therefore our study reports for the first time, intrinsic higher structural fluctuation for almost all inactive conformations compared to the active forms. Regions with higher fluctuations in the inactive states are often localized to the aC-helix, aG-helix and activation loop which are involved in the regulation and/or in structural transitions between active and inactive states. Further analysis of 476 kinase structures involved in interactions with another domain/protein showed that many of the regions with higher inactive-state fluctuation correspond to contact interfaces. We also performed extensive GNM analysis of (i) insulin receptor kinase bound to another protein and (ii) holo and apo forms of active and inactive conformations followed by multi-factor analysis of variance. We conclude that binding of small molecules or other domains/proteins reduce the extent of fluctuation irrespective of active or inactive forms. Finally, we show that the perceived fluctuations serve as a useful input to predict the functional state of a kinase.
Resumo:
The epsilon 4 isoform of apolipoprotein E (ApoE4) that is involved in neuron-glial lipid metabolism has been demonstrated as the main genetic risk factor in late-onset of Alzheimer's disease. However, the mechanism underlying ApoE4-mediated neurodegeneration remains unclear. We created a transgenic model of neurodegenerative disorder by expressing epsilon 3 and epsilon 4 isoforms of human ApoE in the Drosophila melanogaster. The genetic models exhibited progressive neurodegeneration, shortened lifespan and memory impairment. Genetic interaction studies between amyloid precursor protein and ApoE in axon pathology of the disease revealed that over expression of hApoE in Appl-expressing neurons of Drosophila brain causes neurodegeneration. Moreover, acute oxidative damage in the hApoE transgenic flies triggered a neuroprotective response of hApoE3 while chronic induction of oxidative damage accelerated the rate of neurodegeneration. This Drosophila model may facilitate analysis of the molecular and cellular events implicated in hApoE4 neurotoxicity. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
The epsilon 4 isoform of apolipoprotein E (ApoE4) that is involved in neuron-glial lipid metabolism has been demonstrated as the main genetic risk factor in late-onset of Alzheimer's disease. However, the mechanism underlying ApoE4-mediated neurodegeneration remains unclear. We created a transgenic model of neurodegenerative disorder by expressing epsilon 3 and epsilon 4 isoforms of human ApoE in the Drosophila melanogaster. The genetic models exhibited progressive neurodegeneration, shortened lifespan and memory impairment. Genetic interaction studies between amyloid precursor protein and ApoE in axon pathology of the disease revealed that over expression of hApoE in Appl-expressing neurons of Drosophila brain causes neurodegeneration. Moreover, acute oxidative damage in the hApoE transgenic flies triggered a neuroprotective response of hApoE3 while chronic induction of oxidative damage accelerated the rate of neurodegeneration. This Drosophila model may facilitate analysis of the molecular and cellular events implicated in hApoE4 neurotoxicity. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
Elastodynamic stress intensity factor histories of an unbounded solid containing a semi-infinite plane crack that propagates at a constant velocity under 3-D time-independent combined mode loading are considered. The fundamental solution, which is the response of point loading, is obtained. Then, stress intensity factor histories of a general loading system are written out in terms of superposition integrals. The methods used here are the Laplace transform methods in conjunction with the Wiener-Hopf technique.
Resumo:
A phase relaxation model (PRM) for 2-phase flows is presented in this paper on the basis of three principal assumptions. The basic equations for PRM arc derived from the Boltzmann equations for gas-partlcle mixture, The general characteristics and solving process of the PRM's basic equations are also presented and discussed. Many terms in the PRM's basic equations contain a factor ε= ρgρp/ρg+ρp2 which is an intrinsic small parameter for 2-phase mixture, with ρg and ρp being respectively the densities of gas and particle phases.This makes it possible to simplify the computation of the PRM's basic equations. The model is applied to for example, studying file steady propagation of shock waves in gas-particle mixture. The analysis shows that with an increase of shock wave strength the relaxation process behind a gasdynamics shock front becomes a kind of dynamics relaxation instead of the standard exponential relaxation process. A method of determining experimentally the velocity and tem...更多perature relaxation rates (or times) of gas-particle flows is suggested and analyzed.
Resumo:
[ES] La confianza en el mundo de los negocios es un factor esencial que viene siendo estudiado por la literatura del Management desde hace décadas. Partiendo de la propuesta seminal de Mayer et al. (1995), acerca de qué es la confianza y cómo se desarrolla en el seno de las organizaciones, proponemos trazar una crítica constructiva al modelo descrito a partir de las aportaciones de Spaemann, autor de dilatada trayectoria en el marco de la denominada “Filosofía Moral de la Europa Continental”.
Resumo:
Transcription factor binding sites (TFBS) play key roles in genebior 6.8 wavelet expression and regulation. They are short sequence segments with de¯nite structure and can be recognized by the corresponding transcription factors correctly. From the viewpoint of statistics, the candidates of TFBS should be quite di®erent from the segments that are randomly combined together by nucleotide. This paper proposes a combined statistical model for ¯nding over- represented short sequence segments in di®erent kinds of data set. While the over-represented short sequence segment is described by position weight matrix, the nucleotide distribution at most sites of the segment should be far from the background nucleotide distribution. The central idea of this approach is to search for such kind of signals. This algorithm is tested on 3 data sets, including binding sites data set of cyclic AMP receptor protein in E.coli, PlantProm DB which is a non-redundant collection of proximal promoter sequences from di®erent species, collection of the intergenic sequences of the whole genome of E.Coli. Even though the complexity of these three data sets is quite di®erent, the results show that this model is rather general and sensible.
Resumo:
We investigate the 2d O(3) model with the standard action by Monte Carlo simulation at couplings β up to 2.05. We measure the energy density, mass gap and susceptibility of the model, and gather high statistics on lattices of size L ≤ 1024 using the Floating Point Systems T-series vector hypercube and the Thinking Machines Corp.'s Connection Machine 2. Asymptotic scaling does not appear to set in for this action, even at β = 2.10, where the correlation length is 420. We observe a 20% difference between our estimate m/Λ^─_(Ms) = 3.52(6) at this β and the recent exact analytical result . We use the overrelaxation algorithm interleaved with Metropolis updates and show that decorrelation time scales with the correlation length and the number of overrelaxation steps per sweep. We determine its effective dynamical critical exponent to be z' = 1.079(10); thus critical slowing down is reduced significantly for this local algorithm that is vectorizable and parallelizable.
We also use the cluster Monte Carlo algorithms, which are non-local Monte Carlo update schemes which can greatly increase the efficiency of computer simulations of spin models. The major computational task in these algorithms is connected component labeling, to identify clusters of connected sites on a lattice. We have devised some new SIMD component labeling algorithms, and implemented them on the Connection Machine. We investigate their performance when applied to the cluster update of the two dimensional Ising spin model.
Finally we use a Monte Carlo Renormalization Group method to directly measure the couplings of block Hamiltonians at different blocking levels. For the usual averaging block transformation we confirm the renormalized trajectory (RT) observed by Okawa. For another improved probabilistic block transformation we find the RT, showing that it is much closer to the Standard Action. We then use this block transformation to obtain the discrete β-function of the model which we compare to the perturbative result. We do not see convergence, except when using a rescaled coupling β_E to effectively resum the series. For the latter case we see agreement for m/ Λ^─_(Ms) at , β = 2.14, 2.26, 2.38 and 2.50. To three loops m/Λ^─_(Ms) = 3.047(35) at β = 2.50, which is very close to the exact value m/ Λ^─_(Ms) = 2.943. Our last point at β = 2.62 disagrees with this estimate however.