Syverson points out the security of anonymous communication systems is most often characterized by indistinguishability among a set of honest parties in a protocol. In the entropist conception, we may quantify the security of a protocol in terms of the size of the set. According to Syverson, the number of ORs (“onion routers”) in the Tor network is most often used to quantify its security [3]. ...

We report here on a detailed quantitative analysis of distributional language data of both Italian and Czech, highlighting the relative contribution of a number of distributed grammatical factors to sentence-based identification of subjects and direct objects. The work is based on a Maximum Entropy model of stochastic resolution of grammatical conflicting constraints, and is demonstrably capabl...

This paper studies the impact of written language variations and the way it affects the capitalization task over time. A discriminative approach, based on maximum entropy models, is proposed to perform capitalization, taking the language changes into consideration. The proposed method makes it possible to use large corpora for training. The evaluation is performed over newspaper corpora using d...

Children born at the end of the academic year have lower educational attainment, on average, than those born at the start of the academic year. Previous research shows that the difference is most pronounced early in pupils’ school lives, but remains evident and statistically significant in high-stakes exams taken at the end of compulsory schooling. To determine the most appropriate policy respo...

It is proved for fermi systems that each translationally invariant state co with square integrable correlation functions approaches a limit under the free time evolution. The limit state is the gauge invariant quasi-free state with the same two-point function as co and it is characterized by a maximum entropy principle. Various properties of the limit are discussed, and the extension of the res...

The aim of the present paper is to investigate the behavior of a single-input single-unit system, learning through the maximum-entropy principle, in order to understand some formal property of Bell-Sejnowski’s PDF-matching neuron. The general learning equations are presented and two casestudy are discussed with details.

Abstract This paper proposes a novel method for learning probabilistic models of subcategorization preference of verbs. Especially, we propose to consider the issues of case dependencie~ and noun class generalization in a uniform way. We adopt the maximum entropy model learn~,g method and apply it to the task of model learning of subcategorization preference. Case dependencies and noun class ge...

In this paper we maximize the utility of a structural model of the demand for multi-destination non-work travel using maximum entropy method introduced by Shanon. A utility value is assigned when only partial information is available about the decision maker’s preferences. The maximum entropy utility solution embeds a large family of utility functions that includes the most commonly used functi...

WSN is a distributed network exposed to an open environment, which is vulnerable to malicious nodes. To find out malicious nodes among a WSN with mass sensor nodes, this paper presents a malicious detection method based on maximum entropy model. Given the types of a few sensor nodes, it extracts sensor nodes’ preferences related with the known types of malicious node, establishes the maximum en...

We consider the problem of estimating the population probability distribution given a finite set of multivariate samples, using the maximum entropy approach. In strict keeping with Jaynes’ original definition, our precise formulation of the problem considers contributions only from the smoothness of the estimated distribution (as measured by its entropy) and the loss functional associated with ...