New Model and Algorithm for Hardware/Software Partitioning

This paper focuses on the algorithmic aspects for the hardware/software （HW/SW） partitioning which searches a reasonable composition of hardware and software components which not only satisfies the constraint of hardware area but also optimizes the execution time. The computational model is extended so that all possible types of communications can be taken into account for the HW/SW partitioning. Also, a new dynamic programming algorithm is proposed on the basis of the computational model, in which source data, rather than speedup in previous work, of basic scheduling blocks are directly utilized to calculate the optimal solution. The proposed algorithm runs in O（n·A） for n code fragments and the available hardware area A. Simulation results show that the proposed algorithm solves the HW/SW partitioning without increase in running time, compared with the algorithm cited in the literature.     

Output Feedback Tracking Control for a Class of Switched Nonlinear Systems with Time-varying Delay

This paper studies the problem of tracking control for a class of switched nonlinear systems with time-varying delay. Based on the average dwell-time and piecewise Lyapunov functional methods, a new exponential stability criterion is obtained for the switched nonlinear systems. The designed output feedback H∞controller can be obtained by solving a set of linear matrix inequalities(LMIs).Moreover, the proposed method does not need that a common Lyapunov function exists for the switched systems, and the switching signal just depends on time. A simulation example is provided to demonstrate the effectiveness of the proposed design scheme.     

Foley—Sammon鉴别矢量集理论分析及优化模型

The attribute of the maximum of R(ξ) in arbitrary subspace of Rn is discussed dedicatedly. The theory anal-ysis indicates that every F-S discriminant vector is better than respective vector in other discriminant vectors sets,which consist of eigenvectors of sbξ=λswξ. But,the fact that the F-S vectors are statistically correlated degrade the F-S vectors set. Two ways are used to obtain“good“ F-S vectors set. The experiments on Concordia University CEN-PARMI handwritten numeral database suggest that the new vectors set is better than the origin. A new problem mod-el on F-S discriminant vectors set is proposed in this paper. It‘s easily understanding that the problem model is superi-or to the original F-S discriminant vectors set problem model.     

Finite horizon optimal control of discrete-time nonlinear systems with unfixed initial state using adaptive dynamic programming

In this paper, we aim to solve the finite horizon optimal control problem for a class of discrete-time nonlinear systems with unfixed initial state using adaptive dynamic programming (ADP) approach. A new ε-optimal control algorithm based on the iterative ADP approach is proposed which makes the performance index function converge iteratively to the greatest lower bound of all performance indices within an error according to ε within finite time. The optimal number of control steps can also be obtained by the proposed ε-optimal control algorithm for the situation where the initial state of the system is unfixed. Neural networks are used to approximate the performance index function and compute the optimal control policy, respectively, for facilitating the implementation of the ε-optimal control algorithm. Finally, a simulation example is given to show the results of the proposed method.     

Construction of minimal trellises for quantum stabilizer codes

The size of vertex set of quantum trellises affects the efficiency of decoding algorithms,which can be improved by reducing the number of vertices.Based on the standard check matrix of stabilizer codes,an algorithm to construct trellis-oriented generators for quantum stabilizer codes is presented.By using this algorithm,the trellises with minimal vertex set can be constructed.In addition,an algorithm to construct trellises iteratively for quantum stabilizer codes is also introduced.The algorithm proposed in this paper is more efficient and less complex than the one proposed by Olliver,and so is more suitable for the applications of larger scale and stricter timeliness.     

Output feedback controller design for uncertain piecewise linear systems

This paper proposes output feedback controller design methods for uncertain piecewise linear systems based on piecewise quadratic Lyapunov function. The α-stability of closed-loop systems is also considered. It is shown that the output feedback controller design procedure of uncertain piecewise linear systems with α-stability constraint can be cast as solving a set of bilinear matrix inequalities （BMIs）. The BMIs problem in this paper can be solved iteratively as a set of two convex optimization problems involving linear matrix inequalities （LMIs） which can be solved numerically efficiently. A numerical example shows the effectiveness of the proposed methods.     

Delay-dependent stabilization of singular Markovian jump systems with state delay

This paper deals with the delay-dependent stabilization problem for singular systems with Markovian jump parameters and time delays. A delay-dependent condition is established for the considered system to be regular, impulse free and stochastically stable. Based on the condition, a design algorithm of the desired state feedback controller which guarantees the resultant closed-loop system to be regular, impulse free and stochastically stable is proposed in terms of a set of strict linear matrix inequalities （LMIs）. Numerical examples show the effectiveness of the proposed methods.     

动态交通分配与信号控制的组合模型及算法研究

