Search results for "PROPERTY"

showing 10 items of 955 documents

Histoire et évolution des appellations d'origine françaises

2019

During the 20th century, wine appellations of origin have largely developed to represent a significant part of the wine production of some countries, especially in Europe. The globalization of the production, trade and consumption of wine is a major fact of the 21st century economy. The question of appellations of origin and more generally geographical indications must be asked: Is it a survival 100 years after the first law on appellations of origin was adopted in France? Historical knowledge makes it possible to understand how law, both national and international, has been marked by major developments in this area. Regulations on the origin of products have undergone significant changes o…

Environmental Engineeringlcsh:QP1-981lcsh:QR1-502Context (language use)Intellectual propertyConsumption (sociology)Industrial and Manufacturing Engineeringlcsh:Microbiologylcsh:PhysiologyGlobalizationEconomySustainabilitylcsh:Zoologylcsh:QL1-991Emerging marketsStrengths and weaknessesTheme (narrative)BIO Web of Conferences
researchProduct

Homopolymerization of styrenic monomers and their copolymerization with ethylene using group 4 non‐metallocene catalysts

2020

Homopolymerization of styrenic monomers (St, p ‐Me‐St, p ‐t Bu‐St, p ‐t BuO‐St) and their copolymerization with ethylene, with the use of [( t Bu2O2NN′)ZrCl]2(μ‐O) (1 ) and ( t Bu2O2NN′)TiCl2 (2 ), where t Bu2O2NN′ = Me2N(CH2)2N(CH2‐2‐O−‐3,5‐t Bu2‐C6H2)2, is explored in the presence of MMAO and (i Bu)3Al/Ph3CB(C6F5)4. The ethylene/styrenic monomers copolymerization with 1 /MMAO produces exclusively copolymers with high activity and good comonomer incorporation whereas the other catalytic systems yield mixtures of copolymers and homopolymers. The use of p ‐alkyl styrene derivatives instead of styrene raises the catalytic activity, comonomer incorporation and molecular weights of the copolyme…

EthylenePolymers and Plasticsstructure–property relationshipsGeneral ChemistrypolystyrenecatalystsSurfaces Coatings and FilmsCatalysischemistry.chemical_compoundMonomerchemistryGroup (periodic table)Polymer chemistryMaterials ChemistryCopolymercopolymersPolystyreneMetalloceneJournal of Applied Polymer Science
researchProduct

Justice Perceptions as Predictors of Customer Satisfaction: The Impact of Distributive, Procedural, and Interactional Justice1

2006

This article attempts to extend prior research by testing the effects of justice components (distributive, procedural, and interactional) on customer satisfaction beyond the expectancy disconfirmation paradigm. To this end, two separate field survey studies were conducted. A total of 568 customers were surveyed in 38 hotels and 40 restaurants. The results showed that distributive justice was critical in predicting customer satisfaction, while the influence of procedural and interactional justice was secondary. Justice concepts were also robust against the simultaneous inclusion of disconfirmation and performance in the satisfaction equation. The article concludes with theoretical and manage…

Expectancy theorySocial PsychologyDistributive propertyInteractional justicePerceptionmedia_common.quotation_subjectCustomer satisfactionJustice (ethics)PsychologyDistributive justiceSocial psychologyInclusion (education)media_commonJournal of Applied Social Psychology
researchProduct

Inductive types in homotopy type theory

2012

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for intensional systems of type theory as well as a computational approach to algebraic topology via type theory-based proof assistants such as Coq. The present work investigates inductive types in this setting. Modified rules for inductive types, including types of well-founded trees, or W-types, are presented, and the basic homotopical semantics of such types are determined. Proofs of all results have been formally verified by the Coq proof assistant, and the proof s…

FOS: Computer and information sciencesComputer Science - Logic in Computer Science03B15 03B70 03F500102 computer and information sciences01 natural sciencesComputer Science::Logic in Computer ScienceFOS: MathematicsA¹ homotopy theoryCategory Theory (math.CT)0101 mathematicsMathematicsHomotopy lifting propertyType theory inductive types homotopy-initial algebraHomotopy010102 general mathematicsMathematics - Category TheoryIntuitionistic type theoryMathematics - LogicSettore MAT/01 - Logica MatematicaLogic in Computer Science (cs.LO)Algebran-connectedType theoryTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsProof theoryTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSHomotopy type theoryComputer Science::Programming LanguagesLogic (math.LO)
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

Monoids and Maximal Codes

2011

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal code. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maxi…

FOS: Computer and information sciencesDiscrete mathematicsMonoidCode (set theory)Formal Languages and Automata Theory (cs.FL)lcsh:MathematicsComputer Science - Formal Languages and Automata TheoryAstrophysics::Cosmology and Extragalactic Astrophysicslcsh:QA1-939lcsh:QA75.5-76.95Set (abstract data type)chemistry.chemical_compoundchemistryFOS: MathematicsMathematics - CombinatoricsOrder (group theory)High Energy Physics::ExperimentCombinatorics (math.CO)lcsh:Electronic computers. Computer scienceCharacteristic propertyPartially ordered setMaximal elementMathematicsElectronic Proceedings in Theoretical Computer Science
researchProduct

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word

