scholarly journals Functional approach to the adaptation of languages instead of software systems

2007 ◽  
Vol 4 (2) ◽  
pp. 116-130 ◽  
Author(s):  
Ján Kollár ◽  
Jaroslav Porubän ◽  
Peter Václavík ◽  
Jana Bandáková ◽  
Michal Forgác

From the viewpoint of adaptability, we classify software systems as being nonreflexive, introspective and adaptive. Introducing a simple example of LL(1) languages for expressions, we present its nonreflexive and adaptive implementation using Haskell functional language. Multiple metalevel concepts are an essential demand for a systematic language approach, to build up adaptable software systems dynamically, i.e. to evolve them. A feedback reflection loop from data to code through metalevel data is the basic implementation requirement and the proposition for semi-automatic evolution of software systems. In this sense, practical experiment introduced in this paper is related to the base level of language, but it illustrates the ability for extensions primarily in horizontal but also in vertical direction of an adaptive system.

2010 ◽  
Vol 439-440 ◽  
pp. 343-348
Author(s):  
Kan Li ◽  
Zhan Qiong Ni

Distributed software systems often intertwine the handling of application functionalities with distribution related issues including location transparent access to services, workload allocation among different hosts, adaptation to changing conditions of the network. In the paper, a computational reflection based distributed query model is proposed. The model uses computational reflection to divide the distributed query system into two levels: the meta level and the base level. Meta objects that existed in the meta level are responsible for control and description of the base level, hence the state change of the base level could be captured by the meta level and be controlled according to the meta level’s reaction. The advantages of the model are that adapt different changes such as data resources in the network, network conditions, query plan, and provide the capability of fault tolerance.


2017 ◽  
Vol 5 (1) ◽  
pp. 85-100 ◽  
Author(s):  
Matija Perne ◽  
Matthew D. Covington ◽  
Evan A. Thaler ◽  
Joseph M. Myre

Abstract. The concept of topographic steady state has substantially informed our understanding of the relationships between landscapes, tectonics, climate, and lithology. In topographic steady state, erosion rates are equal everywhere, and steepness adjusts to enable equal erosion rates in rocks of different strengths. This conceptual model makes an implicit assumption of vertical contacts between different rock types. Here we hypothesize that landscapes in layered rocks will be driven toward a state of erosional continuity, where retreat rates on either side of a contact are equal in a direction parallel to the contact rather than in the vertical direction. For vertical contacts, erosional continuity is the same as topographic steady state, whereas for horizontal contacts it is equivalent to equal rates of horizontal retreat on either side of a rock contact. Using analytical solutions and numerical simulations, we show that erosional continuity predicts the form of flux steady-state landscapes that develop in simulations with horizontally layered rocks. For stream power erosion, the nature of continuity steady state depends on the exponent, n, in the erosion model. For n = 1, the landscape cannot maintain continuity. For cases where n ≠ 1, continuity is maintained, and steepness is a function of erodibility that is predicted by the theory. The landscape in continuity steady state can be quite different from that predicted by topographic steady state. For n < 1 continuity predicts that channels incising subhorizontal layers will be steeper in the weaker rock layers. For subhorizontal layered rocks with different erodibilities, continuity also predicts larger slope contrasts than in topographic steady state. Therefore, the relationship between steepness and erodibility within a sequence of layered rocks is a function of contact dip. For the subhorizontal limit, the history of layers exposed at base level also influences the steepness–erodibility relationship. If uplift rate is constant, continuity steady state is perturbed near base level, but these perturbations decay rapidly if there is a substantial contrast in erodibility. Though examples explored here utilize the stream power erosion model, continuity steady state provides a general mathematical tool that may also be useful to understand landscapes that develop by other erosion processes.


10.28945/3176 ◽  
2007 ◽  
Author(s):  
Samir Jusic ◽  
Lee Sai Peck

Persistence is the term used in computer science to describe a capability to store data structures in non-volatile storage such as a file system or a relational database (Wikipedia, 2003). There is a growing need to simplify the interactions among separate systems and to build complex software systems that are made out of components with well-defined services. At the base-level of such complex systems lies a persistence framework - a set of classes tailored to save, retrieve, update and delete objects to and from their persistence stores, such as databases and flat files. This paper presents the design, and implementation of the transparent persistence framework called PersistF. Design patterns (Gamma, Helm, Johnson, & Vlissides, 1995) have been widely accepted in the software engineering community as the recommended approach to developing software. Part of the research effort of this work included the application of well-known design patterns in order to build the framework. We present how consistent application of design patterns allowed us to build a fully working persistence framework. In order to support development of modern complex applications, some recent application development environments for different programming languages are built in with some kind of persistence framework. To use these frameworks in target applications, the developer often must go through a steep learning curve as each framework is specific in some way, but namely in respect of configuring the framework’s runtime engine with enough information about the domain application. This configuration is often time consuming and error prone. Most of the existing frameworks require complicated configuration steps that are imposed onto the developer. Our aim with this work was to present a framework that will not require such complicated configuration steps and would provide its service to the target application with virtually no configuration of the framework's handling of domain classes.


Author(s):  
Liu Ji-Wei ◽  
Mao Xin-Jun

Given the frequently changing nature of the user requirements and environments in software systems, runtime variability in today’s software systems should be capable of evolving during execution. Computational reflection is required to facilitate accessing and customizing runtime variability during this evolution process. However, realizing this computational reflection includes various practical complexities since the runtime variability is typically neither explicitly represented in software systems nor changeable during runtime. To address this problem, this paper proposes a software architecture to support computational reflection of runtime variability, along with a corresponding causal-connection mechanism to realize the introspection and intercession (i.e. representing runtime variability model, and adding, removing, replacing variability elements and their relations). The proposed software architecture consists of a meta level that represents runtime variability model using objectification, and a base level that organizes and manipulates the implementation of variability elements via reconfiguration. The causal-connection mechanism integrated in our proposed model is designed to synchronize the representation and the implementation. Further, we developed a Reflective Runtime Variability Framework (R2VF) to support the development and operation of the systems with the reflection of runtime variability. The effectiveness and applicability of our approach has been evaluated by applying R2VF to Personal Data Resource Network.


2021 ◽  
Vol 15 (1) ◽  
pp. 1-36
Author(s):  
Cody Kinneer ◽  
David Garlan ◽  
Claire Le Goues

Many software systems operate in environments of change and uncertainty. Techniques for self-adaptation allow these systems to automatically respond to environmental changes, yet they do not handle changes to the adaptive system itself, such as the addition or removal of adaptation tactics. Instead, changes in a self-adaptive system often require a human planner to redo an expensive planning process to allow the system to continue satisfying its quality requirements under different conditions; automated techniques must replan from scratch. We propose to address this problem by reusing prior planning knowledge to adapt to unexpected situations. We present a planner based on genetic programming that reuses existing plans and evaluate this planner on two case-study systems: a cloud-based web server and a team of autonomous aircraft. While reusing material in genetic algorithms has been recently applied successfully in the area of automated program repair, we find that naively reusing existing plans for self- * planning can actually result in a utility loss. Furthermore, we propose a series of techniques to lower the costs of reuse, allowing genetic techniques to leverage existing information to improve utility when replanning for unexpected changes, and we find that coarsely shaped search-spaces present profitable opportunities for reuse.


Author(s):  
E. Rau ◽  
N. Karelin ◽  
V. Dukov ◽  
M. Kolomeytsev ◽  
S. Gavrikov ◽  
...  

There are different methods and devices for the increase of the videosignal information in SEM. For example, with the help of special pure electronic [1] and opto-electronic [2] systems equipotential areas on the specimen surface in SEM were obtained. This report generalizes quantitative universal method for space distribution representation of research specimen parameter by contour equal signal lines. The method is based on principle of comparison of information signal value with the fixed levels.Transformation image system for obtaining equal signal lines maps was developed in two versions:1)In pure electronic system [3] it is necessary to compare signal U (see Fig.1-a), which gives potential distribution on specimen surface along each scanning line with fixed base level signals εifor obtaining quantitative equipotential information on solid state surface. The amplitude analyzer-comparator gives flare sport videopulses at any fixed coordinate and any instant time when initial signal U is equal to one of the base level signals ε.


2020 ◽  
Vol 5 (3) ◽  
pp. 622-636
Author(s):  
John Heilmann ◽  
Alexander Tucci ◽  
Elena Plante ◽  
Jon F. Miller

Purpose The goal of this clinical focus article is to illustrate how speech-language pathologists can document the functional language of school-age children using language sample analysis (LSA). Advances in computer hardware and software are detailed making LSA more accessible for clinical use. Method This clinical focus article illustrates how documenting school-age student's communicative functioning is central to comprehensive assessment and how using LSA can meet multiple needs within this assessment. LSA can document students' meaningful participation in their daily life through assessment of their language used during everyday tasks. The many advances in computerized LSA are detailed with a primary focus on the Systematic Analysis of Language Transcripts (Miller & Iglesias, 2019). The LSA process is reviewed detailing the steps necessary for computers to calculate word, morpheme, utterance, and discourse features of functional language. Conclusion These advances in computer technology and software development have made LSA clinically feasible through standardized elicitation and transcription methods that improve accuracy and repeatability. In addition to improved accuracy, validity, and reliability of LSA, databases of typical speakers to document status and automated report writing more than justify the time required. Software now provides many innovations that make LSA simpler and more accessible for clinical use. Supplemental Material https://doi.org/10.23641/asha.12456719


Sign in / Sign up

Export Citation Format

Share Document