Search results for "MAZ"

showing 10 items of 3205 documents

IncentMe: Effective Mechanism Design to Stimulate Crowdsensing Participants with Uncertain Mobility

2018

Mobile crowdsensing harnesses the sensing power of modern smartphones to collect and analyze data beyond the scale of what was previously possible with traditional sensor networks. Given the participatory nature of mobile crowdsensing, it is imperative to incentivize mobile users to provide sensing services in a timely and reliable manner. Most importantly, given sensed information is often valid for a limited period of time, the capability of smartphone users to execute sensing tasks largely depends on their mobility pattern, which is often uncertain. For this reason, in this paper, we propose IncentMe, a framework that solves this core issue by leveraging game-theoretical reverse auction …

FOS: Computer and information sciencesOptimizationMonitoringComputer Networks and CommunicationsComputer scienceDistributed computingMobile computingCrowdsensing02 engineering and technologyComputer Science - Networking and Internet ArchitectureReverse auctionSmart phoneCrowdsensingGame Theory0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringSensorNetworking and Internet Architecture (cs.NI)Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniMechanism designMobile computing020206 networking & telecommunicationsAuctionNavigationCore (game theory)RoadComputer Networks and CommunicationSensingTask analysisTask analysiParticipatoryState (computer science)MechanismSmartphoneWireless sensor networkIncentiveSoftware
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

Constructing Antidictionaries in Output-Sensitive Space

2021

