Does Meaning Evolove?

A common method of improving how well understood a theory is, is by comparing it to another theory which has been better developed. Radical interpretation is a theory which attempts to explain how communication has meaning. Radical interpretation is treated as another time dependent theory and compared to the time dependent theory of biological evolution. Several similarities and differences are uncovered. Biological evolution can be gradual or punctuated. Whether radical interpretation is gradual or punctuated depends on how the question is framed: on the coarse-grained time scale it proceeds gradually, but on the fine-grained time scale it proceeds by punctuated equilibria. Biological evolution proceeds by natural selection, the counterpart to this is the increase in both correspondence and coherence. Exaption, mutations, and spandrels have counterparts metaphor, speech errors, and puns respectively. Homologous and analogs have direct counterparts in specific words. The most important differences originate from the existence of a unit of inheritance (the traditional gene) occurring in biological evolution - there is no such unit in language

Does Meaning Evolve?

A common method of making a theory more understandable, is by comparing it to another theory which has been better developed. Radical interpretation is a theory which attempts to explain how communication has meaning. Radical interpretation is treated as another time-dependent theory and compared to the time dependent theory of biological evolution. The main reason for doing this is to find the nature of the time dependence; producing analogs between the two theories is a necessary prerequisite to this and brings up many problems. Once the nature of the time dependence is better known it might allow the underlying mechanism to be uncovered. Several similarities and differences are uncovered, there appear to be more differences than similarities.Comment: title changed, completely rewritten, new version 37 pages previous version 28 pages, to appear in Behaviour and Philosoph

Evaluating Conversational Recommender Systems via User Simulation

Conversational information access is an emerging research area. Currently, human evaluation is used for end-to-end system evaluation, which is both very time and resource intensive at scale, and thus becomes a bottleneck of progress. As an alternative, we propose automated evaluation by means of simulating users. Our user simulator aims to generate responses that a real human would give by considering both individual preferences and the general flow of interaction with the system. We evaluate our simulation approach on an item recommendation task by comparing three existing conversational recommender systems. We show that preference modeling and task-specific interaction models both contribute to more realistic simulations, and can help achieve high correlation between automatic evaluation measures and manual human assessments.Comment: Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '20), 202

Conceptualizing Governance Decision Making: A Theoretical Model of Mental Processes Derived Through Abduction

The field of Public Policy and Administration is heavily influenced by the decisions individuals make regarding matters of governance. These types of decisions can affect a broad scope of government-related activities ranging from esoteric debates about political ideology to policy development to specific ways in which people directly interact with public services. Unfortunately, in the view of this research, there is no sufficient model for conceptualizing governance decision making. This creates the focus of inquiry for this work, which is to examine how governance decisions are conceived of and formulated. The purpose of this research is then to analyze the governance decision making processes. This is achieved by examining the available research on decision making processes and then contrasting the widely applied rational approaches with the more applicable nonrational approaches for decision making. This review will indicate that a nonrational conceptualization based on schemas, heuristics, and a societal-level shared mental model may be more instrumental in analyzing governance decisions than rational conceptualizations. The unique but necessary methodological approach of abductive logic is used to develop a theoretical foundation for this new perspective. An application of abductive principles is used to create a framework that anchors governance decisions. The result of these efforts is a model that can serve as a tool for analysis of these important and influential decisions in governance

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field

A heuristic information retrieval study : an investigation of methods for enhanced searching of distributed data objects exploiting bidirectional relevance feedback

A thesis submitted for the degree of Doctor of Philosophy of the University of LutonThe primary aim of this research is to investigate methods of improving the effectiveness of current information retrieval systems. This aim can be achieved by accomplishing numerous supporting objectives. A foundational objective is to introduce a novel bidirectional, symmetrical fuzzy logic theory which may prove valuable to information retrieval, including internet searches of distributed data objects. A further objective is to design, implement and apply the novel theory to an experimental information retrieval system called ANACALYPSE, which automatically computes the relevance of a large number of unseen documents from expert relevance feedback on a small number of documents read. A further objective is to define a methodology used in this work as an experimental information retrieval framework consisting of multiple tables including various formulae which anow a plethora of syntheses of similarity functions, ternl weights, relative term frequencies, document weights, bidirectional relevance feedback and history adjusted term weights. The evaluation of bidirectional relevance feedback reveals a better correspondence between system ranking of documents and users' preferences than feedback free system ranking. The assessment of similarity functions reveals that the Cosine and Jaccard functions perform significantly better than the DotProduct and Overlap functions. The evaluation of history tracking of the documents visited from a root page reveals better system ranking of documents than tracking free information retrieval. The assessment of stemming reveals that system information retrieval performance remains unaffected, while stop word removal does not appear to be beneficial and can sometimes be harmful. The overall evaluation of the experimental information retrieval system in comparison to a leading edge commercial information retrieval system and also in comparison to the expert's golden standard of judged relevance according to established statistical correlation methods reveal enhanced system information retrieval effectiveness

