Search results for " Applications"

showing 10 items of 4541 documents

MAD+. Introducing Misconceptions in the Temporal Analysis of the Mathematical Modelling Process of a Fermi Problem

2021

This work describes how the combination of the mistakes committed by a group of pre-service teachers when solving a Fermi problem, with the representation of the temporal analysis of their resolutions, can offer more in-depth information about their conceptual misconceptions regarding mathematical and modelling concepts. The combined representation allows knowing when mistakes occur and provides a powerful tool for instructors to adapt the teaching–learning processes of mathematics at all levels of education. Our study is based on a recent categorisation of students’ mistakes, together with the creation of a new representation tool, called MAD+, that can combine all this information. The ma…

Theoretical computer sciencePublic AdministrationestimationGroup (mathematics)Computer scienceProcess (engineering)Physical Therapy Sports Therapy and RehabilitationContext (language use)Resolution (logic)mathematics educationLMatemàtica EnsenyamentComputer Science ApplicationsEducationsymbols.namesakeFermi problemsDevelopmental and Educational PsychologyComputer Science (miscellaneous)symbolsFermi problemmodelling activity diagramsmathematical modellingRepresentation (mathematics)Education Sciences
researchProduct

Diffusive neural network

2002

Abstract A non-connectionist model of a neuronal network based on passive diffusion of neurotransmitters is presented as an alternative to hard-wired artificial neural networks. Classic thermodynamical approach shows that the diffusive network is capable of exhibiting asymptotic stability and a dynamics resembling that of a chaotic system. Basic computational capabilities of the net are discussed based on the equivalence with a Turing machine. The model offers a way to represent mass-sustained brain functions in terms of recurrent behaviors in the phase space.

Theoretical computer scienceQuantitative Biology::Neurons and CognitionArtificial neural networkComputer scienceCognitive NeuroscienceChaoticTopologyComputer Science ApplicationsTuring machinesymbols.namesakeRecurrent neural networkExponential stabilityArtificial IntelligencePhase spacesymbolsBiological neural networkStochastic neural networkNeurocomputing
researchProduct

Artificial Intelligence + Distributed Systems = Agents

2009

The connection with Wirth’s book goes beyond the title, albeit confining the area to modern Artificial Intelligence (AI). Whereas thirty years ago, to devise effective programs, it became necessary to enhance the classical algorithmic framework with approaches applied to limited and focused subdomains, in the context of broad-band technology and semantic web, applications - running in open, heterogeneous, dynamic and uncertain environments-current paradigms are not enough, because of the shift from programs to processes. Beside the structure as position paper, to give more weight to some basic assertions, results of recent research are abridged and commented upon in line with new paradigms.…

Theoretical computer scienceSpeedupComputer Networks and CommunicationsComputer sciencebusiness.industryDesign elements and principlesBounded rationalityComputer Science ApplicationsSoftwareComputational Theory and MathematicsPosition paperArtificial intelligencebusinessSemantic WebMerge (version control)International Journal of Computers Communications & Control
researchProduct

Building collective capabilities through ICT in a mountain region of Nepal: where social capital leads to collective action

2012

In this paper, we explore how ICT can lead to development specifically human development in Sen's capability approach. In answering to the critique that Sen views capabilities as the individual, we incorporate the societal level by adding collective capabilities. We propose that ICT helps to create or enhance SC of communities which in turn can lead to development by building collective capabilities through collective action. To illustrate, we conducted a qualitative case study of an ICT initiative in a remote mountain region of Nepal. We found support for our proposition and further that developing collective capabilities also simultaneously enhanced individual capabilities. We contribute …

Theory buildingKnowledge managementPublic AdministrationComputer sciencebusiness.industryEnvironmental resource managementDevelopmentCollective actionSocietal levelHuman development (humanity)Computer Science ApplicationsInformation and Communications TechnologyCapability approachbusinessSocial capitalInformation Technology for Development
researchProduct

An Approximate Determinization Algorithm for Weighted Finite-State Automata

2001

Nondeterministic weighted finite-state automata are a key abstraction in automatic speech recognition systems. The efficiency of automatic speech recognition depends directly on the sizes of these automata and the degree of nondeterminism present, so recent research has studied ways to determinize and minimize them, using analogues of classical automata determinization and minimization. Although, as we describe here, determinization can in the worst case cause poly-exponential blowup in the number of states of a weighted finite-state automaton, in practice it is remarkably successful. In extensive experiments in automatic speech recognition systems, deterministic weighted finite-state autom…

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFinite-state machineTheoretical computer scienceGeneral Computer ScienceComputer scienceApplied MathematicsComputer Science ApplicationsAutomatonNondeterministic algorithmNondeterministic finite automaton with ε-movesComputer Science::SoundDeterministic automatonTheory of computationStandard testMinificationAlgorithmComputer Science::Formal Languages and Automata TheoryAlgorithmica
researchProduct

Automata and forbidden words

