Upper and lower bounds of 180 degrees unit element of a ridge waveguide: Calculations and measurements

The upper and lower bounds on the actual solution of any microwave structure is of general interest. The purpose of this letter is to compare some calculations using the mode-matching and finite-element methods, with some measurements on a 180 degrees ridge waveguide insert between standard WR62 rectangular waveguides. The work suggests that the MMM produces an upper bound, while the FEM places a lower bound on the measurement. (C) 2001 John Wiley & Sons, Inc.

Statistical Eigenmode Transmission for the MU-MIMO Downlink in Rician Fading

In this paper, we study the achievable ergodic sum-rate of multiuser multiple-input multiple-output downlink systems in Rician fading channels. We first derive a lower bound on the average signal-to-leakage-and-noise ratio by using the Mullen’s inequality, and then use it to analyze the effect of channel mean information on the achievable ergodic sum-rate. A novel statistical-eigenmode space-division multiple-access (SESDMA) downlink transmission scheme is then proposed. For this scheme, we derive an exact analytical closed-form expression for the achievable ergodic rate and present tractable tight upper and lower bounds. Based on our analysis, we gain valuable insights into the system parameters, such as the number of transmit antennas, the signal-to-noise ratio (SNR) and Rician K-factor on the system sum-rate. Results show that the sum-rate converges to a saturation value in the high SNR regime and tends to a lower limit for the low Rician K-factor case. In addition, we compare the achievable ergodic sum-rate between SE-SDMA and zeroforcing beamforming with perfect channel state information at the base station. Our results reveal that the rate gap tends to zero in the high Rician K-factor regime. Finally, numerical results are presented to validate our analysis.

When some is actually all: Scalar inferences in face-threatening contexts

Accounts of the scalar inference from 'some X-ed' to 'not all X-ed' are central to the debate between contemporary theories of conversational pragmatics. An important contribution to this debate is to identify contexts that decrease the endorsement rate of the inference. We suggest that the inference is endorsed less often in face-threatening contexts, i.e., when X implies a loss of face for the listener. This claim is successfully tested in Experiment 1. Experiment 2 rules out a possible confound between face-threatening contexts and lower-bound contexts. Experiment 3 shows that whilst saying 'some X-ed' when one knew for a fact that all X-ed is always perceived as an underinformative utterance, it is also seen as a nice and polite thing to do when X threatens the face of the listener. These findings are considered from the perspective of Relevance Theory as well as that of the Generalized Conversational Inference approach. (C) 2009 Elsevier B.V. All rights reserved.

POINT-AGAPE pixel lensing survey of M31 - Evidence for a MACHO contribution to galactic halos

The POINT-AGAPE collaboration is carrying out a search for gravitational microlensing toward M31 to reveal galactic dark matter in the form of MACHOs (Massive Astrophysical Compact Halo Objects) in the halos of the Milky Way and M31. A high-threshold analysis of 3 years of data yields 6 bright, short- duration microlensing events, which are confronted to a simulation of the observations and the analysis. The observed signal is much larger than expected from self lensing alone and we conclude, at the 95% confidence level, that at least 20% of the halo mass in the direction of M31 must be in the form of MACHOs if their average mass lies in the range 0.5-1 M-circle dot. This lower bound drops to 8% for MACHOs with masses similar to 0.01 M-circle dot. In addition, we discuss a likely binary microlensing candidate with caustic crossing. Its location, some 32' away from the centre of M31, supports our conclusion that we are detecting a MACHO signal in the direction of M31.

Minimal Hilbert series for quadratic algebras and the Anick conjecture

We study the question on whether the famous Golod–Shafarevich estimate, which gives a lower bound for the Hilbert series of a (noncommutative) algebra, is attained. This question was considered by Anick in his 1983 paper ‘Generic algebras and CW-complexes’, Princeton Univ. Press, where he proved that the estimate is attained for the number of quadratic relations $d\leq n^2/4$
and $d\geq n^2/2$, and conjectured that it is the case for any number of quadratic relations. The particular point where the number of relations is equal to $n(n-1)/2$ was addressed by Vershik. He conjectured that a generic algebra with this number of relations is finite dimensional. We announce here the result that over any infinite field, the Anick conjecture holds for $d \geq 4(n2+n)/9$ and an arbitrary number of generators. We also discuss the result that confirms the Vershik conjecture over any field of characteristic 0, and a series of related
asymptotic results.

