Search results for "dab"

showing 10 items of 1280 documents

Recycling of a starch-based biodegradable polymer

2002

A new starch-based polymeric system, ZI1OU from Novamont, mainly composed of starch and polycaprolactone, was reprocessed several times in an extruder to investigate the recyclability of this biodegradable polymer. A previous investigation of the thermomechanical degradation in a mixer has been also done. The degradation is mostly due to the thermal stress but the presence of the mechanical stress strongly increases the degradation kinetic. During melt processing two concurrent processes take place: the first is the degradation, i.e. the breaking and shortening of polymeric chains, mostly occurring in the PCL phase; the second is the formation of some crosslinked structure in the starch pha…

Extrusion mouldingMaterials sciencePolymers and PlasticsMaterBi biodegradable polymer recycling processingStarchOrganic ChemistryPlastics extrusionmacromolecular substancesCondensed Matter PhysicsBiodegradable polymerchemistry.chemical_compoundSettore ING-IND/22 - Scienza E Tecnologia Dei MaterialichemistryPolycaprolactoneMaterials ChemistryDegradation (geology)ExtrusionPolymer blendComposite materialMacromolecular Symposia
researchProduct

Progettazione e sviluppo del software R.A.D. per analisi FMECA

2012

Ad oggi l’analisi FMECA (Failure Modes, Effects and Criticality Analysis) si è dimostrata uno strumento di indagine molto utile per lo studio dell’affidabilità dei componenti dei vari sistemi di un impianto. Tuttavia, l’applicazione sistematica di tale metodologia, anche nel caso di impianti relativamente semplici, risulta onerosa in termini di risorse necessarie ai fini della sua conduzione e gestione. A supporto dell’analisi, esiste una buona varietà di software sviluppati per lo scopo, tuttavia spesso essi presentano alcune funzionalità selettive essendo dedicati all’impiego in ambiti specifici. Alla luce di tale limitazione si è pensato di realizzare e mettere a punto un software sempli…

FMECA RAD affidabilitàSettore ING-IND/19 - Impianti Nucleari
researchProduct

Topological Logics with Connectedness over Euclidean Spaces

2013

We consider the quantifier-free languages, Bc and Bc °, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of R n ( n ≥ 2) and, additionally, over the regular closed semilinear sets of R n . The resulting logics are examples of formalisms that have recently been proposed in the Artificial Intelligence literature under the rubric Qualitative Spatial Reasoning. We prove that the satisfiability problem for Bc is undecidable over the regular closed semilinear sets in all dimensions greater than 1,…

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceGeneral Computer ScienceUnary operationClosed setLogicSocial connectedness0102 computer and information sciencesTopological space68T30 (Primary) 03D15 68Q17 (Secondary)Topology01 natural sciencesTheoretical Computer ScienceMathematics - Geometric TopologyEuclidean geometryFOS: Mathematics0101 mathematicsMathematicsI.2.4; F.4.3; F.2.2Discrete mathematicsI.2.4010102 general mathematicsGeometric Topology (math.GT)Predicate (mathematical logic)Undecidable problemLogic in Computer Science (cs.LO)Computational Mathematics010201 computation theory & mathematicsF.4.3F.2.2Boolean satisfiability problemACM Transactions of Computational Logic
researchProduct

The fluted fragment with transitive relations

2022

Abstract The fluted fragment is a fragment of first-order logic (without equality) in which, roughly speaking, the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that this fragment has the finite model property. We consider extensions of the fluted fragment with various numbers of transitive relations, as well as the equality predicate. In the presence of one transitive relation (together with equality), the finite model property is lost; nevertheless, we show that the satisfiability and finite satisfiability problems for this extension remain decidable. We also show that the corresponding problems in the…

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTransitivityTransitive relationLogicFinite model propertyF.4.1; F.2.2DecidabilityExtension (predicate logic)SatisfiabilityLogic in Computer Science (cs.LO)DecidabilityUndecidable problemFluted logicCombinatoricsFragment (logic)03D15F.4.1Order (group theory)F.2.2SatisfiabilityMathematicsAnnals of Pure and Applied Logic
researchProduct

