Search results for "architecture"

showing 10 items of 3706 documents

Cloning and training collective intelligence with generative adversarial networks

2021

Industry 4.0 and highly automated critical infrastructure can be seen as cyber‐physical‐social systems controlled by the Collective Intelligence. Such systems are essential for the functioning of the society and economy. On one hand, they have flexible infrastructure of heterogeneous systems and assets. On the other hand, they are social systems, which include collaborating humans and artificial decision makers. Such (human plus machine) resources must be pre‐trained to perform their mission with high efficiency. Both human and machine learning approaches must be bridged to enable such training. The importance of these systems requires the anticipation of the potential and previously unknow…

Cognitive scienceTechnological innovations. AutomationCloning (programming)Computer scienceHD45-45.2Collective intelligenceManufacturestekoälyTraining (civil)Industrial and Manufacturing EngineeringTS1-2301Computer Science ApplicationsAdversarial systemkoneoppiminenArtificial IntelligenceHardware and Architectureautomaatiojärjestelmätihminen-konejärjestelmätälytekniikkaGenerative grammarIET Collaborative Intelligent Manufacturing
researchProduct

Knowledge representation for robotic vision based on conceptual spaces and attentive mechanisms

1995

A new cognitive architecture for artificial vision is proposed. The architecture is aimed for an autonomous intelligent system, as several cognitive hypotheses have been postulated as guidelines for its design. The design is based on a conceptual representation level between the subsymbolic level processing the sensory data, and the linguistic level describing scenes by means of a high-level language. The architecture is also based on the active role of a focus of attention mechanism in the link between the conceptual and the linguistic level. The link between the conceptual level and the linguistic level is modelled as a time-delay attractor neural network.

Cognitive scienceVision basedKnowledge representation and reasoningMechanism (biology)Computer sciencebusiness.industryRepresentation (systemics)CognitionCognitive architectureKnowledge RepresentationFocus (linguistics)Artificial IntelligenceArtificial Vision; Artificial Intelligence; Knowledge RepresentationArtificial VisionArtificial intelligenceArchitecturebusiness
researchProduct

How to engineer biologically inspired cognitive architectures

2013

Biologically inspired cognitive architectures are complex systems where different modules of cognition interact in order to reach the global goals of the system in a changing environment. Engineering and modeling this kind of systems is a hard task due to the lack of techniques for developing and implementing features like learning, knowledge, experience, memory, adaptivity in an inter-modular fashion. We propose a new concept of intelligent agent as abstraction for developing biologically cognitive architectures. © 2013 Springer-Verlag.

Cognitive systemsComputer scienceBiologically inspiredComplex systemCognitionCognitive architecturecomputer.software_genreCognitive architectureTask (project management)Biologically inspired cognitive architecturedesign processIntelligent agentAdaptivityChanging environmentHuman–computer interactionHard taskcomputerSocial simulationAbstraction (linguistics)
researchProduct

New Technology, Writing And Learning

2001

The participants involved in most previous studies on writing have written their texts by hand but writing with the aid of a computer is much more prevalent today. This chapter specifically examines the effects of new technology on writing and, by implication, on writing to learn, and presents examples how technology has created new possibilities for using writing for purposes of learning. The chapter is divided into four main parts. Part one briefly introduces the chapter. Part two considers the nature of writing in terms of interactions between planning, writing and editing. Part three examines how computer aided writing changes these processes. Here individual and collaborative writing a…

Collaborative writingComputer scienceComputer-aidedEducational technologyMathematics educationComputer basedExperiential learningElectronic mailWord (computer architecture)Learning sciences
researchProduct

Quelles nuits, pour quels territoires ?

2015

International audience; Quelles nuits, pour quels territoires ?

