Presently the research based on the accurate seismic imaging methods for surface relief, complex structure, and complicated velocity distributions is of great significance. Reverse-time migration is considered to be o...Presently the research based on the accurate seismic imaging methods for surface relief, complex structure, and complicated velocity distributions is of great significance. Reverse-time migration is considered to be one of highly accurate methods. In this paper, we propose a new non-reflecting recursive algorithm for reverse-time migration by introducing the wave impedance function into the acoustic wave equation and the algorithm for the surface relief case is derived from the coordinate transformation principle. Using the exploding reflector principle and the zero-time imaging condition of poststack reverse- time migration, poststack numerical simulation and reverse-time migration with complex conditions can be realized. The results of synthetic and real data calculations show that the method effectively suppresses unwanted internal reflections and also deals with the seismic imaging problems resulting from surface relief. So, we prove that this method has strong adaptability and practicality.展开更多
The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategi...The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by rea- sonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimiza- tion problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm （MPEA） framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is pro- posed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution （CC） algorithm combined with non-dominated sorting genetic algorithm II （NSGA-II） is intro- duced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multi- objective genetic algorithm （MOGA）, multi-objective evolutionary algorithm based on decom- position （MOEA/D）, CC-based multi-objective algorithm （CCMA） as well as other two MPEAs with different migration interval strategies.展开更多
Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome...Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation.展开更多
This paper introduces a newmetaheuristic algorithmcalledMigration Algorithm(MA),which is helpful in solving optimization problems.The fundamental inspiration of MA is the process of human migration,which aims to impro...This paper introduces a newmetaheuristic algorithmcalledMigration Algorithm(MA),which is helpful in solving optimization problems.The fundamental inspiration of MA is the process of human migration,which aims to improve job,educational,economic,and living conditions,and so on.Themathematicalmodeling of the proposed MAis presented in two phases to empower the proposed approach in exploration and exploitation during the search process.In the exploration phase,the algorithm population is updated based on the simulation of choosing the migration destination among the available options.In the exploitation phase,the algorithm population is updated based on the efforts of individuals in the migration destination to adapt to the new environment and improve their conditions.MA’s performance is evaluated on fifty-two standard benchmark functions consisting of unimodal and multimodal types and the CEC 2017 test suite.In addition,MA’s results are compared with the performance of twelve well-known metaheuristic algorithms.The optimization results show the proposed MA approach’s high ability to balance exploration and exploitation to achieve suitable solutions for optimization problems.The analysis and comparison of the simulation results show that MA has provided superior performance against competitor algorithms in most benchmark functions.Also,the implementation of MA on four engineering design problems indicates the effective capability of the proposed approach in handling optimization tasks in real-world applications.展开更多
In this paper,we employ genetic algorithms to solve the migration problem(MP).We propose a new encoding scheme to represent trees,which is composed of two parts:the pre-ordered traversal sequence of tree vertices and ...In this paper,we employ genetic algorithms to solve the migration problem(MP).We propose a new encoding scheme to represent trees,which is composed of two parts:the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices.The proposed encoding scheme has the advantages of simplicity for encoding and decoding,ease for GA operations,and better equilibrium between exploration and exploitation.It is also adaptive in that,with few restrictions on the length of code,it can be freely lengthened or shortened according to the characteristics of the problem space.Furthermore,the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node.The simulation results demonstrate the higher performance of our algorithm,with fast convergence to the optima or sub-optima on various problem sizes.Comparing with the binary string encoding of vertices,when the problem size is large,our algorithm runs remarkably faster with comparable search capability.展开更多
Genetic algorithm (GA) is one of the alternative approaches for solving the shortest path routing problem. In previous work, we have developed a coarse-grained parallel GA-based shortest path routing algorithm. With p...Genetic algorithm (GA) is one of the alternative approaches for solving the shortest path routing problem. In previous work, we have developed a coarse-grained parallel GA-based shortest path routing algorithm. With parallel GA, there is a GA operator called migration, where a chromosome is taken from one sub-population to replace a chromosome in another sub-population. Which chromosome to be taken and replaced is subjected to the migration strategy used. There are four different migration strategies that can be employed: best replace worst, best replace random, random replace worst, and random replace random. In this paper, we are going to evaluate the effect of different migration strategies on the parallel GA-based routing algorithm that has been developed in the previous work. Theoretically, the migration strategy best replace worst should perform better than the other strategies. However, result from simulation shows that even though the migration strategy best replace worst performs better most of the time, there are situations when one of the other strategies can perform just as well, or sometimes better.展开更多
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.展开更多
Meta-heuristic evolutionary algorithms have become widely used for solving complex optimization problems.However,their effectiveness in real-world applications is often limited by the need for many evaluations,which c...Meta-heuristic evolutionary algorithms have become widely used for solving complex optimization problems.However,their effectiveness in real-world applications is often limited by the need for many evaluations,which can be both costly and time-consuming.This is especially true for large-scale transportation networks,where the size of the problem and the high computational cost can hinder the algorithm’s performance.To address these challenges,recent research has focused on using surrogate-assisted models.These models aim to reduce the number of expensive evaluations and improve the efficiency of solving time-consuming optimization problems.This paper presents a new two-layer Surrogate-Assisted Fish Migration Optimization(SA-FMO)algorithm designed to tackle high-dimensional and computationally heavy problems.The global surrogate model offers a good approximation of the entire problem space,while the local surrogate model focuses on refining the solution near the current best option,improving local optimization.To test the effectiveness of the SA-FMO algorithm,we first conduct experiments using six benchmark functions in a 50-dimensional space.We then apply the algorithm to optimize urban rail transit routes,focusing on the Train Routing Optimization problem.This aims to improve operational efficiency and vehicle turnover in situations with uneven passenger flow during transit disruptions.The results show that SA-FMO can effectively improve optimization outcomes in complex transportation scenarios.展开更多
The numerical dispersion phenomenon in the finite-difference forward modeling simulations of the wave equation significantly affects the imaging accuracy in acoustic reflection logging.This issue is particularly prono...The numerical dispersion phenomenon in the finite-difference forward modeling simulations of the wave equation significantly affects the imaging accuracy in acoustic reflection logging.This issue is particularly pronounced in the reverse time migration(RTM)method used for shear-wave(S-wave)logging imaging.This not only affects imaging accuracy but also introduces ambiguities in the interpretation of logging results.To address this challenge,this study proposes the use of a least-squares difference coefficient optimization algorithm aiming to suppress the numerical dispersion phenomenon in the RTM of S-wave reflection imaging logging.By optimizing the difference coefficients,the high-precision finite-difference algorithm serves as an effective operator for both forward and backward RTM processes.This approach is instrumental in eliminating migration illusions,which are often caused by numerical dispersion.The effectiveness of this optimized algorithm is demonstrated through numerical results,which indicate that it can achieve more accurate forward imaging results across various conditions,including high-and low-velocity strata,and is effective in both large and small spatial grids.The results of processing real data demonstrate that numerical dispersion optimization effectively reduces migration artifacts and diminishes ambiguities in logging interpretations.This optimization offers crucial technical support to the RTM method,enhancing its capability for accurately modeling and imaging S-wave reflections.展开更多
Co-residency of virtual machines(VMs) of different tenants on the same physical platform would possibly lead to cross-VM side-channel attacks in the cloud. While most of current countermeasures fail for real or immedi...Co-residency of virtual machines(VMs) of different tenants on the same physical platform would possibly lead to cross-VM side-channel attacks in the cloud. While most of current countermeasures fail for real or immediate deployment due to their requirement for modification of virtualization structure, we adopt dynamic migration, an inherent mechanism of the cloud platform, as a general defense against this kind of threats. To this end, we first set up a unified practical information leakage model which shows the factors affecting side channels and describes the way they influence the damage due to side-channel attacks. Since migration is adopted to limit the time duration of co-residency, we envision this defense as an optimization problem by setting up an Integer Linear Programming(ILP) to calculate optimal migration strategy, which is intractable due to high computational complexity. Therefore, we approximate the ILP with a baseline genetic algorithm, which is further improved for its optimality and scalability. Experimental results show that our migration-based defense can not only provide excellent security guarantees and affordable performance cost in both theoretical simulation and practical cloud environment, but also achieve better optimality and scalability than previous countermeasures.展开更多
Research on seismic anisotropy and attenuation plays a significant role in exploration geophysics. To enhance the imaging quality for complicated structures, we develop several effective improvements for anisotropic a...Research on seismic anisotropy and attenuation plays a significant role in exploration geophysics. To enhance the imaging quality for complicated structures, we develop several effective improvements for anisotropic attenuation effects in reverse-time migration (Q-RTM) on surface and vertical seismic profiling (VSP) acquisition geometries. First, to suppress pseudo-shear wave artifact and numerical instability of the commonly used anisotropic pseudo-acoustic wave equations, an optimized pure P-wave dispersion relation is derived and the corresponding pure-mode wave equation is solved by combining the finite-difference and Possion methods. Second, a simplified anisotropic pure-mode visco-acoustic wave equation (PVAWE) based on standard linear solid model is established. Third, a time-dispersion correlation strategy is applied to improve the modeling accuracy. Fourth, we extend a target-oriented scheme to anisotropic attenuated modeling and imaging. Instead of the conventional wavefield modeling and RTM, the proposed approach can extract available wavefield information near the target regions and produce high imaging resolution for target structures. Last, both anisotropic surface and VSP Q-RTMs are executed by combining optimized PVAWE, time-dispersion correlation and target-oriented algorithm. Modeling examples demonstrate the advantages of our schemes. Moreover, our modified Q-compensated imaging workflow can be regarded as a supplement to the classical anisotropic RTM.展开更多
Three dimensional(3-D)imaging algorithms with irregular planar multiple-input-multiple-output(MIMO)arrays are discussed and compared with each other.Based on the same MIMO array,a modified back projection algorithm(MB...Three dimensional(3-D)imaging algorithms with irregular planar multiple-input-multiple-output(MIMO)arrays are discussed and compared with each other.Based on the same MIMO array,a modified back projection algorithm(MBPA)is accordingly proposed and four imaging algorithms are used for comparison,back-projection method(BP),back-projection one in time domain(BP-TD),modified back-projection one and fast Fourier transform(FFT)-based MIMO range migration algorithm(FFT-based MIMO RMA).All of the algorithms have been implemented in practical application scenarios by use of the proposed imaging system.Back to the practical applications,MIMO array-based imaging system with wide-bandwidth properties provides an efficient tool to detect objects hidden behind a wall.An MIMO imaging radar system,composed of a vector network analyzer(VNA),a set of switches,and an array of Vivaldi antennas,have been designed,fabricated,and tested.Then,these algorithms have been applied to measured data collected in different scenarios constituted by five metallic spheres in the absence and in the presence of a wall between the antennas and the targets in simulation and pliers in free space for experimental test.Finally,the focusing properties and time consumption of the above algorithms are compared.展开更多
Parallel versions of prestack KirchhofT 3D integral migration algorithm, which is suitable forseismic data processing, are described in this paper. Firstly, the inherent parallel characteristics of seismicdata process...Parallel versions of prestack KirchhofT 3D integral migration algorithm, which is suitable forseismic data processing, are described in this paper. Firstly, the inherent parallel characteristics of seismicdata processing are analyzed. Then some principles in algorithm partition are discussed. Based on these analyses and the system architecture, communication mechanism, this algorithm is divided into four subtasksallocated to four nodes of 990 STAR-l. Then we describe in detail a module-partitioning method-theI / O processing and communication are separated from the computation process, the processes includingI / O processing and communication are allocated to transputer T805 and the other is allocated to processori860. These two processes are synchronized by shared memory and memory-lock mechanism, but the communication betWeen different nodes is implemented through links of transputer. Load balance among fourprocessor modules is performed dynamically. Finally, we discussed the speed--up of the parallel versions ofprestack KirchhofT 3D integral migration algorithm running on four nodes. Some further researches are also melltioned in this paper.展开更多
Failure is a systemic error that affects overall system performance and may eventually crash across the entire configuration.In Real-Time Systems(RTS),deadline is the key to successful completion of the program.If tas...Failure is a systemic error that affects overall system performance and may eventually crash across the entire configuration.In Real-Time Systems(RTS),deadline is the key to successful completion of the program.If tasks effectively meet the deadline,it means the system is working in pristine order.However,missing the deadline means a systemic fault due to which the system can crash(hard RTS)or degrade inclusive performance(soft RTS).To fine-tune the RTS,tolerance is the critical issue and must be handled with extreme care.This article explains the context of fault tolerance with improvised Joint EDF-RMS algorithm in RTS.The backup method has been derived to prevent the system from being recursively migrating the same task.If any task migrates three times,this migrated task will get shifted to the backup queue.This backup queue assigns the task to a backup processor and is destined for final execution.For performance evaluation purposes,a relative graph between fault and failure rates,failure and total processor utilization along with other averages have been evaluated.Furthermore,these archived results are compared with fault-tolerant Earliest Deadline First(EDF)and Rate Monotonic Scheduling(RMS)algorithms independently in relatively similar conditions.These comparisons show better performance against overloading conditions.展开更多
Genetic Algorithms(GAs)are efficient non-gradient stochastic search methods and Parallel GAs(PGAs)are proposed to overcome the deficiencies of the sequential GAs,such as low speed,aptness to local convergence,etc.Howe...Genetic Algorithms(GAs)are efficient non-gradient stochastic search methods and Parallel GAs(PGAs)are proposed to overcome the deficiencies of the sequential GAs,such as low speed,aptness to local convergence,etc.However,the tremendous increase in the communication costs accompanied with the parallelization stunts the further improvements of PGAs.This letter takes the decrease of the communication costs as the key to this problem and advances a new Migration Scheme based on Schema Theorem(MSST).MSST distills schemata from the populations and then proportionately disseminates them to other populations,which decreases the total communication cost among the populations and arms the multiple-population model with higher speed and better scalability.展开更多
Breast cancer has become the second leading cause of death among women worldwide.In India,a woman is diagnosed with breast cancer every four minutes.There has been no known basis behind it,and detection is extremely c...Breast cancer has become the second leading cause of death among women worldwide.In India,a woman is diagnosed with breast cancer every four minutes.There has been no known basis behind it,and detection is extremely challenging among medical scientists and researchers due to unknown reasons.In India,the ratio of women being identified with breast cancer in urban areas is 22:1.Symptoms for this disease are micro calcification,lumps,and masses in mammogram images.These sources are mostly used for early detection.Digital mammography is used for breast cancer detection.In this study,we introduce a new hybrid wavelet filter for accurate image enhancement.The main objective of enhancement is to produce quality images for detecting cancer sections in images.Image enhancement is the main step where the quality of the input image is improved to detect cancer masses.In this study,we use a combination of two filters,namely,Gabor and Legendre.The edges are detected using the Canny detector to smoothen the images.High-quality enhanced image is obtained through the Gabor-Legendre filter(GLFIL)process.Further image is used by classification algorithm.Animal migration optimization with neural network is implemented for classifying the image.The output is compared to existing filter techniques.Ultimately,the accuracy achieved by the proposed technique is 98%,which is higher than existing algorithms.展开更多
基金supported by the National Natural Science Foundation of China (Grant No. 40974073)the National 863 Program (Grant No.2007AA060504)the National 973 Program (Grant No. 2007CB209605) and CNPC Geophysical Laboratories
文摘Presently the research based on the accurate seismic imaging methods for surface relief, complex structure, and complicated velocity distributions is of great significance. Reverse-time migration is considered to be one of highly accurate methods. In this paper, we propose a new non-reflecting recursive algorithm for reverse-time migration by introducing the wave impedance function into the acoustic wave equation and the algorithm for the surface relief case is derived from the coordinate transformation principle. Using the exploding reflector principle and the zero-time imaging condition of poststack reverse- time migration, poststack numerical simulation and reverse-time migration with complex conditions can be realized. The results of synthetic and real data calculations show that the method effectively suppresses unwanted internal reflections and also deals with the seismic imaging problems resulting from surface relief. So, we prove that this method has strong adaptability and practicality.
基金co-supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (No. 60921001)
文摘The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by rea- sonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimiza- tion problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm （MPEA） framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is pro- posed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution （CC） algorithm combined with non-dominated sorting genetic algorithm II （NSGA-II） is intro- duced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multi- objective genetic algorithm （MOGA）, multi-objective evolutionary algorithm based on decom- position （MOEA/D）, CC-based multi-objective algorithm （CCMA） as well as other two MPEAs with different migration interval strategies.
基金the Open Fund(PLC201104)of State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation (Chengdu University of Technology)the National Natural Science Foundation of China(No.61072073)the Key Project of Education Commission of Sichuan Province(No.10ZA072)
文摘Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation.
基金supported by the Project of Excellence PˇrFUHKNo.2210/2023-2024,University of Hradec Kralove,Czech Republic.
文摘This paper introduces a newmetaheuristic algorithmcalledMigration Algorithm(MA),which is helpful in solving optimization problems.The fundamental inspiration of MA is the process of human migration,which aims to improve job,educational,economic,and living conditions,and so on.Themathematicalmodeling of the proposed MAis presented in two phases to empower the proposed approach in exploration and exploitation during the search process.In the exploration phase,the algorithm population is updated based on the simulation of choosing the migration destination among the available options.In the exploitation phase,the algorithm population is updated based on the efforts of individuals in the migration destination to adapt to the new environment and improve their conditions.MA’s performance is evaluated on fifty-two standard benchmark functions consisting of unimodal and multimodal types and the CEC 2017 test suite.In addition,MA’s results are compared with the performance of twelve well-known metaheuristic algorithms.The optimization results show the proposed MA approach’s high ability to balance exploration and exploitation to achieve suitable solutions for optimization problems.The analysis and comparison of the simulation results show that MA has provided superior performance against competitor algorithms in most benchmark functions.Also,the implementation of MA on four engineering design problems indicates the effective capability of the proposed approach in handling optimization tasks in real-world applications.
基金Supported by the National Natural Science Foundation of China(90104005)the Natural science Foundation of Hubei Province and the Hong Kong Poly-technic University under the grant G-YD63
文摘In this paper,we employ genetic algorithms to solve the migration problem(MP).We propose a new encoding scheme to represent trees,which is composed of two parts:the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices.The proposed encoding scheme has the advantages of simplicity for encoding and decoding,ease for GA operations,and better equilibrium between exploration and exploitation.It is also adaptive in that,with few restrictions on the length of code,it can be freely lengthened or shortened according to the characteristics of the problem space.Furthermore,the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node.The simulation results demonstrate the higher performance of our algorithm,with fast convergence to the optima or sub-optima on various problem sizes.Comparing with the binary string encoding of vertices,when the problem size is large,our algorithm runs remarkably faster with comparable search capability.
文摘Genetic algorithm (GA) is one of the alternative approaches for solving the shortest path routing problem. In previous work, we have developed a coarse-grained parallel GA-based shortest path routing algorithm. With parallel GA, there is a GA operator called migration, where a chromosome is taken from one sub-population to replace a chromosome in another sub-population. Which chromosome to be taken and replaced is subjected to the migration strategy used. There are four different migration strategies that can be employed: best replace worst, best replace random, random replace worst, and random replace random. In this paper, we are going to evaluate the effect of different migration strategies on the parallel GA-based routing algorithm that has been developed in the previous work. Theoretically, the migration strategy best replace worst should perform better than the other strategies. However, result from simulation shows that even though the migration strategy best replace worst performs better most of the time, there are situations when one of the other strategies can perform just as well, or sometimes better.
文摘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.
基金supported by the National Natural Science Foundation of China(Project No.52172321,52102391)Sichuan Province Science and Technology Innovation Talent Project(2024JDRC0020)+1 种基金China Shenhua Energy Company Limited Technology Project(GJNY-22-7/2300-K1220053)Key science and technology projects in the transportation industry of the Ministry of Transport(2022-ZD7-132).
文摘Meta-heuristic evolutionary algorithms have become widely used for solving complex optimization problems.However,their effectiveness in real-world applications is often limited by the need for many evaluations,which can be both costly and time-consuming.This is especially true for large-scale transportation networks,where the size of the problem and the high computational cost can hinder the algorithm’s performance.To address these challenges,recent research has focused on using surrogate-assisted models.These models aim to reduce the number of expensive evaluations and improve the efficiency of solving time-consuming optimization problems.This paper presents a new two-layer Surrogate-Assisted Fish Migration Optimization(SA-FMO)algorithm designed to tackle high-dimensional and computationally heavy problems.The global surrogate model offers a good approximation of the entire problem space,while the local surrogate model focuses on refining the solution near the current best option,improving local optimization.To test the effectiveness of the SA-FMO algorithm,we first conduct experiments using six benchmark functions in a 50-dimensional space.We then apply the algorithm to optimize urban rail transit routes,focusing on the Train Routing Optimization problem.This aims to improve operational efficiency and vehicle turnover in situations with uneven passenger flow during transit disruptions.The results show that SA-FMO can effectively improve optimization outcomes in complex transportation scenarios.
基金supported by Scientific Research and Technology Development Project of CNPC(2021DJ4002,2022DJ3908).
文摘The numerical dispersion phenomenon in the finite-difference forward modeling simulations of the wave equation significantly affects the imaging accuracy in acoustic reflection logging.This issue is particularly pronounced in the reverse time migration(RTM)method used for shear-wave(S-wave)logging imaging.This not only affects imaging accuracy but also introduces ambiguities in the interpretation of logging results.To address this challenge,this study proposes the use of a least-squares difference coefficient optimization algorithm aiming to suppress the numerical dispersion phenomenon in the RTM of S-wave reflection imaging logging.By optimizing the difference coefficients,the high-precision finite-difference algorithm serves as an effective operator for both forward and backward RTM processes.This approach is instrumental in eliminating migration illusions,which are often caused by numerical dispersion.The effectiveness of this optimized algorithm is demonstrated through numerical results,which indicate that it can achieve more accurate forward imaging results across various conditions,including high-and low-velocity strata,and is effective in both large and small spatial grids.The results of processing real data demonstrate that numerical dispersion optimization effectively reduces migration artifacts and diminishes ambiguities in logging interpretations.This optimization offers crucial technical support to the RTM method,enhancing its capability for accurately modeling and imaging S-wave reflections.
基金supported by the National Key Research and Development Program of China (2018YFB0804004)the Foundation of the National Natural Science Foundation of China (61602509)+1 种基金the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (61521003)the Key Technologies Research and Development Program of Henan Province of China (172102210615)
文摘Co-residency of virtual machines(VMs) of different tenants on the same physical platform would possibly lead to cross-VM side-channel attacks in the cloud. While most of current countermeasures fail for real or immediate deployment due to their requirement for modification of virtualization structure, we adopt dynamic migration, an inherent mechanism of the cloud platform, as a general defense against this kind of threats. To this end, we first set up a unified practical information leakage model which shows the factors affecting side channels and describes the way they influence the damage due to side-channel attacks. Since migration is adopted to limit the time duration of co-residency, we envision this defense as an optimization problem by setting up an Integer Linear Programming(ILP) to calculate optimal migration strategy, which is intractable due to high computational complexity. Therefore, we approximate the ILP with a baseline genetic algorithm, which is further improved for its optimality and scalability. Experimental results show that our migration-based defense can not only provide excellent security guarantees and affordable performance cost in both theoretical simulation and practical cloud environment, but also achieve better optimality and scalability than previous countermeasures.
基金supported by the National Key R&D Program of China(2021YFA0716902)National Natural Science Foundation of China(42004119,42174156)+1 种基金the Fundamental Research Funds for the Central Universities,CHD(300102261306)the National Engineering Research Center of Offshore Oil and Gas Exploration,No.6 Courtyard,Taiyanggong South Street,Chaoyang District,Beijing,100028.
文摘Research on seismic anisotropy and attenuation plays a significant role in exploration geophysics. To enhance the imaging quality for complicated structures, we develop several effective improvements for anisotropic attenuation effects in reverse-time migration (Q-RTM) on surface and vertical seismic profiling (VSP) acquisition geometries. First, to suppress pseudo-shear wave artifact and numerical instability of the commonly used anisotropic pseudo-acoustic wave equations, an optimized pure P-wave dispersion relation is derived and the corresponding pure-mode wave equation is solved by combining the finite-difference and Possion methods. Second, a simplified anisotropic pure-mode visco-acoustic wave equation (PVAWE) based on standard linear solid model is established. Third, a time-dispersion correlation strategy is applied to improve the modeling accuracy. Fourth, we extend a target-oriented scheme to anisotropic attenuated modeling and imaging. Instead of the conventional wavefield modeling and RTM, the proposed approach can extract available wavefield information near the target regions and produce high imaging resolution for target structures. Last, both anisotropic surface and VSP Q-RTMs are executed by combining optimized PVAWE, time-dispersion correlation and target-oriented algorithm. Modeling examples demonstrate the advantages of our schemes. Moreover, our modified Q-compensated imaging workflow can be regarded as a supplement to the classical anisotropic RTM.
基金National Natural Science Foundation of China(No.62293493)。
文摘Three dimensional(3-D)imaging algorithms with irregular planar multiple-input-multiple-output(MIMO)arrays are discussed and compared with each other.Based on the same MIMO array,a modified back projection algorithm(MBPA)is accordingly proposed and four imaging algorithms are used for comparison,back-projection method(BP),back-projection one in time domain(BP-TD),modified back-projection one and fast Fourier transform(FFT)-based MIMO range migration algorithm(FFT-based MIMO RMA).All of the algorithms have been implemented in practical application scenarios by use of the proposed imaging system.Back to the practical applications,MIMO array-based imaging system with wide-bandwidth properties provides an efficient tool to detect objects hidden behind a wall.An MIMO imaging radar system,composed of a vector network analyzer(VNA),a set of switches,and an array of Vivaldi antennas,have been designed,fabricated,and tested.Then,these algorithms have been applied to measured data collected in different scenarios constituted by five metallic spheres in the absence and in the presence of a wall between the antennas and the targets in simulation and pliers in free space for experimental test.Finally,the focusing properties and time consumption of the above algorithms are compared.
文摘Parallel versions of prestack KirchhofT 3D integral migration algorithm, which is suitable forseismic data processing, are described in this paper. Firstly, the inherent parallel characteristics of seismicdata processing are analyzed. Then some principles in algorithm partition are discussed. Based on these analyses and the system architecture, communication mechanism, this algorithm is divided into four subtasksallocated to four nodes of 990 STAR-l. Then we describe in detail a module-partitioning method-theI / O processing and communication are separated from the computation process, the processes includingI / O processing and communication are allocated to transputer T805 and the other is allocated to processori860. These two processes are synchronized by shared memory and memory-lock mechanism, but the communication betWeen different nodes is implemented through links of transputer. Load balance among fourprocessor modules is performed dynamically. Finally, we discussed the speed--up of the parallel versions ofprestack KirchhofT 3D integral migration algorithm running on four nodes. Some further researches are also melltioned in this paper.
基金Deepak Dahiya would like to thank Deanship of Scientific Research at Majmaah University for supporting this work under Project No.R-2022-56.
文摘Failure is a systemic error that affects overall system performance and may eventually crash across the entire configuration.In Real-Time Systems(RTS),deadline is the key to successful completion of the program.If tasks effectively meet the deadline,it means the system is working in pristine order.However,missing the deadline means a systemic fault due to which the system can crash(hard RTS)or degrade inclusive performance(soft RTS).To fine-tune the RTS,tolerance is the critical issue and must be handled with extreme care.This article explains the context of fault tolerance with improvised Joint EDF-RMS algorithm in RTS.The backup method has been derived to prevent the system from being recursively migrating the same task.If any task migrates three times,this migrated task will get shifted to the backup queue.This backup queue assigns the task to a backup processor and is destined for final execution.For performance evaluation purposes,a relative graph between fault and failure rates,failure and total processor utilization along with other averages have been evaluated.Furthermore,these archived results are compared with fault-tolerant Earliest Deadline First(EDF)and Rate Monotonic Scheduling(RMS)algorithms independently in relatively similar conditions.These comparisons show better performance against overloading conditions.
基金National Natural Science Foundation of China(No.60073012)National Science Foundation of Jiangsu,China(BK2001004)Visiting Scholar Foundation of Key Lab.in the University
文摘Genetic Algorithms(GAs)are efficient non-gradient stochastic search methods and Parallel GAs(PGAs)are proposed to overcome the deficiencies of the sequential GAs,such as low speed,aptness to local convergence,etc.However,the tremendous increase in the communication costs accompanied with the parallelization stunts the further improvements of PGAs.This letter takes the decrease of the communication costs as the key to this problem and advances a new Migration Scheme based on Schema Theorem(MSST).MSST distills schemata from the populations and then proportionately disseminates them to other populations,which decreases the total communication cost among the populations and arms the multiple-population model with higher speed and better scalability.
文摘Breast cancer has become the second leading cause of death among women worldwide.In India,a woman is diagnosed with breast cancer every four minutes.There has been no known basis behind it,and detection is extremely challenging among medical scientists and researchers due to unknown reasons.In India,the ratio of women being identified with breast cancer in urban areas is 22:1.Symptoms for this disease are micro calcification,lumps,and masses in mammogram images.These sources are mostly used for early detection.Digital mammography is used for breast cancer detection.In this study,we introduce a new hybrid wavelet filter for accurate image enhancement.The main objective of enhancement is to produce quality images for detecting cancer sections in images.Image enhancement is the main step where the quality of the input image is improved to detect cancer masses.In this study,we use a combination of two filters,namely,Gabor and Legendre.The edges are detected using the Canny detector to smoothen the images.High-quality enhanced image is obtained through the Gabor-Legendre filter(GLFIL)process.Further image is used by classification algorithm.Animal migration optimization with neural network is implemented for classifying the image.The output is compared to existing filter techniques.Ultimately,the accuracy achieved by the proposed technique is 98%,which is higher than existing algorithms.
