Search results for "riso"

showing 10 items of 1451 documents

From ‘Prisoner's Dilemma’ to Reluctance to Use Judicial Discretion: The Enemies of Cooperation in European Cross-Border Cases

2017

This article will focus on Articles 41–44 of the Recast European Insolvency Regulation (Regulation 2015/848) and the dynamic of cooperation and communication between courts and insolvency practitioners. Two main ideas will be maintained. The first is that cooperation requires a legal framework which is certain—otherwise, prescriptions imposing duties of cooperation and communication might produce ‘prisoner's dilemmas’ and, paradoxically, unwillingness to cooperate. The second idea is that prescriptions imposing duties of cooperation and communication have an intrinsic open texture—this characteristic ontologically requires courts and insolvency practitioners to make choices between differen…

European levelInsolvencyJudicial discretionLawPsychological interventionNational levelSociologyPrisoner's dilemmaLawFinanceInternational Insolvency Review
researchProduct

L'ex convento e carcere di San Vito di Agrigento. Studi e proposte per la sua conservazione

2020

Il saggio “L’ex convento carcere di San Vito di Agrigento. Studi sulle trasformazioni e proposte per la sua conservazione” indaga l’antico convento dei frati Minori di Agrigento, trasformato nel sec. XIX in carcere di Agrigento. Il convento, costruito fuori le mura della città, era costituito dalla chiesa, dal chiostro e dal convento con le celle e gli spazi comuni dei frati. La nuova destinazione a carcere, con i lavori effettuati tra la metà del sec. XIX, primi e metà del sec. XX, ha in parte distrutto e occultato il convento medievale. Nell’Anno Accademico 2011-2012, i due corsi di Laboratorio di Restauro e Teoria e Storia del Restauro, del Corso di laurea in Architettura, sede di Agrige…

Ex convento e carcere di San Vito di Agrigento restauro conservazione riuso valorizzazioneFormer prison and convent of San Vito in Agrigento Restoration Conservation reuso enhancementSettore ICAR/19 - Restauro
researchProduct

Empirical model evaluation and hypothesis testing

2016

Chapter 5 deals with the empirical model evaluation and the testing of hypotheses. It starts out with the evaluation of the measurement and the structural models, using the PLS algorithm. After the evaluation of the complete model, moderating effects are examined by conducting group comparisons (section 5.4.1) and by investigating interaction effects (5.4.2). After that, selected constructs are further examined by exploratory data analysis (section 5.5).

Exploratory data analysisBrand relationshipSection (archaeology)EconometricsGroup comparisonStatistical hypothesis testingMathematicsBrand loyalty
researchProduct

Finding k -dissimilar paths with minimum collective length

2018

Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability, we also define the much smaller set …

FOS: Computer and information sciencesComputer scienceDatabases (cs.DB)0102 computer and information sciences02 engineering and technology01 natural sciencesSet (abstract data type)Exact algorithmComputer Science - Databases010201 computation theory & mathematicsIterated function020204 information systemsComputer Science - Data Structures and AlgorithmsShortest path problemScalabilityPath (graph theory)0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)Pairwise comparisonPruning (decision trees)AlgorithmProceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
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

Qualitative Comparison of Community Detection Algorithms

2011

Community detection is a very active field in complex networks analysis, consisting in identifying groups of nodes more densely interconnected relatively to the rest of the network. The existing algorithms are usually tested and compared on real-world and artificial networks, their performance being assessed through some partition similarity measure. However, artificial networks realism can be questioned, and the appropriateness of those measures is not obvious. In this study, we take advantage of recent advances concerning the characterization of community structures to tackle these questions. We first generate networks thanks to the most realistic model available to date. Their analysis r…