A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\ldots,y_k$ over an alphabet $\Sigma$, we are asked to compute the set $\mathrm{M}^{\ell}_{y_{1}\#\ldots\#y_{k}}$ of minimal absent words of length at most $\ell$ of word $y=y_1\#y_2\#\ldots\#y_k$, $\#\notin\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\Omega(n)$ space for $n=|y|$ using any of the plenty available $\mathcal{O}(n)$-time algorithms. This is because a…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniOutput sensitive algorithmsString algorithmsPhysicsAntidictionarieSettore INF/01 - InformaticaOutput sensitive algorithm0102 computer and information sciencesAbsent wordsSpace (mathematics)01 natural sciencesAntidictionariesCombinatorics010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYData compressionComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Computer Science::Symbolic Computation[INFO]Computer Science [cs]Absent wordAlphabetWord (group theory)2019 Data Compression Conference (DCC)
researchProduct

String attractors and combinatorics on words

2019

The notion of \emph{string attractor} has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word $w=w[1]w[2]\cdots w[n]$ is a subset $\Gamma$ of the positions $\{1,\ldots,n\}$, such that all distinct factors of $w$ have an occurrence crossing at least one of the elements of $\Gamma$. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the noti…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - InformaticaFormal Languages and Automata Theory (cs.FL)De Brujin wordComputer Science - Formal Languages and Automata TheoryBurrows-Wheeler transformString attractorComputer Science - Data Structures and AlgorithmsThue-Morse wordLempel-Ziv encodingBurrows-Wheeler transform; De Brujin word; Lempel-Ziv encoding; Run-length encoding; String attractor; Thue-Morse wordData Structures and Algorithms (cs.DS)Run-length encoding
researchProduct

Quasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects

2013

We make a probabilistic analysis related to some inference rules which play an important role in nonmonotonic reasoning. In a coherence-based setting, we study the extensions of a probability assessment defined on $n$ conditional events to their quasi conjunction, and by exploiting duality, to their quasi disjunction. The lower and upper bounds coincide with some well known t-norms and t-conorms: minimum, product, Lukasiewicz, and Hamacher t-norms and their dual t-conorms. On this basis we obtain Quasi And and Quasi Or rules. These are rules for which any finite family of conditional events p-entails the associated quasi conjunction and quasi disjunction. We examine some cases of logical de…

FOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaInformation Systems and ManagementComputer Science - Artificial Intelligencet-Norms/conormDuality (mathematics)goodman-nguyen inclusion relation; lower/upper probability bounds; t-norms/conorms; generalized loop rule; coherence; quasi conjunction/disjunctionComputer Science::Artificial IntelligenceTheoretical Computer ScienceArtificial IntelligenceFOS: MathematicsProbabilistic analysis of algorithmsNon-monotonic logicRule of inferenceLower/upper probability boundGoodman–Nguyen inclusion relationMathematicsEvent (probability theory)Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniDiscrete mathematicsInterpretation (logic)Probability (math.PR)Probabilistic logicCoherence (philosophical gambling strategy)Generalized Loop ruleComputer Science ApplicationsAlgebraArtificial Intelligence (cs.AI)Control and Systems EngineeringQuasi conjunction/disjunctionCoherenceMathematics - ProbabilitySoftwareInformation Sciences
researchProduct

A quantum vocal theory of sound

2020

Concepts and formalism from acoustics are often used to exemplify quantum mechanics. Conversely, quantum mechanics could be used to achieve a new perspective on acoustics, as shown by Gabor studies. Here, we focus in particular on the study of human voice, considered as a probe to investigate the world of sounds. We present a theoretical framework that is based on observables of vocal production, and on some measurement apparati that can be used both for analysis and synthesis. In analogy to the description of spin states of a particle, the quantum-mechanical formalism is used to describe the relations between the fundamental states associated with phonetic labels such as phonation, turbule…

FOS: Computer and information sciencesSound (cs.SD)Computer scienceAudio processingAnalogyAudio processing; Quantum-inspired algorithms; Sound representation01 natural sciencesComputer Science - Sound050105 experimental psychologyTheoretical Computer Sciencesymbols.namesakeAudio and Speech Processing (eess.AS)0103 physical sciencesFOS: Electrical engineering electronic engineering information engineering0501 psychology and cognitive sciencesPhonationElectrical and Electronic Engineering010306 general physicsQuantumHuman voiceQuantum computerSound representationSettore INF/01 - Informatica05 social sciencesStatistical and Nonlinear PhysicsObservableSettore MAT/04 - Matematiche ComplementariElectronic Optical and Magnetic MaterialsVibrationClassical mechanicsFourier transformComputer Science::SoundModeling and SimulationSignal ProcessingsymbolsQuantum-inspired algorithms Audio processing Sound representationQuantum-inspired algorithmsSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniElectrical Engineering and Systems Science - Audio and Speech Processing
researchProduct

Quantum GestART: Identifying and Applying Correlations between Mathematics, Art, and Perceptual Organization

2020

Mathematics can help analyze the arts and inspire new artwork. Mathematics can also help make transformations from one artistic medium to another, considering exceptions and choices, as well as artists' individual and unique contributions. We propose a method based on diagrammatic thinking and quantum formalism. We exploit decompositions of complex forms into a set of simple shapes, discretization of complex images, and Dirac notation, imagining a world of "prototypes" that can be connected to obtain a fine or coarse-graining approximation of a given visual image. Visual prototypes are exchanged with auditory ones, and the information (position, size) characterizing visual prototypes is con…

FOS: Computer and information sciencesdiagrams; Dirac notation; Gestalt; Gestural similarity; sonificationmedia_common.quotation_subjectHistory and Overview (math.HO)ComputerApplications_COMPUTERSINOTHERSYSTEMSThe artsGestaltBra–ket notationPerceptionGestural similarityFOS: MathematicssonificationQuantummedia_commonCognitive scienceSettore INF/01 - InformaticaMathematics - History and OverviewApplied MathematicsSettore MAT/04 - Matematiche ComplementariMultimedia (cs.MM)Gestural similarity Gestalt diagrams Dirac notation sonificationComputational MathematicsdiagramsSonificationModeling and SimulationGestalt psychologyDirac notationInformationSystems_MISCELLANEOUSSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniComputer Science - MultimediaMusic
researchProduct

Audio-video people recognition system for an intelligent environment

2011

In this paper an audio-video system for intelligent environments with the capability to recognize people is presented. Users are tracked inside the environment and their positions and activities can be logged. Users identities are assessed through a multimodal approach by detecting and recognizing voices and faces through the different cameras and microphones installed in the environment. This approach has been chosen in order to create a flexible and cheap but reliable system, implemented using consumer electronics. Voice features are extracted by a short time cepstrum analysis, and face features are extracted using the eigenfaces technique. The recognition task is solved using the same Su…

Face featureSettore ING-INF/05 - Sistemi Di Elaborazione Delle Informazionibusiness.industryComputer scienceIntelligent environmentPeople recognitionFeature extractionReliable systemSet-up phaseSingle sensorFacial recognition systemSelection principleSupport vector machineSoftwareEigenfaceMulti-modal approachMiddlewareCepstrumLearning ruleIntelligent environmentCepstrum analysiComputer visionArtificial intelligenceEigenfacebusiness
researchProduct

Good Old-Fashioned Artificial Consciousness and the Intermediate Level Fallacy

2018

Recently, there has been considerable interest and effort to the possibility to design and implement conscious robots, i.e., the chance that a robot may have subjective experiences. However, typical approaches as the global workspace, information integration, enaction, cognitive mechanisms, embodiment, i.e., the Good Old-Fashioned Artificial Consciousness, henceforth, GOFAC, share the same conceptual framework. In this paper, we discuss GOFAC's basic tenets and their implication for AI and Robotics. In particular, we point out the intermediate level fallacy as the central issue affecting GOFAC. Finally, we outline a possible alternative conceptual framework towards robot consciousness.

Fallacyartificial consciousnessComputer sciencemedia_common.quotation_subjectlcsh:Mechanical engineering and machinerymachine consciousnessArtificial consciousness050105 experimental psychologylcsh:QA75.5-76.95Enactivism03 medical and health sciences0302 clinical medicineArtificial IntelligenceHypothesis and Theory0501 psychology and cognitive scienceslcsh:TJ1-1570media_commonrobot consciousness; machine consciousness; artificial consciousness; synthetic phenomenology; robot self-awarenessrobot consciousneartificial consciousneCognitive scienceSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniRobotics and AIIntegrated information theory05 social sciencesHard problem of consciousnessComputer Science Applicationsrobot self-awarenessConceptual frameworkRobotlcsh:Electronic computers. Computer scienceConsciousnessrobot consciousnesssynthetic phenomenologymachine consciousne030217 neurology & neurosurgeryFrontiers in Robotics and AI
researchProduct

Famiglie, disagio e servizio sociale

2019

Il volume raccoglie contributi che intendono disvelare la natura sociale e culturale della famiglia. Gli autori dei contributi hanno messo in evidenza come la famiglia, lungi dall'essere una entità ovvia e data per scontata, sia invece il prodotto di aspettative, comportamenti socialmente strutturati, oltre che di negoziazioni e di rapporti di potere e dinamiche, talvolta profondamente conflittuali. The volume collects contributions that intend to reveal the social and cultural nature of the family.

Families hardship social work social change social relationships family relationships family dynamics transformations within the familySettore SPS/08 - Sociologia Dei Processi Culturali E ComunicativiFamiglie diasgio servizio sociale mutamento sociale relazioni sociali relazioni familiari dinamiche familiari trasformazioni in seno alla famiglia
researchProduct