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)     

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.     

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.     

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.     

Sleeved co-clustering of lagged data

The paper focuses on mining clusters that are characterized by a lagged relationship between the data objects. We call such clusters lagged co-clusters. A lagged co-cluster of a matrix is a submatrix determined by a subset of rows and their corresponding lag over a subset of columns. Extracting such subsets may reveal an underlying governing regulatory mechanism. Such a regulatory mechanism is quite common in real-life settings. It appears in a variety of fields: meteorology, seismic activity, stock market behavior, neuronal brain activity, river flow, and navigation, but a limited list of examples. Mining such lagged co-clusters not only helps in understanding the relationship between objects in the domain, but assists in forecasting their future behavior. For most interesting variants of this problem, finding an optimal lagged co-cluster is NP-complete problem. We present a polynomial-time Monte-Carlo algorithm for mining lagged co-clusters. We prove that, with fixed probability, the algorithm mines a lagged co-cluster which encompasses the optimal lagged co-cluster by a maximum 2 ratio columns overhead and completely no rows overhead. Moreover, the algorithm handles noise, anti-correlations, missing values, and overlapping patterns. The algorithm is extensively evaluated using both artificial and real-world test environments. The first enable the evaluation of specific, isolated properties of the algorithm. The latter (river flow and topographic data) enable the evaluation of the algorithm to efficiently mine relevant and coherent lagged co-clusters in environments that are temporal, i.e., time reading data and non-temporal.     

Self‐Assembling,Bioinspired Wax Crystalline Surfaces with Time‐Dependent Wettability

One of the most fascinating properties of materials in nature is the superhydrophobic and self‐cleaning capabilities of different plant surfaces. This is usually achieved by the hydrophobic cuticles that are made of cutin and contain wax crystals both within them and on their surfaces. Here, bioinspired n‐hexatriacontane wax films are deposited via thermal evaporation and it is shown that the surface evolves in time via self‐assembly. This leads to a dramatic change in the wetting properties with a transition from hydrophobic to superhydrophobic characteristics, which takes place within several days at room temperature. This phenomenon is investigated and strain‐induced recrystallization is proposed to be the mechanism for it. This work could become the basis for the inspiration and production of tuned, time‐dependant, temperature‐sensitive, variable‐wettability surfaces.     

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.     

Nearly optimal perfectly periodic schedules

We consider the problem of scheduling a set of pages on a single broadcast channel using time-multiplexing. In a perfectly periodic schedule, time is divided into equal size slots, and each page is transmitted in a time slot precisely every fixed interval of time (the period of the page). We study the case in which each page i has a given demand probability , and the goal is to design a perfectly periodic schedule that minimizes the average time a random client waits until its page is transmitted. We seek approximate polynomial solutions. Approximation bounds are obtained by comparing the costs of a solution provided by an algorithm and a solution to a relaxed (non-integral) version of the problem. A key quantity in our methodology is a fraction we denote by , that depends on the maximum demand probability: . The best known polynomial algorithm to date guarantees an approximation of . In this paper, we develop a tree-based methodology for perfectly periodic scheduling, and using new techniques, we derive algorithms with better bounds. For small values, our best algorithm guarantees approximation of . On the other hand, we show that the integrality gap between the cost of any perfectly periodic schedule and the cost of the fractional problem is at least . We also provide algorithms with good performance guarantees for large values of . Received: December 2001 / Accepted: September 2002