The resource limited nature of WSNs require that protocols implemented on these networks be energy-efficient, scalable and distributed. This paper presents an analysis of a novel combined routing and MAC protocol. The protocol achieves energy-efficiency by minimizing signaling overhead through state-less routing decisions that are made at the receiver rather than at the sender. The protocol dep...

Deep generative models such as deep latent Gaussian models (DLGMs) are powerful and popular density estimators. However, they have been applied almost exclusively to dense data such as images; DLGMs are rarely applied to sparse, high-dimensional integer data such as word counts or product ratings. One reason is that the standard training procedures find poor local optima when applied to such da...

The majority of the literature on the psychology of gains and losses suggests that losses lead to an avoidance response. Several studies, however, have shown that losses can also lead to an approach response, whereby an option is selected more often when it produces losses. In five studies we examine the boundary conditions for these contradictory approach and avoidance effects. The results sho...

This paper presents a simple and locally optimal test for Zipf’s law. Its use is illustrated in the case of the largest US metropolitan areas. An objection to the general relevance of that law is also presented.  2000 Elsevier Science S.A. All rights reserved.

Escaping local optima and crossing fitness valleys to reach higher-fitness regions of a fitness landscape is a ubiquitous concept in much writing on evolutionary difficulty. The Baldwin effect, an interaction between non-heritable lifetime plasticity (e.g. learning) and evolution, has been shown to be able to guide evolutionary change and ‘smooth out’ abrupt fitness changes in fitness landscape...

This paper discusses some of the relevant steps towards optimum face recognition in the framework of decision theory. In particular, it addresses the central question, how to estimate joint image probability distributions based on a strongly limited number of example images. This leads to a new, morphing based approach which combines varying view, varying illumination, and inter-personal variat...

In this paper we search for the optimum tests that minimize the sum of two error probabilities.

Chu and Liu, Ecbnonds, and Bock have independently devised an ef f ic ient aZgorYithm to f i n d an optimum branching i n a d i rected haph. runs i n O(m2ogn) time i f the problem graph has n vertices and m edges. A modification for dense graphs gives a running time 2 of O(n 1. We also show that the unmodified algorithm runs i n 2 O(n(Zog n) + m) time on an average graph, asswning a uniform pro...

The optimum Runge-Kutta method of a particular order is the one whose truncation error is a minimum. Various measures of the size of the truncation error are considered. The optimum method is practically independent of the measure being used. Moreover, among methods of the same order which one might consider using the difference in size of the estimated error is not more than a factor of 2 or 3...

H E preceding paper by DEMPSTER and LERNER has presented the results T obtained in the determination of expected genetic gains in egg production under different age compositions of a breeding flock. In it the theoretical and practical consequences of following a given breeding plan were emphasized but the statistical model on which the computations were based was not presented. The purpose of t...