Double-detonation sub-Chandrasekhar supernovae: Can minimum helium shell masses detonate the core?

The explosion of sub-Chandrasekhar mass white dwarfs via the double detonation scenario is a potential explanation for type Ia supernovae. In this scenario, a surface detonation in a helium layer initiates a detonation in the underlying carbon/oxygen core leading to an explosion. For a given core mass, a lower bound has been determined on the mass of the helium shell required for dynamical burning during a helium flash, which is a necessary prerequisite for detonation. For a range of core and corresponding minimum helium shell masses, we investigate whether an assumed surface helium detonation is capable of triggering a subsequent detonation in the core even for this limiting case. We carried out hydrodynamic simulations on a co-expanding Eulerian grid in two dimensions assuming rotational symmetry. The detonations are propagated using the level-set approach and a simplified scheme for nuclear reactions that has been calibrated with a large nuclear network. The same network is used to determine detailed nucleosynthetic abundances in a post-processing step. Based on approximate detonation initiation criteria in the literature, we find that secondary core detonations are triggered for all of the simulated models, ranging in core mass from 0.810 up to 1.385 M? with corresponding shell masses from 0.126 down to 0.0035 M?. This implies that, as soon as a detonation triggers in a helium shell covering a carbon/oxygen white dwarf, a subsequent core detonation is virtually inevitable.

Generic Ergodic Capacity Bounds for Fixed-Gain AF Dual-Hop Relaying Systems

This paper elaborates on the ergodic capacity of fixed-gain amplify-and-forward (AF) dual-hop systems, which have recently attracted considerable research and industry interest. In particular, two novel capacity bounds that allow for fast and efficient computation and apply for nonidentically distributed hops are derived. More importantly, they are generic since they apply to a wide range of popular fading channel models. Specifically, the proposed upper bound applies to Nakagami-m, Weibull, and generalized-K fading channels, whereas the proposed lower bound is more general and applies to Rician fading channels. Moreover, it is explicitly demonstrated that the proposed lower and upper bounds become asymptotically exact in the high signal-to-noise ratio (SNR) regime. Based on our analytical expressions and numerical results, we gain valuable insights into the impact of model parameters on the capacity of fixed-gain AF dual-hop relaying systems. © 2011 IEEE.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Multiuser Cognitive Relay Networks in the Presence of Direct Links

In this paper, we investigate a multiuser cognitive relay network with direct source-destination links and multiple primary destinations. In this network, multiple secondary users compete to communicate with a secondary destination assisted by an amplify-and-forward (AF) relay. We take into account the availability of direct links from the secondary users to the primary and secondary destinations. For the considered system, we select one best secondary user to maximize the received signal-to-noise ratio (SNR) at the secondary destination. We first derive an accurate lower bound of the outage probability, and then provide an asymptotic expression of outage probability in high SNR region. From the lower bound and the asymptotic expressions, we obtain several insights into the system design. Numerical and simulation results are finally demonstrated to verify the proposed studies.

