As shown by Peleg (1993), the core of market games is characterized by nonemptiness, individual rationality, superadditivity, the weak reduced game property, the converse reduced game property, and weak symmetry. It was not known whether weak symmetry was logically independent. With the help of a certain transitive 4-person TU game, it is shown that weak symmetry is redundant in this result. He...

The moisture sorption isotherms of Clinacanthus nutans (C. nutans) herbal leaves were established at three different temperatures 30°C, 40°C, and 50°C, water activity between 0.3–0.9 using a static gravimetric method. results showed that equilibrium content C. increased with increasing constant temperature for both desorption adsorption isotherms. In contrast, the decreased when all exhibited T...

In this paper we propose a technique that reconstructs high-resolution images with improved super-resolution algorithms, based on Irani and Peleg iterative method, and employs our suggested initial interpolation, robust image registration, automatic image selection and image enhancement post-processing. When the target of reconstruction is a moving object with respect to a stationary camera, hi...

We show that every permutation graph with n elements can be preprocessed in O(n) time, if two linear extensions of the corresponding poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The datastructure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bits so that distance queries between any two v...

Motivated by the peer-to-peer content sharing systems in large-scale networks, we will study interval routing schemes in ErdösRényi random graphs. C. Gavoille and D. Peleg [13] posed an open question of whether almost all networks support a shortest-path interval routing scheme with 1 interval. In this paper, we answer this question partially by proving that in almost all networks, there is an ...

A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic of Harel. Kozen and Parikh. and is close in spirit to the logic R of Hare1 and Peleg. It enjoys most of the advantages of previous process logics. yet is decidable in elementary tlmc. We also ofrcr ext...

A game on a convex geometry was introduced by Bilbao as a model of partial cooperation. We investigate some properties of the core of a game on a convex geometry. First, we show that if a game is quasi-convex, then the core is stable. This result can be seen as an extension of a result by Shapley for traditional cooperative games. Secondly, we show the core on the class of balanced games on a c...

We address the problem of labeling the nodes of a tree such that one can determine the identifier of the least common ancestor of any two nodes by looking only at their labels. This problem has application in routing and in distributed computing in peer-to-peer networks. A labeling scheme using Θ(log n)-bit labels has been previously presented by Peleg. By engineering this scheme, we obtain a v...

Maintaining a balanced load is of fundamental importance on any parallel computer, since a strongly imbalanced load often leads to low processor utilization. This paper considers two load balancing operations: Balance and MultiBalance. The Balance operation corresponds to the token distribution problem considered by Peleg and Upfal 9] for certain expander networks. The MultiBalance operation ba...

We introduce a theory of competitive analysis for distributed algorithms. The first steps in this direction were made in the seminal papers of Bartal, Fiat, and Rabani [18], and of Awerbuch, Kutten, and Peleg [16], in the context of data management and job scheduling. In these papers, as well as in other subsequent work [4, 15, 19, 14], the cost of a distributed algorithm is compared to the cos...