We study the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that gossiping can be completed in O(D+ Δ log n logΔ−log log n ) time units in any ra...

Experimenting with Real-Time Specification Methods: The Model Multiplicity Problem Mor Peleg and Dov Dori Area of Information systems Engineering Faculty of Industrial Engineering and Management Technion, Israel Institute of Technology, Haifa 32000, Israel {mor, dori}@ie.technion.ac.il; Fax 972-4-8235194 , Tel: 972-4-8294409 / 2921 The Object-Process Methodology (OPM) specifies both graphically...

We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous resu...

ion-Based Interaction Model for Synthesis Hila Peleg, Shachar Itzhaky, and Sharon Shoham 1 Technion, {hilap,shachari}@cs.technion.ac.il 2 Tel Aviv University, [email protected] Abstract. Program synthesis is the problem of computing from a specification Program synthesis is the problem of computing from a specification a program that implements it. New and popular variations on the synthe...

Tree spanner problems have important applications in network design, e.g. in the telecommunications industry. Mathematically, there have been considered quite a number of maxstretch tree spanner problems and of average stretch tree spanner problems. We propose a unified notation for 20 tree spanner problems, which we investigate for graphs with general positive weights, with metric weights, and...

Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping problem in known topology radio networks where the schedule of transmissions is precomputed in advance based on full knowledge about the size and the topology of the network. In addition we consider the case where it ...

Recent years have witnessed several gram-negative bacteria (GNB) species and a few grampositive bacteria (especially the Staphylococcus aureus) posing overwhelming threats to the healthcare-associated infections as a series of frightening superbugs (Engel, 2010; Peleg & Hooper, 2010). It is primarily due to the fact that incidence of multidrug resistance (MDR) or pan-drug resistance (PDR) bacte...

We study global symmetries of generic 2D dilaton gravity models. Using a non-linear sigma model formulation we show that the unique theories admitting special conformal symmetries are the models with an exponential potential V ∝ e (S = 1 2π ∫ d2x √−g[Rφ+ 4λ2eβφ]), which include the model of Callan, Giddings, Harvey and Strominger (CGHS) as a particular though limiting (β = 0) case. These models...