1998

Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Büchi automaton0102 computer and information sciences02 engineering and technologyω-automaton01 natural sciencesTheoretical Computer ScienceCombinatoricsDeterministic automaton0202 electrical engineering electronic engineering information engineeringTwo-way deterministic finite automatonNondeterministic finite automatonMathematicsPowerset constructionLevenshtein automaton020206 networking & telecommunicationsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesComputer Science ApplicationsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsSignal ProcessingProbabilistic automatonComputer Science::Programming LanguagesComputer Science::Formal Languages and Automata TheoryInformation Systems
researchProduct

Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application

2008

We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryCorrelated equilibriumSequential gameComputer scienceDynamic programmingSubgame perfect equilibriumsymbols.namesakeCoordination gameElectrical and Electronic EngineeringRisk dominanceFolk theoremPrice of stabilityNon-credible threatGame theoryCentipede gameImplementation theoryNon-cooperative gameInventoryNormal-form gameStochastic gameComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALComputer Science ApplicationsConsensus protocols; Dynamic programming; Game theory; InventoryConsensus protocolsZero-sum gameControl and Systems EngineeringNash equilibriumEquilibrium selectionBest responsesymbolsRepeated gameEpsilon-equilibriumConsensus protocols; Dynamic programming; Game theory; Inventory;Potential gameSolution conceptMathematical economicsGame theory
researchProduct

Mean Field Linear Quadratic Games with Set Up Costs

2013

This paper studies linear quadratic games with set up costs monotonic on the number of active players, namely, players whose action is non-null. Such games arise naturally in joint replenishment inventory systems. Building upon a preliminary analysis of the properties of the best response strategies and Nash equilibria for the given game, the main contribution is the study of the same game under large population. We also analyze the influence of an additional disturbance in the spirit of the literature on H∞ control. Numerical illustrations are provided. © 2012 Springer Science+Business Media New York.

TheoryofComputation_MISCELLANEOUSStatistics and ProbabilityComputer Science::Computer Science and Game TheoryEconomics and EconometricsMathematical optimizationSequential gamedifferential games game theory control and optimizationJoint-replenishmentOutcome (game theory)symbols.namesakeMean field gamesGame theoryMathematicsMean field games; Linear quadratic differential games; Joint-replenishment[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Applied MathematicsNormal-form gameComputingMilieux_PERSONALCOMPUTINGoperational researchTheoryofComputation_GENERALScreening gameComputer Graphics and Computer-Aided DesignComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsNash equilibriumBest responseRepeated gamesymbolsLinear quadratic differential gamesSettore MAT/09 - Ricerca OperativaoptimizationGame theoryMathematical economicsDynamic Games and Applications
researchProduct

ANALYSIS OF A RECIPROCATE ENGINE–BASED COGENERATION PLANT WITH HIGH TEMPERATURE HEAT RECOVERY FOR INDUSTRIAL USES

2012

In consequence of the increasing awareness on the future scarcity of fossil energy sources and the global warming impact of energy conversion processes, the European Union has been planning several actions to enhance the efficiency of energy use and reduce the environmental impact. The declared goals of EU actions are synthetized in the 20-20-20 formula, consisting of an expected 20% increase of energy efficiency, a 20% contribution to the total energy supply by renewable sources and a 20% abatement of pollutant emissions. Applications of cogeneration in process industry can significantly contribute to achieve these targets. In this paper a reciprocate engine-based Combined Heat and Power (…

Thermal efficiencyEngineeringWaste managementbusiness.industryRenewable energyCogenerationHeat recovery ventilationWaste heatSettore ING-IND/10 - Fisica Tecnica Industrialemedia_common.cataloged_instanceEnergy saving industrial applications cogeneration heat recovery reciprocate engine gas turbineEuropean unionWhite certificatesbusinessEfficient energy usemedia_common
researchProduct

Thermoconvective instability and local thermal non-equilibrium in a porous layer with isoflux-isothermal boundary conditions

2014

The effects of lack of local thermal equilibrium between the solid phase and the fluid phase are taken into account for the convective stability analysis of a horizontal porous layer. The layer is bounded by a pair of plane parallel walls which are impermeable and such that the lower wall is subject to a uniform flux heating, while the upper wall is isothermal. The local thermal non-equilibrium is modelled through a two-temperature formulation of the energy exchange between the phases, resulting in a pair of local energy balance equations: one for each phase. Small-amplitude disturbances of the basic rest state are envisaged to test the stability. Then, the standard normal mode procedure is…

Thermal equilibriumConvectionHistoryLOCAL THERMAL NONEQUILIBRIUMEIGENPROBLEM FORMULATIONChemistryThermodynamicsLOCAL THERMAL NON-EQUILIBRIUMMechanicsInstabilityIsothermal processComputer Science ApplicationsEducationPhysics::Fluid DynamicsShooting methodThermal conductivityPOROUS MEDIUMLINEAR STABILITY ANALYSISHeat transferBoundary value problemUNIFORM WALL HEAT FLUXJournal of Physics: Conference Series
researchProduct