Search results for "algorithms"
showing 10 items of 1716 documents
"Table 2" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ =…
2015
Vertex-level efficiency as a function of the vertex radial position for an RPV SUSY model of squark production with $\tilde{q}\to q[\tilde{\chi}_1^0\to\mu qq]$, where $m(\tilde{q}) = 700$ GeV, $m(\tilde{\chi}_1^0) = 108$ GeV and $c\tau(\tilde{\chi}_1^0)$ = 101 mm.
"Table 37" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ …
2015
Vertex mass distributions in data and one RPV SUSY signal model, for vertices with 3, 4 and $\geq$5 tracks in the DV+muon channel. The entries are the number of DVs in each bin, not normalized according to bin size. The signal model is for squark pair production, with $\tilde{q}\to q[\tilde{\chi}_1^0\to\mu qq]$ decays, $m(\tilde{q})$ = 700 GeV, $m(\tilde{\chi}_1^0)$ = 494 GeV and $c\tau(\tilde{\chi}_1^0)$ = 175 mm.
"Table 39" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ …
2015
Vertex mass distributions in data and one RPV SUSY signal model, for vertices with 3, 4 and $\geq$5 tracks in the DV+electron channel. The entries are the number of DVs in each bin, not normalized according to bin size. The signal model is for squark pair production, with $\tilde{q}\to q[\tilde{\chi}_1^0\to e qq]$ decays, $m(\tilde{q})$ = 700 GeV, $m(\tilde{\chi}_1^0)$ = 494 GeV and $c\tau(\tilde{\chi}_1^0)$ = 175 mm.
"Table 3" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ =…
2015
Vertex-level efficiency as a function of the vertex radial position for an RPV SUSY model of squark production with $\tilde{q}\to q[\tilde{\chi}_1^0\to\mu qb]$, where $m(\tilde{q}) = 700$ GeV, $m(\tilde{\chi}_1^0) = 494$ GeV and $c\tau(\tilde{\chi}_1^0)$ = 175 mm. The other SUSY model point in the figure is tabulated in http://hepdata.cedar.ac.uk/view/ins1362183/d1.
"Table 35" of "Search for massive, long-lived particles using multitrack displaced vertices or displaced lepton pairs in pp collisions at $\sqrt{s}$ …
2015
Upper limits (95% CL) from the DV+$E_T^{miss}$ channel on the production cross-section and the corresponding event-level efficiencies (from Auxiliary Figure 11a) for four RPV SUSY models as a function of the $\tilde{\chi}_1^0$ proper decay distance $c\tau$. The models consider squark or gluino pair production, with masses in GeV as indicated, with either $\tilde{q}\to q[\tilde{\chi}_1^0\to \nu qq]$ or $\tilde{g}\to qq[\tilde{\chi}_1^0\to \nu qq]$ decays, respectively. For comparison, the production cross-sections for $m(\tilde{g})$ = 700 GeV, $m(\tilde{q})$ = 700 GeV and $m(\tilde{q})$ = 1000 GeV are $430\pm80$ fb, $124\pm17$ fb and $11.9\pm1.5$ fb, respectively.
Biological Peer-To-Peer Networks: From Bacterial Communication To The Development Of Synthetic Distributed Systems
2014
We address Bacterial Computing from the study of bacterial communication mechanisms, by assuming a conceptual framework between Computer Science and Biology in which cells are conceived as nodes. This nodes process information through modules formed of DNA as encoded software (biobricks) and are connected to other nodes. In order to understand how peerto-peer mechanisms operate in bacteria, we have studied Quorum sensing and Conjugation with an engineering perspective. Learning how cells process and exchange information we try to glimpse new theoretical approaches to develop synthetic networks and to transfer complex algorithms to natural environments. Extending bacterial communications we …
A hybrid short read mapping accelerator
2013
Background The rapid growth of short read datasets poses a new challenge to the short read mapping problem in terms of sensitivity and execution speed. Existing methods often use a restrictive error model for computing the alignments to improve speed, whereas more flexible error models are generally too slow for large-scale applications. A number of short read mapping software tools have been proposed. However, designs based on hardware are relatively rare. Field programmable gate arrays (FPGAs) have been successfully used in a number of specific application areas, such as the DSP and communications domains due to their outstanding parallel data processing capabilities, making them a compet…
Metabolic Pathway Analysis 2019: Systems (biology+medicine) : 12th-16th August 2019, Riga, Latvia
2019
Problemas multiplicativos relacionados con la división de fracciones : un estudio sobre su enseñanza y aprendizaje
2013
Los estudiantes tienen dificultades para asociar el enunciado de un problema multiplicativo con la operación que permite resolverlo; esta investigación identifica los tipos de problemas multiplicativos que los estudiantes reconocen como de división de fracciones. Mediante el análisis histórico-epistemológico de textos de enseñanza sobre tres épocas históricas y ocho períodos diferentes, se obtiene un listado de variables de enseñanza (algoritmos, sentidos de uso de fracción y de división de fracciones, representaciones, problemas), así como los valores de dichas variables. Se localizan en los textos consultados algunas reglas particulares y seis algoritmos generales, cuyo predominio ha vari…
Response of AGATA segmented HPGe detectors to gamma rays up to 15.1MeV
2013
WOS: 000314826000009