Convergence of partial-wave expansions for energies, scattering amplitudes and positron annihilation rates

We use many-body theory to find the asymptotic behaviour of second-order correlation corrections to the energies and positron annihilation rates in many- electron systems with respect to the angular momenta l of the single-particle orbitals included. The energy corrections decrease as 1/(l+1/2)4, in agreement with the result of Schwartz, whereas the positron annihilation rate has a slower 1/(l+1/2)2 convergence rate. We illustrate these results by numerical calculations of the energies of Ne and Kr and by examining results from extensive con?guration-interaction calculations of PsH binding and annihilation.

Partial Cooperative Equilibria: Existence and Characterization

We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.

Robust face recognition with partial occlusion, illumination variation and limited training data by optimal feature selection

This study investigates face recognition with partial occlusion, illumination variation and their combination, assuming no prior information about the mismatch, and limited training data for each person. The authors extend their previous posterior union model (PUM) to give a new method capable of dealing with all these problems. PUM is an approach for selecting the optimal local image features for recognition to improve robustness to partial occlusion. The extension is in two stages. First, authors extend PUM from a probability-based formulation to a similarity-based formulation, so that it operates with as little as one single training sample to offer robustness to partial occlusion. Second, they extend this new formulation to make it robust to illumination variation, and to combined illumination variation and partial occlusion, by a novel combination of multicondition relighting and optimal feature selection. To evaluate the new methods, a number of databases with various simulated and realistic occlusion/illumination mismatches have been used. The results have demonstrated the improved robustness of the new methods.

Two-Stage Transmitter Precoding Based on Data-Driven Code Hopping and Partial Zero Forcing Beamforming for MC-DCMA Communications

This paper proposes a hybrid transmission technique based on adaptive code-to-user allocation and linear precoding for the downlink of phase shift keying (PSK) based multi-carrier code division multiple access (MC-CDMA) systems. The proposed scheme is based on the separation of the instantaneous multiple access interference (MAI) into constructive and destructive components taking into account the dependency on both the channel variation and the instantaneous symbol values of the active users. The first stage of the proposed technique is to adaptively distribute the available spreading sequences to the users on a symbol-by-symbol basis in the form of codehopping with the objective to steer the users' instantaneous crosscorrelations to yield a favourable constructive to destructive MAI ratio. The second stage is to employ a partial transmitter based zero forcing (ZF) scheme specifically designed for the exploitation of constructive MAI. The partial ZF processing decorrelates destructive interferers, while users that interfere constructively remain correlated. This results in a signal to interference-plus-noise ratio (SINR) enhancement without the need for additional power-per-user investment. It will be shown in the results section that significant bit error rate (BER) performance benefits can be achieved with this technique.

Strategic behavior under partial cooperation

We investigate how a group of players might cooperate with each other within the setting of a non-cooperative game. We pursue two notions of partial cooperative equilibria that follow a modification of Nash's best response rationality rather than a core-like approach. Partial cooperative Nash equilibrium treats non-cooperative players and the coalition of cooperators symmetrically, while the notion of partial cooperative leadership equilibrium assumes that the group of cooperators has a first-mover advantage. We prove existence theorems for both types of equilibria. We look at three well-known applications under partial cooperation. In a game of voluntary provision of a public good we show that our two new equilibrium notions of partial cooperation coincide. In a modified Cournot oligopoly, we identify multiple equilibria of each type and show that a non-cooperator may have a higher payoff than a cooperator. In contrast, under partial cooperation in a symmetric Salop City game, a cooperator enjoys a higher return.

Reasoning about orchestrations of web services using partial correctness

A service is a remote computational facility which is made available for general use by means of a wide-area network. Several types of service arise in practice: stateless services, shared state services and services with states which are customised for individual users. A service-based orchestration is a multi-threaded computation which invokes remote services in order to deliver results back to a user (publication). In this paper a means of specifying services and reasoning about the correctness of orchestrations over stateless services is presented. As web services are potentially unreliable the termination of even finite orchestrations cannot be guaranteed. For this reason a partial-correctness powerdomain approach is proposed to capture the semantics of recursive orchestrations.