Fault-tolerant Wormhole Routing Algorithm for Honeycomb Networks

Honeycomb meshes are topological structures for connecting processors within parallel computers. The unicast routing strategy on honeycomb meshes are studied. It is indicated that a previous known routing algorithm may suffer from deadlock. A deadlock-free routing algorithm known as the XYZ-ROUTE algorithm is presented by employing the classical virtual channel technique. This algorithm is improved to make it work properly in the presence of convex faults.     

Energy-aware scheduling of reward maximum in real-time systems

A novel algorithm is proposed for energy-aware scheduling of periodic tasks on variable voltage processors in the real-time systems. Based on the combined idea of artificial bee colony algorithm with greedy algorithm, different speed is allocated for different tasks to ensure the execution of tasks with higher value density. Simulation results show that the system reward of energy per unit is increased with the decreasing of energy constraint, therefore the scheduling algorithm is of the energy awareness. Compared with the greedy algorithm, the rewards of the real-time system using the greedy artificial bee colony algorithm are averagely improved by 78% while energy constraint factor is 0.1. Mmore system rewards can be obtained with the increasing number of tasks or energy constraints.     

Exponential Stability Analysis for TS-model-based Fuzzy Chaotic Control Systems With Delays

The issue of exponential stability for TS-model-based fuzzy chaotic control systems with constant or time-varying delays is investigated. A linear-feedback fuzzy controller is designed using parallel dispersal compensation technique for a large class of chaotic control systems. By means of the Lyapunov-Krasovskii functional approach in combination of the linear matrix inequality and differential inequality techniques, the criteria for exponential stability of the TS-model-based fuzzy controller are derived, and the corresponding control laws are presented. The results are easy to be calculated numerically because of the linear matrix inequalities representation.     

TWO MIMD PARALLEL ALGOITHMS FOR SOLVING ALL PAIRS SHORTEST PATHS

Based on multiprocessor Mpscu, two parallel algorithms are proposed to solve the shortest path problems in N vertex graph within time O(N3/k)with K processors.     

Improved SLM algorithm to improve the PAPR performance of OFDM system with low implementation complexity

In order to consider the feasibility of practical implementation and reduce the complexity of OFDM systems, an improved SLM algorithm is proposed. The original data are segmented and scrambled, which breaks the correlation of the original data sequences, and reduces all sub-carrier phase coherence, thereby reducing the OFDM system PAPR. Following the linear nature of the Fourier transform, the obtained IFFT data sequences are linearly combined to get the new scrambling code sequences, such that strictly controlling the IFFT number, while getting more data sequences, which further reduces the system PAPR, and significantly reduces the computational complexity of the system. Theoretical analysis and simulation results show that the improved SLM algorithm can effectively suppress PAPR, while reducing the algorithm complexity and system complexity.     

Application of Fractals in Architectural Shape Design

A computer aided method for architectural shape design was developed based on the L systems algorithm, the shape grammar and the space surface equation theory. Various 3D entities such as building grounds, building walls and building domes with fractal characteristics could be generated in a short time by using the computer program. These generative 3D entities were saved in a component database which could help to accumulate design knowledge through continuous expansion. A building could successfully be formed by the designers through selecting proper building grounds, walls and domes from this database. The effectiveness of the proposed method was approved with a case study.     

Solving the Symmetric Positive Definitesystems of Linear Equations Which Have Positive Semi-definite Tri-diagonal Matrix Increments

This paper deals with a kind of iterations,which need to solve the symmetric positive definite systems of linear equations whose matrices of coefficients have varying positive semi-definite tri-diagonal martrix increments. The positive semi-definite tri-diagonal martrix increment is especially divided, an iterative algorithm is presented. It to use the algorithm in the iterative process of repeatedly solving above mentioned system. Wu Zhuzhu has presented an algorithm for diagonal elements with positive increments. The algorithm of this paper which takes martrix increments into account, is the generalization of the algorithm presented by Wu Zhuzhu.     

Nondestructive detection of insect infested chestnuts based on NIR spectroscopy

