"Data Structure and Algorithm",which is an important major subject in computer science,has a lot of problems in teaching activity.This paper introduces and analyzes the situation and problems in this course ..."Data Structure and Algorithm",which is an important major subject in computer science,has a lot of problems in teaching activity.This paper introduces and analyzes the situation and problems in this course study.A "programming factory" method is then brought out which is indeed a practice-oriented platform of the teachingstudy process.Good results are obtained by this creative method.展开更多
In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a l...In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a length 2t real GFT(a,b)(a = +/-1/2, b = +/-1/2) is 2(t+1) - 2. Practical algorithms which meet the lower bounds of multiplications are given.展开更多
This paper presents a new and simple scheme to describe the convex hull in R^d,which only uses three kinds of the faces of the convex hull,i.e.,the d-1-faces,d-2-faces and 0-faces.Thus,we develop an efficient new algo...This paper presents a new and simple scheme to describe the convex hull in R^d,which only uses three kinds of the faces of the convex hull,i.e.,the d-1-faces,d-2-faces and 0-faces.Thus,we develop an efficient new algorithm for constructing the convex hull of a finite set of points incrementally. This algorithm employs much less storage and time than that of the previously-existing approaches.The analysis of the running time as well as the storage for the new algorithm is also theoretically made.The algorithm is optimal in the worst case for even d.展开更多
Since years, online social networks have evolved from profile and communication websites to online portals where people interact with each other, share and consume multimedia-enriched data and play different types of ...Since years, online social networks have evolved from profile and communication websites to online portals where people interact with each other, share and consume multimedia-enriched data and play different types of games. Due to the immense popularity of these online games and their huge revenue potential, the number of these games increases every day, resulting in a current offering of thousands of online social games. In this paper, the applicability of neighborhood-based collaborative filtering （CF） algorithms for the recommendation of online social games is evaluated. This evaluation is based on a large dataset of an online social gaming platform containing game ratings （explicit data） and online gaming behavior （implicit data） of millions of active users. Several similarity metrics were implemented and evaluated on the explicit data, implicit data and a combination thereof. It is shown that the neighborhood-based CF algorithms greatly outperform the content-based algorithm, currently often used on online social gaming websites. The reslflts also show that a combined approach, fie, taking into account both implicit and explicit data at the same time, yields overall good results on all evaluation metrics for all scenarios, while only slightly performing worse compared to the strengths of the explicit or implicit only approaches. The best performing algorithms have been implemented in a live setup of the online game platform.展开更多
Purpose-The purpose of this paper is to show an efficient method for the detection of signs of early lung cancer.Various image processing algorithms are presented for different types of lesions,and a scheme is propose...Purpose-The purpose of this paper is to show an efficient method for the detection of signs of early lung cancer.Various image processing algorithms are presented for different types of lesions,and a scheme is proposed for the combination of results.Design/methodology/approach-A computer aided detection(CAD)scheme was developed for detection of lung cancer.It enables different lesion enhancer algorithms,sensitive to specific lesion subtypes,to be used simultaneously.Three image processing algorithms are presented for the detection of small nodules,large ones,and infiltrated areas.The outputs are merged,the false detection rate is reduced with four separated support vector machine(SVM)classifiers.The classifier input comes from a feature selection algorithm selecting from various textural and geometric features.A total of 761 images were used for testing,including the database of the Japanese Society of Radiological Technology(JSRT).Findings-The fusion of algorithms reduced false positives on average by 0.6 per image,while the sensitivity remained 80 per cent.On the JSRT database the system managed to find 60.2 per cent of lesions at an average of 2.0 false positives per image.The effect of using different result evaluation criteria was tested and a difference as high as 4 percentage points in sensitivity was measured.The system was compared to other published methods.Originality/value-The study described in the paper proves the usefulness of lesion enhancement decomposition,while proposing a scheme for the fusion of algorithms.Furthermore,a new algorithm is introduced for the detection of infiltrated areas,possible signs of lung cancer,neglected by previous solutions.展开更多
Purpose–The air-breathing hypersonic vehicle(AHV)includes intricate inherent coupling between the propulsion system and the airframe dynamics,which results in an intractable nonlinear system for the controller design...Purpose–The air-breathing hypersonic vehicle(AHV)includes intricate inherent coupling between the propulsion system and the airframe dynamics,which results in an intractable nonlinear system for the controller design.The purpose of this paper is to propose an H1 control method for AHV based on the online simultaneous policy update algorithm(SPUA).Design/methodology/approach–Initially,the H1 state feedback control problem of the AHV is converted to the problem of solving the Hamilton-Jacobi-Isaacs(HJI)equation,which is notoriously difficult to solve both numerically and analytically.To overcome this difficulty,the online SPUA is introduced to solve the HJI equation without requiring the accurate knowledge of the internal system dynamics.Subsequently,the online SPUA is implemented on the basis of an actor-critic structure,in which neural network(NN)is employed for approximating the cost function and a least-square method is used to calculate the NN weight parameters.Findings–Simulation study on the AHV demonstrates the effectiveness of the proposed H1 control method.Originality/value–The paper presents an interesting method for the H1 state feedback control design problem of the AHV based on online SPUA.展开更多
Purpose-The purpose of this paper is to establish a version of a theorem that originated from population genetics and has been later adopted in evolutionary computation theory that will lead to novel Monte-Carlo sampl...Purpose-The purpose of this paper is to establish a version of a theorem that originated from population genetics and has been later adopted in evolutionary computation theory that will lead to novel Monte-Carlo sampling algorithms that provably increase the AI potential.Design/methodology/approach-In the current paper the authors set up a mathematical framework,state and prove a version of a Geiringer-like theorem that is very well-suited for the development of Mote-Carlo sampling algorithms to cope with randomness and incomplete information to make decisions.Findings-This work establishes an important theoretical link between classical population genetics,evolutionary computation theory and model free reinforcement learning methodology.Not only may the theory explain the success of the currently existing Monte-Carlo tree sampling methodology,but it also leads to the development of novel Monte-Carlo sampling techniques guided by rigorous mathematical foundation.Practical implications-The theoretical foundations established in the current work provide guidance for the design of powerful Monte-Carlo sampling algorithms in model free reinforcement learning,to tackle numerous problems in computational intelligence.Originality/value-Establishing a Geiringer-like theorem with non-homologous recombination was a long-standing open problem in evolutionary computation theory.Apart from overcoming this challenge,in a mathematically elegant fashion and establishing a rather general and powerful version of the theorem,this work leads directly to the development of novel provably powerful algorithms for decision making in the environment involving randomness,hidden or incomplete information.展开更多
Purpose–The purpose of this paper is to present a hybrid method of intelligent optimization algorithm and Receding Horizon Control.The method is applied to solve the problem of cooperative search of multi-unmanned ae...Purpose–The purpose of this paper is to present a hybrid method of intelligent optimization algorithm and Receding Horizon Control.The method is applied to solve the problem of cooperative search of multi-unmanned aerial vehicles(multi-UAVs).Design/methodology/approach–The intelligent optimization of Differential Evolution(DE)makes the complex problem of multi-UAVs cooperative search a regular function optimization problem.To meet the real-time requirement,the idea of Receding Horizon Control is applied.An Extended Search Map based on hormone information is used to describe the uncertain environment information.Findings–Simulation results indicate effectiveness of the hybrid method in solving the problem of cooperative search for multi-UAVs.Originality/value–The paper presents an interesting hybrid method of DE and Receding Horizon Control for the problem of cooperative multi-UAVs.展开更多
An improved 2 D stability margin test and its algorithm for 2 D discrete systems are proposed.The stability margin test procedure can be slmplified by using the inner term polynomials of B(z 1,z 2) to construct a ma...An improved 2 D stability margin test and its algorithm for 2 D discrete systems are proposed.The stability margin test procedure can be slmplified by using the inner term polynomials of B(z 1,z 2) to construct a margin test table.Different from other well known 2 D stability margin test algorithms,the new approach can directly obtain the stability margin.展开更多
Purpose–Autonomous Underwater Vehicles(AUVs)play a crucial role in marine biology research and oceanic natural resources exploration.Since most AUVs are underactuated they require sophisticated trajectory planning an...Purpose–Autonomous Underwater Vehicles(AUVs)play a crucial role in marine biology research and oceanic natural resources exploration.Since most AUVs are underactuated they require sophisticated trajectory planning and tracking algorithms.The purpose of this paper is to develop a new method that allows an underactuated AUV to track a moving object while constraining the approach to a direction tangent to the path of the target.Furthermore,the distance at which the AUV follows the target is constrained,reducing the probability of detection and unwanted behavior change of the target.Design/methodology/approach–First,a kinematic controller that generates a trajectory tangent to the path of the moving target is designed such that the AUV maintains a prescribed distance and approaches the target from behind.Using a Lyapunov based method the stability of the kinematic controller is proven.Second,a dynamic sliding mode controller is employed to drive the vehicle on the trajectory computed in the first step.Findings–The kinematic and dynamic controllers are shown to be stable and robust against parameter uncertainty in the dynamic model of the vehicle.Results of numerical simulations for equidistant tracking of a target on both smooth and discontinuous derivatives trajectories for a variety of relative initial positions and orientations are shown.Originality/value–The contribution of this research is development of a new method for path planning and tracking of moving targets for underactuated AUVs in the horizontal plane.The method allows control of both the direction of approach and the distance from a moving object.展开更多
Electric power system is a physical energy system consisting of power generation,substations,transmission,distribution,and consumption.The objective of power system optimization is to improve power system security,eco...Electric power system is a physical energy system consisting of power generation,substations,transmission,distribution,and consumption.The objective of power system optimization is to improve power system security,economy,and reliability.This paper summarizes the classical mathematical optimization methods and modeling techniques of power system optimization associated with system planning,operation,and control.Along with the development of electric power industry,the concept of Energy Internet is addressed,which consists of power network,gas network,and transportation network.Under such new environments,electric power optimization faces some challenging with respect to the cooperation of multi-energy networks.According to the design structure and operational characteristics of the Energy Internet,some research areas of electric power optimization are presented from the viewofmathematical optimization modeling and calculation.The aim is to provide some optimization methodology to solve the optimal issues of power system under the background of Energy Internet.展开更多
The massive flow of scholarly publications from traditional paper journals to online outlets has benefited biologists because of its ease to access. However, due to the sheer volume of available biological literature,...The massive flow of scholarly publications from traditional paper journals to online outlets has benefited biologists because of its ease to access. However, due to the sheer volume of available biological literature, researchers are finding it increasingly difficult to locate needed information. As a result, recent biology contests, notably JNLPBA and BioCreAtIvE, have focused on evaluating various methods in which the literature may be navigated. Among these methods, text-mining technology has shown the most promise. With recent advances in text-mining technology and the fact that publishers are now making the full texts of articles available in XML format, TMSs can be adapted to accelerate literature curation, maintain the integrity of information, and ensure proper linkage of data to other resources. Even so, several new challenges have emerged in relation to full text analysis, life-science terminology, complex relation extraction, and information fusion. These challenges must be overcome in order for text-mining to be more effective. In this paper, we identify the challenges, discuss how they might be overcome, and consider the resources that may be helpful in achieving that goal.展开更多
基金supported by NSF B55101680,NTIF B2090571,B2110140,SCUT x2rjD2116860,Y1080170,Y1090160,Y1100030,Y1100050,Y1110020 and S1010561121,G101056137
文摘"Data Structure and Algorithm",which is an important major subject in computer science,has a lot of problems in teaching activity.This paper introduces and analyzes the situation and problems in this course study.A "programming factory" method is then brought out which is indeed a practice-oriented platform of the teachingstudy process.Good results are obtained by this creative method.
文摘In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a length 2t real GFT(a,b)(a = +/-1/2, b = +/-1/2) is 2(t+1) - 2. Practical algorithms which meet the lower bounds of multiplications are given.
基金This work is supported by the National Natural Science Foundation of China.
文摘This paper presents a new and simple scheme to describe the convex hull in R^d,which only uses three kinds of the faces of the convex hull,i.e.,the d-1-faces,d-2-faces and 0-faces.Thus,we develop an efficient new algorithm for constructing the convex hull of a finite set of points incrementally. This algorithm employs much less storage and time than that of the previously-existing approaches.The analysis of the running time as well as the storage for the new algorithm is also theoretically made.The algorithm is optimal in the worst case for even d.
文摘Since years, online social networks have evolved from profile and communication websites to online portals where people interact with each other, share and consume multimedia-enriched data and play different types of games. Due to the immense popularity of these online games and their huge revenue potential, the number of these games increases every day, resulting in a current offering of thousands of online social games. In this paper, the applicability of neighborhood-based collaborative filtering （CF） algorithms for the recommendation of online social games is evaluated. This evaluation is based on a large dataset of an online social gaming platform containing game ratings （explicit data） and online gaming behavior （implicit data） of millions of active users. Several similarity metrics were implemented and evaluated on the explicit data, implicit data and a combination thereof. It is shown that the neighborhood-based CF algorithms greatly outperform the content-based algorithm, currently often used on online social gaming websites. The reslflts also show that a combined approach, fie, taking into account both implicit and explicit data at the same time, yields overall good results on all evaluation metrics for all scenarios, while only slightly performing worse compared to the strengths of the explicit or implicit only approaches. The best performing algorithms have been implemented in a live setup of the online game platform.
基金This work was partly supported by the National Development Agency under contract KMOP-1.1.1-07/1-2008-0035.
文摘Purpose-The purpose of this paper is to show an efficient method for the detection of signs of early lung cancer.Various image processing algorithms are presented for different types of lesions,and a scheme is proposed for the combination of results.Design/methodology/approach-A computer aided detection(CAD)scheme was developed for detection of lung cancer.It enables different lesion enhancer algorithms,sensitive to specific lesion subtypes,to be used simultaneously.Three image processing algorithms are presented for the detection of small nodules,large ones,and infiltrated areas.The outputs are merged,the false detection rate is reduced with four separated support vector machine(SVM)classifiers.The classifier input comes from a feature selection algorithm selecting from various textural and geometric features.A total of 761 images were used for testing,including the database of the Japanese Society of Radiological Technology(JSRT).Findings-The fusion of algorithms reduced false positives on average by 0.6 per image,while the sensitivity remained 80 per cent.On the JSRT database the system managed to find 60.2 per cent of lesions at an average of 2.0 false positives per image.The effect of using different result evaluation criteria was tested and a difference as high as 4 percentage points in sensitivity was measured.The system was compared to other published methods.Originality/value-The study described in the paper proves the usefulness of lesion enhancement decomposition,while proposing a scheme for the fusion of algorithms.Furthermore,a new algorithm is introduced for the detection of infiltrated areas,possible signs of lung cancer,neglected by previous solutions.
基金supported by the National Basic Research Program of China(973 Program)(2012CB720003)the National Natural Science Foundation of China under Grants 91016004,61074057 and 61121003.
文摘Purpose–The air-breathing hypersonic vehicle(AHV)includes intricate inherent coupling between the propulsion system and the airframe dynamics,which results in an intractable nonlinear system for the controller design.The purpose of this paper is to propose an H1 control method for AHV based on the online simultaneous policy update algorithm(SPUA).Design/methodology/approach–Initially,the H1 state feedback control problem of the AHV is converted to the problem of solving the Hamilton-Jacobi-Isaacs(HJI)equation,which is notoriously difficult to solve both numerically and analytically.To overcome this difficulty,the online SPUA is introduced to solve the HJI equation without requiring the accurate knowledge of the internal system dynamics.Subsequently,the online SPUA is implemented on the basis of an actor-critic structure,in which neural network(NN)is employed for approximating the cost function and a least-square method is used to calculate the NN weight parameters.Findings–Simulation study on the AHV demonstrates the effectiveness of the proposed H1 control method.Originality/value–The paper presents an interesting method for the H1 state feedback control design problem of the AHV based on online SPUA.
基金This work has been sponsored by EPSRC EP/D003/05/1“Amorphous Computing”and EPSRC EP/I009809/1“Evolutionary Approximation Algorithms for Optimization:Algorithm Design and Complexity Analysis”Grants.
文摘Purpose-The purpose of this paper is to establish a version of a theorem that originated from population genetics and has been later adopted in evolutionary computation theory that will lead to novel Monte-Carlo sampling algorithms that provably increase the AI potential.Design/methodology/approach-In the current paper the authors set up a mathematical framework,state and prove a version of a Geiringer-like theorem that is very well-suited for the development of Mote-Carlo sampling algorithms to cope with randomness and incomplete information to make decisions.Findings-This work establishes an important theoretical link between classical population genetics,evolutionary computation theory and model free reinforcement learning methodology.Not only may the theory explain the success of the currently existing Monte-Carlo tree sampling methodology,but it also leads to the development of novel Monte-Carlo sampling techniques guided by rigorous mathematical foundation.Practical implications-The theoretical foundations established in the current work provide guidance for the design of powerful Monte-Carlo sampling algorithms in model free reinforcement learning,to tackle numerous problems in computational intelligence.Originality/value-Establishing a Geiringer-like theorem with non-homologous recombination was a long-standing open problem in evolutionary computation theory.Apart from overcoming this challenge,in a mathematically elegant fashion and establishing a rather general and powerful version of the theorem,this work leads directly to the development of novel provably powerful algorithms for decision making in the environment involving randomness,hidden or incomplete information.
基金This work was supported by the Aeronautical Science Foundation of China under Grant no.2010ZC1312Foundation of Science and Technology on Electron-Optic Control Laboratory.
文摘Purpose–The purpose of this paper is to present a hybrid method of intelligent optimization algorithm and Receding Horizon Control.The method is applied to solve the problem of cooperative search of multi-unmanned aerial vehicles(multi-UAVs).Design/methodology/approach–The intelligent optimization of Differential Evolution(DE)makes the complex problem of multi-UAVs cooperative search a regular function optimization problem.To meet the real-time requirement,the idea of Receding Horizon Control is applied.An Extended Search Map based on hormone information is used to describe the uncertain environment information.Findings–Simulation results indicate effectiveness of the hybrid method in solving the problem of cooperative search for multi-UAVs.Originality/value–The paper presents an interesting hybrid method of DE and Receding Horizon Control for the problem of cooperative multi-UAVs.
文摘An improved 2 D stability margin test and its algorithm for 2 D discrete systems are proposed.The stability margin test procedure can be slmplified by using the inner term polynomials of B(z 1,z 2) to construct a margin test table.Different from other well known 2 D stability margin test algorithms,the new approach can directly obtain the stability margin.
文摘Purpose–Autonomous Underwater Vehicles(AUVs)play a crucial role in marine biology research and oceanic natural resources exploration.Since most AUVs are underactuated they require sophisticated trajectory planning and tracking algorithms.The purpose of this paper is to develop a new method that allows an underactuated AUV to track a moving object while constraining the approach to a direction tangent to the path of the target.Furthermore,the distance at which the AUV follows the target is constrained,reducing the probability of detection and unwanted behavior change of the target.Design/methodology/approach–First,a kinematic controller that generates a trajectory tangent to the path of the moving target is designed such that the AUV maintains a prescribed distance and approaches the target from behind.Using a Lyapunov based method the stability of the kinematic controller is proven.Second,a dynamic sliding mode controller is employed to drive the vehicle on the trajectory computed in the first step.Findings–The kinematic and dynamic controllers are shown to be stable and robust against parameter uncertainty in the dynamic model of the vehicle.Results of numerical simulations for equidistant tracking of a target on both smooth and discontinuous derivatives trajectories for a variety of relative initial positions and orientations are shown.Originality/value–The contribution of this research is development of a new method for path planning and tracking of moving targets for underactuated AUVs in the horizontal plane.The method allows control of both the direction of approach and the distance from a moving object.
基金the National Natural Science Foundation of China(No.11671125).
文摘Electric power system is a physical energy system consisting of power generation,substations,transmission,distribution,and consumption.The objective of power system optimization is to improve power system security,economy,and reliability.This paper summarizes the classical mathematical optimization methods and modeling techniques of power system optimization associated with system planning,operation,and control.Along with the development of electric power industry,the concept of Energy Internet is addressed,which consists of power network,gas network,and transportation network.Under such new environments,electric power optimization faces some challenging with respect to the cooperation of multi-energy networks.According to the design structure and operational characteristics of the Energy Internet,some research areas of electric power optimization are presented from the viewofmathematical optimization modeling and calculation.The aim is to provide some optimization methodology to solve the optimal issues of power system under the background of Energy Internet.
基金supported by the "National Science Council" under Grant Nos. NSC 97-2218-E-155-001 and NSC96-2752-E-001-001-PAEthe Research Center for Humanities and Social Sciencesthe Thematic Program of "Academia Sinica" under Grant No.AS95ASIA02
文摘The massive flow of scholarly publications from traditional paper journals to online outlets has benefited biologists because of its ease to access. However, due to the sheer volume of available biological literature, researchers are finding it increasingly difficult to locate needed information. As a result, recent biology contests, notably JNLPBA and BioCreAtIvE, have focused on evaluating various methods in which the literature may be navigated. Among these methods, text-mining technology has shown the most promise. With recent advances in text-mining technology and the fact that publishers are now making the full texts of articles available in XML format, TMSs can be adapted to accelerate literature curation, maintain the integrity of information, and ensure proper linkage of data to other resources. Even so, several new challenges have emerged in relation to full text analysis, life-science terminology, complex relation extraction, and information fusion. These challenges must be overcome in order for text-mining to be more effective. In this paper, we identify the challenges, discuss how they might be overcome, and consider the resources that may be helpful in achieving that goal.
