Memory management optimization problems for integrated circuit simulators

In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to the great number of tests to be performed, optimization of the simulation code is of prime importance. This paper describes two mathematical models for the minimization of the memory access times for a cycle-based simulator.An integrated circuit being viewed as a directed acyclic graph, the problem consists in building a graph order on the vertices, compatible with the relation order induced by the graph, in order to minimize a cost function that represents the memory access time. For both proposed cost functions, we show that the corresponding problems are NP-complete. However, we show that the special cases where the graphs are in-trees or out-trees can be solved in polynomial time.     

Numerical study of charge ordering in NaxCoO2

A simple microscopic model of charge ordering in the Na_xCoO₂ system is presented. The model takes into account the interplane interactions between the ordered Na ions and d electrons from the CoO₂ layers as well as the nearest-neighbor intraplane Coulomb interactions between d electrons. It is shown that a driving force of charge ordering in the CoO₂ layers is the interplane interaction that alone is able to describe various types of inhomogeneous charge ordering (e.g., the striped phases) as well as to predict correctly the conducting properties of the system.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

凸集的广义Reuleaux三角形

常宽凸集的面积最小者为Reulaux三角形，而非常宽凸集的面积最小者为何呢？它就是本文将给出的广义Reuleaux三角形△R。     

On the performance of peeling algorithms

The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n^˙ Log (n)) execution time, may give an O(n^˙n^˙ Log (n)) to peel all the set; an O(n^˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n^˙n) performance.     

凸规划的极大熵函数序列及其收敛性

为了消除凸规划问题中极大熵方法所导致的数值病态，该文应用Lagrange乘子法及赋范原理，给出一类凸规划问题的极大熵函数序列，并证明该序列一致收敛于凸规划的最优解。     

Support vector machine via nonlinear rescaling method

In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [Polyak in Math Program 54:177–222, 1992; Polyak in Math Program Ser A 92:197–235, 2002; Polyak and Teboulle in Math Program 76:265–284, 1997] and references therein). The formulation of the linear SVM based on the NR method leads to an algorithm which reduces the number of support vectors without compromising the classification performance compared to the linear soft-margin SVM formulation. The NR algorithm computes both the primal and the dual approximation at each step. The dual variables associated with the given data-set provide important information about each data point and play the key role in selecting the set of support vectors. Experimental results on ten benchmark classification problems show that the NR formulation is feasible. The quality of discrimination, in most instances, is comparable to the linear soft-margin SVM while the number of support vectors in several instances were substantially reduced.     

Comparison of volumes by means of the areas of central sections

The Busemann–Petty problem asks whether origin-symmetric convex bodies in Rⁿ with smaller areas of all central hyperplane sections necessarily have smaller n-dimensional volume. The solution was completed in the end of the 1990s, and the answer is affirmative if n4 and negative if n5. Since the answer is negative in most dimensions, it is natural to ask what information about the volumes of central sections of two bodies does allow to compare the n-dimensional volumes of these bodies in all dimensions. In this article we give an answer to this question in terms of certain powers of the Laplace operator applied to the section function of the body.     

非扩张映象的重合点与不动点

本文在凸度量空间中讨论了集什扩张映象对的重合和非扩张映象列的公共不动点的存在性，所得结论是单值非扩张映象数情形的推广和发展。．     

Discrete storage processes and their Poisson flow and fluid flow approximations

Consider discrete storage processes that are modulated by environmental processes. Environmental processes cause interruptions in the input and/or output processes of the discrete storage processes. Due to the difficulties encountered in the exact analysis of such discrete storage systems, often Poisson flow and/or fluid flow models with the same modulating environmental processes are proposed as approximations for these systems. The analysis of Poisson flow and fluid flow models is much easier than that of the discrete storage processes. In this paper we give sufficient conditions under which the content of the discrete storage processes can be bounded by the Poisson flow and the fluid flow models. For example, we show that Poisson flow models and the fluid flow models developed by Kosten (and by Anick, Mitra and Sondhi) can be used to bound the performance of infinite (finite) source packetized voice/data communication systems. We also show that a Poisson flow model and the fluid flow model developed by Mitra can be used to bound the buffer content of a two stage automatic transfer line. The potential use of the bounding techniques presented in this paper, of course, transcends well beyond these examples.Supported in part by NSF grant DMS-9308149.