Visibly pushdown modular games,

2014

Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a module and is oblivious to previous module invocations, and thus does not depend on the context of invocation. In this work, we study for the first time modular strategies with respect to winning conditions that can be expressed by a pushdown automaton. We show that such games are undecidable in general, and become decidable for visibly pushdown automata specifications. Our solution relies on a reduction to modular games with finite-state automat…

FOS: Computer and information sciencesComputer Science::Computer Science and Game TheoryComputer Science - Logic in Computer ScienceTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceFormal Languages and Automata Theory (cs.FL)Computer scienceComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)Pushdown01 natural scienceslcsh:QA75.5-76.95Theoretical Computer ScienceComputer Science - Computer Science and Game TheoryComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineeringTemporal logicRecursionbusiness.industrylcsh:MathematicsGames; Modular; Pushdown; Theoretical Computer Science; Information Systems; Computer Science Applications; Computational Theory and MathematicsPushdown automatonModular designDecision problemlcsh:QA1-939Logic in Computer Science (cs.LO)Computer Science ApplicationsUndecidable problemDecidabilityNondeterministic algorithmComputer Science - Computational ComplexityModularTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics010201 computation theory & mathematics020201 artificial intelligence & image processinglcsh:Electronic computers. Computer scienceGamesbusinessComputer Science::Formal Languages and Automata TheoryComputer Science and Game Theory (cs.GT)Information SystemsInformation and Computation
researchProduct

Probabilistic and team PFIN-type learning: General properties

2008

We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p_1 and p_2 and answers whether PFIN-type learning with the probability of success p_1 is equivalent to PFIN-type learning with the probability of success p_2. To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal epsilon_0. This shows that the structure of the hierarchy is very complicated. Using similar methods, we also prove that, for PFIN-type learning…

FOS: Computer and information sciencesComputer Science::Machine LearningTheoretical computer scienceComputer Networks and CommunicationsExistential quantificationStructure (category theory)DecidabilityType (model theory)Learning in the limitTheoretical Computer ScienceMachine Learning (cs.LG)Probability of successFinite limitsMathematicsOrdinalsDiscrete mathematicsHierarchybusiness.industryApplied MathematicsAlgorithmic learning theoryProbabilistic logicF.1.1 I.2.6Inductive inferenceInductive reasoningDecidabilityComputer Science - LearningTeam learningComputational Theory and MathematicsArtificial intelligencebusinessJournal of Computer and System Sciences
researchProduct

Anti-powers in infinite words

