3044680
On autonomous computing and cognitive processes
This paper explores the approaches to implement intelligent behaviors by biological organisms, silicon automata, and computing systems. Autonomous computing is introduced as the latest and advanced computing techniques built upon routine, algorithmic, and adaptive systems. The theory and philosophy behind autonomous computing is cognitive informatics. In other words, autonomous computing systems are applications of cognitive informatics. A layered reference model of the brain (LRMB) and its cognitive mechanisms and processes are described in this talk, which form the foundation for designing and implementing autonomous computing systems. Real-time process algebra (RTPA) is introduced to formally and rigorously describe autonomous computing systems and cognitive behaviors. It is believed that applications of cognitive informatics and autonomous computing result in the development of new generation computing architectures and information processing systems.
21455681
A layered reference model of the brain
Based on the advances of research in cognitive informatics and related fields, this paper attempts to develop a layered reference model of the brain that explains the functional mechanisms and cognitive processes of the natural intelligence. A variety of life functions and cognitive processes have been identified in cognitive informatics, cognitive science, neuropsychology, and neurophilosophy. In order to formally and rigorously describe a comprehensive and coherent set of mental processes and their relationships, an integrated reference model of the brain is established, which encompasses 37 cognitive processes at six layers known as the sensation, memory, perception, action, meta and higher cognitive layers from bottom up. The reference model of the brain may be applied to explain a wide range of physiological, psychological, and cognitive phenomena in cognitive informatics, particularly relationships between the inherited and the acquired life functions, as well as the subconscious and conscious cognitive processes.
21184887
The cognitive processes of abstraction and formal inferences
Theoretical research is predominately an inductive process; while applied research is mainly a deductive process. Both inference processes are based on the cognitive process and means of abstraction. This paper describes the cognitive processes of abstraction and formal inferences such as deduction, induction, abduction, and analogy. The hierarchy of abstraction and the descriptivity of abstract means at different levels are analyzed. A set of mathematical models of formal inference methodologies are developed. Formal descriptions of the five cognitive processes of abstraction and inferences are presented using real-time process algebra (RTPA). Applications of abstraction and formal inferences in dealing with complicated problems in large-scale software system development in software engineering are discussed.
16244688
Formal Description of Time Management in Real-Time Operating Systems
This paper describes the formal specification of the time management subsystem of a real-time operating system. Real-time process algebra (RTPA) is adopted to formally specify the system. The architecture, static behaviors, and dynamic behaviors of a CPU time manager are systematically specified that form an abstract model of the system. The formal specifications are implemented in C, on which the system performance can be tested and verified
40360434
Measurement of the cognitive functional complexity of software
One of the central problems in software engineering is its inherited complexity. It is recognized that cognitive informatics plays an important role in understanding the fundamental characteristics of software. This paper models the cognitive weights of basic control structures of software, and develops a new concept of cognitive functional size for measuring software complexity. Comparative case studies between the cognitive functional size and physical sizes of 20 programs are conducted. It is found that for a given design, although the physical sizes of software may vary in a wide range, the cognitive functional sizes are much stable and independent from implementation technologies and programming languages. Therefore, the cognitive functional size provides a novel, stable and practical software complexity measurement and is helpful to explain the fundamental nature of software complexity in the phase of design, implementation, or maintenance in software engineering.
29450095
Cognitive models of the brain
The human brain is the most complicated organ in the universe and a new frontier yet to be explored in an interdisciplinary approach. Investigation of the brain is a unique problem that requires recursive mental power to explore the brain using the brain. This paper attempts to develop functional and cognitive models of the brain by using cognitive informatics and formal methodologies. This paper adopts a memory-based approach to explore the brain, and to demonstrate that memory is the foundation for any natural intelligence. Structures of memories are explored and cognitive models of the natural intelligence are proposed. Cognitive mechanisms of the brain, including hypotheses and theories on the thinking engine of the brain, long-term memory establishment, and roles of sleep in long-term memory development, are investigated. The models and theories are applied to explain a number of fundamental physiological and psychological phenomena.
6216289
Efficient and Secure Storage Systems Based on Peer-to-Peer Systems
Two fundamental problems that confront peer-to-peer applications are to efficiently locate the node that stores a data object and to achieve data security (e.g., confidentiality, integrity, authentication, and authorization). This paper presents a model for secure distributed applications based on peer-to-peer systems and presents Chord , a distributed lookup protocol that address the data object location problem in peer-to-peer systems. The protocol Chord is a novel combination of Chord and Tapestry/Plaxton-Rajaraman-Richa with provable better performance. In particular, node insertion in our scheme could be finished in steps (all other existing node insertion algorithms for peer-to-peer systems take steps—see the summary in Hildrum et al.).
961760
Revisiting Colored Networks and Privacy Preserving Censorship
Reliable networks are obviously an important aspect of critical information infrastructures. Dolev-Dwork-Waarts-Yung linked research on reliable point-to-point networks with privacy and authenticity. In their threat model the adversary can only take over a number of nodes bounded by a threshold k. Hirt-Maurer introduced the concept of an adversary structure (i.e. the complement of an access structure). Kumar-Goundan-Srinathan-Rangan and Desmedt-Wang-Burmester generalized Dolev-Dwork-Waarts-Yung scenarios to the case of a general adversary structure. 
 
