To solve the NP-complete no-wait flowshop problems, objective increment properties are analyzed and proved for fundamental operations of heuristics. With these properties, whether a new generated schedule is better or...To solve the NP-complete no-wait flowshop problems, objective increment properties are analyzed and proved for fundamental operations of heuristics. With these properties, whether a new generated schedule is better or worse than the original one is only evaluated by objective increments, instead of completely calculating objective values as the traditional algorithms do, so that the computational time can be considerably reduced. An objective increment-based hybrid genetic algorithm （IGA） is proposed by integrating the genetic algorithm （GA） with an improved various neighborhood search （VNS）as a local search. An initial solution generation heuristic（ISG） is constructed to generate one individual of the initial population. An expectation value-based selection mechanism and a crossover operator are introduced to the mating process. The IGA is compared with the traditional GA and two best-so-far algorithms for the considered problem on 110 benchmark instances. An experimental results show that the IGA outperforms the others in effectiveness although with a little more time consumption.展开更多
Automatic image annotation(AIA)has become an important and challenging problem in computer vision due to the existence of semantic gap.In this paper,a novel support vector machine with mixture of kernels(SVM-MK)for au...Automatic image annotation(AIA)has become an important and challenging problem in computer vision due to the existence of semantic gap.In this paper,a novel support vector machine with mixture of kernels(SVM-MK)for automatic image annotation is proposed.On one hand,the combined global and local block-based image features are extracted in order to reflect the intrinsic content of images as complete as possible.On the other hand,SVM-MK is constructed to shoot for better annotating performance.Experimental results on Corel dataset show that the proposed image feature representation method as well as automatic image annotation classifier,SVM-MK,can achieve higher annotating accuracy than SVM with any single kernel and mi-SVM for semantic image annotation.展开更多
This paper proposes a new approach for multi-objective robust control. The approach extends the standard generalized l2 (Gl2) and generalized H2 (GH2) conditions to a set of new linear matrix inequality (LMI) constra...This paper proposes a new approach for multi-objective robust control. The approach extends the standard generalized l2 (Gl2) and generalized H2 (GH2) conditions to a set of new linear matrix inequality (LMI) constraints based on a new stability condition. A technique for variable parameterization is introduced to the multi-objective control problem to preserve the linearity of the synthesis variables. Consequently, the multi-channel multi-objective mixed Gl2/GH2 control problem can be solved less conservatively using computationally tractable algorithms developed in the paper.展开更多
Hybrid signcryption is an important technique signcrypting bulk data using symmetric encryption. In this paper, we apply the technique of certificateless hybrid signcryption to an elliptic-curve cryptosystem, and cons...Hybrid signcryption is an important technique signcrypting bulk data using symmetric encryption. In this paper, we apply the technique of certificateless hybrid signcryption to an elliptic-curve cryptosystem, and construct a low-computation certificateless hybrid signcryption scheme. In the random oracle model, this scheme is proven to have indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the elliptic-curve computation Diffie-Hellman assumption. Also, it has a strong existential unforgeability against adaptive chosen-message attacks （sUF-CMA） under the elliptic-curve discrete logarithm assumption. Analysis shows that the cryptographic algorithm does not rely on pairing operations and is much more etticient than other algorithms. In addition, it suits well to applications in environments where resources are constrained, such as wireless sensor networks and ad hoc networks.展开更多
This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing...This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment（MOMTA） problem at the upper level and the time-optimal coordinated path planning（TOCPP） problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods（MOMs）,namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.展开更多
Abstract In recent years, a nonzero value for the neutrino mixing angle θ13 has been successively measured by the international famous reactor oscillation experiments, which is greater than 5 standard deviations. Our...Abstract In recent years, a nonzero value for the neutrino mixing angle θ13 has been successively measured by the international famous reactor oscillation experiments, which is greater than 5 standard deviations. Our study is in the framework of the MSSM, where baryon and lepton numbers are local gauged symmetries （BLMSSM）. This model can generate three tiny neutrino masses at the tree level through TeV scale seesaw mechanism. In our paper, we analyze the neutrino masses and their corresponding mixing angles with a ＂top-down＂ method, assuming neutrino mass spectrum with normal ordering （NO） and inverted ordering （IO）.展开更多
基金The National Natural Science Foundation of China(No.60504029,60672092)the National High Technology Research and Development Program of China(863Program)(No.2008AA04Z103)
文摘To solve the NP-complete no-wait flowshop problems, objective increment properties are analyzed and proved for fundamental operations of heuristics. With these properties, whether a new generated schedule is better or worse than the original one is only evaluated by objective increments, instead of completely calculating objective values as the traditional algorithms do, so that the computational time can be considerably reduced. An objective increment-based hybrid genetic algorithm （IGA） is proposed by integrating the genetic algorithm （GA） with an improved various neighborhood search （VNS）as a local search. An initial solution generation heuristic（ISG） is constructed to generate one individual of the initial population. An expectation value-based selection mechanism and a crossover operator are introduced to the mating process. The IGA is compared with the traditional GA and two best-so-far algorithms for the considered problem on 110 benchmark instances. An experimental results show that the IGA outperforms the others in effectiveness although with a little more time consumption.
基金Supported by the National Basic Research Priorities Programme(No.2007CB311004)the National Natural Science Foundation of China(No.61035003,60933004,60903141,60970088,61072085)
文摘Automatic image annotation(AIA)has become an important and challenging problem in computer vision due to the existence of semantic gap.In this paper,a novel support vector machine with mixture of kernels(SVM-MK)for automatic image annotation is proposed.On one hand,the combined global and local block-based image features are extracted in order to reflect the intrinsic content of images as complete as possible.On the other hand,SVM-MK is constructed to shoot for better annotating performance.Experimental results on Corel dataset show that the proposed image feature representation method as well as automatic image annotation classifier,SVM-MK,can achieve higher annotating accuracy than SVM with any single kernel and mi-SVM for semantic image annotation.
基金Project supported by the National Natural Science Foundation ofChina (No. 60374028) and the Scientific Research Foundation forReturned Overseas Chinese Scholars Ministry of Education (No.[2004]176)
文摘This paper proposes a new approach for multi-objective robust control. The approach extends the standard generalized l2 (Gl2) and generalized H2 (GH2) conditions to a set of new linear matrix inequality (LMI) constraints based on a new stability condition. A technique for variable parameterization is introduced to the multi-objective control problem to preserve the linearity of the synthesis variables. Consequently, the multi-channel multi-objective mixed Gl2/GH2 control problem can be solved less conservatively using computationally tractable algorithms developed in the paper.
基金the National Natural Science Foundation of China （Nos. 61572303, 61363080, and 61272436）, the Foundation of State Key Laboratory of Information Security （No. 2015-MS-10）, and the Foundation of Basic Research of Qinghai Province, China （No. 2016-ZJ-776）
文摘Hybrid signcryption is an important technique signcrypting bulk data using symmetric encryption. In this paper, we apply the technique of certificateless hybrid signcryption to an elliptic-curve cryptosystem, and construct a low-computation certificateless hybrid signcryption scheme. In the random oracle model, this scheme is proven to have indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the elliptic-curve computation Diffie-Hellman assumption. Also, it has a strong existential unforgeability against adaptive chosen-message attacks （sUF-CMA） under the elliptic-curve discrete logarithm assumption. Analysis shows that the cryptographic algorithm does not rely on pairing operations and is much more etticient than other algorithms. In addition, it suits well to applications in environments where resources are constrained, such as wireless sensor networks and ad hoc networks.
基金supported by the National Natural Science Foundation of China under Grant No.61673058the NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization under Grant No.U1609214
文摘This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment（MOMTA） problem at the upper level and the time-optimal coordinated path planning（TOCPP） problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods（MOMs）,namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.
基金Supported by the National Natural Science Foundation of China under Grant Nos.11275036,11047002,11347606the open project of State Key Laboratory of Mathematics-Mechanization under Grant No.Y3KF311CJ1+1 种基金the Natural Science Foundation of Hebei Province under Grant Nos.A2013201277,A2011201118Natural Science Fund of Hebei University under Grant Nos.2011JQ05,2012-242
文摘Abstract In recent years, a nonzero value for the neutrino mixing angle θ13 has been successively measured by the international famous reactor oscillation experiments, which is greater than 5 standard deviations. Our study is in the framework of the MSSM, where baryon and lepton numbers are local gauged symmetries （BLMSSM）. This model can generate three tiny neutrino masses at the tree level through TeV scale seesaw mechanism. In our paper, we analyze the neutrino masses and their corresponding mixing angles with a ＂top-down＂ method, assuming neutrino mass spectrum with normal ordering （NO） and inverted ordering （IO）.
