This paper presents a technology of sensing hidden vehicles by exploiting multi-path vehicle-to-vehicle (V2V) communication. This overcomes the limitation of existing RADAR technologies that requires line-of-sight (LoS), thereby enabling more intelligent manoeuvre in autonomous driving and improving its safety. The proposed technology relies on transmission of orthogonal waveforms over different antennas at the target (hidden) vehicle. Even without LoS, the resultant received signal enables the sensing vehicle to detect the position, shape, and driving direction of the hidden vehicle by jointly analyzing the geometry (AoA/AoD/propagation distance) of individual propagation path. The accuracy of the proposed technique is validated by realistic simulation including both highway and rural scenarios.
Ptychography, a form of Coherent Diffractive Imaging, is used with short wavelengths (e.g. X-rays, electron beams) to achieve high-resolution image reconstructions. One of the limiting factors for the reconstruction quality is the accurate knowledge of the illumination probe positions. Recently, many advances have been made to relax the requirement for the probe positions accuracy. Here, we analyze and demonstrate a straightforward approach that can be used to correct the probe positions with sub-pixel accuracy. Simulations and experimental results with visible light are presented in this work.
Adaptive algorithm based on multi-channel linear prediction is an effective dereverberation method balancing well between the attenuation of the long-term reverberation and the dereverberated speech quality. However, the abrupt change of the speech source position, usually caused by the shift of the speakers, forms an obstacle to the adaptive algorithm and makes it difficult to guarantee both the fast convergence speed and the optimal steady-state behavior. In this paper, the RLS-based adaptive multi-channel linear prediction method is investigated and a time-varying forgetting factor based on the relative weighted change of the adaptive filter coefficients is proposed to effectively tracing the abrupt change of the target speaker position. The advantages of the proposed scheme are demonstrated in the simulations and experiments.
Sensor fusion of a MEMS IMU with a magnetometer is a popular system design, because such 9-DoF (degrees of freedom) systems are capable of achieving drift-free 3D orientation tracking. However, these systems are often vulnerable to ambient magnetic distortions and lack useful position information; in the absence of external position aiding (e.g. satellite/ultra-wideband positioning systems) the dead-reckoned position accuracy from a 9-DoF MEMS IMU deteriorates rapidly due to unmodelled errors. Positioning information is valuable in many satellite-denied geomatics applications (e.g. indoor navigation, location-based services, etc.). This paper proposes an improved 9-DoF IMU indoor pose tracking method using batch optimization. By adopting a robust in-situ user self-calibration approach to model the systematic errors of the accelerometer, gyroscope, and magnetometer simultaneously in a tightly-coupled post-processed least-squares framework, the accuracy of the estimated trajectory from a 9-DoF MEMS IMU can be improved. Through a combination of relative magnetic measurement updates and a robust weight function, the method is able to tolerate a high level of magnetic distortions. The proposed auto-calibration method was tested in-use under various heterogeneous magnetic field conditions to mimic a person walking with the sensor in their pocket, a person checking their phone, and a person walking with a smartwatch. In these experiments, the presented algorithm improved the in-situ dead-reckoning orientation accuracy by 79.8 - 89.5% and the dead-reckoned positioning accuracy by 72.9 - 92.8%, thus reducing the relative positioning error from metre-level to decimetre-level after ten seconds of integration, without making assumptions about the user's dynamics.
We consider a stochastic game between a trader and a central bank in a target zone market with a lower currency peg. This currency peg is maintained by the central bank through the generation of permanent price impact, thereby aggregating an ever increasing risky position in foreign reserves. We describe this situation mathematically by means of two coupled singular control problems, where the common singularity arises from a local time along a random curve. Our first result identifies a certain local time as that central bank strategy for which this risk position is minimized. We then consider the worst-case situation the central bank may face by identifying that strategy of the strategic investor that maximizes the expected inventory of the central bank under a cost criterion, thus establishing a Stackelberg equilibrium in our model.
In the field of localization the linear least square solution is frequently used. This solution is compared to nonlinear solvers more effected by noise, but able to provide a position estimation without the knowledge of any starting condition. The linear least square solution is able to minimize Gaussian noise by solving an overdetermined equation with the MoorePenrose pseudoinverse. Unfortunately this solution fails if it comes to non Gaussian noise. This publication presents a direct solution which is able to use prefiltered data for the LPM (RNL) equation. The used input for the linear position estimation will not be the raw data but over the time filtered data, for this reason this solution will be called direct solution. It will be shown that the presented symmetrical direct solution is superior to non symmetrical direct solution and especially to the not prefiltered linear least square solution.
Whether you trade futures for yourself or a hedge fund, your strategy is counted. Long and short position limits make the number of unique strategies finite. Formulas of the numbers of strategies, transactions, do nothing actions are derived. A discrete distribution of actions, corresponding probability mass, cumulative distribution and characteristic functions, moments, extreme values are presented. Strategies time slice distributions are determined. Vector properties of trading strategies are studied. Algebraic not associative, commutative, initial magmas with invertible elements control trading positions and strategies. Maximum profit strategies, MPS, and optimal trading elements can define trading patterns. Dynkin introduced the term interpreted in English as "Markov time" in 1963. Neftci applied it for the formalization of Technical Analysis in 1991.
We analyze the Rybczynski sign pattern, which expresses the factor endowment - commodity output relationships in a three-factor, two-good general equilibrium trade model. The relationship determines whether a strong Rybczynski result holds. We search for a sufficient condition for each Rybczynski sign pattern to hold in a systematic manner, which no other studies have derived. We assume factor-intensity ranking is constant. We use the EWS (economy-wide substitution)-ratio vector and the Hadamard product in our analysis. We show that the position of the EWS-ratio vector determines the Rybczynski sign pattern. This article provides a basis for further applications.
We analyze the effects of energy and commodity prices on commodity output using a three-factor, two-good general equilibrium trade model with three factors: capital, labor, and imported energy. We derive a sufficient condition for each sign pattern of each relationship to hold, which no other studies have derived. We assume factor-intensity ranking is constant and use the EWS (economy-wide substitution)-ratio vector and the Hadamard product in the analysis. The results reveal that the position of the EWS-ratio vector determines the relationships. Specifically, the strengthening (resp. reduction) of import restrictions can increase (resp. decrease) the commodity output of exportables, if capital and labor, domestic factors, are economy-wide complements. This seems paradoxical.
We propose and analyze a mathematical model of cargo transport by non-processive molecular motors. In our model, the motors change states by random discrete events (corresponding to stepping and binding/unbinding), while the cargo position follows a stochastic differential equation (SDE) that depends on the discrete states of the motors. The resulting system for the cargo position is consequently an SDE that randomly switches according to a Markov jump process governing motor dynamics. To study this system we (1) cast the cargo position in a renewal theory framework and generalize the renewal reward theorem and (2) decompose the continuous and discrete sources of stochasticity and exploit a resulting pair of disparate timescales. With these mathematical tools, we obtain explicit formulas for experimentally measurable quantities, such as cargo velocity and run length. Analyzing these formulas then yields some predictions regarding so-called non-processive clustering, the phenomenon that a single motor cannot transport cargo, but that two or more motors can. We find that having motor stepping, binding, and unbinding rates depend on the number of bound motors, due to geometric effects, is necessary and sufficient to explain recent experimental data on non-processive motors.
Is it possible to recover the position of a source from the steady-state fluxes of Brownian particles to small absorbing windows located on the boundary of a domain? To address this question, we develop a numerical procedure to avoid tracking Brownian trajectories in the entire infinite space. Instead, we generate particles near the absorbing windows, computed from the analytical expression of the exit probability. When the Brownian particles are generated by a steady-state gradient at a single point, we compute asymptotically the fluxes to small absorbing holes distributed on the boundary of half-space and on a disk in two dimensions, which agree with stochastic simulations. We also derive an expression for the splitting probability between small windows using the matched asymptotic method. Finally, when there are more than two small absorbing windows, we show how to reconstruct the position of the source from the diffusion fluxes. The present approach provides a computational first principle for the mechanism of sensing a gradient of diffusing particles, a ubiquitous problem in cell biology.
We consider hedging of a contingent claim by a 'semi-static' strategy composed of a dynamic position in one asset and static (buy-and-hold) positions in other assets. We give general representations of the optimal strategy and the hedging error under the criterion of variance-optimality and provide tractable formulas using Fourier-integration in case of the Heston model. We also consider the problem of optimally selecting a sparse semi-static hedging strategy, i.e. a strategy which only uses a small subset of available hedging assets. The developed methods are illustrated in an extended numerical example where we compute a sparse semi-static hedge for a variance swap using European options as static hedging assets.
In this position paper, we question the current practice of calculating evaluation metrics for recommender systems as single numbers (e.g. precision p=.28 or mean absolute error MAE = 1.21). We argue that single numbers express only average effectiveness over a usually rather long period (e.g. a year or even longer), which provides only a vague and static view of the data. We propose that recommender-system researchers should instead calculate metrics for time-series such as weeks or months, and plot the results in e.g. a line chart. This way, results show how algorithms' effectiveness develops over time, and hence the results allow drawing more meaningful conclusions about how an algorithm will perform in the future. In this paper, we explain our reasoning, provide an example to illustrate our reasoning and present suggestions for what the community should do next.
Financial undertakings often have to deal with liabilities of the form 'non-hedgeable claim size times value of a tradeable asset', e.g. foreign property insurance claims times fx rates. Which strategy to invest in the tradeable asset is risk minimal? We generalize the Gram-Charlier series for the sum of two dependent random variable, which allows us to expand the capital requirements based on value-at-risk and expected shortfall. We derive a stable and fairly model independent approximation of the risk minimal asset allocation in terms of the claim size distribution and the moments of asset return. The results enable a correct and easy-to-implement modularization of capital requirements into a market risk and a non-hedgeable risk component.
In this work, we study a dynamic portfolio optimization problem related to pairs trading, which is an investment strategy that matches a long position in one security with a short position in another security with similar characteristics. The relationship between pairs, called a spread, is modeled by a Gaussian mean-reverting process whose drift rate is modulated by an unobservable continuous-time, finite-state Markov chain. Using the classical stochastic filtering theory, we reduce this problem with partial information to the one with full information and solve it for the logarithmic utility function, where the terminal wealth is penalized by the riskiness of the portfolio according to the realized volatility of the wealth process. We characterize optimal dollar-neutral strategies as well as optimal value functions under full and partial information and show that the certainty equivalence principle holds for the optimal portfolio strategy. Finally, we provide a numerical analysis for a toy example with a two-state Markov chain.
In recent years, the counterparty credit risk measure, namely the default risk in \emph{Over The Counter} (OTC) derivatives contracts, has received great attention by banking regulators, specifically within the frameworks of \emph{Basel II} and \emph{Basel III.} More explicitly, to obtain the related risk figures, one has first obliged to compute intermediate output functionals related to the \emph{Mark-to-Market} (MtM) position at a given time $t \in [0, T],$ T being a positive, and finite, time horizon. The latter implies an enormous amount of computational effort is needed, with related highly time consuming procedures to be carried out, turning out into significant costs. To overcome latter issue, we propose a smart exploitation of the properties of the (local) time spent by the Brownian motion close to a given value.
The purpose of this paper is to provide a confession of sorts from an economist to political science and philosophy. A confession of the weaknesses of the political position of the economist. It is intended as a guide for political scientists and philosophers to the ostensible policy criteria of economics, and an illustration of an argument that demonstrates logico-mathematically, therefore incontrovertibly, that any policy statement by an economist contains, or is, a political statement. It develops an inescapable compulsion that the absolute primacy and priority of political theory and philosophy in the development of policy criteria must be recognised. Economic policy cannot be divorced from politics as a matter of mathematical fact, and rather, as Amartya Sen has done, it ought embrace political theory and philosophy.
We study several optimal stopping problems that arise from trading a mean-reverting price spread over a finite horizon. Modeling the spread by the Ornstein-Uhlenbeck process, we analyze three different trading strategies: (i) the long-short strategy; (ii) the short-long strategy, and (iii) the chooser strategy, i.e. the trader can enter into the spread by taking either long or short position. In each of these cases, we solve an optimal double stopping problem to determine the optimal timing for starting and subsequently closing the position. We utilize the local time-space calculus of Peskir (2005a) and derive the nonlinear integral equations of Volterra-type that uniquely char- acterize the boundaries associated with the optimal timing decisions in all three problems. These integral equations are used to numerically compute the optimal boundaries.
Discussions of the hippocampus often focus on place cells, but many neurons are not place cells in any given environment. Here we describe the collective activity in such mixed populations, treating place and non-place cells on the same footing. We start with optical imaging experiments on CA1 in mice as they run along a virtual linear track, and use maximum entropy methods to approximate the distribution of patterns of activity in the population, matching the correlations between pairs of cells but otherwise assuming as little structure as possible. We find that these simple models accurately predict the activity of each neuron from the state of all the other neurons in the network, regardless of how well that neuron codes for position. These and other results suggest that place cells are not a distinct sub-network, but part of a larger system that encodes, collectively, more than just place information.
Single molecule detection, sequencing and conformational mapping of aptamers are important for improving medical and biosensing technologies and for better understanding of biological processes at the molecular level. We obtain vibrational signals of single aptamers immobilized on gold substrates using tip-enhanced Raman spectroscopy (TERS). We compare topographic and optical signals and investigate the fluctuations of the position-dependent TERS spectra. TERS mapping provides information about the chemical composition and conformation of aptamers, and paves the way to future single-molecule label-free sequencing.