pinecone/core-2020-05-10-deduplication huggingface dataset:
Fertility and population change in the United Kingdom

As in most wealthy countries, the United Kingdom (UK) population is aging and is set to continue to age for the next several decades. Recent and projected rates of change in the share of the elderly population are slow, however, compared to most other European Union (EU)-27 countries. Although since 1998 net migration has played some role, the UK’s relatively benign demographic profile has much to do with its relatively high fertility rates. Population issues, low fertility in particular, are not considered to be a major policy concern or an appropriate target for government intervention. A combination of moderately high fertility and high female employment has (at least historically) been achieved without implementing the kinds of work-family reconciliation policies that are credited with sustaining fertility elsewhere in Europe. A laissez-faire approach to the economy and residual approach to welfare may well have sustained UK fertility levels by facilitating childbearing in more socio-economically disadvantaged families. Recent, path-deviant, work-family reconciliation policies have been adopted, but the wider institutional context has moderated their potential to reduce the costs of childbearing
Pattern formation at cellular membranes by phosphorylation and dephosphorylation of proteins

We consider a classical model on activation of proteins, based in two reciprocal enzymatic biochemical reactions. The combination of phosphorylation and dephosphorylation reactions of proteins is a well established mechanism for protein activation in cell signalling. We introduce different affinity of the two versions of the proteins to the membrane and to the cytoplasm. The difference in the diffusion coefficient at the membrane and in the cytoplasm together with the high density of proteins at the membrane which reduces the accessible area produces domain formation of protein concentration at the membrane. We differentiate two mechanisms responsible for the pattern formation inside of living cells and discuss the consequences of these models for cell biology.Peer ReviewedPreprin
Modelling the evolution of computer aided design models:Investigating the potential for supporting engineering project management

The development of Computer Aided Design (CAD) models is a fundamental and distinct feature of Engineering Projects. CAD models can be considered to be the digital embodiment of the products’ design and are used to support a wide variety of tasks that span the embodiment, detail, manufacture and commissioning phases of a project. With this in mind, it is proposed that the monitoring and modelling of the edit trace behaviour of CAD files may provide additional understanding and evidence that supplements current approaches to monitor and manage engineering projects. To explore this proposition, this paper presents results from an exploratory study that seeks to model the edit trace behaviour of CAD files based upon their meta-data attributes (for example, file size, date modified & date accessed). The edit trace behaviour has been mapped to a sigmoid function in order to be able to describe and potentially predict future behaviour. The potential impact of being able to provide this type of information to engineering project management is also discussed
Improving OWL RL reasoning in N3 by using specialized rules

Semantic Web reasoning can be a complex task: depending on the amount of data and the ontologies involved, traditional OWL DL reasoners can be too slow to face problems in real time. An alternative is to use a rule-based reasoner together with the OWL RL/RDF rules as stated in the specification of the OWL 2 language profiles. In most cases this approach actually improves reasoning times, but due to the complexity of the rules, not as much as it could. In this paper we present an improved strategy: based on the TBoxes of the ontologies involved in a reasoning task, we create more specific rules which then can be used for further reasoning. We make use of the EYE reasoner and its logic Notation3. In this logic, rules can be employed to derive new rules which makes the rule creation a reasoning step on its own. We evaluate our implementation on a semantic nurse call system. Our results show that adding a pre-reasoning step to produce specialized rules improves reasoning times by around 75 %
BEACON: A Cloud Network Federation Framework

This paper presents the BEACON Framework, which will enable the provision and management of cross-site virtual networks for federated cloud infrastructures in order to support the automated deployment of applications and services across different clouds and datacenters. The proposed framework will support different federation architectures, going from tightly coupled (datacenter federation) to loosely coupled (cloud federation and multi-cloud orchestration) architectures, and will enable the creation of Layer 2 and Layer 3 overlay networks to interconnect remote resources located at different cloud sites. A high level description of the main components of the BEACON framework is also introduced
A Framework for Integrated Assessment Modelling

“Air quality plans” according to Air Quality Directive 2008/50/EC Art. 23 are the strategic element to be developed, with the aim to reliably meet ambient air quality standards in a cost-effective way. This chapter provides a general framework to develop and assess such plans along the lines of the European Commission’s basic ideas to implement effective emission reduction measures at local, region, and national level. This methodological point of view also allows to analyse the existing integrated approaches
Exploiting the retinal vascular geometry in identifying the progression to diabetic retinopathy using penalized logistic regression and random forests

