In this paper a stochastic series expansion quantum Monte Carlo algorithm is used to study a frustratedspin chain with diagonal next-nearest-neighbor interactions.The detailed balance conditions are carefully analyzed...In this paper a stochastic series expansion quantum Monte Carlo algorithm is used to study a frustratedspin chain with diagonal next-nearest-neighbor interactions.The detailed balance conditions are carefully analyzed toimprove the efficiency of simulation process.As an application of this algothrim,the total magnetization,the staticstructure factor and spin-stiffness are calculated for a certain set of system parameters as a function of external fieldstrength.展开更多
Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the obje...Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.展开更多
The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding t...The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding to the joint efficient ordering method are studied, and some necessary conditions of this mapping are proven.展开更多
Checking whether a given formula is an invariant at a given program location(especially,inside a loop) can be quite nontrivial even for simple loop programs,given that it is in general an undecidable property.This is ...Checking whether a given formula is an invariant at a given program location(especially,inside a loop) can be quite nontrivial even for simple loop programs,given that it is in general an undecidable property.This is especially the case if the given formula is not an inductive loop invariant,as most automated techniques can only check or generate inductive loop invariants.In this paper,conditions are identified on simple loops and formulas when this check can be performed automatically.A general theorem is proved which gives a necessary and sufficient condition for a formula to be an invariant under certain restrictions on a loop.As a byproduct of this analysis,a new kind of loop invariant inside the loop body,called inside-loop invariant,is proposed.Such an invariant is more general than an inductive loop invariant typically used in the Floyd-Hoare axiomatic approach to program verification.The use of such invariants for program debugging is explored;it is shown that such invariants can be more useful than traditional inductive loop invariants especially when one is interested in checking extreme/side conditions such as underflow,accessing array/collection data structures outside the range,divide by zero,etc.展开更多
基金Supported by NSFC under Grants Nos.10874235,10934010,60978019NKBRSFC under Grants Nos.2006CB921400,2009CB930704,2010CB922904
文摘In this paper a stochastic series expansion quantum Monte Carlo algorithm is used to study a frustratedspin chain with diagonal next-nearest-neighbor interactions.The detailed balance conditions are carefully analyzed toimprove the efficiency of simulation process.As an application of this algothrim,the total magnetization,the staticstructure factor and spin-stiffness are calculated for a certain set of system parameters as a function of external fieldstrength.
文摘Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.
基金The research is supported by National Natural Science Foundation of China under Grant No. 70071026 Science Foundation of Wenzhou University and Science Foundation of School of Mathematics and Information Science, Wenzhou University and Zhejiang Province Education Department Scientific Research Item.
文摘The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding to the joint efficient ordering method are studied, and some necessary conditions of this mapping are proven.
基金supported by NSFC-90718041NKBRPC-2005C B321902+1 种基金China Scholarship Council in Chinasupported by the National Science Foundation award CCF-0729097
文摘Checking whether a given formula is an invariant at a given program location(especially,inside a loop) can be quite nontrivial even for simple loop programs,given that it is in general an undecidable property.This is especially the case if the given formula is not an inductive loop invariant,as most automated techniques can only check or generate inductive loop invariants.In this paper,conditions are identified on simple loops and formulas when this check can be performed automatically.A general theorem is proved which gives a necessary and sufficient condition for a formula to be an invariant under certain restrictions on a loop.As a byproduct of this analysis,a new kind of loop invariant inside the loop body,called inside-loop invariant,is proposed.Such an invariant is more general than an inductive loop invariant typically used in the Floyd-Hoare axiomatic approach to program verification.The use of such invariants for program debugging is explored;it is shown that such invariants can be more useful than traditional inductive loop invariants especially when one is interested in checking extreme/side conditions such as underflow,accessing array/collection data structures outside the range,divide by zero,etc.
