Recent advances in sound engineering have led to the development of so-called streamlined music designed to reduce exogenous attention and improve endogenous attention. Although anecdotal reports suggest that streamlined music does indeed improve focus on daily work tasks and may improve mood, the specific influences of streamlined music on cognition and mood have yet to be examined. In this paper, we report the results of a series of online experiments that examined the impact of one form of streamlined music on cognition and mood. The tested form of streamlined music, which was tested primarily by listeners who felt they benefited from this type of music, significantly outperformed plain music on measures of perceived focus, task persistence, precognition, and creative thinking, with borderline effects on mood. In contrast, this same form of streamlined music did not significantly influence measures assessing visual attention, verbal memory, logical thinking, self-efficacy, perceived stress, or self-transcendence. We also found that improvements in perceived focus over a 2-month period were correlated with improvements in emotional state, including mood. Overall the results suggest that at least for individuals who enjoy using streamlined music as a focus tool, streamlined music can have a beneficial impact on cognition without any obvious costs, while at the same time it may potentially boost mood.
A major area in neuroscience research is the study of how the brain processes spatial information. Neurons in the brain represent external stimuli via neural codes. These codes often arise from stereotyped stimulus-response maps, associating to each neuron a convex receptive field. An important problem consists in determining what stimulus space features can be extracted directly from a neural code. The neural ideal is an algebraic object that encodes the full combinatorial data of a neural code. This ideal can be expressed in a canonical form that directly translates to a minimal description of the receptive field structure intrinsic to the code. In here, we describe a SageMath package that contains several algorithms related to the canonical form of a neural ideal.
Worst-case risk measures refer to the calculation of the largest value for risk measures when only partial information of the underlying distribution is available. For the popular risk measures such as Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR), it is now known that their worst-case counterparts can be evaluated in closed form when only the first two moments are known for the underlying distribution. These results are remarkable since they not only simplify the use of worst-case risk measures but also provide great insight into the connection between the worst-case risk measures and existing risk measures. We show in this paper that somewhat surprisingly similar closed-form solutions also exist for the general class of law invariant coherent risk measures, which consists of spectral risk measures as special cases that are arguably the most important extensions of CVaR. We shed light on the one-to-one correspondence between a worst-case law invariant risk measure and a worst-case CVaR (and a worst-case VaR), which enables one to carry over the development of worst-case VaR in the context of portfolio optimization to the worst-case law invariant risk measures immediately.
A new multivariate distribution possessing arbitrarily parametrized and positively dependent univariate Pareto margins is introduced. Unlike the probability law of Asimit et al. (2010) [Asimit, V., Furman, E. and Vernic, R. (2010) On a multivariate Pareto distribution. Insurance: Mathematics and Economics 46(2), 308-316], the structure in this paper is absolutely continuous with respect to the corresponding Lebesgue measure. The distribution is of importance to actuaries through its connections to the popular frailty models, as well as because of the capacity to describe dependent heavy-tailed risks. The genesis of the new distribution is linked to a number of existing probability models, and useful characteristic results are proved. Expressions for, e.g., the decumulative distribution and probability density functions, (joint) moments and regressions are developed. The distributions of minima and maxima, as well as, some weighted risk measures are employed to exemplify possible applications of the distribution in insurance.
Defined on Birman-Ko-Lee monoids, the rotating normal form has strong connections with the Dehornoy's braid ordering. It can be seen as a process for selecting between all the representative words of a Birman-Ko-Lee braid a particular one, called rotating word. In this paper we construct, for all n 2, a finite-state automaton which recognizes rotating words on n strands, proving that the rotating normal form is regular. As a consequence we obtain the regularity of a $\sigma$-definite normal form defined on the whole braid group.
Urban environments develop complex, non-obvious structures that are often hard to represent in the form of maps or guides. Finding the right place to go often requires intimate familiarity with the location in question and cannot easily be deduced by visitors. In this work, we exploit large-scale samples of usage information, in the form of mobile phone traces and geo-tagged Twitter messages in order to automatically explore and annotate city maps via kernel density estimation. Our experiments are based on one year's worth of mobile phone activity collected by Nokia's Mobile Data Challenge (MDC). We show that usage information can be a strong predictor of semantic place categories, allowing us to automatically annotate maps based on the behavior of the local user base.
Humans can effortlessly recognize others' actions in the presence of complex transformations, such as changes in viewpoint. Several studies have located the regions in the brain involved in invariant action recognition, however, the underlying neural computations remain poorly understood. We use magnetoencephalography (MEG) decoding and a dataset of well-controlled, naturalistic videos of five actions (run, walk, jump, eat, drink) performed by different actors at different viewpoints to study the computational steps used to recognize actions across complex transformations. In particular, we ask when the brain discounts changes in 3D viewpoint relative to when it initially discriminates between actions. We measure the latency difference between invariant and non-invariant action decoding when subjects view full videos as well as form-depleted and motion-depleted stimuli. Our results show no difference in decoding latency or temporal profile between invariant and non-invariant action recognition in full videos. However, when either form or motion information is removed from the stimulus set, we observe a decrease and delay in invariant action decoding. Our results suggest that the brain recognizes actions and builds invariance to complex transformations at the same time, and that both form and motion information are crucial for fast, invariant action recognition.
Participant needs to achieve a given power are frequently underestimated. This is particularly problematic when effect sizes are small, such as is common in neuroscience and psychology. We provide tools to make these demands immediately obvious in the form of a powerscape visualization.
Time kinetics of interaction of natural graphite (GR) to colloidal graphene (G) collagen (C) nanocomposites was studied at ambient conditions, and observed that just one day at ambient conditions is enough to form colloidal graphene directly from graphite using the protein collagen. Neither controlled temperature and pressure ambiance nor sonication was needed for the same; thereby rendering the process biomimetic. Detailed spectroscopy, X ray diffraction, electron microscopy as well as fluorescence and luminescence assisted characterization of the colloidal dispersions on day one and day seven reveals graphene and collagen interaction and subsequent rearrangement to form an open structure. Detailed confocal microscopy, in the liquid state, reveals the initial attack at the zigzag edges of GR, the enhancement of auto fluorescence and finally the opening up of graphitic stacks of GR to form near transparent G. Atomic Force Microscopy studies prove the existence of both collagen and graphene and the disruption of periodicity at the atomic level. Thermal conductivity of the colloid shows a 17% enhancement for a volume fraction of less than 0.00005 of G. Time variant increase in thermal conductivity provides qualitative evidence for the transient exfoliation of GR to G. The composite reveals interesting properties that could propel it as a future material for advanced bio applications including therapeutics.
We show that equilibria of a sequential semi-anonymous nonatomic game (SSNG) can be adopted by players in corresponding large but finite dynamic games to achieve near-equilibrium payoffs. Such equilibria in the form of random state-to-action rules are parsimonious in form and easy to execute, as they are both oblivious of past history and blind to other players' present states. Our transient results can be extended to a stationary case, where the finite counterparts are special discounted stochastic games. The kind of equilibria we adopt for SSNG are similar to distributional equilibria that are well understood in literature, and they themselves are shown to exist.
Web is a wide term which mainly consists of surface web and hidden web. One can easily access the surface web using traditional web crawlers, but they are not able to crawl the hidden portion of the web. These traditional crawlers retrieve contents from web pages, which are linked by hyperlinks ignoring the information hidden behind form pages, which cannot be extracted using simple hyperlink structure. Thus, they ignore large amount of data hidden behind search forms. This paper emphasizes on the extraction of hidden data behind html search forms. The proposed technique makes use of semantic mapping to fill the html search form using domain specific database. Using semantics to fill various fields of a form leads to more accurate and qualitative data extraction.
Based on the concept of self-decomposable random variables we discuss the application of a model for a pair of dependent Poisson processes to energy facilities. Due to the resulting structure of the jump events we can see the self-decomposability as a form of cointegration among jumps. In the context of energy facilities, the application of our approach to model power or gas dynamics and to evaluate transportation assets seen as spread options is straightforward. We study the applicability of our methodology first assuming a Merton market model with two underlying assets; in a second step we consider price dynamics driven by an exponential mean-reverting Geometric Ornstein-Uhlenbeck plus compound Poisson that are commonly used in the energy field. In this specific case we propose a price spot dynamics for each underlying that has the advantage of being treatable to find non-arbitrage conditions. In particular we can find close-form formulas for vanilla options so that the price and the Greeks of spread options can be calculated in close form using the Margrabe formula (if the strike is zero) or some other well known approximation.
One popular approach to model the limit order books dynamics of the best bid and ask at level-1 is to use the reduced-form diffusion approximations. It is well known that the biggest contributing factor to the price movement is the imbalance of the best bid and ask. We investigate the data of the level-1 limit order books of a basket of stocks and study the numerical evidence of drift, correlation, volatility and their dependence on the imbalance. Based on the numerical discoveries, we develop a nonparametric discrete model for the dynamics of the best bid and ask, which can be approximated by a reduced-form model with analytical tractability that can fit the empirical data of correlation, volatilities and probability of price movement simultaneously.
We present generalized delayed neural network (DNN) model with positive delay feedback and neuron history. The local stability analysis around trivial local equilibria of delayed neural networks has applied and determine the conditions for the existence of zero root. We develop few innovative delayed neural network models in different dimensions through transformation and extension of some existing models. We found that zero root can have multiplicity two under certain conditions. We further show how the characteristic equation can have zero root and its multiplicity is dependent on the conditions undertaken. Finally, we generalize the neural network of $N$ neurons through which we determine the general form of Jacobian of the linear form and corresponding characteristic equation of the system.
This paper introduces the Inverse Gamma (IGa) stochastic volatility model with time-dependent parameters, defined by the volatility dynamics $dV_{t}=\kappa_{t}\left(\theta_{t}-V_{t}\right)dt+\lambda_{t}V_{t}dB_{t}$. This non-affine model is much more realistic than classical affine models like the Heston stochastic volatility model, even though both are as parsimonious (only four stochastic parameters). Indeed, it provides more realistic volatility distribution and volatility paths, which translate in practice into more robust calibration and better hedging accuracy, explaining its popularity among practitioners. In order to price vanilla options with IGa volatility, we propose a closed-form volatility-of-volatility expansion. Specifically, the price of a European put option with IGa volatility is approximated by a Black-Scholes price plus a weighted combination of Black-Scholes greeks, where the weights depend only on the four time-dependent parameters of the model. This closed-form pricing method allows for very fast pricing and calibration to market data. The overall quality of the approximation is very good, as shown by several calibration tests on real-world market data where expansion prices are compared favorably with Monte Carlo simulation results. This paper shows that the IGa model is as simple, more realistic, easier to implement and faster to calibrate than classical transform-based affine models. We therefore hope that the present work will foster further research on non-affine models like the Inverse Gamma stochastic volatility model, all the more so as this robust model is of great interest to the industry.
This paper proposes a target zones exchange rate model with a terminal condition of entering a currency zone. It is assumed that the exchange rate is a function of the fundamental and time. Another essential assumptions of the model is that the fundamental process is bounded inside a band and that terminal condition for the exchange rate holds. The fundamental is specified in two ways: as a regulated Brownian motion and Ornstein-Uhlenbeck processes. For the case of the Brownian motion process the closed form solution of the problem is obtained, whereas for the Ornstein-Uhlenbeck process the closed form solution does not exist, therefore we had to use numerical method for solving of the problem. Both specifications are compared numerically.
Most of the empirical studies on stochastic volatility dynamics favor the 3/2 specification over the square-root (CIR) process in the Heston model. In the context of option pricing, the 3/2 stochastic volatility model is reported to be able to capture the volatility skew evolution better than the Heston model. In this article, we make a thorough investigation on the analytic tractability of the 3/2 stochastic volatility model by proposing a closed-form formula for the partial transform of the triple joint transition density $(X,I,V)$ which stand for the log asset price, the quadratic variation (continuous realized variance) and the instantaneous variance, respectively. Two distinct formulations are provided for deriving the main result. The closed-form partial transform enables us to deduce a variety of marginal partial transforms and characteristic functions and plays a crucial role in pricing discretely sampled variance derivatives and exotic options that depend on both the asset price and quadratic variation. Various applications and numerical examples on pricing exotic derivatives with discrete monitoring feature are given to demonstrate the versatility of the partial transform under the 3/2 model.
Interval jitter and spike resampling methods are used to analyze the time scale on which temporal correlations occur. They allow the computation of jitter corrected cross correlograms and the performance of an associated statistically robust hypothesis test to decide whether observed correlations at a given time scale are significant. Currently used Monte Carlo methods approximate the probability distribution of coincidences. They require generating $N_{\rm MC}$ simulated spike trains of length $T$ and calculating their correlation with another spike train up to lag $\tau_{\max}$. This is computationally costly $O(N_{\rm MC} \times T \times \tau_{\max})$ and it introduces errors in estimating the $p$ value. Instead, we propose to compute the distribution in closed form, with a complexity of $O(C_{\max} \log(C_{\max}) \tau_{\max})$, where $C_{\max}$ is the maximum possible number of coincidences. All results are then exact rather than approximate, and as a consequence, the $p$-values obtained are the theoretically best possible for the available data and test statistic. In addition, simulations with realistic parameters predict a speed increase over Monte Carlo methods of two orders of magnitude for hypothesis testing, and four orders of magnitude for computing the full jitter-corrected cross correlogram.
Stochastic dynamics govern many important processes in cellular biology, and an underlying theoretical approach describing these dynamics is desirable to address a wealth of questions in biology and medicine. Mathematical tools exist for treating several important examples of these stochastic processes, most notably gene expression, and random partitioning at single cell divisions or after a steady state has been reached. Comparatively little work exists exploring different and specific ways that repeated cell divisions can lead to stochastic inheritance of unequilibrated cellular populations. Here we introduce a mathematical formalism to describe cellular agents that are subject to random creation, replication, and/or degradation, and are inherited according to a range of random dynamics at cell divisions. We obtain closed-form generating functions describing systems at any time after any number of cell divisions for binomial partitioning and divisions provoking a deterministic or random, subtractive or additive change in copy number, and show that these solutions agree exactly with stochastic simulation. We apply this general formalism to several example problems involving the dynamics of mitochondrial DNA (mtDNA) during development and organismal lifetimes.
Probability density function of output interspike intervals is found in exact form for leaky integrate and fire neuron stimulated with Poisson stream. The diffusion approximation is not exploited.