Search results for "data structures"

showing 10 items of 258 documents

"Table 17" of "Search for a Heavy Neutral Particle Decaying to $e\mu$, $e\tau$, or $\mu\tau$ in $pp$ Collisions at $\sqrt{s}=8$ TeV with the ATLAS De…

2015

Cut flow for signal $\tilde{\nu}_{\tau}$ and Z' at 1TeV mass point.

Physics::Fluid Dynamics8000.0NComputer Science::Data Structures and Algorithms
researchProduct

A Constructive Arboricity Approximation Scheme

2020

The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.

PseudoforestArboricityApproximation algorithm0102 computer and information sciences02 engineering and technology01 natural sciencesConstructiveCombinatoricsSet (abstract data type)Computer Science::Discrete Mathematics010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Partition (number theory)020201 artificial intelligence & image processingMatroid partitioningComputer Science::Data Structures and AlgorithmsGeneralLiterature_REFERENCE(e.g.dictionariesencyclopediasglossaries)Computer Science::Distributed Parallel and Cluster ComputingMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

Analyticity of a restricted formality

2020

International audience; The Kontsevich formality can be viewed as a non-linear map ℱ from the L∞ algebra of poly-vector fields on ℝd to the space of poly-differential operators. The space of the half-homogenous poly-vector fields is a sub-L∞ algebra. We prove here that the restriction of ℱto this subspace is weakly analytic.

Pure mathematics010102 general mathematicsStatistical and Nonlinear PhysicsFormalityComputer Science::Computational Complexity16. Peace & justiceSpace (mathematics)01 natural sciences0103 physical sciences010307 mathematical physics0101 mathematicsAlgebra over a field[MATH]Mathematics [math]Computer Science::Data Structures and AlgorithmsMathematical PhysicsSubspace topologyMathematics
researchProduct

Scalar quark searches in $e^+ e^-$ collisions at $\sqrt{s}$ = 181-184 GeV

1998

Searches for scalar top, scalar bottom and degenerate scalar quarks have been performed with data collected with the ALEPH detector at LEP. The data sample consists of 57 pb^-1 taken at sqrt{s} = 181-184 GeV. No evidence for scalar top, scalar bottom or degenerate scalar quarks was found in the channels tilde{t} --> c chi, tilde{t} --> b l snu, tilde{b} --> b chi, and tilde{q} --> q chi. From the channel tilde{t} --> c chi a limit of 74 GeV/c^2 has been set on the scalar top quark mass, independent of the mixing angle. This limit assumes a mass difference between the stop and the chi in the range 10-40 GeV/c^2. From the channel tilde{t} --> b l snu the mixing-angle-indepen…

QuarkPhysicsNuclear and High Energy PhysicsParticle physicsTop quark010308 nuclear & particles physicsDegenerate energy levelsScalar (mathematics)High Energy Physics::PhenomenologyFOS: Physical sciencesState (functional analysis)01 natural sciencesBottom quarkHigh Energy Physics - ExperimentNuclear physicsHigh Energy Physics - Experiment (hep-ex)0103 physical sciences[PHYS.HEXP]Physics [physics]/High Energy Physics - Experiment [hep-ex]High Energy Physics::ExperimentLimit (mathematics)010306 general physicsComputer Science::Data Structures and AlgorithmsMixing (physics)Particle Physics - Experiment
researchProduct

Search for pair production of the scalar top quark in muon+tau final states

2012

We present a search for the pair production of scalar top quarks ($\tilde{t}_{1}$), the lightest supersymmetric partners of the top quarks, in $p\bar{p}$ collisions at a center-of-mass energy of 1.96 TeV, using data corresponding to an integrated luminosity of {7.3 $fb^{-1}$} collected with the \dzero experiment at the Fermilab Tevatron Collider. Each scalar top quark is assumed to decay into a $b$ quark, a charged lepton, and a scalar neutrino ($\tilde{\nu}$). We investigate final states arising from $\tilde{t}_{1} \bar{\tilde{t}_{1}} \rightarrow b\bar{b}\mu\tau \tilde{\nu} \tilde{\nu}$ and $\tilde{t}_{1} \bar{\tilde{t}_{1}} \rightarrow b\bar{b}\tau\tau \tilde{\nu} \tilde{\nu}$. With no si…

