Scalar and axial-vector mesons

Almost thirty years ago, Penny G. Estabrooks asked “Where and what are the scalar mesons?” (P. Estabrooks, Phys. Rev. D 19, 2678 (1979)). The first part of her question can now be confidently responded (E. van Beveren et al., Z. Phys. C 30, 615 (1986)). However, with respect to the “What” many puzzles remain unanswered. Scalar and axial-vector mesons form part of a large family of mesons. Consequently, though it is useful to pay them some extra attention, there is no point in discussing them as isolated phenomena. The particularity of structures in the scattering of --basically-- pions and kaons with zero angular momentum is the absence of the centrifugal barrier, which allows us to “see” strong interactions at short distances. Experimentally observed differences and similarities between scalar and axial-vector mesons on the one hand, and other mesons on the other hand, are very instructive for further studies. Nowadays, there exists an abundance of theoretical approaches towards the mesonic spectrum, ranging from confinement models of all kinds, i.e., glueballs, and quark-antiquark, multiquark and hybrid configurations, to models in which only mesonic degrees of freedom are taken into account. Nature seems to come out somewhere in the middle, neither preferring pure bound states, nor effective meson-meson physics with only coupling constants and possibly form factors. As a matter of fact, apart from a few exceptions, like pions and kaons, Nature does not allow us to study mesonic bound states of any kind, which is equivalent to saying that such states do not really exist. Hence, instead of extrapolating from pions and kaons to the remainder of the meson family, it is more democratic to consider pions and kaons mesonic resonances that happen to come out below the lowest threshold for strong decay. Nevertheless, confinement is an important ingredient for understanding the many regularities observed in mesonic spectra. Therefore, excluding quark degrees of freedom is also not the most obvious way of describing mesons in general, and scalars and axial-vectors in particular.     

ℙmax variations related to slaloms

We prove the iteration lemmata, which are the key lemmata to show that extensions by Pmax variations satisfy absoluteness for Π₂-statements in the structure 〈H (ω ₂), ∈, NS_{ω 1}, R 〉 for some set R of reals in L (ℝ), for the following statements: (1) The cofinality of the null ideal is ℵ₁. (2) There exists a good basis of the strong measure zero ideal. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Stationary remaining service time conditional on queue length

In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments.     

Portfolio optimization in stochastic markets

We consider a multiperiod mean-variance model where the model parameters change according to a stochastic market. The mean vector and covariance matrix of the random returns of risky assets all depend on the state of the market during any period where the market process is assumed to follow a Markov chain. Dynamic programming is used to solve an auxiliary problem which, in turn, gives the efficient frontier of the mean-variance formulation. An explicit expression is obtained for the efficient frontier and an illustrative example is given to demonstrate the application of the procedure.     

Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error

Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.      

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

Confirmation of sable QTL that modifies the effects of the Ay allele on yellow coat color on mouse chromosome 1

F₁-A^y mice between RR (aabbCC) and C57BL/6J-A^y (A^yaBBCC) have a much darker yellow coat color than do C57BL/6J-A^y. Quantitative trait locus (QTL) analysis was carried out to identify genes responsible for the darker modification of the yellow coat color (this has been traditionally termed “sable”). A significant sable QTL was identified on chromosome 1 (Dmyaq4, LOD score 15.5 for lightness, and 13.4 for color difference), in a chromosomal position similar to that of Dmyaq2, a sable QTL previously identified in C3H/HeJ. Another significant sable QTL was identified on chromosome 4 (Dmyaq5, LOD score 5.6 for lightness, and 4.3 for color difference) near the tyrosinase-related protein 1 (Tyrp1) locus. The effect of Dmyaq5 was significant only in the presence of the RR allele at Dmyaq4, suggesting that the Dmyaq4 (as well as Dmyaq2) is a novel coat color gene that may act up-stream of Tyrp1 signaling to increase eumelanin production.     

A novel approach based on recurrent neural networks applied to nonlinear systems optimization

This paper presents an efficient approach based on recurrent neural network for solving nonlinear optimization. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid subspace technique. These parameters guarantee the convergence of the network to the equilibrium points that represent an optimal feasible solution. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty and weighting parameters for its initialization. A study of the modified Hopfield model is also developed to analyze its stability and convergence. Simulation results are provided to demonstrate the performance of the proposed neural network.     

正丁基苝四羧酸二酰亚胺的晶型和性能研究

文章合成了N,N'-二正丁基苝四羧酸二酰亚胺,并纯化、调晶,进行了IR、元素分析、X射线等测定.分析该化合物在DMF中的紫外光谱(最大吸收波长524.80 nm)、荧光光谱(最大发射波长539.0 nm)、Stokes位移(数值15 nm)等光谱性质.在400～700 nm范围内,α晶型薄膜紫外-可见吸收出现很强的吸收峰,且由β型变为α型,最大吸收波长有明显的红移(545 nm变为580 nm).X射线粉末衍射也反映出α晶型的2θ在26.0°处衍射峰CPS为2 508,β型在25.2°为1 891.α,β晶型作为电荷产生材料制得的功能分离型有机光导体,在光源滤波波长λ=532 nm曝光下,测得含α,β感光体达到饱和电位的时间分别为46,93.98 s,光衰电位(5.3千伏电压负充电电晕,1～2 s后的表面电位)分别为727和525 V,半衰曝光量分别为4.32,4.34μJ·cm-2,残余电位分别为30和45 V等光导性能数值.