Fifty Years of Research on Self-Replication: An Overview

1998 ◽  
Vol 4 (3) ◽  
pp. 237-257 ◽  
Author(s):  
Moshe Sipper
Keyword(s):  
Cellular Automata ◽  
Computer Science ◽  
Real World ◽  
Computational Models ◽  
Computer Programs ◽  
Point Of View ◽  
New Materials ◽  
The Past ◽  
Real World Applications ◽  
Self Replication

The study of artificial self-replicating structures or machines has been taking place now for almost half a century. My goal in this article is to present an overview of research carried out in the domain of self-replication over the past 50 years, starting from von Neumann's work in the late 1940s and continuing to the most recent research efforts. I shall concentrate on computational models, that is, ones that have been studied from a computer science point of view, be it theoretical or experimental. The systems are divided into four major classes, according to the model on which they are based: cellular automata, computer programs, strings (or strands), or an altogether different approach. With the advent of new materials, such as synthetic molecules and nanomachines, it is quite possible that we shall see this somewhat theoretical domain of study producing practical, real-world applications.

Modeling and using context

1998 ◽  
Vol 13 (2) ◽  
pp. 185-194 ◽  
Author(s):  
PATRICK BRÉZILLON ◽  
MARCOS CAVALCANTI
Keyword(s):  
Artificial Intelligence ◽  
Problem Solving ◽  
Real World ◽  
Point Of View ◽  
Theoretical Level ◽  
The Past ◽  
System Building ◽  
Real World Applications ◽  
Different Types ◽  
Model Context

The first International and Interdisciplinary Conference on Modeling and Using Context (CONTEXT-97) was held at Rio de Janeiro, Brazil on February 4–6 1997. This article provides a summary of the presentations and discussions during the three days with a focus on context in applications. The notion of context is far from defined, and is dependent in its interpretation on a cognitive science versus an engineering (or system building) point of view. However, the conference makes it possible to identify new trends in the formalization of context at a theoretical level, as well as in the use of context in real-world applications. Results presented at the conference are ascribed in the realm of the works on context over the past few years at specific workshops and symposia. The diversity of the attendees' origins (artificial intelligence, linguistics, philosophy, psychology, etc.) demonstrates that there are different types of context, not a unique one. For instance, logicians model context at the level of the knowledge representation and the reasoning mechanisms, while cognitive scientists consider context at the level of the interaction between two agents (i.e. two humans or a human and a machine). In the latter case, there are now strong arguments proving that one can speak of context only in reference to its use (e.g. context of an item or of a problem solving exercise). Moreover, there are different types of context that are interdependent. This makes it possible to understand why, despite the consensus on some context aspects, agreement on the notion of context is not yet achieved.

Against generalisation: Data-driven decisions need context to be human-compatible

2021 ◽  
pp. 026638212110619
Author(s):  
Sharon Richardson
Keyword(s):  
Artificial Intelligence ◽  
Real World ◽  
Data Science ◽  
Machine Learning Algorithms ◽  
Data Driven ◽  
Theoretical Frameworks ◽  
The Past ◽  
Real World Applications ◽  
Contextual Framework ◽  
Data Driven Decisions

During the past two decades, there have been a number of breakthroughs in the fields of data science and artificial intelligence, made possible by advanced machine learning algorithms trained through access to massive volumes of data. However, their adoption and use in real-world applications remains a challenge. This paper posits that a key limitation in making AI applicable has been a failure to modernise the theoretical frameworks needed to evaluate and adopt outcomes. Such a need was anticipated with the arrival of the digital computer in the 1950s but has remained unrealised. This paper reviews how the field of data science emerged and led to rapid breakthroughs in algorithms underpinning research into artificial intelligence. It then discusses the contextual framework now needed to advance the use of AI in real-world decisions that impact human lives and livelihoods.

scholarly journals INDUSTRIAL APPLICATIONS OF ARTIFICIAL NEURAL NETWORKS

2014 ◽  
pp. 8-20
Author(s):  
Kurosh Madani
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Real World ◽  
Industrial Applications ◽  
Large Field ◽  
Nonlinear Functions ◽  
The Past ◽  
Real World Applications ◽  
Ann Models ◽  
Artificial Neural

In a large number of real world dilemmas and related applications the modeling of complex behavior is the central point. Over the past decades, new approaches based on Artificial Neural Networks (ANN) have been proposed to solve problems related to optimization, modeling, decision making, classification, data mining or nonlinear functions (behavior) approximation. Inspired from biological nervous systems and brain structure, Artificial Neural Networks could be seen as information processing systems, which allow elaboration of many original techniques covering a large field of applications. Among their most appealing properties, one can quote their learning and generalization capabilities. The main goal of this paper is to present, through some of main ANN models and based techniques, their real application capability in real world industrial dilemmas. Several examples through industrial and real world applications have been presented and discussed.