Collectif RENOIR[SHS.GEO] Humanities and Social Sciences/Geography[SDE.MCG]Environmental Sciences/Global ChangesCiel étoilé[ SHS.GEO ] Humanities and Social Sciences/Geography[ SHS.ARCHI ] Humanities and Social Sciences/Architecture space managementObscuritévalorisation[SHS.ENVIR] Humanities and Social Sciences/Environmental studiesPatrimonialisationRessource obscuritéenvironnement nocturneComputingMilieux_MISCELLANEOUS[SHS.ARCHI]Humanities and Social Sciences/Architecture space managementPollution lumineuse[SHS.GEO]Humanities and Social Sciences/Geographyprotection[SDE.ES]Environmental Sciences/Environmental and Society[SDE.BE] Environmental Sciences/Biodiversity and Ecology[SDE.MCG] Environmental Sciences/Global ChangesTouristification[SHS.ENVIR]Humanities and Social Sciences/Environmental studies[SDE.ES] Environmental Sciences/Environmental and Society[SHS.ARCHI] Humanities and Social Sciences/Architecture space management[SDE.BE]Environmental Sciences/Biodiversity and Ecology[ SDE.ES ] Environmental Sciences/Environmental and Societynuitterritoires
researchProduct

On Brauer’s Height Zero Conjecture

2014

In this paper, the unproven half of Richard Brauer’s Height Zero Conjecture is reduced to a question on simple groups.

CombinatoricsComputer Science::Hardware ArchitectureConjectureApplied MathematicsGeneral MathematicsSimple groupBlock theoryZero (complex analysis)Mathematics::Representation TheoryMathematicsCollatz conjectureJournal of the European Mathematical Society
researchProduct

Circuit Lower Bounds via Ehrenfeucht-Fraisse Games

2006

In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable by AC/sup 0/ circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC/sup 0/ circuits.

CombinatoricsDiscrete mathematicsComputer Science::Hardware ArchitectureClass (set theory)Computer Science::Emerging TechnologiesComputabilityGame complexityEhrenfeucht–Fraïssé gameCircuit complexityGame theoryLinear numberElectronic circuitMathematics21st Annual IEEE Conference on Computational Complexity (CCC'06)
researchProduct

A code to evaluate prolate and oblate spheroidal harmonics

1998

Abstract We present a code to evaluate prolate ( P n m ( x ), Q n m ( x ); n ≥ m , x > 1) and oblate ( P n m ( ix ), Q n m ( ix ); n ≥ m , x > 0) spheroidal harmonics, that is, spherical harmonics ( n and m integers) for real arguments larger than one and for purely imaginary arguments. We start from the known values (in closed form) of P m m and P m +1 m and we apply the forward recurrence relation over n up to a given degree n = N Max . The Wronskian relating P 's and Q 's, together with the evaluation of the continued fraction for Q m+N staggeredMax m / Q m+N staggeredMax -1 m , allows the calculation of Q m+N staggeredMax m and Q m+N staggeredMax -1 m . Backward recurrence is then appli…

CombinatoricsRecurrence relationDegree (graph theory)Legendre seriesHardware and ArchitectureWronskianHarmonicsOblate spheroidGeneral Physics and AstronomySpherical harmonicsGeometryProlate spheroidMathematicsComputer Physics Communications
researchProduct

Forbidden Factors and Fragment Assembly

2001

In this paper methods and results related to the notion of minimal forbidden words are applied to the fragment assembly problem. The fragment assembly problem can be formulated, in its simplest form, as follows: reconstruct a word w from a given set I of substrings (fragments ) of a word w . We introduce an hypothesis involving the set of fragments I and the maximal length m(w) of the minimal forbidden factors of w . Such hypothesis allows us to reconstruct uniquely the word w from the set I in linear time. We prove also that, if w is a word randomly generated by a memoryless source with identical symbol probabilities, m(w) is logarithmic with respect to the size of w . This result shows th…

CombinatoricsSet (abstract data type)Fragment (logic)LogarithmDeterministic automatonSymbol (programming)General MathematicsTime complexitySoftwareWord (computer architecture)SubstringComputer Science ApplicationsMathematicsRAIRO - Theoretical Informatics and Applications
researchProduct

Null Effect of Set Size in Lexical Decision

1995

The effect of set size indicates that recall of a word is greater when its cue is associated with fewer words. This study was designed to replicate this result with lexical decisions of 18 students. In spite of obtaining the set-size effect with cue recall, it was not observed with lexical decision.

CommunicationRecallbusiness.industryNull (mathematics)Experimental and Cognitive PsychologyReplicatecomputer.software_genreSensory SystemsSpiteLexical decision taskArtificial intelligenceSet (psychology)businesscomputerNatural language processingWord (computer architecture)MathematicsPerceptual and Motor Skills
researchProduct