2020

A prefix normal word is a binary word with the property that no substring has more $1$s than the prefix of the same length. By proving that the set of prefix normal words is a bubble language, we can exhaustively list all prefix normal words of length $n$ as a combinatorial Gray code, where successive strings differ by at most two swaps or bit flips. This Gray code can be generated in $\Oh(\log^2 n)$ amortized time per word, while the best generation algorithm hitherto has $\Oh(n)$ running time per word. We also present a membership tester for prefix normal words, as well as a novel characterization of bubble languages.

FOS: Computer and information sciencesGeneral Computer ScienceFormal Languages and Automata Theory (cs.FL)Property (programming)combinatorial Gray codeComputer Science - Formal Languages and Automata TheoryData_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technologyCharacterization (mathematics)01 natural sciencesTheoretical Computer ScienceCombinatoricsSet (abstract data type)Gray codeComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)MathematicsAmortized analysisSettore INF/01 - Informaticaprefix normal wordsSubstringcombinatorial generationPrefixjumbled pattern matching010201 computation theory & mathematics020201 artificial intelligence & image processingbinary languagesprefix normal words binary languages combinatorial Gray code combinatorial generation jumbled pattern matchingWord (computer architecture)Theoretical Computer Science
researchProduct

An Empirical Study of the Relation Between Community Structure and Transitivity

2012

One of the most prominent properties in real-world networks is the presence of a community structure, i.e. dense and loosely interconnected groups of nodes called communities. In an attempt to better understand this concept, we study the relationship between the strength of the community structure and the network transitivity (or clustering coefficient). Although intuitively appealing, this analysis was not performed before. We adopt an approach based on random models to empirically study how one property varies depending on the other. It turns out the transitivity increases with the community structure strength, and is also affected by the distribution of the community sizes. Furthermore, …

FOS: Computer and information sciencesPhysics - Physics and SocietyProperty (philosophy)FOS: Physical sciencesPhysics and Society (physics.soc-ph)[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]01 natural sciencesComplex NetworksClustering010305 fluids & plasmasEmpirical research0103 physical sciences010306 general physicstransitivityCommunity StructureClustering coefficientMathematicsSocial and Information Networks (cs.SI)Transitive relationCommunity structure[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Computer Science - Social and Information NetworksComplex networkDegree distributionZero (linguistics)Mathematical economics
researchProduct

Generalized Logical Operations among Conditional Events

2018

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular we examine the Frechet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction $\mathcal…

FOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaComputer Science - Artificial IntelligenceComputer scienceMonotonic functionProbabilistic reasoning02 engineering and technologyCommutative Algebra (math.AC)Conditional random quantitieFréchet-Hoeffding boundCoherent extensionNegationArtificial IntelligenceQuasi conjunction0202 electrical engineering electronic engineering information engineeringFOS: MathematicsCoherent prevision assessmentConditional eventNon-monotonic logicRule of inferenceCommutative propertyAssociative propertyDiscrete mathematicsProbability (math.PR)Probabilistic logicOrder (ring theory)ConjunctionMathematics - LogicCoherence (philosophical gambling strategy)p-entailmentProbabilistic inferenceMathematics - Commutative AlgebraConjunction (grammar)Artificial Intelligence (cs.AI)020201 artificial intelligence & image processingInference ruleNegationLogic (math.LO)Mathematics - ProbabilityDisjunction
researchProduct

Community characterization of heterogeneous complex systems

2011

We introduce an analytical statistical method to characterize the communities detected in heterogeneous complex systems. By posing a suitable null hypothesis, our method makes use of the hypergeometric distribution to assess the probability that a given property is over-expressed in the elements of a community with respect to all the elements of the investigated set. We apply our method to two specific complex networks, namely a network of world movies and a network of physics preprints. The characterization of the elements and of the communities is done in terms of languages and countries for the movie network and of journals and subject categories for papers. We find that our method is ab…

FOS: Computer and information sciencesStatistics and Probabilityrandom graphs networks statistical inference socio-economic networksPhysics - Physics and SocietyTheoretical computer scienceProperty (programming)Complex systemFOS: Physical sciencesPhysics and Society (physics.soc-ph)socio-economic networksStatistical inferenceSocial and Information Networks (cs.SI)Random graphComputer Science - Social and Information NetworksStatistical and Nonlinear PhysicsProbability and statisticsComplex networkSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Hypergeometric distributionPhysics - Data Analysis Statistics and ProbabilitynetworkStatistics Probability and UncertaintyNull hypothesisData Analysis Statistics and Probability (physics.data-an)random graphstatistical inferenceJournal of Statistical Mechanics: Theory and Experiment
researchProduct