Search results for "forb"

showing 10 items of 62 documents

Still Going “Grey” After All These Years? Export Restraint Agreements and the WTO

2013

This chapter assesses how the dual strategy that aimed to eliminate "grey area" measures has worked out in practice, also in the light of the protectionist pressures unleashed by the current economic crisis. After providing a brief overview of the historic proliferation of these measures, it discusses whether the attempt to render ordinary safeguard measures a more attractive alternative to voluntary restraint agreements (VRAs) has worked in practice. The chapter analyses some of the intrinsic and extrinsic weaknesses of the ban itself. The chapter reviews some cases of export-restraint agreements arguably falling within the exceptions to the ban enshrined in Art. 11.1.C. This work has exam…

Engineeringbusiness.industryforbidden agreementsWTO safeguards export restraint forbidden agreementsWorld tradeIUS/13 - DIRITTO INTERNAZIONALEInternational tradeInternational lawPrinciple of legalityexport restraintProtectionismWTODual (category theory)Public international lawSafeguardWork (electrical)LawsafeguardSettore IUS/13 - Diritto Internazionalebusiness
researchProduct

What determines a positive attitude towards natural food products? An expectancy theory approach.

2021

Natural food products are becoming increasingly popular worldwide due to their health and environmental benefits. However, these products' increasing anecdotal popularity has not translated into their widespread adoption; in fact, demand for natural food products remains confined to a relatively small segment of consumers. Despite this, little is known about the facilitators and inhibitors of favourable attitude of consumers towards these products. Recognising this gap, our study employed the theoretical lens of expectancy theory to investigate these factors. Through an extensive review of the pro-environmental consumption literature, we identified four facilitating and inhibiting factors: …

Expectancy theoryConsumption (economics)Renewable Energy Sustainability and the EnvironmentStrategy and Management:Samfunnsvitenskap: 200 [VDP]Environmental concernhelsekostHealth consciousnessModerationPopularityIndustrial and Manufacturing EngineeringforbrukeratferdPeer reviewProduct (business)Natural food productsAttitudeNatural contentNatural foodVDP::Samfunnsvitenskap: 200BusinessHealth consciousnessMarketingPrice barrierGeneral Environmental Scienceforbrukeradferd
researchProduct

Cyclic Complexity of Words

2014

