On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

基于SVM局部后验概率融合方法研究

研究了基于支持向量机的后验概率的应用,提出了对样本集进行分解,以产生局部后验概率,根据模式的稳健性对局部后验概率进行凸组合融合的方法.     

The Cross-Entropy Method for Continuous Multi-Extremal Optimization

In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear constraints.      

Tight-binding method modelling of photonic crystal waveguides

We present here a tight-binding-like modelling of two-dimensional (2D) photonic crystals (PCs). Adopted from solid-state physics, the concept of generalized Wannier functions is used to construct a localized state basis that allows a parameter-free ab initio study of defects in PCs. We demonstrate here for a 2D triangular lattice of dielectric rods in air, the existence of this localized basis and the possibility to study large scale complex dielectric structures deviating from periodicity. Specific numerical simulations on a split waveguide embedded in this triangular lattice are performed, and they demonstrate the superiority of this method over plane wave based techniques.     

二分量高温超导机理

用两种电子态,讨论了金属—绝缘相变、反铁磁性—金属相变,以及相分离、正常态—超导态相变、非费米液体行为、高Tc等 关键词： 两种电子态 格林函数 玻色化 高温超导     

Phonon density of states of ann-component alloy

We have generalized the coherent potential approximation (CPA) of Tripathi and Behera to the case of ann-component alloy. It is seen that then-component CPA density of states reproduces the binary, ternary quartenary alloys etc when the appropriate limits are adopted.     

Diophantine Undecidability of Function Fields of Characteristic Greater than 2, Finitely Generated over Fields Algebraic over a Finite Field

Let F be a function field of characteristic p > 2, finitely generated over a field C algebraic over a finite field C _p and such that it has an extension of degree p. Then Hilbert's Tenth Problem is not decidable over F.     

Characterisations of function spaces of generalised smoothness

We investigate function spaces of generalised smoothness of Besov and Triebel–Lizorkin type. Equivalent quasi-norms in terms of maximal functions and local means are given. An atomic decomposition theorem for this type of spaces is proved. Mathematics Subject Classification (2000) 46E35     

Solutions in Sobolev spaces of vector refinement equations with a general dilation matrix

In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space W_p^k(ℝ^s) (1≤p≤∞) to a vector refinement equation with a general dilation matrix. The criterion is constructive and can be implemented. Rate of convergence of vector cascade algorithms in a Sobolev space W_p^k(ℝ^s) will be investigated. When the dilation matrix is isotropic, a characterization will be given for the L_p (1≤p≤∞) critical smoothness exponent of a refinable function vector without the assumption of stability on the refinable function vector. As a consequence, we show that if a compactly supported function vector φ∈L_p(ℝ^s) (φ∈C(ℝ^s) when p=∞) satisfies a refinement equation with a finitely supported matrix mask, then all the components of φ must belong to a Lipschitz space Lip(ν,L_p(ℝ^s)) for some ν>0. This paper generalizes the results in R.Q. Jia, K.S. Lau and D.X. Zhou (J. Fourier Anal. Appl. 7 (2001) 143–167) in the univariate setting to the multivariate setting. Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 42C20, 41A25, 39B12. Research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC Canada) under Grant G121210654.     

The Role of a Specific Response of Media in the Vavilov-Cherenkov Effect

It is shown that the condition υ > υ_p (ω), which is necessary in order to trigger the Vavilov-Cherenkov effect, determines the interval of radiated frequencies and it alone cannot establish a strong restriction to the velocity of the particle. It is exhibited that it is possible to define a general lower bound for the velocity of the particle, which does not depend on the frequency when both, a specific response of the medium is taken into account and the mentioned condition is considered. The minimum value of the phase velocity of light in the medium determines the existence of such general lower bound.