Search results for "Programming"
showing 10 items of 3090 documents
Evaluating Model-Driven Development Claims with Respect to Quality: A Family of Experiments
2021
[EN] Context: There is a lack of empirical evidence on the differences between model-driven development (MDD), where code is automatically derived from conceptual models, and traditional software development method, where code is manually written. In our previous work, we compared both methods in a baseline experiment concluding that quality of the software developed following MDD was significantly better only for more complex problems (with more function points). Quality was measured through test cases run on a functional system. Objective: This paper reports six replications of the baseline to study the impact of problem complexity on software quality in the context of MDD. Method: We con…
Diffusional Kurtosis Imaging in the Diffusion Imaging in Python Project
2021
ABSTRACTDiffusion-weighted magnetic resonance imaging (dMRI) measurements and models provide information about brain connectivity and are sensitive to the physical properties of tissue microstructure. Diffusional Kurtosis Imaging (DKI) quantifies the degree of non-Gaussian diffusion in biological tissue from dMRI. These estimates are of interest because they were shown to be more sensitive to microstructural alterations in health and diseases than measures based on the total anisotropy of diffusion which are highly confounded by tissue dispersion and fiber crossings. In this work, we implemented DKI in the Diffusion in Python (DIPY) project - a large collaborative open-source project which …
Managing sensor data streams in a smart home application
2020
A challenge in developing an ambient activity recognition system for use in elder care is finding a balance between the sophistication of the system and a cost structure that fits within the budgets of public and private sector healthcare organisations. Much activity recognition research in the context of elder care is based on dense networks of sensors and advanced methods, such as supervised machine learning algorithms. This paper presents the data processing aspects of an activity recognition system based on a simpler, knowledge-based unsupervised approach, designed for a sparse network of sensors. By structuring sensor data management as a streaming system, we provide a simple programmi…
An efficient swap algorithm for the lattice Boltzmann method
2007
During the last decade, the lattice-Boltzmann method (LBM) as a valuable tool in computational fluid dynamics has been increasingly acknowledged. The widespread application of LBM is partly due to the simplicity of its coding. The most well-known algorithms for the implementation of the standard lattice-Boltzmann equation (LBE) are the two-lattice and two-step algorithms. However, implementations of the two-lattice or the two-step algorithm suffer from high memory consumption or poor computational performance, respectively. Ultimately, the computing resources available decide which of the two disadvantages is more critical. Here we introduce a new algorithm, called the swap algorithm, for t…
A Metamodeling Approach to Evolution
2001
With the increasing complexity of systems being modeled, analysis & design move towards more and more abstract methodologies. Most of them rely on metamodeling tools that employ multi-view models and the four-layer metamodeling architecture. Our idea is to use the metamodeling approach to classify and to constraint the possible evolutions of an information system with the effect to improve both detection of evolution conflicts and disciplined reuse. Within the domain of UML metamodeling, a refinement of the metamodel-level classification is proposed that includes bases for defining a metric of the evolution (in terms of distance between metamodels).
Monitoring a descriptive panel-Consistence and agreement evaluation by both univariate and multivariante techniques
1993
Special Issue Rose Marie Pangborn Memorial Symposium; International audience
UML-Based Reliability Modeling of Network Services, a UDP Echo Service Case Study
2009
In the paper, we discuss state space reliability modeling formalism of distributed systems and services compliant with UML metamodel. Behavior of modeled application system we describe in terms of states. Service generation process we represent as a sequence of application system states. State space approach allows us to define dependence between application system components via dependence between components states and states input, output parameters. Reliability of application system component we define for each simply action state. Reliability of a service we express by components reliability in states determined by service generation process. As an example, we analyze reliability of cli…
Constraint Management in Engineering of Complex Information Systems
2009
We propose to build an engineering environment for information systems by using metamodels, OCL and symbolic model checkers to manage constraints. Our proposal is based on a definition of constraints as 3D spaces with dimensions corresponding to UML diagrams, constructs, and abstraction levels. We show how such environments can help with engineering quality complex systems by allowing to lift up a part of constraint verifications.
An optimality test for semi-infinite linear programming
1992
In this paper we present a test to characterize the optimal solutions for the continuous semi-infinite linear programming problem. This optimality characterization is a condition of Kuhn–Tucker type. The resolution of a linear program permits to check the optimality of a feasible point,to detect the unboundedness of the problem and to find descent directions. We give some illustrative examples. We show that the local Mangasarian–Fromovitz constraint qualification is almost equivalent to Slater qualification for this problem. Furthermore, it follows from our study that this optimality condition is always necessary for a wide class of semi-infinite linear programming problems
Solution isolation strategies for the Bernstein polytopes-based solver
2013
The Bernstein polytopes-based solver is a new method developed to solve systems of nonlinear equations, which often occur in Geometric Constraint Solving Problems. The principle of this solver is to linearize nonlinear monomials and then to solve the resulting linear programming problems, through linear programming. However, without any strategy for the isolation of the many solutions of multiple-solution systems, this solver is slow in practice. To overcome this problem, we propose in this work, a study of several strategies for solution isolation, through the split of solution boxes into several subboxes, according to three main steps answering the questions: when, where, and how to perfo…