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.     

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     

What Did Freud Say About Persons and Relations?

History is bunk, declared Henry Ford; he wanted to sell new cars every year. For psychoanalysis history is not bunk; it is its very heart and guts. Like an individual or a nation, psychoanalysis lives its history and rediscovers it in every generation. Psychoanalytic pioneers, authors of new rallying cries and new theories, seem to think otherwise: History of psychoanalysis begins with them. The author suggests a different approach: to see the new as a historical continuity of the old. The advocates of the relational approach in psychoanalysis will be surprised to hear that Freud was a Sullivanian, even though--like the proverbial M. Jourdain who never heard the word prose--he never heard of the word interpersonal. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Outdoor attractancy of males ofMatsucoccus josephi (Homoptera: Matsucoccidae) andElatophilus hebraicus (Hemiptera: Anthocoridae) to synthetic female sex pheromone ofMatsucoccus josephi

The active component of the sex pheromone ofMatsucoccus josephi is (2E,6E,8E)-5,7-dimethyl-2,6,8-decatrien-4-one; the chemical is also a powerful kairomone of adult males and females of the bugElatophilus hebraicus the principal predator ofM. josephi. The presence of theZ isomer (2E,6Z,8E)-5,7-dimethyl-2,6,8-decatrien-4-one does not interfere with the attractancy of the activeE component forM. josephi males or the bug. Our results show a clear dose-response between trap catch ofM. josephi males andE. hebraicus. Conversely, increasing amounts of theZ isomer in the mixture did not affect the attraction of the scale insect males or the bug. The catch ofM. josephi males did not differ significantly among traps of different color, and was significantly higher with traps attached to the tree trunk than those suspended between trees. Comparison of the catch ofM. josephi among the three forests and between pine species suggests that the level of infestation ofPinus halepepsis andPinus brutia ssp.brutia is similar, despite the fact that the latter pine is resistant to the scale insect. Both sexes ofE. hebraicus were trapped in much lower numbers at the more infested sites. This may be related to interference with the activity ofE. hebraicus due to deterioration and drying of parts of the tree crowns and heavy colonization by generalist predators in injured trees.     

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.     

Using artificial neural networks to detect unknown computer worms

Detecting computer worms is a highly challenging task. We present a new approach that uses artificial neural networks (ANN) to detect the presence of computer worms based on measurements of computer behavior. We compare ANN to three other classification methods and show the advantages of ANN for detection of known worms. We then proceed to evaluate ANN’s ability to detect the presence of an unknown worm. As the measurement of a large number of system features may require significant computational resources, we evaluate three feature selection techniques. We show that, using only five features, one can detect an unknown worm with an average accuracy of 90%. We use a causal index analysis of our trained ANN to identify rules that explain the relationships between the selected features and the identity of each worm. Finally, we discuss the possible application of our approach to host-based intrusion detection systems.     

Molecular recognition in the sphingosine 1-phosphate receptor family

Computational modeling and its application in ligand screening and ligand receptor interaction studies play important roles in structure-based drug design. A series of sphingosine 1-phosphate (S1P) receptor ligands with varying potencies and receptor selectivities were docked into homology models of the S1P(1-5) receptors. These studies provided molecular insights into pharmacological trends both across the receptor family as well as at single receptors. This study identifies ligand recognition features that generalize across the S1P receptor family, features unique to the S1P(4) and S1P(5) receptors, and suggests significant structural differences of the S1P(2) receptor. Docking results reveal a previously unknown sulfur-aromatic interaction between the S1P(4) C5.44 sulfur atom and the phenyl ring of benzimidazole as well as pi-pi interaction between F3.33 of S1P(1,4,5) and aromatic ligands. The findings not only confirm the importance of a cation-pi interaction between W4.64 and the ammonium of S1P at S1P(4) but also predict the same interaction at S1P(5). S1P receptor models are validated for pharmacophore development including database mining and new ligand discovery and serve as tools for ligand optimization to improve potency and selectivity.     

Effect of near-critical swirl on the Burke-Schumann reaction sheet

The influence of swirl on the shape of the Burke-Schumann reaction sheet in a straight cylindrical pipe is investigated by asymptotic and numerical means. Attention is confined to swirl levels that are near the critical value at which vortex breakdown occurs. A high-Reynolds-number, laminar, isothermal, low-Mach-number reacting flow is considered. An asymptotic analysis is developed to study the nonlinear interaction between near-critical swirl and mixture fraction distribution within the flow. It is first shown that leading-order perturbation of the velocity field from the columnar state, generated by the interaction of near-critical swirl and low viscosity, can be described by a nonlinear reduced-order model. This flow perturbation is computed, and then employed to determine the correction to the classical Burke-Schumann solution. Under lean conditions of reaction the reaction sheet becomes shorter and more compact as swirl is increased. For rich conditions of reaction, increasing swirl first causes the reaction-sheet length to decrease, and then increase after vortex breakdown has appeared. Numerical simulations of the flow and reaction-zone shape are substantiated by, and supplement, the asymptotic results.     

Enhancing the performance of hybrid genetic algorithms by differential improvement

A differential improvement modification to Hybrid Genetic Algorithms is proposed. The general idea is to perform more extensive improvement algorithms on higher quality solutions. Our proposed Differential Improvement (DI) approach is of rather general character. It can be implemented in many different ways. The paradigm remains invariant and can be easily applied to a wider class of optimization problems. Moreover, the DI framework can also be used within other Hybrid metaheuristics like Hybrid Scatter Search algorithms, Particle Swarm Optimization, or Bee Colony Optimization techniques.     

Spider Silk-CBD-Cellulose Nanocrystal Composites: Mechanism of Assembly

The fabrication of cellulose-spider silk bio-nanocomposites comprised of cellulose nanocrystals (CNCs) and recombinant spider silk protein fused to a cellulose binding domain (CBD) is described. Silk-CBD successfully binds cellulose, and unlike recombinant silk alone, silk-CBD self-assembles into microfibrils even in the absence of CNCs. Silk-CBD-CNC composite sponges and films show changes in internal structure and CNC alignment related to the addition of silk-CBD. The silk-CBD sponges exhibit improved thermal and structural characteristics in comparison to control recombinant spider silk sponges. The glass transition temperature (Tg) of the silk-CBD sponge was higher than the control silk sponge and similar to native dragline spider silk fibers. Gel filtration analysis, dynamic light scattering (DLS), small angle X-ray scattering (SAXS) and cryo-transmission electron microscopy (TEM) indicated that silk-CBD, but not the recombinant silk control, formed a nematic liquid crystalline phase similar to that observed in native spider silk during the silk spinning process. Silk-CBD microfibrils spontaneously formed in solution upon ultrasonication. We suggest a model for silk-CBD assembly that implicates CBD in the central role of driving the dimerization of spider silk monomers, a process essential to the molecular assembly of spider-silk nanofibers and silk-CNC composites.