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.     

Fairness in Scheduling

On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper we explore the issue in settings where there are long-lived processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system. For any such instance we develop a notion ofdesiredload of a process, which is a function of the tasks it participates in. Theunfairnessof a system is the maximum, taken over all processes, of the difference between the desired load and the actual load.An example of such a setting is thecarpool problemsuggested by Fagin and Williams [IBM Journal of Research and Development27(2) (1983), 133–139]. In this problem, a set ofnpeople form a carpool. On each day a subset of the people arrive and one of them is designated as the driver. A scheduling rule is required so that the driver will be determined in a “fair” way.We investigate this problem under various assumptions on the input distribution. We also show that the carpool problems can capture several other problems of fairness in scheduling.     

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     

Rapid liquid chromatography-ultraviolet determination of organic acids and phenolic compounds in red wine and must

A reversed-phase liquid chromatography-ultraviolet (LC-UV) method is proposed for the rapid simultaneous analysis of the main carboxylic acids and polyphenols in must and wine. Good resolution was obtained for citric, tartaric, malic, lactic, acetic, caffeic, ellagic and gallic acids, (-)-epicatechin, quercetin and resveratrol. A novel silica-based column containing ether-linked phenyl groups, with polar end-capping and suitable for low-pH aqueous mobile phases was used and found to be superior to others tested. The method employed a mixture of 0.2% TFA in water and acetonitrile as eluents, showed linearity and precision, and was applied to samples of must and wine.     

Mass-spectrometric studies on alkylated 6-thiopurines

6-Thiopurine and its N- or C-alkyl derivatives all form an [M – 1]-ion upon fragmentation. In the 7-alkyl derivatives, this ion represents the major component of the spectrum. This is ascribed to formation of a five-membered thiazoline-like ring. Similar ring formation stabilises the [M – 1]-ion in the 7-methyl derivatives of hypoxanthine, adenine and 6-selenopurine.     

Thermal analysis characterization of isosorbide-containing thermosets

Sugar-based new monomers, polymers, and low molar mass additives have emerged as an exciting topic on green chemistry research, due to the worldwide focus on sustainable material. Isosorbide and its isomers, as ??Generally Recognized as Safe?? GRAS materials, possess unique stereochemistry and molecular geometry suitable for making cost-effective chemicals and polymers. With growing awareness of bisphenol A (BPA) as a xenoestrogen, isosorbide and its isomers holding the remarkable chemical properties and attractive price can be attached to glycidyl ether to make crosslinkable epoxy resin monomers with similar properties to BPA diglycidyl ether. By adding the hydrophobic functional group into the backbone of isosorbide epoxy or adjusting the amount and type of crosslinker, the mechanical properties and the water uptake ratios (from <1 to >50?wt%) of the isosorbide-derived epoxies could be optimized for different applications. The high water uptake epoxy with controllable biodegradation rate could be used as a drug delivery system or extracellular matrix for biomedical applications while the low water uptake epoxy with strong mechanical properties could be used for can coatings, bone cements, and other industrial additives and adhesives. The chemical structures and properties of the synthesized epoxy monomers and polymers were characterized by DSC, TG, and ¹H NMR.     

Analytic solution for the nondegenerate quantum control problem

We present an analytic solution for the nondegenerate quantum control problem, i.e., the transfer of a deliberate amount of population, 0%-100%, between arbitrary initial Psi(t)> and final Psi'(t)> states, which can be expanded in terms of nondegenerate energy eigenstates k>. The solution constitutes a robust two-photon multicomponent adiabatic passage, via an intermediate eigenstate 0>, which relies on three types of "null states."