Search results for "NUMB"

showing 10 items of 3956 documents

The Hierarchical Continuous Pursuit Learning Automation: A Novel Scheme for Environments With Large Numbers of Actions.

2019

Although the field of learning automata (LA) has made significant progress in the past four decades, the LA-based methods to tackle problems involving environments with a large number of actions is, in reality, relatively unresolved. The extension of the traditional LA to problems within this domain cannot be easily established when the number of actions is very large. This is because the dimensionality of the action probability vector is correspondingly large, and so, most components of the vector will soon have values that are smaller than the machine accuracy permits, implying that they will never be chosen . This paper presents a solution that extends the continuous pursuit paradigm to …

Theoretical computer scienceHierarchical learning automataHierarchy (mathematics)DiscretizationLearning automataComputer Networks and CommunicationsComputer scienceLarge action numbersPursuit learning automata02 engineering and technologyVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420Probability vectorLearning automataComputer Science ApplicationsAutomatonOperator (computer programming)Artificial Intelligence0202 electrical engineering electronic engineering information engineeringBenchmark (computing)Estimator-based learning automata020201 artificial intelligence & image processingVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550SoftwareCurse of dimensionalityIEEE transactions on neural networks and learning systems
researchProduct

The Hierarchical Continuous Pursuit Learning Automation for Large Numbers of Actions

2018

Part 10: Learning - Intelligence; International audience; Although the field of Learning Automata (LA) has made significant progress in the last four decades, the LA-based methods to tackle problems involving environments with a large number of actions are, in reality, relatively unresolved. The extension of the traditional LA (fixed structure, variable structure, discretized, and pursuit) to problems within this domain cannot be easily established when the number of actions is very large. This is because the dimensionality of the action probability vector is correspondingly large, and consequently, most components of the vector will, after a relatively short time, have values that are smal…

Theoretical computer scienceHierarchical learning automataHierarchy (mathematics)Learning automataComputer sciencePursuit learning automataPursuit LALearning Automata02 engineering and technologyEstimator-based LAProbability vectorField (computer science)020202 computer hardware & architectureLA with large number of actionsVariable (computer science)Operator (computer programming)Learning Automata (LA)Action (philosophy)0202 electrical engineering electronic engineering information engineeringEstimator-based learning automata[INFO]Computer Science [cs]020201 artificial intelligence & image processingHierarchical LACurse of dimensionality
researchProduct

On t-Conorm Based Fuzzy (Pseudo)metrics

2020

We present an alternative approach to the concept of a fuzzy (pseudo)metric using t-conorms instead of t-norms and call them t-conorm based fuzzy (pseudo)metrics or just CB-fuzzy (pseudo)metrics. We develop the basics of the theory of CB-fuzzy (pseudo)metrics and compare them with “classic” fuzzy (pseudo)metrics. A method for construction CB-fuzzy (pseudo)metrics from ordinary metrics is elaborated and topology induced by CB-fuzzy (pseudo)metrics is studied. We establish interrelations between CB-fuzzy metrics and modulars, and in the process of this study, a particular role of Hamacher t-(co)norm in the theory of (CB)-fuzzy metrics is revealed. Finally, an intuitionistic version of a CB-fu…

Theoretical computer scienceLogicComputer scienceMathematics::General MathematicsCB-fuzzy (pseudo)metric02 engineering and technology01 natural sciencesFuzzy logic0202 electrical engineering electronic engineering information engineeringCB-fuzzy (pseudo)metric; archimedian t-(co)norms; hamacher t-(co)norm; modular; modular metric; intuinionistic fuzzy metricsmodular0101 mathematicsMathematical PhysicsAlgebra and Number Theoryintuinionistic fuzzy metricslcsh:Mathematicslcsh:QA1-939010101 applied mathematicsNorm (mathematics)hamacher t-(co)normmodular metric020201 artificial intelligence & image processingGeometry and TopologyComputingMethodologies_GENERALarchimedian t-(co)normsAnalysisAxioms
researchProduct

Gradation of Fuzzy Preconcept Lattices

2021

Noticing certain limitations of concept lattices in the fuzzy context, especially in view of their practical applications, in this paper, we propose a more general approach based on what we call graded fuzzy preconcept lattices. We believe that this approach is more adequate for dealing with fuzzy information then the one based on fuzzy concept lattices. We consider two possible gradation methods of fuzzy preconcept lattice—an inner one, called D-gradation and an outer one, called M-gradation, study their properties, and illustrate by a series of examples, in particular, of practical nature.

Theoretical computer scienceLogicComputer scienceMathematics::General Mathematicsfuzzy context; fuzzy preconcept; fuzzy preconcept lattice; fuzzy concept; fuzzy concept lattice; graded fuzzy preconcept lattice0206 medical engineeringfuzzy preconceptContext (language use)02 engineering and technologyFuzzy logic0202 electrical engineering electronic engineering information engineeringFuzzy conceptMathematical Physicsfuzzy preconcept latticeAlgebra and Number TheorySeries (mathematics)lcsh:Mathematicsfuzzy contextfuzzy conceptfuzzy concept latticelcsh:QA1-939graded fuzzy preconcept latticeComputer Science::Programming Languages020201 artificial intelligence & image processingGradationGeometry and Topology020602 bioinformaticsAnalysisAxioms; Volume 10; Issue 1; Pages: 41
researchProduct

