Search results for " justice"

showing 10 items of 1145 documents

Case Comment: C-82/10 European Commission v Ireland - Judgement of the Court of Justice of the European Union, September 29, 2011 (VHI Case)

2011

This article (published online for the EJLE, see below) is the case comment on the recent judgement (September 29, 2011) of the Court of Justice of the European Union in the case No C-82/10 concerning non-life insurance. This case was initiated by the European Commission against Ireland for failure to fulfil its obligations by not covering the Voluntary Health Insurance Board by insurance supervisory scheme as provided for by relevant Directives. The above insurance institution which is the main health insurer in Ireland enjoys exemption from the supervisory scheme envisaged by relevant Directives. Ireland may maintain this exemption if its capacity is not amended; otherwise the above insti…

European Union lawmedia_common.quotation_subjectPolitical scienceLawHealth insurerJudgementInstitutionHealth insurancemedia_common.cataloged_instanceEuropean commissionEuropean unionEconomic Justicemedia_commonSSRN Electronic Journal
researchProduct

LA ORDEN EUROPEA DE INVESTIGACIÓN COMO INSTRUMENTO PARA LA LUCHA CONTRA LA CRIMINALIDAD ORGANIZADA. Significado, sujetos y herramientas en la obtenci…

2022

The study focuses on the analysis and investigation of the European instrument called the European Investigation Order (EIO), and its contributions to the fight against organised crime. This instrument was adopted by the European legislator, with the aim of achieving effective and swift cross-border judicial cooperation in criminal matters. In this context the main question that encourages research is: to what extent is the EIO a suitable instrument in the fight against organised crime? From this question the rest of the questions arise, articulating the structure of the thesis. In addition, in this work, we highlight the comparative perspective: the EIO instrument has been examined from a …

European investigation orderArea of freedom security and justiceorganised crimeEU
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

Vibrational circular dichroism spectroscopy for probing the expression of chirality in mechanically planar chiral rotaxanes

2020

Mechanically interlocked molecules can exhibit molecular chirality that arises due to the mechanical bond rather than covalent stereogenic units. Developing applications of such systems is made challenging by the absence of techniques for assigning the absolute configuration of products and methods to probe how the mechanical stereogenic unit influences the spatial arrangements of the functional groups in solution. Here we demonstrate for the first time that Vibrational Circular Dichroism (VCD) can be used to not only discriminate between mechanical stereoisomers but also provide detailed information on their (co)conformations. The latter is particularly important as these molecules are now…

FELIX Condensed Matter PhysicsSDG 16 - PeaceMaterials scienceMechanical bond010405 organic chemistrySDG 16 - Peace Justice and Strong InstitutionsAbsolute configurationGeneral Chemistry010402 general chemistry/dk/atira/pure/sustainabledevelopmentgoals/peace_justice_and_strong_institutions01 natural sciencesJustice and Strong Institutions0104 chemical sciencesStereocenterChemistryChemical physicsCovalent bondVibrational circular dichroismMoleculeSpectroscopyChirality (chemistry)
researchProduct

Algorithms for Anti-Powers in Strings

2018

Abstract A string S [ 1 , n ] is a power (or tandem repeat) of order k and period n / k if it can be decomposed into k consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an anti-power of order k to be a string composed of k pairwise-distinct blocks of the same length ( n / k , called anti-period). Anti-powers are a natural converse to powers, and are objects of combinatorial interest in their own right. In this paper we initiate the algorithmic study of anti-powers. Given a string S, we describe an op…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)ComputationComputer Science - Formal Languages and Automata Theory0102 computer and information sciencesString processingInformation System01 natural sciencesUpper and lower boundsAnti-powersTheoretical Computer ScienceLemma (logic)ConverseComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)0101 mathematicsMathematicsCombinatorics on wordSignal processingCombinatorics on wordsComputer Science Applications1707 Computer Vision and Pattern RecognitionAnti-power16. Peace & justice113 Computer and information sciencesSubstringComputer Science Applications010101 applied mathematicsAlgorithmCombinatorics on words010201 computation theory & mathematicsSignal ProcessingAlgorithmAlgorithmsInformation SystemsComputer Science - Discrete Mathematics
researchProduct

Online Computation of Abelian Runs

2015

Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period $\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\mathcal{P}$. We give an algorithm that finds all the abelian runs of period $\mathcal{P}$ in a word of length $n$ in time $O(n\times |\mathcal{P}|)$ and space $O(\sigma+|\mathcal{P}|)$.

FOS: Computer and information sciencesFormal Languages and Automata Theory (cs.FL)Abelian run[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Computer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technology[INFO] Computer Science [cs]01 natural sciencesOnline computationTheoretical Computer ScienceCombinatoricsComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)[INFO]Computer Science [cs]Abelian groupComputingMilieux_MISCELLANEOUSMathematicsCombinatorics on wordDiscrete mathematicsComputer Science (all)020206 networking & telecommunicationsAbelian periodText algorithm16. Peace & justiceSubstringCombinatorics on words010201 computation theory & mathematicsWord (group theory)Computer Science::Formal Languages and Automata Theory
researchProduct

Fast computation of abelian runs