This paper presents a generalized bi-level programming model of combined dynamic traffic assignment and traffic signal control, and especially analyzes a procedure for determining the equilibrium queuing delays on saturated links for dynamic network signal control satisfying the FIFO (first-in-first-out) rule. The chaotic optimal algorithm proposed in this paper can not only present the optimal signal settings, but also calculate, at each interval, the link inflow rates and outflow rates for the dynamic user optimal problem, and provide real-time information for the travelers. Finally, a numerical example is given to illustrate the application of the proposed model and solution algorithm, and comparison shows that this model has better system performance.     

Robust reliable H-infinity control for nonlinear uncertain stochastic time-delay systems with Markovian jumping parameters

This paper deals with the problems of robust reliable exponential stabilization and robust stochastic stabilization with H-infinity performance for a class of nonlinear uncertain time-delay stochastic systems with Markovian jumping parameters. The time delays are assumed to be dependent on the system modes. Delay-dependent conditions for the solvability of these problems are obtained via parameter-dependent Lyapunov functionals. Furthermore, it is shown that the desired state feedback controller can be designed by solving a set of linear matrix inequalities. Finally, the simulation is provided to demonstrate the effectiveness of the proposed methods.     

H_∞ controller synthesis of piecewise discrete time linear systems

This paper presents an H∞ controller design method for pieccwise discrete time linear systems based on a piecewise quadratic Lyapunov function. It is shown that the resulting closed loop system is globally stable with guaranteed H∞ perfomiance and the controller can be obtained by solving a set of bilinear lnatrLx inequalities. It has been shown that piecewise quadratic Lyapunov functions are less conservative than the global qnadnmc Lyapunov functions. A simulation example is also given to illustrate the advantage of the proposed approach.     

Fast evaluation of Bounded Slice-line Grid

Bounded Slice-line Grid (BSG) is an elegant representation of block placement, because it is very intuitionistic and has the advantage of handling various placement constraints. However, BSG has attracted little attention because its evaluation is very time-consuming. This paper proposes a simple algorithm independent of the BSG size to evaluate the BSG representation in O(nloglogn) time, where n is the number of blocks. In the algorithm, the BSG-rooms are assigned with integral coordinates firstly, and then a linear sorting algorithm is applied on the BSG-rooms where blocks are assigned to compute two block sequences, from which the block placement can be obtained in O(n log logn) time. As a consequence, the evaluation of the BSG is completed in O(nloglogn) time, where n is the number of blocks. The proposed algorithm is much faster than the previous graph-based O(n^2) algorithm. The experimental results demonstrate the efficiency of the algorithm.     

An Optimum Placement Search Algorithm Based on Extended Corner Block List

A non-slicing approach,Corner Block List(CBL),has been presented recently.Since CBL only can represent floorplans without empty rooms,the algorithm based on CBL cannot get the optimum placement.In this paper,an extended corner block list,ECBLλ,is proposed.It can represent non-slicing floorplan including empty rooms.Based on the optimum solution theorem of BSG(bounded-sliceline grid),it is proved that the solution space of ECBLn,where n is the number of blocks,contains the optimum block placement with the minimum area.A placement algorithm based on ECBLλ,whose solution space can be controlled by setting λ,the extending ratio,is completed.Whenλ is set as n,the algorithm based on ECBLn is the optimum placement search algorithm.Experiments show that λ has a reasonable constant range for building block layout problem,so the algorithm can translate an ECBLλ representation to its corresponding placement in O(n) time,Experimental results on MCNC benchmarks show promising performance with 7% improvement in wire length and 2% decrease in dead space over algorthms based on CBL.Meanwhile,compared with other algorithms,the proposed algorithm can get better results with less runtime.     

A new algebraic modelling approach to distributed problem-solving in MAS

This paper is devtoed to a new algebraic modelling approach to distributed problem-solving in multi-agent systems(MAS),which is featured by a unified framework for describing and treating social behaviors,social dynamics and social intelligence.A coneptual architecture of algebraic modelling is presented.The algebraic modelling of typical social be-haviors,social situation and social dynamics is discussed in the context of distributed problem-solving in MAS .The comparison and simulation on distributed task allocations and resource assignments in MAS show more advantages of the algebraic approach than other conventional methods.     

Sequential Combination Methods for Data Clustering Analysis

This paper proposes the use of more than one clustering method to improve clustering performance,Clustering is an optimization procedure based on a specific clustering criterion.Clustering combination can be regarded as a technique that constructs and processes multiple clustering criteria.Since the global and local clustering criteria are complementary rather than competitive,combining these two types of clustering criteria may enhance the clustering performance,In our past work,a multi-objective programming based simultaneous clustering combination algorithm has been propsed,which incorporates multiple criteria into an objective function by a weighting method,and solves this problem with constrained nonlinear optimization programming.But this algorithm has high computaional complexity,Here a sequential combination approach is investigated,which first uses the global criterion based clustering to produce an initial result ,then uses the local criterion based informaiton to improve the initial result with a probabilistic relaxation algorithm or linear additive model.Compared with the simultaneous combination method,sequential combination has low computational complexity.Results on some simulated data and standard test data are reported.It appears that clustering performance improvement can be achieved at low cost through sequential combination.     