scholarly journals Sliding-Window Thompson Sampling for Non-Stationary Settings

2020 ◽  
Vol 68 ◽  
pp. 311-364
Author(s):  
Francesco Trovo ◽  
Stefano Paladino ◽  
Marcello Restelli ◽  
Nicola Gatti
Keyword(s):  
Real World ◽  
State Of The Art ◽  
Sliding Window ◽  
Upper Bounds ◽  
Decision Problems ◽  
Sequential Decision ◽  
Thompson Sampling ◽  
The Past ◽  
Real World Applications ◽  
Window Approach

Multi-Armed Bandit (MAB) techniques have been successfully applied to many classes of sequential decision problems in the past decades. However, non-stationary settings -- very common in real-world applications -- received little attention so far, and theoretical guarantees on the regret are known only for some frequentist algorithms. In this paper, we propose an algorithm, namely Sliding-Window Thompson Sampling (SW-TS), for nonstationary stochastic MAB settings. Our algorithm is based on Thompson Sampling and exploits a sliding-window approach to tackle, in a unified fashion, two different forms of non-stationarity studied separately so far: abruptly changing and smoothly changing. In the former, the reward distributions are constant during sequences of rounds, and their change may be arbitrary and happen at unknown rounds, while, in the latter, the reward distributions smoothly evolve over rounds according to unknown dynamics. Under mild assumptions, we provide regret upper bounds on the dynamic pseudo-regret of SW-TS for the abruptly changing environment, for the smoothly changing one, and for the setting in which both the non-stationarity forms are present. Furthermore, we empirically show that SW-TS dramatically outperforms state-of-the-art algorithms even when the forms of non-stationarity are taken separately, as previously studied in the literature.

Chapter 3. Complete Algorithms

2021 ◽  
Author(s):  
Adnan Darwiche ◽  
Knot Pipatsrisawat
Keyword(s):  
Real World ◽  
Theoretical Perspective ◽  
Point Of View ◽  
Sat Solving ◽  
Practical Point ◽  
Sat Solvers ◽  
Proof Systems ◽  
Real World Applications ◽  
Clause Learning

Complete SAT algorithms form an important part of the SAT literature. From a theoretical perspective, complete algorithms can be used as tools for studying the complexities of different proof systems. From a practical point of view, these algorithms form the basis for tackling SAT problems arising from real-world applications. The practicality of modern, complete SAT solvers undoubtedly contributes to the growing interest in the class of complete SAT algorithms. We review these algorithms in this chapter, including Davis-Putnum resolution, Stalmarck’s algorithm, symbolic SAT solving, the DPLL algorithm, and modern clause-learning SAT solvers. We also discuss the issue of certifying the answers of modern complete SAT solvers.

An Efficient Pruning and Filtering Strategy to Mine Partial Periodic Patterns from a Sequence of Event Sets

2014 ◽  
Vol 10 (2) ◽  
pp. 18-38 ◽  
Author(s):  
Kung-Jiuan Yang ◽  
Tzung-Pei Hong ◽  
Yuh-Min Chen ◽  
Guo-Cheng Lan
Keyword(s):  
Time Series ◽  
Real World ◽  
Oil Price ◽  
Time Stamp ◽  
Single Event ◽  
Periodic Patterns ◽  
Event Time ◽  
The Past ◽  
Real World Applications ◽  
Speed Up

Partial periodic patterns are commonly seen in real-world applications. The major problem of mining partial periodic patterns is the efficiency problem due to a huge set of partial periodic candidates. Although some efficient algorithms have been developed to tackle the problem, the performance of the algorithms significantly drops when the mining parameters are set low. In the past, the authors have adopted the projection-based approach to discover the partial periodic patterns from single-event time series. In this paper, the authors extend it to mine partial periodic patterns from a sequence of event sets which multiple events concurrently occur at the same time stamp. Besides, an efficient pruning and filtering strategy is also proposed to speed up the mining process. Finally, the experimental results on a synthetic dataset and real oil price dataset show the good performance of the proposed approach.

scholarly journals Integrated Outreach: Increasing Engagement in Computer Science and Cybersecurity

2020 ◽  
Vol 10 (12) ◽  
pp. 353
Author(s):  
Shaya Wolf ◽  
Andrea Carneal Burrows ◽  
Mike Borowczak ◽  
Mason Johnson ◽  
Rafer Cooley ◽  
...  
Keyword(s):  
Computer Science ◽  
Real World ◽  
Learning Experience ◽  
Low Cost ◽  
Outreach Programs ◽  
Integrated Stem ◽  
Hands On ◽  
Real World Applications ◽  
Before And After ◽  
Interest Level