Robustness and Randomness

2008

The study of robustness problems for computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities. Robustness problems are caused by the lack of precision in computations involving floating-point instead of real numbers. This paper reviews methods dealing with robustness and inaccuracy problems. It discusses approaches based on exact arithmetic, interval arithmetic and probabilistic methods. The paper investigates the possibility to use randomness at certain levels of reasoning to make geometric constructions more robust.

Theoretical computer sciencebusiness.industryComputation020207 software engineering0102 computer and information sciences02 engineering and technologyMachine learningcomputer.software_genre01 natural sciencesInterval arithmeticProbabilistic method010201 computation theory & mathematicsRobustness (computer science)0202 electrical engineering electronic engineering information engineeringArtificial intelligencebusinesscomputerRandomnessMathematicsReal number
researchProduct

Reflections on the Nature of the Periodic Table of the Elements: Implications in Chemical Education

2014

The periodic table of the elements (PTE) results essential to understand our nature and place in the whole of beings. The same happens with our food, drugs, materials, etc. A series of questions were asked to introduce PTE and provide answers. The ideas in PTE should be valued by the number of questions that they generate. The PTE was related to electron configurations. The emergence of elements (nucleosynthesis) in physics was explained. The PTE results essential to understand our nature and place in the whole of beings. The same happens with our food, drugs, materials, etc. Schwarz and Rich asked a series of questions (Qs) to introduce PTE and provided answers. The ideas on PTE should be …

Theoretical physicsSeries (mathematics)Chemistry educationPeriod (periodic table)ChemistryGroup NumberElectron configurationChemistry (relationship)Quantum numberValence electronProceedings of The 18th International Electronic Conference on Synthetic Organic Chemistry
researchProduct

Ultrametric Finite Automata and Turing Machines

2013

We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceComputer scienceSuper-recursive algorithmProbabilistic Turing machineDescription numberNonlinear Sciences::Cellular Automata and Lattice GasesTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTuring completenesssymbolsQuantum finite automataAutomata theoryTwo-way deterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Quantum Real - Time Turing Machine

2001

The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceQuantum Turing machineDTIMEComputer scienceProbabilistic Turing machine2-EXPTIMESuper-recursive algorithmComputationDescription numberDSPACElaw.inventionsymbols.namesakeTuring machineTuring completenessNon-deterministic Turing machinelawAlgorithm characterizationsQuantumPSPACEQuantum computerFinite-state machineTuring machine examplesNSPACETheoryofComputation_GENERALAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTuring reductionTheory of computationsymbolsUniversal Turing machineTime hierarchy theoremAlternating Turing machineComputer Science::Formal Languages and Automata TheoryRegister machine
researchProduct

Space-Efficient 1.5-Way Quantum Turing Machine

2001

1.5QTM is a sort of QTM (Quantum Turing Machine) where the head cannot move left (it can stay where it is and move right). For computations is used other - work tape. In this paper will be studied possibilities to economize work tape space more than the same deterministic Turing Machine can do (for some of the languages). As an example language (0i1i|i ≥ 0) is chosen, and is proved that this language could be recognized by deterministic Turing machine using log(i) cells on work tape , and 1.5QTM can recognize it using constant cells quantity.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceQuantum Turing machineSuper-recursive algorithmComputer scienceProbabilistic Turing machineComputationDescription numberMultitape Turing machineDSPACElaw.inventionTuring machinesymbols.namesakeNon-deterministic Turing machinelawAlgorithm characterizationsPSPACEWolfram's 2-state 3-symbol Turing machineTuring machine examplesNSPACETuring reductionsymbolsUniversal Turing machineTime hierarchy theoremAlternating Turing machineRegister machine
researchProduct

On the classification of large residential buildings stocks by sample typologies for energy planning purposes

2014

Local and central administrations are often called to properly allocate economic resources intended for the territorial energy planning, on the basis of the performances achieved by implementing energy conservation measures. Particularly in the residential sector, that represents one of the most relevant sector for the energy demand, effective and reliable evaluation tools are required for this aim. Unfortunately, building stocks are characterized by a very large number of buildings that are referred to different construction periods and are equipped with a variety of appliances and tools, other than with different heating and cooling systems. This means that the whole energy consumption of…

Thermal consumptionEngineeringOfficial statisticsSettore ING-IND/11 - Fisica Tecnica Ambientalebusiness.industryMechanical EngineeringLarge numbersBuilding and ConstructionEnergy consumptionManagement Monitoring Policy and LawEnvironmental economicsEnergy planningCivil engineeringElectric applianceEnergy accountingEnergy policyEnergy conservationGeneral EnergySample typologieBuildings stockbusinessEnergy policyStock (geology)Applied Energy
researchProduct