FOS: Computer and information sciencesPhysics - Physics and SocietyComputer scienceComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern RecognitionFOS: Physical sciences02 engineering and technologyPhysics and Society (physics.soc-ph)Similarity measure[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Complex NetworksField (computer science)Qualitative analysis020204 information systems0202 electrical engineering electronic engineering information engineeringSocial and Information Networks (cs.SI)Algorithms ComparisonArtificial networks[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Computer Science - Social and Information Networks[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Complex networkPartition (database)Community Properties020201 artificial intelligence & image processingAlgorithmCommunity Detection
researchProduct

Detecting informative higher-order interactions in statistically validated hypergraphs

2021

Recent empirical evidence has shown that in many real-world systems, successfully represented as networks, interactions are not limited to dyads, but often involve three or more agents at a time. These data are better described by hypergraphs, where hyperlinks encode higher-order interactions among a group of nodes. In spite of the large number of works on networks, highlighting informative hyperlinks in hypergraphs obtained from real world data is still an open problem. Here we propose an analytic approach to filter hypergraphs by identifying those hyperlinks that are over-expressed with respect to a random null hypothesis, and represent the most relevant higher-order connections. We apply…

FOS: Computer and information sciencesPhysics - Physics and SocietyComputer scienceQC1-999Open problemFOS: Physical sciencesGeneral Physics and AstronomyPhysics and Society (physics.soc-ph)Astrophysicscomputer.software_genreENCODEMethodology (stat.ME)Statistics - MethodologySocial and Information Networks (cs.SI)PhysicsComputer Science - Social and Information NetworksFilter (signal processing)HyperlinkClass (biology)Settore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)QB460-466Pairwise comparisonData miningNoise (video)Null hypothesiscomputerhigher order interactions statistical validation complex networksCommunications Physics
researchProduct

Imputation Procedures in Surveys Using Nonparametric and Machine Learning Methods: An Empirical Comparison

2020

Abstract Nonparametric and machine learning methods are flexible methods for obtaining accurate predictions. Nowadays, data sets with a large number of predictors and complex structures are fairly common. In the presence of item nonresponse, nonparametric and machine learning procedures may thus provide a useful alternative to traditional imputation procedures for deriving a set of imputed values used next for the estimation of study parameters defined as solution of population estimating equation. In this paper, we conduct an extensive empirical investigation that compares a number of imputation procedures in terms of bias and efficiency in a wide variety of settings, including high-dimens…

FOS: Computer and information sciencesStatistics and ProbabilityStatistics::ApplicationsEmpirical comparisonbusiness.industryComputer scienceApplied MathematicsNonparametric statisticsMachine learningcomputer.software_genreStatistics - ComputationVariety (cybernetics)Methodology (stat.ME)Set (abstract data type)Statistics::MethodologyImputation (statistics)Artificial intelligenceStatistics Probability and UncertaintybusinesscomputerStatistics - MethodologyComputation (stat.CO)Social Sciences (miscellaneous)Journal of Survey Statistics and Methodology
researchProduct

The Max-Product Algorithm Viewed as Linear Data-Fusion: A Distributed Detection Scenario

2019

In this paper, we disclose the statistical behavior of the max-product algorithm configured to solve a maximum a posteriori (MAP) estimation problem in a network of distributed agents. Specifically, we first build a distributed hypothesis test conducted by a max-product iteration over a binary-valued pairwise Markov random field and show that the decision variables obtained are linear combinations of the local log-likelihood ratios observed in the network. Then, we use these linear combinations to formulate the system performance in terms of the false-alarm and detection probabilities. Our findings indicate that, in the hypothesis test concerned, the optimal performance of the max-product a…

FOS: Computer and information sciencesfactor graphsComputer scienceComputer Science - Information TheoryMarkovin ketjut02 engineering and technologyMarkov random fieldsalgoritmit0202 electrical engineering electronic engineering information engineeringMaximum a posteriori estimationmax-product algorithmElectrical and Electronic EngineeringLinear combinationStatistical hypothesis testingdistributed systemsMarkov random fieldspectrum sensingApplied MathematicsNode (networking)Information Theory (cs.IT)linear data-fusionApproximation algorithm020206 networking & telecommunicationsComputer Science Applicationssum-product algorithmPairwise comparisonRandom variableAlgorithmstatistical inference
researchProduct

Synergetic and redundant information flow detected by unnormalized Granger causality: application to resting state fMRI

2015

Objectives: We develop a framework for the analysis of synergy and redundancy in the pattern of information flow between subsystems of a complex network. Methods: The presence of redundancy and/or synergy in multivariate time series data renders difficult to estimate the neat flow of information from each driver variable to a given target. We show that adopting an unnormalized definition of Granger causality one may put in evidence redundant multiplets of variables influencing the target by maximizing the total Granger causality to a given target, over all the possible partitions of the set of driving variables. Consequently we introduce a pairwise index of synergy which is zero when two in…

FOS: Computer and information sciencesgranger causality (GC)Multivariate statisticsComputer scienceRestComputer Science - Information TheoryBiomedical EngineeringsynergyFOS: Physical sciencescomputer.software_genre01 natural sciences03 medical and health sciences0302 clinical medicineGranger causality0103 physical sciencesConnectomeRedundancy (engineering)HumansBrain connectivityTime series010306 general physicsModels StatisticalHuman Connectome ProjectResting state fMRIredundancybusiness.industryInformation Theory (cs.IT)functional magnetic resonance imaging (fMRI)BrainPattern recognitionComplex networkMagnetic Resonance ImagingVariable (computer science)Physics - Data Analysis Statistics and ProbabilityQuantitative Biology - Neurons and CognitionFOS: Biological sciencesSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaPairwise comparisonNeurons and Cognition (q-bio.NC)Artificial intelligenceData miningNerve Netbusinesscomputer030217 neurology & neurosurgeryData Analysis Statistics and Probability (physics.data-an)
researchProduct