Many studies have been conducted, investigating the effects that diabetes has to the retinal vasculature. Identifying and quantifying the retinal vascular changes remains a very challenging task, due to the heterogeneity of the retina. Monitoring the progression requires follow-up studies of progressed patients, since human retina naturally adapts to many different stimuli, making it hard to associate any changes with a disease. In this novel study, data from twenty five diabetic patients, who progressed to diabetic retinopathy, were used. The progression was evaluated using multiple geometric features, like vessels widths and angles, tortuosity, central retinal artery and vein equivalent, fractal dimension, lacunarity, in addition to the corresponding descriptive statistics of them. A statistical mixed model design was used to evaluate the significance of the changes between two periods: 3 years before the onset of diabetic\ud
retinopathy and the first year of diabetic retinopathy. Moreover, the discriminative power of these features was evaluated using a random forests classifier and also a penalized logistic regression. The area under the ROC curve after running a ten-fold cross validation was 0.7925 and 0.785 respectively
Free boundary problems in PDEs and particle systems

In this volume a theory for models of transport in the presence of a free
boundary is developed. Macroscopic laws of transport are described by PDEs.
When the system is open, there are several mechanisms to couple the system with
the external forces. Here a class of systems where the interaction with the
exterior takes place in correspondence of a free boundary is considered. Both
continuous and discrete models sharing the same structure are analyzed. In Part
I a free boundary problem related to the Stefan Problem is worked out in all
details. For this model a new notion of relaxed solution is proposed for which
global existence and uniqueness is proven. It is also shown that this is the
hydrodynamic limit of the empirical mass density of the associated particle
system. In Part II several other models are discussed. The expectation is that
the results proved for the basic model extend to these other cases. All the
models discussed in this volume have an interest in problems arising in several
research fields such as heat conduction, queuing theory, propagation of fire,
interface dynamics, population dynamics, evolution of biological systems with
selection mechanisms.In general researchers interested in the relations between
PDEs and stochastic processes can find in this volume an extension of this
correspondence to modern mathematical physics.Comment: 101 pages, 1 figure in SpringerBriefs in Mathematical Physics (2016),
  http://www.springer.com/jp/book/978331933369
Polynomial approximation of quasipolynomials based on digital filter design principles

This contribution is aimed at a possible procedure approximating quasipolynomials by polynomials. Quasipolynomials appear in linear time-delay systems description as a natural consequence of the use of the Laplace transform. Due to their infinite root spectra, control system analysis and synthesis based on such quasipolynomial models are usually mathematically heavy. In the light of this fact, there is a natural research endeavor to design a sufficiently accurate yet simple engineeringly acceptable method that approximates them by polynomials preserving basic spectral information. In this paper, such a procedure is presented based on some ideas of discrete-time (digital) filters designing without excessive math. Namely, the particular quasipolynomial is subjected to iterative discretization by means of the bilinear transformation first; consequently, linear and quadratic interpolations are applied to obtain integer powers of the approximating polynomial. Since dominant roots play a decisive role in the spectrum, interpolations are made in their very neighborhood. A simulation example proofs the algorithm efficiency. © Springer International Publishing Switzerland 2016
Calibration of triaxial accelerometer and triaxial magnetometer for tilt compensated electronic compass

his research paper describes the method for the calibration of accelerometer and magnetometer for tilt compensated electronic compass. The electronic compass is implemented using triaxial MEMS accelerometer and triaxial MEMS magnetometer. The heading of the compass is generally influenced by scale factors, offsets and misalignment errors of these sensors. The proposed calibration method determines twelve calibration parameters in six stationary positions for accelerometer and twelve calibration parameters in 3D rotations for magnetometer. © Springer International Publishing Switzerland 2016
Constant Factor Approximation for ATSP with Two Edge Weights

We give a constant factor approximation algorithm for the Asymmetric
Traveling Salesman Problem on shortest path metrics of directed graphs with two
different edge weights. For the case of unit edge weights, the first constant
factor approximation was given recently by Svensson. This was accomplished by
introducing an easier problem called Local-Connectivity ATSP and showing that a
good solution to this problem can be used to obtain a constant factor
approximation for ATSP. In this paper, we solve Local-Connectivity ATSP for two
different edge weights. The solution is based on a flow decomposition theorem
for solutions of the Held-Karp relaxation, which may be of independent
interest
Strong reductions for extended formulations

We generalize the reduction mechanism for linear programming problems and
semidefinite programming problems from [arXiv:1410.8816] in two ways 1)
relaxing the requirement of affineness and 2) extending to fractional
optimization problems. As applications we provide several new LP-hardness and
SDP-hardness results, e.g., for the SparsestCut problem, the BalancedSeparator
problem, the MaxCut problem and the Matching problem on 3-regular graphs. We
also provide a new, very strong Lasserre integrality gap result for the
IndependentSet problem, which is strictly greater than the best known LP
approximation, showing that the Lasserre hierarchy does not always provide the
tightest SDP relaxation.Comment: correct approx factor for sparsest cut, typos, update reference
Rescaled coordinate descent methods for linear programming

