Considering that the vehicle routing problem (VRP) with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a ...Considering that the vehicle routing problem (VRP) with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows (MDHVRPSTW) is established. An improved ant colony optimization (IACO) is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm (SA). Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization (ACO). Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.展开更多
Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to...Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to exploit the controller's vulnerabilities and launch attacks wisely. We tend to believe that dynamically altering such static mappings is a promising approach to alleviate this issue, since a moving target is difficult to be compromised even by skilled adversaries. It is critical to determine the right time to conduct scheduling and to balance the overhead afforded and the security levels guaranteed. Little previous work has been done to investigate the economical time in dynamic-scheduling controllers. In this paper, we take the first step to both theoretically and experimentally study the scheduling-timing problem in dynamic control plane. We model this problem as a renewal reward process and propose an optimal algorithm in deciding the right time to schedule with the objective of minimizing the long-term loss rate. In our experiments, simulations based on real network attack datasets are conducted and we demonstrate that our proposed algorithm outperforms given scheduling schemes.展开更多
In the evaluation of the necessary measurement of aeronautical means to face to a certain military operative problem, the development of an appropriate tool is of importance. Conventional techniques are considered ina...In the evaluation of the necessary measurement of aeronautical means to face to a certain military operative problem, the development of an appropriate tool is of importance. Conventional techniques are considered inadequate in the analysis of military operative problems in presence of a self-attrition behavior from one of the involved parts. In this paper a traditional algorithm for measuring military power is implemented and analyzed and then we improve this traditional algorithm on the basis of the kind of degradation that systematically takes place in self-destructive systems. In terms of traditional analysis, the evolution of a war is essentially an unreal sequence of repetitive cycles. So a time-dependent function was introduced in improved the algorithm. The development of this tool of prediction has the aim to argue the management of taking decisions in this type of crisis and complements itself with historical arguments or references of rigor. A computer software show results that allows to estimate the costs of the support and to visualize the graphs associated with the degradation of the system and his temporary evolution. The improved algorithm is more suitable than the traditional one in software simulations.展开更多
This paper lbcuses on the main characteristics of a tree-shaped timber structural system or simply tree-shaped. One of them is the complexity of its steel connections, responsible for the joint of bar elements, compou...This paper lbcuses on the main characteristics of a tree-shaped timber structural system or simply tree-shaped. One of them is the complexity of its steel connections, responsible for the joint of bar elements, compounding a complex structural system, which requires the application of the CYPECAD software version 2007 to solve the calculations problems. Its efficiency was confirmed by a variety of laboratory tests carried out with the whole structure. The tree-shaped is a timber structure that can be used in a large number of destinations, including residences, malls, sheds, hangars, etc.. Originally, it was conceived based on the well-known masterpiece "Sagrada Familia", whose author was Architect Antoni Gaudi I Cornet (1852-1926) in Barcelona/Spain. It was designed at the end of 19th century and its construction is still not finished. Gaudi inverted the logical order of the gothic concepts, i.e., light weights below and heavy weights above. Based on this concept, he always had in mind the figure of a tree in nature. The tree-shaped follows the same idea, using timber pieces connected by steel plates. Theoretical and numerical analyses have shown its efficiency and lightness for use in timber structures.展开更多
The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a n...The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a novel and promising processing approach. After the profile of leather sheets and stencils is obtained with digitizer, the discretization makes the processing independent of the specific geometrical information. The constraints of profile are regarded thoroughly. A heuristic bottom-left placement strategy is employed to sequentially locate stencils on sheets. The optimal placement sequence and rotation are deterimined by genetic algorithms (GA). A natural concise encoding method is developed to satisfy all the possible requirements of the leather nesting problem. The experimental results show that the proposed algorithm can not only be applied to the normal two-dimensional nesting problem, but also especially suitable for the placement of multiple two-dimensional irregular stencils on multiple two-dimensional irregular sheets.展开更多
When solving a mathematical problem, we sometimes encounter a situation where we can not reach a correct answer in spite of acquiring knowledge and formula necessary for the solution. The reason can be attributed to t...When solving a mathematical problem, we sometimes encounter a situation where we can not reach a correct answer in spite of acquiring knowledge and formula necessary for the solution. The reason can be attributed to the lack in metacognitive abilities. Metacognitive abilities consist of comparing the difficulty of problem with own ability, proper plan of solution process, and conscious monitoring and control of solution process. The role and importance of metacognitive ability in mathematical problem solving of permutations and combinations was explored. Participants were required to solve five practical problems related to permutations and combinations. For each problem, the solution process was divided into: (1) understanding (recognition) of mathematical problem; (2) plan of solution; (3) execution of solution. Participants were also required to rate the anticipation whether they could solve it or not, and to rate the confidence of their own answer. According to the total score of five problems, the participants were categorized into the group of the high test score and the group of the low test score. As a result, at the plan and the execution processes, statistically significant differences were detected between the high and the low score groups. As for the rating on the anticipation of result and the confidence of own answer, no significant differences were found between both groups. Moreover, the relationship between the score of plan process and the score of execution process was statistically correlated. In other words, the more proper the plan process was conducted, the more proper solution the participants reached. In such a way, the importance of metacognitive ability in the solving process, especially the plan ability, was suggested.展开更多
In order to achieve remote control problems for the intelligent home appliances, The paper presents a realization method through the Internet and GSM remote to control appliances of smart home, and given circuit. And ...In order to achieve remote control problems for the intelligent home appliances, The paper presents a realization method through the Internet and GSM remote to control appliances of smart home, and given circuit. And described in detail the hardware and software design of smart home appliances and their control method. Test results show that the system is stable and reliable.展开更多
Soft machines are combinations of hard and soft active materials, thus the coupling and interaction between soft and hard components dictate the performance of soft machines. Structural optimization has been intensive...Soft machines are combinations of hard and soft active materials, thus the coupling and interaction between soft and hard components dictate the performance of soft machines. Structural optimization has been intensively used for design of conventional hard machines, while, to our best knowledge, few attempts have been made towards optimal design of soft machines. Here, we describe the sizing optimization problem of a dielectric elastomer(DE) actuated mechanical amplifier, and achieve the optimal design through combination of a commercial finite element method(FEM) software and an optimization automation software.We then design, fabricate and demonstrate a locomotive soft machine driven by DE actuator with amplified displacement output.The methodology and results present here open the door towards optimal designs of active materials based soft machines.展开更多
Diffraction limited electron storage ring is considered a promising candidate for future light sources,whose main characteristics are higher brilliance,better transverse coherence and better stability.The challenge of...Diffraction limited electron storage ring is considered a promising candidate for future light sources,whose main characteristics are higher brilliance,better transverse coherence and better stability.The challenge of diffraction limited storage ring design is how to achieve the ultra low beam emittance with acceptable nonlinear performance.Effective linear and nonlinear parameter optimization methods based on Artificial Intelligence were developed for the storage ring physical design.As an example of application,partial physical design of HALS(Hefei Advanced Light Source),which is a diffraction limited VUV and soft X-ray light source,was introduced.Severe emittance growth due to the Intra Beam Scattering effect,which is the main obstacle to achieve ultra low emittance,was estimated quantitatively and possible cures were discussed.It is inspiring that better performance of diffraction limited storage ring can be achieved in principle with careful parameter optimization.展开更多
Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software,which makes them impossible to find out an optimal solution to constrained optimization problems....Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software,which makes them impossible to find out an optimal solution to constrained optimization problems.In this paper,a novel penalty function(called M-objective penalty function) with one penalty parameter added to both objective and constrained functions of inequality constrained optimization problems is proposed.Based on the M-objective penalty function,an algorithm is developed to solve an optimal solution to the inequality constrained optimization problems,with its convergence proved under some conditions.Furthermore,numerical results show that the proposed algorithm has a much better convergence than the classical penalty function algorithms under big penalty parameters,and is efficient in choosing a penalty parameter in a large range in Matlab software.展开更多
In this paper we examine controllability problems of evolution inclusions with nonlocal conditions. Using Kakutani's fixed point theorem and Schauder's fixed point the-orem, we establish sufficient conditions ...In this paper we examine controllability problems of evolution inclusions with nonlocal conditions. Using Kakutani's fixed point theorem and Schauder's fixed point the-orem, we establish sufficient conditions for the controllability under convex and nonconvex orientor fields respectively.展开更多
基金The National Natural Science Foundation of China(No.61074147)the Natural Science Foundation of Guangdong Province(No.S2011010005059)+2 种基金the Foundation of Enterprise-University-Research Institute Cooperation from Guangdong Province and Ministry of Education of China(No.2012B091000171,2011B090400460)the Science and Technology Program of Guangdong Province(No.2012B050600028)the Science and Technology Program of Huadu District,Guangzhou(No.HD14ZD001)
文摘Considering that the vehicle routing problem (VRP) with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows (MDHVRPSTW) is established. An improved ant colony optimization (IACO) is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm (SA). Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization (ACO). Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.
基金supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (No. 61521003)The National Key R&D Program of China (No.2016YFB0800101)+1 种基金the National Science Foundation for Distinguished Young Scholars of China (No.61602509)Henan Province Key Technologies R&D Program of China(No.172102210615)
文摘Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to exploit the controller's vulnerabilities and launch attacks wisely. We tend to believe that dynamically altering such static mappings is a promising approach to alleviate this issue, since a moving target is difficult to be compromised even by skilled adversaries. It is critical to determine the right time to conduct scheduling and to balance the overhead afforded and the security levels guaranteed. Little previous work has been done to investigate the economical time in dynamic-scheduling controllers. In this paper, we take the first step to both theoretically and experimentally study the scheduling-timing problem in dynamic control plane. We model this problem as a renewal reward process and propose an optimal algorithm in deciding the right time to schedule with the objective of minimizing the long-term loss rate. In our experiments, simulations based on real network attack datasets are conducted and we demonstrate that our proposed algorithm outperforms given scheduling schemes.
文摘In the evaluation of the necessary measurement of aeronautical means to face to a certain military operative problem, the development of an appropriate tool is of importance. Conventional techniques are considered inadequate in the analysis of military operative problems in presence of a self-attrition behavior from one of the involved parts. In this paper a traditional algorithm for measuring military power is implemented and analyzed and then we improve this traditional algorithm on the basis of the kind of degradation that systematically takes place in self-destructive systems. In terms of traditional analysis, the evolution of a war is essentially an unreal sequence of repetitive cycles. So a time-dependent function was introduced in improved the algorithm. The development of this tool of prediction has the aim to argue the management of taking decisions in this type of crisis and complements itself with historical arguments or references of rigor. A computer software show results that allows to estimate the costs of the support and to visualize the graphs associated with the degradation of the system and his temporary evolution. The improved algorithm is more suitable than the traditional one in software simulations.
文摘This paper lbcuses on the main characteristics of a tree-shaped timber structural system or simply tree-shaped. One of them is the complexity of its steel connections, responsible for the joint of bar elements, compounding a complex structural system, which requires the application of the CYPECAD software version 2007 to solve the calculations problems. Its efficiency was confirmed by a variety of laboratory tests carried out with the whole structure. The tree-shaped is a timber structure that can be used in a large number of destinations, including residences, malls, sheds, hangars, etc.. Originally, it was conceived based on the well-known masterpiece "Sagrada Familia", whose author was Architect Antoni Gaudi I Cornet (1852-1926) in Barcelona/Spain. It was designed at the end of 19th century and its construction is still not finished. Gaudi inverted the logical order of the gothic concepts, i.e., light weights below and heavy weights above. Based on this concept, he always had in mind the figure of a tree in nature. The tree-shaped follows the same idea, using timber pieces connected by steel plates. Theoretical and numerical analyses have shown its efficiency and lightness for use in timber structures.
文摘The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a novel and promising processing approach. After the profile of leather sheets and stencils is obtained with digitizer, the discretization makes the processing independent of the specific geometrical information. The constraints of profile are regarded thoroughly. A heuristic bottom-left placement strategy is employed to sequentially locate stencils on sheets. The optimal placement sequence and rotation are deterimined by genetic algorithms (GA). A natural concise encoding method is developed to satisfy all the possible requirements of the leather nesting problem. The experimental results show that the proposed algorithm can not only be applied to the normal two-dimensional nesting problem, but also especially suitable for the placement of multiple two-dimensional irregular stencils on multiple two-dimensional irregular sheets.
文摘When solving a mathematical problem, we sometimes encounter a situation where we can not reach a correct answer in spite of acquiring knowledge and formula necessary for the solution. The reason can be attributed to the lack in metacognitive abilities. Metacognitive abilities consist of comparing the difficulty of problem with own ability, proper plan of solution process, and conscious monitoring and control of solution process. The role and importance of metacognitive ability in mathematical problem solving of permutations and combinations was explored. Participants were required to solve five practical problems related to permutations and combinations. For each problem, the solution process was divided into: (1) understanding (recognition) of mathematical problem; (2) plan of solution; (3) execution of solution. Participants were also required to rate the anticipation whether they could solve it or not, and to rate the confidence of their own answer. According to the total score of five problems, the participants were categorized into the group of the high test score and the group of the low test score. As a result, at the plan and the execution processes, statistically significant differences were detected between the high and the low score groups. As for the rating on the anticipation of result and the confidence of own answer, no significant differences were found between both groups. Moreover, the relationship between the score of plan process and the score of execution process was statistically correlated. In other words, the more proper the plan process was conducted, the more proper solution the participants reached. In such a way, the importance of metacognitive ability in the solving process, especially the plan ability, was suggested.
文摘In order to achieve remote control problems for the intelligent home appliances, The paper presents a realization method through the Internet and GSM remote to control appliances of smart home, and given circuit. And described in detail the hardware and software design of smart home appliances and their control method. Test results show that the system is stable and reliable.
基金supported by the National Natural Science Foundation of China(Grant Nos.11472210 and 11372239)
文摘Soft machines are combinations of hard and soft active materials, thus the coupling and interaction between soft and hard components dictate the performance of soft machines. Structural optimization has been intensively used for design of conventional hard machines, while, to our best knowledge, few attempts have been made towards optimal design of soft machines. Here, we describe the sizing optimization problem of a dielectric elastomer(DE) actuated mechanical amplifier, and achieve the optimal design through combination of a commercial finite element method(FEM) software and an optimization automation software.We then design, fabricate and demonstrate a locomotive soft machine driven by DE actuator with amplified displacement output.The methodology and results present here open the door towards optimal designs of active materials based soft machines.
文摘Diffraction limited electron storage ring is considered a promising candidate for future light sources,whose main characteristics are higher brilliance,better transverse coherence and better stability.The challenge of diffraction limited storage ring design is how to achieve the ultra low beam emittance with acceptable nonlinear performance.Effective linear and nonlinear parameter optimization methods based on Artificial Intelligence were developed for the storage ring physical design.As an example of application,partial physical design of HALS(Hefei Advanced Light Source),which is a diffraction limited VUV and soft X-ray light source,was introduced.Severe emittance growth due to the Intra Beam Scattering effect,which is the main obstacle to achieve ultra low emittance,was estimated quantitatively and possible cures were discussed.It is inspiring that better performance of diffraction limited storage ring can be achieved in principle with careful parameter optimization.
基金supported by the National Natural Science Foundation of China under Grant No.11271329
文摘Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software,which makes them impossible to find out an optimal solution to constrained optimization problems.In this paper,a novel penalty function(called M-objective penalty function) with one penalty parameter added to both objective and constrained functions of inequality constrained optimization problems is proposed.Based on the M-objective penalty function,an algorithm is developed to solve an optimal solution to the inequality constrained optimization problems,with its convergence proved under some conditions.Furthermore,numerical results show that the proposed algorithm has a much better convergence than the classical penalty function algorithms under big penalty parameters,and is efficient in choosing a penalty parameter in a large range in Matlab software.
基金This research is supported by the National 973 Program(2002CB312205).
文摘In this paper we examine controllability problems of evolution inclusions with nonlocal conditions. Using Kakutani's fixed point theorem and Schauder's fixed point the-orem, we establish sufficient conditions for the controllability under convex and nonconvex orientor fields respectively.