The ocean bottom seismograph(OBS)is a powerful device deployed on the seafloor for acquiring marine seismic data,capable of detecting the multi-scale Earth’s interiors from submarine sediments to the mantle.Due to th...The ocean bottom seismograph(OBS)is a powerful device deployed on the seafloor for acquiring marine seismic data,capable of detecting the multi-scale Earth’s interiors from submarine sediments to the mantle.Due to the frequent use of free-fall deployment,it is challenging to accurately track its precise position.Additionally,the internal crystal oscillator clock of the OBS has limited accuracy,resulting in clock drift for long-term work on the seabed.To improve the reliability of OBS detections,it is crucial to calculate the precise OBS location and time correction.Focusing on accurately determining OBS position and timing,this study developed a positioning method that integrates time correction based on the Markov Chain Monte Carlo(MCMC)algorithm,utilizing travel times of direct water waves triggered by two-dimensional(2-D)shot lines or three-dimensional(3-D)airgun arrays.This newly developed method can simultaneously estimate accurate OBS location and time correction,incorporating bathymetric data into the inversion procedures to improve sampling efficiency and enhance the reliability of the final results.Synthetic tests with appropriate noise levels are performed independently to evaluate the feasibility and reliability of our method,indicating that it is robust enough to determine OBS location and time correction precisely.Finally,we use travel-time data recorded at three OBSs deployed in the Southwest Indian Ridge to relocate locations and calculate time corrections.The results exhibit high consistency when using 2-D and 3-D shot data,indicating that high-resolution bathymetric data plays a fingerprint role in inversion to evaluate precise OBS location and time correction.展开更多
This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different...This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.展开更多
This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing.The diffusion area comprises multiple tool groups.Each of them contains non-identical semiconductor tools.All tools can ...This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing.The diffusion area comprises multiple tool groups.Each of them contains non-identical semiconductor tools.All tools can process multiple wafer lots simultaneously,and wafer lots processed together in a tool are called a wafer batch.Besides,each wafer lot has specific queue time limits(QTLs)between consecutive processing operations,making the scheduling problem more complicated.To solve it,a discrete backtracking search optimization algorithm(DBSA)is designed for optimizing both wafer lot assignments and wafer batch processing sequences.Once the processing sequence of wafer batches at each tool is determined,a linear program(LP)is built to obtain optimal starting and completion time points of wafer batches while satisfying QTLs.If a schedule is examined to have no feasible solution by the LP,a proposed approach is used to regroup wafer lots to form wafer batches and adjust their processing sequences to potentially make it feasible.Extensive experiments show that DBSA reliably produces feasible schedules and outperforms GA,MixPSO,and GWO,with up to 17.75%,19.19%,and 9.21%reductions in average cycle time,respectively,demonstrating its superiority in both solution quality and practical applicability.展开更多
This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal ...This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal allocation and sizing of multiple PV-DG units to minimize power losses using a probabilistic PV model and time-series power flow analysis. Addressing the uncertainties in PV output due to weather variability and diurnal cycles is critical. A probabilistic assessment offers a more robust analysis of DG integration’s impact on the grid, potentially leading to more reliable system planning. The presented approach employs a genetic algorithm (GA) and a determined PV output profile and probabilistic PV generation profile based on experimental measurements for one year of solar radiation in Cairo, Egypt. The proposed algorithms are validated using a co-simulation framework that integrates MATLAB and OpenDSS, enabling analysis on a 33-bus test system. This framework can act as a guideline for creating other co-simulation algorithms to enhance computing platforms for contemporary modern distribution systems within smart grids concept. The paper presents comparisons with previous research studies and various interesting findings such as the considered hours for developing the probabilistic model presents different results.展开更多
Time division multiplexing(TDM)architecture is an important approach to creating sensor arrays for massive scale monitoring.But it is paradoxical for the TDM interferometric sensor array to keep a short delay fiber fo...Time division multiplexing(TDM)architecture is an important approach to creating sensor arrays for massive scale monitoring.But it is paradoxical for the TDM interferometric sensor array to keep a short delay fiber for high sensing resolution and meanwhile use low sampling rate for practical applications.In this paper,a phase matching sampling(PMS)paradigm is proposed to address the above contradiction.By matching the phase of the sampling clock with the delay fiber length,combining with multiple-pulses sampling strategy,the proposed PMS method can avoid collecting the redundant information,facilitating the decreasing of sampling rate as well as delay fiber length of the TDM sensing system.The proof-of-concept experiments on an 8-channel TDM interferometric system demonstrate that when the sampling rate is fixed at 20 MS/s,by applying the PMS algorithm,the delay fiber length can be shortened from 100 m to 1 m,compared with applying the conventional sampling method.It reduced the phase noise of the system by a factor of 10 at 1 mHz and by a factor of 50 at 1 Hz.The PMS algorithm for greatly reducing the sampling rate is expected to fuel the TDM interferometric sensor arrays for many applications.展开更多
This paper proposes a stochastic optimization model that considers not only the uncertainties in wave and vessel arrival times but also sedimentation and tidal occurrence.Those factors impact the vessel’s operational...This paper proposes a stochastic optimization model that considers not only the uncertainties in wave and vessel arrival times but also sedimentation and tidal occurrence.Those factors impact the vessel’s operational cost,influencing the seaport’s competitiveness.Therefore,seaport operators need to decide the reference vessel size,dredging maintenance actions,and infrastructure required to ensure the smooth operation of the vessel.The optimization model is solved by invoking a variant of the genetic algorithm(GA).Case studies based on actual seaports in Indonesia are conducted to illustrate the model’s application and results clearly.It was found that the uncertainties of wave and vessel arrival are responsible for deviations in expected operational costs,while increasing infrastructure costs minimizes these deviations and reduces the expected operational costs.展开更多
To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating sched...To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.展开更多
A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Se...A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.展开更多
To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals,a novel kind of anti-aliasing algorithm based on the short time Fourier transform(STFT)is brought forward.First ...To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals,a novel kind of anti-aliasing algorithm based on the short time Fourier transform(STFT)is brought forward.First the physical essence of aliasing that occurs is analyzed;second the interpolation algorithm model is setup based on the Hamming window;then the fast implementation of the algorithm using the Newton iteration method is given.Using the numerical simulation the feasibility of algorithm is validated.Finally,the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.展开更多
This paper proposes a Bat Algorithm (BA) based Control Parameterization and Time Discretization (BA-CPTD) method to acquire time optimal control law for formation reconfiguration of multi-robots system. In this me...This paper proposes a Bat Algorithm (BA) based Control Parameterization and Time Discretization (BA-CPTD) method to acquire time optimal control law for formation reconfiguration of multi-robots system. In this method, the problem of seeking for time optimal control law is converted into a parameter optimization problem by control parameterization and time discretization, so that the control law can be derived with BA. The actual state of a multi-robots system is then introduced as feedback information to eliminate formation error. This method can cope with the situations where the accurate mathematical model of a system is unavailable or the disturbance from the environment exists. Field experiments have verified the effectiveness of the proposed method and shown that formation converges faster than some existing methods. Further experiment results illustrate that the time optimal control law is able to provide smooth control input for robots to follow, so that the desired formation can be attained rapidly with minor formation error. The formation error will finally be eliminated by using actual state as feedback.展开更多
The PPSV(Proportional Pulse in the System Variable)algorithm is a convenient method for the stabilization of the chaotic time series.It does not require any previous knowledge of the system.The PPSV method also has a ...The PPSV(Proportional Pulse in the System Variable)algorithm is a convenient method for the stabilization of the chaotic time series.It does not require any previous knowledge of the system.The PPSV method also has a shortcoming,that is,the determination off.is a procedure by trial and error,since it lacks of optimization.In order to overcome the blindness,GA(Genetic Algorithm),a search algorithm based on the mechanics of natural selection and natural genetics,is used to optimize theλi The new method is named as GAPPSV algorithm.The simulation results show that GAPPSV algorithm is very efficient because the control process is short and the steady-state error is small.展开更多
This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the ...This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.展开更多
For the unforced dynamical non-linear state–space model,a new Q1 and efficient square root extended kernel recursive least square estimation algorithm is developed in this article.The proposed algorithm lends itself ...For the unforced dynamical non-linear state–space model,a new Q1 and efficient square root extended kernel recursive least square estimation algorithm is developed in this article.The proposed algorithm lends itself towards the parallel implementation as in the FPGA systems.With the help of an ortho-normal triangularization method,which relies on numerically stable givens rotation,matrix inversion causes a computational burden,is reduced.Matrix computation possesses many excellent numerical properties such as singularity,symmetry,skew symmetry,and triangularity is achieved by using this algorithm.The proposed method is validated for the prediction of stationary and non-stationary Mackey–Glass Time Series,along with that a component in the x-direction of the Lorenz Times Series is also predicted to illustrate its usefulness.By the learning curves regarding mean square error(MSE)are witnessed for demonstration with prediction performance of the proposed algorithm from where it’s concluded that the proposed algorithm performs better than EKRLS.This new SREKRLS based design positively offers an innovative era towards non-linear systolic arrays,which is efficient in developing very-large-scale integration(VLSI)applications with non-linear input data.Multiple experiments are carried out to validate the reliability,effectiveness,and applicability of the proposed algorithm and with different noise levels compared to the Extended kernel recursive least-squares(EKRLS)algorithm.展开更多
Based on the weighted residual method,a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed,which is superior to the second-order accurate algorithms in trac...Based on the weighted residual method,a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed,which is superior to the second-order accurate algorithms in tracking long-term dynamics.For improving such a higher-order accurate algorithm,this paper proposes a two sub-step higher-order algorithm with unconditional stability and controllable dissipation.In the proposed algorithm,a time step interval[tk,tk+h]where h stands for the size of a time step is divided into two sub-steps[tk,tk+γh]and[tk+γh,tk+h].A non-dissipative fourth-order algorithm is used in the rst sub-step to ensure low-frequency accuracy and a dissipative third-order algorithm is employed in the second sub-step to lter out the contribution of high-frequency modes.Besides,two approaches are used to design the algorithm parameterγ.The rst approach determinesγby maximizing low-frequency accuracy and the other determinesγfor quickly damping out highfrequency modes.The present algorithm usesρ∞to exactly control the degree of numerical dissipation,and it is third-order accurate when 0≤ρ∞<1 and fourth-order accurate whenρ∞=1.Furthermore,the proposed algorithm is self-starting and easy to implement.Some illustrative linear and nonlinear examples are solved to check the performances of the proposed two sub-step higher-order algorithm.展开更多
A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time.Models and relaxations are collected.Most of these problems are NP-hard,i...A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time.Models and relaxations are collected.Most of these problems are NP-hard,in the strong sense,or open problems,therefore approximation algorithms are studied.The review reveals that there exist some potential areas worthy of further research.展开更多
To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is proposed.First,the test case suite which cm maximize the number...To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is proposed.First,the test case suite which cm maximize the number of covered program entities a d satisfy time constraints is selected by integer linea progamming.Secondly,the individual is encoded according to the cover matrices of entities,and the coverage rate of program entities is used as the fitness function and the genetic algorithm is used to prioritize the selected test cases.Five typical open source projects are selected as benchmark programs.Branch and method are selected as program entities,and time constraint percentages a e 25%and 75%.The experimental results show that the ILP-GA convergence has faster speed and better stability than ILP-additional and IP-total in most cases,which contributes to the detection of software defects as early as possible and reduces the software testing costs.展开更多
A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and cl...A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and classification of genetic individuals in the evolutionary procedure,the neural network distributes multiple species into different regions of the search space. Furthermore,the neural network dynamically expands each search region or establishes new region for good offspring individuals to continuously keep the diversification of the genetic population. As a result,the premature problem inherent in genetic algorithm is alleviated and better tradeoff between the ability of exploration and exploitation can be obtained. The experimental results on the vehicle routing problem with time windows also show the good performance of the proposed genetic algorithm.展开更多
In this article, numerical modeling of borehole radar for well logging in time domain is developed using pseudo-spectral time domain algorithm in axisymmetric cylindrical coordinate for proximate true formation model....In this article, numerical modeling of borehole radar for well logging in time domain is developed using pseudo-spectral time domain algorithm in axisymmetric cylindrical coordinate for proximate true formation model. The conductivity and relative permittivity logging curves are obtained from the data of borehole radar for well logging. Since the relative permittivity logging curve is not affected by salinity of formation water, borehole radar for well logging has obvious advantages as compared with conventional electrical logging. The borehole radar for well logging is a one-transmitter and two-receiver logging tool. The conductivity and relative permittivity logging curves are obtained successfully by measuring the amplitude radio and the time difference of pulse waveform from two receivers. The calculated conductivity and relative permittivity logging curves are close to the true value of surrounding formation, which tests the usability and reliability of borehole radar for well logging. The numerical modeling of borehole radar for well logging laid the important foundation for researching its logging tool.展开更多
Tunnel surrounding rock(TSR)deformation exhibits time-and space-dependent behavior,making it challenging for a single prediction model to capture these characteristics over extended periods.Utilizing 8 years of TSR de...Tunnel surrounding rock(TSR)deformation exhibits time-and space-dependent behavior,making it challenging for a single prediction model to capture these characteristics over extended periods.Utilizing 8 years of TSR deformation data from the Beishan exploration tunnel(BET)test platform,the metaheuristic algorithm crested porcupine optimizer(CPO)was applied for the first time to optimize the time series of TSR deformation,and an integrated model incorporating convolutional neural network(CNN),long short-term memory network(LSTM),and attention mechanism(ATT)was proposed.This model integrates the strong feature extraction capabilities of CNN,the superior sequence prediction performance of LSTM,and the effective attention mechanism of ATT.The results show that during blasting excavation,the internal displacement of TSR exhibits a stepwise change pattern.After excavation,the internal displacement enters a phase of gradual increase,ultimately reaching a stable convergence stage.The CPO-CNN-LSTM-ATT(CPO-CLA)integrated model demonstrated excellent predictive accuracy and stability across various evaluation metrics,achieving a determination coefficient(R2)of 0.985.Compared to the CNN-LSTM-ATT(CLA)model,the CPO-CLA model showed a 14.1%increase in R2,a 61.5%decrease in root mean square error(RMSE),and a 72.9%decrease in mean absolute error(MAE).In comparison with current mainstream metaheuristic integrated models,the CPO-CLA model is better suited for predicting long-term TSR deformation.It offers high computational efficiency,accurate predictions,and expertise in optimizing large datasets.展开更多
基金The National Key Research and Development Program of China under contract No.2021YFC3101404the National Natural Science Foundation of China under contract Nos 42106068,42376052,42276064 and 42276075+1 种基金the Foundation of State Key Laboratory of Submarine Geoscience under contract No.sglkfkt2025-2the Zhejiang Provincial Natural Science Foundation of China under contract No.LZ23D060004.
摘要The ocean bottom seismograph(OBS)is a powerful device deployed on the seafloor for acquiring marine seismic data,capable of detecting the multi-scale Earth’s interiors from submarine sediments to the mantle.Due to the frequent use of free-fall deployment,it is challenging to accurately track its precise position.Additionally,the internal crystal oscillator clock of the OBS has limited accuracy,resulting in clock drift for long-term work on the seabed.To improve the reliability of OBS detections,it is crucial to calculate the precise OBS location and time correction.Focusing on accurately determining OBS position and timing,this study developed a positioning method that integrates time correction based on the Markov Chain Monte Carlo(MCMC)algorithm,utilizing travel times of direct water waves triggered by two-dimensional(2-D)shot lines or three-dimensional(3-D)airgun arrays.This newly developed method can simultaneously estimate accurate OBS location and time correction,incorporating bathymetric data into the inversion procedures to improve sampling efficiency and enhance the reliability of the final results.Synthetic tests with appropriate noise levels are performed independently to evaluate the feasibility and reliability of our method,indicating that it is robust enough to determine OBS location and time correction precisely.Finally,we use travel-time data recorded at three OBSs deployed in the Southwest Indian Ridge to relocate locations and calculate time corrections.The results exhibit high consistency when using 2-D and 3-D shot data,indicating that high-resolution bathymetric data plays a fingerprint role in inversion to evaluate precise OBS location and time correction.
基金funded by Universiti Putra Malaysia under a Geran Putra Inisiatif(GPI)research grant with reference to GP-GPI/2023/9762100.
摘要This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.
基金funded by Science and Technology Development Fund(FDCT),Macao SAR(file Nos.0199/2024/AGJ,0120/2024/RIA2).
摘要This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing.The diffusion area comprises multiple tool groups.Each of them contains non-identical semiconductor tools.All tools can process multiple wafer lots simultaneously,and wafer lots processed together in a tool are called a wafer batch.Besides,each wafer lot has specific queue time limits(QTLs)between consecutive processing operations,making the scheduling problem more complicated.To solve it,a discrete backtracking search optimization algorithm(DBSA)is designed for optimizing both wafer lot assignments and wafer batch processing sequences.Once the processing sequence of wafer batches at each tool is determined,a linear program(LP)is built to obtain optimal starting and completion time points of wafer batches while satisfying QTLs.If a schedule is examined to have no feasible solution by the LP,a proposed approach is used to regroup wafer lots to form wafer batches and adjust their processing sequences to potentially make it feasible.Extensive experiments show that DBSA reliably produces feasible schedules and outperforms GA,MixPSO,and GWO,with up to 17.75%,19.19%,and 9.21%reductions in average cycle time,respectively,demonstrating its superiority in both solution quality and practical applicability.
摘要This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal allocation and sizing of multiple PV-DG units to minimize power losses using a probabilistic PV model and time-series power flow analysis. Addressing the uncertainties in PV output due to weather variability and diurnal cycles is critical. A probabilistic assessment offers a more robust analysis of DG integration’s impact on the grid, potentially leading to more reliable system planning. The presented approach employs a genetic algorithm (GA) and a determined PV output profile and probabilistic PV generation profile based on experimental measurements for one year of solar radiation in Cairo, Egypt. The proposed algorithms are validated using a co-simulation framework that integrates MATLAB and OpenDSS, enabling analysis on a 33-bus test system. This framework can act as a guideline for creating other co-simulation algorithms to enhance computing platforms for contemporary modern distribution systems within smart grids concept. The paper presents comparisons with previous research studies and various interesting findings such as the considered hours for developing the probabilistic model presents different results.
基金financial supports from Ministry of Science and Technology of the People’s Republic of China under Grant(No.2022YFC2203904)in part by Open Projects Foundation under Grant of State Key Laboratory of Optical Fiber and Cable Manufacture Technology(YOFC)(No.SKLD2306).
摘要Time division multiplexing(TDM)architecture is an important approach to creating sensor arrays for massive scale monitoring.But it is paradoxical for the TDM interferometric sensor array to keep a short delay fiber for high sensing resolution and meanwhile use low sampling rate for practical applications.In this paper,a phase matching sampling(PMS)paradigm is proposed to address the above contradiction.By matching the phase of the sampling clock with the delay fiber length,combining with multiple-pulses sampling strategy,the proposed PMS method can avoid collecting the redundant information,facilitating the decreasing of sampling rate as well as delay fiber length of the TDM sensing system.The proof-of-concept experiments on an 8-channel TDM interferometric system demonstrate that when the sampling rate is fixed at 20 MS/s,by applying the PMS algorithm,the delay fiber length can be shortened from 100 m to 1 m,compared with applying the conventional sampling method.It reduced the phase noise of the system by a factor of 10 at 1 mHz and by a factor of 50 at 1 Hz.The PMS algorithm for greatly reducing the sampling rate is expected to fuel the TDM interferometric sensor arrays for many applications.
摘要This paper proposes a stochastic optimization model that considers not only the uncertainties in wave and vessel arrival times but also sedimentation and tidal occurrence.Those factors impact the vessel’s operational cost,influencing the seaport’s competitiveness.Therefore,seaport operators need to decide the reference vessel size,dredging maintenance actions,and infrastructure required to ensure the smooth operation of the vessel.The optimization model is solved by invoking a variant of the genetic algorithm(GA).Case studies based on actual seaports in Indonesia are conducted to illustrate the model’s application and results clearly.It was found that the uncertainties of wave and vessel arrival are responsible for deviations in expected operational costs,while increasing infrastructure costs minimizes these deviations and reduces the expected operational costs.
基金Projects(7107111561273035)supported by the National Natural Science Foundation of China
摘要To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.
基金Supported by the National Natural Science Foundation of China (61174040, 61104178)the Fundamental Research Funds for the Central Universities
摘要A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
基金the National Natural Science Foundation of China(9040700760372001).
摘要To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals,a novel kind of anti-aliasing algorithm based on the short time Fourier transform(STFT)is brought forward.First the physical essence of aliasing that occurs is analyzed;second the interpolation algorithm model is setup based on the Hamming window;then the fast implementation of the algorithm using the Newton iteration method is given.Using the numerical simulation the feasibility of algorithm is validated.Finally,the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.
摘要This paper proposes a Bat Algorithm (BA) based Control Parameterization and Time Discretization (BA-CPTD) method to acquire time optimal control law for formation reconfiguration of multi-robots system. In this method, the problem of seeking for time optimal control law is converted into a parameter optimization problem by control parameterization and time discretization, so that the control law can be derived with BA. The actual state of a multi-robots system is then introduced as feedback information to eliminate formation error. This method can cope with the situations where the accurate mathematical model of a system is unavailable or the disturbance from the environment exists. Field experiments have verified the effectiveness of the proposed method and shown that formation converges faster than some existing methods. Further experiment results illustrate that the time optimal control law is able to provide smooth control input for robots to follow, so that the desired formation can be attained rapidly with minor formation error. The formation error will finally be eliminated by using actual state as feedback.
基金This work was financed by the National Natural Sci-ence Foundation of China.
摘要The PPSV(Proportional Pulse in the System Variable)algorithm is a convenient method for the stabilization of the chaotic time series.It does not require any previous knowledge of the system.The PPSV method also has a shortcoming,that is,the determination off.is a procedure by trial and error,since it lacks of optimization.In order to overcome the blindness,GA(Genetic Algorithm),a search algorithm based on the mechanics of natural selection and natural genetics,is used to optimize theλi The new method is named as GAPPSV algorithm.The simulation results show that GAPPSV algorithm is very efficient because the control process is short and the steady-state error is small.
基金supported by the National Natural Science Foundation of China (61963022,51665025,61873328)。
摘要This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.
基金funded by Prince Sultan University,Riyadh,Saudi Arabia。
摘要For the unforced dynamical non-linear state–space model,a new Q1 and efficient square root extended kernel recursive least square estimation algorithm is developed in this article.The proposed algorithm lends itself towards the parallel implementation as in the FPGA systems.With the help of an ortho-normal triangularization method,which relies on numerically stable givens rotation,matrix inversion causes a computational burden,is reduced.Matrix computation possesses many excellent numerical properties such as singularity,symmetry,skew symmetry,and triangularity is achieved by using this algorithm.The proposed method is validated for the prediction of stationary and non-stationary Mackey–Glass Time Series,along with that a component in the x-direction of the Lorenz Times Series is also predicted to illustrate its usefulness.By the learning curves regarding mean square error(MSE)are witnessed for demonstration with prediction performance of the proposed algorithm from where it’s concluded that the proposed algorithm performs better than EKRLS.This new SREKRLS based design positively offers an innovative era towards non-linear systolic arrays,which is efficient in developing very-large-scale integration(VLSI)applications with non-linear input data.Multiple experiments are carried out to validate the reliability,effectiveness,and applicability of the proposed algorithm and with different noise levels compared to the Extended kernel recursive least-squares(EKRLS)algorithm.
基金supported by the National Natural Science Foundation of China(Grant Numbers 11872090,11672019,11472035).
摘要Based on the weighted residual method,a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed,which is superior to the second-order accurate algorithms in tracking long-term dynamics.For improving such a higher-order accurate algorithm,this paper proposes a two sub-step higher-order algorithm with unconditional stability and controllable dissipation.In the proposed algorithm,a time step interval[tk,tk+h]where h stands for the size of a time step is divided into two sub-steps[tk,tk+γh]and[tk+γh,tk+h].A non-dissipative fourth-order algorithm is used in the rst sub-step to ensure low-frequency accuracy and a dissipative third-order algorithm is employed in the second sub-step to lter out the contribution of high-frequency modes.Besides,two approaches are used to design the algorithm parameterγ.The rst approach determinesγby maximizing low-frequency accuracy and the other determinesγfor quickly damping out highfrequency modes.The present algorithm usesρ∞to exactly control the degree of numerical dissipation,and it is third-order accurate when 0≤ρ∞<1 and fourth-order accurate whenρ∞=1.Furthermore,the proposed algorithm is self-starting and easy to implement.Some illustrative linear and nonlinear examples are solved to check the performances of the proposed two sub-step higher-order algorithm.
基金the National Natural Science Foundation of China(70631003)the Hefei University of Technology Foundation(071102F).
摘要A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time.Models and relaxations are collected.Most of these problems are NP-hard,in the strong sense,or open problems,therefore approximation algorithms are studied.The review reveals that there exist some potential areas worthy of further research.
基金The Natural Science Foundation of Education Ministry of Shaanxi Province(No.15JK1672)the Industrial Research Project of Shaanxi Province(No.2017GY-092)Special Fund for Key Discipline Construction of General Institutions of Higher Education in Shaanxi Province
摘要To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is proposed.First,the test case suite which cm maximize the number of covered program entities a d satisfy time constraints is selected by integer linea progamming.Secondly,the individual is encoded according to the cover matrices of entities,and the coverage rate of program entities is used as the fitness function and the genetic algorithm is used to prioritize the selected test cases.Five typical open source projects are selected as benchmark programs.Branch and method are selected as program entities,and time constraint percentages a e 25%and 75%.The experimental results show that the ILP-GA convergence has faster speed and better stability than ILP-additional and IP-total in most cases,which contributes to the detection of software defects as early as possible and reduces the software testing costs.
摘要A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and classification of genetic individuals in the evolutionary procedure,the neural network distributes multiple species into different regions of the search space. Furthermore,the neural network dynamically expands each search region or establishes new region for good offspring individuals to continuously keep the diversification of the genetic population. As a result,the premature problem inherent in genetic algorithm is alleviated and better tradeoff between the ability of exploration and exploitation can be obtained. The experimental results on the vehicle routing problem with time windows also show the good performance of the proposed genetic algorithm.
基金supported by the Open Fund of Key Laboratory of Geo-detection (China University of Geosciences,Beijing),Ministry of Education (No. GDL0805)
摘要In this article, numerical modeling of borehole radar for well logging in time domain is developed using pseudo-spectral time domain algorithm in axisymmetric cylindrical coordinate for proximate true formation model. The conductivity and relative permittivity logging curves are obtained from the data of borehole radar for well logging. Since the relative permittivity logging curve is not affected by salinity of formation water, borehole radar for well logging has obvious advantages as compared with conventional electrical logging. The borehole radar for well logging is a one-transmitter and two-receiver logging tool. The conductivity and relative permittivity logging curves are obtained successfully by measuring the amplitude radio and the time difference of pulse waveform from two receivers. The calculated conductivity and relative permittivity logging curves are close to the true value of surrounding formation, which tests the usability and reliability of borehole radar for well logging. The numerical modeling of borehole radar for well logging laid the important foundation for researching its logging tool.
基金supported by the China Atomic Energy Authority(CAEA)for China’s URL Development Program and the Geological Disposal Program(Grant No.FZ2105)the National Natural Science Foundation of China(Grant No.52278420).
摘要Tunnel surrounding rock(TSR)deformation exhibits time-and space-dependent behavior,making it challenging for a single prediction model to capture these characteristics over extended periods.Utilizing 8 years of TSR deformation data from the Beishan exploration tunnel(BET)test platform,the metaheuristic algorithm crested porcupine optimizer(CPO)was applied for the first time to optimize the time series of TSR deformation,and an integrated model incorporating convolutional neural network(CNN),long short-term memory network(LSTM),and attention mechanism(ATT)was proposed.This model integrates the strong feature extraction capabilities of CNN,the superior sequence prediction performance of LSTM,and the effective attention mechanism of ATT.The results show that during blasting excavation,the internal displacement of TSR exhibits a stepwise change pattern.After excavation,the internal displacement enters a phase of gradual increase,ultimately reaching a stable convergence stage.The CPO-CNN-LSTM-ATT(CPO-CLA)integrated model demonstrated excellent predictive accuracy and stability across various evaluation metrics,achieving a determination coefficient(R2)of 0.985.Compared to the CNN-LSTM-ATT(CLA)model,the CPO-CLA model showed a 14.1%increase in R2,a 61.5%decrease in root mean square error(RMSE),and a 72.9%decrease in mean absolute error(MAE).In comparison with current mainstream metaheuristic integrated models,the CPO-CLA model is better suited for predicting long-term TSR deformation.It offers high computational efficiency,accurate predictions,and expertise in optimizing large datasets.