Search results for "Test case"
showing 8 items of 18 documents
Dialog Structure Automatic Modeling
2010
This paper presents the approach implemented as part of a conversational bot named WIH (Word Intelligent Handler). It has a complex architecture with several components. Some of them are the ER-memory, EP-memory and other minor modules that provide the prototype of good modeling of Spanish sentences. They constitute the knowledge-representation mechanism that is used by WIH to build automatic answers during dialogs with humans. In this paper a small description of these components and some of its interaction is given, along with test cases and a statistical analysis of the results obtained. It is shown here that WIH prototype can adapt its behavior and learning rate of its internal working …
Discontinuous Galerkin semi-Lagrangian method for Vlasov-Poisson
2011
We present a discontinuous Galerkin scheme for the numerical approximation of the one-dimensional periodic Vlasov-Poisson equation. The scheme is based on a Galerkin-characteristics method in which the distribution function is projected onto a space of discontinuous functions. We present comparisons with a semi-Lagrangian method to emphasize the good behavior of this scheme when applied to Vlasov-Poisson test cases. Une méthode de Galerkin discontinu est proposée pour l’approximation numérique de l’équation de Vlasov-Poisson 1D. L’approche est basée sur une méthode Galerkin-caractéristiques où la fonction de distribution est projetée sur un espace de fonctions discontinues. En particulier, …
Definition of performance requirements and test cases for offshore/subsea winch drive systems with digital hydraulic motors
2019
Abstract A subsea crane is normally mounted on a floating vessel and equipped with a winch system. The crane can operate in water down to 3000 m. The vessel tends to move up and down due to waves. This heave motion makes offshore lifting operations challenging. In order to ease the winch operation in rough sea, the winch can be equipped with additional systems like active heave compensation and constant tension. In active heave compensation and constant tension system, both motion and force control of the winch are important. This paper presents a digital displacement winch drive system and gives a description of challenges related to subsea lifting operations. The operation challenges are …
A marching in space and time solver for the complete 2D shallow water equations. Application to real test cases.
2006
Layer-Wise Discontinuous Galerkin Methods for Piezoelectric Laminates
2020
In this work, a novel high-order formulation for multilayered piezoelectric plates based on the combination of variable-order interior penalty discontinuous Galerkin methods and general layer-wise plate theories is presented, implemented and tested. The key feature of the formulation is the possibility to tune the order of the basis functions in both the in-plane approximation and the through-the-thickness expansion of the primary variables, namely displacements and electric potential. The results obtained from the application to the considered test cases show accuracy and robustness, thus confirming the developed technique as a supplementary computational tool for the analysis and design o…
On the Generalizability of Programs Synthesized by Grammar-Guided Genetic Programming
2021
Grammar-guided Genetic Programming is a common approach for program synthesis where the user’s intent is given by a set of input/output examples. For use in real-world software development, the generated programs must work on previously unseen test cases too. Therefore, we study in this work the generalizability of programs synthesized by grammar-guided GP with lexicase selection. As benchmark, we analyze proportionate and tournament selection too. We find that especially for program synthesis problems with a low output cardinality (e.g., a Boolean output) lexicase selection overfits the training cases and does not generalize well to unseen test cases. An analysis using common software metr…
A generalizability measure for program synthesis with genetic programming
2021
The generalizability of programs synthesized by genetic programming (GP) to unseen test cases is one of the main challenges of GP-based program synthesis. Recent work showed that increasing the amount of training data improves the generalizability of the programs synthesized by GP. However, generating training data is usually an expensive task as the output value for every training case must be calculated manually by the user. Therefore, this work suggests an approximation of the expected generalization ability of solution candidates found by GP. To obtain candidate solutions that all solve the training cases, but are structurally different, a GP run is not stopped after the first solution …