基于精度的属性约简新方法

自Pawlak提出粗糙集概念以来,人们就一直对粗糙集的近似精度很感兴趣,出现了不少有关近似精度的文献.在粗糙集理论中,精度是量化由粗糙集边界引起的不精确性的一种重要数字特征.在分析传统精度和基于等价关系图的过剩熵的近似精度的基础上,提出了一种新的精度定义.比较发现,新定义的精度更具有合理性.同时把这个新定义的精度运用到了属性约简上,通过实例比较发现,本文提出的属性约简更具有可行性.     

Frattini子群循环的有限$p$-群中的非交换集和极大Abel子群

设G是一个群,X是G的一个子集,若对于任意x,y∈X且x≠y,都有xy≠yx,则称X是G的一个非交换集.进一步,如果对于G中的任意其它非交换子集Y,都有|X|≥|Y|,那么称X是G的一个极大非交换集.文中确定了Frattini子群循环的有限p-群中极大非交换集和极大Abel子群的势.     

Detecting and imaging dielectric objects from real data: A shape-based approach

In this paper we investigate the performance of a shape-reconstruction technique as tested on the ‘Marseille data’. This approach, which is based on a level set technique, offers several advantages compared to other approaches, as for example well-defined boundaries and the incorporation of an intrinsic regularization in the form of a priori assumptions regarding the general structures in the medium. The level set strategy (which is an implicit representation of the shapes) frees us from topological restrictions during this reconstruction process. Our algorithm is aiming at, not only detecting the objects, but simultaneously determining their approximate locations, sizes and dielectric properties. The numerical experiments show the utility of this method.     

Decomposition and integral representation of Cauchy interactions associated with measures

Received May 29, 2000 / Published online June 1, 2001     

An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm

A random recursive tree on n vertices is either a single isolated vertex (for n=1) or is a vertex v_n connected to a vertex chosen uniformly at random from a random recursive tree on n−1 vertices. Such trees have been studied before [R. Smythe, H. Mahmoud, A survey of recursive trees, Theory of Probability and Mathematical Statistics 51 (1996) 1-29] as models of boolean circuits. More recently, Barabási and Albert [A. Barabási, R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509-512] have used modifications of such models to model for the web and other “power-law” networks.A minimum (cardinality) dominating set in a tree can be found in linear time using the algorithm of Cockayne et al. [E. Cockayne, S. Goodman, S. Hedetniemi, A linear algorithm for the domination number of a tree, Information Processing Letters 4 (1975) 41-44]. We prove that there exists a constant d?0.3745… such that the size of a minimum dominating set in a random recursive tree on n vertices is dn+o(n) with probability approaching one as n tends to infinity. The result is obtained by analysing the algorithm of Cockayne, Goodman and Hedetniemi.     

Substitution effects in the 15N NMR chemical shifts of heterocyclic azines evaluated at the GIAO‐DFT level

A systematic study of the accuracy factors for the computation of ¹⁵N NMR chemical shifts in comparison with available experiment in the series of 72 diverse heterocyclic azines substituted with a classical series of substituents (CH₃, F, Cl, Br, NH₂, OCH₃, SCH₃, COCH₃, CONH₂, COOH, and CN) providing marked electronic σ‐ and π‐electronic effects and strongly affecting ¹⁵N NMR chemical shifts is performed. The best computational scheme for heterocyclic azines at the DFT level was found to be KT3/pcS‐3//pc‐2 (IEF‐PCM). A vast amount of unknown ¹⁵N NMR chemical shifts was predicted using the best computational protocol for substituted heterocyclic azines, especially for trizine, tetrazine, and pentazine where experimental ¹⁵N NMR chemical shifts are almost totally unknown throughout the series. It was found that substitution effects in the classical series of substituents providing typical σ‐ and π‐electronic effects followed the expected trends, as derived from the correlations of experimental and calculated ¹⁵N NMR chemical shifts with Swain–Lupton's F and R constants.     

LK property for σ-ideals

An ideal J of subsets of a Polish space X has (LK) property whenever for every sequence (An) of analytic sets in X, if lim supn∈HAn∉J for each infinite H then _?n∈G∉J for some infinite G. In this note we present a new class of σ-ideals with (LK) property.     

On accuracy and efficiency of constrained reinitialization

The reinitialization, which is required to regularize the level set function, can be computationally expensive and hence is a determining factor for the overall efficiency of a level set method. However, it often has a significantly adverse impact on the accuracy of the level set solution. This short note is meant to shed light on the efficiency and accuracy issues of the reinitialization process. Using just one clearly defined level set propagation test case with an analytical solution the solutions obtained using a recently proposed efficient lower‐order constrained reinitialization (CR) scheme and standard low‐ and high‐order reinitialization schemes are juxtaposed to evidence the superiority of the novel CR formulation. It is shown that maintaining the location of the zero level set during the reinitialization is crucial for the accuracy and that the displacement caused by standard high‐order reinitialization schemes clearly outweighs the benefit of the high‐order smoothing of the level set function. Finally, results of a three‐dimensional problem are concisely reported to demonstrate the general applicability of the CR scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

On a Family of Covering Extended Building Sets

Recently Davis and Jedwab introduced the notion of covering extended building sets to construct abelian difference sets. In this paper we consider a family of covering extended building sets similar to the ones corresponding to Hadamard difference sets and Spence difference sets and derive some numerical restrictions on the parameters.     

Asymptotic Behavior of the Value Functions of Discrete-Time Discounted Optimal Control

We study deterministic discounted optimal control problems associated with discrete-time systems. It is shown that, for small discount rates, the controllability properties of the underlying system can guarantee the convergence of the discounted value function to the value function of the average yield. An application in the theory of exponential growth rates of discrete inclusions is presented. This application motivates the analysis of infinite-horizon optimal control problems with running yields that are unbounded from below.