Research on innovative, integrated outreach programs guided three separate week-long outreach camps held across two summers (2018 and 2019). These camps introduced computer science through real-world applications and hands-on activities, each dealing with cybersecurity principles. The camps utilized low-cost hardware and free software to provide a total of 84 students (aged 10 to 18 years) a unique learning experience. Based on feedback from the 2018 camp, a new pre/post survey was developed to assess changes in participant knowledge and interest. Student participants in the 2019 iteration showed drastic changes in their cybersecurity content recall (33% pre vs. 96% post), cybersecurity concept identification within real-world scenarios, and exhibited an increased ability to recognize potential cybersecurity threats in their every-day lives (22% pre vs. 69% post). Finally, students’ self-reported interest-level before and after the camp show a positive increase across all student participants, with the number of students who where highly interested in cybersecurity more than doubling from 31% pre-camp to 65% post-camp. Implications for educators are large as these activities and experiences can be interwoven into traditional schooling as well as less formal camps as pure computer science or through integrated STEM.

PROVIDING TIMELY UPDATED SEQUENTIAL PATTERNS IN DECISION MAKING

2010 ◽  
Vol 09 (06) ◽  
pp. 873-888 ◽  
Author(s):  
TZUNG-PEI HONG ◽  
CHING-YAO WANG ◽  
CHUN-WEI LIN
Keyword(s):  
Decision Making ◽  
Real Time ◽  
Real World ◽  
Experimental Results ◽  
Sequential Patterns ◽  
The Past ◽  
Large Databases ◽  
Real World Applications ◽  
Critical Task ◽  
Maintenance Process

Mining knowledge from large databases has become a critical task for organizations. Managers commonly use the obtained sequential patterns to make decisions. In the past, databases were usually assumed to be static. In real-world applications, however, transactions may be updated. In this paper, a maintenance algorithm for rapidly updating sequential patterns for real-time decision making is proposed. The proposed algorithm utilizes previously discovered large sequences in the maintenance process, thus greatly reducing the number of database rescans and improving performance. Experimental results verify the performance of the proposed approach. The proposed algorithm provides real-time knowledge that can be used for decision making.

ON SOME RECENT ADVANCES IN COMPLEX SOFTWARE NETWORKS: MODELING, ANALYSIS, EVOLUTION AND APPLICATIONS

2012 ◽  
Vol 22 (02) ◽  
pp. 1250024 ◽  
Author(s):  
HONGCHUN WANG ◽  
KEQING HE ◽  
BING LI ◽  
JINHU LÜ
Keyword(s):  
Complex Networks ◽  
Real World ◽  
Complex Adaptive Systems ◽  
Adaptive Systems ◽  
Point Of View ◽  
Future Research ◽  
Software Systems ◽  
Recent Advances ◽  
Modeling Analysis ◽  
Real World Applications

Complex software networks, as a typical kind of man-made complex networks, have attracted more and more attention from various fields of science and engineering over the past ten years. With the dramatic increase of scale and complexity of software systems, it is essential to develop a systematic approach to further investigate the complex software systems by using the theories and methods of complex networks and complex adaptive systems. This paper attempts to briefly review some recent advances in complex software networks and also develop some novel tools to further analyze complex software networks, including modeling, analysis, evolution, measurement, and some potential real-world applications. More precisely, this paper first describes some effective modeling approaches for characterizing various complex software systems. Based on the above theoretical and practical models, this paper introduces some recent advances in analyzing the static and dynamical behaviors of complex software networks. It is then followed by some further discussions on potential real-world applications of complex software networks. Finally, this paper outlooks some future research topics from an engineering point of view.

scholarly journals Predictive Model Evaluation for PHM

2020 ◽  
Vol 5 (2) ◽  
Author(s):  
Chunsheng Yang ◽  
Yanni Zou ◽  
Jie Liu ◽  
Kyle R Mulligan
Keyword(s):  
Machine Learning ◽  
Predictive Model ◽  
Real World ◽  
Predictive Models ◽  
Model Evaluation ◽  
High Performance ◽  
Point Of View ◽  
Machine Learning Techniques ◽  
Real World Applications ◽  
Prognostic Application

In the past decades, machine learning techniques or algorithms, particularly, classifiers have been widely applied to various real-world applications such as PHM. In developing high-performance classifiers, or machine learning-based models, i.e. predictive model for PHM, the predictive model evaluation remains a challenge. Generic methods such as accuracy may not fully meet the needs of models evaluation for prognostic applications. This paper addresses this issue from the point of view of PHM systems. Generic methods are first reviewed while outlining their limitations or deficiencies with respect to PHM. Then, two approaches developed for evaluating predictive models are presented with emphasis on specificities and requirements of PHM. A case of real prognostic application is studies to demonstrate the usefulness of two proposed methods for predictive model evaluation. We argue that predictive models for PHM must be evaluated not only using generic methods, but also domain-oriented approaches in order to deploy the models in real-world applications.

Sign in / Sign up

Export Citation Format

Share Document