Insect feeding is a significant postharvest problem for processors of chestnuts (Castanea sativa, Miller). In most cases, damage from insects is ‘hidden’, i.e. not visually detectable on the fruit surface. Consequently, traditional sorting techniques, including manual sorting, are generally inadequate for the detection and removal of chestnuts with hidden damage. For the most part, the only method currently used by processors is a flotation system, in which chestnuts are placed in salt water and those that float are discarded. Flotation is unreliable, and a more effective method for detection of insect damage would benefit industry and consumers alike. In this study, the feasibility of using NIR spectroscopy to detect hidden insect damage is demonstrated. Using a genetic algorithm for feature selection (from 2 to 6 wavelengths) in combination with a linear discriminant analysis routine, classification error rates as low as 16.81% false negative, 0.00% false positive, and 8.41% total error were achieved, with an AUC value of 0.952 and an Wilk's λ of 0.403 (P < 0.001). A Savitzky–Golay first derivative spectral pretreatment with 13 smoothing points was used. The optimal features corresponded to Abs [1582 nm], Abs [1900 nm], and Abs [1964 nm]. These results represent an average of 55.3% improvement over a traditional flotation sorting system.     

A FINITE ELEMENT ALGORITHM FOR PARALLEL PROCESSING OF MULTI-FRONTS

In this paper,a new algorithm for solving large-scale finite element system is presented, which utilizes the architecture of parallel processing. Firstly, the structure is partitioned into sub-regions. Then multi-fronts are used to assemble and eliminate concurrently in every sub-region. Thus the condensed interface stiffness matrices and load vectors are obtained. By serially assembling and solving global equation to get interface displacements and backing to every sub-region, the inter-nodal displacements and element stresses can be solved. The results of computation show that it can not only increase the speed of computation,but also save the memory space of computer effectively. This algorithm is an effective method for solving large-scale structural finite element systems.     

一种新的符合度算法及其应用

在总结分析了几种常用综合评价方法的基础上, 提出了一种反映观察值与理论值之间相似性的新算法--符合度。该算法就评价信息个体(观察值)与标准值(期望值)的马氏距离, 再由马氏距离转化为评价对象与标准的接近程度, 即符合度(r)。首先进行指标数(p)、相似度(r)与马氏距离(d)的模拟试验, 再通过曲面拟合的方法找出它们之间的关系模型。通过大量抽样试验, 验证符合度的次数分布与原先设定的符合度的良好对应关系, 说明模型的可行性与可靠性。以小麦RVA性状为指标, 利用该算法分析扬麦系统若干品种之间的接近程度, 并评价多变数复杂效应回归分析模拟试验的结果。符合度算法不需要数据标准化处理, 直接利用原始数据, 减少了计算工作量, 降低了因数据标准化处理方法不同而引起的评价结果差异, 同时由于不需要赋权, 排除了主观性的影响, 保证了信息的完整性以及评价结果的可靠性。     

Pole Normal Assignment for Linear Control Systems

The eigenvalues of a normal matrix are not sensitive to its elements perturbation. Based on the fact, the pole normal assignment problem for linear control systems is discussed. The aim is to find a state feedback control law. When the closed-loop system has desired poles and the closed-loop system matrix is a normal matrix, the robustness of the control system is enhanced. For linear constant systems, a necessary and sufficient condition is given to normal assignment of the desired poles. When the condition holds, a unified expression of the state feedback control laws is showed. An example is given for illustration of the proposed algorithm.     

A High Precision Simulation Algorithm of Linear System and Its Realization

Based on Cayley Hamilton theorem,a high precision simulation algorithm of multivariable linear system is proposed,and applied to SISO and MIMO system simulations.It also has been made test and simulation compared with every kind of systems with popular software MATLAB.     

A Kind of Adaptive Generalized Predictive Control for a Nonlinear System

This paper,using Hammerstein model to express a kind of nonlinear system,presents a new kind of Adaptive Generalized Predictive control for Nonlinear systems(NAGPC). This method divides the whole system into two parts: linear subsystem and nonlinear one. In the first part,a new algorithm ,whose computation quantity is less and speed is faster,is developed according to the characteristics of gain controlling Matrix F in the Generalized Predictive Control (GPC). Mean while, the interpolation method is used to develop one step root solving procedure and the result can be used as the whole system input in the second part. Simulation studies show that the general algorithm NAGPC is strong in robustness,good in stability and fast in computation.     

