This is the first paper on constructive concurrent dynamic logic (CCDL). For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on...

Consistency and optimality together with converse consistency provide an illuminating and novel characterization of the equilibrium concept (Peleg and Tijs, 1996). But (together with non-emptiness) they preclude refinements of the equilibrium notion and selection of a unique equilibrium (Norde et al., 1996). We suggest two escape routes: By generalizing the concept of strict equilibrium we ques...

Acinetobacter baumannii is highly resistant pathogen and widely distributed in different hospitals as nosocomial pathogen (Ian et al., 2016). This is mostly isolated from intensive care units. In the last decades, the emergence and rapid spread of Multidrug-resistant A. baumannii have caused a serious clinical problem worldwide (Peleg et al., 2008). In a developing country concerns about the hi...

Distance labeling is a preprocessing technique introduced by Peleg [Journal of Graph Theory, 33(3)] to speed up distance queries in large networks. Herein, each vertex receives a (short) label and, the distance between two vertices can be inferred from their two labels. One such preprocessing problem occurs in the hub labeling algorithm [Abraham et al., SODA’10]: the label of a vertex v is a se...

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 presented by Peleg. By engineering this scheme and a new one due to the ...

in this research, the effect of ultrasound-osmotic dehydration process in different conditions on the drying kinetics parameters of rhubarb was investigated. before dying process, rhubarb samples were placed in contact of ultrasound-osmotic pretreatment and then dried by convection hot air dryer equipped with circulated fan. the results showed that using osmotic pretreatment at 40% sucrose solu...

This study aimed to determine the phenomenon during sorption on whole dried and powder butterfly pea under room temperature storage. In addition, identified thermodynamics, hygroscopicity, degree of caking, physicochemical properties quality pea. Experiments applied static gravimetric method by saturated salt at 13-27oC. The results found that best model was Peleg Model. increase in aw affects ...

(Fraigniaud et al., 2001) and independently (Thorup et al., 2001) show that n-node trees support routing schemes with message headers, node addresses, and routing tables of O(log n) bits. It still open to known if this optimal result can be extended to the tree-width two graphs. The best known routing scheme require O(log n) bits (cf. (Peleg, 2000)). In this article, we extend this optimal resu...

The quality of preserved food is largely dependent on its moisture content, moisture migration and/or moisture uptake of the food during storage. Therefore, the water activity level, which corresponds to a range of equilibrium moisture contents, must be determined by, for example, the use of moisture isotherms. The shape of the isotherm curve is dependent on the interactions between the vapour ...

Résumé—Fraigniaud et al. [1] et indépendamment Thorup et al. [2] ont montré que tout arbre à n nœuds possède un schéma de routage de plus courts chemins utilisant des adresses, des entêtes et des tables de routage de O(log n) bits. Il est toujours ouvert de savoir si ce résultat optimal peut être étendu ne seraitce qu’aux réseaux de largeur arborescente deux dont la meilleure borne connue, due ...