Sublinear bounds for randomized leader election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(√ √nlog^3/2n) messages to elect a unique leader (with high probability). When considering the "explicit" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(. n) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G in O(τ(. G)) time and O(τ(G)n√log^3/2n) messages, where τ(. G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that Ω(n) messages are needed for any leader election algorithm that succeeds with probability at least 1/. e+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Disinflation with labor market frictions

This paper studies disinflationary shocks in a non-linear New Keynesian model with search and matching frictions and moral hazard in the labor markets. Our focus is on understanding the wage formation process as well as welfare costs of disinflations in the presence of such labor market frictions.

The presence of imperfect information in labor markets imposes a lower bound on worker surplus that varies endogenously. Consequently equilibrium can take two forms depending on whether the no shirking condition is binding or not. We also evaluate both regimes from a welfare perspective when the economy is subject to a perfectly credible disinflationary shock.

Intermittent chemotherapy plus either intermittent or continuous cetuximab for first-line treatment of patients with KRAS wild-type advanced colorectal cancer (COIN-B): a randomised phase 2 trial

Background: Advanced colorectal cancer is treated with a combination of cytotoxic drugs and targeted treatments. However, how best to minimise the time spent taking cytotoxic drugs and whether molecular selection can refine this further is unknown. The primary aim of this study was to establish how cetuximab might be safely and effectively added to intermittent chemotherapy.

Methods: COIN-B was an open-label, multicentre, randomised, exploratory phase 2 trial done at 30 hospitals in the UK and one in Cyprus. We enrolled patients with advanced colorectal cancer who had received no previous chemotherapy for metastases. Randomisation was done centrally (by telephone) by the Medical Research Council Clinical Trials Unit using minimisation with a random element. Treatment allocation was not masked. Patients were assigned (1:1) to intermittent chemotherapy plus intermittent cetuximab or to intermittent chemotherapy plus continuous cetuximab. Chemotherapy was FOLFOX (folinic acid and oxaliplatin followed by bolus and infused fluorouracil). Patients in both groups received FOLFOX and weekly cetuximab for 12 weeks, then either had a planned interruption (those taking intermittent cetuximab) or planned maintenance by continuing on weekly cetuximab (continuous cetuximab). On RECIST progression, FOLFOX plus cetuximab or FOLFOX was recommenced for 12 weeks followed by further interruption or maintenance cetuximab, respectively. The primary outcome was failure-free survival at 10 months. The primary analysis population consisted of patients who completed 12 weeks of treatment without progression, death, or leaving the trial. We tested BRAF and NRAS status retrospectively. The trial was registered, ISRCTN38375681.

Findings: We registered 401 patients, 226 of whom were enrolled. Results for 169 with KRAS wild-type are reported here, 78 (46%) assigned to intermittent cetuximab and 91 (54%) to continuous cetuximab. 64 patients assigned to intermittent cetuximab and 66 of those assigned to continuous cetuximab were included in the primary analysis. 10-month failure-free survival was 50% (lower bound of 95% CI 39) in the intermittent group versus 52% (lower bound of 95% CI 41) in the continuous group; median failure-free survival was 12·2 months (95% CI 8·8–15·6) and 14·3 months (10·7–20·4), respectively. The most common grade 3–4 adverse events were skin rash (21 [27%] of 77 patients vs 20 [22%] of 92 patients), neutropenia (22 [29%] vs 30 [33%]), diarrhoea (14 [18%] vs 23 [25%]), and lethargy (20 [26%] vs 19 [21%]).

Interpretation: Cetuximab was safely incorporated in two first-line intermittent chemotherapy strategies. Maintenance of biological monotherapy, with less cytotoxic chemotherapy within the first 6 months, in molecularly selected patients is promising and should be validated in phase 3 trials.

Physical and dynamical characterisation of low ΔV NEA (190491) 2000 FJ10

Aims: We investigated the physical properties and dynamical evolution of near-Earth asteroid (NEA) (190491) 2000 FJ10 in order to assess the suitability of this accessible NEA as a space mission target. Methods: Photometry and colour determination were carried out with the 1.54 m Kuiper Telescope (Mt Bigelow, USA) and the 10 m Southern African Large Telescope (SALT; Sutherland, South Africa) during the object's recent favourable apparition in 2011-12. During the earlier 2008 apparition, a spectrum of the object in the 6000-9000 Angstrom region was obtained with the 4.2 m William Herschel Telescope (WHT; Canary Islands, Spain). Interpretation of the observational results was aided by numerical simulations of 1000 dynamical clones of 2000 FJ10 up to 106 yr in the past and in the future. Results: The asteroid's spectrum and colours determined by our observations suggest a taxonomic classification within the S-complex although other classifications (V, D, E, M, P) cannot be ruled out. On this evidence, it is unlikely to be a primitive, relatively unaltered remnant from the early history of the solar system and thus a low priority target for robotic sample return. Our photometry placed a lower bound of 2 h to the asteroid's rotation period. Its absolute magnitude was estimated to be 21.54 ± 0.1 which, for a typical S-complex albedo, translates into a diameter of 130 ± 20 m. Our dynamical simulations show that it has likely been an Amor for the past 105 yr. Although currently not Earth-crossing, it will likely become so during the period 50-100 kyr in the future. It may have arrived from the inner or central main belt >1 Myr ago as a former member of a low-inclination S-class asteroid family. Its relatively slow rotation and large size make it a suitable destination for a human mission. We show that ballistic Earth-190491-Earth transfer trajectories with ΔV <2 km s-1 at the asteroid exist between 2052 and 2061. Based on observations made with the Southern African Large Telescope (SALT).