Heuristics, Concepts, and Cognitive Architecture: Toward Understanding How The Mind Works

Heuristics are often invoked in the philosophical, psychological, and cognitive science literatures to describe or explain methodological techniques or shortcut mental operations that help in inference, decision-making, and problem-solving. Yet there has been surprisingly little philosophical work done on the nature of heuristics and heuristic reasoning, and a close inspection of the way(s) in which heuristic is used throughout the literature reveals a vagueness and uncertainty with respect to what heuristics are and their role in cognition. This dissertation seeks to remedy this situation by motivating philosophical inquiry into heuristics and heuristic reasoning, and then advancing a theory of how heuristics operate in cognition. I develop a positive working characterization of heuristics that is coherent and robust enough to account for a broad range of phenomena in reasoning and inference, and makes sense of empirical data in a systematic way. I then illustrate the work this characterization does by considering the sorts of problems that many philosophers believe heuristics solve, namely those resulting from the so-called frame problem. Considering the frame problem motivates the need to gain a better understanding of how heuristics work and the cognitive structures over which they operate. I develop a general theory of cognition which I argue underwrites the heuristic operations that concern this dissertation. I argue that heuristics operate over highly organized systems of knowledge, and I offer a cognitive architecture to accommodate this view. I then provide an account of the systems of knowledge that heuristics are supposed to operate over, in which I suggest that such systems of knowledge are concepts. The upshot, then, is that heuristics operate over concepts. I argue, however, that heuristics do not operate over conceptual content, but over metainformational relations between activated and primed concepts and their contents. Finally, to show that my thesis is empirically adequate, I consider empirical evidence on heuristic reasoning and argue that my account of heuristics explains the data

A comparative analysis of algorithms for satellite operations scheduling

Scheduling is employed in everyday life, ranging from meetings to manufacturing and operations among other activities. One instance of scheduling in a complex real-life setting is space mission operations scheduling, i.e. instructing a satellite to perform fitting tasks during predefined time periods with a varied frequency to achieve its mission goals. Mission operations scheduling is pivotal to the success of any space mission, choreographing every task carefully, accounting for technological and environmental limitations and constraints along with mission goals.;It remains standard practice to this day, to generate operations schedules manually ,i.e. to collect requirements from individual stakeholders, collate them into a timeline, compare against feasibility and available satellite resources, and find potential conflicts. Conflict resolution is done by hand, checked by a simulator and uplinked to the satellite weekly. This process is time consuming, bears risks and can be considered sub-optimal.;A pertinent question arises: can we automate the process of satellite mission operations scheduling? And if we can, what method should be used to generate the schedules? In an attempt to address this question, a comparison of algorithms was deemed suitable in order to explore their suitability for this particular application.;The problem of mission operations scheduling was initially studied through literature and numerous interviews with experts. A framework was developed to approximate a generic Low Earth Orbit satellite, its environment and its mission requirements. Optimisation algorithms were chosen from different categories such as single-point stochastic without memory (Simulated Annealing, Random Search), multi-point stochastic with memory (Genetic Algorithm, Ant Colony System, Differential Evolution) and were run both with and without Local Search.;The aforementioned algorithmic set was initially tuned using a single 89-minute Low Earth Orbit of a scientific mission to Mars. It was then applied to scheduling operations during one high altitude Low Earth Orbit (2.4hrs) of an experimental mission.;It was then applied to a realistic test-case inspired by the European Space Agency PROBA-2 mission, comprising a 1 day schedule and subsequently a 7 day schedule - equal to a Short Term Plan as defined by the European Space Agency.;The schedule fitness - corresponding to the Hamming distance between mission requirements and generated schedule - are presented along with the execution time of each run. Algorithmic performance is discussed and put at the disposal of mission operations experts for consideration.Scheduling is employed in everyday life, ranging from meetings to manufacturing and operations among other activities. One instance of scheduling in a complex real-life setting is space mission operations scheduling, i.e. instructing a satellite to perform fitting tasks during predefined time periods with a varied frequency to achieve its mission goals. Mission operations scheduling is pivotal to the success of any space mission, choreographing every task carefully, accounting for technological and environmental limitations and constraints along with mission goals.;It remains standard practice to this day, to generate operations schedules manually ,i.e. to collect requirements from individual stakeholders, collate them into a timeline, compare against feasibility and available satellite resources, and find potential conflicts. Conflict resolution is done by hand, checked by a simulator and uplinked to the satellite weekly. This process is time consuming, bears risks and can be considered sub-optimal.;A pertinent question arises: can we automate the process of satellite mission operations scheduling? And if we can, what method should be used to generate the schedules? In an attempt to address this question, a comparison of algorithms was deemed suitable in order to explore their suitability for this particular application.;The problem of mission operations scheduling was initially studied through literature and numerous interviews with experts. A framework was developed to approximate a generic Low Earth Orbit satellite, its environment and its mission requirements. Optimisation algorithms were chosen from different categories such as single-point stochastic without memory (Simulated Annealing, Random Search), multi-point stochastic with memory (Genetic Algorithm, Ant Colony System, Differential Evolution) and were run both with and without Local Search.;The aforementioned algorithmic set was initially tuned using a single 89-minute Low Earth Orbit of a scientific mission to Mars. It was then applied to scheduling operations during one high altitude Low Earth Orbit (2.4hrs) of an experimental mission.;It was then applied to a realistic test-case inspired by the European Space Agency PROBA-2 mission, comprising a 1 day schedule and subsequently a 7 day schedule - equal to a Short Term Plan as defined by the European Space Agency.;The schedule fitness - corresponding to the Hamming distance between mission requirements and generated schedule - are presented along with the execution time of each run. Algorithmic performance is discussed and put at the disposal of mission operations experts for consideration