2018

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existence of powers or anti-powers is an unavoidable regularity. Indeed, we prove a stronger result, which relates the density of anti-powers to the existence of a factor that occurs with arbitrary exponent. As a consequence, we show that in every aperiodic uniformly recurrent word, anti-powers of ev…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)ConcatenationComputer Science - Formal Languages and Automata Theory68R150102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsUnavoidable regularityPosition (vector)Infinite wordAvoidability[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsOrder (group theory)Point (geometry)0101 mathematicsDiscrete Mathematics and CombinatoricMathematicsDiscrete mathematics000 Computer science knowledge general worksAnti-power010101 applied mathematicsComputational Theory and Mathematics010201 computation theory & mathematicsAperiodic graphComputer ScienceExponentPairwise comparisonCombinatorics (math.CO)SoftwareWord (group theory)Computer Science - Discrete Mathematics
researchProduct

The Fluted Fragment with Transitivity

2019

We study the satisfiability problem for the fluted fragment extended with transitive relations. We show that the logic enjoys the finite model property when only one transitive relation is available. On the other hand we show that the satisfiability problem is undecidable already for the two-variable fragment of the logic in the presence of three transitive relations.

FOS: Computer and information sciencesFirst-Order logicComputer Science - Logic in Computer ScienceTransitivity000 Computer science knowledge general worksComputer Science::Logic in Computer ScienceComputer ScienceDecidabilityComplexitySatisfiabilityLogic in Computer Science (cs.LO)
researchProduct

Towards nonlocal density functionals by explicit modelling of the exchange-correlation hole in inhomogeneous systems

2013

We put forward new approach for the development of a non-local density functional by a direct modeling of the shape of exchange-correlation (xc) hole in inhomogeneous systems. The functional is aimed at giving an accurate xc-energy and an accurate corresponding xc-potential even in difficult near-degeneracy situations such as molecular bond breaking. In particular we demand that: (1) the xc hole properly contains -1 electron, (2) the xc-potential has the asymptotic -1/r behavior outside finite systems and (3) the xc-potential has the correct step structure related to the derivative discontinuities of the xc-energy functional. None of the currently existing functionals satisfies all these re…

FOS: Physical sciences02 engineering and technologyElectronClassification of discontinuities01 natural sciencesDFTCondensed Matter - Strongly Correlated ElectronsAtomic orbitalQuantum mechanicsPhysics - Chemical Physics0103 physical sciencesPhysics - Atomic and Molecular ClustersSDG 7 - Affordable and Clean Energy010306 general physicsEnergy functionalChemical Physics (physics.chem-ph)PhysicsQuantum Physics/dk/atira/pure/sustainabledevelopmentgoals/affordable_and_clean_energyStrongly Correlated Electrons (cond-mat.str-el)ta114theoretical nanoscienceFunction (mathematics)021001 nanoscience & nanotechnologyAtomic and Molecular Physics and OpticsCondensed Matter - Other Condensed MatterDensity functional theorySum rule in quantum mechanicsLocal-density approximationAtomic and Molecular Clusters (physics.atm-clus)Quantum Physics (quant-ph)0210 nano-technologyOther Condensed Matter (cond-mat.other)Physical Review A
researchProduct

Observation of Photon Polarization in theb→sγTransition

2014

This Letter presents a study of the flavor-changing neutral current radiative $B^{\pm} \to K^{\pm}\pi^{\mp}\pi^{\pm}\gamma$ decays performed using data collected in proton-proton collisions with the LHCb detector at $7$ and $8\,$TeV center-of-mass energies. In this sample, corresponding to an integrated luminosity of $3\,\text{fb}^{-1}$, nearly $14\,000$ signal events are reconstructed and selected, containing all possible intermediate resonances with a $K^{\pm}\pi^{\mp}\pi^{\pm}$ final state in the $[1.1, 1.9]\,$GeV/$c^{2}$ mass range. The distribution of the angle of the photon direction with respect to the plane defined by the final-state hadrons in their rest frame is studied in interva…

Final statePhotonmedia_common.quotation_subject14.40.NdHadronGeneral Physics and AstronomyLHCb - Abteilung Hofmann12.15.MmAsymmetryHigh energy physics Polarization Tellurium compounds; Center-of-mass energies Direct observations Final state Flavor-changing neutral current Integrated luminosity Photon polarization Proton proton collisions; PhotonsNeutral currentNuclear physicsTellurium compoundsCenter-of-mass energiesPhysics and Astronomy (all)Flavor-changing neutral currentPolarizationPhoton polarizationLeptonic semileptonic and radiative decays of bottom mesonRadiative transferIntermediate stateSDG 7 - Affordable and Clean EnergyHigh energy physicsQCmedia_commonPhysicsIntegrated luminosityPhotons/dk/atira/pure/sustainabledevelopmentgoals/affordable_and_clean_energyProton proton collisionsNeutral currentDirect observationsParticle physicsRest framePhoton polarizationLHCb13.20.HeBottom mesons (|B|>0)High Energy Physics::ExperimentLHCFísica de partículesExperimentsPhysical Review Letters
researchProduct