基于(α, λ)联系度容差关系的变精度粗糙集模型

基于传统粗糙集理论的方法不能有效地处理含噪音的不完备信息系统. 根据集对分析理论, 提出(α, λ)联系度容差关系. 将(α, λ)联系度容差关系与Ziarko提出的多数包含关系相结合, 提出变精度(α, λ)联系度粗糙集模型. 给出了该模型下基于正域相似度的启发式属性约简算法, 分析了算法的时间复杂度, 通过仿真实验验证了所提方法处理含噪音的不完备信息系统的有效性.     

Precise Coulomb wave functions for a wide range of complex ?, η and z

A new algorithm to calculate Coulomb wave functions with all of its arguments complex is proposed. For that purpose, standard methods such as continued fractions and power/asymptotic series are combined with direct integrations of the Schrödinger equation in order to provide very stable calculations, even for large values of |η| or |ℑ(?)|. Moreover, a simple analytic continuation for is introduced, so that this zone of the complex z-plane does not pose any problem. This code is particularly well suited for low-energy calculations and the calculation of resonances with extremely small widths. Numerical instabilities appear, however, when both |η| and |ℑ(?)| are large and comparable or smaller than |ℑ(?)|.

Program summary

Title of program: cwfcomplexCatalogue number:ADYO_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYO_v1_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing provisions: noneComputers on which the program has been tested: DELL GX400Operating systems: Linux, WindowsProgramming language used: C++No. of bits in a word: 64No. of processors used: 1Has the code been vectorized?: noNo. of bytes in distributed program, including test data, etc.: 33 092No. of lines in distributed program, including test data, etc.: 3210Distribution format:tar.gzNature of physical problem: The calculation of Coulomb wave functions with all of their arguments complex is revisited. The new methods introduced allow to greatly augment the range of accessible ?, η, and z.Method of solution: Power/asymptotic series and continued fractions are supplemented with direct integrations of the Coulomb Schrödinger equation. Analytic continuation for is also precisely computed using linear combinations of the functions provided by standard methods, which do not follow the branch cut requirements demanded for Coulomb wave functions.Typical running time: N/AUnusual features of the program: none     

Characterizations of regular ordered semigroups in terms of (α, β)-fuzzy generalized bi-ideals

In this paper, the concept of an (α, β)-fuzzy generalized bi-ideal in an ordered semigroup is introduced, which is a generalization of the concept of a fuzzy generalized bi-ideal in an ordered semigroup. Using this concept, some characterization theorems are provided. The upper/lower parts of an (∈, ∈ ∨ q)-fuzzy generalized bi-ideal are introduced and some characterizations of regular ordered semigroups are given. Also, we consider the concept of implication-based fuzzy generalized bi-ideals in an ordered semigroup. In particular, the implication operators in Lukasiewicz system of continuous-valued logic are discussed.     

A simpler linear time 2/3−ε approximation for maximum weight matching

We present two approximation algorithms for the maximum weight matching problem that run in time . We give a simple and practical randomized algorithm and a somewhat more complicated deterministic algorithm. Both algorithms are exponentially faster in terms of ε than a recent algorithm by Drake and Hougardy. We also show that our algorithms can be generalized to find a 1−ε approximation to the maximum weight matching, for any ε>0.     

The general α-decomposition problem of fuzzy relations

This paper deals with a general α-decomposition problem of fuzzy relations, which can be stated as follows: given a fuzzy relation R∈F(X×Y), determine two fuzzy relations Q∈F(X×Z) and T∈F(Z×Y) such that , where X (resp. Y) is a finite set. Firstly we point out that every fuzzy relation R is always generally α-decomposable, and give an algorithm to construct Q and T with for a given R. Secondly, we show that the general content ρ(R) with is equal to the chromatic number of the simple graph F_R generated by R. Therefore, finding an exact algorithm for calculating ρ(R) is an NP-complete problem.     

A ν-twin support vector machine (ν-TSVM) classifier and its geometric algorithms

In this paper, a ν-twin support vector machine (ν-TSVM) is presented, improving upon the recently proposed twin support vector machine (TSVM). This ν-TSVM introduces a pair of parameters (ν) to control the bounds of the fractions of the support vectors and the error margins. The theoretical analysis shows that this ν-TSVM can be interpreted as a pair of minimum generalized Mahalanobis-norm problems on two reduced convex hulls (RCHs). Based on the well-known Gilbert’s algorithm, a geometric algorithm for TSVM (GA-TSVM) and its probabilistic speed-up version, named PGA-TSVM, are presented. Computational results on several synthetic as well as benchmark datasets demonstrate the significant advantages of the proposed algorithms in terms of both computation complexity and classification accuracy.     

Studies of angular correlations in the decays Bs→J/ψφ by using the SIMUB generator

The performance of the method of angular moments on the ΔΓ_s determination from analysis of untagged decays is examined by using the SIMUB generator. The results of Monte Carlo studies with evaluation of measurement errors are presented. The method of angular moments gives stable results for the estimate of ΔΓ_s and is found to be an efficient and flexible tool for the quantitative investigation of the B⁰_s→J/ψφ decay. The statistical error of the ratio ΔΓ_s/Γ_s for values of this ratio in the interval [0.03,0.3] was found to be independent on this value, being 0.015 for 10⁵ events.     

