We calculate the flavor changing t → cπ0 decay in the framework of the topcolor assisted multiscaletechnicolor model. We find that (a) the branching ratio of t → cπ0 is insensitive to mπ, mπs and mπt, while it ...We calculate the flavor changing t → cπ0 decay in the framework of the topcolor assisted multiscaletechnicolor model. We find that (a) the branching ratio of t → cπ0 is insensitive to mπ, mπs and mπt, while it increasesquickly as ε increases; (b) for reasonable ranges of the parameters, the maximum of the branching ratio in this modelmay reach 7 × 10-6, seven orders larger compared to the one t → cH0 calculated in the standard model. This mightprovide an opportunity to detect the rare decay of the top quark in experiments.展开更多
SIMD计算机在并行计算中有着广泛的应用,为了增加其并行处理的能力,一个很重要的方面就是如何提高其PE(Processing E lement)的操作自治能力。通过在原有指令系统中加入卫式指令和伪跳转指令,并且加入少量相应的硬件,不仅能够大大提高P...SIMD计算机在并行计算中有着广泛的应用,为了增加其并行处理的能力,一个很重要的方面就是如何提高其PE(Processing E lement)的操作自治能力。通过在原有指令系统中加入卫式指令和伪跳转指令,并且加入少量相应的硬件,不仅能够大大提高PE的操作自主性从而实现数据和指令的高度并行,而且在低功耗方面也具有重要作用。展开更多
Three algorithms based on the bifurcation method are applied to solving the D4 symmetric positive solutions to the boundary value problem of Henon equation. Taking r in Henon equation as a bi- furcation parameter, the...Three algorithms based on the bifurcation method are applied to solving the D4 symmetric positive solutions to the boundary value problem of Henon equation. Taking r in Henon equation as a bi- furcation parameter, the D4-Σd(D4-Σ1, D4-Σ2) symmetry-breaking bifurcation points on the branch of the D4 symmetric positive solutions are found via the extended systems. Finally, Σd(Σ1, Σ2) sym- metric positive solutions are computed by the branch switching method based on the Liapunov-Schmidt reduction.展开更多
Partial Maximum Boolean Satisfiability （Partial Max-SAT or PMSAT） is an optimization variant of Boolean satisfiability （SAT） problem, in which a variable assignment is required to satisfy all hard clauses and a ma...Partial Maximum Boolean Satisfiability （Partial Max-SAT or PMSAT） is an optimization variant of Boolean satisfiability （SAT） problem, in which a variable assignment is required to satisfy all hard clauses and a maximum number of soft clauses in a Boolean formula. PMSAT is considered as an interesting encoding domain to many reaHife problems for which a solution is acceptable even if some constraints are violated. Amongst the problems that can be formulated as such are planning and scheduling. New insights into the study of PMSAT problem have been gained since the introduction of the Max-SAT evaluations in 2006. Indeed, several PMSAT exact solvers have been developed based mainly on the Davis- Putnam-Logemann-Loveland （DPLL） procedure and Branch and Bound （B^B） algorithms. In this paper, we investigate and analyze a number of exact methods for PMSAT. We propose a taxonomy of the main exact methods within a general framework that integrates their various techniques into a unified perspective. We show its effectiveness by using it to classify PMSAT exact solvers which participated in the 2007~2011 Max-SAT evaluations, emphasizing on the most promising research directions.展开更多
文摘We calculate the flavor changing t → cπ0 decay in the framework of the topcolor assisted multiscaletechnicolor model. We find that (a) the branching ratio of t → cπ0 is insensitive to mπ, mπs and mπt, while it increasesquickly as ε increases; (b) for reasonable ranges of the parameters, the maximum of the branching ratio in this modelmay reach 7 × 10-6, seven orders larger compared to the one t → cH0 calculated in the standard model. This mightprovide an opportunity to detect the rare decay of the top quark in experiments.
文摘SIMD计算机在并行计算中有着广泛的应用,为了增加其并行处理的能力,一个很重要的方面就是如何提高其PE(Processing E lement)的操作自治能力。通过在原有指令系统中加入卫式指令和伪跳转指令,并且加入少量相应的硬件,不仅能够大大提高PE的操作自主性从而实现数据和指令的高度并行,而且在低功耗方面也具有重要作用。
基金supported by the National Natural Science Foundation of China (Grant No. 10671130)the Science Foundation of Shanghai Municipal Education Commission (Grant No. 05DZ07)+2 种基金Shanghai Leading Academic Discipline Project (Grant No. T0401)Leading Foundation of Shanghai Science and Technology Commission (Grant No. 06JC14092)the Foundation of the Scientific Computing Key Laboratory of Shang-hai Universities
文摘Three algorithms based on the bifurcation method are applied to solving the D4 symmetric positive solutions to the boundary value problem of Henon equation. Taking r in Henon equation as a bi- furcation parameter, the D4-Σd(D4-Σ1, D4-Σ2) symmetry-breaking bifurcation points on the branch of the D4 symmetric positive solutions are found via the extended systems. Finally, Σd(Σ1, Σ2) sym- metric positive solutions are computed by the branch switching method based on the Liapunov-Schmidt reduction.
基金supported by the Research Center of College of Computer and Information Sciences at King Saud University, Saudi Arabia
文摘Partial Maximum Boolean Satisfiability （Partial Max-SAT or PMSAT） is an optimization variant of Boolean satisfiability （SAT） problem, in which a variable assignment is required to satisfy all hard clauses and a maximum number of soft clauses in a Boolean formula. PMSAT is considered as an interesting encoding domain to many reaHife problems for which a solution is acceptable even if some constraints are violated. Amongst the problems that can be formulated as such are planning and scheduling. New insights into the study of PMSAT problem have been gained since the introduction of the Max-SAT evaluations in 2006. Indeed, several PMSAT exact solvers have been developed based mainly on the Davis- Putnam-Logemann-Loveland （DPLL） procedure and Branch and Bound （B^B） algorithms. In this paper, we investigate and analyze a number of exact methods for PMSAT. We propose a taxonomy of the main exact methods within a general framework that integrates their various techniques into a unified perspective. We show its effectiveness by using it to classify PMSAT exact solvers which participated in the 2007~2011 Max-SAT evaluations, emphasizing on the most promising research directions.