2016

Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period $\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\mathcal{P}$. Our main result is an online algorithm that, given a word $w$ of length $n$ over an alphabet of cardinality $\sigma$ and a Parikh vector $\mathcal{P}$, returns all the abelian runs of period $\mathcal{P}$ in $w$ in time $O(n)$ and space $O(\sigma+p)$, where $p$ is the norm of $\mathcal{P}$, i.e., the sum of its components. We also present an online algorithm that computes all the abelian runs with periods of norm $p$ in $w$ in time $O(np)$, for any given norm $p$. Finally, we give an $O(n^2)$-time offline randomi…

FOS: Computer and information sciencesGeneral Computer ScienceComputationAbelian run[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Elementary abelian group0102 computer and information sciences02 engineering and technology01 natural sciencesRank of an abelian groupTheoretical Computer ScienceCombinatoricsComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)[INFO]Computer Science [cs]Online algorithmAbelian groupComputingMilieux_MISCELLANEOUSMathematicsCombinatorics on wordDiscrete mathematicsComputer Science (all)Abelian periodText algorithm16. Peace & justiceSubstringRandomized algorithmCombinatorics on words010201 computation theory & mathematics020201 artificial intelligence & image processingComputer Science::Formal Languages and Automata Theory
researchProduct

Symbolic integration of hyperexponential 1-forms

2019

Let $H$ be a hyperexponential function in $n$ variables $x=(x_1,\dots,x_n)$ with coefficients in a field $\mathbb{K}$, $[\mathbb{K}:\mathbb{Q}] <\infty$, and $\omega$ a rational differential $1$-form. Assume that $H\omega$ is closed and $H$ transcendental. We prove using Schanuel conjecture that there exist a univariate function $f$ and multivariate rational functions $F,R$ such that $\int H\omega= f(F(x))+H(x)R(x)$. We present an algorithm to compute this decomposition. This allows us to present an algorithm to construct a basis of the cohomology of differential $1$-forms with coefficients in $H\mathbb{K}[x,1/(SD)]$ for a given $H$, $D$ being the denominator of $dH/H$ and $S\in\mathbb{K}[x…

FOS: Computer and information sciencesMathematics - Differential GeometryComputer Science - Symbolic ComputationPure mathematicsMathematics::Commutative Algebra010102 general mathematics68W30Field (mathematics)010103 numerical & computational mathematicsFunction (mathematics)[MATH] Mathematics [math]Symbolic Computation (cs.SC)16. Peace & justiceFunctional decomposition01 natural sciencesDifferential Geometry (math.DG)FOS: MathematicsComputer Science::Symbolic Computation0101 mathematics[MATH]Mathematics [math]Symbolic integrationMathematics
researchProduct

Mahonian STAT on words

2016

In 2000, Babson and Steingrimsson introduced the notion of what is now known as a permutation vincular pattern, and based on it they re-defined known Mahonian statistics and introduced new ones, proving or conjecturing their Mahonity. These conjectures were proved by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006.In 2010, Burstein refined some of these results by giving a bijection between permutations with a fixed value for the major index and those with the same value for STAT , where STAT is one of the statistics defined and proved to be Mahonian in the 2000 Babson and Steingrimsson's paper. Several other statistics are preserved as well by Burstein's bijection.At…

FOS: Computer and information sciencesQA75[ INFO ] Computer Science [cs]Discrete Mathematics (cs.DM)Major index0102 computer and information sciencesMathematical Analysis01 natural sciencesWords and PermutationsCombinatorial problemsEquidistributionTheoretical Computer ScienceCombinatoricssymbols.namesakePermutationBijectionsFOS: MathematicsMathematics - CombinatoricsMathematical proofs[INFO]Computer Science [cs]0101 mathematicsStatisticMathematicsStatisticZ665Algebraic combinatoricsMathematics::CombinatoricsFormal power seriesPatternPermutationsEulerian path16. Peace & justiceComputer Science Applications010101 applied mathematics010201 computation theory & mathematicsCombinatoricsSignal ProcessingsymbolsBijectionCombinatorics (math.CO)Information SystemsComputer Science - Discrete Mathematics
researchProduct

Estimating with kernel smoothers the mean of functional data in a finite population setting. A note on variance estimation in presence of partially o…

2014

In the near future, millions of load curves measuring the electricity consumption of French households in small time grids (probably half hours) will be available. All these collected load curves represent a huge amount of information which could be exploited using survey sampling techniques. In particular, the total consumption of a specific cus- tomer group (for example all the customers of an electricity supplier) could be estimated using unequal probability random sampling methods. Unfortunately, data collection may undergo technical problems resulting in missing values. In this paper we study a new estimation method for the mean curve in the presence of missing values which consists in…

FOS: Computer and information sciencesStatistics and ProbabilityPopulationRatio estimatorLinearizationRatio estimator01 natural sciencesSurvey sampling.Horvitz–Thompson estimatorMethodology (stat.ME)010104 statistics & probabilityH\'ajek estimator0502 economics and businessApplied mathematicsMissing valuesHorvitz-Thompson estimator0101 mathematicseducationStatistics - Methodology050205 econometrics MathematicsPointwiseeducation.field_of_study[STAT.ME] Statistics [stat]/Methodology [stat.ME]05 social sciencesNonparametric statisticsEstimator16. Peace & justiceMissing dataFunctional data[ STAT.ME ] Statistics [stat]/Methodology [stat.ME]Kernel (statistics)Statistics Probability and UncertaintyNonparametric estimation[STAT.ME]Statistics [stat]/Methodology [stat.ME]
researchProduct