In this paper, the first boundary problem of quasilinear parabolic system of second order is studied by the finite difference method with intrinsic parallelism. for the problem, the stability of the difference schemes...In this paper, the first boundary problem of quasilinear parabolic system of second order is studied by the finite difference method with intrinsic parallelism. for the problem, the stability of the difference schemes with intrinsic parallelism are justified in the sense of the continuous dependence of the discrete vector solution of the difference schemes on the discrete data of the original problem, without assuming the existence of the smooth solutions for the origillal problem.展开更多
This paper improves and generalizes the two difference schemes presented in paper [1] and gives a new difference scheme for second order linear elliptic partial differential equations, its difference matrix is a matri...This paper improves and generalizes the two difference schemes presented in paper [1] and gives a new difference scheme for second order linear elliptic partial differential equations, its difference matrix is a matrix and because of the stability of the M-matrix, it is convergent by the asynchronous iterative method on multiprocessors. Then this paper gives a class of differeifce schemes for linear elliptic PDEs so that their difference matrixes are all M-matrixes and their asynchronous parallel computation are convergent.展开更多
The development of new robot structures, in particular of parallel kinematic machines（PKM）, is widely systematized by different structure synthesis methods. Recent research increasingly focuses on PKM with less than...The development of new robot structures, in particular of parallel kinematic machines（PKM）, is widely systematized by different structure synthesis methods. Recent research increasingly focuses on PKM with less than six degrees of freedom（DOF）. However, an overall comparison and evaluation of these structures is missing. In order to compare symmetrical PKM with three translational DOF, different evaluation criteria are used. Workspace, maximum actuation forces and velocities, power, actuator stiffness, accuracy and transmission behavior are taken into account to investigate strengths and weaknesses of the PKMs. A selection scheme based on possible configurations of translational PKM including different frame configurations is presented. Moreover, an optimization method based on a genetic algorithm is described to determine the geometric parameters of the selected PKM for an exemplary load case and a prescribed workspace. The values of the mentioned criteria are determined for all considered PKM with respect to certain boundary conditions. The distribution and spreading of these values within the prescribed workspace is presented by using box plots for each criterion. Thereby, the performance characteristics of the different structures can be compared directly. The results show that there is no ＂best＂ PKM. Further inquiries such as dynamic or stiffness analysis are necessary to extend the comparison and to finally select a PKM.展开更多
To efficiently exploit the performance of single instruction multiple data (SIMD) architectures for video coding, a parallel memory architecture with power-of-two memory modules is proposed. It employs two novel skewi...To efficiently exploit the performance of single instruction multiple data (SIMD) architectures for video coding, a parallel memory architecture with power-of-two memory modules is proposed. It employs two novel skewing schemes to provide conflict-free access to adjacent elements (8-bit and 16-bit data types) or with power-of-two intervals in both horizontal and vertical directions, which were not possible in previous parallel memory architectures. Area consumptions and delay estimations are given respectively with 4, 8 and 16 memory modules. Under a 0.18-μm CMOS technology, the synthesis results show that the proposed system can achieve 230 MHz clock frequency with 16 memory modules at the cost of 19k gates when read and write latencies are 3 and 2 clock cycles, respectively. We implement the proposed parallel memory architecture on a video signal processor (VSP). The results show that VSP enhanced with the proposed architecture achieves 1.28×speedups for H.264 real-time decoding.展开更多
In this paper, a parallel machine scheduling problem was considered , where the processing time of a job is a simple linear function of its starting time. The objective is to minimize makespan. A fully polynomial time...In this paper, a parallel machine scheduling problem was considered , where the processing time of a job is a simple linear function of its starting time. The objective is to minimize makespan. A fully polynomial time approximation scheme for the problem of scheduling n deteriorating jobs on two identical machines was worked out. Furthermore, the result was generalized to the case of a fixed number of machines.展开更多
A group of asymmetric difference schemes to approach the Korteweg-de Vries （KdV） equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segme...A group of asymmetric difference schemes to approach the Korteweg-de Vries （KdV） equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segment explicit-implicit difference scheme for solving the KdV equation is constructed. The scheme is linear unconditionally stable by the analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show that the method has high accuracy.展开更多
A novel Parallel-Based Lifting Algorithm (PBLA) for Discrete Wavelet Transform (DWT), exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critica...A novel Parallel-Based Lifting Algorithm (PBLA) for Discrete Wavelet Transform (DWT), exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critical path latency of computation, and to reduce the complexity of hardware implementation as well. The detailed derivation on the proposed algorithm, as well as the resulting Very Large Scale Integration (VLSI) architecture, is introduced, taking the 9/7 DWT as an example but without loss of generality. In comparison with the Conventional Lifting Algorithm Based Implementation (CLABI), the critical path latency of the proposed architecture is reduced by more than half from (4Tm + 87a)to Tm + 4Ta, and is competitive to that of Convolution-Based Implementation (CBI), but the new implementation will save significantly in hardware. The experimental results demonstrate that the proposed architecture has good performance in both increasing working frequency and reducing area.展开更多
The circumferential burden distribution of bell-less top with two parallel hoppers was analyzed to obtain the expressions of burden flux and uneven ratio. The four-batch feeding spirally with two parallel hoppers was ...The circumferential burden distribution of bell-less top with two parallel hoppers was analyzed to obtain the expressions of burden flux and uneven ratio. The four-batch feeding spirally with two parallel hoppers was proposed to realize even burden distribution by uneven flux, ensuring reasonable distribution of BF gas and effective usage of heat energy and chemical energy of gas as well as stable BF production with higher quality and lower consumption.展开更多
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, e...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.展开更多
In this paper, we construct a class of semi-implicit difference method for time fractional diffusion equations—the group explicit (GE) difference scheme, which is a difference scheme with good parallelism constructed...In this paper, we construct a class of semi-implicit difference method for time fractional diffusion equations—the group explicit (GE) difference scheme, which is a difference scheme with good parallelism constructed using Saul’yev asymmetric scheme. The stability and convergence of the GE scheme of time fractional diffusion equation are analyzed by mathematical induction. Then, the theoretical analysis is verified by numerical experiments, which shows that the GE scheme is effective for solving the time fractional diffusion equation.展开更多
Aimed at the real-time forward kinematics solving problem of Stewart parallel manipulator in the control course, a mixed algorithm combining immune evolutionary algorithm and numerical iterative scheme is proposed. Fi...Aimed at the real-time forward kinematics solving problem of Stewart parallel manipulator in the control course, a mixed algorithm combining immune evolutionary algorithm and numerical iterative scheme is proposed. Firstly taking advantage of simpleness of inverse kinematics, the forward kinematics is transformed to an optimal problem. Immune evolutionary algorithm is employed to find approximate solution of this optimal problem in manipulator＇s workspace. Then using above solution as iterative initialization, a speedy numerical iterative scheme is proposed to get more precise solution. In the manipulator running course, the iteration initialization can be selected as the last period position and orientation. Because the initialization is closed to correct solution, solving precision is high and speed is rapid enough to satisfy real-time requirement. This mixed forward kinematics algorithm is applied to real Stewart parallel manipulator in the real-time control course. The examination result shows that the algorithm is very efficient and practical.展开更多
文摘In this paper, the first boundary problem of quasilinear parabolic system of second order is studied by the finite difference method with intrinsic parallelism. for the problem, the stability of the difference schemes with intrinsic parallelism are justified in the sense of the continuous dependence of the discrete vector solution of the difference schemes on the discrete data of the original problem, without assuming the existence of the smooth solutions for the origillal problem.
文摘This paper improves and generalizes the two difference schemes presented in paper [1] and gives a new difference scheme for second order linear elliptic partial differential equations, its difference matrix is a matrix and because of the stability of the M-matrix, it is convergent by the asynchronous iterative method on multiprocessors. Then this paper gives a class of differeifce schemes for linear elliptic PDEs so that their difference matrixes are all M-matrixes and their asynchronous parallel computation are convergent.
文摘The development of new robot structures, in particular of parallel kinematic machines（PKM）, is widely systematized by different structure synthesis methods. Recent research increasingly focuses on PKM with less than six degrees of freedom（DOF）. However, an overall comparison and evaluation of these structures is missing. In order to compare symmetrical PKM with three translational DOF, different evaluation criteria are used. Workspace, maximum actuation forces and velocities, power, actuator stiffness, accuracy and transmission behavior are taken into account to investigate strengths and weaknesses of the PKMs. A selection scheme based on possible configurations of translational PKM including different frame configurations is presented. Moreover, an optimization method based on a genetic algorithm is described to determine the geometric parameters of the selected PKM for an exemplary load case and a prescribed workspace. The values of the mentioned criteria are determined for all considered PKM with respect to certain boundary conditions. The distribution and spreading of these values within the prescribed workspace is presented by using box plots for each criterion. Thereby, the performance characteristics of the different structures can be compared directly. The results show that there is no ＂best＂ PKM. Further inquiries such as dynamic or stiffness analysis are necessary to extend the comparison and to finally select a PKM.
基金Project (No. 2005AA1Z1271) supported by the Hi-Tech Research and Development Program (863) of China
文摘To efficiently exploit the performance of single instruction multiple data (SIMD) architectures for video coding, a parallel memory architecture with power-of-two memory modules is proposed. It employs two novel skewing schemes to provide conflict-free access to adjacent elements (8-bit and 16-bit data types) or with power-of-two intervals in both horizontal and vertical directions, which were not possible in previous parallel memory architectures. Area consumptions and delay estimations are given respectively with 4, 8 and 16 memory modules. Under a 0.18-μm CMOS technology, the synthesis results show that the proposed system can achieve 230 MHz clock frequency with 16 memory modules at the cost of 19k gates when read and write latencies are 3 and 2 clock cycles, respectively. We implement the proposed parallel memory architecture on a video signal processor (VSP). The results show that VSP enhanced with the proposed architecture achieves 1.28×speedups for H.264 real-time decoding.
基金supported by the National Natural Science Foundation of China （Grant No.10101010）
文摘In this paper, a parallel machine scheduling problem was considered , where the processing time of a job is a simple linear function of its starting time. The objective is to minimize makespan. A fully polynomial time approximation scheme for the problem of scheduling n deteriorating jobs on two identical machines was worked out. Furthermore, the result was generalized to the case of a fixed number of machines.
基金Project supported by the National Natural Science Foundation of China(No.10671113)the Natural Science Foundation of Shandong Province of China(No.Y2003A04)
文摘A group of asymmetric difference schemes to approach the Korteweg-de Vries （KdV） equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segment explicit-implicit difference scheme for solving the KdV equation is constructed. The scheme is linear unconditionally stable by the analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show that the method has high accuracy.
基金Supported by the National 863 project (No.2002AA133010).
文摘A novel Parallel-Based Lifting Algorithm (PBLA) for Discrete Wavelet Transform (DWT), exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critical path latency of computation, and to reduce the complexity of hardware implementation as well. The detailed derivation on the proposed algorithm, as well as the resulting Very Large Scale Integration (VLSI) architecture, is introduced, taking the 9/7 DWT as an example but without loss of generality. In comparison with the Conventional Lifting Algorithm Based Implementation (CLABI), the critical path latency of the proposed architecture is reduced by more than half from (4Tm + 87a)to Tm + 4Ta, and is competitive to that of Convolution-Based Implementation (CBI), but the new implementation will save significantly in hardware. The experimental results demonstrate that the proposed architecture has good performance in both increasing working frequency and reducing area.
文摘The circumferential burden distribution of bell-less top with two parallel hoppers was analyzed to obtain the expressions of burden flux and uneven ratio. The four-batch feeding spirally with two parallel hoppers was proposed to realize even burden distribution by uneven flux, ensuring reasonable distribution of BF gas and effective usage of heat energy and chemical energy of gas as well as stable BF production with higher quality and lower consumption.
基金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.
文摘In this paper, we construct a class of semi-implicit difference method for time fractional diffusion equations—the group explicit (GE) difference scheme, which is a difference scheme with good parallelism constructed using Saul’yev asymmetric scheme. The stability and convergence of the GE scheme of time fractional diffusion equation are analyzed by mathematical induction. Then, the theoretical analysis is verified by numerical experiments, which shows that the GE scheme is effective for solving the time fractional diffusion equation.
文摘Aimed at the real-time forward kinematics solving problem of Stewart parallel manipulator in the control course, a mixed algorithm combining immune evolutionary algorithm and numerical iterative scheme is proposed. Firstly taking advantage of simpleness of inverse kinematics, the forward kinematics is transformed to an optimal problem. Immune evolutionary algorithm is employed to find approximate solution of this optimal problem in manipulator＇s workspace. Then using above solution as iterative initialization, a speedy numerical iterative scheme is proposed to get more precise solution. In the manipulator running course, the iteration initialization can be selected as the last period position and orientation. Because the initialization is closed to correct solution, solving precision is high and speed is rapid enough to satisfy real-time requirement. This mixed forward kinematics algorithm is applied to real Stewart parallel manipulator in the real-time control course. The examination result shows that the algorithm is very efficient and practical.
