BACKGROUND Eyelid reconstruction is an intricate process,addressing both aesthetic and functional aspects post-trauma or oncological surgery.Aesthetic concerns and oncological radicality guide personalized approaches....BACKGROUND Eyelid reconstruction is an intricate process,addressing both aesthetic and functional aspects post-trauma or oncological surgery.Aesthetic concerns and oncological radicality guide personalized approaches.The complex anatomy,involving anterior and posterior lamellae,requires tailored reconstruction for optimal functionality.AIM To formulate an eyelid reconstruction algorithm through an extensive literature review and to validate it by juxtaposing surgical outcomes from Cattinara Hos-in dry eye and tears,which may lead to long-term consequences such as chronic conjunctivitis,discomfort,or photo-phobia.To prevent this issue,scars should be oriented vertically or perpendicularly to the free eyelid margin when the size of the tumor allows.In employing a malar flap to repair a lower eyelid defect,the malar incision must ascend diagonally;this facilitates enhanced flap advancement and mitigates ectropion by restricting vertical traction.Conse-quently,it is imperative to maintain that the generated tension remains consistently horizontal and never vertical[9].Lagophthalmos is a disorder characterized by the inability to completely close the eyelids,leading to corneal exposure and an increased risk of keratitis or ulceration;it may arise following upper eyelid surgery.To avert this issue,it is essential to preserve a minimum of 1 cm of skin between the superior edge of the excision and the inferior boundary of the eyebrow.Epiphora may occur in cancers involving the lacrimal puncta,requiring their removal.As previously stated,when employing a glabellar flap to rectify medial canthal abnormalities,it is essential to prevent a trapdoor effect or thickening of the flap relative to the eyelid skin to which it is affixed.Constraints about our proposed algorithm enco-mpass limited sample sizes and possible publication biases in existing studies.Subsequent investigations ought to examine long-term results to further refine the algorithm.Future research should evaluate the algorithm across varied populations and examine the impact of novel graft materials on enhancing reconstructive outcomes.CONCLUSION Eyelid reconstruction remains one of the most intriguing challenges for a plastic surgeon today.The most fascinating aspect of this discipline is the need to restore the functionality of such an essential structure while maintaining its aesthetics.In our opinion,creating decision-making algorithms can facilitate reaching this goal by allowing for the individualization of the reconstructive path while minimizing the incidence of complications.The fact that we have decreased the incidence of severe complications is a sign that the work is moving in the right direction.The fact that there has been no need for reintervention,neither for reconstructive issues nor for inadequate oncological radicality,overall signifies greater patient satisfaction as they do not have to undergo the stress of new surgeries.Even the minor complic-ations recorded are in line with those reported in the literature,and,even more importantly for patients,they are of limited duration.In our experience,after a year of application,we can say that the objective has been achieved,but much more can still be done.Behind every work,a scientific basis must be continually renewed and refreshed to maintain high-quality standards.Therefore,searching for possible alternative solutions to be included in one’s surgical armamentarium is fundamental to providing the patient with a fully personalized option.展开更多
The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly...The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.展开更多
This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inerti...This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.展开更多
The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the intera...The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.展开更多
In order to solve the problems of potential incident rescue on expressway networks, the opportunity cost-based method is used to establish a resource dispatch decision model. The model aims to dispatch the rescue reso...In order to solve the problems of potential incident rescue on expressway networks, the opportunity cost-based method is used to establish a resource dispatch decision model. The model aims to dispatch the rescue resources from the regional road networks and to obtain the location of the rescue depots and the numbers of service vehicles assigned for the potential incidents. Due to the computational complexity of the decision model, a scene decomposition algorithm is proposed. The algorithm decomposes the dispatch problem from various kinds of resources to a single resource, and determines the original scene of rescue resources based on the rescue requirements and the resource matrix. Finally, a convenient optimal dispatch scheme is obtained by decomposing each original scene and simplifying the objective function. To illustrate the application of the decision model and the algorithm, a case of the expressway network is studied on areas around Nanjing city in China and the results show that the model used and the algorithm proposed are appropriate.展开更多
A network selection optimization algorithm based on the Markov decision process(MDP)is proposed so that mobile terminals can always connect to the best wireless network in a heterogeneous network environment.Consideri...A network selection optimization algorithm based on the Markov decision process(MDP)is proposed so that mobile terminals can always connect to the best wireless network in a heterogeneous network environment.Considering the different types of service requirements,the MDP model and its reward function are constructed based on the quality of service(QoS)attribute parameters of the mobile users,and the network attribute weights are calculated by using the analytic hierarchy process(AHP).The network handoff decision condition is designed according to the different types of user services and the time-varying characteristics of the network,and the MDP model is solved by using the genetic algorithm and simulated annealing(GA-SA),thus,users can seamlessly switch to the network with the best long-term expected reward value.Simulation results show that the proposed algorithm has good convergence performance,and can guarantee that users with different service types will obtain satisfactory expected total reward values and have low numbers of network handoffs.展开更多
The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and wi...The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.展开更多
A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple...A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers （DMs） can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.展开更多
Focused crawling is an important technique for topical resource discovery on the Web.The key issue in focused crawling is to prioritize uncrawled uniform resource locators(URLs) in the frontier to focus the crawling o...Focused crawling is an important technique for topical resource discovery on the Web.The key issue in focused crawling is to prioritize uncrawled uniform resource locators(URLs) in the frontier to focus the crawling on relevant pages.Traditional focused crawlers mainly rely on content analysis.Link-based techniques are not effectively exploited despite their usefulness.In this paper,we propose a new frontier prioritizing algorithm,namely the on-line topical importance estimation(OTIE) algorithm.OTIE combines link-and content-based analysis to evaluate the priority of an uncrawled URL in the frontier.We performed real crawling experiments over 30 topics selected from the Open Directory Project(ODP) and compared harvest rate and target recall of the four crawling algorithms:breadth-first,link-context-prediction,on-line page importance computation(OPIC) and our OTIE.Experimental results showed that OTIE significantly outperforms the other three algorithms on the average target recall while maintaining an acceptable harvest rate.Moreover,OTIE is much faster than the traditional focused crawling algorithm.展开更多
Rough set theory plays an important role in knowledge discovery, but cannot deal with continuous attributes, thus discretization is a problem which we cannot neglect. And discretization of decision systems in rough se...Rough set theory plays an important role in knowledge discovery, but cannot deal with continuous attributes, thus discretization is a problem which we cannot neglect. And discretization of decision systems in rough set theory has some particular characteristics. Consistency must be satisfied and cuts for discretization is expected to be as small as possible. Consistent and minimal discretization problem is NP-complete. In this paper, an immune algorithm for the problem is proposed. The correctness and effectiveness were shown in experiments. The discretization method presented in this paper can also be used as a data pre- treating step for other symbolic knowledge discovery or machine learning methods other than rough set theory.展开更多
For the dense macro-femto coexistence networks scenario, a long-term-based handover（LTBH） algorithm is proposed. The handover decision algorithm is jointly determined by the angle of handover（AHO） and the time-tos...For the dense macro-femto coexistence networks scenario, a long-term-based handover（LTBH） algorithm is proposed. The handover decision algorithm is jointly determined by the angle of handover（AHO） and the time-tostay（TTS） to reduce the unnecessary handover numbers.First, the proposed AHO parameter is used to decrease the computation complexity in multiple candidate base stations（CBSs） scenario. Then, two types of TTS parameters are given for the fixed base stations and mobile base stations to make handover decisions among multiple CBSs. The simulation results show that the proposed LTBH algorithm can not only maintain the required transmission rate of users, but also effectively reduce the unnecessary numbers of handover in the dense macro-femto networks with the coexisting mobile BSs.展开更多
Reinforcement Learning(RL)algorithms enhance intelligence of air combat AutonomousManeuver Decision(AMD)policy,but they may underperform in target combat environmentswith disturbances.To enhance the robustness of the ...Reinforcement Learning(RL)algorithms enhance intelligence of air combat AutonomousManeuver Decision(AMD)policy,but they may underperform in target combat environmentswith disturbances.To enhance the robustness of the AMD strategy learned by RL,thisstudy proposes a Tube-based Robust RL(TRRL)method.First,this study introduces a tube todescribe reachable trajectories under disturbances,formulates a method for calculating tubes basedon sum-of-squares programming,and proposes the TRRL algorithm that enhances robustness byutilizing tube size as a quantitative indicator.Second,this study introduces offline techniques forregressing the tube size function and establishing a tube library before policy learning,aiming toeliminate complex online tube solving and reduce the computational burden during training.Furthermore,an analysis of the tube library demonstrates that the mitigated AMD strategy achievesgreater robustness,as smaller tube sizes correspond to more cautious actions.This finding highlightsthat TRRL enhances robustness by promoting a conservative policy.To effectively balanceaggressiveness and robustness,the proposed TRRL algorithm introduces a“laziness factor”as aweight of robustness.Finally,combat simulations in an environment with disturbances confirm thatthe AMD policy learned by the TRRL algorithm exhibits superior air combat performance comparedto selected robust RL baselines.展开更多
Wise healthcare is a typical application of wireless sensor network(WSN), which uses sensors to monitor the physiological state of nursing targets and locate their position in case of an emergency situation. The locat...Wise healthcare is a typical application of wireless sensor network(WSN), which uses sensors to monitor the physiological state of nursing targets and locate their position in case of an emergency situation. The location of targets need to be determined and reported to the control center,and this leads to the localization problem. While localization in healthcare field demands high accuracy and regional adaptability, the information processing mechanism of human thinking has been introduced,which includes knowledge accumulation, knowledge fusion and knowledge expansion. Furthermore, a fuzzy decision based localization approach is proposed. Received signal strength(RSS) at references points are obtained and processed as position relationship indicators, using fuzzy set theory in the knowledge accumulation stage; after that, optimize degree of membership corresponding to each anchor nodes in different environments during knowledge fusion; the matching degree of reference points is further calculated and sorted in decision-making, and the coordinates of several points with the highest matching degree are utilized to estimate the location of unknown nodes while knowledge expansion. Simulation results show that the proposed algorithm get better accuracy performance compared to several traditional algorithms under different typical occasions.展开更多
The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms fo...The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms for minimizing the size of BDDs is presented in this paper. First of all, the coding of an individual representing a BDDs is given, and the fitness of an individual is defined. The population is built by a set of the individuals. Second, the implementations based on cultural algorithms for the minimization of BDDs, i.e., the designs of belief space and population space, and the designs of acceptance function and influence function, are given in detail. Third, the fault detection approaches using BDDs for digital circuits are studied. A new method for the detection of crosstalk faults by using BDDs is presented. Experimental results on a number of digital circuits show that the BDDs with small number of nodes can be obtained by the method proposed in this paper, and all test vectors of a fault in digital circuits can also be produced.展开更多
Based on genetic algorithms, a solution algorithm is presented for the bi-level decision making problem with continuous variables in the upper level in accordance with the bi-level decision making principle. The algor...Based on genetic algorithms, a solution algorithm is presented for the bi-level decision making problem with continuous variables in the upper level in accordance with the bi-level decision making principle. The algorithm is compared with Monte Carlo simulated annealing algorithm, and its feasibility and effectiveness are verified with two calculating examples.展开更多
Under the modern education system of China, the annual scholarship evaluation is a vital thing for many of the collegestudents. This paper adopts the classification algorithm of decision tree C4.5 based on the betteri...Under the modern education system of China, the annual scholarship evaluation is a vital thing for many of the collegestudents. This paper adopts the classification algorithm of decision tree C4.5 based on the bettering of ID3 algorithm and constructa data set of the scholarship evaluation system through the analysis of the related attributes in scholarship evaluation information.And also having found some factors that plays a significant role in the growing up of the college students through analysis and re-search of moral education, intellectural education and culture&PE.展开更多
The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynami...The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision making of Project Gang is brought forward, and this algorithm can find out the best Scheme of distributing the m resources to the n Items in the time of O(m 2 n).展开更多
The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a...The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a decision tree.This article proposes a new approach based on an improved ID3 algorithm.The new algorithm introduces the importance factor λ when calculating the information entropy.It can strengthen the label of important attributes of a tree and reduce the label of non-important attributes.The algorithm overcomes the flaw of the traditional ID3 algorithm which tends to choose the attributes with more values,and also improves the efficiency and flexibility in the process of generating decision trees.展开更多
The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute ...The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient.展开更多
In the case of on-line action role-playing game, the combat strategies can be divided into three distinct classes, Strategy of Motion(SM), Strategy of Attacking Occasion (SAO) and Strategy of Using Skill (SUS). In thi...In the case of on-line action role-playing game, the combat strategies can be divided into three distinct classes, Strategy of Motion(SM), Strategy of Attacking Occasion (SAO) and Strategy of Using Skill (SUS). In this paper, we analyze such strategies of a basic game model in which the combat is modeled by the discrete competitive Markov decision process. By introducing the chase model and the combat assistant technology, we identify the optimal SM and the optimal SAO, successfully. Also, we propose an evolutionary framework, including integration with competitive coevolution and cooperative coevolution, to search the optimal SUS pair which is regarded as the Nash equilibrium point of the strategy space. Moreover, some experiments are made to demonstrate that the proposed framework has the ability to find the optimal SUS pair. Furthermore, from the results, it is shown that using cooperative coevolutionary algorithm is much more efficient than using simple evolutionary algorithm.展开更多
文摘BACKGROUND Eyelid reconstruction is an intricate process,addressing both aesthetic and functional aspects post-trauma or oncological surgery.Aesthetic concerns and oncological radicality guide personalized approaches.The complex anatomy,involving anterior and posterior lamellae,requires tailored reconstruction for optimal functionality.AIM To formulate an eyelid reconstruction algorithm through an extensive literature review and to validate it by juxtaposing surgical outcomes from Cattinara Hos-in dry eye and tears,which may lead to long-term consequences such as chronic conjunctivitis,discomfort,or photo-phobia.To prevent this issue,scars should be oriented vertically or perpendicularly to the free eyelid margin when the size of the tumor allows.In employing a malar flap to repair a lower eyelid defect,the malar incision must ascend diagonally;this facilitates enhanced flap advancement and mitigates ectropion by restricting vertical traction.Conse-quently,it is imperative to maintain that the generated tension remains consistently horizontal and never vertical[9].Lagophthalmos is a disorder characterized by the inability to completely close the eyelids,leading to corneal exposure and an increased risk of keratitis or ulceration;it may arise following upper eyelid surgery.To avert this issue,it is essential to preserve a minimum of 1 cm of skin between the superior edge of the excision and the inferior boundary of the eyebrow.Epiphora may occur in cancers involving the lacrimal puncta,requiring their removal.As previously stated,when employing a glabellar flap to rectify medial canthal abnormalities,it is essential to prevent a trapdoor effect or thickening of the flap relative to the eyelid skin to which it is affixed.Constraints about our proposed algorithm enco-mpass limited sample sizes and possible publication biases in existing studies.Subsequent investigations ought to examine long-term results to further refine the algorithm.Future research should evaluate the algorithm across varied populations and examine the impact of novel graft materials on enhancing reconstructive outcomes.CONCLUSION Eyelid reconstruction remains one of the most intriguing challenges for a plastic surgeon today.The most fascinating aspect of this discipline is the need to restore the functionality of such an essential structure while maintaining its aesthetics.In our opinion,creating decision-making algorithms can facilitate reaching this goal by allowing for the individualization of the reconstructive path while minimizing the incidence of complications.The fact that we have decreased the incidence of severe complications is a sign that the work is moving in the right direction.The fact that there has been no need for reintervention,neither for reconstructive issues nor for inadequate oncological radicality,overall signifies greater patient satisfaction as they do not have to undergo the stress of new surgeries.Even the minor complic-ations recorded are in line with those reported in the literature,and,even more importantly for patients,they are of limited duration.In our experience,after a year of application,we can say that the objective has been achieved,but much more can still be done.Behind every work,a scientific basis must be continually renewed and refreshed to maintain high-quality standards.Therefore,searching for possible alternative solutions to be included in one’s surgical armamentarium is fundamental to providing the patient with a fully personalized option.
基金the Liaoning Province Nature Fundation Project(2022-MS-291)the National Programme for Foreign Expert Projects(G2022006008L)+2 种基金the Basic Research Projects of Liaoning Provincial Department of Education(LJKMZ20220781,LJKMZ20220783,LJKQZ20222457)King Saud University funded this study through theResearcher Support Program Number(RSPD2023R704)King Saud University,Riyadh,Saudi Arabia.
文摘The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.
文摘This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.
基金supported in part by the Central Government Guides Local Science and TechnologyDevelopment Funds(Grant No.YDZJSX2021A038)in part by theNational Natural Science Foundation of China under(Grant No.61806138)in part by the China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)(Grant 2021FNA04014).
文摘The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.
基金The National Natural Science Foundation of China (No.50422283)the Science and Technology Key Plan Project of Henan Province (No.072102360060)
文摘In order to solve the problems of potential incident rescue on expressway networks, the opportunity cost-based method is used to establish a resource dispatch decision model. The model aims to dispatch the rescue resources from the regional road networks and to obtain the location of the rescue depots and the numbers of service vehicles assigned for the potential incidents. Due to the computational complexity of the decision model, a scene decomposition algorithm is proposed. The algorithm decomposes the dispatch problem from various kinds of resources to a single resource, and determines the original scene of rescue resources based on the rescue requirements and the resource matrix. Finally, a convenient optimal dispatch scheme is obtained by decomposing each original scene and simplifying the objective function. To illustrate the application of the decision model and the algorithm, a case of the expressway network is studied on areas around Nanjing city in China and the results show that the model used and the algorithm proposed are appropriate.
基金partially supported by Nation Science Foundation of China (61661025, 61661026)Foundation of A hundred Youth Talents Training Program of Lanzhou Jiaotong University (152022)
文摘A network selection optimization algorithm based on the Markov decision process(MDP)is proposed so that mobile terminals can always connect to the best wireless network in a heterogeneous network environment.Considering the different types of service requirements,the MDP model and its reward function are constructed based on the quality of service(QoS)attribute parameters of the mobile users,and the network attribute weights are calculated by using the analytic hierarchy process(AHP).The network handoff decision condition is designed according to the different types of user services and the time-varying characteristics of the network,and the MDP model is solved by using the genetic algorithm and simulated annealing(GA-SA),thus,users can seamlessly switch to the network with the best long-term expected reward value.Simulation results show that the proposed algorithm has good convergence performance,and can guarantee that users with different service types will obtain satisfactory expected total reward values and have low numbers of network handoffs.
基金Project(51090385) supported by the Major Program of National Natural Science Foundation of ChinaProject(2011IB001) supported by Yunnan Provincial Science and Technology Program,China+1 种基金Project(2012DFA70570) supported by the International Science & Technology Cooperation Program of ChinaProject(2011IA004) supported by the Yunnan Provincial International Cooperative Program,China
文摘The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.
基金supported by the National Aerospace Science Foundation of China(20138053038)the Graduate Starting Seed Fund of Northwestern Polytechnical University(Z2015111)
文摘A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers （DMs） can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.
基金Project (No.2007C23086) supported by the Science and Technology Plan of Zhejiang Province,China
文摘Focused crawling is an important technique for topical resource discovery on the Web.The key issue in focused crawling is to prioritize uncrawled uniform resource locators(URLs) in the frontier to focus the crawling on relevant pages.Traditional focused crawlers mainly rely on content analysis.Link-based techniques are not effectively exploited despite their usefulness.In this paper,we propose a new frontier prioritizing algorithm,namely the on-line topical importance estimation(OTIE) algorithm.OTIE combines link-and content-based analysis to evaluate the priority of an uncrawled URL in the frontier.We performed real crawling experiments over 30 topics selected from the Open Directory Project(ODP) and compared harvest rate and target recall of the four crawling algorithms:breadth-first,link-context-prediction,on-line page importance computation(OPIC) and our OTIE.Experimental results showed that OTIE significantly outperforms the other three algorithms on the average target recall while maintaining an acceptable harvest rate.Moreover,OTIE is much faster than the traditional focused crawling algorithm.
基金Project supported by the National Basic Research Program (973)of China (No. 2002CB312106), China Postdoctoral Science Founda-tion (No. 2004035715), the Science & Technology Program of Zhe-jiang Province (No. 2004C31098), and the Postdoctoral Foundation of Zhejiang Province (No. 2004-bsh-023), China
文摘Rough set theory plays an important role in knowledge discovery, but cannot deal with continuous attributes, thus discretization is a problem which we cannot neglect. And discretization of decision systems in rough set theory has some particular characteristics. Consistency must be satisfied and cuts for discretization is expected to be as small as possible. Consistent and minimal discretization problem is NP-complete. In this paper, an immune algorithm for the problem is proposed. The correctness and effectiveness were shown in experiments. The discretization method presented in this paper can also be used as a data pre- treating step for other symbolic knowledge discovery or machine learning methods other than rough set theory.
基金The National Natural Science Foundation of China(No.61471164)the Fundamental Research Funds for the Central Universitiesthe Scientific Innovation Research of College Graduates in Jiangsu Province(No.KYLX-0133)
文摘For the dense macro-femto coexistence networks scenario, a long-term-based handover（LTBH） algorithm is proposed. The handover decision algorithm is jointly determined by the angle of handover（AHO） and the time-tostay（TTS） to reduce the unnecessary handover numbers.First, the proposed AHO parameter is used to decrease the computation complexity in multiple candidate base stations（CBSs） scenario. Then, two types of TTS parameters are given for the fixed base stations and mobile base stations to make handover decisions among multiple CBSs. The simulation results show that the proposed LTBH algorithm can not only maintain the required transmission rate of users, but also effectively reduce the unnecessary numbers of handover in the dense macro-femto networks with the coexisting mobile BSs.
文摘Reinforcement Learning(RL)algorithms enhance intelligence of air combat AutonomousManeuver Decision(AMD)policy,but they may underperform in target combat environmentswith disturbances.To enhance the robustness of the AMD strategy learned by RL,thisstudy proposes a Tube-based Robust RL(TRRL)method.First,this study introduces a tube todescribe reachable trajectories under disturbances,formulates a method for calculating tubes basedon sum-of-squares programming,and proposes the TRRL algorithm that enhances robustness byutilizing tube size as a quantitative indicator.Second,this study introduces offline techniques forregressing the tube size function and establishing a tube library before policy learning,aiming toeliminate complex online tube solving and reduce the computational burden during training.Furthermore,an analysis of the tube library demonstrates that the mitigated AMD strategy achievesgreater robustness,as smaller tube sizes correspond to more cautious actions.This finding highlightsthat TRRL enhances robustness by promoting a conservative policy.To effectively balanceaggressiveness and robustness,the proposed TRRL algorithm introduces a“laziness factor”as aweight of robustness.Finally,combat simulations in an environment with disturbances confirm thatthe AMD policy learned by the TRRL algorithm exhibits superior air combat performance comparedto selected robust RL baselines.
基金supported by the National Natural Science Foundation of China (Grant No. 51677065)
文摘Wise healthcare is a typical application of wireless sensor network(WSN), which uses sensors to monitor the physiological state of nursing targets and locate their position in case of an emergency situation. The location of targets need to be determined and reported to the control center,and this leads to the localization problem. While localization in healthcare field demands high accuracy and regional adaptability, the information processing mechanism of human thinking has been introduced,which includes knowledge accumulation, knowledge fusion and knowledge expansion. Furthermore, a fuzzy decision based localization approach is proposed. Received signal strength(RSS) at references points are obtained and processed as position relationship indicators, using fuzzy set theory in the knowledge accumulation stage; after that, optimize degree of membership corresponding to each anchor nodes in different environments during knowledge fusion; the matching degree of reference points is further calculated and sorted in decision-making, and the coordinates of several points with the highest matching degree are utilized to estimate the location of unknown nodes while knowledge expansion. Simulation results show that the proposed algorithm get better accuracy performance compared to several traditional algorithms under different typical occasions.
基金supported by Natural Science Foundation of Guangdong Provincial of China (No.7005833)
文摘The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms for minimizing the size of BDDs is presented in this paper. First of all, the coding of an individual representing a BDDs is given, and the fitness of an individual is defined. The population is built by a set of the individuals. Second, the implementations based on cultural algorithms for the minimization of BDDs, i.e., the designs of belief space and population space, and the designs of acceptance function and influence function, are given in detail. Third, the fault detection approaches using BDDs for digital circuits are studied. A new method for the detection of crosstalk faults by using BDDs is presented. Experimental results on a number of digital circuits show that the BDDs with small number of nodes can be obtained by the method proposed in this paper, and all test vectors of a fault in digital circuits can also be produced.
文摘Based on genetic algorithms, a solution algorithm is presented for the bi-level decision making problem with continuous variables in the upper level in accordance with the bi-level decision making principle. The algorithm is compared with Monte Carlo simulated annealing algorithm, and its feasibility and effectiveness are verified with two calculating examples.
文摘Under the modern education system of China, the annual scholarship evaluation is a vital thing for many of the collegestudents. This paper adopts the classification algorithm of decision tree C4.5 based on the bettering of ID3 algorithm and constructa data set of the scholarship evaluation system through the analysis of the related attributes in scholarship evaluation information.And also having found some factors that plays a significant role in the growing up of the college students through analysis and re-search of moral education, intellectural education and culture&PE.
文摘The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision making of Project Gang is brought forward, and this algorithm can find out the best Scheme of distributing the m resources to the n Items in the time of O(m 2 n).
文摘The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a decision tree.This article proposes a new approach based on an improved ID3 algorithm.The new algorithm introduces the importance factor λ when calculating the information entropy.It can strengthen the label of important attributes of a tree and reduce the label of non-important attributes.The algorithm overcomes the flaw of the traditional ID3 algorithm which tends to choose the attributes with more values,and also improves the efficiency and flexibility in the process of generating decision trees.
文摘The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient.
文摘In the case of on-line action role-playing game, the combat strategies can be divided into three distinct classes, Strategy of Motion(SM), Strategy of Attacking Occasion (SAO) and Strategy of Using Skill (SUS). In this paper, we analyze such strategies of a basic game model in which the combat is modeled by the discrete competitive Markov decision process. By introducing the chase model and the combat assistant technology, we identify the optimal SM and the optimal SAO, successfully. Also, we propose an evolutionary framework, including integration with competitive coevolution and cooperative coevolution, to search the optimal SUS pair which is regarded as the Nash equilibrium point of the strategy space. Moreover, some experiments are made to demonstrate that the proposed framework has the ability to find the optimal SUS pair. Furthermore, from the results, it is shown that using cooperative coevolutionary algorithm is much more efficient than using simple evolutionary algorithm.
