Discovery of Functional and Approximate Functional Dependencies in Relational Databases

This study develops the foundation for a simple, yet efficient method for uncovering functional and approximate functional dependencies in relational databases. The technique is based upon the mathematical theory of partitions defined over a relation's row identifiers. Using a levelwise algorithm the minimal non-trivial functional dependencies can be found using computations conducted on integers. Therefore, the required operations on partitions are both simple and fast. Additionally, the row identifiers provide the added advantage of nominally identifying the exceptions to approximate functional dependencies, which can be used effectively in practical data mining applications.     

A bi-unique transformation into integers of identifiers and other variable-length items

A simple algorithm is given for transforming variable-length items (such as identifiers) bi-uniquely into fixed-length integers, which are more easily accomodated by computer programs. The technique is especially useful when programming assemblers and compilers but may also find application in other areas of data processing.     

一种基于证据推理的多指标多标度大群体决策方法

针对多指标多标度大群体决策问题,提出了一种基于证据推理的决策方法.首先将参与决策人针对各指标给出的方案评价信息转化为关于指标评价标度的概率分布.然后运用证据推理方法将针对不同指标的概率分布形式的群体评价信息进行集结,得到关于综合评价标度分布形式的群体综合评价信息,在此基础上计算每个方案的效用值,并据此对方案进行排序.最后,通过一个实例说明了本文提出方法的可行性和有效性.本文的方法为解决大群体决策问题提供了一种新途径.具有实际应用价值.     

FUZZY IDENTIFIER WITH EXPONENTIAL RATE OF CONVERGENCE FOR NONLINEAR DYNAMIC SYSTEMS

1 IntroductionIn recent yearst there is a development in the use of fuzzy systems for modelling, identifyingand controlling nonlinear systems. The reason is that conventional identification methods canonly use input-output pairs, but ignore linguistic information about the behavior of nonlinearsystems. Therefore, developing identifiers and controllers Of nonlinear systems which can com-bine both linguistic knowledge and numerical information is an important task. Ill this repect,works on the …     

Regression Modeling and File Matching Using Possibly Erroneous Matching Variables

Many analyses require linking records from two databases comprising overlapping sets of individuals. In the absence of unique identifiers, the linkage procedure often involves matching on a set of categorical variables, such as demographics, common to both files. Typically, however, the resulting matches are inexact: some cross-classifications of the matching variables do not generate unique links across files. Further, the variables used for matching can be subject to reporting errors, which introduce additional uncertainty in analyses. We present a Bayesian file matching methodology designed to estimate regression models and match records simultaneously when categorical variables used for matching are subject to errors. The method relies on a hierarchical model that includes (1) the regression of interest involving variables from the two files given a vector indicating the links, (2) a model for the linking vector given the true values of the variables used for matching, (3) a model for reported values of the variables used for matching given their true values, and (4) a model for the true values of the variables used for matching. We describe algorithms for sampling from the posterior distribution of the model. We illustrate the methodology using artificial data and data from education records in the state of North Carolina.     

A Note on the Power of Personal Identifying Information

The values of names, addresses and dates of birth for identifying individuals uniquely depends on several factors. This note shows how to combine the inherent power of an identifier, its availability and its error rate to give a practical measure for ranking its usefulness. The theory is developed in terms of selecting a number of non-unique identifiers to form a composite key with sufficient redundancy to identify individuals in an automated system. The note concludes with an indication of other classification, allocation and decision processes to which the technique may be applied.     

Characterizations of the strongly unique best approximations

The purpose of this paper is two folded. First, we present some results on strongly Kolmogorov sets, some of which parallel those for Kolmogorov sets. Secondly, we give two conditions which are sufficient for an element of a strongly Kolmogorov set to be a strongly unique best approximation. Then these conditions are shown to be necessary if additional conditions are imposed on either the norm or the set which we approximate from.     

Sub-additive topological and measure-theoretic tail pressures

In this paper, we give some definitions of the topological tail pressures for sub-additive potentials and prove that they are equivalent if the potentials are continuous. Under some assumptions, we get a variational principle which exhibits the relationship between topological tail pressure and measure-theoretic tail entropy. Finally, we define a new measure-theoretic tail pressure for sub-additive potentials and some interesting properties of it are obtained.     

交替方向法求解带线性约束的变分不等式

１引言变分不等式是一个有广泛应用的数学问题,它的一般形式是：确定一个向量,使其满足这里ｆ是一个从到自身的一个映射,Ｓ是Ｒ中的一个闭凸集．在许多实际问题中集合Ｓ往往具有如下结构其中ＡｂＫ是中的一个简单闭凸集．例如一个正卦限,一个框形约束结构,或者一个球简言之,Ｓ是Ｒ中的一个超平面与一个简单闭凸集的交．求解问题（１）－（２）,往往是通过对线性约束Ａ引人Ｌａｇｒａｎｇｅ乘子,将原问题化为如下的变分不等式：确定使得我们记问题（３）－（４）为ＶＩ（Ｆ）．熟知［３］,ＶＩ（,Ｆ）等价于投影方程其中凡（·）表…     

关于正则Fredholm多值线性算子对

将单值算子的Fredholm对的概念推广到多值线性算子的范畴上,讨论了Fredholm多值线性算子对的一些初等性质,在适当的条件下,获得了正则的Fredholm多值线性算子对的与正则Fredholm算子对的相平行的一些结果.     

