Search results for "Abstract data type"

showing 10 items of 1140 documents

Social network analysis: the use of graph distances to compare artificial and criminal networks

2021

Aim: Italian criminal groups become more and more dangerous spreading their activities into new sectors. A criminal group is made up of networks of hundreds of family gangs which extended their influence across the world, raking in billions from drug trafficking, extortion and money laundering. We focus in particular on the analysis of the social structure of two Sicilian crime families and we used a Social Network Analysis approach to study the social phenomena. Starting from a real criminal network extracted from meetings emerging from the police physical surveillance during 2000s, we here aim to create artificial models that present similar properties. Methods: We use specific tools of s…

Theoretical computer sciencesocial network analysisSpectral distanceSettore INF/01 - InformaticaComputer sciencegraph theorySocial network analysis (criminology)social network analysiGraph theoryspectral distancenetwork modelCriminal networksCriminal networkGraph (abstract data type)Criminal networks social network analysis graph theory spectral distance network modelNetwork model
researchProduct

Bounded Computational Capacity Equilibrium

2010

We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the cost of memory goes to 0, includes the set of feasible and individually rational payoffs. This result stands in sharp contrast to Abreu and Rubisntein (1988), who proved that when memory is free, the set of equilibrium payoffs in repeated games played by players with bounded computational power is a strict subset of the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded c…

TheoryofComputation_MISCELLANEOUSEconomics and EconometricsComputer Science::Computer Science and Game TheoryBounded rationality automata complexity infnitely repeated games equilibrium.EconomiaOutcome (game theory)Set (abstract data type)Lexicographic preferences0502 economics and businessFOS: MathematicsFolk theoremMathematics - Optimization and ControlMathematicsFinite-state machine05 social sciencesProbability (math.PR)ComputingMilieux_PERSONALCOMPUTING050301 educationTheoryofComputation_GENERALBounded rationalityOptimization and Control (math.OC)Bounded functionRepeated game050206 economic theory0503 educationMathematical economicsMathematics - Probability
researchProduct

Review of thermal infrared applications and requirements for future high-resolution sensors

2016

High-resolution thermal infrared (TIR) remote sensing has a wide range of applications. In this paper, we describe the different applications and requirements identified in a literature review and during a consultation meeting with researcher experts in different fields. As a result, more than 30 applications were identified within three different fields: 1) land and solid Earth; 2) health and hazards; and 3) security and surveillance. A complete set of requirements (spatial, temporal, and radiometric resolution, algorithms used, and supporting data, among others) for each application is also provided. The results presented in this paper provide useful information to enhance the importance …

Thermal infrared010504 meteorology & atmospheric sciencesComputer scienceFuegosathigh resolution0211 other engineering and technologiesHigh resolutionland surface temperatureSettore ING-INF/02 - Campi Elettromagnetici02 engineering and technology01 natural sciencesSet (abstract data type)Fuegosat; high resolution; land surface emissivity; land surface temperature; thermal infraredland surface emissivitySystems engineeringGeneral Earth and Planetary Sciencesthermal infraredElectrical and Electronic EngineeringSolid earth021101 geological & geomatics engineering0105 earth and related environmental sciencesRemote sensing
researchProduct

A novel dynamic multi-model relevance feedback procedure for content-based image retrieval

2016

This paper deals with the problem of image retrieval in large databases with a big semantic gap by a relevance feedback procedure. We present a novel algorithm for modelling the users's preferences in the content-based image retrieval system.The proposed algorithm considers the probability of an image belonging to the set of those sought by the user, and estimates the parameters of several local logistic regression models whose inputs are the low-level image features. A Principal Component Analysis method is applied to the original vector to reduce its high dimensionality. The relevance probabilities predicted by these local models are combined by means of a weighted average. These weights …

Thesaurus (information retrieval)Computer scienceCognitive NeuroscienceRelevance feedback020207 software engineering02 engineering and technologycomputer.software_genreContent-based image retrievalComputer Science ApplicationsSet (abstract data type)Search engineArtificial IntelligenceFeature (computer vision)Principal component analysis0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingRelevance (information retrieval)Data miningcomputerImage retrievalSemantic gapNeurocomputing
researchProduct

Functional Brain Segmentation Using Inter-Subject Correlation in fMRI

2016

The human brain continuously processes massive amounts of rich sensory information. To better understand such highly complex brain processes, modern neuroimaging studies are increasingly utilizing experimental setups that better mimic daily‐life situations. A new exploratory data‐analysis approach, functional segmentation inter‐subject correlation analysis (FuSeISC), was proposed to facilitate the analysis of functional magnetic resonance (fMRI) data sets collected in these experiments. The method provides a new type of functional segmentation of brain areas, not only characterizing areas that display similar processing across subjects but also areas in which processing across subjects is h…

Time FactorsComputer science0302 clinical medicinetoiminnallinen magneettikuvausImage Processing Computer-AssistedCluster AnalysisSegmentationResearch Articlesinter-subject variabilityBrain Mappingshared nearest-neighborgraphmedicine.diagnostic_test05 social sciencesBrainHuman brainMiddle AgedMagnetic Resonance Imagingmedicine.anatomical_structurefunctional segmentationGaussian mixture modelGraph (abstract data type)/dk/atira/pure/sustainabledevelopmentgoals/good_health_and_well_beinginter-subject correlationAlgorithmsAdultshared nearest-neighbor graphModels NeurologicalSensory system050105 experimental psychology03 medical and health sciencesYoung AdultNeuroimagingSDG 3 - Good Health and Well-beingmedicineHumans0501 psychology and cognitive sciencesComputer SimulationCluster analysishuman brainCommunicationbusiness.industryMagnetic resonance imagingPattern recognitionfunctional magnetic resonance imagingOxygenAffinity propagationnaturalistic stimulationArtificial intelligencebusiness030217 neurology & neurosurgery
researchProduct