Burmester-Desmedt introduced a special adversary structure, now called a color based adversary structure. Their argument in favor of their model is that using automated attacks (such as worms), a vulnerability can be exploited on all computers in the network running the same platform (color). In their model the adversary can control all nodes that use up to k different platforms (or colors). 
 
We will demonstrate one of the limitations of their model. Although the family of color based adversary structures has a trivial representation which size grows polynomial in the size of the graph, we will demonstrate in this paper that deciding reliability issues and security issues are co-NP-complete. 
 
In most societies censorship is common. Indeed, for centuries it has often been viewed by authorities as an essential security tool. We apply the computational complexity result to study censorship. Authorities may require network designers to demonstrate the capability to censor the internet. We present a zero-knowledge interactive proof for the case of a color based adversary structure.
16943053
Towards an indoor location system using RF signal strength in IEEE 802.11 networks
Location is one of the most important contexts used in pervasive computing environments. GPS systems are intensely used to detect the location information; they mainly work in outdoor environment. Applications call for precise, easy-to-build, and easy-to-use indoor location systems. This paper presents our work to implement an indoor location determination system for Microsoft-Windows-based platforms using a preexisting IEEE 802.11 wireless network. The location is determined from radio signal strength information collected from multiple base stations at different physical locations. Our experiments show a high accuracy rate of this approach.
6883825
Integrated Task Planning and Control for Mobile Manipulators
In this paper we present an approach to decoupled force/position control of the end-effector along the same direction for redundant robots, and an approach to nonholonomic cart pushing with mobile manipulators. The mobile manipulator is considered as a redundant robot, and a unified dynamic model for an integrated mobile platform and on-board manipulator is developed. The dynamic model is decoupled and linearized using the nonlinear feedback technique in a unified frame. Combining the event-based planning and control method with singularity analysis of the robot arm, a task level action controller is designed and an online kinematic redundancy resolution scheme is developed. The system is stable during normal operation as well as at the occurrence of unexpected obstacles. In addition, explicit force/position control along the same task direction for redundant robots is proposed. The kinematic redundancy of mobile manipulators enables independent control of force and position along the same task directions. To verify the decoupled force/postion scheme, an integrated task planning and control approach is further proposed for the mobile manipulator to complete complicated tasks by regulating its output force. A cart pushing task, which requires both force and position control along the same task direction, is discussed. The cart manipulation task fully integrates trajectory and force planning of the cart, and planning and control of the mobile manipulators. The approaches have been tested on a mobile manipulator consisting of a Nomadic XR4000 and a Puma 560 robot arm. The experimental results demonstrate the efficacy of the approach for the mobile manipulation of a nonholonomic cart.
44869762
Agent based dynamic recovery protocol in distributed databases
Recovering from node failures is a critical issue in distributed database systems. In conventional log-based recovery protocols, the nodes providing recovery service may be overburdened, especially when the recovery is resource consuming. In this paper, an agent-based dynamic recovery protocol is presented. It divides the whole recovery process into three major steps: log-recovery, agent-recovery, and synchronization. The key idea of this protocol is to cache new database operations initiated during recovery into agents. All these cached operations are then replayed independently for further recovery. The analysis indicates that the new protocol can minimize internode's dependency and improve recovery speed. As a result, system failure rate is cut down and the overall performance gets improved.