We propose two simple polynomial-time algorithms to find a positive solution to   Ax=0Ax=0 . Both algorithms iterate between coordinate descent steps similar to von Neumann’s algorithm, and rescaling steps. In both cases, either the updating step leads to a substantial decrease in the norm, or we can infer that the condition measure is small and rescale in order to improve the geometry. We also show how the algorithms can be extended to find a solution of maximum support for the system   Ax=0Ax=0 ,   x≥0x≥0 . This is an extended abstract. The missing proofs will be provided in the full version
Max-Cut under Graph Constraints

An instance of the graph-constrained max-cut (GCMC) problem consists of (i)
an undirected graph G and (ii) edge-weights on a complete undirected graph on
the same vertex set. The objective is to find a subset of vertices satisfying
some graph-based constraint in G that maximizes the total weight of edges in
the cut. The types of graph constraints we can handle include independent set,
vertex cover, dominating set and connectivity. Our main results are for the
case when G is a graph with bounded treewidth, where we obtain a
0.5-approximation algorithm. Our algorithm uses an LP relaxation based on the
Sherali-Adams hierarchy. It can handle any graph constraint for which there is
a (certain type of) dynamic program that exactly optimizes linear objectives.
Using known decomposition results, these imply essentially the same
approximation ratio for GCMC under constraints such as independent set,
dominating set and connectivity on a planar graph G (more generally for
bounded-genus or excluded-minor graphs)
Methodology for Generating Individualized Trajectories from Experiments

Traffic research has reached a point where trajectories are available for microscopic analysis. The next step will be trajectories which are connected to human factors, i.e. information about the agent. The first step in pedestrian dynamics has been done using video recordings to generate precise trajectories. We go one step further and present two experiments for which ID markers are used to produce individualised trajectories: a large-scale experiment on pedestrian dynamics and an experiment on single-file bicycle traffic. The camera set-up has to be carefully chosen when using ID markers. It has to facilitate reading out the markers, while at the same time being able to capture the whole experiment. We propose two set-ups to address this problem and report on experiments conducted with these set-ups
Individual Microscopic Results Of Bottleneck Experiments

This contribution provides microscopic experimental study of pedestrian
motion in front of the bottleneck, explains the high variance of individual
travel time by the statistical analysis of trajectories. The analysis shows
that this heterogeneity increases with increasing occupancy. Some participants
were able to reach lower travel time due more efficient path selection and more
aggressive behavior within the crowd. Based on this observations, linear model
predicting travel time with respect to the aggressiveness of pedestrian is
proposed.Comment: Submitted to Traffic and Granullar Flow 2015, Springe
Impact of Impulse Stops on Pedestrian Flow

We numerically study the impact of impulse stops on pedestrian flow for a
straight corridor with multiple attractions. The impulse stop is simulated by
the switching behavior model, a function of the social influence strength and
the number of attendees near the attraction. When the pedestrian influx is low,
one can observe a stable flow where attendees make a complete stop at an
attraction and then leave the attraction after a certain amount of time. When
the pedestrian influx is high, an unstable flow is observed for strong social
influence. In the unstable flow, attendees near the attraction are crowded out
from the clusters by others due to the interpersonal repulsion. The expelled
pedestrians impede the pedestrian traffic between the left and right boundaries
of the corridor. These collective patterns of pedestrian flow are summarized in
a schematic phase diagram.Comment: Traffic and Granular Flow '15 (TGF '15) conference pape
Collision-free speed model for pedestrian dynamics

We propose in this paper a minimal speed-based pedestrian model for which particle dynamics are intrinsically collision-free. The speed model is an optimal velocity function depending on the agent length (i.e.\ particle diameter), maximum speed and time gap parameters. The direction model is a weighted sum of exponential repulsion from the neighbors, calibrated by the repulsion rate and distance. The model's main features like the reproduction of empirical phenomena are analysed by simulation. We point out that phenomena of self-organisation observable in force-based models and field studies can be reproduced by the collision-free model with low computational effort
Estimation of Discretized Motion of Pedestrians by the Decision-Making
  Model

