Search results for "Symbolic"
showing 10 items of 449 documents
S3. Generalisation tests: Likelihood model, scenarios investigated and results from Hard to catch: experimental evidence supports evasive mimicry
2021
Detailed description of the different scenarios investigated for the generalisation test. Full results from the likelihood models are included as well.
WSN Design and Verification Using On-Board Executable Specifications
2019
The gap between informal functional specifications and the resulting implementation in the chosen programming language is notably a source of errors in embedded systems design. In this paper, we discuss a methodology and a software platform aimed at coping with this issue in programming resource-constrained wireless sensor network nodes (WSNs). Whereas the typical development model for the WSNs is based on cross compilation, the proposed approach supports high-level symbolic coding of abstract models and distributed applications, as well as their test and their execution, directly on the target hardware. As a working example, we discuss the application of our methodology to specify the func…
Some subgroup embeddings in finite groups: A mini review
2015
[EN] In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied. ª 2014 Production and hosting by Elsevier B.V. on behalf of Cairo University
CovSel
2018
Ensemble methods combine the predictions of a set of models to reach a better prediction quality compared to a single model's prediction. The ensemble process consists of three steps: 1) the generation phase where the models are created, 2) the selection phase where a set of possible ensembles is composed and one is selected by a selection method, 3) the fusion phase where the individual models' predictions of the selected ensemble are combined to an ensemble's estimate. This paper proposes CovSel, a selection approach for regression problems that ranks ensembles based on the coverage of adequately estimated training points and selects the ensemble with the highest coverage to be used in th…
Automatic construction of test sets: Practical approach
2005
The problem of symbolic execution and test generation is considered both for sequential and concurrent programs. Practical methods for test construction for the given program path are presented.
Distributed Symbolic Network Quality Assessment for Resource-constrained Devices
2021
After a Wireless Sensor Network (WSN) is deployed it is subject to significant variations of the quality of its radio links during its lifetime. Knowledge of the condition of the wireless links can be useful to optimize power consumption and increase the reliability of the network. However, resource-constrained nodes may not be able to spare the storage space for network monitoring code. Also, reprogramming deployed nodes can be costly or unfeasible. In this work, we show how an approach based on the exchange of symbolic executable code among nodes enables the assessment of the network status in terms of Packet Reception Rate (PRR) with no extra storage requirements on deployed networks. We…
Knowledge-based verification of concatenative programming patterns inspired by natural language for resource-constrained embedded devices
2020
We propose a methodology to verify applications developed following programming patterns inspired by natural language that interact with physical environments and run on resource-constrained interconnected devices. Natural language patterns allow for the reduction of intermediate abstraction layers to map physical domain concepts into executable code avoiding the recourse to ontologies, which would need to be shared, kept up to date, and synchronized across a set of devices. Moreover, the computational paradigm we use for effective distributed execution of symbolic code on resource-constrained devices encourages the adoption of such patterns. The methodology is supported by a rule-based sys…
MultivariateApart: Generalized partial fractions
2021
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied to terms of a sum separately. The package is designed to work in Mathematica, but also provides interfaces to the Form and Singular computer algebra systems. THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE
Computer code from Sex roles and the evolution of parental care specialization.
2019
Computer code for the mathematical model in Mathematica
Computer code from Sex roles and the evolution of parental care specialization
2019
Computer code for the mathematical model in Mathematica