SOME COMBINATORIAL OPTIMIZATION PROBLEMS ARISING FROM VLSI CIRCUIT DESIGN

This paper is basically a survey to show a number of combinatorlal optimization problems arising from VLSI clrcult design.Some of them including the existence problem,minimax problem,net representation,bend minimization,area minimization,placement problem,routing problem,etc,are especially discussed with new results and theoretical ideas for treating them.Finally,a number of problems for further research are mentioned.     

Feature extraction using two-dimensional local graph embedding based on maximum margin criterion

In this paper, we propose a novel method for image feature extraction, namely the two-dimensional local graph embedding, which is based on maximum margin criterion and thus not necessary to convert the image matrix into high-dimensional image vector and directly avoid computing the inverse matrix in the discriminant criterion. This method directly learns the optimal projective vectors from 2D image matrices by simultaneously considering local graph embedding and maximum margin criterion. The proposed method avoids huge feature matrix problem in Eigenfaces, Fisherfaces, Laplacianfaces, maximum margin criterion (MMC) and inverse matrix in 2D Fisherfaces, 2D Laplacianfaces and 2D Local Graph Embedding Discriminant Analysis (2DLGEDA) so that computational time would be saved for feature extraction. Experimental results on the Yale and the USPS databases show the effectiveness of the proposed method under various experimental conditions.     

On L-Tychonoff spaces II

This paper is a sequel to the 1995 paper On L-Tychonoff spaces. The embedding theorem for L-topological spaces is shown to hold true for L an arbitrary complete lattice without imposing any order reversing involution (·)^′ on L. Some results on completely L-regular spaces and on L-Tychonoff spaces, which have previously been known to hold true for (L,^′) a frame, are exhibited as ones holding for (L,^′) a meet-continuous lattice. For such a lattice an insertion theorem for completely L-regular spaces is given. Some weak forms of separating families of maps are discussed. We also clarify the dependence between the sub-T₀ separation axiom of Liu and the L-T₀ separation axiom of Rodabaugh.     

Large deviations for heavy-tailed random elements in convex cones

We prove large deviation results for sums of heavy-tailed random elements in rather general convex cones being semigroups equipped with a rescaling operation by positive real numbers. In difference to previous results for the cone of convex sets, our technique does not use the embedding of cones in linear spaces. Examples include the cone of convex sets with the Minkowski addition, positive half-line with maximum operation and the family of square integrable functions with arithmetic addition and argument rescaling.     

Statistical detection of digital holographic watermarking system

In this paper, we examine the statistical properties of the holographic watermarking system [C.J. Cheng, L.C. Lin, W.T. Dai, Opt. Commun. 248 (2005) 105] and facilitate a systematic way to determine an optimal threshold of the correlation signal for detecting the authorized mark pattern. The holographic watermarking system constructs a digital holographic watermark using modified Mach-Zehnder interferometric architecture, and the correlation signal is obtained using an optical VanderLugt 4-f correlator to identify the authorized mark in the watermarked image. To obtain the best detection performance, we use statistical modeling of the entire holographic watermarking system. Accordingly, we derive correlation signal statistics and hypothesis testing to obtain an optimal threshold for the watermark detector that minimizes the detection error. The theoretical result of this paper allows us to easily determine an optimal threshold and evaluate the robustness of the watermark detector. The robustness of the proposed optimal detector is evaluated using detection error, and detection performance is demonstrated by simulation experiments.     

关于可压液晶方程组的能量有界性

考察可压液晶方程组有关能量的基本性质.证明了只要初始能量有界,此系统的能量就是一个与时间无关的有界量.