不确定数据的最优?? 近邻和局部密度聚类算法

传统聚类算法一般针对的是确定数据, 无法解决不确定数据的聚类问题; 现有基于密度的不确定数据聚类算法存在参数敏感且计算率低的问题. 对此, 在引进新的不确定数据相异度函数、最优?? 近邻、局部密度和互包含概念的基础上, 提出解决不确定数据聚类问题的不确定数据的最优?? 近邻和局部密度聚类(OLUC) 算法. 该算法不仅能降低参数敏感性, 提高计算效率, 而且具有动态自适应优化?? 近邻, 快速发现聚类中心和除噪优化的能力. 实验结果表明, 所提出的算法对无论是否存在噪声的不确定数据集都效果良好.

     

三次均匀B样条与α-B样条的扩展

样条曲线曲面在CAD和计算机图形学领域起着重要作用. 本文提出了三次均匀B样条的几类扩展形式. 基于新的样条函数和奇异混合技术, 提出了插值 α-B样条的几类新扩展. 所提出的新样条曲线的优势是他们同时具有全局形状参数和局部形状参数. 最后进一步探讨了它们在数据点插值和多边形形状变形中的应用.     

Vertex fault tolerance of optimal-κ graphs and super-κ graphs

A connected graph G is optimal-κ if κ(G)=δ(G). It is super-κ if every minimum vertex cut isolates a vertex. An optimal-κ graph G is m-optimal-κ if for any vertex set S⊆V(G) with |S|?m, G−S is still optimal-κ. We define the vertex fault tolerance with respect to optimal-κ, denoted by Oκ(G), as the maximum integer m such that G is m-optimal-κ. The concept of vertex fault tolerance with respect to super-κ, denoted by Sκ(G), is defined in a similar way. In this paper, we show that min{κ₁(G)−δ(G),δ(G)−1}?Oκ(G)?δ(G)−1 and min{κ₁(G)−δ(G)−1,δ(G)−1}?Sκ(G)?δ(G)−1, where κ₁(G) is the 1-extra connectivity of G. Furthermore, when the graph is triangle free, more refined lower bound can be derived for Oκ(G).     

A simple proof of the necessity of the failure detector Σ to implement an atomic register in asynchronous message-passing systems

This paper presents a simple proof that shows that the quorum failure detector class (denoted Σ) is the weakest failure detector class required to implement an atomic read/write register in an asynchronous message-passing system prone to an arbitrary number of process crashes. This proof is based on a new reduction algorithm in which all the variables are bounded.     

A saturation method for the modal μ-calculus over pushdown systems

We present an algorithm for computing directly the denotation of a μ-calculus formula χ over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the full μ-calculus. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton manipulations which compute the denotation by recursion over the structure of the formula. We introduce notions of under-approximation (soundness) and over-approximation (completeness) that apply to automaton transitions rather than runs. Our algorithm is relatively simple and direct, and avoids an immediate exponential blow up. Finally, we show experimentally that the direct algorithm is more efficient than via a reduction to parity games.     

Evolutionary bi-objective optimization of a semi-arid vegetation dynamics model with NDVI and σ satellite data

Satellite radar backscattering coefficient σ⁰ data from ENVISAT-ASAR and Normalized Difference Vegetation Index (NDVI) data from SPOT-VEGETATION are assimilated in the STEP model of vegetation dynamics. The STEP model is coupled with a radiative transfer model of the radar backscattering and NDVI signatures of the soil and herbaceous vegetation. These models are driven by field data (rainfall time series, soil properties, etc.). While some model parameters have fixed values, some other parameters have target values to be optimized. The study focuses on a well documented 1 km² homogeneous area in a semi-arid region (Gourma, Mali).We here investigate whether departures between model predictions and the corresponding data result from field data errors, in situ data lack of representativeness or some model shortcomings. For this purpose we introduce an evolutionary strategy (ES) approach relying on a bi-objective function to be minimized in the data assimilation/inversion process. Several numerical experiments are conducted, in various mono-objective and bi-objective modes, and the performances of the model predictions compared in terms of NDVI, backscattering coefficient, leaf area index (LAI) and biomass.It is shown that the bi-objective ES leads to improved model predictions and also to a better readability of the results by exploring the Pareto front of optimal and admissible solutions. It is also shown that the information brought from the optical sensor and the radar is coherent; that the corresponding radiative transfer models are also coherent; that the representativeness of in situ data can be compared to satellite data through the modeling process. However some systematic biases on the biomass predictions (errors in the range 140 to 300 kg ha^− 1) are observed. Thanks to the bi-objective ES, we are able to identify some likely shortcoming in the vegetation dynamics model relating the LAI to the biomass variables.     

基于多尺度H/A/α分解的全极化HRRP特征提取