ALGORITHM AND CONVERGENCE OF TWO-STAGE ITERATIVE PROCEDURE FOR SOLVING SYSTEMS OF LINEAR EQUATIONS

This papr discusses algorithm and convergence of twostage iteratve procedure for solving systems of symmetric positive definite linear equation Ax=b. On the basis of nature splitting of A, this algorithm makes two-step linear iterative procedure (named outer iteration) and makes convergent inner iteraton of any kind.They generate a sequence of approximations {x_h} w.hich converges to the solution Ax=b quickly. This paper also proves is convergene and gives the estimation of error.     

The Location Algorithm of QRS Waves Based on Fractal Box Dimensions Detection Methods

We research fractal characteristics of ECG signal, and find that it is logarithmic linear relationship between the boxes number covering signal and box scale. It is shown that ECG signal have some characteristics. Further more, we discover that fractal dimensions at QRS site are higher than others when using a time windows to detect signal. Based on this foundation, we raise a location algorithm of QRS waves which is based on fractal boxes dimension detection methods. The application results of this algorithm show that it can get rid of noise in ECG effectively with high speed, so this algorithm can be used in real time detection of ECG signal.     

Parallel algorithm for association rules in cluster

Based on comparing with the existing parallel algorithms for mining association rules, the paper analyzes CD,FDM,DDM algorithm in details. To overcome problems existing in efficiency of candidate sets pruning and execution time of these algorithms, the paper proposes parallel process algorithm with an improved parallel association rules. Finally the result of test on share-nothing cluster of workstation show that after adopting the improved algorithm, execution performance and efficiency are higher than others. This result indicates that the algorithm has achieved algorithm optimization.     

A New Fast Algorithm for the Discrete Cosine Transform

We prepose a new fast algorithm for computing discrete cosine transform and its inverse on two dimensional input sizes which are powers of 2.Because the integer operation is more faster than the float operation in computer,the integer operation is used in this algorithm.Through the matrix linear transform the number of operation for multiplications and additions is reduced,so that the speed is greatly raised.This algorithm is applied to our developmented JPEG image coding,and yields very good results.     

AN A. C. LOAD FLOW ANALYSIS OF THE RELIABILITY EVALVATION OF COMPOSITE GENERATION AND TRANSMISSION SYSTEMS

An A. C. load flow analysis of the reliability evaluation of composite generation and transmission systems is presented on the basis of a fast outage simulation algorithm and an optimal model of active and reactive power adjustment after outage contingencies. The information of the first -level outage events is utilized for simulating higher -level outage events in the fast outage simulation algorithm ; the optimal model is satisfactory in speed and accuracy with the application of concentric relaxation and linear increment constraint on the comprehensive adjustment of active and reactive power. As an example. the IEEE Reliability Test System is tested and the results show that the method is accurate and well-matched in speed with the method studied by R. Bllinton, et al.     

Reliability Evaluation for Bulk Power System Including Dependent Outage of Transmission Line

In order to calculate and analyze the effect of two transmission lines in parallel on the reliability evaluation of bulk power system, a model including independent outage, common mode outage and dependent outage of these lines is deduced and a new algorithm corresponding to the model is presented. Two transmission lines in parallel including common mode outages and dependent outages can be really simulated as a multi-state component. While reliability indices are calculated, the probability and frequency of independent outage, common mode outage and dependent outage of a system failure state can be calculated at the same time, and computation complexity is reduced. The proposed model and algorithm are applied to the RBTS system, IEEE One Area RTS96 system and a real power system for reliability computation and analysis. Results show that the new algorithm is credible and validity.     

Fault Tolerance Analysis of Regular Interconnection Multiprocessor System

The interconnection network used in a multiprocessor system provides an effective mechanism for the data exchange between the processors and is one of the dominating factors of performance of the system. The fault tolerance of an interconnection network can be measured by the probability that the network keeps functional in the presence of failures. The authors examine the fault tolerance of four regular interconnection networks (i.e. hypercube, crossed cube, Moius cube, and locally twisted cube) with the probabilistic approach. Experimental results show that all these interconnection networks display excellent fault tolerance. Moreover, the crossed cube enjoys the highest probabilistic of connectivity among them.