Improving Model-Based Software Synthesis: A Focus on Mathematical Structures

Computer hardware keeps increasing in complexity. Software design needs to keep up with this. The right models and abstractions empower developers to leverage the novelties of modern hardware. This thesis deals primarily with Models of Computation, as a basis for software design, in a family of methods called software synthesis. We focus on Kahn Process Networks and dataflow applications as abstractions, both for programming and for deriving an efficient execution on heterogeneous multicores. The latter we accomplish by exploring the design space of possible mappings of computation and data to hardware resources. Mapping algorithms are not at the center of this thesis, however. Instead, we examine the mathematical structure of the mapping space, leveraging its inherent symmetries or geometric properties to improve mapping methods in general. This thesis thoroughly explores the process of model-based design, aiming to go beyond the more established software synthesis on dataflow applications. We starting with the problem of assessing these methods through benchmarking, and go on to formally examine the general goals of benchmarks. In this context, we also consider the role modern machine learning methods play in benchmarking. We explore different established semantics, stretching the limits of Kahn Process Networks. We also discuss novel models, like Reactors, which are designed to be a deterministic, adaptive model with time as a first-class citizen. By investigating abstractions and transformations in the Ohua language for implicit dataflow programming, we also focus on programmability. The focus of the thesis is in the models and methods, but we evaluate them in diverse use-cases, generally centered around Cyber-Physical Systems. These include the 5G telecommunication standard, automotive and signal processing domains. We even go beyond embedded systems and discuss use-cases in GPU programming and microservice-based architectures

An Intelligent Expert System for Decision Analysis and Support in Multi-Attribute Layout Optimization

Layout Decision Analysis and Design is a ubiquitous problem in a variety of work domains that is important from both strategic and operational perspectives. It is largely a complex, vague, difficult, and ill-structured problem that requires intelligent and sophisticated decision analysis and design support. Inadequate information availability, combinatorial complexity, subjective and uncertain preferences, and cognitive biases of decision makers often hamper the procurement of a superior layout configuration. Consequently, it is desirable to develop an intelligent decision support system for layout design that could deal with such challenging issues by providing efficient and effective means of generating, analyzing, enumerating, ranking, and manipulating superior alternative layouts. We present a research framework and a functional prototype for an interactive Intelligent System for Decision Support and Expert Analysis in Multi-Attribute Layout Optimization (IDEAL) based on soft computing tools. A fundamental issue in layout design is efficient production of superior alternatives through the incorporation of subjective and uncertain design preferences. Consequently, we have developed an efficient and Intelligent Layout Design Generator (ILG) using a generic two-dimensional bin-packing formulation that utilizes multiple preference weights furnished by a fuzzy Preference Inferencing Agent (PIA). The sub-cognitive, intuitive, multi-facet, and dynamic nature of design preferences indicates that an automated Preference Discovery Agent (PDA) could be an important component of such a system. A user-friendly, interactive, and effective User Interface is deemed critical for the success of the system. The effectiveness of the proposed solution paradigm and the implemented prototype is demonstrated through examples and cases. This research framework and prototype contribute to the field of layout decision analysis and design by enabling explicit representation of experts? knowledge, formal modeling of fuzzy user preferences, and swift generation and manipulation of superior layout alternatives. Such efforts are expected to afford efficient procurement of superior outcomes and to facilitate cognitive, ergonomic, and economic efficiency of layout designers as well as future research in related areas. Applications of this research are broad ranging including facilities layout design, VLSI circuit layout design, newspaper layout design, cutting and packing, adaptive user interfaces, dynamic memory allocation, multi-processor scheduling, metacomputing, etc