In Electronic Warfare, and more specifically in the domain of passive localization, accurate time synchronization between platforms is decisive, especially on systems relying on TDOA （time difference of arrival） and...In Electronic Warfare, and more specifically in the domain of passive localization, accurate time synchronization between platforms is decisive, especially on systems relying on TDOA （time difference of arrival） and FDOA （frequency difference of arrival）. This paper investigates this issue by presenting an analysis in terms of final localization performance of an experimental passive localization system based on off-the-shelf components. This system is detailed, as well as the methodology used to carry out the acquisition of real data. This experiment has been realized with two different kinds of clock. The results are analyzed by calculating the Allan deviation and time deviation. The choice of these metrics is explained and their properties are discussed in the scope of an airborne bi-platform passive localization context. Conclusions are drawn regarding the overall localization performance of the system.展开更多
Under the non-Lipschitzian condition, a small time large deviation principle of diffusion processes on Hilbert spaces is established. The operator theory and Gronwall inequality play an important role.
Theoretical research often assumes all users arc homogeneous in their route choice decision and will always pick the route with the shortest travel cost,which is not necessarily the case in reality.This paper document...Theoretical research often assumes all users arc homogeneous in their route choice decision and will always pick the route with the shortest travel cost,which is not necessarily the case in reality.This paper documents the research effort in developing a Constrained Time-Dependent K Shortest Paths Algorithm inorder to find K Shortest Paths between two given locations.The goal of this research is to provide sound route options to travelers in order to assist their route choice decision process,during which the overlap and travel time deviation issues between the K paths will be considered.The proposed algorithm balancing overlap and travel time deviation is developed in this research.A numerical analysis is conducted on the Tucson 1-10 network,the outcome of the case study shows that our proposed algorithm is able to find different shortest paths with a reasonable degree of similarity and close travel time,which indicates that the result of the proposed algorithm is satisfactory.展开更多
Due to the fourth revolution experiencing,referred to as Industry 4.0,many production firms are devoted to integrating new technological tools to their manufacturing process.One of them,is rescheduling the tasks on th...Due to the fourth revolution experiencing,referred to as Industry 4.0,many production firms are devoted to integrating new technological tools to their manufacturing process.One of them,is rescheduling the tasks on the machines responding to disruptions.While,for static scheduling,the efficiency criteria measure the performance of scheduling systems,in dynamic environments,the stability criteria are also used to assess the impact of jobs deviation.In this paper,a new performance measure is investigated for a flowshop rescheduling problem.This one considers simultaneously the total weighted waiting time as the efficiency criterion,and the total weighted completion time deviation as the stability criterion.This fusion could be a very helpful and significant measure for real life industrial systems.Two disruption types are considered:jobs arrival and jobs cancellation.Thus,a Mixed Integer Linear Programming(MILP)model is developed,as well as an iterative predictive-reactive strategy for dealing with the online part.At last,two heuristic methods are proposed and discussed,in terms of solution quality and computing time.展开更多
In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared ...In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared deviations of the job-expected completion times from the due date.For preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.We discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some conditions.For preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be computed.We replace the ESSD problem by the SSDE problem.We show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.展开更多
文摘In Electronic Warfare, and more specifically in the domain of passive localization, accurate time synchronization between platforms is decisive, especially on systems relying on TDOA （time difference of arrival） and FDOA （frequency difference of arrival）. This paper investigates this issue by presenting an analysis in terms of final localization performance of an experimental passive localization system based on off-the-shelf components. This system is detailed, as well as the methodology used to carry out the acquisition of real data. This experiment has been realized with two different kinds of clock. The results are analyzed by calculating the Allan deviation and time deviation. The choice of these metrics is explained and their properties are discussed in the scope of an airborne bi-platform passive localization context. Conclusions are drawn regarding the overall localization performance of the system.
基金Supported by the National Basic Research Program of China (973 Program,Grant No.2007CB814901)the National Natural Science Foundation of China (Grant No.10826098)+1 种基金the Natural Science Foundation of Anhui Province (Grant No.090416225)Anhui Natural Science Foundation of Universities (Grant No.KJ2010A037)
文摘Under the non-Lipschitzian condition, a small time large deviation principle of diffusion processes on Hilbert spaces is established. The operator theory and Gronwall inequality play an important role.
文摘Theoretical research often assumes all users arc homogeneous in their route choice decision and will always pick the route with the shortest travel cost,which is not necessarily the case in reality.This paper documents the research effort in developing a Constrained Time-Dependent K Shortest Paths Algorithm inorder to find K Shortest Paths between two given locations.The goal of this research is to provide sound route options to travelers in order to assist their route choice decision process,during which the overlap and travel time deviation issues between the K paths will be considered.The proposed algorithm balancing overlap and travel time deviation is developed in this research.A numerical analysis is conducted on the Tucson 1-10 network,the outcome of the case study shows that our proposed algorithm is able to find different shortest paths with a reasonable degree of similarity and close travel time,which indicates that the result of the proposed algorithm is satisfactory.
文摘Due to the fourth revolution experiencing,referred to as Industry 4.0,many production firms are devoted to integrating new technological tools to their manufacturing process.One of them,is rescheduling the tasks on the machines responding to disruptions.While,for static scheduling,the efficiency criteria measure the performance of scheduling systems,in dynamic environments,the stability criteria are also used to assess the impact of jobs deviation.In this paper,a new performance measure is investigated for a flowshop rescheduling problem.This one considers simultaneously the total weighted waiting time as the efficiency criterion,and the total weighted completion time deviation as the stability criterion.This fusion could be a very helpful and significant measure for real life industrial systems.Two disruption types are considered:jobs arrival and jobs cancellation.Thus,a Mixed Integer Linear Programming(MILP)model is developed,as well as an iterative predictive-reactive strategy for dealing with the online part.At last,two heuristic methods are proposed and discussed,in terms of solution quality and computing time.
基金the National Natural Science Foundation of China (Grant No.10471096)
文摘In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared deviations of the job-expected completion times from the due date.For preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.We discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some conditions.For preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be computed.We replace the ESSD problem by the SSDE problem.We show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.
