نتایج جستجو برای: peleg
تعداد نتایج: 278 فیلتر نتایج به سال:
Carotenoids are known as provitamin A, while there is an increasing interest in their role as an antioxidants. Anti-cancer activity and other health benefits provided by β-carotene include the protection against cardiovascular disease and cataract prevention, Carrots are one of the best sources of β-carotene. In this paper we have studied the influence of particle size, temperature, solvents, s...
The moisture sorption isotherm of pea starch films prepared with various glycerol contents as plasticizer was investigated at different storage relative humidities (11%-96% RH) and at 5 ± 1, 15 ± 1, 25 ± 1 and 40 ± 1 °C by using gravimetric method. The results showed that the equilibrium moisture content of all films increased substantially above aw = 0.6. Films plasticized with glycerol, under...
The purpose of this paper is to present two examples of an economy possessing an optimum but no competitive equilibrium. Their essential features are having production and preferences over an infinite horizon; in fact, it seems similar examples may not occur in overlapping generations and/or pure exchange models. There is a growing literature of equilibrium existence theorems in this field. We ...
A method is described of extracting linear features from images. The approach is to construct a series of lower-resolution versions of the original image (a pyramid), and to look for lines in these images. A line in a low-resolution image corresponds to a thicker linear feature in a high-resolution image. The position and extent of this linear feature is calculated from the low-resolution image...
This paper considers the question of the in uence of a coalition of vertices seeking to gain control or majority in local neighborhoods in a general graph Say that a vertex v is controlled by the coalition M if the majority of its neighbors are fromM We ask how many vertices as a function of jM j can M control in this fashion Upper and lower bounds are provided for this problem as well as for c...
We propose faster algorithms for the following three optimization problems on n collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1. Maximizing total area of disjoint disks: In this problem the goal is to maximize the total area of nonoverlapping disks centered at the points. Acharyya, De, and Nandy (2017) presented an O(n)-tim...
Robots with lights is a model of autonomous mobile computational entties operating in the plane in Look-Compute-Move cycles: each agent has an externally visible light which can assume colors from a fixed set; the lights are persistent (i.e., the color is not erased at the end of a cycle), but otherwise the agents are oblivious. The investigation of computability in this model, initially sugges...
We present a faster distributed broadcasting primitive for the classical radio network model. The most basic distributed radio network broadcasting primitive called Decay dates back to a PODC’87 result of Bar-Yehuda, Goldreich, and Itai. In any radio network with some informed source nodes, running Decay for O(d logn+ log n) rounds informs all nodes at most d hops away from a source with high p...
We devise new algorithms for the single-source shortest paths (SSSP) problem in the CONGEST model of distributed computing. While close-to-optimal solutions, in terms of the number of rounds spent by the algorithm, have recently been developed for computing SSSP approximately, the fastest known exact algorithms are still far away from matching the lower bound of Ω̃( √ n +D) rounds by Peleg and R...
This paper re-visits the popular Qumrân-centric narrative as first formulated and introduced by Roland de Vaux in 1950s. Although not totally implausible, primary claims of this currently, leading hypothesis seem to be scientifically falsifiable on a number counts. In addition, other important seemingly underestimated evidence, better assists describing an alternative reconstruction Khirbet-Qum...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید