http://popups.lib.uliege.be/1373-5411/index.php?id=87 Full text issues fr Mon, 13 May 2024 16:39:05 +0200 Wed, 06 Nov 2024 11:31:58 +0100 http://popups.lib.uliege.be/1373-5411/index.php?id=87 0 http://popups.lib.uliege.be/1373-5411/index.php?id=2424 This paper deals with the Euler and Incursive algorithms of the nonlinear pendulum. The Euler algorithm is unstable. The incursive algorithms show a stable solution as an orbital stabilify for small values of the time step. For larger values of the time step, the incursive algorithms show an orbital stability for small values of the initial conditions and a chaotic sea for larger initial conditions. Tue, 20 Aug 2024 11:27:28 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2424 http://popups.lib.uliege.be/1373-5411/index.php?id=2428 This paper deals with a comparison from the precision and stability point of view of different discrete algorithms for simulating differential equation systems, applied in the case of a simple differential system: the harmonic oscillator. It points out the relation between the classical and incursive algorithms and shows the effect of incursion on the precision and stability. Tue, 20 Aug 2024 11:46:18 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2428 http://popups.lib.uliege.be/1373-5411/index.php?id=2433 Most of the existing models of intelligent software agents fail to consider an important aspect of human behavior, namely the impact of emotions on processes such as motivation, decision-making, planning, learning, and anticipation. The paper presents an emotional reasoning model of artificial agents, called Belief-Desire-Emotion( BDE). The model is built upon the influential Belief-Desire-Intention agent architecture and follows the Ortony-Clore-Collin's cognitive appraisal theory of human beings. We describe the different stages of the emotion generation process and emphasize how this process influence theoretical reasoning, such as belief and desire revision, and practical reasoning, such as means-end analysis. Additionally, we propose a set of basic emotions, and we exemplify how they are generated and the way they influence the behavior of our BDE agents. Tue, 20 Aug 2024 12:19:23 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2433 http://popups.lib.uliege.be/1373-5411/index.php?id=2439 Features of anticipation are compared in human and AI systems. In AI systems, a concept's semantic space is equal to, or smaller than, what is strictly defined by all occurrences of the concept within the system. While in a human cognitive system, the semantic space of a concept is always larger, more complex, divergent, and frizzy, than what has been theorized or formalized. A crucial superiority of a human anticipatory system(over the AI one) is to be able to view a crisis situation in its globality, according to values of the highest order. Specific matrixes of logic and knowledge are used by the mind for analyzing and understanding situations and experiences: the logfields. A metamodel, by interweaving different scientific logfields, may create a multidimensional cognitive space in which divergence and variety of worldviews enrich the collectivity. Tue, 20 Aug 2024 12:48:57 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2439 http://popups.lib.uliege.be/1373-5411/index.php?id=2443 Evolutionary analysis of functional organization of nerve systems and of behavior shows five informational control levels (reflexic L.; multireflexic coordination L.; regulative L.; perceptronic analyzing L.; Analysis-by-Synthesis L .) that represent specific procedures of the closed loop coding-decoding. Maybe weak anticipative prediction is realized at simple reflection and multireflexic coordination structures, incursive anticipative feedback control - at regulation and simple analyzers structures, and strong anticipation - at neocortex structures that work by Analysis-by-Synthesis. The strong anticipation maybe is used only in brains of mammals and birds that are able to create models of future activities that means ability to think. Higher mammals especially apes and humans have sensory screens that enhance mental imaging in Area Striata zone. Tue, 20 Aug 2024 14:39:40 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2443 http://popups.lib.uliege.be/1373-5411/index.php?id=2449 The automatically organized cybernetic system is a dynamic system with a large number of elements (atoms molecules) where there occurs an automatic process influencing the reciprocal relations between elements and their functions so that the complex can evolve toward ever more organized states with a view to obtaining certain properties or to fulfilling an objective-function. The structure, functions and the entire cellular activity of an organism are determined by the biochemically codified genetic program in the nucleotides (genes) of dezoxyribonucleic acids (DNA) and ribonucleic acids (RNA). In Schrödinger's theoretical formulation, the electron is no longer conceived as a punctiform structure on a certain orbit, but it takes up a space. The electron forms a charge cloud with the nucleus in its center, this charge cloud or spatial charge is interpreted as a space where there is a certain likelihood of electron localization. The electron is a material wave connected with the nucleus by its electric charge. In this paper we give a dual interpretation by de Broglie (Schrödinger) waves to the genes and the genetic program of the organisms assimilated to cybernetic systems with automatic self-organization of the orbitals occupied by the electrons δ and π . Tue, 20 Aug 2024 15:02:11 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2449 http://popups.lib.uliege.be/1373-5411/index.php?id=2454 The notion of anticipatory reasoning-reacting systems, which is a kind of anticipatory systems proposed from information security engineering and software reliability engineering aspects, is first characterized. And then, qualitative requirements and functions of an anticipatory reasoning-reacting system are anaIyzed. Further more, based on these considerations, a formal description of such a system is given. At last, some research issues are briefly introduced. Tue, 20 Aug 2024 16:44:33 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2454 http://popups.lib.uliege.be/1373-5411/index.php?id=2488 Is cognition possible without a priori assumptions ? Many philosophers and physicists claim that a reference frame for the ordering of the measurements is needed, before cognition can start. Our objective is to reduce the a priori assumptions and to deduce a reference frame directly from empirical data with an Anticipation Principle: Put the measurements in such an order that the credibility of your forecasts will be maximised. The structure of space and time, obtained with this principle provides an explication for some phenomena of quantum mechanics Fri, 23 Aug 2024 15:45:19 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2488 http://popups.lib.uliege.be/1373-5411/index.php?id=2490 We first consider the information flow and processing that is involved in perception considering the requirements necessary to explain the passage of elementary mappings to object representation and cognitive characterization of representations. The relationships between procedural implicit cognitive processes, and on the other hand, linguistic declarative processes is discussed. A reference to Marcus's results is made, taking into account experimental data and theoretical proposals, involving concepts of Quantum Chemistry made by our group. Fri, 23 Aug 2024 16:01:17 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2490 http://popups.lib.uliege.be/1373-5411/index.php?id=2494 A model of dendritic computation based on active zones is first described and is used in a Quantum Chemisty model for purely cognitive or else cognitive-affective or cognitive-motor psychophysiological processes Fri, 23 Aug 2024 16:21:47 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2494 http://popups.lib.uliege.be/1373-5411/index.php?id=2500 In this paper we try to resolve the problem of decision of the optimal therapy when the diagnosis is known. In papers [2], [3], [4], [9],[10], [11] the mentioned problem was treated by methods of fuzzy sets theory. Fuzzy sets were considered there as mappings from a set to [0,1] real interval. Here this problem has been considered using fuzzy sets from a more general point of view, as mappings whose co-domain is a special lattice valued monoid. The model developed in this paper is an improvement of the one given in [5]. In the same time it is an anticipatory model since it predicts efficiency of all possible drugs to the disease in question and it suggests the optimal therapy for every patient. Fri, 23 Aug 2024 16:43:46 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2500 http://popups.lib.uliege.be/1373-5411/index.php?id=2506 A practical anticipatory system with requirements of high reliability and high security must be able to perform any anticipatory reasoning to get enough effective conclusions anticipatorily within an acceptable time in order to satisfy the requirements from applications. This is a contradictory requirement since the execution time of anticipatory reasoning gets longer in proportion to the amount increasement of deduced conclusions. We are developing a forward deduction system for general-purposè entailment calculus, named EnCal. Although EnCal is a forward deduction engine for general-purpose entailment calculus, we expect that it can serve as the forward deduction engine in an anticipatory system to perform anticipatory reasoning based on temporal relevant logics. The key issue to achieve this goal is the efficiency of EnCal. This paper presents results and their implications of our experiences on improving the efficiency of EnCal by parallel processing techniques. Thu, 29 Aug 2024 11:00:11 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2506 http://popups.lib.uliege.be/1373-5411/index.php?id=2511 The brain model is defined as a phenomenal computing consisting of explicit computing subsystem and its environment carrying the execution of computation. By introducing the modified infomorphism (Barwise & Seligman, 1997) as an operator between sub-systems, a model of phenomenal computing is expressed as a weak paradox. Such a model can explain genesis of module in a brain and duality of conscious explicit cognition and subconscious implicit perception in an abstract sense. Thu, 29 Aug 2024 11:19:44 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2511 http://popups.lib.uliege.be/1373-5411/index.php?id=2605 This paper describes an approach to generate a sequence requiring an unrealizable function by programs, such as a flash that is required especially in creative activity of a human. We have already proposed a recurrent neural network that demonstrates a generation of several creative sequences, but convergency and stability problems occur. On the other hand, it is known in biological experiments where the chaotic sequences can be observed from brain waves. The neural network constructed from chaotic neurons has nonlinear dynamics, but there remains the difficulty of training method. We propose an evolutional methodology to train a chaotic neural network, and introduce Darwinism for its evolving process. To determine their most suitable structure and the weights of connection, we use AIC for the fitness value. Thu, 29 Aug 2024 15:07:30 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2605 http://popups.lib.uliege.be/1373-5411/index.php?id=2622 The ability to anticipate future states is a key adaptive property of living systems (Glenberg, 1997). Robert Rosen (1985) suggested that an anticipatory system is characterized by finality, and "is a system containing a predictive model of itself and/or of its environment, which allows it to change state at an instant in accord with the model's predictions pertaining to a later instant". Daniel Dubois (Dubois & Resconi, 1992; Dubois, 1998a, 2000) defined the concept of incursive and hyperincursive anticipatory systems, able to generate respectively one or several anticipations influencing the computing of the next state of the system. In this article, the concept of autoincursion is proposed as the ability for a system to compute its successive internal states as a function of its past, present and anticipated states, to select among several anticipated states, and to autonomously change its own equation parameters by learning. Some fundamental properties of a neural network architecture and dynamics are proposed to define Autolncursive Memory Networks. AIM Networks can learn and activate multiple attractors simultaneously, exhibiting synergic dynamics of attractors encoding external inputs. This allows them (l) to compute their successive states as a function of past, present, and multiple anticipated states, (2) to change the way they compute their successive states through symmetric or asymmetric modification of the synaptic structure during autonomous leaming, and (3) to select sequences of anticipations oriented toward learned goals. Thu, 29 Aug 2024 15:16:38 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2622 http://popups.lib.uliege.be/1373-5411/index.php?id=2649 The methods of ordinary least-squares regression (OLSR), fuzzy regression (FR), and adaptive network fuzzy inference system (ANFIS) are compared in inferring operating rules for a reservoir operations problem. Dynamic programming (DP) is used as an optimization tool to provide the input-output data set to be used by OLSR, FR, and ANFIS models. The OLSR. FR. and ANFIS based rules are then simulated and compared. The methods are applied to a long-term planning problem as well as to a medium-term implicit stochastic optimization model. The results indicate that FR is useful to derive operating rules for a long-term planning model, where imperfect and partial information is available. ANFIS is beneficial in medium term optimization as it is able to extract important features of the system from the generated input-output set. Thu, 29 Aug 2024 16:07:06 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2649 http://popups.lib.uliege.be/1373-5411/index.php?id=2664 We show that projectors proposed in the framework of Quantum Signal Processing can be implemented as Hamiltonian Neural Network based orthogonal filters. Moreover, such filters can be used as Universal Signal Processors. The structures of such processors rely on a family of Hurwitz-Radon matrices. To illustrate, we propose a procedure of nonlinear mapping synthesis. The problem of anticipation is reformulated as a problem of supervised learning. Thu, 29 Aug 2024 16:15:04 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2664 http://popups.lib.uliege.be/1373-5411/index.php?id=2669 The use of games as testbeds for research projects in the Artificial Intelligence (AI) field is a tradition. Some classic board and card games such as Go, Chess and Checkers were and are extensively used. However, AI researchers are beginning to explore the use of real-time interactive computer games in their research, making this an interesting field to experiment and explore. This paper presents the SCORE project (Simulator for COgnitive agent's behavioR), where we use a Belief-Desire-Intention (BDI) agent specification formalism called X-BDI, applied to a game environment called, Unreal Toumament (UT). This paper also presents some aspects regarding AI and agent technology applied to interactive computer games, with emphasis in the application of cognitive agent modelling applied to game characters Thu, 29 Aug 2024 16:44:27 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2669 http://popups.lib.uliege.be/1373-5411/index.php?id=2678 In graph-based systems there are many methods to compose (possibly different) graphs. However, none of these usual compositions are adequate to naturally express semantics of systems with dynamic topology, i.e., systems whose topology admits successive transformations through its computation. We constructed a categorical semantic domain for graph based systems with dynamic topology using a new way to compose edges of (possible different) graphs. ln this context, sequences of different graphs represent successive transformations of system topology during its computation and the edges composition between those graphs, the semantics of the corresponding dynamic system. Then we show how the proposed approach can be used to give semantics to concurrent anticipatory systems. Fri, 30 Aug 2024 10:23:17 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2678 http://popups.lib.uliege.be/1373-5411/index.php?id=2686 The authors implemented simulation models of anticipatory systems and a translator that converts models of conventional (non-anticipatory) systems into those of anticipatory systems in the weak sense. The systematic algorithmization leads the authors to recognizing some formal properties that could be viewed in a rather natural way for the anticipatory systems in the weak sense and that could be automatically converted into simulation models implemented on computer. The formal properties, i.e. certain concepts of system analysis and their professional names are presented in this paper. Fri, 30 Aug 2024 10:43:52 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2686 http://popups.lib.uliege.be/1373-5411/index.php?id=2689 When designing information systems, it would be good to be able to compare alternatives. However, information systems are complex phenomena as they encompass the humans involved in distributing the information. One possible way of making comparisons would be through simulation. Having constructed a prototype for such a simulation we have seen that the traditional approaches, such as Cellular Automata utilized within the social simulations field are usable but not sufficient. However, the newer agent-based approaches show more promise. We conclude that in order to make simulations of our kind possible, the new technologies, such as multi-agant systems, need be adapted and extended. One of the pieces missing is an agent-based infrastructure building on anticipatory principles for agent information behavior. Fri, 30 Aug 2024 11:09:22 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2689 http://popups.lib.uliege.be/1373-5411/index.php?id=2696 In this paper the problem of discrete systems goal-directed behavior generating is considered. The finite-state machine represents a model of a discrete system. The problem of goal-directed behavior generating is solved by the theory of the universal finite-state machine. The class of finite-state machine simulated by a family of the polynomials is described. The using of this "numerical" model of behavior of finite state machine allows to apply the algebraic methods to solve the problem of goal directed behavior generating. For the described class analysis and synthesis problems of universal enumerator are solved. Fri, 30 Aug 2024 11:15:47 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2696 http://popups.lib.uliege.be/1373-5411/index.php?id=2703 The subclass method is one of pattern classification methods proposed by Kudo et al. (1989), which is based on the approximation of each class region by a set of axis-parallel hyper-rectangles. This study improved it using an adaptive resampling technique known as boost'ing. Boosting is a well known ensemble learning method as an effective tool for improving the classification performance. Regarding the subclass method as a method for controlling the performance of resultant classifier, we could investigate 1) how the performance of a base classifier effects the classification results by boosting, and 2) how much boosting can improve the results compared with the original subclass method. Moreover, we also investigated the result using bagging which is an another popular ensemble technique Fri, 30 Aug 2024 11:44:34 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2703 http://popups.lib.uliege.be/1373-5411/index.php?id=2713 In this paper, we deal with the parameter dependency for the limit figures and the sufficient number of iterations in drawing the limit figures of quadratic transformations. The structure of the limit figures depends on the coefficients of the transformation, and has turned out to be complicated. Using the property that the limit figures are one-way functions, Da-te (2001) proposed an authentication algorithm. For the purpose of verification of the securities in the authentication algorithm, we show the experimental results for some properties of the limit figures. Fri, 30 Aug 2024 11:54:24 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2713 http://popups.lib.uliege.be/1373-5411/index.php?id=2423 Tue, 20 Aug 2024 11:20:22 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2423