662 resultados para Text files
Resumo:
info:eu-repo/semantics/published
Resumo:
Two accelerometric records coming from the SAMSes es08 sensor in the Columbus module, the so-called Runs 14 and 33 in terms of the IVIDIL experiment, has been studied here using standard digital signal analysis techniques. The principal difference between both records is the vibrational state of IVIDIL, that is to say, during Run 14 the shacking motor of the experiment is active while that in Run 33 this motor is stopped. Identical procedures have been applied to a third record coming from the SAMSII 121f03 sensor located in the Destiny module during an IVIDIL quiescent period. All records have been downloaded from the corresponding public binary accelerometric files from the NASA Principal Investigator Microgravity Services, PIMS website and, in order to be properly compared, have the same number of data. Results detect clear differences in the accelerometric behavior, with or without shaking, despite the care of the designers to ensure the achievement of the ISS pg-vibrational requirements all along the experiments. Copyright © (2012) by the International Astronautical Federation.
Resumo:
SCOPUS: no.j
Resumo:
The Kππ enhancement at 1780 MeV (the "L meson") is copiously produced in our K+p experiment at 12 GeV/c. We show that this "meson" can be explained as a threshold enhancement in the KN(1420)π system. We see no evidence for this enhancement in channels other than KN(1420)π. © 1969 The American Physical Society.
Resumo:
An extended formulation of a polyhedron P is a linear description of a polyhedron Q together with a linear map π such that π(Q)=P. These objects are of fundamental importance in polyhedral combinatorics and optimization theory, and the subject of a number of studies. Yannakakis’ factorization theorem (Yannakakis in J Comput Syst Sci 43(3):441–466, 1991) provides a surprising connection between extended formulations and communication complexity, showing that the smallest size of an extended formulation of $$P$$P equals the nonnegative rank of its slack matrix S. Moreover, Yannakakis also shows that the nonnegative rank of S is at most 2c, where c is the complexity of any deterministic protocol computing S. In this paper, we show that the latter result can be strengthened when we allow protocols to be randomized. In particular, we prove that the base-2 logarithm of the nonnegative rank of any nonnegative matrix equals the minimum complexity of a randomized communication protocol computing the matrix in expectation. Using Yannakakis’ factorization theorem, this implies that the base-2 logarithm of the smallest size of an extended formulation of a polytope P equals the minimum complexity of a randomized communication protocol computing the slack matrix of P in expectation. We show that allowing randomization in the protocol can be crucial for obtaining small extended formulations. Specifically, we prove that for the spanning tree and perfect matching polytopes, small variance in the protocol forces large size in the extended formulation.
Resumo:
SCOPUS: no.j
Resumo:
This article reports a unique analysis of private engagements by an activist fund. It is based on data made available to us by Hermes, the fund manager owned by the British Telecom Pension Scheme, on engagements with management in companies targeted by its UK Focus Fund. In contrast with most previous studies of activism, we report that the fund executes shareholder activism predominantly through private interventions that would be unobservable in studies purely relying on public information. The fund substantially outperforms benchmarks and we estimate that abnormal returns are largely associated with engagements rather than stock picking. © The Author 2008.
Resumo:
We show that coherent phase effects may play a relevant role in the nonlinear propagation of partially incoherent waves, which lead to unexpected processes of condensation, or incoherent soliton generation in instantaneous response nonlinear media. © 2005 OSA.
Resumo:
We develop a framework for proving approximation limits of polynomial size linear programs (LPs) from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any LP as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n1/2-ε)-approximations for CLIQUE require LPs of size 2nΩ(ε). This lower bound applies to LPs using a certain encoding of CLIQUE as a linear optimization problem. Moreover, we establish a similar result for approximations of semidefinite programs by LPs. Our main technical ingredient is a quantitative improvement of Razborov's [38] rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of shifts of the unique disjointness matrix.
Resumo:
SCOPUS: sh.j
Resumo:
Hyponatraemia, defined as a serum sodium concentration <135 mmol/l, is the most common disorder of body fuid and electrolyte balance encountered in clinical practice. It can lead to a wide spectrum of clinical symptoms, from subtle to severe or even life threatening, and is associated with increased mortality, morbidity and length of hospital stay in patients presenting with a range of conditions. Despite this, the management of patients remains problematic. The prevalence of hyponatraemia in widely different conditions and the fact that hyponatraemia is managed by clinicians with a broad variety of backgrounds have fostered diverse institution-and speciality-based approaches to diagnosis and treatment. To obtain a common and holistic view, the European Society of Intensive Care Medicine (ESICM), the European Society of Endocrinology (ESE) and the European Renal Association-European Dialysis and Transplant Association (ERA-EDTA), represented by European Renal Best Practice (ERBP), have developed the Clinical Practice Guideline on the diagnostic approach and treatment of hyponatraemia as a joint venture of three societies representing specialists with a natural interest in hyponatraemia. In addition to a rigorous approach to methodology and evaluation, we were keen to ensure that the document focused on patient-important outcomes and included utility for clinicians involved in everyday practice.
Resumo:
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs.
Resumo:
The Askar'yan Radio Array (ARA), a neutrino detector to be situated at the South Pole next to the IceCube detector, will be sensitive to ultrahigh-energy cosmic neutrinos above 0.1 EeV and will have the greatest sensitivity within the favored energy range from 0.1 EeV up to 10 EeV. Neutrinos of this energy are guaranteed by current observations of the GZK-cutoff by the HiRes and Pierre Auger Observatories. The detection method is based on Cherenkov emission by a neutrino induced cascade in the ice, coherent at radio wavelengths, which was predicted by Askar'yan in 1962 and verified in beam tests at SLAC in 2006. The detector is planned to consist of 37 stations with 16 antennas each, deployed at depths of up to 200 m under the ice surface. During the last two polar seasons (2010-2011, 2011-2012), a prototype station and a first detector station were successfully deployed and are taking data. These data have been and are currently being analyzed to study the ambient noise background and the radio frequency properties of the South Pole ice sheet. A worldwide collaboration is working on the planning, construction and data analysis of the detector array. This article will give a short report on the status of the ARA detector and show recent results from the recorded data. © 2013 AIP Publishing LLC.
Resumo:
info:eu-repo/semantics/nonPublished
Resumo:
info:eu-repo/semantics/nonPublished