You said it before and you'll say it again: Expectations of consistency in communication.

Repeated reference creates strong expectations in addressees that a speaker will continue to use the same expression for the same object. The authors investigate the root reason for these expectations by comparing a cooperativeness-based account (Grice, 1975) with a simpler consistency-based account. In two eye-tracking experiments, the authors investigated the expectations underlying the effect of precedents on comprehension. The authors show that listeners expect speakers to be consistent in their use of expressions even when these expectations cannot be motivated by the assumption of cooperativeness. The authors conclude that though this phenomenon seems to be motivated by cooperativeness, listeners' expectation that speakers be consistent in their use of expressions is governed by a general expectation of consistency. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Measuring efficiency of power plants in Israel by data envelopmentanalysis

An application of data envelopment analysis (DEA) for measuring and evaluating the operating efficiency of power plants in the Israeli Electric Corporation (IEC) is presented. Emphasis is placed on the process of screening the list of potential input and output factors and determining the most relevant ones. Special attention is given to the qualitative factor concerning air pollution, which is treated as a categorical variable. The incorporation of `standard data' is examined and the results are analyzed     

Modeling the Combining Site of the Human Asialoglycoprotein Receptor

A model for the carbohydrate recognition domain (CRD) and combining site of the human asialoglycoprotein (ASGP) receptor has been computed on the basis of the close sequence homology with the mannose-binding lectin (MBP), whose three-dimensional structure in complex with a ligand has been determined by crystallographic methods (Weis, W.I.; Drickamer, K.; Hendrickson, W.A. Nature 1992, 360: 127). Within the limitations of modeling methods, the model is compatible with data on ligand binding of the family C-type lectins, of which the MBP and the ASGP receptor are members. The model derived can serve as a guide for designing site-directed mutagenesis experiments in order to further elucidate the origins of specificity of the ASGP receptor toward galactose. In particular, the model focuses attention on the possible role of position 207 (MBP sequence numbering) in promoting galactose binding.     

From data to knowledge: The interaction between data management systems in educational institutions and the delivery of quality education

No school is an island; it is a part of a continuum or a pipeline of institutions which together form an educational pipeline through which groups of students pass. To turn a body of data into useful information for knowledge-based decision-making at any level, data must be collected, organised, analysed and reflected upon. The purpose of this paper is to discuss how schools and other educational institutions can not only collect better data but learn how to transform that data so that the information held within can be effectively shared among all stakeholders. This process will help to ensure that the school and the entire education system provide a more seamless and effective educational pipeline for students, and ultimately improve the quality of education delivered in the country as a whole.     

Nondestructive quality evaluation of fresh prunes by NMR spectroscopy

The potential for utilizing nuclear magnetic resonance measurements for evaluating the quality of fresh prunes was investigated. In a 2 T magnetic flux density, the chemical shift between proton hydrogens of soluble solids and those of water is less than 100 Hz. The band width of the water resonance spectrum of fruits is relatively large and therefore it is difficult to resolve between the spectral peaks of water and soluble solids. Measurements with a 100 mm Birdcage coil failed to resolve between the resonance peaks of soluble solids and water. Good resolution was achieved with a 20 mm diameter Surface coil. Signals (free induction decay) of 30 sugar prunes were acquired, and the spectra were calculated. Tuning and matching the coil before each measurement were not necessary, and the results were better when the magnetic field was not shimmed. The ratio of the soluble solids peak height to the water peak height correlated well (r = 0.907) with the soluble solids content of the prunes, as estimated by a refractometer.     

Selecting sites for new settlements in arid lands: Negev case study

Arid Land stressful conditions require careful selection of the urban site. The MRRC (method of rating regional cells) uses a systematic and consistent procedure to determine the preferable areas for a site. After defining goals and objectives, determining the type of settlement to be sited, delineating regional borders, and eliminating obviously unsuitable areas, the remainder is divided into equal, square cells. Primary criteria to be mapped would include climatic comfort, physiographic, hydrologic, environmental quality, and accessibility and proximity to supplies. Values are assigned to each criterion in relation to the values assigned to all other criteria. A series of maps equal in number to the number of primary criteria is compiled by assigning numerical values to each cell, for each criterion in turn. By overlayment of maps, a professional interdisciplinary team can determine the highly rated cells from which the most suitable areas for the new settlement may be chosen. Consideration of an endless number of criteria is possible, and MRRC may be adapted for computerization.     

Combinatorial Optimization and Performance Analysis of a Multi-arm Cartesian Robotic Fruit Harvester—Extensions of Graph Coloring

A mobile melon robotic harvester consisting of multiple Cartesian manipulators, each with three degrees of freedom, is being developed. In order to design an optimal robot in terms of number of arms, manipulator capabilities, and robot speed, a method of allocating the fruits to be picked by each manipulator in a way that yields the maximum harvest has been developed. Such a method has already been devised for a multi-arm robot with 2DOF each. The maximum robotic harvesting problem was shown there to be an example of the maximum k-colorable subgraph problem (MKCSP) on an interval graph. However, for manipulators with 3DOF, the additional longitudinal motion results in variable intervals. To overcome this issue, we devise a new model based on the color-dependent interval graph (CDIG). This enables the harvest by multiple robotic arms to be modeled as a modified version of the MKCSP. Based on previous research, we develop a greedy algorithm that solves the problem in polynomial time, and prove its optimality using induction. As with the multi-arm 2DOF robot, when simulated numerous times on a field of randomly distributed fruits, the algorithm yields a nearly identical percentage of fruit harvested for given robot parameters. The results of the probabilistic analysis developed for the 2DOF robot was modified to yield a formula for the expected harvest ratio of the 3DOF robot. The significance of this method is that it enables selecting the most efficient actuators, number of manipulators, and robot forward velocity for maximal robotic fruit harvest.     

Guaranteeing the Diversity of Number Generators

A major problem in using iterative number generators of the form x_i=f(x_i−1) is that they can enter unexpectedly short cycles. This is hard to analyze when the generator is designed, hard to detect in real time when the generator is used, and can have devastating cryptanalytic implications. In this paper we define a measure of security, called sequence diversity, which generalizes the notion of cycle-length for noniterative generators. We then introduce the class of counter-assisted generators and show how to turn any iterative generator (even a bad one designed or seeded by an adversary) into a counter-assisted generator with a provably high diversity, without reducing the quality of generators which are already cryptographically strong.     

Tell Me Who I Am: An Interactive Recommendation System

We consider a model of recommendation systems, where each member from a given set of players has a binary preference to each element in a given set of objects: intuitively, each player either likes or dislikes each object. However, the players do not know their preferences. To find his preference of an object, a player may probe it, but each probe incurs unit cost. The goal of the players is to learn their complete preference vector (approximately) while incurring minimal cost. This is possible if many players have similar preference vectors: such a set of players with similar “taste” may split the cost of probing all objects among them, and share the results of their probes by posting them on a public billboard. The problem is that players do not know a priori whose taste is close to theirs. In this paper we present a distributed randomized peer-to-peer algorithm in which each player outputs a vector which is close to the best possible approximation of the player’s real preference vector after a polylogarithmic number of rounds. The algorithm works under adversarial preferences. Previous algorithms either made severely limiting assumptions on the structure of the preference vectors, or had polynomial overhead. Research of N. Alon supported in part by the Israel Science Foundation and by the Von Neumann Fund. B. Awerbuch supported by NSF grants ANIR-0240551, CCF-0515080 and CCR-0311795. Research of Y. Azar supported in part by the German-Israeli Foundation and by the Israel Science Foundation. Research of B. Patt-Shamir supported in part by Israel Ministry of Science and Technology and by the Israel Science Foundation (grant 664/05).