Search results for "wise"

showing 10 items of 369 documents

Parent-Child Similarity in Environmental Attitudes: A Pairwise Comparison

2012

Are adolescents’ environmental attitudes similar to their parents’ attitudes? The main objective of this study is to examine what quantitative associations, if any, exist in parent-child environmental attitudes within the family. The survey data was collected assessing attitudes toward the environment and nature from 15-year-old students (n = 237) and their parents (n = 212) in Finland. A significant positive correlation emerged in environmental attitudes between mothers and fathers. Interestingly, the results revealed some indicative evidence that girls’ environmental attitudes could relate more to their father's than mother's attitudes. Girls were as positive in their environmental attitu…

Environmental educationbusiness.industryAdolescent offspringta1172Similarity (psychology)Significant positive correlationSurvey data collectionPairwise comparisonbusinessPsychologyGeneral Environmental ScienceEducationDevelopmental psychologyThe Journal of Environmental Education
researchProduct

Evolutionary Game Dynamics for Collective Decision Making in Structured and Unstructured Environments

2017

Abstract For a large population of players we consider a collective decision making process with three possible choices: option A or B or no option. The more popular option is more likely to be chosen by uncommitted players and cross-inhibitory signals can be sent to attract players committed to a different option. This model originates in the context of honeybees swarms, and we generalise it to accommodate other applications such as duopolistic competition and opinion dynamics. The first contribution is an evolutionary game model and a corresponding new game dynamics called expected gain pairwise comparison dynamics explaining how the strategic behaviour of the players may lead to deadlock…

Equilibrium pointNon-cooperative gamebusiness.industry020208 electrical & electronic engineeringStability (learning theory)Opinion DynamicContext (language use)02 engineering and technologyComplex networkMulti-Agent SystemsGroup decision-makingCompetition (economics)Game TheorySettore ING-INF/04 - AutomaticaControl and Systems Engineering0202 electrical engineering electronic engineering information engineeringEconomicsSocial Network020201 artificial intelligence & image processingPairwise comparisonArtificial intelligenceSettore MAT/09 - Ricerca OperativabusinessMathematical economicsIFAC-PapersOnLine
researchProduct

PIECEWISE SMOOTH REVERSIBLE DYNAMICAL SYSTEMS AT A TWO-FOLD SINGULARITY

2012

This paper focuses on the existence of closed orbits around a two-fold singularity of 3D discontinuous systems of the Filippov type in the presence of symmetries.

Essential singularitySingularityDynamical systems theoryStructural stabilityApplied MathematicsModeling and SimulationHomogeneous spaceMathematical analysisPiecewiseSingularity functionDiscontinuous systemsEngineering (miscellaneous)MathematicsInternational Journal of Bifurcation and Chaos
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

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

Fractal surfaces from simple arithmetic operations

2015

Fractal surfaces ('patchwork quilts') are shown to arise under most general circumstances involving simple bitwise operations between real numbers. A theory is presented for all deterministic bitwise operations on a finite alphabet. It is shown that these models give rise to a roughness exponent $H$ that shapes the resulting spatial patterns, larger values of the exponent leading to coarser surfaces.

FOS: Computer and information sciencesStatistics and ProbabilityDiscrete mathematicsOther Computer Science (cs.OH)Condensed Matter Physics01 natural sciences010305 fluids & plasmasSelf-affinityFractalSimple (abstract algebra)Computer Science - Other Computer Science0103 physical sciencesRoughness exponentExponentStatistical physicsAlphabet010306 general physicsBitwise operationReal numberMathematics
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

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