Search results for "Modeling and Simulation"

A note on best proximity point theory using proximal contractions

2018

In this paper, a reduction technique is used to show that some recent results on the existence of best proximity points for various classes of proximal contractions can be concluded from the corresponding results in fixed point theory.

Stabilized branch-and-price algorithms for vector packing problems

2018

Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…

The minimum mean cycle-canceling algorithm for linear programs

2022

Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…

Best proximity point theorems for proximal cyclic contractions

2017

The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.

Combined column-and-row-generation for the optimal communication spanning tree problem

2018

Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …

Ensuring the Reliability of an Autonomous Vehicle

2017

International audience; In automotive applications, several components, offering different services, can be composed in order to handle one specific task (autonomous driving for example). Nevertheless, component composition is not straightforward and is subject to the occurrence ofbugs resulting from components or services incompatibilities for instance. Hence, bugs detection in component-based systems at thedesign level is very important, particularly, when the developed system concerns automotive applications supporting critical services.In this paper, we propose a formal approach for modeling and verifying the reliability of an autonomous vehicle system, communicatingcontinuously with of…

Understanding the Importance of Proper Incentives for Critical Infrastructures Management – How System Dynamics Can Help

2016

International audience; Computer and information systems are now at the core of numerous critical infrastructures. However, their security management is by far not a trivial issue. Further, these systems, by their very nature, belong to the domain of complex systems, where system dynamics (SD) is an established method, which aims at modelling such systems, their analysis and understanding. Further, on this basis it enables simulation of various policies to properly manage complex systems. More precisely, through understanding of the basic elements of the whole mosaic and their interplay, proper incentives can be tested. And this is important, because proper incentives can lead to the desire…

Nursing Students Managing Deteriorating Patients: A Systematic Review and Meta-Analysis

2018

Abstract Background The objective was to summarize knowledge and systematically collect and quantify meta-analytical results regarding the effects of high-fidelity simulation in nursing education to improve students' ability to recognize and respond to deteriorating patients. Methods In total, 4048 citations were screened, 40 articles were selected for full-text screening, and 14 articles were included. Six articles were subsequently included in the meta-analysis. Results Knowledge and performance increased after simulation. Four studies reported an increase in self-confidence. Conclusion Findings support that studies with high-quality research designs and improved measurement practices are…

Recentrifuge: Robust comparative analysis and contamination removal for metagenomics

2017

Metagenomic sequencing is becoming widespread in biomedical and environmental research, and the pace is increasing even more thanks to nanopore sequencing. With a rising number of samples and data per sample, the challenge of efficiently comparing results within a specimen and between specimens arises. Reagents, laboratory, and host related contaminants complicate such analysis. Contamination is particularly critical in low microbial biomass body sites and environments, where it can comprise most of a sample if not all. Recentrifuge implements a robust method for the removal of negative-control and crossover taxa from the rest of samples. With Recentrifuge, researchers can analyze results f…

2019

As rats learn to search for multiple sources of food or water in a complex environment, they generate increasingly efficient trajectories between reward sites. Such spatial navigation capacity involves the replay of hippocampal place-cells during awake states, generating small sequences of spatially related place-cell activity that we call "snippets". These snippets occur primarily during sharp-wave-ripples (SWRs). Here we focus on the role of such replay events, as the animal is learning a traveling salesperson task (TSP) across multiple trials. We hypothesize that snippet replay generates synthetic data that can substantially expand and restructure the experience available and make learni…