Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

Numerical thermo-elastic analysis of singularities in two-dimensions

Linear elastic two-dimensional problems with singular points subjected to steady-state temperature distribution are considered. The stress tensor in the vicinity of the singular points exhibits singular behavior characterized by the strength of the singularity and the associated thermal stress intensity factors (TSIFs). It is shown that the TSIFs and the strength of the stress singularity can be obtained using the principle of complementary energy together with the modified Steklov method and the p-version of the finite element method. Importantly, the proposed method is applicable not only to singularities associated with crack tips, but also to multi-material interfaces and non-homogeneous materials. Numerical results of crack-tip singularities in a rectangular plate and singular points associated with a two-material inclusion are presented.Research performed while the author served as a visiting assistant professor at the Center for Computational Mechanics, Washington University, St. Louis, Missouri 63130, USA.     

Constructing Pseudo-Random Permutations with a Prescribed Structure

We show how to construct pseudo-random permutations that satisfy a certain cycle restriction, for example that the permutation be cyclic (consisting of one cycle containing all the elements) or an involution (a self-inverse permutation) with no fixed points. The construction can be based on any (unrestricted) pseudo-random permutation. The resulting permutations are defined succinctly and their evaluation at a given point is efficient. Furthermore, they enjoy a fast forward property, i.e. it is possible to iterate them at a very small cost. Received 10 August 2000 and revised 30 September 2000 Online publication 9 April 2001     

Crack onset at a v-notch. Influence of the notch tip radius

A criterion to predict crack onset at a sharp notch in homogeneous brittle materials has been presented in a previous paper of one of the authors. It is reviewed and improved herein. It fulfils both the energy and the strength criteria and takes an Irwin-like form involving the generalized intensity factor of the singularity governing the elastic behaviour in the vicinity of a notch tip. The prediction agrees fairly well with the experiments although it slightly underestimates the experimental measures. A cause of this discrepancy can be that a small notch tip radius blunts the sharp corner. It is analysed in this paper by means of matched asymptotics involving 2 small parameters: a micro-crack increment length and the notch tip radius. A correction is brought to the initial prediction and a better agreement is obtained with experiments on PMMA notched specimens. Experiments performed on a stiffer material (Alumina/Zirconia) show that it is less sensitive to small notch tip radii. A remaining small discrepancy between experiments and predictions can be due to some non linear behaviour of the materials near the notch tip. In addition, without new developments, the method allows to determine the stress intensity factor at the tip of a short crack emanating from a sharp or a rounded v-notch.     

Effects of long-term testosterone, gonadotropin-releasing hormone agonist, and pimozide treatments on gonadotropin II levels and ovarian development in juvenile female striped bass (Morone saxatilis)

The ability of the juvenile female reproductive axis to respond to hormonal stimulation was investigated in a Perciform fish, the striped bass (Morone saxatilis) using various combinations of testosterone (T), GnRH agonist (GnRHa), and pimozide. A long-term treatment with T alone, or T in combination with GnRHa, increased pituitary gonadotropin II (GtH II) levels 2- and 3-fold, respectively, suggesting that T and GnRHa each stimulate GtH II accumulation. Release of the accumulated GtH II could be induced only by high doses of GnRHa in combination with T, indicating that GtH II synthesis and release require different levels of GnRH stimulation. The addition of the dopamine antagonist pimozide did not affect pituitary and plasma GtH II levels but, in response to an additional acute GnRHa challenge, inhibited the release of GtH II. Although ovarian development was slightly stimulated by a combined T and GnRHa treatment, vitellogenesis was generally not initiated. The present study demonstrated that the juvenile striped bass pituitary is responsive to hormonal stimulation, resulting in elevated levels of GtH II in the pituitary and plasma. However, increased plasma levels of GtH II did not result in precocious puberty, suggesting that additional factors are required for the initiation of ovarian development in this teleost.     

Deductive verification of alternating systems

Alternating systems are models of computer programs whose behavior is governed by the actions of multiple agents with, potentially, different goals. Examples include control systems, resource schedulers, security protocols, auctions and election mechanisms. Proving properties about such systems has emerged as an important new area of study in formal verification, with the development of logical frameworks such as the alternating temporal logic ATL*. Techniques for model checking ATL* over finite-state systems have been well studied, but many important systems are infinite-state and thus their verification requires, either explicitly or implicitly, some form of deductive reasoning. This paper presents a theoretical framework for the analysis of alternating infinite-state systems. It describes models of computation, of various degrees of generality, and alternating-time logics such as ATL* and its variations. It then develops a proof system that allows to prove arbitrary ATL* properties over these infinite-state models. The proof system is shown to be complete relative to validities in the weakest possible assertion language. The paper then derives auxiliary proof rules and verification diagrams techniques and applies them to security protocols, deriving a new formal proof of fairness of a multi-party contract signing protocol where the model of the protocol and of the properties contains both game-theoretic and infinite-state (parameterized) aspects.     

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles

We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several protocols that achieve these goals. Broadly speaking, the protocols are either cryptographic or physical. By a cryptographic protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the protocol relies on computational hardness. By a physical protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our physical protocols utilize items such as scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic protocols are direct and efficient, and do not involve a reduction to other problems. The physical protocols are meant to be understood by “lay-people” and implementable without the use of computers. Research of R. Gradwohl was supported by US-Israel Binational Science Foundation Grant 2002246. Research of M. Naor was supported in part by a grant from the Israel Science Foundation. Research of B. Pinkas was supported in part by the Israel Science Foundation (grant number 860/06). Research of G.N. Rothblum was supported by NSF grant CNS-0430450 and NSF grant CFF-0635297.     

A quantum mechanical model of consciousness and the emergence of ‘I’

There have been suggestions that the unity of consciousness may be related to the kind of holism depicted only in quantum physics. This argument will be clarified and strengthened. It requires the brain to contain a quantum system with the right properties — a Bose-Einstein condensate. It probably does contain one such system, as both theory and experiment have indicated. In fact, we cannot pay full attention to a quantum whole and its parts simultaneously, though we may oscillate between the two. In a quantum theory of consciousness, emergent meanings arise as an inevitable consequence of Heisenberg's Uncertainty Principle.     

Polite Combination of Algebraic Datatypes

Journal of Automated Reasoning - Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its...     

Verifying Temporal Properties of Reactive Systems: A STeP Tutorial

We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions of the Bakery Mutual exclusion algorithm for mutual exclusion. We verify the classic two-process algorithm and simple variants, as well as an atomic parameterized version. The methods used include deductive verification rules, verification diagrams, automatic invariant generation, and finite-state model checking and abstraction.