Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic nois...Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.展开更多
Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a ...Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a celestial body. Some optimal trajectories ofEJS, EMS, EVEJS and EVVEJS flying sequences are obtained using five global optimization algorithms: DE, PSO, DP, the hybrid algorithm PSODE and another hybrid algorithm, DPDE. DE is proved to be supe- rior to other non-hybrid algorithms in the trajectory optimi- zation problem. The hybrid algorithm of PSO and DE can improve the optimization performance of DE, which is vali- dated by the mission to Saturn with given swingby sequences. Finally, the optimization results of four different swingby sequences are compared with those of the ACT of ESA.展开更多
The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximi...The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximizing commonality across the family of products and optimizing the performances of each product in the family. A 2-level chromosome structured genetic algorithm (2LCGA) is proposed to solve this class of problems and its performance is analyzed in comparing its results with those obtained with other methods. By interpreting the chromosome as a 2-level linear structure, the variable commonality genetic algorithm (GA) is constructed to vary the amount of platform commonality and automatically searches across varying levels of commonality for the platform while trying to resolve the tradeoff between commonality and individual product performance within the product family during optimization process. By incorporating a commonality assessing index to the problem formulation, the 2LCGA optimize the product platform and its corresponding family of products in a single stage, which can yield improvements in the overall performance of the product family compared with two-stage approaches (the first stage involves determining the best settings for the platform variables and values of unique variables are found for each product in the second stage). The scope of the algorithm is also expanded by introducing a classification mechanism to allow mul- tiple platforms to be considered during product family optimization, offering opportunities for superior overall design by more efficacious tradeoffs between commonality and performance. The effectiveness of 2LCGA is demonstrated through the design of a family of universal electric motors and comparison against previous results.展开更多
Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorith...Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorithm so as to exploit special features of the hardware and avoid associated architecture shortcomings. This paper presents an investigation into the analysis and design mechanisms that will lead to reduction in the execution time in implementing real-time control algorithms. The proposed mechanisms are exemplified by means of one algorithm, which demonstrates their applicability to real-time applications. An active vibration control (AVC) algorithm for a flexible beam system simulated using the finite difference (FD) method is considered to demonstrate the effectiveness of the proposed methods. A comparative performance evaluation of the proposed design mechanisms is presented and discussed through a set of experiments.展开更多
K-mer can be used for the description of biological sequences and k-mer distribution is a tool for solving sequences analysis problems in bioinformatics.We can use k-mer vector as a representation method of the k-mer ...K-mer can be used for the description of biological sequences and k-mer distribution is a tool for solving sequences analysis problems in bioinformatics.We can use k-mer vector as a representation method of the k-mer distribution of the biological sequence.Problems,such as similarity calculations or sequence assembly,can be described in the k-mer vector space.It helps us to identify new features of an old sequence-based problem in bioinformatics and develop new algorithms using the concepts and methods from linear space theory.In this study,we defined the k-mer vector space for the generalized biological sequences.The meaning of corresponding vector operations is explained in the biological context.We presented the vector/matrix form of several widely seen sequence-based problems,including read quantification,sequence assembly,and pattern detection problem.Its advantages and disadvantages are discussed.Also,we implement a tool for the sequence assembly problem based on the concepts of k-mer vector methods.It shows the practicability and convenience of this algorithm design strategy.展开更多
Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interco...Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.展开更多
The neutron supermirror is an important neutron optical device that can significantly improve the efficiency of neutron transport in neutron guides and has been widely used in research neutron sources.Three types of a...The neutron supermirror is an important neutron optical device that can significantly improve the efficiency of neutron transport in neutron guides and has been widely used in research neutron sources.Three types of algorithms,including approximately ten algorithms,have been developed for designing high-efficiency supermirror structures.In addition to its applications in neutron guides,in recent years,the use of neutron supermirrors in neutronfocusing mirrors has been proposed to advance the development of neutron scattering and neutron imaging instruments,especially those at compact neutron sources.In this new application scenario,the performance of supermirrors strongly affects the instrument performance;therefore,a careful evaluation of the design algorithms is needed.In this study,we examine two issues:the effect of nonuniform film thickness distribution on a curved substrate and the effect of the specific neutron intensity distribution on the performance of neutron supermirrors designed using existing algorithms.The effect of film thickness nonuniformity is found to be relatively insignificant,whereas the effect of the neutron intensity distribution over Q(where Q is the magnitude of the scattering vector of incident neutrons)is considerable.Selection diagrams that show the best design algorithm under different conditions are obtained from these results.When the intensity distribution is not considered,empirical algorithms can obtain the highest average reflectivity,whereas discrete algorithms perform best when the intensity distribution is taken into account.The reasons for the differences in performance between algorithms are also discussed.These findings provide a reference for selecting design algorithms for supermirrors for use in neutron optical devices with unique geometries and can be very helpful for improving the performance of focusing supermirror-based instruments.展开更多
Obtaining the optimal values of the parameters for th e design of a required mould and the operation of the moulding process are diffi cult, this is due to the complexity of product geometry and the variation of pla s...Obtaining the optimal values of the parameters for th e design of a required mould and the operation of the moulding process are diffi cult, this is due to the complexity of product geometry and the variation of pla stic material properties. The typical parameters for the mould design and mouldi ng process are melt flow length, injection pressure, holding pressure, back pres sure, injection speed, melt temperature, mould temperature, clamping force, inje ction time, holding time and cooling time. This paper discusses the difficulties of using the current computer aided optimization methods to acquire the values of the parameters. A method that is based on the concept of genetic algorithm is proposed to overcome the difficulties. The proposed method describes in details on how to attain the optimal values of the parameters form a given product geom etry.展开更多
The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit desi...The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.展开更多
Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optic...Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks(i.e., target detection and tracking). We then propose a new non-dominated sorting genetic algorithm(NSGA) to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.展开更多
A new kind of multiobjective simulated annealing algorithm is proposed,in which the concept of non dominated character is introduced and a new multiobjective acceptance criterion is set up.The optimization example of...A new kind of multiobjective simulated annealing algorithm is proposed,in which the concept of non dominated character is introduced and a new multiobjective acceptance criterion is set up.The optimization example of a typical mathematical problem with two minimum objective functions indicates that all of the solutions contract to the set of the non dominated points,and the variation trend of the optimal solutions is verified to be identical with that obtained using Genetic Algor thms.The new developed algorithm is then applied to the multiobjective optimization design of turbine cascades,in which it is coupled with the aerodynamics computation of the cascade flow fields and performance and the calculated loss coefficient and work potential of the cascade are considered as the objective functions,thus setting up a technique to the engineering optimization design for the cascades.The optimization results,by the view of a group of optimal solutions,show that the algorithm is superior to the traditional technique of multiobjective optimization design and can be applied to more than two objective optimization cascade design problem or other engineering multiobjective optimization designs.展开更多
Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with s...Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.展开更多
In today's world, various approaches and parameters exist for designing a plan and determining its spatial, placement. Hence, various modes for identifying crucial locations can be explored when an architectural p...In today's world, various approaches and parameters exist for designing a plan and determining its spatial, placement. Hence, various modes for identifying crucial locations can be explored when an architectural plan is designed in different dimensions. While designing all these modes takes considerable time, there are numerous potential applications for artificial intelligence (AI) in this domain. This study aims to compute and use an adjacency matrix to generate architectural residential plans. Additionally, it develops a plan generation algorithm in Rhinoceros software, utilizing the Grasshopper plugin to create a dataset of architectural plans. In the following step, the data was entered into a neural network to identify the architectural plan's type, furniture, icons, and use of spaces, which was achieved using YOLOv4, EfficientDet, YOLOv5, DetectoRS, and RetinaNet. The algorithm's execution, testing, and training were conducted using Darknet and PyTorch. The research dataset comprises 12,000 plans, with 70% employed in the training phase and 30% in the testing phase. The network was appropriately trained practically and precisely in relation to an average precision (AP) resulting of 91.50%. After detecting the types of space use, the main research algorithm has been designed and coded, which includes determining the adjacency matrix of architectural plan spaces in seven stages. All research processes were conducted in Python, including dataset preparation, network object detection, and adjacency matrix algorithm design. Finally, the adjacency matrix is given to the input of the proposed plan generator network, which consequently, based on the resulting adjacency, obtains different placement modes for spaces and furniture.展开更多
A design approach is presented in this paper for underactuation in robotic finger mechanisms. The characters of underactuated finger mechanisms are introduced as based on linkage and spring systems. The feature of sel...A design approach is presented in this paper for underactuation in robotic finger mechanisms. The characters of underactuated finger mechanisms are introduced as based on linkage and spring systems. The feature of self-adaptive enveloping grasp by underactuated finger mechanisms is discussed with feasible in grasping unknown objects. The design problem of robotic fingers is analyzed by looking at many aspects for an optimal functionality. Design problems and requirements for underactuated mechanisms are formulated as related to human-like robotic fingers. In particular, characteristics of finger mechanisms are analyzed and optimality criteria are summarized with the aim to formulate a general design algorithm. A general multi-objective optimization design approach is applied as based on a suitable optimization problem by using suitable expressions of optimality criteria. An example is illustrated as an improvement of finger mechanism in Laboratory of Robotics and Mechatronics (LARM) Hand. Results of design outputs and grasp simulations are reported with the aim to show the practical feasibility of the proposed concepts and computations.展开更多
Associated dynamic performance of the clamping force control valve used in continuously variable transmission (CVT) is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dy...Associated dynamic performance of the clamping force control valve used in continuously variable transmission (CVT) is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dynamic model is set up by means of mechanism analysis. For the purpose of checking the validity of the modeling method, a prototype workpiece of the valve is manufactured for comparison test, and its simulation result follows the experimental result quite well. An associated performance index is founded considering the response time, overshoot and saving energy, and five structural parameters are selected to adjust for deriving the optimal associated performance index. The optimization problem is solved by the genetic algorithm (GA) with necessary constraints. Finally, the properties of the optimized valve are compared with those of the prototype workpiece, and the results prove that the dynamic performance indexes of the optimized valve are much better than those of the prototype workpiece.展开更多
Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and...Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search.展开更多
In the first part of this- paper, three generalizations of arrangement graph A.,k of [1], namely Bn,k, Cn,k and Dn,k , are introduced. We prove that all the three classes of graphs are vertex symmetric, two of them ar...In the first part of this- paper, three generalizations of arrangement graph A.,k of [1], namely Bn,k, Cn,k and Dn,k , are introduced. We prove that all the three classes of graphs are vertex symmetric, two of them are edge symmetric. They have great faulty tolerance and high connectivity. We give the diameters of B..k and Cn,k, the Hamiltonian cycle of Cn,k and Hamiltonian path of B.,k. We list several open problems, one of them related to the complexity of sorting algorithm on the arrangement graphs. All these graphs can be thought as generalizations of star graph but are more flexible so that they can be considered as new interconnection network topologies. In the second part of this paper, we provide other four classes of combinatorial graphes, Chn , Cyn, Zhn and Zyn. Many good properties of them, such as high node--connectivity, node symmetry, edge symmetry, diameter, ets., are shown in this paper.展开更多
The purpose of computer-aided design of new adaptive pulsed arc technologies of welding is: to de- sign optimum algorithms of pulsed control over main energy parameters of welding.It permits:to in- crease welding ...The purpose of computer-aided design of new adaptive pulsed arc technologies of welding is: to de- sign optimum algorithms of pulsed control over main energy parameters of welding.It permits:to in- crease welding productivity, to stabilize the welding regime, to control weld formation,taking into ac- count its spatial position, to proveal specie strength of the welded and coatings. Computer- aided design reduces the time of development of new pulsed arc technology:provides the optimization of technological referes according to the operating conditions of welded joints,the prediction of the ser- vice life of the welds.The developed methodology of computer-aided design of advanced technologies, models, original software, adaptive algorithms of pulsed control, and spend equipment permits to regulate penetration,the weld shape, the sizes of heat - affected zone; to predict sired properties and quality of welded joints.展开更多
The bipartite Star<sub>123</sub>-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star<sub>123</su...The bipartite Star<sub>123</sub>-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star<sub>123</sub>-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star<sub>123</sub>, P<sub>7</sub>-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.展开更多
A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special att...A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special attention is paid to algorithm manipulation rather than program calculus. An algorithm is exactly a set of mathematical formulae. It is easier for formal derivation and proof. After getting efficient and correct algorithm, a trivial transformation is used to get a final program. The approach covers several known algorithm design techniques, e.g. dynamic programming, greedy, divide-and-conquer and enumeration, etc. The techniques of partition and recurrence are not new. Partition is a general approach for dealing with complicated objects and is typically used in divide-and-conquer approach. Recurrence is used in algorithm analysis, in developing loop invariants and dynamic programming approach. The main contribution is combining two techniques used in typical algorithm development into a unified and systematic approach to develop general efficient algorithmic programs and presenting a new representation of algorithm that is easier for understanding and demonstrating the correctness and ingenuity of algorithmic programs.展开更多
基金the Ministry of Science and Higher Education of the Russian Federation under Grant No.FSUN-2023-0007.
文摘Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.
基金supported by the National Natural Science Foundation of China (10832004 and 10672084).
文摘Based on the trajectory design of a mission to Saturn, this paper discusses four different trajectories in various swingby cases. We assume a single impulse to be applied in each case when the spacecraft approaches a celestial body. Some optimal trajectories ofEJS, EMS, EVEJS and EVVEJS flying sequences are obtained using five global optimization algorithms: DE, PSO, DP, the hybrid algorithm PSODE and another hybrid algorithm, DPDE. DE is proved to be supe- rior to other non-hybrid algorithms in the trajectory optimi- zation problem. The hybrid algorithm of PSO and DE can improve the optimization performance of DE, which is vali- dated by the mission to Saturn with given swingby sequences. Finally, the optimization results of four different swingby sequences are compared with those of the ACT of ESA.
基金This project is supported by National Natural Science Foundation of China(No.70471022,No.70501021)the Joint Research Scheme of National Natural Science Foundation of China(No,70418013) Hong Kong Research Grant Council,China(No.N_HKUST625/04).
文摘The product family design problem solved by evolutionary algorithms is discussed. A successful product family design method should achieve an optimal tradeoff among a set of competing objectives, which involves maximizing commonality across the family of products and optimizing the performances of each product in the family. A 2-level chromosome structured genetic algorithm (2LCGA) is proposed to solve this class of problems and its performance is analyzed in comparing its results with those obtained with other methods. By interpreting the chromosome as a 2-level linear structure, the variable commonality genetic algorithm (GA) is constructed to vary the amount of platform commonality and automatically searches across varying levels of commonality for the platform while trying to resolve the tradeoff between commonality and individual product performance within the product family during optimization process. By incorporating a commonality assessing index to the problem formulation, the 2LCGA optimize the product platform and its corresponding family of products in a single stage, which can yield improvements in the overall performance of the product family compared with two-stage approaches (the first stage involves determining the best settings for the platform variables and values of unique variables are found for each product in the second stage). The scope of the algorithm is also expanded by introducing a classification mechanism to allow mul- tiple platforms to be considered during product family optimization, offering opportunities for superior overall design by more efficacious tradeoffs between commonality and performance. The effectiveness of 2LCGA is demonstrated through the design of a family of universal electric motors and comparison against previous results.
文摘Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorithm so as to exploit special features of the hardware and avoid associated architecture shortcomings. This paper presents an investigation into the analysis and design mechanisms that will lead to reduction in the execution time in implementing real-time control algorithms. The proposed mechanisms are exemplified by means of one algorithm, which demonstrates their applicability to real-time applications. An active vibration control (AVC) algorithm for a flexible beam system simulated using the finite difference (FD) method is considered to demonstrate the effectiveness of the proposed methods. A comparative performance evaluation of the proposed design mechanisms is presented and discussed through a set of experiments.
基金the National Natural Science Foundation of China(11771393,11632015)the Natural Sci-ence Foundation of Zhejiang Province,China(LZ14A010002).
文摘K-mer can be used for the description of biological sequences and k-mer distribution is a tool for solving sequences analysis problems in bioinformatics.We can use k-mer vector as a representation method of the k-mer distribution of the biological sequence.Problems,such as similarity calculations or sequence assembly,can be described in the k-mer vector space.It helps us to identify new features of an old sequence-based problem in bioinformatics and develop new algorithms using the concepts and methods from linear space theory.In this study,we defined the k-mer vector space for the generalized biological sequences.The meaning of corresponding vector operations is explained in the biological context.We presented the vector/matrix form of several widely seen sequence-based problems,including read quantification,sequence assembly,and pattern detection problem.Its advantages and disadvantages are discussed.Also,we implement a tool for the sequence assembly problem based on the concepts of k-mer vector methods.It shows the practicability and convenience of this algorithm design strategy.
文摘Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.
基金supported by the National Natural Science Foundation of China (Nos. 12027810 and 11322548)
文摘The neutron supermirror is an important neutron optical device that can significantly improve the efficiency of neutron transport in neutron guides and has been widely used in research neutron sources.Three types of algorithms,including approximately ten algorithms,have been developed for designing high-efficiency supermirror structures.In addition to its applications in neutron guides,in recent years,the use of neutron supermirrors in neutronfocusing mirrors has been proposed to advance the development of neutron scattering and neutron imaging instruments,especially those at compact neutron sources.In this new application scenario,the performance of supermirrors strongly affects the instrument performance;therefore,a careful evaluation of the design algorithms is needed.In this study,we examine two issues:the effect of nonuniform film thickness distribution on a curved substrate and the effect of the specific neutron intensity distribution on the performance of neutron supermirrors designed using existing algorithms.The effect of film thickness nonuniformity is found to be relatively insignificant,whereas the effect of the neutron intensity distribution over Q(where Q is the magnitude of the scattering vector of incident neutrons)is considerable.Selection diagrams that show the best design algorithm under different conditions are obtained from these results.When the intensity distribution is not considered,empirical algorithms can obtain the highest average reflectivity,whereas discrete algorithms perform best when the intensity distribution is taken into account.The reasons for the differences in performance between algorithms are also discussed.These findings provide a reference for selecting design algorithms for supermirrors for use in neutron optical devices with unique geometries and can be very helpful for improving the performance of focusing supermirror-based instruments.
文摘Obtaining the optimal values of the parameters for th e design of a required mould and the operation of the moulding process are diffi cult, this is due to the complexity of product geometry and the variation of pla stic material properties. The typical parameters for the mould design and mouldi ng process are melt flow length, injection pressure, holding pressure, back pres sure, injection speed, melt temperature, mould temperature, clamping force, inje ction time, holding time and cooling time. This paper discusses the difficulties of using the current computer aided optimization methods to acquire the values of the parameters. A method that is based on the concept of genetic algorithm is proposed to overcome the difficulties. The proposed method describes in details on how to attain the optimal values of the parameters form a given product geom etry.
文摘The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.
文摘Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks(i.e., target detection and tracking). We then propose a new non-dominated sorting genetic algorithm(NSGA) to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.
文摘A new kind of multiobjective simulated annealing algorithm is proposed,in which the concept of non dominated character is introduced and a new multiobjective acceptance criterion is set up.The optimization example of a typical mathematical problem with two minimum objective functions indicates that all of the solutions contract to the set of the non dominated points,and the variation trend of the optimal solutions is verified to be identical with that obtained using Genetic Algor thms.The new developed algorithm is then applied to the multiobjective optimization design of turbine cascades,in which it is coupled with the aerodynamics computation of the cascade flow fields and performance and the calculated loss coefficient and work potential of the cascade are considered as the objective functions,thus setting up a technique to the engineering optimization design for the cascades.The optimization results,by the view of a group of optimal solutions,show that the algorithm is superior to the traditional technique of multiobjective optimization design and can be applied to more than two objective optimization cascade design problem or other engineering multiobjective optimization designs.
基金This work was supported by the Serbian Ministry of Science and Education(project TR-32022)by companies Telekom Srbija and Informatika.
文摘Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.
文摘In today's world, various approaches and parameters exist for designing a plan and determining its spatial, placement. Hence, various modes for identifying crucial locations can be explored when an architectural plan is designed in different dimensions. While designing all these modes takes considerable time, there are numerous potential applications for artificial intelligence (AI) in this domain. This study aims to compute and use an adjacency matrix to generate architectural residential plans. Additionally, it develops a plan generation algorithm in Rhinoceros software, utilizing the Grasshopper plugin to create a dataset of architectural plans. In the following step, the data was entered into a neural network to identify the architectural plan's type, furniture, icons, and use of spaces, which was achieved using YOLOv4, EfficientDet, YOLOv5, DetectoRS, and RetinaNet. The algorithm's execution, testing, and training were conducted using Darknet and PyTorch. The research dataset comprises 12,000 plans, with 70% employed in the training phase and 30% in the testing phase. The network was appropriately trained practically and precisely in relation to an average precision (AP) resulting of 91.50%. After detecting the types of space use, the main research algorithm has been designed and coded, which includes determining the adjacency matrix of architectural plan spaces in seven stages. All research processes were conducted in Python, including dataset preparation, network object detection, and adjacency matrix algorithm design. Finally, the adjacency matrix is given to the input of the proposed plan generator network, which consequently, based on the resulting adjacency, obtains different placement modes for spaces and furniture.
基金supported by Key International S&T Cooperation Project (Grant No. 2008DFA81280)Part of this work has been developed within the project No.27 of the Italy-China program 2006–2009+1 种基金A joined study of first author at Laboratory of Robotics and Mechatronics (LARM) during 2007–2008 has been supported by state scholarship program of China Scholarship Council (CSC)Innovation Foundation of Beijing University of Aeronautics and Astronautics (BUAA) for PhD Graduates
文摘A design approach is presented in this paper for underactuation in robotic finger mechanisms. The characters of underactuated finger mechanisms are introduced as based on linkage and spring systems. The feature of self-adaptive enveloping grasp by underactuated finger mechanisms is discussed with feasible in grasping unknown objects. The design problem of robotic fingers is analyzed by looking at many aspects for an optimal functionality. Design problems and requirements for underactuated mechanisms are formulated as related to human-like robotic fingers. In particular, characteristics of finger mechanisms are analyzed and optimality criteria are summarized with the aim to formulate a general design algorithm. A general multi-objective optimization design approach is applied as based on a suitable optimization problem by using suitable expressions of optimality criteria. An example is illustrated as an improvement of finger mechanism in Laboratory of Robotics and Mechatronics (LARM) Hand. Results of design outputs and grasp simulations are reported with the aim to show the practical feasibility of the proposed concepts and computations.
基金Key Science-Technology Foundation of Hunan Province, China (No. 05GK2007).
文摘Associated dynamic performance of the clamping force control valve used in continuously variable transmission (CVT) is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dynamic model is set up by means of mechanism analysis. For the purpose of checking the validity of the modeling method, a prototype workpiece of the valve is manufactured for comparison test, and its simulation result follows the experimental result quite well. An associated performance index is founded considering the response time, overshoot and saving energy, and five structural parameters are selected to adjust for deriving the optimal associated performance index. The optimization problem is solved by the genetic algorithm (GA) with necessary constraints. Finally, the properties of the optimized valve are compared with those of the prototype workpiece, and the results prove that the dynamic performance indexes of the optimized valve are much better than those of the prototype workpiece.
文摘Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search.
文摘In the first part of this- paper, three generalizations of arrangement graph A.,k of [1], namely Bn,k, Cn,k and Dn,k , are introduced. We prove that all the three classes of graphs are vertex symmetric, two of them are edge symmetric. They have great faulty tolerance and high connectivity. We give the diameters of B..k and Cn,k, the Hamiltonian cycle of Cn,k and Hamiltonian path of B.,k. We list several open problems, one of them related to the complexity of sorting algorithm on the arrangement graphs. All these graphs can be thought as generalizations of star graph but are more flexible so that they can be considered as new interconnection network topologies. In the second part of this paper, we provide other four classes of combinatorial graphes, Chn , Cyn, Zhn and Zyn. Many good properties of them, such as high node--connectivity, node symmetry, edge symmetry, diameter, ets., are shown in this paper.
文摘The purpose of computer-aided design of new adaptive pulsed arc technologies of welding is: to de- sign optimum algorithms of pulsed control over main energy parameters of welding.It permits:to in- crease welding productivity, to stabilize the welding regime, to control weld formation,taking into ac- count its spatial position, to proveal specie strength of the welded and coatings. Computer- aided design reduces the time of development of new pulsed arc technology:provides the optimization of technological referes according to the operating conditions of welded joints,the prediction of the ser- vice life of the welds.The developed methodology of computer-aided design of advanced technologies, models, original software, adaptive algorithms of pulsed control, and spend equipment permits to regulate penetration,the weld shape, the sizes of heat - affected zone; to predict sired properties and quality of welded joints.
文摘The bipartite Star<sub>123</sub>-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star<sub>123</sub>-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star<sub>123</sub>, P<sub>7</sub>-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.
基金the 863 Hi-Tech Programmethe National Natural ScienceFoundation of China
文摘A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special attention is paid to algorithm manipulation rather than program calculus. An algorithm is exactly a set of mathematical formulae. It is easier for formal derivation and proof. After getting efficient and correct algorithm, a trivial transformation is used to get a final program. The approach covers several known algorithm design techniques, e.g. dynamic programming, greedy, divide-and-conquer and enumeration, etc. The techniques of partition and recurrence are not new. Partition is a general approach for dealing with complicated objects and is typically used in divide-and-conquer approach. Recurrence is used in algorithm analysis, in developing loop invariants and dynamic programming approach. The main contribution is combining two techniques used in typical algorithm development into a unified and systematic approach to develop general efficient algorithmic programs and presenting a new representation of algorithm that is easier for understanding and demonstrating the correctness and ingenuity of algorithmic programs.