The movement of a particle described by Brownian motion is quantified by a single parameter, $D$, the diffusion constant. The estimation of $D$ from a discrete sequence of noisy observations is a fundamental problem in biological single particle tracking experiments since it can report on the environment and/or the state of the particle itself via hydrodynamic radius. Here we present a method to estimate $D$ that takes into account several effects that occur in practice, that are important for correct estimation of $D$, and that have hitherto not been combined together for estimation of $D$. These effects are motion blur from finite integration time of the camera, intermittent trajectories, and time-dependent localization uncertainty. Our estimation procedure, a maximum likelihood estimation, follows directly from the likelihood expression for a discretely observed Brownian trajectory that explicitly includes these effects. The manuscript begins with the formulation of the likelihood expression and then presents three methods to find the exact solution. Each method has its own advantages in either computational robustness, theoretical insight, or the estimation of hidden variables. We then compare our estimator to previously published estimators using a squared log loss function to demonstrate the benefit of including these effects.
During angiogenesis, endothelial cells compete for the tip position during angiogenesis: a phenomenon named tip cell overtaking. It is still unclear to what extent tip cell overtaking is a side effect of sprouting or to what extent a biological function. To address this question, we studied tip cell overtaking in two existing cellular Potts models of angiogenic sprouting. In these models angiogenic sprouting-like behavior emerges from a small set of plausible cell behaviors and the endothelial cells spontaneously migrate forwards and backwards within sprouts, suggesting that tip cell overtaking might occur as a side effect of sprouting. In accordance with experimental observations, in our simulations the cells' tendency to occupy the tip position can be regulated when two cell lines with different levels of Vegfr2 expression are contributing to sprouting (mosaic sprouting assay), where cell behavior is regulated by a simple VEGF-Dll4-Notch signaling network. Our modeling results suggest that tip cell overtaking occurs spontaneously due to the stochastic motion of cells during sprouting. Thus, tip cell overtaking and sprouting dynamics may be interdependent and should be studied and interpreted in combination. VEGF-Dll4-Notch can regulate the ability of cells to occupy the tip cell position, but only when cells in the simulation strongly differ in their levels of Vegfr2. We propose that VEGF-Dll4-Notch signaling might not regulate which cell ends up at the tip, but assures that the cell that randomly ends up at the tip position acquires the tip cell phenotype.
The mammalian spatial navigation system makes use of several different sensory information channels. This information is then converted into a neural code that represents the animal's current position in space by engaging place cell, grid cell, and head direction cell networks. In particular, sensory landmark (allothetic) cues can be utilized in concert with an animal's knowledge of its own velocity (idiothetic) cues to generate a more accurate representation of position than (idiothetic) path integration provides on its own (Battaglia et al, 2004). We develop a computational model that merges path integration with information from external sensory cues that provide a reliable representation of spatial position along an annular track. Starting with a continuous bump attractor model, we allow for the possibility of synaptic spatial heterogeneity that would break the translation symmetry of space. We use asymptotic analysis to reduce the bump attractor model to a single scalar equation whose potential represents the impact of heterogeneity. Such heterogeneity causes errors to build up when the network performs path integration, but these errors can be corrected by an external control signal representing the effects of sensory cues. We demonstrate that there is an optimal strength and decay rate of the control signal when cues are placed both periodically and randomly. A similar analysis is performed when errors in path integration arise from dynamic noise fluctuations. Again, there is an optimal strength and decay of discrete control that minimizes the path integration error.
Most phylogenetic models assume that the evolutionary process is stationary and reversible. As a result, the root of the tree cannot be inferred as part of the analysis because the likelihood of the data does not depend on the position of the root. Yet defining the root of a phylogenetic tree is a key component of phylogenetic inference because it provides a point of reference for polarising ancestor/descendant relationships and therefore interpreting the tree. In this paper we investigate the effect of relaxing the reversibility assumption and allowing the position of the root to be another unknown in the model. We propose two hierarchical models that are centred on a reversible model but perturbed to allow non-reversibility. The models differ in the degree of structure imposed on the perturbations. The analysis is performed in the Bayesian framework using Markov chain Monte Carlo methods. We illustrate the performance of the two non-reversible models in analyses of simulated data sets using two types of topological priors. We then apply the models to a real biological data set, the radiation of polyploid yeasts, for which there is a robust biological opinion about the root position. Finally we apply the models to a second biological data set for which the rooted tree is controversial: the ribosomal tree of life. We compare the two non-reversible models and conclude that both are useful in inferring the position of the root from real biological data sets.
Display advertising normally charges advertisers for every single ad impression. Specifically, if an ad in a webpage has been loaded in the browser, an ad impression is counted. However, due to the position and size of the ad slot, lots of ads are actually not viewed but still measured as impressions and charged. These fraud ad impressions indeed undermine the efficacy of display advertising. A perfect ad impression viewability measurement should match what the user has really viewed with a short memory. In this paper, we conduct extensive investigations on display ad impression viewability measurements on dimensions of ad creative displayed pixel percentage and exposure time to find which measurement provides the most accurate ad impression counting. The empirical results show that the most accurate measurement counts one ad impression if more than 75% of the ad creative pixels have been exposed for at least 2 continuous seconds.
We study chemotaxis of a single {\sl E.coli} bacterium in a medium where the nutrient chemical is also undergoing diffusion and its concentration has the form of a Gaussian whose width increases with time. We measure the average first passage time of the bacterium at a region of high nutrient concentration. In the limit of very slow nutrient diffusion, the bacterium effectively experiences a Gaussian concentration profile with a fixed width. In this case we find that there exists an optimum width of the Gaussian when the average first passage time is minimum, {\sl i.e.}, the search process is most efficient. We verify the existence of the optimum width for the deterministic initial position of the bacterium and also for the stochastic initial position, drawn from uniform and steady state distributions. Our numerical simulation in a model of a non-Markovian random walker agrees well with our analytical calculations in a related coarse-grained model. We also present our simulation results for the case when the nutrient diffusion and bacterial motion occur over comparable time-scales and the bacterium senses a time-varying concentration field.
The Triander program is an interactive software package for nucleotide sequence visualization. The program was developed using the freeware Pascal RAD IDE Lazarus, and its source code and binaries compiled for Windows are freely accessible at http://www.icbge.org.ua/eng/Triander . Triander can produce four types of plots. It is possible to build three DNA walks independently for each nucleotide position in triplets. The use of nucleotide vectors with unequal modulus leads to a significant reduction in the visual information lost in DNA walks. The program can be used in the investigation of the fine structure of sequences, to find standard patterns in them and to locate nontrivial regions for further detailed analysis.
For the numerical solution of the American option valuation problem, we provide a script written in MATLAB implementing an explicit finite difference scheme. Our main contribute is the definition of a posteriori error estimator for the American options pricing which is based on Richardson's extrapolation theory. This error estimator allows us to find a suitable grid where the computed solution, both the option price field variable and the free boundary position, verify a prefixed error tolerance.
This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to an optimal stopping time problem with state constraint, and then in a Markovian setting, we investigate the optimal strategy by analyzing the properties of the corresponding free boundary, including its position, asymptotics, monotonicity and regularity. We identify situations when call precedes conversion, and vice versa. Moreover, we show that the irregular payoff results in the possibly non-monotonic conversion boundary. Surprisingly, the price of the convertible bond is not necessarily monotonic in time: it may even increase when time approaches maturity.
In this position paper we argue that certain aspects of relevance assessment in the evaluation of IR systems are oversimplified and that human assessments represented by qrels should be augmented to take account of contextual factors and the subjectivity of the task at hand. We propose enhancing test collections used in evaluation with information related to human assessors and their interpretation of the task. Such augmented collections would provide a more realistic and user-focused evaluation, enabling us to better understand the evaluation process, the performance of systems and user interactions. A first step is to conduct user studies to examine in more detail what people actually do when we ask them to judge the relevance of a document.
1. Predicting space use patterns of animals from their interactions with the environment is fundamental for understanding the effect of habitat changes on ecosystem functioning. Recent attempts to address this problem have sought to unify resource selection analysis, where animal space use is derived from available habitat quality, and mechanistic movement models, where detailed movement processes of an animal are used to predict its emergent utilization distribution. Such models bias the animal's movement towards patches that are easily available and resource-rich, and the result is a predicted probability density at a given position being a function of the habitat quality at that position. However, in reality, the probability that an animal will use a patch of the terrain tends to be a function of the resource quality in both that patch and the surrounding habitat. 2. We propose a mechanistic model where this non-local effect of resources naturally emerges from the local movement processes, by taking into account the relative utility of both the habitat where the animal currently resides and that of where it is moving. We give statistical techniques to parametrize the model from location data and demonstrate application of these techniques to GPS data of caribou in Newfoundland. 3. Steady-state animal probability distributions arising from the model have complex patterns that cannot be expressed simply as a function of the local quality of the habitat. In particular, large areas of good habitat are used more intensively than smaller patches of equal quality habitat, whereas isolated patches are used less frequently. 4. Whilst we focus on habitats in this study, our modelling framework can be readily used with any environmental covariates and therefore represents a unification of mechanistic modelling and step selection approaches to understanding animal space use.
The ability to acquire large-scale recordings of neuronal activity in awake and unrestrained animals poses a major challenge for studying neural coding of animal behavior. We present a new instrument capable of recording intracellular calcium transients from every neuron in the head of a freely behaving C. elegans with cellular resolution while simultaneously recording the animal's position, posture and locomotion. We employ spinning-disk confocal microscopy to capture 3D volumetric fluorescent images of neurons expressing the calcium indicator GCaMP6s at 5 head-volumes per second. Two cameras simultaneously monitor the animal's position and orientation. Custom software tracks the 3D position of the animal's head in real-time and adjusts a motorized stage to keep it within the field of view as the animal roams freely. We observe calcium transients from 78 neurons and correlate this activity with the animal's behavior. Across worms, multiple neurons show significant correlations with modes of behavior corresponding to forward, backward, and turning locomotion. By comparing the 3D positions of these neurons with a known atlas, our results are consistent with previous single-neuron studies and demonstrate the existence of new candidate neurons for behavioral circuits.
We examine the possibility of incorporating information or views of market movements during the holding period of a portfolio, in the hedging of European options with respect to the underlying. Given a fixed holding period interval, we explore whether it is possible to adjust the number of shares needed to effectively hedge our position to account for views on market dynamics from present until the end of our interval, to account for the time-dependence of the options' sensitivity to the underlying. We derive an analytical expression for the number of shares needed by adjusting the standard Black-Scholes-Merton $\Delta$ quantity, in the case of an arbitrary process for implied volatility, and we present numerical results.
Peer recommendation is a crowdsourcing task that leverages the opinions of many to identify interesting content online, such as news, images, or videos. Peer recommendation applications often use social signals, e.g., the number of prior recommendations, to guide people to the more interesting content. How people react to social signals, in combination with content quality and its presentation order, determines the outcomes of peer recommendation, i.e., item popularity. Using Amazon Mechanical Turk, we experimentally measure the effects of social signals in peer recommendation. Specifically, after controlling for variation due to item content and its position, we find that social signals affect item popularity about half as much as position and content do. These effects are somewhat correlated, so social signals exacerbate the "rich get richer" phenomenon, which results in a wider variance of popularity. Further, social signals change individual preferences, creating a "herding" effect that biases people's judgments about the content. Despite this, we find that social signals improve the efficiency of peer recommendation by reducing the effort devoted to evaluating content while maintaining recommendation quality.
We present a method of hedging Conditional Value at Risk of a position in stock using put options. The result leads to a linear programming problem that can be solved to optimise risk hedging.
In this paper, we explore a process called neural teleportation, a mathematical consequence of applying quiver representation theory to neural networks. Neural teleportation "teleports" a network to a new position in the weight space and preserves its function. This phenomenon comes directly from the definitions of representation theory applied to neural networks and it turns out to be a very simple operation that has remarkable properties. We shed light on surprising and counter-intuitive consequences neural teleportation has on the loss landscape. In particular, we show that teleportation can be used to explore loss level curves, that it changes the local loss landscape, sharpens global minima and boosts back-propagated gradients at any moment during the learning process. Our results can be reproduced with the code available here: https://github.com/vitalab/neuralteleportation
Air quality has major impact on a country's socio-economic position and identifying major air pollution sources is at the heart of tackling the issue. Spatially and temporally distributed air quality data acquisition across a country as varied as India has been a challenge to such analysis. The launch of the Sentinel-5P satellite has helped in the observation of a wider variety of air pollutants than measured before at a global scale on a daily basis. In this chapter, spatio-temporal multi pollutant data retrieved from Sentinel-5P satellite is used to cluster states as well as districts in India and associated average monthly pollution signature and trends depicted by each of the clusters are derived and presented.The clustering signatures can be used to identify states and districts based on the types of pollutants emitted by various pollution sources.
Commonsense generation aims at generating plausible everyday scenario description based on a set of provided concepts. Digging the relationship of concepts from scratch is non-trivial, therefore, we retrieve prototypes from external knowledge to assist the understanding of the scenario for better description generation. We integrate two additional modules, namely position indicator and scaling module, into the pretrained encoder-decoder model for prototype modeling to enhance the knowledge injection procedure. We conduct experiment on CommonGen benchmark, and experimental results show that our method significantly improves the performance on all the metrics.
Garment representation, editing and animation are challenging topics in the area of computer vision and graphics. It remains difficult for existing garment representations to achieve smooth and plausible transitions between different shapes and topologies. In this work, we introduce, DeepCloth, a unified framework for garment representation, reconstruction, animation and editing. Our unified framework contains 3 components: First, we represent the garment geometry with a "topology-aware UV-position map", which allows for the unified description of various garments with different shapes and topologies by introducing an additional topology-aware UV-mask for the UV-position map. Second, to further enable garment reconstruction and editing, we contribute a method to embed the UV-based representations into a continuous feature space, which enables garment shape reconstruction and editing by optimization and control in the latent space, respectively. Finally, we propose a garment animation method by unifying our neural garment representation with body shape and pose, which achieves plausible garment animation results leveraging the dynamic information encoded by our shape and style representation, even under drastic garment editing operations. To conclude, with DeepCloth, we move a step forward in establishing a more flexible and general 3D garment digitization framework. Experiments demonstrate that our method can achieve state-of-the-art garment representation performance compared with previous methods.
Generation of stroke-based non-photorealistic imagery, is an important problem in the computer vision community. As an endeavor in this direction, substantial recent research efforts have been focused on teaching machines "how to paint", in a manner similar to a human painter. However, the applicability of previous methods has been limited to datasets with little variation in position, scale and saliency of the foreground object. As a consequence, we find that these methods struggle to cover the granularity and diversity possessed by real world images. To this end, we propose a Semantic Guidance pipeline with 1) a bi-level painting procedure for learning the distinction between foreground and background brush strokes at training time. 2) We also introduce invariance to the position and scale of the foreground object through a neural alignment model, which combines object localization and spatial transformer networks in an end to end manner, to zoom into a particular semantic instance. 3) The distinguishing features of the in-focus object are then amplified by maximizing a novel guided backpropagation based focus reward. The proposed agent does not require any supervision on human stroke-data and successfully handles variations in foreground object attributes, thus, producing much higher quality canvases for the CUB-200 Birds and Stanford Cars-196 datasets. Finally, we demonstrate the further efficacy of our method on complex datasets with multiple foreground object instances by evaluating an extension of our method on the challenging Virtual-KITTI dataset. Source code and models are available at https://github.com/1jsingh/semantic-guidance.