This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation o...This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation of its local search ability of genetic algorithm （GA） in solving a massive combinatorial optimization problem, simulated annealing （SA） is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.展开更多
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method,...The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees.展开更多
Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for a...Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for accurate support recovery of the block K-joint sparse matrix via the BMMV algorithm in the noisy case. Furthermore, we show the optimality of the condition we proposed in the absence of noise when the problem reduces to single measurement vector case.展开更多
This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The...This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The continuous formulation and its first derivatives were evaluated at some selected grid and off grid points to obtain our proposed method. The superiority of the method over the existing methods is established numerically.展开更多
This paper presents a new motion estimation algorithm for video conference signal coding. This type of algorithm is called block adaptive recursive algorithm (BARA). Simulation results show that this new algorithm has...This paper presents a new motion estimation algorithm for video conference signal coding. This type of algorithm is called block adaptive recursive algorithm (BARA). Simulation results show that this new algorithm has better performance than conventional ones.展开更多
Block-matching and 3D-filtering(BM3D) is a state of the art denoising algorithm for image/video,which takes full advantages of the spatial correlation and the temporal correlation of the video. The algorithm performan...Block-matching and 3D-filtering(BM3D) is a state of the art denoising algorithm for image/video,which takes full advantages of the spatial correlation and the temporal correlation of the video. The algorithm performance comes at the price of more similar blocks finding and filtering which bring high computation and memory access. Area, memory bandwidth and computation are the major bottlenecks to design a feasible architecture because of large frame size and search range. In this paper, we introduce a novel structure to increase data reuse rate and reduce the internal static-random-access-memory(SRAM) memory. Our target is to design a phase alternating line(PAL) or real-time processing chip of BM3 D. We propose an application specific integrated circuit(ASIC) architecture of BM3 D for a 720 × 576 BT656 PAL format. The feature of the chip is with 100 MHz system frequency and a 166-MHz 32-bit double data rate(DDR). When noise is σ = 25, we successfully realize real-time denoising and achieve about 10 d B peak signal to noise ratio(PSNR) advance just by one iteration of the BM3 D algorithm.展开更多
This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, ...This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications.展开更多
This article explains the imbalance in DES and introduces the operators in IDEA. At last it puts forward a Unsym-metrical Block Encryption Algorithm which is achieved by adding some operators to DES.
Self-consistent field theory（SCFT）, as a state-of-the-art technique for studying the self-assembly of block copolymers, is attracting continuous efforts to improve its accuracy and efficiency. Here we present a four...Self-consistent field theory（SCFT）, as a state-of-the-art technique for studying the self-assembly of block copolymers, is attracting continuous efforts to improve its accuracy and efficiency. Here we present a fourth-order exponential time differencing Runge-Kutta algorithm（ETDRK4） to solve the modified diffusion equation（MDE） which is the most time-consuming part of a SCFT calculation. By making a careful comparison with currently most efficient and popular algorithms, we demonstrate that the ETDRK4 algorithm significantly reduces the number of chain contour steps in solving the MDE, resulting in a boost of the overall computation efficiency, while it shares the same spatial accuracy with other algorithms. In addition, to demonstrate the power of our ETDRK4 algorithm, we apply it to compute the phase boundaries of the bicontinuous gyroid phase in the strong segregation regime and to verify the existence of the triple point of the O70 phase, the lamellar phase and the cylindrical phase.展开更多
This paper proposes an electronic image stabilization algorithm based on efficient block matching on the plane. This algorithm uses a hexagonal search algorithm, and uses the bit-planes to estimate and compensate for ...This paper proposes an electronic image stabilization algorithm based on efficient block matching on the plane. This algorithm uses a hexagonal search algorithm, and uses the bit-planes to estimate and compensate for the translational motion between video sequences at the same time;As for the rotary motion vector generated in the video sequences, in order to highlight the intensity change of the image sequence, the algorithm firstly conducts Laplace transform for the reference frame, then select a number of characteristics at the image edge to make block matching with the current frame, calculate and compensate for the rotational movement that may exist finally. Through theoretical analysis and simula-tion, we prove that, as for a mixed translational and rotational motion video sequences, the proposed algorithm can reduce required time for block matching computation ,while improving the accuracy of the electronic image stabilization.展开更多
In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new cro...In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.展开更多
Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memor...Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.展开更多
Deep neural networks have achieved excellent classification results on several computer vision benchmarks.This has led to the popularity of machine learning as a service,where trained algorithms are hosted on the clou...Deep neural networks have achieved excellent classification results on several computer vision benchmarks.This has led to the popularity of machine learning as a service,where trained algorithms are hosted on the cloud and inference can be obtained on real-world data.In most applications,it is important to compress the vision data due to the enormous bandwidth and memory requirements.Video codecs exploit spatial and temporal correlations to achieve high compression ratios,but they are computationally expensive.This work computes the motion fields between consecutive frames to facilitate the efficient classification of videos.However,contrary to the normal practice of reconstructing the full-resolution frames through motion compensation,this work proposes to infer the class label from the block-based computed motion fields directly.Motion fields are a richer and more complex representation of motion vectors,where each motion vector carries the magnitude and direction information.This approach has two advantages:the cost of motion compensation and video decoding is avoided,and the dimensions of the input signal are highly reduced.This results in a shallower network for classification.The neural network can be trained using motion vectors in two ways:complex representations and magnitude-direction pairs.The proposed work trains a convolutional neural network on the direction and magnitude tensors of the motion fields.Our experimental results show 20×faster convergence during training,reduced overfitting,and accelerated inference on a hand gesture recognition dataset compared to full-resolution and downsampled frames.We validate the proposed methodology on the HGds dataset,achieving a testing accuracy of 99.21%,on the HMDB51 dataset,achieving 82.54%accuracy,and on the UCF101 dataset,achieving 97.13%accuracy,outperforming state-of-the-art methods in computational efficiency.展开更多
基金Project supported by the National Natural Science Foundation of China （Grant No.50375023）
文摘This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation of its local search ability of genetic algorithm （GA） in solving a massive combinatorial optimization problem, simulated annealing （SA） is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.
基金Supported by the National Natural Science Foundation of China(Grant No.11271365)the Domestic Senior Visiting Scholar Program in Higher Occupation Colleges in Jiangsu Province(Grant No.2014FX075)
文摘The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees.
文摘Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for accurate support recovery of the block K-joint sparse matrix via the BMMV algorithm in the noisy case. Furthermore, we show the optimality of the condition we proposed in the absence of noise when the problem reduces to single measurement vector case.
文摘This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The continuous formulation and its first derivatives were evaluated at some selected grid and off grid points to obtain our proposed method. The superiority of the method over the existing methods is established numerically.
基金Supported by the State Key Laboratory of Inflormation Security
文摘This paper presents a new motion estimation algorithm for video conference signal coding. This type of algorithm is called block adaptive recursive algorithm (BARA). Simulation results show that this new algorithm has better performance than conventional ones.
基金the National Natural Science Foundation of China(No.61234001)
文摘Block-matching and 3D-filtering(BM3D) is a state of the art denoising algorithm for image/video,which takes full advantages of the spatial correlation and the temporal correlation of the video. The algorithm performance comes at the price of more similar blocks finding and filtering which bring high computation and memory access. Area, memory bandwidth and computation are the major bottlenecks to design a feasible architecture because of large frame size and search range. In this paper, we introduce a novel structure to increase data reuse rate and reduce the internal static-random-access-memory(SRAM) memory. Our target is to design a phase alternating line(PAL) or real-time processing chip of BM3 D. We propose an application specific integrated circuit(ASIC) architecture of BM3 D for a 720 × 576 BT656 PAL format. The feature of the chip is with 100 MHz system frequency and a 166-MHz 32-bit double data rate(DDR). When noise is σ = 25, we successfully realize real-time denoising and achieve about 10 d B peak signal to noise ratio(PSNR) advance just by one iteration of the BM3 D algorithm.
基金supported by the National Natural Science Foundation of China(61172159)
文摘This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications.
文摘This article explains the imbalance in DES and introduces the operators in IDEA. At last it puts forward a Unsym-metrical Block Encryption Algorithm which is achieved by adding some operators to DES.
基金financially supported by the China Scholarship Council (No. 201406105018)the National Natural Science Foundation of China (No. 21004013)the National Basic Research Program of China (No. 2011CB605701)
文摘Self-consistent field theory（SCFT）, as a state-of-the-art technique for studying the self-assembly of block copolymers, is attracting continuous efforts to improve its accuracy and efficiency. Here we present a fourth-order exponential time differencing Runge-Kutta algorithm（ETDRK4） to solve the modified diffusion equation（MDE） which is the most time-consuming part of a SCFT calculation. By making a careful comparison with currently most efficient and popular algorithms, we demonstrate that the ETDRK4 algorithm significantly reduces the number of chain contour steps in solving the MDE, resulting in a boost of the overall computation efficiency, while it shares the same spatial accuracy with other algorithms. In addition, to demonstrate the power of our ETDRK4 algorithm, we apply it to compute the phase boundaries of the bicontinuous gyroid phase in the strong segregation regime and to verify the existence of the triple point of the O70 phase, the lamellar phase and the cylindrical phase.
文摘This paper proposes an electronic image stabilization algorithm based on efficient block matching on the plane. This algorithm uses a hexagonal search algorithm, and uses the bit-planes to estimate and compensate for the translational motion between video sequences at the same time;As for the rotary motion vector generated in the video sequences, in order to highlight the intensity change of the image sequence, the algorithm firstly conducts Laplace transform for the reference frame, then select a number of characteristics at the image edge to make block matching with the current frame, calculate and compensate for the rotational movement that may exist finally. Through theoretical analysis and simula-tion, we prove that, as for a mixed translational and rotational motion video sequences, the proposed algorithm can reduce required time for block matching computation ,while improving the accuracy of the electronic image stabilization.
文摘In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.
文摘Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.
基金Supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2025R896).
文摘Deep neural networks have achieved excellent classification results on several computer vision benchmarks.This has led to the popularity of machine learning as a service,where trained algorithms are hosted on the cloud and inference can be obtained on real-world data.In most applications,it is important to compress the vision data due to the enormous bandwidth and memory requirements.Video codecs exploit spatial and temporal correlations to achieve high compression ratios,but they are computationally expensive.This work computes the motion fields between consecutive frames to facilitate the efficient classification of videos.However,contrary to the normal practice of reconstructing the full-resolution frames through motion compensation,this work proposes to infer the class label from the block-based computed motion fields directly.Motion fields are a richer and more complex representation of motion vectors,where each motion vector carries the magnitude and direction information.This approach has two advantages:the cost of motion compensation and video decoding is avoided,and the dimensions of the input signal are highly reduced.This results in a shallower network for classification.The neural network can be trained using motion vectors in two ways:complex representations and magnitude-direction pairs.The proposed work trains a convolutional neural network on the direction and magnitude tensors of the motion fields.Our experimental results show 20×faster convergence during training,reduced overfitting,and accelerated inference on a hand gesture recognition dataset compared to full-resolution and downsampled frames.We validate the proposed methodology on the HGds dataset,achieving a testing accuracy of 99.21%,on the HMDB51 dataset,achieving 82.54%accuracy,and on the UCF101 dataset,achieving 97.13%accuracy,outperforming state-of-the-art methods in computational efficiency.
