Search results for " Computer Science"

showing 10 items of 3983 documents

On the path representation of networks

1982

A compact data structure for networks is obtained by storing arcs of paths sequentially. This structure allows forward and backward access from a node to its neighbors.

Computational MathematicsTheoretical computer scienceComputer Networks and CommunicationsComputer scienceApplied MathematicsNode (networking)Path (graph theory)Structure (category theory)TopologyData structureRepresentation (mathematics)SoftwareBIT
researchProduct

An Analysis of the Influence of Noneffective Instructions in Linear Genetic Programming

2020

Abstract Linear Genetic Programming (LGP) represents programs as sequences of instructions and has a Directed Acyclic Graph (DAG) dataflow. The results of instructions are stored in registers that can be used as arguments by other instructions. Instructions that are disconnected from the main part of the program are called noneffective instructions, or structural introns. They also appear in other DAG-based GP approaches like Cartesian Genetic Programming (CGP). This article studies four hypotheses on the role of structural introns: noneffective instructions (1) serve as evolutionary memory, where evolved information is stored and later used in search, (2) preserve population diversity, (3)…

Computational MathematicsTheoretical computer scienceDataflowComputer scienceLinear genetic programmingPopulation diversitySymbolic regressionCartesian genetic programmingDirected acyclic graphBiological EvolutionAlgorithmsNeutral mutationEvolutionary Computation
researchProduct

A Computational Technique for Solving Singularly Perturbed Delay Partial Differential Equations

2021

Abstract In this work, a matrix method based on Laguerre series to solve singularly perturbed second order delay parabolic convection-diffusion and reaction-diffusion type problems involving boundary and initial conditions is introduced. The approximate solution of the problem is obtained by truncated Laguerre series. Moreover convergence analysis is introduced and stability is explained. Besides, a test case is given and the error analysis is considered by the different norms in order to show the applicability of the method.

Computational TechniquePartial differential equationlaguerre polynomials and seriesComputer scienceElectronic computers. Computer sciencedelay partial differential equationApplied mathematicslaguerre matrix-collocation methodQA75.5-76.95singularly perturbed parabolic problemconvergence analysisFoundations of Computing and Decision Sciences
researchProduct

Mobile phone data statistics as a dynamic proxy indicator in assessing regional economic activity and human commuting patterns

2020

Computational Theory and MathematicsArtificial IntelligenceControl and Systems EngineeringMobile phoneComputer sciencePrincipal component analysisEconometricsProxy (climate)Theoretical Computer ScienceExpert Systems
researchProduct

A multi-step finite-state automaton for arbitrarily deterministic Tsetlin Machine learning

2021

Computational Theory and MathematicsArtificial IntelligenceControl and Systems EngineeringVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550Theoretical Computer Science
researchProduct

How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?

2012

It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achieved for some functions. In this paper we study the case of approximate degree and bounded-error quantum query complexity. We show that for these measures the correct lower bound is Omega(log n / loglog n), and we exhibit quantum algorithms for two functions where this bound is achieved.

Computational complexity theoryGeneral MathematicsFOS: Physical sciences0102 computer and information sciences02 engineering and technology01 natural sciencesUpper and lower boundsTheoretical Computer ScienceComplexity indexCombinatorics0202 electrical engineering electronic engineering information engineeringBoolean functionMathematicsQuantum computerDiscrete mathematicsQuantum PhysicsApproximation theoryDegree (graph theory)TheoryofComputation_GENERALApproximation algorithmComputational MathematicsComputational Theory and Mathematics010201 computation theory & mathematics020201 artificial intelligence & image processingQuantum algorithmQuantum Physics (quant-ph)Quantum complexity theory2013 IEEE Conference on Computational Complexity
researchProduct

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Computational complexity theoryLogiccomputational complexityguarded fragmentsatisfiability problemBinary numberTheoretical Computer ScienceCombinatoricsArts and Humanities (miscellaneous)Computer Science::Logic in Computer ScienceClosure operatorEquivalence (formal languages)MathematicsDiscrete mathematicssatisfiability problemcomputational complexitydecidabilityequivalence closureSatisfiabilityDecidabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (computer programming)Hardware and ArchitectureTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSBoolean satisfiability problemSoftwareJournal of Logic and Computation
researchProduct

[Editorial] Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition

2018

Cagnoni, S., & Castelli, M. (2018). [Editorial]. Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition. Algorithms, 11(3), 1-2. DOI: 10.3390/a11030025 This special issue of Algorithms is devoted to the study of Computational Intelligence and Nature-Inspired Algorithms for Real-World Data Analytics and Pattern Recognition. The special issue considered both theoretical contributions able to advance the state-of-the-art in this field and practical applications that describe novel approaches for solving real-world problems. published

Computational intelligenceNumerical AnalysisComputational MathematicsComputational Theory and MathematicsData analyticsPattern recognitionNature-inspired algorithmsTheoretical Computer Science
researchProduct

A VR-Enhanced Rollover Car Simulator and Edutainment Application for Increasing Seat Belt Use Awareness

2021

Most countries have active road safety policies that seek the objective of reducing deaths in traffic accidents. One of the main factors in this regard is the awareness of the safety measures, one of the most important being the correct usage of the seat belt, a device that is known to save thousands of lives every year. The presented work shows a VR-enhanced edutainment application designed to increase awareness on the use of seat belts. For this goal, a motorized rollover system was developed that, synchronized with a VR application (shown in a head-mounted display for each user inside a real car), rolls over this car with up to four passengers inside. This way, users feel the sensations …

Computer Networks and CommunicationsComputer scienceContext (language use)02 engineering and technologySerious gameVirtual realitylaw.inventiontraffic safetyAeronauticslaw0202 electrical engineering electronic engineering information engineeringSeat beltPer capitagamificationawarenessserious gameSeguretat viària05 social sciencesedutainment050301 education020207 software engineeringQA75.5-76.95RolloverHuman-Computer InteractionRisk perceptionPsicologiaWork (electrical)Electronic computers. Computer sciencevirtual realityseat beltrollover simulator0503 educationComputers
researchProduct

Learning Automata-based Misinformation Mitigation via Hawkes Processes

2021

AbstractMitigating misinformation on social media is an unresolved challenge, particularly because of the complexity of information dissemination. To this end, Multivariate Hawkes Processes (MHP) have become a fundamental tool because they model social network dynamics, which facilitates execution and evaluation of mitigation policies. In this paper, we propose a novel light-weight intervention-based misinformation mitigation framework using decentralized Learning Automata (LA) to control the MHP. Each automaton is associated with a single user and learns to what degree that user should be involved in the mitigation strategy by interacting with a corresponding MHP, and performing a joint ra…

Computer Networks and CommunicationsComputer scienceDistributed computingStochastic optimizationSocial media Misinformation02 engineering and technologyCrisis mitigationArticleTheoretical Computer ScienceLearning automata020204 information systemsConvergence (routing)0202 electrical engineering electronic engineering information engineeringState spaceSocial mediaMisinformationVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550Social networkLearning automatabusiness.industryAutomaton020201 artificial intelligence & image processingStochastic optimizationbusinessHawkes processesSoftwareInformation Systems
researchProduct