Search results for "FOS: Computer and information sciences"

showing 10 items of 857 documents

Topological properties of cellular automata on trees

2012

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata Theory0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Complexity (cs.CC)Topology01 natural scienceslcsh:QA75.5-76.95[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]0101 mathematicsF.1.1;F.1.2;F.1.3MathematicsCellular Automata and Lattice Gases (nlin.CG)lcsh:Mathematics010102 general mathematicsCellular automaton tree shift expansivity permutivity right-closingness opennesslcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonComputer Science - Computational Complexity010201 computation theory & mathematicsTree (set theory)lcsh:Electronic computers. Computer scienceF.1.2F.1.3ExpansiveNonlinear Sciences - Cellular Automata and Lattice GasesF.1.1Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

On List Coloring with Separation of the Complete Graph and Set System Intersections

2022

We consider the following list coloring with separation problem: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|= a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $\varphi$ of sets of integers to the vertices of $G$ such that $\varphi(u)\subset L(u)$ and $|\varphi(v)|=b$ for any vertex $u$ and $\varphi(u)\cap \varphi(v)=\emptyset$ for any edge $uv$. Such a value of $c$ is called the separation number of $(G,a,b)$. Using a special partition of a set of lists for which we obtain an improved version of Poincar\'e's crible, we determine the separation number of the c…

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]FOS: Computer and information sciences[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]05C15 05C25Discrete Mathematics (cs.DM)FOS: MathematicsMathematics - CombinatoricsCombinatorics (math.CO)Computer Science - Discrete Mathematics
researchProduct

Asymptotic bit frequency in Fibonacci words

2021

