Variational Formulation of the Schrödinger Field

The variational formulation of the Schrödinger field was investigated and the applicability of the chain method was analyzed. Using Batalin-Fradkin-Tyutin formalism a gauge invariant theory was constructed.     

Synthesis of β-phenyl-δ,ε-unsaturated amino acids and stereoselective introduction of side chain groups into [4,3,0]-bicyclic β-turn dipeptides

(2S,3S)- and (2R,3R)-2-amino-3-phenyl-5-hexenoic acids have been synthesized in large scale by using Ni(II)-complexes as a template. The amino acids were used in the synthesis of [4,3,0]-bicyclic β-turn mimetics by a convergent methodology. The unique advantage of this strategy is the convenience of introducing side chain groups with predetermined chiralities on both the five- and six-membered heterocyclic rings.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

三量子位Heisenberg XX 链中杂质对纠缠的影响

研究了有杂质时三量子位Heisenberg-XX链中正常格点之间的热纠缠情况，给出了Concurrence的解析表达式.进一步的讨论发现，杂质对正常格点的热纠缠有着重要的影响，甚至能够改变纠缠在反铁磁区的特性.理论表明，可以通过调节温度和杂质参数来控制纠缠. 关键词： Heisenberg -XX链 热纠缠 杂质格点     

Generalized binomial and negative binomial distributions of order<Emphasis Type="Italic">k</Emphasis> by the<Emphasis Type="Italic">l</Emphasis>-overlapping enumeration scheme

In this paper, we investigate the exact distribution of the waiting time for ther-th ℓ-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of orderk and an extended Poisson distribution of orderk are discussed. We provide further insights into the run-related problems from the viewpoint of the ℓ-overlapping enumeration scheme. We also study the exact distribution of the number of ℓ-overlapping occurrences of success-runs in a fixed number of trials and derive the probability generating functions. The present work extends several properties of distributions of orderk and leads us a new type of geneses of the discrete distributions.     

Fully-angular polyhex chains with minimal total π-electron energy

By Hückel molecular orbital (HMO) theory, the calculation of the total energy of all π-electrons in conjugated hydrocarbons can be reduced to that of E(G)=|λ₁|+|λ₂|+?+|λn|, where λi are the eigenvalues of the corresponding graph G. Denote by Ψn the set of all fully-angular polyhex chains with n hexagons. In this paper, we show that Hn has the minimum total π-electron energy among chains in Ψn, where Hn is the helicene chain.     

M/G/1/N vacation model with varying E-limited service discipline

We define and analyze anM/G/1/N vacation model that uses a service discipline that we call theE-limited with limit variation discipline. According to this discipline, the server provides service until either the system is emptied (i.e. exhausted) or a randomly chosen limit ofl customers has been served. The server then goes on a vacation before returning to service the queue again. The queue length distribution and the Laplace-Stieltjes transforms of the waiting time, busy period and cycle time distributions are found. Further, an expression for the mean waiting time is developed. Several previously analyzed service disciplines, including Bernoulli scheduling, nonexhaustive service and limited service, are special cases of the general varying limit discipline that is analyzed in this paper.     

On operators and search space topology in multi-objective flow shop scheduling

Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce.