We study the statistical convergence and consistency of regularized Boosting methods, where the samples are not independent and identically distributed (i.i.d.) but come from empirical processes of stationary β-mixing sequences. Utilizing a technique that constructs a sequence of independent blocks close in distribution to the original samples, we prove the consistency of the composite classifi...

Consistency between collaborating components is notoriously difficult, even more so when a collaboration or the components are going to evolve dynamically, without any form of quiescence. For foreseen, non-migrating collaborations, the coordination modelling language Paradigm tackles the dynamic consistency problems by means of constraint orchestration. In case of migration, originally unforese...

We develop a framework for addressing correctness and timeliness-of-propagation issues for reactive constraints-global constraints or user-deened constraints that are implemented through constraint propagation. The notion of propagation completeness is introduced to capture timeliness of constraint propagation. A generalized form of arc-consistency is formulated which uniies many local consiste...

We prove uniform consistency of Random Survival Forests (RSF), a newly introduced forest ensemble learner for analysis of right-censored survival data. Consistency is proven under general splitting rules, bootstrapping, and random selection of variables-that is, under true implementation of the methodology. Under this setting we show that the forest ensemble survival function converges uniforml...

A globally consistent labeling is a compact representation of the complete solution space for a constraint satisfaction problem (CSP). Constraint satisfaction is NP-complete and so is the construction of globally consistent labelings for general problems. However, for binary constraints , it is known that when constraints are convex, path-consistency is suucient to ensure global consistency and...

Consistency conditions describe basic properties of graphs as e.g. the existence or uniqueness of certain elements. A graph grammar is consistent if the start graph satisses the consistency condition and the rules preserve this property. We propose a general construction that transforms global consistency conditions into preconditions for individual rules. A so-constructed rule is applicable to...

Consistency modeling for gene selection is a new topic emerging from our recent cancer bioinformatics research. We found that the result of classification or clustering on a training set was often quite different compared to using a testing set. Here, we address this as a consistency problem. In practice, the inconsistency of microarray datasets prevents many typical gene selection methods work...

Distributed applications and web services, such as online stores or social networks, are expected to be scalable, available, responsive, and fault-tolerant. To meet these steep requirements in the face of high round-trip latencies, network partitions, server failures, and load spikes, applications use eventually consistent datastores that allow them to weaken the consistency of some data. Howev...

In this paper we address the problem of consistency for cryptographic file systems. A cryptographic file system protects the users’ data from the file server, which is possibly untrusted and might exhibit Byzantine behavior, by encrypting the data before sending it to the server. The consistency of the encrypted file objects that implement a cryptographic file system relies on the consistency o...

Existing web proxy caches employ cache consistency mechanisms to ensure that locally cached data is consistent with that at the server. In this paper, we argue that techniques for maintaining consistency of individual objects are not sufficient—a proxy should employ additional mechanisms to ensure that related web objects are mutually consistent with one another. We formally define the notion o...