Construction of Lyapunov functionals for delay differential equations in virology and epidemiology

In the present paper, we present a method for constructing a Lyapunov functional for some delay differential equations in virology and epidemiology. Here some delays are incorporated to the original ordinary differential equations, for which a Lyapunov function is already obtained. We present simple and clear explanation of our method using some models whose Lyapunov functionals are already obtained. Moreover, we present several new results for constructing Lyapunov functionals using our method.     

-inclusion sets for eigenvalues of a tensor

In this paper, we mainly focus on new inclusion sets for eigenvalues of a tensor. First, we propose new inclusion sets for eigenvalues of a tensor, which are sharper than some existing inclusion sets, and obtain the law of distribution of the number of eigenvalues for a tensor. Second, two new classes of tensors are introduced. Third, some bounds on the spectral radii for nonnegative tensors are given. Fourth, some checkable sufficient conditions for the positive definiteness (positive semidefiniteness) of some classes of even-order real symmetric tensors are obtained.     

The Las-Vegas Processor Identity Problem (How and When to Be Unique)

We study the classical problem of assigning unique identifiers to identical concurrent processes. In this paper, we consider the asynchronous shared memory model, and the correctness requirement is that upon termination of the algorithm, the processes must have unique IDs always. Our results include tight characterization of the problem in several respects. We call a protocol solving this task Las Vegas if it has finite expected termination time. Our main positive result is the first Las-Vegas protocol that solves the problem. The protocol terminates in O(log n) expected asychronous rounds, using O(n) shared memory space, where n is the number of participating processes. The new protocol improves on all previous solutions simultaneously in running time (exponentially), probability of termination (to 1), and space requirement. The protocol works under the assumption that the asynchronous schedule is oblivious, i.e., independent of the actual unfolding execution. On the negative side, we show that there is no finite-state Las-Vegas protocol for the problem if the schedule may depend on the history of the shared memory (an adaptive schedule). We also show that any Las-Vegas protocol must know n in advance (which implies that crash faults cannot be tolerated) and that the running time is Ω(log n). For the case of an arbitrary (nonoblivious) adversarial schedule, we present a Las-Vegas protocol that uses O(n) unbounded registers. For the read-modify-write model, we present a constant-space deterministic algorithm.     

Some inequalities for randomly stopped variables with applications to pointwise convergence

In this paper, first, we prove some inequalities for randomly stopped variables, which arise naturally in the gambling theory, then we show that a theorem of Chacon and some pointwise convergence theorems, which imply the submartingale convergence theorem, are immediate consequences of these inequalities.     

Existence theorems for usual and approximate solutions of optimal control problems

The theory of measurable set-valued mappings allows us to study some problems of optimal control in the framework of minimization of convex functionals and thus to obtain existence theorems. When the functionals are nonconvex, we obtain the existence theorems for control problems which are weakly perturbed from the initial one. In this regard, we specify some theorems of nonconvex optimization.     

Betti Numbers of Hypergraphs

In this article, we study some algebraic properties of hypergraphs, in particular their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge are not previously considered in the literature. Also, in a natural way, we define a product on hypergraphs, which in a sense is dual to the join operation on simplicial complexes. For such product, we give a general formula for the Betti numbers, which specializes neatly in case of linear resolutions.     

Multiple solutions for a fourth-order difference boundary value problem with parameter via variational approach

By establishing the corresponding variational framework, and using the mountain pass theorem, linking theorem and Clark theorem in critical point theory, we give the existence of multiple solutions for a fourth-order difference boundary value problem with parameter. Under some suitable assumptions we obtain some results which ensure the existence of well precise interval of parameter for which the problem admits multiple solutions. Some examples are presented to illustrate the main results.     

Some concepts of positive dependence for bivariate interchangeable distributions

In this work we consider some familiar and some new concepts of positive dependence for interchangeable bivariate distributions. By characterizing distributions which are positively dependent according to some of these concepts, we indicate real situations in which these concepts arise naturally. For the various families of positively dependent distributions we prove some closure properties and demonstrate all the possible logical relations. Some inequalities are shown and applied to determine whether under- (or over-) estimates, of various probabilistic quantities, occur when a positively dependent distribution is assumed (falsely) to be the product of its marginals (that is, when two positively dependent random variables are assumed, falsely, to be independent). Specific applications in reliability theory, statistical mechanics and reversible Markov processes are discussed. This work was partially supported by National Science Foundation GP-30707X1. It is part of the author's Ph.D. dissertation prepared at the University of Rochester and supervised by A. W. Marshall. Now at Indiana University.     

Generators of some Ramanujan formulas

In this paper we prove some Ramanujan type formulas for 1/π but without using the theory of modular forms. Instead we use the WZ—method created by H. Wilf and D. Zeilberger and find some hypergeometric functions in two variables which are second components of WZ—pairs than can be certified using Zeilberger's EKHAD package. These certificates have an additional property which allows us to get generalized Ramanujan's type series which are routinely proven by computer. We call these second hypergeometric components of the WZ—pairs generators. Finding generators seems a hard task but using a kind of experimental research (explained below), we have succeeded in finding some of them. Unfortunately we have not found yet generators for the most impressive Ramanujan's formulas. We also prove some interesting binomial sums for the constant 1/π². Finally we rewrite many of the obtained series using pochhammer symbols and study the rate of convergence. 2000 Mathematics Subject Classification Primary—33C20