We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity distinguishes between Sturmian words of different slopes. We prove that if $x$ is a Sturmian word and $y$ is a word having the same cyclic complexity of $x,$ then up to renaming letters, $x$ and $y$ have the same set of factors. In particular, $y$ is also Sturmian of slope equ…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata Theory0102 computer and information sciences68R15Characterization (mathematics)[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesTheoretical Computer ScienceCombinatoricsConjugacy class[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsDiscrete Mathematics and CombinatoricsMathematics - Combinatorics0101 mathematics[MATH]Mathematics [math]Discrete Mathematics and CombinatoricMathematicsDiscrete mathematicsFactor complexity010102 general mathematicsSturmian wordSturmian wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Sturmian wordsCyclic complexity factor complexity Sturmian words minimal forbidden factorInfimum and supremumToeplitz matrixComputational Theory and Mathematics010201 computation theory & mathematicsCyclic complexityBounded functionComplexity functionCombinatorics (math.CO)Word (group theory)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

On the Structure of Bispecial Sturmian Words

2013

A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, that are the digital approximations of Euclidean segments in the plane. In 1997, J. Berstel and A. de Luca proved that \emph{palindromic} bispecial Sturmian words are precisely the maximal internal factors of \emph{primitive} Christoffel words. We extend this result by showing that bispecial Sturmian wo…

FOS: Computer and information sciencesGeneral Computer ScienceSpecial factorDiscrete Mathematics (cs.DM)Computer Networks and CommunicationsApproximations of πFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryEnumerative formula68R15Characterization (mathematics)Minimal forbidden wordTheoretical Computer ScienceCombinatoricsComputer Science::Discrete MathematicsEuclidean geometryPhysics::Atomic PhysicsMathematicsChristoffel symbolsApplied MathematicsPalindromeSturmian wordSturmian wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Combinatorics on wordsComputational Theory and MathematicsWord (group theory)Computer Science::Formal Languages and Automata TheoryChristoffel wordComputer Science - Discrete Mathematics
researchProduct

Minimal forbidden factors of circular words

2017

Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al. [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language $M$, computes a DFA recognizing the language whose set of minimal forbidden factors is $M$. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word.…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniGeneral Computer ScienceDiscrete Mathematics (cs.DM)Finite automatonSettore INF/01 - InformaticaFormal Languages and Automata Theory (cs.FL)Factor automatonComputer Science - Formal Languages and Automata TheoryComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Circular wordFibonacci wordMinimal forbidden factorTheoretical Computer ScienceComputer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Temi politici e religiosi in Roselyne Forbyn d'Oppède (1822-1884)

2015

Il saggio analizza alcuni aspetti della riflessione politica e religiosa di Marie-Aglaé-Roselyne Forbin d’Oppède, nata Villeneuve Bargemon (1822-1884), cattolica liberale, impegnata per il rinnovamento della cultura religiosa in Francia, ma anche per l’affermazione dei princìpi della tradizione liberale di ispirazione cattolica.

Forbin d'Oppède legittimismo II Impero FranciaSettore SPS/02 - Storia Delle Dottrine Politiche
researchProduct

What motivates the adoption of green restaurant products and services? A systematic review and future research agenda

2021

Issues regarding green restaurants have received significant scholarly and practitioner attention in the last decade, particularly concerning why consumers adopt green restaurants. Although several reviews exist on green hospitality, a comprehensive review of the literature on consumers' green restaurant adoption is currently lacking. The following systematic literature review examines 50 research studies published on the consumer adoption of green restaurant services to address this gap accordingly. Through a detailed content analysis, the research profile and thematic analysis are presented. The review further identifies four key thematic foci: (a) consumer behavior variables studied, (b)…

GREEN RESTAURANTSStrategy and Management:Samfunnsvitenskap: 200::Økonomi: 210::Bedriftsøkonomi: 213 [VDP]Geography Planning and DevelopmentCONSUMPTION BEHAVIORManagement Monitoring Policy and LawmotivasjonVDP::Samfunnsvitenskap: 200::Økonomi: 210SUSTAINABILITYrestaurantnæringenHospitalityRETAILINGBusiness and International ManagementMarketingConsumer behaviourLITERATURE REVIEWPERCEPTIONgrønne produkter og tjenesterbusiness.industryTHEMATIC ANALYSISNoveltyFUTURE PROSPECTSystematic reviewConceptual frameworkContent analysisSYSTEMATIC REVIEWSustainabilityBusinessThematic analysisforbrukeradferd
researchProduct

Study of optical and magneto processes in Rb atomic vapor layer of nanometric thickness

2012

Using a narrow-band resonant fluorescence spectra from a nano-cell with a thickness of L= [lambda]/2, and VSOP resonances formed at a thickness L =[lambda] ([lambda] is the wavelength of the resonant radiation), for the first time it was experimentally investigated the behaviour of the frequency and intensity (transition probabilities) of the atomic hyperfine structure transitions between the 85Rb, 87Rb, D1 and D2 lines Zeeman sublevels in external magnetic fields in range 5 - 7000G. The behaviour of tens of previously unstudied atomic transitions was analyzed and it is demonstrated that the intensities of these lines can both greatly increase, and decrease (tenfold). For the first time it …

Gaz tamponπ et ơ- polarizations of the laser radiationCoherent Dicke narrowing[PHYS.COND.CM-GEN] Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]High resolution spectroscopyRécissement Dicke cohérentRb hyperfine structureπ et ơ- du rayonnement laserStructure hyperfine RbCellules multi-régions combinéesRésonances VSOPTransitions "interdites''[ PHYS.COND.CM-GEN ] Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]Nano-cellsZeeman effectDiode laserNano-cellulesEffet ZeemanƠ+Polarisations Ơ+"Forbidden'' transitions[PHYS.COND.CM-GEN]Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]Combined multi-region cellsBuffer gasVSOP resonancesSpectroscopie à haute résolution
researchProduct

Word assembly through minimal forbidden words

2006

AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.

General Computer ScienceFragment assemblyFactor automaton[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technology01 natural sciencesMinimal forbidden wordTheoretical Computer ScienceCombinatorics0202 electrical engineering electronic engineering information engineeringFinite setComputingMilieux_MISCELLANEOUSCombinatorics on wordMathematicsShortest superstringCombinatorics on wordsRepetition index16. Peace & justice010201 computation theory & mathematics020201 artificial intelligence & image processingAlphabetConstant (mathematics)Word (computer architecture)Computer Science::Formal Languages and Automata TheoryComputer Science(all)
researchProduct

Prosessforbedring og teknologistøtte for semistrukturerte prosesser

2001

Masteroppgave i informasjons- og kommunikasjonsteknologi 2001 - Høgskolen i Agder, Grimstad Rapporten omhandler utvikling av et adaptiv Workflow Management System (WfMS). Systemet skal brukes i forbedring av en faktureringsprosess for konsulenter. I den forbindelse behandles sentrale teorier innen prosessforbedring og adaptiv arbeidsflyt. Nåværende faktureringsprosess har rom for effektivisering, automatisering og kvalitetsforbedring. Prosessen er manuell, sekvensiell og lite strukturert. Strategi som foreslås benyttet i utviklingen er Total Quality Management (TQM), Computer Supported Cooperative Work (CSCW) og Concurrent Engineering (CE). Det er utviklet en prototyp som er verktøyet for å…

IKT590TeknologistøtteAdaptiv arbeidsflytVDP::Matematikk og naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Systemutvikling og -arbeid: 426Prosessforbedring
researchProduct