We propose an approach to achieving different K-partition for preserving privacy by using the multiconstraint anonymous parameter design method based on the attribute significance of rough set, in order to reduce the imbalance phenomenon between the privacy protection and data availability caused by adopting the same anonymous intensity. In this approach, taking into account the significance of...

Ensemble learning with output from multiple supervised and unsupervised models aims to improve the classification accuracy of supervised model ensemble by jointly considering the grouping results from unsupervised models. In this paper we cast this ensemble task as an unconstrained probabilistic embedding problem. Specifically, we assume both objects and classes/clusters have latent coordinates...

The main goal of these notes is to describe a proof of quantitative nondivergence estimates for quasi-polynomial trajectories on the space of lattices, and show how estimates of this kind are applied to some problems in metric Diophantine approximation.

We prove a Bernstein type inequality for multivariate quasipolynomials and apply it to carry out the following results. (1) The evaluation of the uniform norm for a quasipolynomial on a convex body V/R by that on a measurable subset of V. (2) The estimate of the BMO-norm for a quasipolynomial in terms of its degree and exponential type. (3) The reverse Ho lder inequality with a dimensionless co...

In this paper we give a formalization of the problem of locally detecting the global termination of distributed algorithms on graphs. We introduce the notion of quasi k?coverings. Using (quasi) k?coverings, we present methods for showing that it is not possible to detect locally the global termination of local computations in certain families of graphs. These methods also allow to show that som...

In the presented paper, we address a problem of the appropriate setting of a parameter in a selected quasipolynomial with two delay elements in order to ensure that all its zeros are located in the open left-half complex plane. The quasipolynomial can represent the dynamics of a system with internal delays and thus it can decide about system stability. In contrast to many other analyses, a non-...

We prove that the families matrix powering, iterated matrix product, and adjoint matrix are VQP–complete, where VQP denotes Valiant’s class of quasipolynomial–computable families of multivariate polynomials. This proves a conjecture by Bürgisser [3, Conjecture 8.1].