Search results for "102"
showing 10 items of 2892 documents
Learning by the Process of Elimination
2002
AbstractElimination of potential hypotheses is a fundamental component of many learning processes. In order to understand the nature of elimination, herein we study the following model of learning recursive functions from examples. On any target function, the learning machine has to eliminate all, save one, possible hypotheses such that the missing one correctly describes the target function. It turns out that this type of learning by the process of elimination (elm-learning, for short) can be stronger, weaker or of the same power as usual Gold style learning.While for usual learning any r.e. class of recursive functions can be learned in all of its numberings, this is no longer true for el…
A computer method for estimating volumes and surface areas of complex structures consisting of overlapping spheres
1992
A PASCAL program which calculates volumes and surface areas of structures consisting of overlapping spheres is designed. The calculation is done by modelling the structure in the memory of a computer and then scanning the memory bit- or bytewise. A brief discussion of the error is presented, and an example for testing the algorithm is provided.
Simulation of photovoltaic installation connected to the grid with storage system
2017
Abstract In the present paper, a new approach for the management of energy resources in a research laboratory is proposed and evaluated. A simulation study for the photovoltaic (PV) installation was conducted under the Tunisian-Italian cooperation project DE.DU.ENER.T, using renewable energy and economic criteria. The aim of the study is to improve the energy efficiency in order to minimize the electricity cost consumed in the laboratory. A Hybrid Renewable Energy System consisting of a photovoltaic field of 12KWc was installed to reduce the exorbitant bills, due to intensive energy equipment such as drying ovens and workstations, using sustainable, green and clean sources. In addition, a s…
Representation of NURBS surfaces by Controlled Iterated Functions System automata
2019
Iterated Function Systems (IFS) are a standard tool to generate fractal shapes. In a more general way, they can represent most of standard surfaces like Bézier or B-Spline surfaces known as self-similar surfaces. Controlled Iterated Function Systems (CIFS) are an extension of IFS based on automata. CIFS are basically multi-states IFS, they can handle all IFS shapes but can also manage multi self-similar shapes. For example CIFS can describe subdivision surfaces around extraordinary vertices whereas IFS cannot. Having a common CIFS formalism facilitates the development of generic methods to manage interactions (junctions, differences...) between objects of different natures.This work focuses…
A Pragmatic Characterization of Concept Algebra
2017
Taking into account the framework of denotational mathematics as seen by Yingxu Wang, in this paper the author wishes to implement a possible further pragmatic (context-depend) dimension into the algebraic structure of concept algebra. One of the main problems of software science is that regarding context-depend question of a programming language. Indeed, attention has been paid above all to syntactic and semantic dimensions of a programming language, neglecting the pragmatic one concerning context. The author has tried to face this question providing a first denotational mathematics structure taking into account a possible pragmatic dimension.
Concurrent Computing with Shared Replicated Memory
2019
Any concurrent system can be captured by a concurrent Abstract State Machine (cASM). This remains valid, if different agents can only interact via messages. It even permits a strict separation between memory managing agents and other agents that can only access the shared memory by sending query and update requests. This paper is dedicated to an investigation of replicated data that is maintained by a memory management subsystem, where the replication neither appears in the requests nor in the corresponding answers. We specify the behaviour of a concurrent system with such memory management using concurrent communicating ASMs (ccASMs), provide several refinements addressing different replic…
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network
2009
International audience; We propose an efficient way of constructing the wireless mesh structure associated with Molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted Weakly Connected Dominating Set structure. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. Then, we propose a centralized 2-approximation algorithm that maximizes the sum of radio link capacities in the molecular structure. Finally, we extend this protocol so that it can operate in a distributed way still providing the same guarantee. This distributed protocol is self-stabilizing thus robust to topology…
Perspectives and reflections on teaching linear algebra
2020
Abstract This paper presents ‘expert opinions’ on what should be taught in a first-year linear algebra course at university; the aim is to gain a generic picture and general guiding principles for such a course. Drawing on a Delphi method, 14 university professors—called ‘experts’ in this study—addressed the following questions: What should be on a first-year linear algebra undergraduate course for engineering and/or mathematics students? How could such courses be taught? What tools (if any) are essential to these two groups of students? The results of the investigation, these experts’ opinions, mainly concern what should be in a linear algebra course (e.g. problem-solving and applications)…
Time in Associative Learning: A Review on Temporal Maps
2021
Ability to recall the timing of events is a crucial aspect of associative learning. Yet, traditional theories of associative learning have often overlooked the role of time in learning association and shaping the behavioral outcome. They address temporal learning as an independent and parallel process. Temporal Coding Hypothesis is an attempt to bringing together the associative and non-associative aspects of learning. This account proposes temporal maps, a representation that encodes several aspects of a learned association, but attach considerable importance to the temporal aspect. A temporal map helps an agent to make inferences about missing information by applying an integration mechan…
Object-Oriented Operational Semantics
2016
Operational semantics is one way of providing meaning to an executable language. On a high level of abstraction, operational semantics means to define an interpreter or an abstract machine for the language. In this article, we review the concept of operational semantics in the scope of meta-model-based language definitions and identify challenges and issues. We provide a clean conceptual approach using an object-oriented runtime environment and state change operations, which relies on an underlying abstract virtual machine. We present the approach using a sample language.