针对现有基于H/A/α 分解的全极化高分辨率距离像(HRRP) 特征提取方法没有考虑度量尺度对特征性能的影响问题, 引入动态互信息思想设计了度量尺度评价准则, 并提出了基于平均度量尺度、不定度量尺度和金字塔型度量尺度3 种特征提取方法. 采用两类飞机目标全极化HRRP 数据对提取的特征子集进行了有效性分析, 并通过识别多类飞机目标验证了3 种方法提取的特征子集具有良好的类别可分性和稳定性.     

Extending ?-diversity to generalize sensitive data

Generalization is an important technique for protecting privacy in data dissemination. In the framework of generalization, ?-diversity is a strong notion of privacy. However, since existing ?-diversity measures are defined in terms of the most specific (rather than general) sensitive attribute (SA) values, algorithms based on these measures can have narrow eligible ranges for data that has a heavily skewed distribution of SA values and produce anonymous data that has a low utility. In this paper, we propose a new ?-diversity measure called the functional (τ, ?)-diversity, which extends ?-diversity by using a simple function to constrain frequencies of base SA values that are induced by general SA values. As a result, algorithms based on (τ, ?)-diversity may generalize SA values, thus are much less constrained by skew SA distributions. We show that (τ, ?)-diversity is more flexible and elaborate than existing ?-diversity measures. We present an efficient heuristic algorithm that uses a novel order of quasi-identifier (QI) values to achieve (τ, ?)-diversity. We compare our algorithm with two state-of-the-art algorithms that are based on existing ?-diversity measures. Our preliminary experimental results indicate that our algorithm not only provides a stronger privacy protection but also results in better utility of anonymous data.     

Foliar nutrient and water content in subtropical tree islands: A new chemohydrodynamic link between satellite vegetation indices and foliar δN values

We examined the relationships between two satellite-derived vegetation indices and foliar δ¹⁵N values obtained from dominant canopy species in a set of tree islands located in the Everglades National Park in South Florida, USA. These tree islands constitute important nutrient hotspots in an otherwise P-limited wetland environment. Foliar δ¹⁵N values obtained from a previous study of 17 tree islands in both slough (perennially wet) and prairie (seasonally wet) locations served as a proxy of P availability at the stand level. We utilized five cloud-free SPOT 4 multispectral images (20 m spatial resolution) from different times of the seasonal cycle to derive two atmospherically corrected vegetation indices: the normalized difference vegetation index (NDVI) and the normalized difference water index (NDWI), averaged for each tree island. NDWI, which incorporates a shortwave infrared (SWIR) band that provides information on leaf water content, showed consistently higher linear fits with island foliar δ¹⁵N values than did NDVI. In addition, NDWI showed greater variation throughout the seasonal cycle than did NDVI, and was significantly correlated with average water stage, which suggests that the SWIR band captures important information on seasonally variable water status. Tree islands in slough locations showed higher NDWI than prairie islands during the dry season, which is consistent with higher levels of transpiration and nutrient harvesting and accumulation for perennially wet locations. Overall, the results suggest that water availability is closely related to P availability in subtropical tree islands, and that NDWI may provide a robust indicator of community-level water and nutrient status.     

On the Euler sequence spaces which include the spaces ?p and ?∞ I

In the present paper, we introduce the Euler sequence space consisting of all sequences whose Euler transforms of order r are in the space ?_p of non-absolute type which is the BK-space including the space ?_p and prove that the spaces and ?_p are linearly isomorphic for 1 ? p ? ∞. Furthermore, we give some inclusion relations concerning the space . Finally, we determine the α-, β- and γ-duals of the space for 1 ? p ? ∞ and construct the basis for the space , where 1 ? p < ∞.     

Improving the efficiency of ?-dominance based grids

In this paper, we deal with the problem of handling solutions in an external archive with the use of a relaxed form of Pareto dominance called ?-dominance and a variation of it called pa?-dominance. These two relaxed forms of Pareto dominance have been used as archiving strategies in some multi-objective evolutionary algorithms (MOEAs). The main objective of this work is to improve the ?-dominance based schemes to handle nondominated solutions, or to retain nondominated solutions in an external archive. Thus, our main contribution is to add an extra objective function only at the time of accepting a nondominated solution into the external archive, in order to preserve some solutions which are normally lost when using any of the aforementioned relaxed forms of Pareto dominance. Such a proposal is inexpensive (computationally speaking) and quite effective, since it is able to produce Pareto fronts of much better quality than the aforementioned archiving techniques.     

Robust skeletonization using the discrete λ-medial axis

Medial axes and skeletons are notoriously sensitive to contour irregularities. This lack of stability is a serious problem for applications in e.g. shape analysis and recognition. In 2005, Chazal and Lieutier introduced the λ-medial axis as a new concept for computing the medial axis of a shape subject to single parameter filtering. The λ-medial axis is stable under small shape perturbations, as proved by these authors. In this article, a discrete λ-medial axis (DLMA) is introduced and compared with the recently introduced integer medial axis (GIMA). We show that DLMA provides measurably better results than GIMA, with regard to stability and sensibility to rotations. We give efficient algorithms to compute the DLMA, and we also introduce a variant of the DLMA which may be computed in linear-time.