Consensus Acceleration in Multiagent Systems with the Chebyshev Semi-Iterative Method

We consider the fundamental problem of reaching consensus in multiagent systems; an operation required in many applications such as, among others, vehicle formation and coordination, shape formation in modular robotics, distributed target tracking, and environmental modeling. To date, the consensus problem (the problem where agents have to agree on their reported values) has been typically solved with iterative decentralized algorithms based on graph Laplacians. However, the convergence of these existing consensus algorithms is often too slow for many important multiagent applications, and thus they are increasingly being combined with acceleration methods. Unfortunately, state-of-the-art acceleration techniques require parameters that can be optimally selected only if complete information about the network topology is available, which is rarely the case in practice. We address this limitation by deriving two novel acceleration methods that can deliver good performance even if little information about the network is available. The first proposed algorithm is based on the Chebyshev semi-iterative method and is optimal in a well defined sense; it maximizes the worst-case convergence speed (in the mean sense) given that only rough bounds on the extremal eigenvalues of the network matrix are available. It can be applied to systems where agents use unreliable communication links, and its computational complexity is similar to those of simple Laplacian-based methods. This algorithm requires synchronization among agents, so we also propose an asynchronous version that approximates the output of the synchronous algorithm. Mathematical analysis and numerical simulations show that the convergence speed of the proposed acceleration methods decrease gracefully in scenarios where the sole use of Laplacian-based methods is known to be impractical

Sequential Decision Making with Untrustworthy Service Providers

In this paper, we deal with the sequential decision making problem of agents operating in computational economies, where there is uncertainty regarding the trustworthiness of service providers populating the environment. Specifically, we propose a generic Bayesian trust model, and formulate the optimal Bayesian solution to the exploration-exploitation problem facing the agents when repeatedly interacting with others in such environments. We then present a computationally tractable Bayesian reinforcement learning algorithm to approximate that solution by taking into account the expected value of perfect information of an agent's actions. Our algorithm is shown to dramatically outperform all previous finalists of the international Agent Reputation and Trust (ART) competition, including the winner from both years the competition has been run

Teacher effects on social/behavioral skills in early elementary school

Though many recognize that social and behavioral skills play an important role in educational stratification, no studies have attempted to estimate teachers’ effects on these outcomes. Using data from the Early Childhood Longitudinal Study–Kindergarten Cohort (ECLS–K), we estimate teacher effects on social and behavioral skills as well as on academic achievement. Teacher effects on social and behavioral skill development are sizeable, and are somewhat larger than teacher effects on academic development. Because—as we show—social and behavioral skills have a positive effect on the growth of academic skills in the early elementary grades, the teachers who are good at enhancing social and behavioral skills provide an additional indirect boost to academic skills in addition to their direct teaching of academic skills. Like previous studies we find that observable characteristics of teachers and the instructional approaches utilized in their classrooms are weak predictors of teacher effects. However, our results suggest that the teachers who produce better than average academic results are not always the same teachers who excel in enhancing social and behavioral skills

Social/behavioral skills and the gender gap in early educational achievement

Though many studies have suggested that social and behavioral skills play a central role in gender stratification processes, we know little about the extent to which these skills affect gender gaps in academic achievement. Analyzing data from the Early Child Longitudinal Study-Kindergarten Cohort, we demonstrate that social and behavioral skills have substantively important effects on academic outcomes from kindergarten through fifth grade. Gender differences in the acquisition of these skills, moreover, explain a considerable fraction of the gender gap in academic outcomes during early elementary school. Boys get roughly the same academic return to social and behavioral skills as their female peers, but girls retain an advantage both because they begin school with more advanced social and behavioral skills, and because their skill advantage grows over time. While part of the effect may reflect an evaluation process that rewards students who better conform to school norms, our results imply that the acquisition of social and behavioral skills enhances learning as well. Our results call for a reconsideration of the family and school-level processes that produce gender gaps in social/behavioral skills and the advantages they confer for academic and later success

Indemnification of Corporate Officers and Directors

Doing business through the legal fiction\u27 of a corporate entity dates back to the Middle Ages

Nucleon-nucleus optical potential in the particle-hole approach

Feshbach's projection formalism in the particle-hole model space leads to a microscopic description of scattering in terms of the many-body self-energy. To investigate the feasibility of this approach, an optical potential for O-16 is constructed starting from two previous calculations of the self-energy for this nucleus. The results reproduce the background phase shifts for positive parity waves and the resonances beyond the mean field. The latter can be computed microscopically for energies of astrophysical interest using Green's function theory.Comment: 8 pages, 6 figures. Submitted to Phys. Rev.

Low Temperature Physics

Contains research objectives and reports on one research project

Sum Rule Description of Color Transparency

The assumption that a small point-like configuration does not interact with nucleons leads to a new set of sum rules that are interpreted as models of the baryon-nucleon interaction. These models are rendered semi-realistic by requiring consistency with data for cross section fluctuations in proton-proton diffractive collisions.Comment: 22 pages + 3 postscript figures attache

Multiple-Scattering Series For Color Transparency

Color transparency CT depends on the formation of a wavepacket of small spatial extent. It is useful to interpret experimental searches for CT with a multiple scattering scattering series based on wavepacket-nucleon scattering instead of the standard one using nucleon-nucleon scattering. We develop several new techniques which are valid for differing ranges of energy. These techniques are applied to verify some early approximations; study new forms of the wave-packet-nucleon interaction; examine effects of treating wave packets of non-zero size; and predict the production of $N^*$'s in electron scattering experiments.Comment: 26 pages, U.Wa. preprint 40427-23-N9

OMV Servicing Missions from Space Station

\u27!he Orbital Maneuvering Vehicle (OMV) will provide a means of bringing large observatories to the Space station for servicing and redeployment to their operating altitudes. However, there are many constraints which must be met in mission planning. \u27!he missions must be designed so that propellant consumption is within the usable allowance, but contingency operations can still be accomplished. \u27!he vehicle was designed specifically to accommodate such missions, with emphasis upon servicing the Hubble Space Telescope. \u27!he OMV has been designed for operations from the Shuttle Orbiter and the Space Station. It will readily accommodate basing at the Space Station and executing observatory retrieval and redeployment missions. Mission profiles have been designed which allow retrieval with contengency hold before descent, and which allow contengency return of the observatory if it fails to reactivate properly. This capability will be a major addition to the Space Transportation System and will increase the utility of the Space Station