Results 1  10
of
12
A Layered Reference Model of the Brain (LRMB
 IEEE Transactions on Systems, Man, and Cybernetics (C
, 2006
"... Abstract – A variety of life functions and cognitive processes have been identified in cognitive informatics, psychology, cognitive science, and neurophilosophy. This paper attempts to develop a Layered Reference Model of the Brain (LRMB) that formally and rigorously explains the functional mechanis ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Abstract – A variety of life functions and cognitive processes have been identified in cognitive informatics, psychology, cognitive science, and neurophilosophy. This paper attempts to develop a Layered Reference Model of the Brain (LRMB) that formally and rigorously explains the functional mechanisms and cognitive processes of the natural intelligence. A comprehensive and coherent set of mental processes and their relationships is identified in LRMB, that encompasses 37 cognitive processes at six layers known as the sensation, memory, perception, action, meta cognitive, and higher cognitive layers from the bottomup. The LRMB reference model provides an integrated framework for modeling the brain and the mind. LRMB also enables future extension and refinement of cognitive processes within the same hierarchical framework. LRMB can be applied to explain a wide range of physiological, psychological, and cognitive phenomena in cognitive informatics, particularly the relationships and interactions between the inherited and the acquired life functions, as well as those of the subconscious and conscious cognitive processes. Index Terms – Cognitive informatics, the brain, reference model, natural intelligence, cognitive
On autonomous computing and cognitive processes
 Third IEEE International Conference on Cognitive Informatics, IEEE
, 2004
"... ..."
(Show Context)
On contemporary denotational mathematics for computational intelligence
 TRANS. COMPUT. SCI.
, 2008
"... Denotational mathematics is a category of expressive mathematical structures that deals with highlevel mathematical entities beyond numbers and sets, such as abstract objects, complex relations, behavioral information, concepts, knowledge, processes, intelligence, and systems. New forms of mathema ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Denotational mathematics is a category of expressive mathematical structures that deals with highlevel mathematical entities beyond numbers and sets, such as abstract objects, complex relations, behavioral information, concepts, knowledge, processes, intelligence, and systems. New forms of mathematics are sought, collectively known as denotational mathematics, in order to deal with complex mathematical entities emerged in cognitive informatics, computational intelligence, software engineering, and knowledge engineering. The domain and architecture of denotational mathematics are presented in this paper. Three paradigms of denotational mathematics, known as concept algebra, system algebra, and RealTime Process Algebra (RTPA), are introduced. Applications of denotational mathematics in cognitive informatics and computational intelligence are elaborated. A set of case studies is presented on the modeling of iterative and recursive systems architectures and behaviors by RTPA, the modeling of autonomic machine learning by concept algebra, and the modeling of granular computing by system algebra.
A spatial extension to the π calculus
 In Proceedings on the First Workshop “From Biology to concurrency and back
, 2007
"... Spatial dynamics receive increasing attention in Systems Biology and require suitable modeling and simulation approaches. So far, modeling formalisms have focused on populationbased approaches or place and move individuals relative to each other in space. SpacePi extends the π calculus by time and ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Spatial dynamics receive increasing attention in Systems Biology and require suitable modeling and simulation approaches. So far, modeling formalisms have focused on populationbased approaches or place and move individuals relative to each other in space. SpacePi extends the π calculus by time and space. π processes are embedded into a vector space and move individually. Only processes that are sufficiently close can communicate. The operational semantics of SpacePi defines the interplay between movement, communication, and timetriggered events. A model describing the phototaxis of the Euglena microorganism is presented as a practical example. The formalism’s use and generality is discussed with respect to the modeling of molecular biological processes like diffusion, active transportation in cell signaling, and spatial structures. Keywords: pi calculus, spatial modeling, systems biology. 1
Cognitive Informatics: Exploring the Theoretical Foundations for Natural Intelligence, Neural Informatics, Autonomic Computing, and Agent Systems ABSTRACT Editorial PrEfacE
"... Cognitive informatics (CI) is a new discipline that studies the natural intelligence and internal information processing mechanisms of the brain, as well as the processes involved in perception and cognition. CI provides a coherent set of fundamental theories, and contemporary mathematics, ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Cognitive informatics (CI) is a new discipline that studies the natural intelligence and internal information processing mechanisms of the brain, as well as the processes involved in perception and cognition. CI provides a coherent set of fundamental theories, and contemporary mathematics,
unknown title
"... A new measure of software complexity based on cognitive weights Une nouvelle métrique de complexité logicielle basée sur les poids cognitifs ..."
Abstract
 Add to MetaCart
(Show Context)
A new measure of software complexity based on cognitive weights Une nouvelle métrique de complexité logicielle basée sur les poids cognitifs
zur Erlangung des Doktorgrades
"... Tag der mündlichen Prüfung: This thesis deals with Baker domains and approximation of Julia sets, so it belongs to the area of ”Holomorphic Dynamical Systems”. Dynamical systems belong to the allday life of scientists and engineers and are closely related to the term of iteration. Processes of iter ..."
Abstract
 Add to MetaCart
(Show Context)
Tag der mündlichen Prüfung: This thesis deals with Baker domains and approximation of Julia sets, so it belongs to the area of ”Holomorphic Dynamical Systems”. Dynamical systems belong to the allday life of scientists and engineers and are closely related to the term of iteration. Processes of iteration occur if the state of a system is changed by external influences at discrete points of time. Examples are the weather, turbulent flows in liquids or the development of populations. Moreover, iteration can be a tool to solve other mathematical problems or to approximate their solutions. Among various numerical methods we only mention Newton’s method to approximate roots of differentiable functions. All these dynamical systems have in common that they may develop in different directions. The boundary between different initial states of different developments is just the Julia set of the corresponding function. Julia sets were systematically analyzed for the first time around 1920 by the French matematicians P. Fatou and G. Julia, who concentrated on rational functions and observed that Julia sets are either very simple objects or extremly complicated. The development of powerful computers and new mathematical methods gave a boost to the research in this area in the 80’s, and since then also a theory of iteration of entire transcendental functions has been founded. The aim of this work is to describe what can happen to the Julia sets if an entire transcendental function satisfying a certain condition (having socalled Baker domains or wandering domains) is approximated by a sequence of polynomials or is perturbed holomorphically in a class of entire transcendental functions. 4 Organization of the paper This paper comes in four chapters: the Introduction, Preliminaries and Notation, the Results and the Proofs. All the results will be stated in chapter 3, and, for example, a result in section 3.1.1 will have its proof located in section 4.1.1.
A Specification for Underground Tank Monitoring System (UTMS) Using . . .
, 2004
"... The Realtime process algebra (RTPA) is a set of new mathematic notations for formally describing system architecture, and static and dynamic behaviors. It is recognized that the specification of software behaviors is a threedimensional problem known as: (1) mathematic operation, (2) event/process t ..."
Abstract
 Add to MetaCart
The Realtime process algebra (RTPA) is a set of new mathematic notations for formally describing system architecture, and static and dynamic behaviors. It is recognized that the specification of software behaviors is a threedimensional problem known as: (1) mathematic operation, (2) event/process timing, (3) memory manipulation. RTPA is designed as a coherent, expressive and easycomprehend software engineering notation system and formal engineering method for specifying, refining and implementing software systems which have the characteristic of 3D, especially for the realtime and embedded systems. RTPA elicits and models 32 algebraic notations which are 16 metaprocesses and 16 metarelations. The set of these 32 notations are collected, derived and developed from existing formal methods and modern programming languages. As a result, they can be combined together to specifying all complex software system architectures. Besides, RTPA provides not only metatype included primary and special data types but also Abstract Data Types (ADTs). Generally, the very small set of formal notation has been proven sufficient for modeling and specifying realtime system, their architecture, and static / dynamic behaviors in realworld software engineering environment. In this paper, first we represent 32 basic notations in RTPA and then apply RTPA to specify an embedded using realtime operating system. That is the Underground Tank Monitoring System  UTMS, it is represented to show the advantages of RTPA as specifying and refining a realtime system. In the appendix at the end of this paper, RTPA is also in comparison with other formal methods to show more clearly its advantages.