Search results for "Algorithm"
showing 10 items of 4887 documents
Temperature-dependence of spontaneous mutation rates
2020
Mutation is the source of genetic variation and the fundament of evolution. At the interphase of ecology and evolution, temperature has long been suggested to have a direct impact on realised spontaneous mutation rates. The question is whether mutation rates can be a species-specific constant under variable environmental conditions, such as variation of the ambient temperature. By combining mutation accumulation with whole genome sequencing in a multicellular organism, we provide empirical support to reject this null hypothesis. Instead mutation rates depend on temperature in a U-shaped manner with increasing rates towards both temperature extremes. This relation has important implications …
Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization
2017
Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We …
A New Neighbour Selection Strategy for Group-Based Wireless Sensor Networks
2008
In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common networks. In this paper we will show our study about those different methods and, then we show the development of a suitable neighbour selection strategy for group-based wireless sensor networks (WSN) that is based on a capacity parameter defined by us and the new neighbour distance. We also present the proposal architecture for WSNs and the protocol when a new node joins a group and has to select it…
Do upscale restaurant owners use wine lists as a differentiation strategy?
2009
Abstract The present paper studies various criteria used by upscale restaurant owners to differentiate their restaurants and to define their positioning. In particular, we studied several wine list attributes. Through a cluster analysis and a correspondence factor analysis based on different objective wine list characteristics, we obtain two main differentiated profiles of restaurants according to the relative importance of their wine list in comparison with food menu: wine selection and complementarity. Upscale restaurants need to define their positioning strategy and elaborate their wine lists according to their strategy.
Mathematical Modelling with Biology Undergraduates: Balancing Task Difficulty and Level of Support
2021
We report on extra-curricular activities with biology undergraduates focusing our attention on the selection of mathematical modelling tasks with different levels of cognitive demand and the level of teacher’s guidance during students’ collaborative work on the tasks.
Multi-scale optimisation vs. genetic algorithms in the gradient separation of diuretics by reversed-phase liquid chromatography
2019
Abstract Multi-linear gradients are a convenient solution to get separation of complex samples by modulating carefully the gradient slope, in order to accomplish the local selectivity needs for each particular solute cluster. These gradients can be designed by trial-and-error according to the chromatographer experience, but this strategy becomes quickly inappropriate for complex separations. More evolved solutions imply the sequential construction of multi-segmented gradients. However, this strategy discards part of the search space in each step of the construction and, again, cannot deal properly with very complex samples. When the complexity is too large, the only valid alternative for fi…
Gradient design for liquid chromatography using multi-scale optimization.
2017
Abstract In reversed phase-liquid chromatography, the usual solution to the “general elution problem” is the application of gradient elution with programmed changes of organic solvent (or other properties). A correct quantification of chromatographic peaks in liquid chromatography requires well resolved signals in a proper analysis time. When the complexity of the sample is high, the gradient program should be accommodated to the local resolution needs of each analyte. This makes the optimization of such situations rather troublesome, since enhancing the resolution for a given analyte may imply a collateral worsening of the resolution of other analytes. The aim of this work is to design mul…
An atlas- and data-driven approach to initializing reaction-diffusion systems in computer cardiac electrophysiology
2016
The cardiac electrophysiology (EP) problem is governed by a nonlinear anisotropic reaction-diffusion system with a very rapidly varying reaction term associated with the transmembrane cell current. The nonlinearity associated with the cell models requires a stabilization process before any simulation is performed. More importantly, when used in a 3-dimensional (3D) anatomy, it is not sufficient to perform this stabilization on the basis of isolated cells only, since the coupling of the different cells through the tissue greatly modulates the dynamics of the system. Therefore, stabilization of the system must be performed on the entire 3D model. This work develops a novel procedure for the i…
Collective behaviours: from biochemical kinetics to electronic circuits
2013
In this work we aim to highlight a close analogy between cooperative behaviors in chemical kinetics and cybernetics; this is realized by using a common language for their description, that is mean-field statistical mechanics. First, we perform a one-to-one mapping between paradigmatic behaviors in chemical kinetics (i.e., non-cooperative, cooperative, ultra-sensitive, anti-cooperative) and in mean-field statistical mechanics (i.e., paramagnetic, high and low temperature ferromagnetic, anti-ferromagnetic). Interestingly, the statistical mechanics approach allows a unified, broad theory for all scenarios and, in particular, Michaelis-Menten, Hill and Adair equations are consistently recovered…
Enhancement in the computation of gradient retention times in liquid chromatography using root-finding methods.
2019
Abstract Gradient elution may provide adequate separations within acceptably short times in a single run, by gradually increasing the elution speed. Similarly to isocratic elution, chromatograms can be predicted under any experimental condition, through strategies based on retention models. The most usual approach implies solving an integral equation (i.e., the fundamental equation of gradient elution), which has an analytical solution only for certain combinations of retention model and gradient programme. This limitation can be overcome by using numerical integration, which is a universal approach although at the cost of longer computation times. In this work, several alternatives to impr…