Induction of early atherosclerosis in LDL-receptor-deficient mice immunized with beta2-glycoprotein I

BACKGROUND: Immunization with beta2-glycoprotein I (beta2GPI), the probable target of autoimmune anticardiolipin antibodies, results in experimental antiphospholipid syndrome in different mouse strains. The present study was undertaken to evaluate the effect of beta2GPI immunization on the progression of atherosclerosis. METHODS AND RESULTS: In the first experiment, 3 groups of LDL receptor-deficient (LDL-RD) mice (n=15 per group) were immunized with either beta2GPI or ovalbumin or were not immunized and were fed a chow diet for 12 weeks. In a second experiment, 3 groups of LDL-RD mice (n=10 per group) were immunized similarly and fed an atherogenic diet for 6 weeks. All beta2GPI-immunized mice developed high titers of anti-beta2GPI antibodies as well as a specific lymph node proliferation to beta2GPI. The average cholesterol levels did not differ between the mice fed similar diets, regardless of the immunization protocol. Atherosclerosis was enhanced in the beta2GPI-immunized mice (mean aortic lesion, 26 000+/-5700 microm2) in comparison with their ovalbumin-immunized (mean, 3000+/-1099 microm2; P<0.01) and nonimmunized (mean, 2250+/-700 microm2; P<0.01) littermates. The average lesion size in the beta2GPI-immunized mice fed an atherogenic diet (mean, 98 000+/-8305 microm2) was larger than the ovalbumin-immunized mice (mean, 81 250+/-12 933 microm2; P=NS) or the nonimmunized controls (mean, 75 625+/-7281 microm2; P=NS). The atherosclerotic plaques in the beta2GPI-immunized mice appeared to be more mature, and denser infiltration of CD4 lymphocytes was present in the subendothelium of the aortic sinuses from this group of mice. CONCLUSIONS: The results of the present study provide the first direct evidence for the proatherogenic effect of ss2GPI immunization and establish a new model for immune-mediated atherosclerosis.     

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.     

Fast and scalable rendezvousing

In an asymmetric rendezvous system, such as an unfair synchronous queue or an elimination array, threads of two types, consumers and producers, show up and are matched each with a unique thread of the other type. Here we present new highly scalable, high throughput asymmetric rendezvous systems that outperform prior synchronous queue and elimination array implementations under both symmetric and asymmetric workloads (more operations of one type than the other). Based on this rendezvous system, we also construct a highly scalable and competitive stack implementation.     

Pathogenicity of human anti-platelet factor 4 (PF4)/heparin in vivo: generation of mouse anti-PF4/heparin and induction of thrombocytopenia by heparin

Acinetobacter baumannii strain A148, a clinical isolate resistant to imipenem (MIC = 32 mg l-1), synthesized two beta-lactamases with pIs 6.3 and > 9.2. The pI 6.3 enzyme hydrolyzed the penicillins, including isoxazoylpenicillins, first-, second- and, to a lesser extent, third-generation cephalosporins. It was inhibited by chloride ions and by the penem beta-lactamase inhibitor BRL 42715. Clavulanate was a weak inhibitor and EDTA did not affect the beta-lactamase activity. This enzyme also hydrolyzed imipenem with a catalytic efficiency (Kcat/Km) of 1500 mM-1 s-1. Moreover, this purified beta-lactamase produced a positive microbiological clover-leaf test with imipenem. Therefore, the pI 6.3 beta-lactamase was considered to be involved in the imipenem resistance of A. baumannii strain A148.     

Beeping a maximal independent set

We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neighbors beeping, or at least one of its neighbors beeping. We start by proving a lower bound that shows that in this model, it is not possible to locally converge to an MIS in sub-polynomial time. We then study four different relaxations of the model which allow us to circumvent the lower bound and find an MIS in polylogarithmic time. First, we show that if a polynomial upper bound on the network size is known, it is possible to find an MIS in $\mathcal O (\log ^3 n)$ time. Second, if we assume sleeping nodes are awoken by neighboring beeps, then we can also find an MIS in $\mathcal O (\log ^3 n)$ time. Third, if in addition to this wakeup assumption we allow sender-side collision detection, that is, beeping nodes can distinguish whether at least one neighboring node is beeping concurrently or not, we can find an MIS in $\mathcal O (\log ^2 n)$ time. Finally, if instead we endow nodes with synchronous clocks, it is also possible to find an MIS in $\mathcal O (\log ^2 n)$ time.     

Common2 extended to stacks and unbounded concurrency

This paper extends Common2, the family of objects that implement and are wait-free implementable from 2 consensus objects, in two ways: First, the stack object is shown to be in the family, refuting a conjecture to the contrary [6]. Second, Common2 is investigated in the unbounded concurrency model, whereas until now it was considered only in an n-process model. We show that the fetch-and-add, test-and-set , and stack objects are in Common2 even with respect to this stronger notion of wait-free implementation. Our constructions rely on a wait-free implementation of immediate snapshots in the unbounded concurrency model, which was previously not known to be possible. The introduction of unbounded concurrency to the study of Common2 opens several directions of research: are there objects that have n-process implementations but are not unbounded concurrency implementable? We conjecture that swap is such an object. Additionally, the hope is that a queue impossibility proof, which eludes us in the n-process model, will be easier to establish in the unbounded concurrency model.     

Improved BGP convergence via ghost flushing

Labovitz et al. (2001) and Labovitz et al. (2000) noticed that sometimes it takes border gateway protocol (BGP) a substantial amount of time and messages to converge and stabilize following the failure of some node in the Internet. In this paper, we suggest a minor modification to BGP that eliminates the problem pointed out and substantially reduces the convergence time and communication complexity of BGP. Roughly speaking, our modification ensures that bad news (the failure of a node/edge) propagate fast, while good news (the establishment of a new path to a destination) propagate somewhat slower. This is achieved in BGP by allowing withdrawal messages to propagate with no delay as fast as the network forward them, while announcements propagate as they do in BGP with a delay at each node of one minRouteAdver (except for the first wave of announcements). As a by product of this work, a new stateless mechanism to overcome the counting to infinity problem is provided, which compares favorably with other known stateless mechanisms (in RIP and IGRP).     

Theophylline induces diapause-like state in social wasps

Feeding of theophylline to hornet workers from their moment of eclosion during the summer results in the following effects on the hornets: loss of appetite for proteins, inhibited ovarial development, no cell-building activity, negative phototaxis, gradual slow-down of spontaneous motor activity, difficulty in flight and orientation, and an overall behavior pattern reminiscent of hornet queens in nature when they are in a state of winter diapause. These findings suggest that theophylline exerts anti-juvenile-hormone-like effects on hornets and raise the possibility of utilizing theophylline baits to suppress pest hornet populations.     

Restoration by path concatenation: fast recovery of MPLS paths

A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove that a shortest path in a network after removing k edges is the concatenation of at most k+1 shortest paths in the original network. The theory is then combined with efficient path concatenation techniques in MPLS (multi-protocol label switching), to achieve powerful schemes for restoration in MPLS based networks. We thus transform MPLS into a flexible and robust method for forwarding packets in a network. Finally, the different schemes suggested are evaluated experimentally on three large networks (a large ISP, the AS graph of the Internet, and the full Internet topology). These experiments demonstrate that the restoration schemes perform well in actual topologies. Received: December 2001 / Accepted: July 2002 RID="*" ID="*" This research was supported by a grant from the Ministry of Science, Israel