http://popups.lib.uliege.be/1373-5411/index.php?id=79 Full text issues fr Mon, 13 May 2024 16:27:38 +0200 Tue, 18 Jun 2024 13:43:13 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=79 0 http://popups.lib.uliege.be/1373-5411/index.php?id=124 As the subject of anticipation claims its legitimate place in current scientific and technological inquiry, researchers from various disciplines (e.g.. computation, artificial intelligence, biology, logic. art theory) make headway in a territory of unusual aspects of knowledge and epistemology. Under the heading anticipation, we encounter subjects such as preventive caching, robotics, advanced research in biology (defining the living) and medicine (especially genetically transmitted disease), along with fascinating studies in art (music. in particular). These make up a broad variety of fundamental and applied research focused on a controversial concept. Inspired by none other than Einstein – he referred to spooky actions at distance, i.e., what became known as quantum nonlocality – the title of the paper is meant to submit my hypothesis that such processes are related to quantum non-locality. The second goal of this paper is to offer a cognitive framework – based on my early work on mind processes (1988) – within which the variety of anticipatory horizons invoked today finds a grounding that is both scientifically relevant and epistemologically coherent. The third goal of this paper is to identify the broad conceptual categories under which we can identify progress made so far and possible directions to follow. The fourth and final goal is to submit a co-relation view of anticipation and to integrate the inclusive recursion in a logic of relations that handles co-relations. Tue, 18 Jun 2024 15:41:53 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=124 http://popups.lib.uliege.be/1373-5411/index.php?id=132 Inconsistency is a natural phenomenona rising from the description of the real world. This phenomenon may be encountered in several situations. Nevertheless, human beings are capable of reasoning adequately. The automation of such reasoning requires the development of formal theories. Paraconsistent Logic provides tools to reason about inconsistencies. Though inconsistency is an increasingly common phenomenon in programming environments it cannot be handled, at least directly, by Classical logic, on which most of the current logic programming languages are based. Thus, one has to resort to altematives to classical logic ; it is therefore necessary to search for progtamming langages based on such alternatives. Paraconsistent logic, despite having been initially developed from the purely theoretical standpoint, found in recent years extremely fertile applications in Computer Science, thus solving the problem of justifying such logic systems from the practical standpoint. This work proposes a variation of the logic programming langage Prolog that allows inconsistency to be handled directly. The proposed langage was dubbed Paralog. Tue, 18 Jun 2024 16:09:18 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=132 http://popups.lib.uliege.be/1373-5411/index.php?id=141 A lot of research for anticipatory systems have been reported, where the chaotic equation including the hyper incursion equation plays an important role. The neural network model is also included in such a category and will continue to be discussed. From the viewpoint of computer systems, however, we have proposed a hybrid system architecture mixed with neural network and artificial intelligence, where the two-level structure is introduced ; the first layer : a neural network, and the second layer : an automaton system. On the two-layered system, the automaton part is dominant for anticipation, because the state transition is made by an automaton behavior although the selection among transitions is made by a neural network. In this paper, we discuss an automaton-based anticipation, since it is appropriate to discuss anticipation together with learnability. Tue, 18 Jun 2024 16:19:12 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=141 http://popups.lib.uliege.be/1373-5411/index.php?id=149 A categorial framework for structured graph based systems with or without distinguished nodes or labeling on both arcs and nodes is proposed. Requirements for the existence of limits and colimits in the resulting categories are set. In this context, unrestricted and bicomplete categories of graph based systems such as Petri Nets, Labeled Transition Systems, Nonsequential Automata, etc., are easily defined. Then it is shown how limits and colimits can be interpreted as structuring and anticipatory properties of systems. The proposed framework called duo-internalization generalizes the notion of intemal graphs allowing that nodes and arc may be objects from different categories. The results about limits and colimits of (reflexive) duo-intemal (labeled) graphs (with distinguished nodes) are, for our knowledge, new. Tue, 18 Jun 2024 16:30:02 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=149 http://popups.lib.uliege.be/1373-5411/index.php?id=156 This paper shows that different algorithmic methods can generate self-symmetrical Sierpinski fractals. A first category deals with a hyperincursive generator based on a composition rule applied to a defined path in the frame. A second category of algorithms is based on a recursive generator obeying certain symmetries. This paper will consider generalised Sierpinski fractals generated by modulo 2 and modulo 3. Even and odd modulo give rise to very different properties of symmetry. Tue, 18 Jun 2024 16:40:48 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=156 http://popups.lib.uliege.be/1373-5411/index.php?id=164 A new formal model of parallel computations - the Kirdin kinetic machine – is suggested. It is expected that this model will play the role for parallel computations similar to Markov normal algorithms, Kolmogorov and Turing machine or Post schemes for sequential computations. The basic ways in which computations are realized are described ; correctness of the elementary programs for the Kirdin kinetic machine is investigated. It is proved that the determined Kirdin kinetic machine is an effective calculator. A simple application of the Kirdin kinetic machine - heap encoding – is suggested. Subprograms similar to usual programming enlarge the Kirdin kinetic machine. Tue, 18 Jun 2024 16:47:00 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=164 http://popups.lib.uliege.be/1373-5411/index.php?id=170 The scientific concepts, notions and assertions are presented nowadays in an entropic and redundant manner which makes it difficult both their learning and their comprehension for the human brain, as well as impossible to be implemented in the Intelligent Systems, respectively in Artificial Intelligence. In the dialectic logic this theory is completed, extending the axiom system by raising the true non-demonstrable proposition to the rank of an axiom and adding it to the other axioms. The change of axioms in an axiom system alters the meaning of predicates and the relations on the theory, the new theory becoming a metatheory in which a new true non-demonstrable proposition can be formulated. Thus, it is possible to develop a sequence of methateories each representing a relative truth possible to replace by a larger relative truth situated on a higher step. The analysis of the dynamics of this type of propositions facilitates the elaboration of the basis of universal knowledge similar to human brain and creates the possibility of developing the general science, meant to comprise the principles of scientific thinking of all sciences, named by Leibniz « Scientiag eneralis ». In the paper, the knowledge basis is considered n-dimensional topological space, on which geometry can be defined and within it the concepts of open set and contact neighbourhood, frontier,continuity and topological transformation are operand. The metric space of the knowledge basis should not be limited only to the level of forms detected in the real space but to that of notions. The information stored in the knowledge basis must by organised in sets or classes ; the totality of classes forms the knowledge basis or the reference structure of intelligent systems. The paper establishes the relational – propertational – objectual trimatricial generalised model of the knowledgde domain organised in bodies of concepts and sets of assertions. Being integrated into the methodological strategy structuralism, the paper introduces the concepts of synchronic and diachronic relations underlying interferences and syllogisms in order to explicit the definibility and deductibility connections between the concepts and assertions of theories. Tue, 18 Jun 2024 17:13:10 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=170 http://popups.lib.uliege.be/1373-5411/index.php?id=175 The purpose of this paper is to consider a number of conceptual and linguistic issues associated with the nature and occurrence of collection concepts in the biological sciences. Collections are very common in biology and may be conflated with the idea of a system. The relations between collections (in the linguistic/psychological sense) and systemic metaphors in the biosciences will be examined. Two important systemic constructs that are relevant to both collections and systems are verbs and 'glue'. Examination of certain aspects of these ideas leads to a consideration of potentially valuable insights into the construction of descriptive biosystemic concepts using the source metaphor of category theory. Wed, 19 Jun 2024 11:00:17 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=175 http://popups.lib.uliege.be/1373-5411/index.php?id=182 Dissipative flows model a large variety of physical systems. In this paper the evolution of such systems is interpreted as a process of computation ; the attractor of the dynamics represents the output. A framework for an algorithmic analysis of dissipative flows is presented, enabling the comparison of the performance of discrete and continuous time analog computation models. A simple algorithm for finding the maximum of n numbers is analyzed, and shown to be highly efficient. The notion of tractable (polynomial) computation in the Turing model is conjectured to correspond to computation with tractable (analytically solvable) dynamical systems having polynomial complexity. Wed, 19 Jun 2024 11:05:20 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=182 http://popups.lib.uliege.be/1373-5411/index.php?id=189 We consider the problem of discovering patterns from a given logic that are significant (i.e. interesting and sufficiently valid) with respect to a given data set. We first define two types of patterns that extend the notions of query and clause, and we propose new measures of interest and confidence. In this framework, we establish connections between our measures, first-order logic and logics of probability of Halpern. Then, we present mining algorithms based on the generic levelwise search method proposed by Mannila, and discuss implementation issues in a relational database environment. Finally, we offer concluding remarks and suggestions for future research. Wed, 19 Jun 2024 11:12:43 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=189 http://popups.lib.uliege.be/1373-5411/index.php?id=198 This paper deals with computational aspects of creative design. A new approach to structural design representations in the framework of graph transformations is discussed. The representations are generated and modified by graph operations. Graphs represent structures of designs. A new software tool which enables designers to transform the design specification into the graph design structure is proposed. Examples of designing gardens and floor layouts for one-storey houses illustrate the presented methodology. Wed, 19 Jun 2024 11:16:44 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=198 http://popups.lib.uliege.be/1373-5411/index.php?id=205 Meaning extraction from text documents is a form of information management. The approach suggested in this paper is based on Peirce's semiotic which, by virtue of its deeper foundation, provides us with an adequate modelling of the information content of langage. we exemplify the potential of the Peircean approach by extracting the meaning of a sample English text. Wed, 19 Jun 2024 11:22:31 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=205 http://popups.lib.uliege.be/1373-5411/index.php?id=215 An introduction to Mathematica software and what I wanted to explain with it prepares for a Marketing minded discussion. Six views of differences between electrons in ll0 chemical elements are generated with the author's generalized graycode functions. The problem of estimating total negotiated cost of an hypothetical global license for everyone on the planet is illustrated. Wed, 19 Jun 2024 11:32:18 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=215 http://popups.lib.uliege.be/1373-5411/index.php?id=222 It is shown that classical logic is too restricted for an understanding of many effects in modern physics. A more general logic, that distinguishes betwcen anticipatory and non anticipatory knowledge processing is introduced. The cognition procçss, that deduces from the measurements the physical laws with this logic, provides a unified view of quantum mechanics and relativity theory. Wed, 19 Jun 2024 11:38:41 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=222 http://popups.lib.uliege.be/1373-5411/index.php?id=229 This paper suggests a model of Distributed Discrete Object Environment(DDOE), for describing object-oriented computing and compares it to traditional structured automaton model. Wed, 19 Jun 2024 14:26:24 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=229 http://popups.lib.uliege.be/1373-5411/index.php?id=233 This paper aims at providing a brief overview of industrial control methods ; it takes into account the evolution arised in the last years, and attempts to point up some perspectives. At first it lists the different steps of the life cycle of the Automated Production Equipment, then expounds the need for several types of models, corresponding to different aspects of the control development, and shows the problems brought up by their obtention or their validation. It reviews some control methods, with special emphasis on their anticipatory aspects. It tries to make clear not only the main ideas, but also the operating conditions corresponding to each method. Wed, 19 Jun 2024 14:44:35 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=233 http://popups.lib.uliege.be/1373-5411/index.php?id=238 From the analogy between the well known structures of the phasors and quaternions, it is shown that the topological configurations improve the operational storage of recorded Information and Signs as well as the chains of Tasks and Actions. From the "Discrete Fourier Transformation" and the deduced "DiscreteWavelet Transformation", we can underline the strategical role of the "Phasors" and the "Quaternions" in the detection and in the storage of every signal. From these dynamical processes it is possible to use similar modifications for configurating the "Memory or Knowledges Spaces" to reach a common convivial performative presentation. Besides we point out the high frequent use of circular topologies in our behaviours : since the automations procedures with their adjusting loops, the "Time Sharing" working of computers and the management of sendings and receptions of messages and alike the handling of simultaneous tasks, for reaching the present insertion of the "roundabouts" in our vehicles traffic. Specific advantages of these circular configurations are pointed out. Due to the fact that the phasors, which are rotating complex planes, are well adapted for an easy description of the rotations, they are performative tools, for treating every circular distributions (for recording and retrieval of "Info"). We have to remind these ones when we need the elaboration of operational planifications as well as for the forecasting of rational behaviours and actions. Indeed the rotations are the most simple periodic movements whose orthogonal projections tranlate the sinusoidal and cosinusoidal vibrations and conseqently they constitute the basic useful referentials for analyzing every periodic evolution. By observing our whole surrounding we obviously state that everything has a limited variation and conseguently cyclically behaves ;what is logically unmissing because we must live, think and work during and along linite domains. From these previous considerations we have to deduce that every recorded phenomenon can always be described and explained like a periodic one or for the least as a "periodisable or pseudoperiodic" one (without any repetition) and so they may be all considered as circular isomorphic dynamics. Besides these angular allocations allow to reach a high grade of perception for the dealt topics because they intrinsically dispose of a set of many various directions for graphically translating the infuences of the causal parameters. Wed, 19 Jun 2024 14:53:21 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=238 http://popups.lib.uliege.be/1373-5411/index.php?id=245 Dynamical behavior of any second-order linear system is described by a couple of stable and unstable attractors. The same attractors describe behavior of the linearized part of the piecewise-linear (PWL) systems. Using PWL analyses we examine each region separately. In paper there are considered stable and unstable trajectories and Poincare maps. Wed, 19 Jun 2024 15:01:07 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=245 http://popups.lib.uliege.be/1373-5411/index.php?id=253 The paper deals with examining of synchronized chaotic signals in canonical state models of piecewise-linear (PWL) systems [1]. The Pecora-Carroll drive-response concept and the inverse approach are considered [2]. The theory of the Pecora-Carroll drive-response concept is expanded in the way that the third-order canonical state models make up synchronizing subsystems and the second-order canonical state models make up synchronized subsystems. Wed, 19 Jun 2024 15:05:55 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=253 http://popups.lib.uliege.be/1373-5411/index.php?id=258 In this paper, the problem of determining the optimal control law for discrete-time stochastic linear systems with respect to a quadratic performance criterion is considered. It is assumed that the system is subject to additive system noise and that the state variables are measured with additive measurement noise, without specifying the specific characteristics of random variables. It is shown that the problem of stochastic optimal control can be reduced to two independent problems, one of equivalent deterministic optimal control and the other of stochastic estimation of underlying uncertainties. This holds even if the system noise, the measurement noise and/or the initial state of the system are non-Gaussian, mutually and time-wise dependent. The aim of the present paper is to show how the invariant embedding technique and fiducial approach may be used to solve the problem of adaptive cautious controlling a discrete-time stochastic linear system in which the state transition matrix and the control driven matrix are unknown. This is the case when the certainty equivalence principle does not yield the admissible adaptive control laws for the present problem. The proposed approach does not require the arbitrary selection of priors as in the Bayesian approach. It makes it possible to simplify the problem of adaptive optimization of stochastic systems and, if the system noise and/or the measurement noise are Gaussian, to carry out the algorithm in closed form. The examples are given to illustate the suggested methodology. Wed, 19 Jun 2024 15:17:36 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=258 http://popups.lib.uliege.be/1373-5411/index.php?id=264 In this paper we refer about the first results of a research, recently started, on the influence of the transmission elasticity on the law of motion of the end effector of an industrial robot. Aim of this investigation is to asses if by an appropriate choise of the law of motion it is possible to obtain an end effector motion that is precise enough, even if the transmission is not very stiff. The first results of a number of computer simulation show that the law of motion chosen can affect, aslo significantly, the movement precision of a manipulator arm in which the transmission can no more been considered as « rigid ». Wed, 19 Jun 2024 15:22:27 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=264 http://popups.lib.uliege.be/1373-5411/index.php?id=270 An image restoration is a typically ill-posed problem. Generally, regulalization scheme is used to avoid this problem. As a regularization operator, classical methods adopt one which may produce a too much smooth image. Parametric Projection Filter which has an ability to deal with colored observation noise is one of them. On the other hand, some methods based on a spatially adaptive regularization are proposed and successful in obtaining not so smooth one. However, it is assumed that observation noise is white, and the fidelity of images is not evaluated in the space of original images in these methods. In this paper, we propose a new restoration method by which we can evaluate the fidelity of images in the space of original images and obtain not so smooth one. We also verify the efficacy of the method by some numerical experiments. Wed, 19 Jun 2024 15:29:56 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=270 http://popups.lib.uliege.be/1373-5411/index.php?id=278 This paper studies a robotic cell for automatic inspection of precise cylindrical parts. The cell is considered as a complex object. The analysis and modeling of functions of the cell are performed from a system point of view. Conceptual functional-purposeful information, including general-system and subsystem functions and goals are defined. A system graph-model and a formal mathematical model of the cell are proposed. Wed, 19 Jun 2024 15:34:59 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=278 http://popups.lib.uliege.be/1373-5411/index.php?id=122 Tue, 18 Jun 2024 15:32:47 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=122