It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]FOS: Computer and information sciences[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Mathematics::CombinatoricsDiscrete Mathematics (cs.DM)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Combinatorics (math.CO)[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events

2012

In this paper, starting from a generalized coherent (i.e. avoiding uniform loss) intervalvalued probability assessment on a finite family of conditional events, we construct conditional probabilities with quasi additive classes of conditioning events which are consistent with the given initial assessment. Quasi additivity assures coherence for the obtained conditional probabilities. In order to reach our goal we define a finite sequence of conditional probabilities by exploiting some theoretical results on g-coherence. In particular, we use solutions of a finite sequence of linear systems.

conditional eventFOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaArtificial Intelligence (cs.AI)Computer Science - Artificial Intelligencequasi additivityProbability (math.PR)FOS: MathematicsG-coherenceconditional probabilityinterval-valued probability assessmentMathematics - Probability
researchProduct

Persistence in complex systems

2022

Persistence is an important characteristic of many complex systems in nature, related to how long the system remains at a certain state before changing to a different one. The study of complex systems' persistence involves different definitions and uses different techniques, depending on whether short-term or long-term persistence is considered. In this paper we discuss the most important definitions, concepts, methods, literature and latest results on persistence in complex systems. Firstly, the most used definitions of persistence in short-term and long-term cases are presented. The most relevant methods to characterize persistence are then discussed in both cases. A complete literature r…

fractal dimensionFOS: Computer and information sciencesComplex systemsRenewable energyglobal solar-radiationsystems' statesComplex networksGeneral Physics and AstronomyFOS: Physical scienceslong-term and short-term methodsadaptationzero-temperature dynamicsDynamical Systems (math.DS)Physics - GeophysicsneurosciencememoryMethodology (stat.ME)PersistenceOptimization and planningMemoryMachine learningearthquake magnitude seriesFOS: MathematicsAtmosphere and climateMathematics - Dynamical SystemsAdaptationcomplex systemslow-visibility eventstime-seriesStatistics - Methodologyinflation persistenceLong-term and short-term methodsdetrended fluctuation analysislong-range correlationspersistencecomplex networksSystems’ statesEconomyneural networksrenewable energyGeophysics (physics.geo-ph)atmosphere and climateeconomymachine learningoptimization and planningNeural networkswind-speedNeuroscience
researchProduct

Estimating finite mixtures of semi-Markov chains: an application to the segmentation of temporal sensory data

2019

Summary In food science, it is of great interest to obtain information about the temporal perception of aliments to create new products, to modify existing products or more generally to understand the mechanisms of perception. Temporal dominance of sensations is a technique to measure temporal perception which consists in choosing sequentially attributes describing a food product over tasting. This work introduces new statistical models based on finite mixtures of semi-Markov chains to describe data collected with the temporal dominance of sensations protocol, allowing different temporal perceptions for a same product within a population. The identifiability of the parameters of such mixtur…

futureStatistics and ProbabilityFOS: Computer and information sciencesGamma distributionmiceComputer sciencemedia_common.quotation_subjectPopulationdominancecomputer.software_genreStatistics - Applications01 natural sciencesMethodology (stat.ME)modelsExpectation-maximization algorithmModel-based clustering010104 statistics & probability0404 agricultural biotechnology[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]Bayesian information criterionPerceptionExpectation–maximization algorithmApplications (stat.AP)Temporal dominance of sensations[MATH]Mathematics [math]0101 mathematicseducationStatistics - Methodologymedia_common2. Zero hungereducation.field_of_studyMarkov chainMarkov renewal processStatistical model04 agricultural and veterinary sciencesidentifiabilityMixture modelBayesian information criterion040401 food science[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]IdentifiabilityPenalized likelihoodData miningStatistics Probability and UncertaintycomputertdsCategorical time seriessensations
researchProduct

Joint Sub-Carrier and Power Allocation for Efficient Communication of Cellular UAVs

2020

| openaire: EC/H2020/857031/EU//5G!Drones Cellular networks are expected to be the main communication infrastructure to support the expanding applications of Unmanned Aerial Vehicles (UAVs). As these networks are deployed to serve ground User Equipment (UEs), several issues need to be addressed to enhance cellular UAVs’ services. In this paper, we propose a realistic communication model on the downlink, and we show that the Quality of Service (QoS) for the users is affected by the number of interfering BSs and the impact they cause. The joint problem of sub-carrier and power allocation is therefore addressed. Given its complexity, which is known to be NP-hard, we introduce a solution based …

game theorySignal Processing (eess.SP)FOS: Computer and information sciencescellular networksComputer scienceDistributed computing02 engineering and technologyComputer Science - Networking and Internet ArchitectureTelecommunications linkFOS: Electrical engineering electronic engineering information engineering0202 electrical engineering electronic engineering information engineeringWirelessElectrical Engineering and Systems Science - Signal ProcessingElectrical and Electronic EngineeringUnmanned aerial vehicles (UAVs)Networking and Internet Architecture (cs.NI)business.industryApplied MathematicsQuality of serviceMatching game020206 networking & telecommunicationsdownlink communicationComputer Science ApplicationsModels of communicationCellular networkbusinessGame theoryIEEE Transactions on Wireless Communications
researchProduct

AI ethics:an empirical study on the views of practitioners and lawmakers

2023

Artificial intelligence (AI) solutions and technologies are being increasingly adopted in smart systems contexts; however, such technologies are concerned with ethical uncertainties. Various guidelines, principles, and regulatory frameworks are designed to ensure that AI technologies adhere to ethical well-being. However, the implications of AI ethics principles and guidelines are still being debated. To further explore the significance of AI ethics principles and relevant challenges, we conducted a survey of 99 randomly selected representative AI practitioners and lawmakers (e.g., AI engineers and lawyers) from 20 countries across five continents. To the best of our knowledge, this is the …

haasteet (ongelmat)FOS: Computer and information sciences213 Electronic automation and communications engineering electronicschallengestekoäly113 Computer and information sciencesArtificial intelligence (AI)Human-Computer InteractionComputer Science - Computers and SocietyAI ethicsAI ethics principlesModeling and SimulationComputers and Society (cs.CY)machine ethicsaccountable artificial intelligenceetiikkaSocial Sciences (miscellaneous)
researchProduct

Modeling and Mitigating Errors in Belief Propagation for Distributed Detection

2021

We study the behavior of the belief-propagation (BP) algorithm affected by erroneous data exchange in a wireless sensor network (WSN). The WSN conducts a distributed multidimensional hypothesis test over binary random variables. The joint statistical behavior of the sensor observations is modeled by a Markov random field whose parameters are used to build the BP messages exchanged between the sensing nodes. Through linearization of the BP message-update rule, we analyze the behavior of the resulting erroneous decision variables and derive closed-form relationships that describe the impact of stochastic errors on the performance of the BP algorithm. We then develop a decentralized distribute…

hajautetut järjestelmätFOS: Computer and information sciencesfactor graphsComputer scienceComputer Science - Information TheoryBinary number02 engineering and technologycommunication errorsBelief propagationcomputation errorslangaton tiedonsiirtooptimointiLinearizationalgoritmit0202 electrical engineering electronic engineering information engineeringlikelihood-ratio testmessage-passing algorithmsElectrical and Electronic EngineeringStatistical hypothesis testingdistributed systemsMarkov random fieldsignaalinkäsittelyInformation Theory (cs.IT)linear data-fusionsensoriverkot020206 networking & telecommunicationscooperative communicationsData exchange020201 artificial intelligence & image processingblind signal processingRandom variableWireless sensor networkAlgorithm
researchProduct

Do Software Firms Collaborate or Compete? A Model of Coopetition in Community-initiated OSS Projects

2019

[Background] An increasing number of commercial firms are participating in Open Source Software (OSS) projects to reduce their development cost and increase technical innovativeness. When collaborating with other firms whose sought values are conflicts of interests, firms may behave uncooperatively leading to harmful impacts on the common goal. [Aim] This study explores how software firms both collaborate and compete in OSS projects. [Method] We adopted a mixed research method on three OSS projects. [Result] We found that commercial firms participating in community-initiated OSS projects collaborate in various ways across the organizational boundaries. While most of firms contribute little,…

lcsh:Computer softwareFOS: Computer and information sciencesCOSSohjelmistotuotantoCoopetitionOpen source softwareCollaborationyhteistyöSoftware Engineering (cs.SE)Computer Science - Computers and SocietyComputer Science - Software Engineeringcase studykilpailu (talous)tapaustutkimuslcsh:QA76.75-76.765avoin lähdekoodiComputers and Society (cs.CY)competitiontietotekniikkayritykset
researchProduct