Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programm...Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programming(GP),characterized by its tree-based solution structure,is a widely adopted technique for optimizing the structure of mathematical models tailored to real-world problems.This paper introduces a GP-based framework(GPEAs)for the autonomous generation of update formulas,aiming to reduce human intervention.Partial modifications to tree-based GP have been instigated,encompassing adjustments to its initialization process and fundamental update operations such as crossover and mutation within the algorithm.By designing suitable function sets and terminal sets tailored to the selected evolutionary algorithm,and ultimately derive an improved update formula.The Cat Swarm Optimization Algorithm(CSO)is chosen as a case study,and the GP-EAs is employed to regenerate the speed update formulas of the CSO.To validate the feasibility of the GP-EAs,the comprehensive performance of the enhanced algorithm(GP-CSO)was evaluated on the CEC2017 benchmark suite.Furthermore,GP-CSO is applied to deduce suitable embedding factors,thereby improving the robustness of the digital watermarking process.The experimental results indicate that the update formulas generated through training with GP-EAs possess excellent performance scalability and practical application proficiency.展开更多
One way to improve practicability of automatic program repair（APR） techniques is to build prediction models which can predict whether an application of a APR technique on a bug is effective or not. Existing predicti...One way to improve practicability of automatic program repair（APR） techniques is to build prediction models which can predict whether an application of a APR technique on a bug is effective or not. Existing prediction models have some limitations. First, the prediction models are built with hand crafted features which usually fail to capture the semantic characteristics of program repair task. Second, the performance of the prediction models is only evaluated on Genprog, a genetic-programming based APR technique. This paper develops prediction models, i.e., random forest prediction models for SPR, another kind of generate-and-validate APR technique, which can distinguish ineffective repair instances from effective repair instances. Rather than handcrafted features, we use features automatically learned by deep belief network（DBN） to train the prediction models. The empirical results show that compared to the baseline models, that is, all effective models, our proposed models can at least improve the F1 by 9% and AUC（area under the receiver operating characteristics curve） by 19%. At the same time, the prediction model using learned features at least outperforms the one using hand-crafted features in terms of F1 by 11%.展开更多
Creating practice questions for programming learning is not easy.It requires the instructor to diligently organize heterogeneous learning resources,that is,conceptual programming concepts and procedural programming ru...Creating practice questions for programming learning is not easy.It requires the instructor to diligently organize heterogeneous learning resources,that is,conceptual programming concepts and procedural programming rules.Today’s programming question generation(PQG)is still largely relying on the demanding creation task performed by the instructors without advanced technological support.In this work,we propose a semantic PQG model that aims to help the instructor generate new programming questions and expand the assessment items.The PQG model is designed to transform conceptual and procedural programming knowledge from textbooks into a semantic network by the Local Knowledge Graph(LKG)and Abstract Syntax Tree(AST).For any given question,the model queries the established network to find related code examples and generates a set of questions by the associated LKG/AST semantic structures.We conduct analysis to compare instructor-made questions from 9 undergraduate introductory programming courses and textbook questions.The results show that the instructormade questions had much simpler complexity than the textbook ones.The disparity of topic distribution intrigued us to further research the breadth and depth of question quality and also to investigate the complexity of the questions in relation to the student performances.Finally,we report a user study results on the proposed Artificial Intelligent-infused semantic PQG model in examining the machine-generated questions’quality.展开更多
UML Class diagram generation from textual requirements is an important task in object-oriented design and programing course.This study proposes a method for automatically generating class diagrams from Chinese textual...UML Class diagram generation from textual requirements is an important task in object-oriented design and programing course.This study proposes a method for automatically generating class diagrams from Chinese textual requirements on the basis of Natural Language Processing(NLP)and mapping rules for sentence pattern matching.First,classes are identified through entity recognition rules and candidate class pruning rules using NLP from requirements.Second,class attributes and relationships between classes are extracted using mapping rules for sentence pattern matching on the basis of NLP.Third,we developed an assistant tool integrated into a precision micro classroom system for automatic generation of class diagram,to effectively assist the teaching of object-oriented design and programing course.Results are evaluated with precision,accuracy and recall from eight requirements of object-oriented design and programing course using truth values created by teachers.Our research should benefit beginners of object-oriented design and programing course,who may be students or software developers.It helps them to create correct domain models represented in the UML class diagram.展开更多
The level of genetic variation within a breeding population affects the effectiveness of selection strategies for genetic improvement.The relationship between genetic variation level within Pinus tabuliformis breeding...The level of genetic variation within a breeding population affects the effectiveness of selection strategies for genetic improvement.The relationship between genetic variation level within Pinus tabuliformis breeding populations and selection strategies or selection effectiveness is not fully investigated.Here,we compared the selection effectiveness of combined and individual direct selection strategies using half-and full-sib families produced from advanced-generation P.tabuliformis seed orchard as our test populations.Our results revealed that,within half-sib families,average diameter at breast height(DBH),tree height,and volume growth of superior individuals selected by the direct selection strategy were higher by 7.72%,18.56%,and 31.01%,respectively,than those selected by the combined selection strategy.Furthermore,significant differences(P<0.01)were observed between the two strategies in terms of the expected genetic gains for average tree height and volume.In contrast,within full-sib families,the differences in tree average DBH,height,and volume between the two selection strategies were relatively minor with increase of 0.17%,2.73%,and 2.21%,respectively,and no significant differences were found in the average expected genetic gains for the studied traits.Half-sib families exhibited greater phenotypic and genetic variation,resulting in improved selection efficiency with the direct selection strategy but also introduced a level of inbreeding risk.Based on genetic distance estimates using molecular markers,our comparative seed orchard design analysis showed that the Improved Adaptive Genetic Programming Algorithm(IAPGA)reduced the average inbreeding coefficient by 14.36% and 14.73% compared to sequential and random designs,respectively.In conclusion,the combination of the direct selection strategy with IAPGA seed orchard design aimed at minimizing inbreeding offered an efficient approach for establishing advanced-generation P.tabuliformis seed orchards.展开更多
Off-line programming （OLP） system becomes one of the most important programming modules for the robotic belt grinding process, however there lacks research on increasing the grinding dexterous space depending on the...Off-line programming （OLP） system becomes one of the most important programming modules for the robotic belt grinding process, however there lacks research on increasing the grinding dexterous space depending on the OLP system. A new type of grinding robot and a novel robotic belt grinding workcell are forwarded, and their features are briefly introduced. An open and object-oriented off-line programming system is developed for this robotic belt grinding system. The parameters of the trimmed surface are read from the initial graphics exchange specification （IGES） file of the CAD model of the workpiece. The deBoor-Cox basis function is used to sample the grinding target with local contact frame on the workpiece. The numerical formula of inverse kinematics is set up based on Newton＇s iterative procedure, to calculate the grinding robot configurations corresponding to the grinding targets. After the grinding path is obtained, the OLP system turns to be more effective than the teach-by-showing system. In order to improve the grinding workspace, an optimization algorithm for dynamic tool frame is proposed and performed on the special robotic belt grinding system. The initial tool frame and the interval of neighboring tool frames are defined as the preparation of the algorithm. An optimized tool local frame can be selected to grind the complex surface for a maximum dexterity index of the robot. Under the optimization algorithm, a simulation of grinding a vane is included and comparison of grinding workspace is done before and after the tool frame optimization. By the algorithm, the grinding workspace can be enlarged. Moreover the dynamic tool frame can be considered to add one degree-of-freedom to the grinding kinematical chain, which provides the theoretical support for the improvement of robotic dexterity for the complex surface grinding.展开更多
Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based traje...Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based trajectories with smooth control histories for dynamic soaring maneuvers exploiting wind gradients.The desired smoothness is achieved by introducing a trigonometric series parameterization for the controls,which are formulated with respect to the normalized time.Specifically,the periodicity of the trigonometric functions is leveraged to facilitate the connection of cycles and streamline the problem formulation.Without relying on a specified wind profile,a freefinal-time quadratic programming-based control strategy is developed for the online correction of the flight trajectory,which requires only the instant wind information.Offline and online numerical studies show the trade-off to achieve the smoothness and demonstrate the effectiveness of the proposed method in a varying wind field.展开更多
This paper introduces a novel transform method to produce the newly generated programs through code transform model called the second generation of Generative Pre-trained Transformer(GPT-2)reasonably,improving the pro...This paper introduces a novel transform method to produce the newly generated programs through code transform model called the second generation of Generative Pre-trained Transformer(GPT-2)reasonably,improving the program execution performance significantly.Besides,a theoretical estimation in statistics has given the minimum number of generated programs as required,which guarantees to find the best one within them.The proposed approach can help the voice assistant machine resolve the problem of inefficient execution of application code.In addition to GPT-2,this study develops the variational Simhash algorithm to check the code similarity between sample program and newly generated program,and conceives the piecewise longest common subsequence algorithm to examine the execution’s conformity from the two programs mentioned above.The code similarity check deducts the redundant generated programs,and the output conformity check finds the best-performing generative program.In addition to texts,the proposed approach can also prove the other media,including images,sounds,and movies.As a result,the newly generated program outperforms the sample program significantly because the number of code lines reduces 27.21%,and the program execution time shortens 24.62%.展开更多
With development of distributed generation(DG),configuration of optimization equipment is crucial for absorbing excess electricity and stabilizing fluctuations.This study proposes a two-layer configuration strategy co...With development of distributed generation(DG),configuration of optimization equipment is crucial for absorbing excess electricity and stabilizing fluctuations.This study proposes a two-layer configuration strategy coordinates active cyber control and the physical energy storage(ES)system.First,an upper economic model is developed.Based on chance-constrained programming,an operation model accounts for inherent uncertainty are then developed.Under constraint of voltage risk level,a lower operation model is developed.Finally,a solution based on differential evolution is provided.An IEEE 33 bus system simulation was used to validate efficacy of model.The effects of risk level,equipment price,and chance-constrained probability were analyzed,providing a foundation for power consumption and expansion of cyber-physical systems.展开更多
We present an incremental network programming mechanism which reprograms wireless sensors quickly by transmitting the incremental changes using the Rsync algorithm;we generate the difference of the two program images ...We present an incremental network programming mechanism which reprograms wireless sensors quickly by transmitting the incremental changes using the Rsync algorithm;we generate the difference of the two program images allowing us to distribute only the key changes. Unlike previous approaches, our design does not assume any prior knowledge of the program code structure and can be applied to any hardware platform. To meet the resource constraints of wireless sensors, we tuned the Rsync algorithm which was originally made for updating binary files among powerful host machines. The sensor node processes the delivery and the decoding of the difference script separately making it easy to extend for multi-hop network programming. We are able to get a speed-up of 9.1 for changing a constant and 2.1 to 2.5 for changing a few lines in the source code.展开更多
This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the ...This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.展开更多
Advancements in semiconductor technology are making gate-level test generation more challenging. This is because a large amount of detailed structural information must be processed in the search process of automatic t...Advancements in semiconductor technology are making gate-level test generation more challenging. This is because a large amount of detailed structural information must be processed in the search process of automatic test pattern generation (ATPG). In addition, ATPG needs to deal with new defects caused by process variation when IC is shrinking. To reduce the computation effort of ATPG, test generation could be started earlier at higher abstraction level, which is in line with top-down design methodology that has become more popular nowadays. In this research, we employ Chen’s high-level fault model in the high-level ATPG. Besides shorter ATPG time as shown in many previous works, our study showed that high-level ATPG also contributes to test compaction. This is because most of the high-level faults correlate with the gate-level collapsed faults especially at input/output of the modules in a circuit. The high-level ATPG prototype used in our work is mainly composed by constraint-driven test generation engine and fault simulation engine. Experimental result showed that more reduced/compact test set can be generated from the high-level ATPG.展开更多
With the merits of a simple process and a short fabrication period, the capacitor structure provides a convenient way to evaluate memory characteristics of charge trap memory devices. However, the slow minority carrie...With the merits of a simple process and a short fabrication period, the capacitor structure provides a convenient way to evaluate memory characteristics of charge trap memory devices. However, the slow minority carrier generation in a capacitor often makes an underestimation of the program/erase speed. In this paper, illumination around a memory capacitor is proposed to enhance the generation of minority carriers so that an accurate measurement of the program/erase speed can be achieved. From the dependence of the inversion capacitance on frequency, a time constant is extracted to quantitatively characterize the formation of the inversion layer. Experimental results show that under a high enough illumination, this time constant is greatly reduced and the measured minority carrier-related program/erase speed is in agreement with the reported value in a transistor structure.展开更多
The networking of microgrids has received significant attention in the form of a smart grid.In this paper,a set of smart railway stations,which is assumed as microgrids,is connected together.It has been tried to manag...The networking of microgrids has received significant attention in the form of a smart grid.In this paper,a set of smart railway stations,which is assumed as microgrids,is connected together.It has been tried to manage the energy exchanged between the networked microgrids to reduce received energy from the utility grid.Also,the operational costs of stations under various conditions decrease by applying the proposed method.The smart railway stations are studied in the presence of photovoltaic(PV)units,energy storage systems(ESSs),and regenerative braking strategies.Studying regenerative braking is one of the essential contributions.Moreover,the stochastic behaviors of the ESS’s initial state of energy and the uncertainty of PV power generation are taken into account through a scenario-based method.The networked microgrid scheme of railway stations(based on coordinated operation and scheduling)and independent operation of railway stations are studied.The proposed method is applied to realistic case studies,including three stations of Line 3 of Tehran Urban and Suburban Railway Operation Company(TUSROC).The rolling stock is simulated in the MATLAB environment.Thus,the coordinated operation of networked microgrids and independent operation of railway stations are optimized in the GAMS environment utilizing mixed-integer linear programming(MILP).展开更多
The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point wit...The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane （IP/CP） method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender＇s decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm.展开更多
Energy policy is an essential part of the economy and the society. In some countries, there is a lack of a regulatory framework, which must be clear and practicable to allow new technologies to compete with the conven...Energy policy is an essential part of the economy and the society. In some countries, there is a lack of a regulatory framework, which must be clear and practicable to allow new technologies to compete with the conventional way of generation. This is the problem in Argentine, the lack of a regulatory framework that can regulate the insertion of wind energy into the Argentine power system （SADI）. In this paper, a review of typical incentives for the installation of wind farms in the world, and a review of some laws and policies in Argentine are presented. Also financial and economic issues that are related to the installation of wind farms are analyzed, and some recommendations related to the topics are presented in this paper.展开更多
文摘Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programming(GP),characterized by its tree-based solution structure,is a widely adopted technique for optimizing the structure of mathematical models tailored to real-world problems.This paper introduces a GP-based framework(GPEAs)for the autonomous generation of update formulas,aiming to reduce human intervention.Partial modifications to tree-based GP have been instigated,encompassing adjustments to its initialization process and fundamental update operations such as crossover and mutation within the algorithm.By designing suitable function sets and terminal sets tailored to the selected evolutionary algorithm,and ultimately derive an improved update formula.The Cat Swarm Optimization Algorithm(CSO)is chosen as a case study,and the GP-EAs is employed to regenerate the speed update formulas of the CSO.To validate the feasibility of the GP-EAs,the comprehensive performance of the enhanced algorithm(GP-CSO)was evaluated on the CEC2017 benchmark suite.Furthermore,GP-CSO is applied to deduce suitable embedding factors,thereby improving the robustness of the digital watermarking process.The experimental results indicate that the update formulas generated through training with GP-EAs possess excellent performance scalability and practical application proficiency.
基金Supported by the National Natural Science Foundation of China(61603242)Opening Project of Collaborative Innovation Center for Economics Crime Investigation and Prevention Technology(JXJZXTCX-030)+1 种基金the Scientific Research Fund of Zhaoqing Univeristy(201734)Innovative Guidance Fund of Zhaoqing City(201704030409)
文摘One way to improve practicability of automatic program repair（APR） techniques is to build prediction models which can predict whether an application of a APR technique on a bug is effective or not. Existing prediction models have some limitations. First, the prediction models are built with hand crafted features which usually fail to capture the semantic characteristics of program repair task. Second, the performance of the prediction models is only evaluated on Genprog, a genetic-programming based APR technique. This paper develops prediction models, i.e., random forest prediction models for SPR, another kind of generate-and-validate APR technique, which can distinguish ineffective repair instances from effective repair instances. Rather than handcrafted features, we use features automatically learned by deep belief network（DBN） to train the prediction models. The empirical results show that compared to the baseline models, that is, all effective models, our proposed models can at least improve the F1 by 9% and AUC（area under the receiver operating characteristics curve） by 19%. At the same time, the prediction model using learned features at least outperforms the one using hand-crafted features in terms of F1 by 11%.
文摘Creating practice questions for programming learning is not easy.It requires the instructor to diligently organize heterogeneous learning resources,that is,conceptual programming concepts and procedural programming rules.Today’s programming question generation(PQG)is still largely relying on the demanding creation task performed by the instructors without advanced technological support.In this work,we propose a semantic PQG model that aims to help the instructor generate new programming questions and expand the assessment items.The PQG model is designed to transform conceptual and procedural programming knowledge from textbooks into a semantic network by the Local Knowledge Graph(LKG)and Abstract Syntax Tree(AST).For any given question,the model queries the established network to find related code examples and generates a set of questions by the associated LKG/AST semantic structures.We conduct analysis to compare instructor-made questions from 9 undergraduate introductory programming courses and textbook questions.The results show that the instructormade questions had much simpler complexity than the textbook ones.The disparity of topic distribution intrigued us to further research the breadth and depth of question quality and also to investigate the complexity of the questions in relation to the student performances.Finally,we report a user study results on the proposed Artificial Intelligent-infused semantic PQG model in examining the machine-generated questions’quality.
基金This work is supported by the Collaborative education project of QST Innovation Technology Group Co.,Ltd and the Ministry of Education of PRC(NO.201801243022).
文摘UML Class diagram generation from textual requirements is an important task in object-oriented design and programing course.This study proposes a method for automatically generating class diagrams from Chinese textual requirements on the basis of Natural Language Processing(NLP)and mapping rules for sentence pattern matching.First,classes are identified through entity recognition rules and candidate class pruning rules using NLP from requirements.Second,class attributes and relationships between classes are extracted using mapping rules for sentence pattern matching on the basis of NLP.Third,we developed an assistant tool integrated into a precision micro classroom system for automatic generation of class diagram,to effectively assist the teaching of object-oriented design and programing course.Results are evaluated with precision,accuracy and recall from eight requirements of object-oriented design and programing course using truth values created by teachers.Our research should benefit beginners of object-oriented design and programing course,who may be students or software developers.It helps them to create correct domain models represented in the UML class diagram.
基金financially supported by the Biological BreedingNational Science and Technology Major Project(2023ZD0405806)the National Key R&D Program for the 14th Five-Year Plan in China(2022YFD2200304).
文摘The level of genetic variation within a breeding population affects the effectiveness of selection strategies for genetic improvement.The relationship between genetic variation level within Pinus tabuliformis breeding populations and selection strategies or selection effectiveness is not fully investigated.Here,we compared the selection effectiveness of combined and individual direct selection strategies using half-and full-sib families produced from advanced-generation P.tabuliformis seed orchard as our test populations.Our results revealed that,within half-sib families,average diameter at breast height(DBH),tree height,and volume growth of superior individuals selected by the direct selection strategy were higher by 7.72%,18.56%,and 31.01%,respectively,than those selected by the combined selection strategy.Furthermore,significant differences(P<0.01)were observed between the two strategies in terms of the expected genetic gains for average tree height and volume.In contrast,within full-sib families,the differences in tree average DBH,height,and volume between the two selection strategies were relatively minor with increase of 0.17%,2.73%,and 2.21%,respectively,and no significant differences were found in the average expected genetic gains for the studied traits.Half-sib families exhibited greater phenotypic and genetic variation,resulting in improved selection efficiency with the direct selection strategy but also introduced a level of inbreeding risk.Based on genetic distance estimates using molecular markers,our comparative seed orchard design analysis showed that the Improved Adaptive Genetic Programming Algorithm(IAPGA)reduced the average inbreeding coefficient by 14.36% and 14.73% compared to sequential and random designs,respectively.In conclusion,the combination of the direct selection strategy with IAPGA seed orchard design aimed at minimizing inbreeding offered an efficient approach for establishing advanced-generation P.tabuliformis seed orchards.
基金supported by National Hi-tech Research and Development Program of China (863 Program, Grant No. 2007AA04Z2443)State Key Laboratory for Man ufacturing Systems Engineering of Xi’an Jiaotong University of China
文摘Off-line programming （OLP） system becomes one of the most important programming modules for the robotic belt grinding process, however there lacks research on increasing the grinding dexterous space depending on the OLP system. A new type of grinding robot and a novel robotic belt grinding workcell are forwarded, and their features are briefly introduced. An open and object-oriented off-line programming system is developed for this robotic belt grinding system. The parameters of the trimmed surface are read from the initial graphics exchange specification （IGES） file of the CAD model of the workpiece. The deBoor-Cox basis function is used to sample the grinding target with local contact frame on the workpiece. The numerical formula of inverse kinematics is set up based on Newton＇s iterative procedure, to calculate the grinding robot configurations corresponding to the grinding targets. After the grinding path is obtained, the OLP system turns to be more effective than the teach-by-showing system. In order to improve the grinding workspace, an optimization algorithm for dynamic tool frame is proposed and performed on the special robotic belt grinding system. The initial tool frame and the interval of neighboring tool frames are defined as the preparation of the algorithm. An optimized tool local frame can be selected to grind the complex surface for a maximum dexterity index of the robot. Under the optimization algorithm, a simulation of grinding a vane is included and comparison of grinding workspace is done before and after the tool frame optimization. By the algorithm, the grinding workspace can be enlarged. Moreover the dynamic tool frame can be considered to add one degree-of-freedom to the grinding kinematical chain, which provides the theoretical support for the improvement of robotic dexterity for the complex surface grinding.
基金supported in part by the TUM University Foundation Fellowshipin part by the German Federal Ministry for Economic Affairs and Energy(BMWi)within the Federal Aeronautical Research Program LuFo VI-1through Project“RAUDY”(No.20E1910B)。
文摘Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based trajectories with smooth control histories for dynamic soaring maneuvers exploiting wind gradients.The desired smoothness is achieved by introducing a trigonometric series parameterization for the controls,which are formulated with respect to the normalized time.Specifically,the periodicity of the trigonometric functions is leveraged to facilitate the connection of cycles and streamline the problem formulation.Without relying on a specified wind profile,a freefinal-time quadratic programming-based control strategy is developed for the online correction of the flight trajectory,which requires only the instant wind information.Offline and online numerical studies show the trade-off to achieve the smoothness and demonstrate the effectiveness of the proposed method in a varying wind field.
基金This work is fully supported by the Ministry of Science and Technology,Taiwan,Republic of China,under Grant Nos.MOST 110-2622-E-390-001 and MOST 109-2622-E-390-002-CC3.
文摘This paper introduces a novel transform method to produce the newly generated programs through code transform model called the second generation of Generative Pre-trained Transformer(GPT-2)reasonably,improving the program execution performance significantly.Besides,a theoretical estimation in statistics has given the minimum number of generated programs as required,which guarantees to find the best one within them.The proposed approach can help the voice assistant machine resolve the problem of inefficient execution of application code.In addition to GPT-2,this study develops the variational Simhash algorithm to check the code similarity between sample program and newly generated program,and conceives the piecewise longest common subsequence algorithm to examine the execution’s conformity from the two programs mentioned above.The code similarity check deducts the redundant generated programs,and the output conformity check finds the best-performing generative program.In addition to texts,the proposed approach can also prove the other media,including images,sounds,and movies.As a result,the newly generated program outperforms the sample program significantly because the number of code lines reduces 27.21%,and the program execution time shortens 24.62%.
基金supported by the National Key R&D Plan(2017YFB0903100)State Grid Electric Power Co.,Ltd.science and technology project(2021JBGS-03).
文摘With development of distributed generation(DG),configuration of optimization equipment is crucial for absorbing excess electricity and stabilizing fluctuations.This study proposes a two-layer configuration strategy coordinates active cyber control and the physical energy storage(ES)system.First,an upper economic model is developed.Based on chance-constrained programming,an operation model accounts for inherent uncertainty are then developed.Under constraint of voltage risk level,a lower operation model is developed.Finally,a solution based on differential evolution is provided.An IEEE 33 bus system simulation was used to validate efficacy of model.The effects of risk level,equipment price,and chance-constrained probability were analyzed,providing a foundation for power consumption and expansion of cyber-physical systems.
文摘We present an incremental network programming mechanism which reprograms wireless sensors quickly by transmitting the incremental changes using the Rsync algorithm;we generate the difference of the two program images allowing us to distribute only the key changes. Unlike previous approaches, our design does not assume any prior knowledge of the program code structure and can be applied to any hardware platform. To meet the resource constraints of wireless sensors, we tuned the Rsync algorithm which was originally made for updating binary files among powerful host machines. The sensor node processes the delivery and the decoding of the difference script separately making it easy to extend for multi-hop network programming. We are able to get a speed-up of 9.1 for changing a constant and 2.1 to 2.5 for changing a few lines in the source code.
基金supported by the National Natural Science Foundation of China (61963022,51665025,61873328)。
文摘This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.
文摘Advancements in semiconductor technology are making gate-level test generation more challenging. This is because a large amount of detailed structural information must be processed in the search process of automatic test pattern generation (ATPG). In addition, ATPG needs to deal with new defects caused by process variation when IC is shrinking. To reduce the computation effort of ATPG, test generation could be started earlier at higher abstraction level, which is in line with top-down design methodology that has become more popular nowadays. In this research, we employ Chen’s high-level fault model in the high-level ATPG. Besides shorter ATPG time as shown in many previous works, our study showed that high-level ATPG also contributes to test compaction. This is because most of the high-level faults correlate with the gate-level collapsed faults especially at input/output of the modules in a circuit. The high-level ATPG prototype used in our work is mainly composed by constraint-driven test generation engine and fault simulation engine. Experimental result showed that more reduced/compact test set can be generated from the high-level ATPG.
基金Project supported by the National Basic Research Program of China (Grant Nos. 2010CB934200 and 2011CBA00600)the National Natural Science Foundation of China (Grant Nos. 7360825403, 61176080, and 61176073)the National Science and Technology Major Project of China (Grant No. 2009ZX02023-005)
文摘With the merits of a simple process and a short fabrication period, the capacitor structure provides a convenient way to evaluate memory characteristics of charge trap memory devices. However, the slow minority carrier generation in a capacitor often makes an underestimation of the program/erase speed. In this paper, illumination around a memory capacitor is proposed to enhance the generation of minority carriers so that an accurate measurement of the program/erase speed can be achieved. From the dependence of the inversion capacitance on frequency, a time constant is extracted to quantitatively characterize the formation of the inversion layer. Experimental results show that under a high enough illumination, this time constant is greatly reduced and the measured minority carrier-related program/erase speed is in agreement with the reported value in a transistor structure.
文摘The networking of microgrids has received significant attention in the form of a smart grid.In this paper,a set of smart railway stations,which is assumed as microgrids,is connected together.It has been tried to manage the energy exchanged between the networked microgrids to reduce received energy from the utility grid.Also,the operational costs of stations under various conditions decrease by applying the proposed method.The smart railway stations are studied in the presence of photovoltaic(PV)units,energy storage systems(ESSs),and regenerative braking strategies.Studying regenerative braking is one of the essential contributions.Moreover,the stochastic behaviors of the ESS’s initial state of energy and the uncertainty of PV power generation are taken into account through a scenario-based method.The networked microgrid scheme of railway stations(based on coordinated operation and scheduling)and independent operation of railway stations are studied.The proposed method is applied to realistic case studies,including three stations of Line 3 of Tehran Urban and Suburban Railway Operation Company(TUSROC).The rolling stock is simulated in the MATLAB environment.Thus,the coordinated operation of networked microgrids and independent operation of railway stations are optimized in the GAMS environment utilizing mixed-integer linear programming(MILP).
文摘The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane （IP/CP） method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender＇s decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm.
文摘Energy policy is an essential part of the economy and the society. In some countries, there is a lack of a regulatory framework, which must be clear and practicable to allow new technologies to compete with the conventional way of generation. This is the problem in Argentine, the lack of a regulatory framework that can regulate the insertion of wind energy into the Argentine power system （SADI）. In this paper, a review of typical incentives for the installation of wind farms in the world, and a review of some laws and policies in Argentine are presented. Also financial and economic issues that are related to the installation of wind farms are analyzed, and some recommendations related to the topics are presented in this paper.
