Search results for "data structures"

showing 10 items of 258 documents

The Rural Postman Problem on mixed graphs with turn penalties

2002

In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…

Mathematical optimizationTraverseGeneral Computer SciencePolynomial transformationTotal costMixed graphManagement Science and Operations ResearchTravelling salesman problemModeling and SimulationComputer Science::Data Structures and AlgorithmsHeuristicsArc routingMetaheuristicMathematicsComputers & Operations Research
researchProduct

Mappings of finite distortion: The sharp modulus of continuity

2003

We establish an essentially sharp modulus of continuity for mappings of subexponentially integrable distortion.

Mathematics::ProbabilityIntegrable systemApplied MathematicsGeneral MathematicsDistortionMathematical analysisGeometryComputer Science::Computational ComplexityComputer Science::Data Structures and AlgorithmsModulus of continuityMathematicsTransactions of the American Mathematical Society
researchProduct

Enhanced query processing for NoSQL crowdsourcing systems

2014

In this paper, we provide a novel approach for effectively and efficiently support query processing tasks in novel NoSQL crowdsourcing systems. The idea of our method is to exploit the social knowledge available from reviews about products of any kind, freely provided by customers through specialized web sites. We thus define a NoSQL database system for large collections of product reviews, where queries can be expressed in terms of natural language sentences whose answers are modeled as lists of products ranked based on the relevance of reviews w.r.t. the natural language sentences. The best ranked products in the result list can be seen as the best hints for the user based on crowd opinio…

Motion picturesData structuresExploitComputer scienceNatural languagesCrowdsourcingNoSQLcomputer.software_genreSemanticsComputational Theory and MathematicRelevance (information retrieval)Data miningComputational Theory and Mathematics; 1707; Software1707Information retrievalbusiness.industrySearch engine indexingSemantics; Natural languages; Motion pictures; Data mining; Indexing; Data structures;Data structureSemanticsComputational Theory and MathematicsIndexingbusinessSettore ING-INF/05 - Sistemi di Elaborazione delle InformazionicomputerNatural languageSoftware
researchProduct

Complexity of operations on cofinite languages

2010

International audience; We study the worst case complexity of regular operation on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the resulting minimal automata.

Nested wordTheoretical computer scienceSettore INF/01 - Informaticaautomata[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]regular operationReDoSComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyDescriptive complexity theorystate complexity01 natural sciencesComplement (complexity)Deterministic finite automaton010201 computation theory & mathematicsTheory of computation0202 electrical engineering electronic engineering information engineeringComputer Science::Programming LanguagesQuantum finite automata020201 artificial intelligence & image processingNondeterministic finite automatoncofinite languageMathematics
researchProduct

Optimal Design of Piezoelectric Cantilevered Actuators for Charge-Based Self-Sensing Applications

2019

Charge-based Self-Sensing Actuation (SSA) is a cost and space-saving method for accurate piezoelectric based-actuator positioning. However, the performance of its implementation resides in the choice of its geometry and the properties of the constituent materials. This paper intends to analyze the charge-based SSA&rsquo

Optimal design0209 industrial biotechnologyCantileverComputer sciencemicro-/nano-robotsMultiphysics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]designMechanical engineering02 engineering and technologylcsh:Chemical technology01 natural sciencesBiochemistryArticle[SPI.AUTO]Engineering Sciences [physics]/AutomaticAnalytical Chemistry020901 industrial engineering & automation0103 physical scienceslcsh:TP1-1185Electrical and Electronic EngineeringInstrumentation010302 applied physicsself-sensing actuationFunction (mathematics)PiezoelectricityAtomic and Molecular Physics and OpticsComputer Science::OtherParametric modelActuatoroptimizationpiezoelectric actuators and sensorsSensors
researchProduct

"Exclusion contour(exp.) 8 : Meff" of "Search for squarks and gluinos in final states with jets and missing transverse momentum using 36 fb$^{-1}$ of…

2018

Expected 95% CL exclusion contours from Meff-based searches on the squark mass and the mass gap ratio x in a SUSY scenario where squarks are produced in pairs and decay via an intermediate lightest chargino or second lightest neutralino to the lightest neutralino, $\tilde{q} \rightarrow q \tilde{\chi}_{1}^{\pm} \rightarrow q W^{\pm} \tilde{\chi}_{1}^{0}$, or $\tilde{q} \rightarrow q \tilde{\chi}_{2}^{0} \rightarrow qq Z/h \tilde{\chi}_{1}^{0}$.

P P --> SQUARK SQUARK X13000.0CLSHigh Energy Physics::PhenomenologyHigh Energy Physics::ExperimentComputer Science::Data Structures and Algorithms
researchProduct

"Exclusion contour(obs.) 8 : Meff" of "Search for squarks and gluinos in final states with jets and missing transverse momentum using 36 fb$^{-1}$ of…

2018

Observed 95% CL exclusion contours from Meff-based searches on the squark mass and the mass gap ratio x in a SUSY scenario where squarks are produced in pairs and decay via an intermediate lightest chargino or second lightest neutralino to the lightest neutralino, $\tilde{q} \rightarrow q \tilde{\chi}_{1}^{\pm} \rightarrow q W^{\pm} \tilde{\chi}_{1}^{0}$, or $\tilde{q} \rightarrow q \tilde{\chi}_{2}^{0} \rightarrow qq Z/h \tilde{\chi}_{1}^{0}$.

P P --> SQUARK SQUARK X13000.0CLSHigh Energy Physics::PhenomenologyHigh Energy Physics::ExperimentComputer Science::Data Structures and Algorithms
researchProduct

"X-section U.L. & best SR 8 : Meff" of "Search for squarks and gluinos in final states with jets and missing transverse momentum using 36 fb$^{-1…

2018

Observed 95% CL upper limit on the signal cross-section from Meff-based searches in a SUSY scenario where squarks are produced in pairs and decay via an intermediate lightest chargino or second lightest neutralino to the lightest neutralino, $\tilde{q} \rightarrow q \tilde{\chi}_{1}^{\pm} \rightarrow q W^{\pm} \tilde{\chi}_{1}^{0}$, or $\tilde{q} \rightarrow q \tilde{\chi}_{2}^{0} \rightarrow qq Z/h \tilde{\chi}_{1}^{0}$.

P P --> SQUARK SQUARK X13000.0High Energy Physics::PhenomenologyHigh Energy Physics::ExperimentComputer Science::Data Structures and AlgorithmsSIG
researchProduct

"Table 1" of "$\Lambda$ polarization in associated K$^+$ - $\Lambda$ electro-production"

2000

LAMBDA polarization, with respect to the p_gamma x p_k axis.

POLMathematics::CombinatoricsStrange productionElectron productionComputer Science::Discrete Mathematics2.91PolarizationE- P --> LAMBDA K+ E-ExclusiveComputer Science::Data Structures and Algorithms
researchProduct

Coherent quantum evolution via reservoir driven holonomies.

2006

We show that in the limit of a strongly interacting environment a system initially prepared in a decoherence-free subspace (DFS) coherently evolves in time, adiabatically following the changes of the DFS. If the reservoir cyclicly evolves in time, the DFS states acquire a holonomy.

PhysicsQuantum decoherenceHolonomyGeneral Physics and AstronomyComputer Science::Software EngineeringQuantum evolutionComputer Science::PerformanceQuantum mechanicsHolonomieLimit (mathematics)Decoherence-free subspace (DFS)Quantum evolutionComputer Science::Data Structures and AlgorithmsSubspace topologyPhysical review letters
researchProduct