Improving retrieval performance by region constraints and relevance feedback

In this paper, region features and relevance feedback are used to improve the performance of CBIR. Unlike existing region-based approaches where either individual regions are used or only simple spatial layout is modeled, the proposed approach simultaneously models both region properties and their spatial relationships in a probabilistic framework. Furthermore, the retrieval performance is improved by an adaptive filter based relevance feedback. To illustrate the performance of the proposed approach, extensive experiments have been carried out on a large heterogeneous image collection with 17,000 images, which render promising results on a wide variety of queries.     

An integrated edge detection method using mathematical morphology

This paper presents an edge detection method based on mathematical morphology. The proposed scheme consists of four steps: preprocessing, edge extraction, edge decision, and postprocessing. In the preprocessing step, a morphological central transformation is applied to remove noise. In the edge extraction and decision steps, a morphological edge extractor is designed to estimate the edge information of an image, and an edge decision criterion is followed to determine whether a pixel is an edge or not. In the postprocessing step, the morphological hit-or-miss transformation is utilized to improve the correctness of the detected edges. It is proved theoretically for the correctness and effectiveness for detecting ideal edges. Experimental results show that the proposed method works well on both artificial and real images. The text was submitted by the authors in English. Chin-Pan Huang was born in 1959 in Taiwan, Republic of China. He received the B.S. and M.S. degrees in electrical engineering from Chung Cheng Institute of Technology, Taiwan, in 1981 and in 1985, respectively. In 1996, he received the Ph.D. degree in electrical engineering from the University of Pittsburgh in the United States. From 1996 to 2002, he was an associate scientist of the Electronic System Division in Chung Shan Institute of Science and Technology. He then joined the Department of Computer and Communication Engineering at Ming Chuan University in August 2002 and is currently an assistant professor there. His recent research interests include data compression, computer vision, digital image processing, and pattern recognition. Ran-Zan Wang was born in 1972 in Fukien, Republic of China. He received his B.S. degree in computer engineering and science in 1994 and M.S. degree in electrical engineering and computer science in 1996, both from Yuan-Ze University. In 2001, he received his Ph.D. degree in computer and information science from National Chiao Tung University. In 2001–2002, he was an assistant professor at the Department of Computer Engineering at the Van Nung Institute of Technology. He joined the Department of Computer and Communication Engineering at Ming Chuan University in August 2002 and is currently an assistant professor there. His recent research interests include data hiding and digital watermarking, image processing, and pattern recognition. Dr. Wang is a member of the Phi Tau Phi Scholastic Honor Society.     

Printed Arabic character recognition using HMM

The Arabic Language has a very rich vocabulary. More than 200 million people speak this language as their native speaking, and over 1 billion people use it in several religion-related activities. In this paper a new technique is presented for recognizing printed Arabic characters. After a word is segmented, each character/word is entirely transformed into a feature vector. The features of printed Arabic characters include strokes and bays in various directions, endpoints, intersection points, loops, dots and zigzags. The word skeleton is decomposed into a number of links in orthographic order, and then it is transferred into a sequence of symbols using vector quantization. Single hidden Markov model has been used for recognizing the printed Arabic characters. Experimental results show that the high recognition rate depends on the number of states in each sample.     

Secure web transaction with anonymous mobile agent over internet

A major problem of mobile agents is their apparent mability to authenticate transactions in hostile environments,In this paper,a new secure anonymous mobile agent scheme is proposed for the prevention of agent tempering without compromising the mobility or autonomy of the agent.in the scheme,a mobile agent can produce valid signature on website‘s bid(it means to transact a contact with the web site)on behalf of its customer ,without-revealing the customer‘s real private key.In addition,the anonymity of the customer is also achieved when its agent tansacts with the websites.Furthermore,the customer who issues a malicious agent or denies the transaction can be identified and detected by Agent Management Center(AMC).Thererfore,the scheme is practical in the future elecronic commerce over Internet.     

Variables Bounding Based Retiming Algorithm

Retiming is a technique for optimizing sequential circuits.In this paper,we discuss this problem and propose an improved retiming algorithm based on varialbes bounding.Through the computation of the lower and upper bounds on variables,the algorithm can significantly reduce the number of constratints and speed up the execution of retiming.Furthermore,the elements of matrixes D and W are computed in a demand-driven way,which can reduce the capacity of memory,It is shown through the experimental results on ISCAS89 benchmarks that our algorithm is very effective for large-scale seuqential circuits.