In this paper, two algorithms for layer assignment with the goal of yield enhancement are proposed. In the rst, vias in an existing layout are moved in order to decrease its sensitivity to defects. A greedy algorithm for achieving this objective is presented. In the second, we formulate the layer assignment problem as a network bipartitioning problem. By applying the primal-dual algorithmm1] (a...

We report the study of small lithium clusters Lin(0/+1/)(-)(1) (n = 5-7), performed via the novel Gradient Embedded Genetic Algorithm (GEGA) technique and molecular orbital analysis. GEGA was developed for searching of the lowest-energy structures of clusters. Results of our search, obtained using this program, have been compared with the previous ab initio calculations, and the efficiency of t...

Load balancing is an important requirement for the efficient execution of numerical simulations on parallel computers. In particular when the simulation domain changes over time, the mapping of computational tasks to processors needs to be modified accordingly. Most stateof-the-art libraries addressing this problem are based on graph repartitioning with a parallel variant of the Kernighan-Lin (...

K. Premaratne, E. I. Jury, and M. Mansour, “An algorithm for model reduction of 2-D discrete time systems,” IEEE Trans. Circuits Syst. , vol. 37, pp. 1116-1132, Sept. 1990. M. Kawamata, T. Lin, and T. Higuchi, “Minimization of sensitivity of 2-D state-space digital filters and its realization to 2-D balanced realizations,” in Proc. IEEE I987 Int. Symp. Circuits and Syst. vol. 2, pp. 710-713, Ph...

Chang, Y. -R. , Lin, H. -Y. , Chen, I. -Y. & Kuo, S. -Y. , A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD, Proceedings of the 27th Annual International Conference on Computer Software and Applications, 2003. Fard, N. S. & Lee, T. -H. , Cutset enumeration of network systems with link and node failures, Reliability Engineering and System Safety 1999, pp. 141 14...

→ Security weakness (Kerckhoffs's framework). Code book estimable on a simplified version [2]. → High computational complexity of the Embedding part Lin et al. [3] solution is not enough satisfying in term of robustness-distortion tradeoff. → DCT artifacts. [1] “Applying Informed Coding and Informed Embedding to Design a Robust, High Capacity Watermark”, Miller, Doërr, and Cox, IEEE TIP 2004. [...

In molecular biology, RNA structure comparison is of great interest to help solving problems as different as phylogeny reconstruction, prediction of molecule folding and identification of a function common to a set of molecules. Lin and al. [13] proposed to define a similarity criterion between RNA structures using a concept of edit distance. They proved that computing the edit distance is a Ma...

An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrix of.symmetric traveling salesman problem. However, the design and implementation of an algorithm based on this heuristic is not trivial. There are many.This article is about the heuristic for the travelling salesman problem. An Effective Heuristic Algorithm for the Tr...

We int rodu ce a new class of Markov chain Monte Carlo search pr ocedures tha t lead to mor e powerful optimization met hods than simulated annealing . The main idea is to embed det erminist ic local search techniques into stochas tic algorithms. The Mont e Carlo explores only local optima, and it is ab le to make large, global changes even at low temperatur es, t hus overcoming large barr iers...