Investigations of high-performance GaAs solar cells grown on Ge-Si/sub 1-x/Ge/sub x/-Si substrates

High-performance p/sup +//n GaAs solar cells were grown and processed on compositionally graded Ge-Si/sub 1-x/Ge/sub x/-Si (SiGe) substrates. Total area efficiencies of 18.1% under the AM1.5-G spectrum were measured for 0.0444 cm/sup 2/ solar cells. This high efficiency is attributed to the very high open-circuit voltages (980 mV (AM0) and 973 mV (AM1.5-G)) that were achieved by the reduction in threading dislocation density enabled by the SiGe buffers, and thus reduced carrier recombination losses. This is the highest independently confirmed efficiency and open-circuit voltage for a GaAs solar cell grown on a Si-based substrate to date. Larger area solar cells were also studied in order to examine the impact of device area on GaAs-on-SiGe solar cell performance; we found that an increase in device area from 0.36 to 4.0 cm/sup 2/ did not degrade the measured performance characteristics for cells processed on identical substrates. Moreover, the device performance uniformity for large area heteroepitaxial cells is consistent with that of homoepitaxial cells; thus, device growth and processing on SiGe substrates did not introduce added performance variations. These results demonstrate that using SiGe interlayers to produce "virtual" Ge substrates may provide a robust method for scaleable integration of high performance III-V photovoltaics devices with large area Si wafers.     

Outcome of different treatment mixes in a multidimensional neuropsychological rehabilitation program.

Within a clinical demonstration program, 59 traumatically brain-injured patients were treated with 1 of 3 mixes of treatment. Mix 1 included cognitive remediation (CGR), small-group interpersonal (SGI) communication training, therapeutic community activities, and personal counseling. Mix 2 was similar to Mix 1 but stressed SGI exercises and eliminated CGR. Mix 3 emphasized CGR and eliminated SGI exercises. The efficacy of the treatment mixes was evaluated with performance on neuropsychological tests, improved independence in functional activities, measures of intra- and interpersonal functioning, and vocational outcome. Ss' participation in the program, irrespective of treatment mix, yielded improvements in (1) self-image, (2) quality of interpersonal relatedness and interaction, (3) involvement with others in naturalistic settings, and (4) vocational outcome. Overall, data point to the superiority of the balanced mix (Mix 1) over Mixes 2 and 3. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted. This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement. We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever a third or more of the parties are corrupted. In this paper we show that this folklore is false. We present a mild relaxation of the definition of secure computation allowing abort. Our new definition captures all the central security issues of secure computation, including privacy, correctness and independence of inputs. However, the novelty of the definition is in decoupling the issue of agreement from these issues. We then show that this relaxation suffices for achieving secure computation in a point-to-point network. That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted pre-processing phase as required for running authenticated Byzantine agreement). Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol. An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel.     

Co-located collaborative visual analytics around a tabletop display

Co-located collaboration can be extremely valuable during complex visual analytics tasks. We present an exploratory study of a system designed to support collaborative visual analysis tasks on a digital tabletop display. Fifteen participant pairs employed Cambiera, a visual analytics system, to solve a problem involving 240 digital documents. Our analysis, supported by observations, system logs, questionnaires, and interview data, explores how pairs approached the problem around the table. We contribute a unique, rich understanding of how users worked together around the table and identify eight types of collaboration styles that can be used to identify how closely people work together while problem solving. We show how the closeness of teams’ collaboration and communication influenced how they performed on the task overall. We further discuss the role of the tabletop for visual analytics tasks and derive design implications for future co-located collaborative tabletop problem solving systems.     

The k-simultaneous consensus problem

This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is equivalent to the k-set agreement task in the wait-free read/write shared memory model, and furthermore k-simultaneous consensus possesses properties that k-set does not. In particular we show that the multivalued version and the binary version of the k-simultaneous consensus task are wait-free equivalent. These equivalences are independent of the number of processes. Interestingly, this provides us with a new characterization of the k-set agreement task that is based on the fundamental binary consensus problem.     

Renaming and the weakest family of failure detectors

We address the question of the weakest failure detector to circumvent the impossibility of $(2n-2)$ -renaming in a system of up to $n$ participating processes. We derive that in a restricted class of eventual failure detectors there does not exist a single weakest oracle, but a weakest family of oracles $\zeta _n$ : every two oracles in $\zeta _n$ are incomparable, and every oracle that allows for solving renaming provides at least as much information about failures as one of the oracles in $\zeta _n$ . As a by product, we obtain one more evidence that renaming is strictly easier to solve than set agreement.     

Probabilistic risk analysis of corrosion associated failures in cast iron water mains

This paper proposes a method using probabilistic risk analysis for application to corrosion associated failures in grey cast iron water mains. External corrosion reduces the capacity of the pipeline to resist stresses. When external stresses exceed the residual ultimate strength, pipe breakage becomes imminent, and the overall reliability of a water distribution network is reduced. Modelling stresses and external corrosion acting on a pipe involves uncertainties inherent in the mechanistic/statistical models and their input parameters. Monte Carlo (MC) simulations were used to perform the probabilistic analysis. The reduction in the factor of safety (FOS) of water mains over time was computed, with a failure defined as a situation in which FOS becomes smaller than 1. The MC simulations yielded an empirical probability density function of time to failure, to which a lognormal distribution was fitted leading to the derivation of a failure hazard function. A sensitivity analysis revealed that the contribution of corrosion parameters to the variability of time to failure was more significant than the combined contributions of all other parameters. Areas where more research is needed are identified.