QuarkPhysicsNuclear and High Energy PhysicsTop quarkParticle physicsMuon010308 nuclear & particles physicsHigh Energy Physics::PhenomenologyFOS: Physical sciences01 natural sciences7. Clean energyStandard ModelHigh Energy Physics - ExperimentHigh Energy Physics - Experiment (hep-ex)Pair production0103 physical sciencesExperimental High Energy PhysicsComputingMethodologies_DOCUMENTANDTEXTPROCESSING[PHYS.HEXP]Physics [physics]/High Energy Physics - Experiment [hep-ex]Production (computer science)High Energy Physics::Experiment010306 general physicsComputer Science::Data Structures and AlgorithmsEnergy (signal processing)Lepton
researchProduct

Search for Pair Production of Supersymmetric Top Quarks in Dilepton Events frompp¯Collisions ats=1.96  TeV

2010

We present the results of a search for pair production of the supersymmetric partner of the top quark (the top squark (t) over tilde (1)) decaying to a b quark and a chargino (chi) over tilde (+/-)(1) with a subsequent (chi) over tilde (+/-)(1) decay into a neutralino (chi) over tilde (0)(1), lepton l, and neutrino nu Using a data sample corresponding to 2.7 fb(-1) of integrated luminosity of p (p) over bar collisions at root s = 1: 96 TeV collected by the CDF II detector, we reconstruct the mass of top squark candidate events and fit the observed mass spectrum to a combination of standard model processes and (t) over tilde (1)(t) over tilde (1). We find no evidence for (t) over tilde (1)(t…

QuarkPhysicsTop quarkParticle physics010308 nuclear & particles physicsBranching fractionHigh Energy Physics::PhenomenologyGeneral Physics and Astronomy01 natural sciencesBottom quarkStandard ModelNuclear physicsCharginoPair production0103 physical sciencesNeutralinoHigh Energy Physics::ExperimentComputer Science::Data Structures and Algorithms010306 general physicsPhysical Review Letters
researchProduct

Integrated Production and Predictive Maintenance Planning based on Prognostic Information

2019

International audience; This paper address the problem of scheduling production and maintenance operation in predictive maintenance context. It proposes a contribution in the decision making phase of the prognostic and health management framework. Theprognostics and decision processes are merged and an ant colony optimization approach for finding the sequence of decisions that optimizes the benefits of a production system is developed. A case study on a single machine composed of several components where machine can have several usage profiles. The results show thatour approach surpasses classical condition based maintenance policy.

Remaining UsefulLife0209 industrial biotechnology021103 operations researchHealth management systemOperations researchComputer scienceCondition-based maintenanceAnt colony optimization algorithms[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0211 other engineering and technologiesScheduling (production processes)02 engineering and technologyPredictive maintenanceAnt Colony Optimization[SPI.AUTO]Engineering Sciences [physics]/Automatic020901 industrial engineering & automationPrognostic InformationProduction and Maintenance SchedulingPrognosticsIntegrated productionDecision processPredic-tive Maintenance
researchProduct

Checkpointing Workflows for Fail-Stop Errors

2017

International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…

ScheduleComputer scienceworkflowDistributed computing[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]010103 numerical & computational mathematics02 engineering and technologyParallel computing[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]01 natural sciencesTheoretical Computer Science[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]checkpointfail-stop error0202 electrical engineering electronic engineering information engineeringOverhead (computing)[INFO]Computer Science [cs]0101 mathematicsresilienceClass (computer programming)020203 distributed computingJob shop schedulingProbabilistic logic020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationDynamic programmingTask (computing)[INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]WorkflowComputational Theory and MathematicsHardware and Architecture[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Task analysis[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Software
researchProduct

The Myriad Virtes of Wavelet Trees

2009

A new data structure, the wavelet tree, is analysied and discussed with particular attention to data compression

Settore INF/01 - InformaticaAlgorithms Data Structures Data Compression
researchProduct

2D-Pattern Indexing

2008

Data Structures for two-dimensional pattern matching are presented and discussed.

Settore INF/01 - InformaticaAlgorothms Data Structures
researchProduct