A knowledge-based analysis of global function computation

Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends on the whole network, the goal is for every agent to eventually compute the value f (N). We call this problem global function computation. Various solutions for instances of this problem, such as Boolean function computation, leader election, (minimum) spanning tree construction, and network determination, have been proposed, each under particular assumptions about what processors know about the system and how this knowledge can be acquired. We give a necessary and sufficient condition for the problem to be solvable that generalizes a number of well-known results (Attyia et al. in J ACM 35(4):845–875, 1988; Yamashita and Kameda in IEEE Trans Parallel Distrib Syst 7(1):69–89, 1996; Yamashita and Kameda in IEEE Trans Parallel Distrib Syst 10(9):878–887, 1999). We then provide a knowledge-based (kb) program (like those of Fagin et al. (Reasoning about knowledge, MIT Press, Cambridge, 1995, Distrib Comput 10(4):199–225, 1997)) that solves global function computation whenever possible. Finally, we improve the message overhead inherent in our initial kb program by giving a counterfactual belief-based program (Halpern and Moses in Distrib Comput 17(2):91–106, 2004) that also solves the global function computation whenever possible, but where agents send messages only when they believe it is necessary to do so. The latter program is shown to be implemented by a number of well-known algorithms for solving leader election.     

Dealing with logical omniscience: Expressiveness and pragmatics

We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and impossible possible worlds. Although in some settings these approaches are equi-expressive and can capture all epistemic states, in other settings of interest (especially with probability in the picture), we show that they are not equi-expressive. We then consider the pragmatics of dealing with logical omniscience—how to choose an approach and construct an appropriate model.     

l/sub 1/-suboptimal pole placement design

We incorporate an arbitrary number of "candidate" positive distinct poles into the scalar l/sub 1/ optimization framework in order to obtain low-order rational suboptimal solutions to constrained l/sub 1/ optimization problems. Our approach uses a single linear program to minimize an upper bound on the l/sub 1/ norm and gives a solution which uses only the best out of the prespecified poles. Rational suboptimal solutions to a scalar two-block problem are obtained similarly.     

Action of levorin on glucose transport in the rat small intestine

The technique of accumulating preparation of the mucosa and "turned out sac" was used to show that levorin, a polyenic antibiotic in a concentration of 10(-6) M, lowered the transport rate and accumulation of glucose by the epithelial cells of the rat thin intestine under conditions of oxygenation. Suppression of the glucose transport in the first stages resulted in partial inhibition of the transmembrane transfer. It is suggested that levorin suppression of the glucose transport through the erythrocyte apical membrane in the thin intestine is associated with a decrease in the electrochemical gradient of Na+.     

Keyboard design through physiological strain measurements

The physiologically tolerable range of positions for the joints of the upper extremities have been investigated for typing tasks by recording the myoelectric activities of the involved muscles. For long-term typing tasks a split keyboard is recommended allocating a key field to each hand. The fields should be rotated against each other in the horizontal plane and inclined laterally.     

A sensitive method for the determination of amitriptyline and nortriptyline in human plasma

The kinetics of the male gametogenesis during the pregonadal period, prespermatogenesis, and "early" spermatogenesis has been described in detail. Concerning spermatogenesis in the adult individual reference is made to the articles of Courot, Hochereau-de Reviers and Ortavant (1970) and of Clermont (1972). The comparison of female and male gametogenesis (Fig. 1) shows that the "gonia stage" (asterisks) of the female germ cells is limited to one proliferation wave only, whereas the "gonia stage" of the male germ cells consists of a first proliferation wave, comparable to that of oogonia, a preparative phase to initiate spermatogenesis, and a second proliferation wave with renewal and differentiation of the spermatogonia. Germ cells in the "gonia stage" are highly sensitive towards ionising radiation and cytostatic drugs.     

Static postural control in children

The purpose of this study was to investigate "static" balance characteristics in four and eight year old children performing six developmental tasks leading to upright stance. The data were evaluated with electromyographic, center of gravity and photographic procedures. The results of the study indicated that the older age group of children demonstrated higher degrees of motor control in all the balance tasks involving upper and/or lower extremity support of the trunk. The eight year old children showed less postural sway, more definitive muscular localizations and smaller degrees of motor activity occurring during the execution of the developmental tasks.     

Gossip-based ad hoc routing

Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations of flooding, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fraction of the nodes gets the message. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. In the networks we have considered, using gossiping probability between 0.6 and 0.8 suffices to ensure that almost every node gets the message in almost every execution. For large networks, this simple gossiping protocol uses up to 35% fewer messages than flooding, with improved performance. Gossiping can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding gossiping to AODV results in significant performance improvement, even in networks as small as 150 nodes. Our results suggest that the improvement should be even more significant in larger networks.     

Psychology at the Intersection of Work and Family: Recommendations for Employers, Working Families, and Policymakers.

Demographic data show that major changes have been occurring in the everyday lives of families over the last generation, with the majority of mothers of young children in the workforce and an increasing number of men and women assuming caregiving responsibilities for older relatives. Thus, the 2 primary identities of most adults, defined by their multiple family and work roles, need to be coordinated in ways that promote positive family outcomes, returns on investments for employers, and societal values. Despite changes in the workforce, the world of work is still largely organized for a family model that is increasingly rare--one with a stay-at-home caregiver. Recommendations based on psychological and other social science research are offered to align the needs of working families and employers. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Reasoning about Knowledge: A Response by the Authors

Minds and Machines -