Search results for "Formal Language"

showing 10 items of 357 documents

"Table 50" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

observed CLs values for the 1LSR region in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.

InclusiveDijet ProductionProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 7" of "Search for a heavy top-quark partner in final states with two leptons with the ATLAS detector at the LHC"

2012

(1) Observed CLs values for the scalar top signal grid (2) Expected CLs values for the scalar top signal grid.

InclusiveNonlinear Sciences::Exactly Solvable and Integrable SystemsProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceCLSPhysics::Atomic and Molecular ClustersTop7000.0Jet ProductionP P --> 2LEPTON JETS XComputer Science::Computers and SocietyComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 60" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

observed CLs values for the best expected combination in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.

InclusiveProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 59" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

expected CLs values for the best expected combination in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.

InclusiveProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 65" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

expected CLs values for the best expected combination in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.

InclusiveProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

"Table 66" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…

2013

observed CLs values for the best expected combination in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.

InclusiveProton-Proton ScatteringComputer Science::Computational Engineering Finance and ScienceHigh Energy Physics::PhenomenologyP P --> LEPTONS JETS BJETS MM XTop7000.0High Energy Physics::ExperimentJet ProductionNNuclear ExperimentComputer Science::Formal Languages and Automata Theory
researchProduct

Towards efficient inductive synthesis from input/output examples

1994

Inductive synthesisInput/outputComputer scienceFormal languageBrute-force searchArithmeticAlgebraic expression
researchProduct

Rough Pragmatic Description Logic

2013

In this chapter, a rough description logic is built on the basis of a pragmatic standpoint of representation of knowledge. The pragmatic standpoint has influenced the acceptance of a broader definition of the semantic network than that appearing in the literature. The definition of the semantic network is a motivation of the introduced semantics of the language of the descriptive logic. First, the theoretical framework of representation of knowledge that was proposed in the papers [24,25] is adjusted to the description of data processing. The pragmatic system of knowledge representation is determined, as well as situations of semantic adequacy and semantic inadequacy for represented knowled…

Interpretation (logic)Knowledge representation and reasoningbusiness.industrycomputer.software_genreSemanticsSemantic networkDescription logicFormal languageInformation systemRough setArtificial intelligencebusinesscomputerNatural language processingMathematics
researchProduct

Field-free two-direction alignment alternation of linear molecules by elliptic laser pulses

2005

We show that a linear molecule subjected to a short specific elliptically polarized laser field yields postpulse revivals exhibiting alignment alternatively located along the orthogonal axis and the major axis of the ellipse. The effect is experimentally demonstrated by measuring the optical Kerr effect along two different axes. The conditions ensuring an optimal field-free alternation of high alignments along both directions are derived.

Kerr effectI-2 MOLECULESField (physics)General Physics and AstronomyFOS: Physical sciencesLinear molecular geometry02 engineering and technologyElliptical polarizationEllipse01 natural scienceslaw.inventionOpticsREVIVAL STRUCTURESlaw0103 physical sciencesOPTICAL CENTRIFUGEAlternation (formal language theory)010306 general physicsPhysicsQuantum Physicsbusiness.industry021001 nanoscience & nanotechnologyLaserOrthogonal coordinates0210 nano-technologybusinessQuantum Physics (quant-ph)
researchProduct

Vertical Representation of C∞-words

2015

International audience; We present a new framework for dealing with C∞-words, based on their left and right frontiers. Thisallows us to give a compact representation of them, and to describe the set of C∞-words throughan infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers ofC∞-words. We show that this map can be defined recursively and with no explicit reference toC∞-words. We then show that some important conjectures on C∞-words follow from analogousstatements on the structure of the graph G.

Kolakoski wordC∞-wordsComputer Science (all)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]directed acyclic graphComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)directed setrecursive function[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computer Science::Formal Languages and Automata Theory[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]C∞-wordTheoretical Computer Science
researchProduct