Biologically inspired information processing and synchronization in ensembles of non-identical threshold-potential nanostructures.

2013

Nanotechnology produces basic structures that show a significant variability in their individual physical properties. This experimental fact may constitute a serious limitation for most applications requiring nominally identical building blocks. On the other hand, biological diversity is found in most natural systems. We show that reliable information processing can be achieved with heterogeneous groups of non-identical nanostructures by using some conceptual schemes characteristic of biological networks (diversity, frequency-based signal processing, rate and rank order coding, and synchronization). To this end, we simulate the integrated response of an ensemble of single-electron transisto…

Time FactorsTransistors ElectronicScienceMaterials ScienceMonte Carlo methodSynchronizationMaterial by AttributeSet (abstract data type)BiomimeticsImage Processing Computer-AssistedNanotechnologyBiologyNanomaterialsComputational NeurosciencePhysicsCoding MechanismsSignal processingMultidisciplinaryQInformation processingRComputational BiologySignal Processing Computer-AssistedSensory SystemsNanostructuresBionanotechnologyElectronic MaterialsProbability distributionMedicineBiological systemMonte Carlo MethodRealization (systems)Biological networkResearch ArticleBiotechnologyNeurosciencePLoS ONE
researchProduct

Asynchronously switched control of discrete impulsive switched systems with time delays

2013

This paper is concerned with the stabilization problem for a class of uncertain discrete impulsive switched delay systems under asynchronous switching. The so-called asynchronous switching means that the switches between the candidate controllers and system modes are asynchronous. By using the average dwell time (ADT) approach, sufficient conditions for the existence of an asynchronously switched controller is derived such that the resulting closed-loop system is exponentially stable. The desired controller gains and the admissible switching signals are obtained in terms of a set of matrix inequalities. A numerical example is given to illustrate the effectiveness of the proposed method.

Time delaysInformation Systems and ManagementControl (management)Computer Science ApplicationsTheoretical Computer ScienceSet (abstract data type)Dwell timeMatrix (mathematics)Exponential stabilityArtificial IntelligenceControl and Systems EngineeringControl theoryAsynchronous communicationSoftwareMathematicsInformation Sciences
researchProduct

A Lightweight Network Discovery Algorithm for Resource-constrained IoT Devices

2019

Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive on resource-constrained devices. In this work, we propose a distributed lightweight implementation of network discovery for simple IoT devices. Our approach is based on the exchange of symbolic executable code among nodes. Based on this abstraction, we propose an algorithm that makes even IoT resource-constrained nodes able to construct the network topology graph incrementally and without any a priori information about device positioning and presence. The minimal set of executab…

Topology constructionSIMPLE (military communications protocol)Computer scienceExecutable code exchangeResource-constrained devicecomputer.file_formatConstruct (python library)Network topologyDistributed processingSet (abstract data type)Computer Networks and CommunicationHardware and ArchitectureA priori and a posterioriGraph (abstract data type)Symbolic processingExecutableInternet of ThingAlgorithmcomputerSoftwareAbstraction (linguistics)2019 International Conference on Computing, Networking and Communications (ICNC)
researchProduct

Trace and density results on regular trees

2019

We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.

Trace (linear algebra)Mathematics::Analysis of PDEsBoundary (topology)01 natural sciencesMeasure (mathematics)Potential theorySet (abstract data type)Combinatoricsregular treeMathematics - Metric Geometry0103 physical sciencesEuclidean geometryClassical Analysis and ODEs (math.CA)FOS: Mathematics0101 mathematicsMathematicsdensityMathematics::Functional Analysis010102 general mathematicsMetric Geometry (math.MG)Functional Analysis (math.FA)Sobolev spaceMathematics - Functional AnalysisMathematics - Classical Analysis and ODEs010307 mathematical physicsTree (set theory)46E35 30L99funktionaalianalyysiAnalysisboundary traceNewtonian space
researchProduct

Non-wandering sets with non-empty interiors

2003

We study diffeomorphisms of a closed connected manifold whose non-wandering set has a non-empty interior and conjecture that C1-generic diffeomorphisms whose non-wandering set has a non-empty interior are transitive. We prove this conjecture in three cases: hyperbolic diffeomorphisms, partially hyperbolic diffeomorphisms with two hyperbolic bundles, and tame diffeomorphisms (in the first case, the conjecture is folklore; in the second one, it follows by adapting the proof in Brin (1975 Topological transitivity of a certain class of dynamical systems, and flows of frames on manifolds of negative curvature Funct. Anal. Appl. 9 9–19)).We study this conjecture without global assumptions and pro…

Transitive relationPure mathematicsClass (set theory)Mathematics::Dynamical SystemsConjectureDynamical systems theoryApplied MathematicsMathematical analysisGeneral Physics and AstronomyHyperbolic manifoldStatistical and Nonlinear PhysicsManifoldSet (abstract data type)Homoclinic orbitMathematics::Symplectic GeometryMathematical PhysicsMathematicsNonlinearity
researchProduct