searching efficiency (a') (attack rate) and handling time are two major components of natural enemies’ functional response and are usually used to evaluate their effectiveness. the age-specific searching efficiency of aphidoletes aphidimyza (rondani) was studied during its larval stage. the experiment was conducted in terms of age-specific functional response to the varying density (5, 1...

In this article we study a channel with arbitrarily varying channel probability functions in the presence of a noiseless feedback channel (a. v. ch. f.). We determine its capacity by proving a coding theorem and its strong converse. Our proof of the coding theorem is constructive; we give explicitly a coding scheme which performs at any rate below the capacity with an arbitrarily small decoding...

In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a p...

Time-varying networks describe a wide array of systems whose constituents and interactions evolve over time. They are defined by an ordered stream of interactions between nodes, yet they are often represented in terms of a sequence of static networks, each aggregating all edges and nodes present in a time interval of size Δt. In this work we quantify the impact of an arbitrary Δt on the descrip...

Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

Different graph generalizations have been recently used in an ad-hoc manner to represent multilayer networks, i.e. systems formed by distinct layers where each layer can be seen as a network. Similar constructions have also been used to represent time-varying networks. We introduce the concept of MultiAspect Graph (MAG) as a graph generalization that we prove to be isomorphic to a directed grap...