Dual three-phase Permanent Magnet Synchronous Motor(DTP-PMSM)is a nonlinear,strongly coupled,high-order multivariable system.In today’s application scenarios,it is difficult for traditional PI controllers to meet the...Dual three-phase Permanent Magnet Synchronous Motor(DTP-PMSM)is a nonlinear,strongly coupled,high-order multivariable system.In today’s application scenarios,it is difficult for traditional PI controllers to meet the requirements of fast response,high accuracy and good robustness.In order to improve the performance of DTP-PMSM speed regulation system,a control strategy of PI controller based on genetic algorithm is proposed.Firstly,the basic mathematical model of DTP-PMSM is established,and the PI parameters of DTP-PMSM speed regulation system are optimized by genetic algorithm,and the modeling and simulation experiments of DTP-PMSM control system are carried out by MATLAB/SIMULINK.The simulation results show that,compared with the traditional PI control,the proposed algorithm significantly improves the performance of the control system,and the speed output overshoot of the GA-PI speed control system is smaller.The anti-interference ability is stronger,and the torque and double three-phase current output fluctuations are smaller.展开更多
In the deployment of wireless networks in two-dimensional outdoor campus spaces,aiming at the problem of efficient coverage of the monitoring area by limited number of access points(APs),this paper proposes a deployme...In the deployment of wireless networks in two-dimensional outdoor campus spaces,aiming at the problem of efficient coverage of the monitoring area by limited number of access points(APs),this paper proposes a deployment method of multi-objective optimization with virtual force fusion bat algorithm(VFBA)using the classical four-node regular distribution as an entry point.The introduction of Lévy flight strategy for bat position updating helps to maintain the population diversity,reduce the premature maturity problem caused by population convergence,avoid the over aggregation of individuals in the local optimal region,and enhance the superiority in global search;the virtual force algorithm simulates the attraction and repulsion between individuals,which enables individual bats to precisely locate the optimal solution within the search space.At the same time,the fusion effect of virtual force prompts the bat individuals to move faster to the potential optimal solution.To validate the effectiveness of the fusion algorithm,the benchmark test function is selected for simulation testing.Finally,the simulation result verifies that the VFBA achieves superior coverage and effectively reduces node redundancy compared to the other three regular layout methods.The VFBA also shows better coverage results when compared to other optimization algorithms.展开更多
In predictive direct power control(PDPC)system of three-phase pulse width modulation(PWM)rectifier,grid voltage sensor makes the whole system more complex and costly.Therefore,third-order generalized integrator(TOGI)i...In predictive direct power control(PDPC)system of three-phase pulse width modulation(PWM)rectifier,grid voltage sensor makes the whole system more complex and costly.Therefore,third-order generalized integrator(TOGI)is used to generate orthogonal signals with the same frequency to estimate the grid voltage.In addition,in view of the deviation between actual and reference power in the three-phase PWM rectifier traditional PDPC strategy,a power correction link is designed to correct the power reference value.The grid voltage sensor free algorithm based on TOGI and the corrected PDPC strategy are applied to three-phase PWM rectifier and simulated on the simulation platform.Simulation results show that the proposed method can effectively eliminate the power tracking deviation and the grid voltage.The effectiveness of the proposed method is verified by comparing the simulation results.展开更多
Compared to fixed virtual window algorithm(FVWA),the dynamic virtual window algorithm(DVWA)determines the length of each virtual container according to the sizes of goods of each order,which saves space of virtual con...Compared to fixed virtual window algorithm(FVWA),the dynamic virtual window algorithm(DVWA)determines the length of each virtual container according to the sizes of goods of each order,which saves space of virtual containers and improves the picking efficiency.However,the interval of consecutive goods caused by dispensers on conveyor can not be eliminated by DVWA,which limits a further improvement of picking efficiency.In order to solve this problem,a compressible virtual window algorithm(CVWA)is presented.It not only inherits the merit of DVWA but also compresses the length of virtual containers without congestion of order accumulation by advancing the beginning time of order picking and reasonably coordinating the pace of order accumulation.The simulation result proves that the picking efficiency of automated sorting system is greatly improved by CVWA.展开更多
Cloud data centers consume a multitude of power leading to the problem of high energy consumption. In order to solve this problem, an energy-efficient virtual machine(VM) consolidation algorithm named PVDE(prediction-...Cloud data centers consume a multitude of power leading to the problem of high energy consumption. In order to solve this problem, an energy-efficient virtual machine(VM) consolidation algorithm named PVDE(prediction-based VM deployment algorithm for energy efficiency) is presented. The proposed algorithm uses linear weighted method to predict the load of a host and classifies the hosts in the data center, based on the predicted host load, into four classes for the purpose of VMs migration. We also propose four types of VM selection algorithms for the purpose of determining potential VMs to be migrated. We performed extensive performance analysis of the proposed algorithms. Experimental results show that, in contrast to other energy-saving algorithms, the algorithm proposed in this work significantly reduces the energy consumption and maintains low service level agreement(SLA) violations.展开更多
Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Intern...Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.展开更多
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
In the past few years, network RTK positioning technology, especially the VRS technology, has been widely used in some parts of China and in many countries around the world. The principle of the VRS technology is disc...In the past few years, network RTK positioning technology, especially the VRS technology, has been widely used in some parts of China and in many countries around the world. The principle of the VRS technology is discussed with corresponding formula deduction, and detailed descriptions and applications of VRS corrections and virtual observations generation algorithm are given.展开更多
The optical storage microgrid system composed of power electronic converters is a small inertia system.Load switching and power supply intermittent will affect the stability of the direct current(DC)bus voltage.Aiming...The optical storage microgrid system composed of power electronic converters is a small inertia system.Load switching and power supply intermittent will affect the stability of the direct current(DC)bus voltage.Aiming at this problem,a virtual inertia optimal control strategy applied to optical storage microgrid is proposed.Firstly,a small signal model of the system is established to theoretically analyze the influence of virtual inertia and damping coefficient on DC bus voltage and to obtain the constraint range of virtual inertia and damping coefficient;Secondly,aiming at the defect that the Sailfish optimization algorithm is easy to premature maturity,a Sailfish optimization algorithm based on the leak-proof net and the cross-mutation propagation mechanism is proposed;Finally,the virtual inertia and damping coefficient of the system are optimized by the improved Sailfish algorithm to obtain the best control parameters.The simulation results in Matlab/Simulink show that the virtual inertia control optimized by the improved Sailfish algorithm improves the system inertia as well as the dynamic response and robustness of the DC bus voltage.展开更多
The drug development process takes a long time since it requires sorting through a large number of inactive compounds from a large collection of compounds chosen for study and choosing just the most pertinent compound...The drug development process takes a long time since it requires sorting through a large number of inactive compounds from a large collection of compounds chosen for study and choosing just the most pertinent compounds that can bind to a disease protein.The use of virtual screening in pharmaceutical research is growing in popularity.During the early phases of medication research and development,it is crucial.Chemical compound searches are nowmore narrowly targeted.Because the databases containmore andmore ligands,thismethod needs to be quick and exact.Neural network fingerprints were created more effectively than the well-known Extended Connectivity Fingerprint(ECFP).Only the largest sub-graph is taken into consideration to learn the representation,despite the fact that the conventional graph network generates a better-encoded fingerprint.When using the average or maximum pooling layer,it also contains unrelated data.This article suggested the Graph Convolutional Attention Network(GCAN),a graph neural network with an attention mechanism,to address these problems.Additionally,it makes the nodes or sub-graphs that are used to create the molecular fingerprint more significant.The generated fingerprint is used to classify drugs using ensemble learning.As base classifiers,ensemble stacking is applied to Support Vector Machines(SVM),Random Forest,Nave Bayes,Decision Trees,AdaBoost,and Gradient Boosting.When compared to existing models,the proposed GCAN fingerprint with an ensemble model achieves relatively high accuracy,sensitivity,specificity,and area under the curve.Additionally,it is revealed that our ensemble learning with generated molecular fingerprint yields 91%accuracy,outperforming earlier approaches.展开更多
Cloud computing is becoming a key factor in the market day by day. Therefore, many companies are investing or going to invest in this sector for development of large data centers. These data centers not only consume m...Cloud computing is becoming a key factor in the market day by day. Therefore, many companies are investing or going to invest in this sector for development of large data centers. These data centers not only consume more energy but also produce greenhouse gases. Because of large amount of power consumption, data center providers go for different types of power generator to increase the profit margin which indirectly affects the environment. Several studies are carried out to reduce the power consumption of a data center. One of the techniques to reduce power consumption is virtualization. After several studies, it is stated that hardware plays a very important role. As the load increases, the power consumption of the CPU is also increased. Therefore, by extending the study of virtualization to reduce the power consumption, a hardware-based algorithm for virtual machine provisioning in a private cloud can significantly improve the performance by considering hardware as one of the important factors.展开更多
The paper presents a prototype of virtual decoder of the transport stream＇s system target decoder （T-STD）. By connecting the coding model and decoding model, and feeding the overflow of decoding buffer back to cont...The paper presents a prototype of virtual decoder of the transport stream＇s system target decoder （T-STD）. By connecting the coding model and decoding model, and feeding the overflow of decoding buffer back to control coding, we have got a self-adaptive coding model, and propose an algorithm of muhiplexing multiple elementary streams to a transport stream based on the principle of virtual buffer controlling strategy. The transport stream （TS） which uses this method passes the test of software unzipping and set top-box （STB） playing, and all of the analyzing parameters which are detected by code analyzer accord with the standard of MPEG-2. Some problems that playing time becomes longer and mul tiple TS streaming can not be fit for all the players are also analyzed.展开更多
This paper addresses the problem of selecting a route for every pair of communicating nodes in a virtual circuit data network in order to minimize the average delay encountered by messages. The problem was previously ...This paper addresses the problem of selecting a route for every pair of communicating nodes in a virtual circuit data network in order to minimize the average delay encountered by messages. The problem was previously modeled as a network of M/M/1 queues. Agenetic algorithm to solve this problem is presented. Extensive computational results across a variety of networks are reported. These results indicate that the presented solution procedure outperforms the other methods in the literature and is effective for a wide range of traffic loads.展开更多
A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the ex...A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.展开更多
The demand for cloud computing has increased manifold in the recent past.More specifically,on-demand computing has seen a rapid rise as organizations rely mostly on cloud service providers for their day-to-day computi...The demand for cloud computing has increased manifold in the recent past.More specifically,on-demand computing has seen a rapid rise as organizations rely mostly on cloud service providers for their day-to-day computing needs.The cloud service provider fulfills different user requirements using virtualization-where a single physical machine can host multiple VirtualMachines.Each virtualmachine potentially represents a different user environment such as operating system,programming environment,and applications.However,these cloud services use a large amount of electrical energy and produce greenhouse gases.To reduce the electricity cost and greenhouse gases,energy efficient algorithms must be designed.One specific area where energy efficient algorithms are required is virtual machine consolidation.With virtualmachine consolidation,the objective is to utilize the minimumpossible number of hosts to accommodate the required virtual machines,keeping in mind the service level agreement requirements.This research work formulates the virtual machine migration as an online problem and develops optimal offline and online algorithms for the single host virtual machine migration problem under a service level agreement constraint for an over-utilized host.The online algorithm is analyzed using a competitive analysis approach.In addition,an experimental analysis of the proposed algorithm on real-world data is conducted to showcase the improved performance of the proposed algorithm against the benchmark algorithms.Our proposed online algorithm consumed 25%less energy and performed 43%fewer migrations than the benchmark algorithms.展开更多
Cloud computing technology facilitates computing-intensive applications by providing virtualized resources which can be dynamically provisioned. However, user’s requests are varied according to different applications...Cloud computing technology facilitates computing-intensive applications by providing virtualized resources which can be dynamically provisioned. However, user’s requests are varied according to different applications’ computation ability needs. These applications can be presented as meta-job of user’s demand. The total processing time of these jobs may need data transmission time over the Internet as well as the completed time of jobs to execute on the virtual machine must be taken into account. In this paper, we presented V-heuristics scheduling algorithm for allocation of virtualized network and computing resources under user’s constraint which applied into a service-oriented resource broker for jobs scheduling. This scheduling algorithm takes into account both data transmission time and computation time that related to virtualized network and virtual machine. The simulation results are compared with three different types of heuristic algorithms under conventional network or virtual network conditions such as MCT, Min-Min and Max-Min. e evaluate these algorithms within a simulated cloud environment via an abilenenetwork topology which is real physical core network topology. These experimental results show that V-heuristic scheduling algorithm achieved significant performance gain for a variety of applications in terms of load balance, Makespan, average resource utilization and total processing time.展开更多
In this,communication world, the Network Function Virtualization concept is utilized for many businesses, small services to virtualize the network nodefunction and to build a block that may connect the chain, communic...In this,communication world, the Network Function Virtualization concept is utilized for many businesses, small services to virtualize the network nodefunction and to build a block that may connect the chain, communication services.Mainly, Virtualized Network Function Forwarding Graph (VNF-FG) has beenused to define the connection between the VNF and to give the best end-to-endservices. In the existing method, VNF mapping and backup VNF were proposedbut there was no profit and reliability improvement of the backup and mapping ofthe primary VNF. As a consequence, this paper offers a Hybrid Hexagon-CostEfficient algorithm for determining the best VNF among multiple VNF and backing up the best VNF, lowering backup costs while increasing dependability. TheVNF is chosen based on the highest cost-aware important measure (CIM) rate,which is used to assess the relevance of the VNF forwarding graph.To achieveoptimal cost-efficiency, VNF with the maximum CIM is selected. After the selection process, updating is processed by three steps which include one backup VNFfrom one SFC, two backup VNF from one Service Function Chain (SFC),and twobackup VNF from different SFC. Finally, this proposed method is compared withCERA, MinCost, MaxRbyInr based on backup cost, number of used PN nodes,SFC request utility, and latency. The simulation result shows that the proposedmethod cuts down the backup cost and computation time by 57% and 45% compared with the CER scheme and improves the cost-efficiency. As a result, this proposed system achieves less backup cost, high reliability, and low timeconsumption which can improve the Virtualized Network Function operation.展开更多
Background Advancements in computer science and knowledge have made the incorporation of control theory,graphics processing,and mathematical models increasingly important for urban design planning.However,challenges r...Background Advancements in computer science and knowledge have made the incorporation of control theory,graphics processing,and mathematical models increasingly important for urban design planning.However,challenges remain in aligning virtual reality(VR)environments with real-world spatial and preparation requirements,particularly in indoor urban spaces.Methods This study investigates the application of VR technology to urban design,focusing on the growth and assessment of the redirection of the space-tree sorter algorithm(STSA).It outlines various assessment indicators,organization of the VR-based system architecture,and construction of 3D urban models and databases.This research also examined methods for the interactive adjustment of indoor space layout plans within a VR environment.Results This research study involved developing and demonstrating the creation and simulation of urban indoor spaces and cityscapes in VR and implementing an experimental setup to test layout modifications and system interactivity.The results indicated enhanced alignment between the virtual and physical spatial configurations.The analysis highlights the strengths and limitations of current VR systems for urban design and identifies key areas for optimization and refinement.Conclusion High congruence between virtual simulations and real-world urban spaces is necessary for effective VR-driven urban planning.This study contributes to a clearer understanding of how 3D modeling,interactive layout design,and reproduction technology can be efficiently employed to support urban increase initiatives.展开更多
The uncertain nature of mapping user tasks to Virtual Machines(VMs) causes system failure or execution delay in Cloud Computing.To maximize cloud resource throughput and decrease user response time,load balancing is n...The uncertain nature of mapping user tasks to Virtual Machines(VMs) causes system failure or execution delay in Cloud Computing.To maximize cloud resource throughput and decrease user response time,load balancing is needed.Possible load balancing is needed to overcome user task execution delay and system failure.Most swarm intelligent dynamic load balancing solutions that used hybrid metaheuristic algorithms failed to balance exploitation and exploration.Most load balancing methods were insufficient to handle the growing uncertainty in job distribution to VMs.Thus,the Hybrid Spotted Hyena and Whale Optimization Algorithm-based Dynamic Load Balancing Mechanism(HSHWOA) partitions traffic among numerous VMs or servers to guarantee user chores are completed quickly.This load balancing approach improved performance by considering average network latency,dependability,and throughput.This hybridization of SHOA and WOA aims to improve the trade-off between exploration and exploitation,assign jobs to VMs with more solution diversity,and prevent the solution from reaching a local optimality.Pysim-based experimental verification and testing for the proposed HSHWOA showed a 12.38% improvement in minimized makespan,16.21% increase in mean throughput,and 14.84% increase in network stability compared to baseline load balancing strategies like Fractional Improved Whale Social Optimization Based VM Migration Strategy FIWSOA,HDWOA,and Binary Bird Swap.展开更多
基金supported in part by the Liaoning Provincial Department of Education Key Research Project under JYT2020160by the Liaoning Provincial Department of Education General Project under LJKZ0224。
文摘Dual three-phase Permanent Magnet Synchronous Motor(DTP-PMSM)is a nonlinear,strongly coupled,high-order multivariable system.In today’s application scenarios,it is difficult for traditional PI controllers to meet the requirements of fast response,high accuracy and good robustness.In order to improve the performance of DTP-PMSM speed regulation system,a control strategy of PI controller based on genetic algorithm is proposed.Firstly,the basic mathematical model of DTP-PMSM is established,and the PI parameters of DTP-PMSM speed regulation system are optimized by genetic algorithm,and the modeling and simulation experiments of DTP-PMSM control system are carried out by MATLAB/SIMULINK.The simulation results show that,compared with the traditional PI control,the proposed algorithm significantly improves the performance of the control system,and the speed output overshoot of the GA-PI speed control system is smaller.The anti-interference ability is stronger,and the torque and double three-phase current output fluctuations are smaller.
基金supported in part by the National Natural Science Foundation of China under Grant No.62271453in part by the National Natural Science Foundation of China No.62101512+2 种基金in part by the Central Support for Local Projects under Grant No.YDZJSX2024D031in part by Project supported by the Shanxi Provincial Foundation for Leaders of Disciplines in Science,China under Grant No.2024Q022in part by Shanxi Province Patent Conversion Special Plan Funding Projects under Grant No.202405004。
文摘In the deployment of wireless networks in two-dimensional outdoor campus spaces,aiming at the problem of efficient coverage of the monitoring area by limited number of access points(APs),this paper proposes a deployment method of multi-objective optimization with virtual force fusion bat algorithm(VFBA)using the classical four-node regular distribution as an entry point.The introduction of Lévy flight strategy for bat position updating helps to maintain the population diversity,reduce the premature maturity problem caused by population convergence,avoid the over aggregation of individuals in the local optimal region,and enhance the superiority in global search;the virtual force algorithm simulates the attraction and repulsion between individuals,which enables individual bats to precisely locate the optimal solution within the search space.At the same time,the fusion effect of virtual force prompts the bat individuals to move faster to the potential optimal solution.To validate the effectiveness of the fusion algorithm,the benchmark test function is selected for simulation testing.Finally,the simulation result verifies that the VFBA achieves superior coverage and effectively reduces node redundancy compared to the other three regular layout methods.The VFBA also shows better coverage results when compared to other optimization algorithms.
基金National Natural Science Foundation of China(Nos.51767013,52067013)。
文摘In predictive direct power control(PDPC)system of three-phase pulse width modulation(PWM)rectifier,grid voltage sensor makes the whole system more complex and costly.Therefore,third-order generalized integrator(TOGI)is used to generate orthogonal signals with the same frequency to estimate the grid voltage.In addition,in view of the deviation between actual and reference power in the three-phase PWM rectifier traditional PDPC strategy,a power correction link is designed to correct the power reference value.The grid voltage sensor free algorithm based on TOGI and the corrected PDPC strategy are applied to three-phase PWM rectifier and simulated on the simulation platform.Simulation results show that the proposed method can effectively eliminate the power tracking deviation and the grid voltage.The effectiveness of the proposed method is verified by comparing the simulation results.
基金National Natural Science Foundation of China(No.50175064)
文摘Compared to fixed virtual window algorithm(FVWA),the dynamic virtual window algorithm(DVWA)determines the length of each virtual container according to the sizes of goods of each order,which saves space of virtual containers and improves the picking efficiency.However,the interval of consecutive goods caused by dispensers on conveyor can not be eliminated by DVWA,which limits a further improvement of picking efficiency.In order to solve this problem,a compressible virtual window algorithm(CVWA)is presented.It not only inherits the merit of DVWA but also compresses the length of virtual containers without congestion of order accumulation by advancing the beginning time of order picking and reasonably coordinating the pace of order accumulation.The simulation result proves that the picking efficiency of automated sorting system is greatly improved by CVWA.
基金Projects(61572525,61272148)supported by the National Natural Science Foundation of ChinaProject(20120162110061)supported by the PhD Programs Foundation of Ministry of Education of China+1 种基金Project(CX2014B066)supported by the Hunan Provincial Innovation Foundation for Postgraduate,ChinaProject(2014zzts044)supported by the Fundamental Research Funds for the Central Universities,China
文摘Cloud data centers consume a multitude of power leading to the problem of high energy consumption. In order to solve this problem, an energy-efficient virtual machine(VM) consolidation algorithm named PVDE(prediction-based VM deployment algorithm for energy efficiency) is presented. The proposed algorithm uses linear weighted method to predict the load of a host and classifies the hosts in the data center, based on the predicted host load, into four classes for the purpose of VMs migration. We also propose four types of VM selection algorithms for the purpose of determining potential VMs to be migrated. We performed extensive performance analysis of the proposed algorithms. Experimental results show that, in contrast to other energy-saving algorithms, the algorithm proposed in this work significantly reduces the energy consumption and maintains low service level agreement(SLA) violations.
基金supported by the National Key Research and Development of China under Grant 2018YFC1314903the National Natural Science Foundation of China under Grant 61372124 and Grant 61427801
文摘Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
基金Funded by the National 973 Program of China (No. 2006CB701301)the Basic Research of Geomatics and Geodesy of the Key Laboratory of Geo-space Environment and Geodesy, Ministry of Education, China (No. 03-04-10)the Project of University Education and Research of Hubei Province(No.20053039).
文摘In the past few years, network RTK positioning technology, especially the VRS technology, has been widely used in some parts of China and in many countries around the world. The principle of the VRS technology is discussed with corresponding formula deduction, and detailed descriptions and applications of VRS corrections and virtual observations generation algorithm are given.
基金the National Natural Science Foundation of China(52177184)。
文摘The optical storage microgrid system composed of power electronic converters is a small inertia system.Load switching and power supply intermittent will affect the stability of the direct current(DC)bus voltage.Aiming at this problem,a virtual inertia optimal control strategy applied to optical storage microgrid is proposed.Firstly,a small signal model of the system is established to theoretically analyze the influence of virtual inertia and damping coefficient on DC bus voltage and to obtain the constraint range of virtual inertia and damping coefficient;Secondly,aiming at the defect that the Sailfish optimization algorithm is easy to premature maturity,a Sailfish optimization algorithm based on the leak-proof net and the cross-mutation propagation mechanism is proposed;Finally,the virtual inertia and damping coefficient of the system are optimized by the improved Sailfish algorithm to obtain the best control parameters.The simulation results in Matlab/Simulink show that the virtual inertia control optimized by the improved Sailfish algorithm improves the system inertia as well as the dynamic response and robustness of the DC bus voltage.
文摘The drug development process takes a long time since it requires sorting through a large number of inactive compounds from a large collection of compounds chosen for study and choosing just the most pertinent compounds that can bind to a disease protein.The use of virtual screening in pharmaceutical research is growing in popularity.During the early phases of medication research and development,it is crucial.Chemical compound searches are nowmore narrowly targeted.Because the databases containmore andmore ligands,thismethod needs to be quick and exact.Neural network fingerprints were created more effectively than the well-known Extended Connectivity Fingerprint(ECFP).Only the largest sub-graph is taken into consideration to learn the representation,despite the fact that the conventional graph network generates a better-encoded fingerprint.When using the average or maximum pooling layer,it also contains unrelated data.This article suggested the Graph Convolutional Attention Network(GCAN),a graph neural network with an attention mechanism,to address these problems.Additionally,it makes the nodes or sub-graphs that are used to create the molecular fingerprint more significant.The generated fingerprint is used to classify drugs using ensemble learning.As base classifiers,ensemble stacking is applied to Support Vector Machines(SVM),Random Forest,Nave Bayes,Decision Trees,AdaBoost,and Gradient Boosting.When compared to existing models,the proposed GCAN fingerprint with an ensemble model achieves relatively high accuracy,sensitivity,specificity,and area under the curve.Additionally,it is revealed that our ensemble learning with generated molecular fingerprint yields 91%accuracy,outperforming earlier approaches.
基金supported by the National Research Foundation (NRF) of Korea through contract N-14-NMIR06
文摘Cloud computing is becoming a key factor in the market day by day. Therefore, many companies are investing or going to invest in this sector for development of large data centers. These data centers not only consume more energy but also produce greenhouse gases. Because of large amount of power consumption, data center providers go for different types of power generator to increase the profit margin which indirectly affects the environment. Several studies are carried out to reduce the power consumption of a data center. One of the techniques to reduce power consumption is virtualization. After several studies, it is stated that hardware plays a very important role. As the load increases, the power consumption of the CPU is also increased. Therefore, by extending the study of virtualization to reduce the power consumption, a hardware-based algorithm for virtual machine provisioning in a private cloud can significantly improve the performance by considering hardware as one of the important factors.
基金Supported by the Electronics Developing FundProject ( MII[2002]13)
文摘The paper presents a prototype of virtual decoder of the transport stream＇s system target decoder （T-STD）. By connecting the coding model and decoding model, and feeding the overflow of decoding buffer back to control coding, we have got a self-adaptive coding model, and propose an algorithm of muhiplexing multiple elementary streams to a transport stream based on the principle of virtual buffer controlling strategy. The transport stream （TS） which uses this method passes the test of software unzipping and set top-box （STB） playing, and all of the analyzing parameters which are detected by code analyzer accord with the standard of MPEG-2. Some problems that playing time becomes longer and mul tiple TS streaming can not be fit for all the players are also analyzed.
文摘This paper addresses the problem of selecting a route for every pair of communicating nodes in a virtual circuit data network in order to minimize the average delay encountered by messages. The problem was previously modeled as a network of M/M/1 queues. Agenetic algorithm to solve this problem is presented. Extensive computational results across a variety of networks are reported. These results indicate that the presented solution procedure outperforms the other methods in the literature and is effective for a wide range of traffic loads.
基金Sponsored by the Funds for Creative Research Groups of China(Grant No. 60821001)National Natural Science Foundation of China(Grant No.60973108 and 60902050)973 Project of China (Grant No.2007CB310703)
文摘A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.
文摘The demand for cloud computing has increased manifold in the recent past.More specifically,on-demand computing has seen a rapid rise as organizations rely mostly on cloud service providers for their day-to-day computing needs.The cloud service provider fulfills different user requirements using virtualization-where a single physical machine can host multiple VirtualMachines.Each virtualmachine potentially represents a different user environment such as operating system,programming environment,and applications.However,these cloud services use a large amount of electrical energy and produce greenhouse gases.To reduce the electricity cost and greenhouse gases,energy efficient algorithms must be designed.One specific area where energy efficient algorithms are required is virtual machine consolidation.With virtualmachine consolidation,the objective is to utilize the minimumpossible number of hosts to accommodate the required virtual machines,keeping in mind the service level agreement requirements.This research work formulates the virtual machine migration as an online problem and develops optimal offline and online algorithms for the single host virtual machine migration problem under a service level agreement constraint for an over-utilized host.The online algorithm is analyzed using a competitive analysis approach.In addition,an experimental analysis of the proposed algorithm on real-world data is conducted to showcase the improved performance of the proposed algorithm against the benchmark algorithms.Our proposed online algorithm consumed 25%less energy and performed 43%fewer migrations than the benchmark algorithms.
文摘Cloud computing technology facilitates computing-intensive applications by providing virtualized resources which can be dynamically provisioned. However, user’s requests are varied according to different applications’ computation ability needs. These applications can be presented as meta-job of user’s demand. The total processing time of these jobs may need data transmission time over the Internet as well as the completed time of jobs to execute on the virtual machine must be taken into account. In this paper, we presented V-heuristics scheduling algorithm for allocation of virtualized network and computing resources under user’s constraint which applied into a service-oriented resource broker for jobs scheduling. This scheduling algorithm takes into account both data transmission time and computation time that related to virtualized network and virtual machine. The simulation results are compared with three different types of heuristic algorithms under conventional network or virtual network conditions such as MCT, Min-Min and Max-Min. e evaluate these algorithms within a simulated cloud environment via an abilenenetwork topology which is real physical core network topology. These experimental results show that V-heuristic scheduling algorithm achieved significant performance gain for a variety of applications in terms of load balance, Makespan, average resource utilization and total processing time.
文摘In this,communication world, the Network Function Virtualization concept is utilized for many businesses, small services to virtualize the network nodefunction and to build a block that may connect the chain, communication services.Mainly, Virtualized Network Function Forwarding Graph (VNF-FG) has beenused to define the connection between the VNF and to give the best end-to-endservices. In the existing method, VNF mapping and backup VNF were proposedbut there was no profit and reliability improvement of the backup and mapping ofthe primary VNF. As a consequence, this paper offers a Hybrid Hexagon-CostEfficient algorithm for determining the best VNF among multiple VNF and backing up the best VNF, lowering backup costs while increasing dependability. TheVNF is chosen based on the highest cost-aware important measure (CIM) rate,which is used to assess the relevance of the VNF forwarding graph.To achieveoptimal cost-efficiency, VNF with the maximum CIM is selected. After the selection process, updating is processed by three steps which include one backup VNFfrom one SFC, two backup VNF from one Service Function Chain (SFC),and twobackup VNF from different SFC. Finally, this proposed method is compared withCERA, MinCost, MaxRbyInr based on backup cost, number of used PN nodes,SFC request utility, and latency. The simulation result shows that the proposedmethod cuts down the backup cost and computation time by 57% and 45% compared with the CER scheme and improves the cost-efficiency. As a result, this proposed system achieves less backup cost, high reliability, and low timeconsumption which can improve the Virtualized Network Function operation.
文摘Background Advancements in computer science and knowledge have made the incorporation of control theory,graphics processing,and mathematical models increasingly important for urban design planning.However,challenges remain in aligning virtual reality(VR)environments with real-world spatial and preparation requirements,particularly in indoor urban spaces.Methods This study investigates the application of VR technology to urban design,focusing on the growth and assessment of the redirection of the space-tree sorter algorithm(STSA).It outlines various assessment indicators,organization of the VR-based system architecture,and construction of 3D urban models and databases.This research also examined methods for the interactive adjustment of indoor space layout plans within a VR environment.Results This research study involved developing and demonstrating the creation and simulation of urban indoor spaces and cityscapes in VR and implementing an experimental setup to test layout modifications and system interactivity.The results indicated enhanced alignment between the virtual and physical spatial configurations.The analysis highlights the strengths and limitations of current VR systems for urban design and identifies key areas for optimization and refinement.Conclusion High congruence between virtual simulations and real-world urban spaces is necessary for effective VR-driven urban planning.This study contributes to a clearer understanding of how 3D modeling,interactive layout design,and reproduction technology can be efficiently employed to support urban increase initiatives.
文摘The uncertain nature of mapping user tasks to Virtual Machines(VMs) causes system failure or execution delay in Cloud Computing.To maximize cloud resource throughput and decrease user response time,load balancing is needed.Possible load balancing is needed to overcome user task execution delay and system failure.Most swarm intelligent dynamic load balancing solutions that used hybrid metaheuristic algorithms failed to balance exploitation and exploration.Most load balancing methods were insufficient to handle the growing uncertainty in job distribution to VMs.Thus,the Hybrid Spotted Hyena and Whale Optimization Algorithm-based Dynamic Load Balancing Mechanism(HSHWOA) partitions traffic among numerous VMs or servers to guarantee user chores are completed quickly.This load balancing approach improved performance by considering average network latency,dependability,and throughput.This hybridization of SHOA and WOA aims to improve the trade-off between exploration and exploitation,assign jobs to VMs with more solution diversity,and prevent the solution from reaching a local optimality.Pysim-based experimental verification and testing for the proposed HSHWOA showed a 12.38% improvement in minimized makespan,16.21% increase in mean throughput,and 14.84% increase in network stability compared to baseline load balancing strategies like Fractional Improved Whale Social Optimization Based VM Migration Strategy FIWSOA,HDWOA,and Binary Bird Swap.
