In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the ...In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it.In this paper,we consider hierarchical optimization between the scheduling cost of all the jobs and the degree of this disruption.For every problem,we provide either a polynomial time algorithm or an intractable result.展开更多
Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certai...Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.展开更多
This paper discussed the current of works on computerisation of all problems related to mining subsidence, including the time factor,carried out in the Division of Mining Geodesy of Technical University of Silesia, Po...This paper discussed the current of works on computerisation of all problems related to mining subsidence, including the time factor,carried out in the Division of Mining Geodesy of Technical University of Silesia, Poland. First, the formulas implemented in the programs were presented. These formulas considerably increase the description accuracy of final deformations by taking into uncaved strip along extraction rib (extraction margin). They also improve the deformation description of areas located far from the extraction place. Then, the research results aiming to improving the description of deformation with time were introduced. Finally, the Windows based version of the program for the creation of mining geological opinions were presented in the form accepted by Mining Offices of Poland.展开更多
A real time algorithm is presented here to recognize and analyze 8 channel simultaneous electro cardiograph(ECG). The algorithm transforms 8 channel simultaneous ECG into three orthogonal vectors and spatial veloc...A real time algorithm is presented here to recognize and analyze 8 channel simultaneous electro cardiograph(ECG). The algorithm transforms 8 channel simultaneous ECG into three orthogonal vectors and spatial velocity first, then forms the spatial velocity sample, and uses this spatial velocity sample to recognize each beat. The algorithm computes the averaged parameters by using averaged spatial velocity and the averaged ECG and the current parameters by using the current beat period and current width of QRS. The algorithm can recognize P, QRS and T onsets and ends of simultaneous 12 lead ECG precisely, and some arrhythmias such as premature ventricular beat, ventricular escape beat, R on T, bigeminy, trigeminy. The algorithm software works well on a real 8 channel ECG system and meets the demands of designing.展开更多
Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in...Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.展开更多
Objective To estimate the relative effect of early vs. late tracheotomy on clinical end-points in unselected intensive care unit （ICU） patients undergoing mechanical ventilation. Methods We searched electronic data...Objective To estimate the relative effect of early vs. late tracheotomy on clinical end-points in unselected intensive care unit （ICU） patients undergoing mechanical ventilation. Methods We searched electronic databases （up to February 27, 2013） for both randomized control trials and observational studies satisfying the predefined inclusion criteria.展开更多
In order to study the evacuation behavior of miners during accidents,we analyzed the rational layout of a safe chamber,and improved evacuation efficiency.A visual model of evacuation was developed and used to simulate...In order to study the evacuation behavior of miners during accidents,we analyzed the rational layout of a safe chamber,and improved evacuation efficiency.A visual model of evacuation was developed and used to simulate the evacuation process of mines,given their special underground environments.In our simulation,the working faces of a coal mine and nearby tunnels were divided into 0.5 m×0.5 m grids to reflect the location of occupants and obstacles.Based on a "flow potential of the occupant",we determined the direction of movement and routes of occupants.In the model,evacuation speed changed as a function of crowd density,with an average speed of 1.30 m/s.The model also takes into account detection time of the disaster and the personnel response time.Evacuation time,exit flow rate and evacuation path were obtained by simulation.The results indicate that using simulation technology can present a more visual evacuation process and show the behavior of occupants.Our establishment of a mine safety evacuation system has merit as reference value.展开更多
This paper considers the parallel machines scheduling problem where jobs are subject to different release times. A constructive heuristic is first proposed to solve the problem in a modest amount of computer time. In ...This paper considers the parallel machines scheduling problem where jobs are subject to different release times. A constructive heuristic is first proposed to solve the problem in a modest amount of computer time. In general, the quality of the solutions provided by heuristics degrades with the increase of the probiem’s scale. Combined the global search ability of genetic algorithm, this paper proposed a hybrid heuristic to improve the quality of solutions further. The computational results show that the hybrid heuristic combines the advantages of heuristic and genetic algorithm effectively and can provide very good solutions to some large problems in a reasonable amount of computer time.展开更多
To avoid unstable learning, a stable adaptive learning algorithm was proposed for discrete-time recurrent neural networks. Unlike the dynamic gradient methods, such as the backpropagation through time and the real tim...To avoid unstable learning, a stable adaptive learning algorithm was proposed for discrete-time recurrent neural networks. Unlike the dynamic gradient methods, such as the backpropagation through time and the real time recurrent learning, the weights of the recurrent neural networks were updated online in terms of Lyapunov stability theory in the proposed learning algorithm, so the learning stability was guaranteed. With the inversion of the activation function of the recurrent neural networks, the proposed learning algorithm can be easily implemented for solving varying nonlinear adaptive learning problems and fast convergence of the adaptive learning process can be achieved. Simulation experiments in pattern recognition show that only 5 iterations are needed for the storage of a 15×15 binary image pattern and only 9 iterations are needed for the perfect realization of an analog vector by an equilibrium state with the proposed learning algorithm.展开更多
A Fault detection and isolation(FDI)scheme for discrete time-delay system is proposed in this paper,which can not only detect but also isolate the faults.A time delay operator is introduced to resolve the problem bro...A Fault detection and isolation(FDI)scheme for discrete time-delay system is proposed in this paper,which can not only detect but also isolate the faults.A time delay operator is introduced to resolve the problem brought by the time-delay system.The design and computation for the FDI system is carried by computer math tool Maple,which can easily deal with the symbolic computation.Residuals in the form of parity space can be deduced from the recursion of the system equations.Further more,a generalized residual set is created using the freedom of the parity space redundancy.Thus,both fault detection and fault isolation have been accomplished.The proposed method has been verified by a numerical example.展开更多
基金Supported by the NSFC(10671183)Supported by the Science Foundation of Henan University of Technology(07XJC002)+1 种基金Supported by the NSF of the Education Department of Henan Province(2008A11004)Supported by the NSF of Henan Province(082300410190)
文摘In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it.In this paper,we consider hierarchical optimization between the scheduling cost of all the jobs and the degree of this disruption.For every problem,we provide either a polynomial time algorithm or an intractable result.
基金supported in part by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386)the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004)+2 种基金the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008)Major State Basic Research Development Program of China(973 Program)(No.2014CB340600)the Hubei Natural Science Foundation of China(Grant Nos.2011CDB453,2014CFB440)
文摘Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.
文摘This paper discussed the current of works on computerisation of all problems related to mining subsidence, including the time factor,carried out in the Division of Mining Geodesy of Technical University of Silesia, Poland. First, the formulas implemented in the programs were presented. These formulas considerably increase the description accuracy of final deformations by taking into uncaved strip along extraction rib (extraction margin). They also improve the deformation description of areas located far from the extraction place. Then, the research results aiming to improving the description of deformation with time were introduced. Finally, the Windows based version of the program for the creation of mining geological opinions were presented in the form accepted by Mining Offices of Poland.
文摘A real time algorithm is presented here to recognize and analyze 8 channel simultaneous electro cardiograph(ECG). The algorithm transforms 8 channel simultaneous ECG into three orthogonal vectors and spatial velocity first, then forms the spatial velocity sample, and uses this spatial velocity sample to recognize each beat. The algorithm computes the averaged parameters by using averaged spatial velocity and the averaged ECG and the current parameters by using the current beat period and current width of QRS. The algorithm can recognize P, QRS and T onsets and ends of simultaneous 12 lead ECG precisely, and some arrhythmias such as premature ventricular beat, ventricular escape beat, R on T, bigeminy, trigeminy. The algorithm software works well on a real 8 channel ECG system and meets the demands of designing.
基金Project supported by the National Natural Science Foundation of China (Nos. 10271110 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE+2 种基金 China Project supported by the National Natural Science Foundation of China (Nos. 10271110 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE China
文摘Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.
文摘Objective To estimate the relative effect of early vs. late tracheotomy on clinical end-points in unselected intensive care unit （ICU） patients undergoing mechanical ventilation. Methods We searched electronic databases （up to February 27, 2013） for both randomized control trials and observational studies satisfying the predefined inclusion criteria.
文摘In order to study the evacuation behavior of miners during accidents,we analyzed the rational layout of a safe chamber,and improved evacuation efficiency.A visual model of evacuation was developed and used to simulate the evacuation process of mines,given their special underground environments.In our simulation,the working faces of a coal mine and nearby tunnels were divided into 0.5 m×0.5 m grids to reflect the location of occupants and obstacles.Based on a "flow potential of the occupant",we determined the direction of movement and routes of occupants.In the model,evacuation speed changed as a function of crowd density,with an average speed of 1.30 m/s.The model also takes into account detection time of the disaster and the personnel response time.Evacuation time,exit flow rate and evacuation path were obtained by simulation.The results indicate that using simulation technology can present a more visual evacuation process and show the behavior of occupants.Our establishment of a mine safety evacuation system has merit as reference value.
文摘This paper considers the parallel machines scheduling problem where jobs are subject to different release times. A constructive heuristic is first proposed to solve the problem in a modest amount of computer time. In general, the quality of the solutions provided by heuristics degrades with the increase of the probiem’s scale. Combined the global search ability of genetic algorithm, this paper proposed a hybrid heuristic to improve the quality of solutions further. The computational results show that the hybrid heuristic combines the advantages of heuristic and genetic algorithm effectively and can provide very good solutions to some large problems in a reasonable amount of computer time.
基金Project(50276005) supported by the National Natural Science Foundation of China Projects (2006CB705400, 2003CB716206) supported by National Basic Research Program of China
文摘To avoid unstable learning, a stable adaptive learning algorithm was proposed for discrete-time recurrent neural networks. Unlike the dynamic gradient methods, such as the backpropagation through time and the real time recurrent learning, the weights of the recurrent neural networks were updated online in terms of Lyapunov stability theory in the proposed learning algorithm, so the learning stability was guaranteed. With the inversion of the activation function of the recurrent neural networks, the proposed learning algorithm can be easily implemented for solving varying nonlinear adaptive learning problems and fast convergence of the adaptive learning process can be achieved. Simulation experiments in pattern recognition show that only 5 iterations are needed for the storage of a 15×15 binary image pattern and only 9 iterations are needed for the perfect realization of an analog vector by an equilibrium state with the proposed learning algorithm.
基金National Natural Science Foundation of China(No.60574081)
文摘A Fault detection and isolation(FDI)scheme for discrete time-delay system is proposed in this paper,which can not only detect but also isolate the faults.A time delay operator is introduced to resolve the problem brought by the time-delay system.The design and computation for the FDI system is carried by computer math tool Maple,which can easily deal with the symbolic computation.Residuals in the form of parity space can be deduced from the recursion of the system equations.Further more,a generalized residual set is created using the freedom of the parity space redundancy.Thus,both fault detection and fault isolation have been accomplished.The proposed method has been verified by a numerical example.