The contribution gives a micro-structural insight into the pedestrian
decision process during an egress situation. A method how to extract the
decisions of pedestrians from the trajectories recorded during the experiments
is introduced. The underlying Markov decision process is estimated using the
finite mixture approximation. Furthermore, the results of this estimation can
be used as an input to the optimization of a Markov decision process for one
`clever' agent. This agent optimizes his strategy of motion with respect to
different reward functions, minimizing the time spent in the room or minimizing
the amount of inhaled CO.Comment: Conference Traffic and Granullar Flow 2015, to be published by
  Springe
Jam avoidance with autonomous systems

Many car-following models are developed for jam avoidance in highways. Two mechanisms are used to improve the stability: feedback control with autonomous models and increasing of the interaction within cooperative ones.  In this paper, we compare the linear autonomous and collective optimal velocity (OV) models.We observe that the stability is significantly increased by adding predecessors in interaction with collective models. Yet autonomous and collective approaches are close when the speed difference term is taking into account.   Within the linear OV models tested, the autonomous models including speed difference are sufficient to maximise the stability
Central Limit Theorem for Adaptative Multilevel Splitting Estimators in an Idealized Setting

International audienceThe Adaptive Multilevel Splitting algorithm is a very powerful and versatile iterative method to estimate the probability of rare events, based on an interacting particle systems. In an other article, in a so-called idealized setting, the authors prove that some associated estimators are unbiased, for each value of the size n of the systems of replicas and of resampling number k. Here we go beyond and prove these estimator's asymptotic normality when h goes to infinity, for any fixed value of k. The main ingredient is the asymptotic analysis of a functional equation on an appropriate characteristic function. Some numerical simulations illustrate the convergence to rely on Gaussian confidence intervals
Derivative-based global sensitivity measures and their link with Sobol
  sensitivity indices

The variance-based method of Sobol sensitivity indices is very popular among
practitioners due to its efficiency and easiness of interpretation. However,
for high-dimensional models the direct application of this method can be very
time consuming and prohibitively expensive to use. One of the alternative
global sensitivity analysis methods known as the method of derivative based
global sensitivity measures (DGSM) has recently become popular among
practitioners. It has a link with the Morris screening method and Sobol
sensitivity indices. DGSM are very easy to implement and evaluate numerically.
The computational time required for numerical evaluation of DGSM is generally
much lower than that for estimation of Sobol sensitivity indices. We present a
survey of recent advances in DGSM and new results concerning new lower and
upper bounds on the values of Sobol total sensitivity indices. Using these
bounds it is possible in most cases to get a good practical estimation of the
values of Sobol total sensitivity indices. Several examples are used to
illustrate an application of DGSM.Comment: Monte Carlo and Quasi-Monte Carlo Methods 2014, conference, Monte
  Carlo and Quasi-Monte Carlo Methods, R. Cools and D. Nuyens (eds.), Springer
  Proceedings in Mathematics & Statistics 163, Springer International
  Publishing Switzerland 201
A Note on the Importance of Weak Convergence Rates for SPDE
  Approximations in Multilevel Monte Carlo Schemes

It is a well-known rule of thumb that approximations of stochastic partial
differential equations have essentially twice the order of weak convergence
compared to the corresponding order of strong convergence. This is already
known for many approximations of stochastic (ordinary) differential equations
while it is recent research for stochastic partial differential equations. In
this note it is shown how the availability of weak convergence results
influences the number of samples in multilevel Monte Carlo schemes and
therefore reduces the computational complexity of these schemes for a given
accuracy of the approximations.Comment: 16 pages, 3 figures, updated to version published in the Proceedings
  of MCQMC1
A Strategy for Parallel Implementations of Stochastic Lagrangian Simulation

International audienceIn this paper, we present some investigations on the parallelization of stochastic Lagrangian simulations. The challenge is the proper management of the random numbers. We review two different object-oriented strategies: to draw the random numbers on the fly within each MPI's process or to use a different random number generator for each simulated path. We show the benefits of the second technique which is implemented in the PALMTREE software developed by the Project-team Sage of Inria Rennes. The efficiency of PALMTREE is demonstrated on two classical examples
Identifying malicious behavior in multi-party bipolar argumentation debates

© Springer International Publishing Switzerland 2016.Lately, several works have analyzed potential uses of argumentation in multi-party debates. Usually, the focus of such works is the computation of a collectively “correct” outcome, a challenging task even when the debate’s users truthfully express their beliefs. This work focuses on debates where some users may exhibit specific types of “malicious” behavior: they may lie (bymaking statements they do not believe to hold) and they may hide valuable information (by not making relevant statements they believe to hold). Our approach is the following: firstly, we define “user attributes” which capture different aspects of a user’s behavior in a debate (how active, how opinionated and how classifiable a user has been); then, we build and test experimentally hypotheses that, from the values of these attributes, can predict whether a user has lied and/or hidden valuable information
Focal points for a more user-centred agile development

The integration of user-centred design and Agile development is becoming increasingly common in companies and appears promising. However it may also present some critical points, or communication breakdowns, such as a variable interpretation of user involvement, a mismatch in the value of documentation and a misalignment in iterations. We refine these themes, emerging from both literature and previous fieldwork, by analysing a case study performed in an IT company that adopts both software engineering approaches, and we further extend the framework with a new theme related to task ownership. We argue that communication breakdowns can become focal points to drive action and decision for establishing an organisational context acknowledging the value of user involvement: to this end, we suggest the adoption of design thinking and the active engagement of the customer in embracing its values