The free multiplicative Brownian motion
Emergent trends in the device development for neural prosthetics have focused on establishing stimulus localization, improving longevity through immune compatibility, reducing energy requirements, and embedding active control in the devices. Ultrasound stimulation can singlehandedly address several of these challenges. Ultrasonic stimulus of neurons has been studied extensively from 100 kHz to 10 MHz, with high penetration but less localization. In this paper, a chipscale device consisting of piezoelectric Aluminum Nitride ultrasonic transducers was engineered to deliver gigahertz (GHz) ultrasonic stimulus to the human neural cells. These devices provide a path towards complementary metal oxide semiconductor (CMOS) integration towards fully controllable neural devices. At GHz frequencies, ultrasonic wavelengths in water are a few microns and have an absorption depth of 10–20
 Award ID(s):
 1744271
 Publication Date:
 NSFPAR ID:
 10154066
 Journal Name:
 Scientific Reports
 Volume:
 10
 Issue:
 1
 ISSN:
 20452322
 Publisher:
 Nature Publishing Group
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract is the large$$b_{t}$$ ${b}_{t}$N limit of the Brownian motion on in the sense of$$\mathsf {GL}(N;\mathbb {C}),$$ $\mathrm{GL}(N\u037eC),$ distributions. The natural candidate for the large$$*$$ $\ast $N limit of the empirical distribution of eigenvalues is thus the Brown measure of . In previous work, the second and third authors showed that this Brown measure is supported in the closure of a region$$b_{t}$$ ${b}_{t}$ that appeared in the work of Biane. In the present paper, we compute the Brown measure completely. It has a continuous density$$\Sigma _{t}$$ ${\Sigma}_{t}$ on$$W_{t}$$ ${W}_{t}$ which is strictly positive and real analytic on$$\overline{\Sigma }_{t},$$ ${\overline{\Sigma}}_{t},$ . This density has a simple form in polar coordinates:$$\Sigma _{t}$$ ${\Sigma}_{t}$ where$$\begin{aligned} W_{t}(r,\theta )=\frac{1}{r^{2}}w_{t}(\theta ), \end{aligned}$$ $\begin{array}{c}{W}_{t}(r,\theta )=\frac{1}{{r}^{2}}{w}_{t}\left(\theta \right),\end{array}$ is an analytic function determined by the geometry of the region$$w_{t}$$ ${w}_{t}$ . We show also that the spectral measure of free unitary Brownian motion$$\Sigma _{t}$$ ${\Sigma}_{t}$ is a “shadow” of the Brown measure of$$u_{t}$$ ${u}_{t}$ , precisely mirroring the relationship between the circular and semicircular laws. We develop several new methods, based on stochastic differential equations and PDE, to prove these results.$$b_{t}$$ ${b}_{t}$ 
Abstract Hemiwicking is the phenomena where a liquid wets a textured surface beyond its intrinsic wetting length due to capillary action and imbibition. In this work, we derive a simple analytical model for hemiwicking in micropillar arrays. The model is based on the combined effects of capillary action dictated by interfacial and intermolecular pressures gradients within the curved liquid meniscus and fluid drag from the pillars at ultralow Reynolds numbers
. Fluid drag is conceptualized via a critical Reynolds number:$${\boldsymbol{(}}{{\bf{10}}}^{{\boldsymbol{}}{\bf{7}}}{\boldsymbol{\lesssim }}{\bf{Re}}{\boldsymbol{\lesssim }}{{\bf{10}}}^{{\boldsymbol{}}{\bf{3}}}{\boldsymbol{)}}$$ $\left({10}^{7}\lesssim \mathrm{Re}\lesssim {10}^{3}\right)$ , where$${\bf{Re}}{\boldsymbol{=}}\frac{{{\bf{v}}}_{{\bf{0}}}{{\bf{x}}}_{{\bf{0}}}}{{\boldsymbol{\nu }}}$$ $\mathrm{Re}=\frac{{v}_{0}{x}_{0}}{\nu}$v _{0}corresponds to the maximum wetting speed on a flat, dry surface andx _{0}is the extension length of the liquid meniscus that drives the bulk fluid toward the adsorbed thinfilm region. The model is validated with wicking experiments on different hemiwicking surfaces in conjunction withv _{0}andx _{0}measurements using Water , viscous FC70$${\boldsymbol{(}}{{\bf{v}}}_{{\bf{0}}}{\boldsymbol{\approx }}{\bf{2}}\,{\bf{m}}{\boldsymbol{/}}{\bf{s}}{\boldsymbol{,}}\,{\bf{25}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{\lesssim }}{{\bf{x}}}_{{\bf{0}}}{\boldsymbol{\lesssim }}{\bf{28}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{)}}$$ $\left({v}_{0}\approx 2\phantom{\rule{0ex}{0ex}}m/s,\phantom{\rule{0ex}{0ex}}25\phantom{\rule{0ex}{0ex}}\mu m\lesssim {x}_{0}\lesssim 28\phantom{\rule{0ex}{0ex}}\mu m\right)$ and lower viscosity Ethanol$${\boldsymbol{(}}{{\boldsymbol{v}}}_{{\bf{0}}}{\boldsymbol{\approx }}{\bf{0.3}}\,{\bf{m}}{\boldsymbol{/}}{\bf{s}}{\boldsymbol{,}}\,{\bf{18.6}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{\lesssim }}{{\boldsymbol{x}}}_{{\bf{0}}}{\boldsymbol{\lesssim }}{\bf{38.6}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{)}}$$ $\left({v}_{0}\approx 0.3\phantom{\rule{0ex}{0ex}}m/s,\phantom{\rule{0ex}{0ex}}18.6\phantom{\rule{0ex}{0ex}}\mu m\lesssim {x}_{0}\lesssim 38.6\phantom{\rule{0ex}{0ex}}\mu m\right)$ .$${\boldsymbol{(}}{{\boldsymbol{v}}}_{{\bf{0}}}{\boldsymbol{\approx }}{\bf{1.2}}\,{\bf{m}}{\boldsymbol{/}}{\bf{s}}{\boldsymbol{,}}\,{\bf{11.8}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{\lesssim }}{{\bf{x}}}_{{\bf{0}}}{\boldsymbol{\lesssim }}{\bf{33.3}}\,{\boldsymbol{\mu }}{\bf{m}}{\boldsymbol{)}}$$ $\left({v}_{0}\approx 1.2\phantom{\rule{0ex}{0ex}}m/s,\phantom{\rule{0ex}{0ex}}11.8\phantom{\rule{0ex}{0ex}}\mu m\lesssim {x}_{0}\lesssim 33.3\phantom{\rule{0ex}{0ex}}\mu m\right)$ 
Abstract In this paper, we study multistage stochastic mixedinteger nonlinear programs (MSMINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization with
nonLipschitzian value functions and multistage stochastic mixedinteger linear optimization. We develop stochastic dual dynamic programming (SDDP) type algorithms with nested decomposition, deterministic sampling, and stochastic sampling. The key ingredient is a new type of cuts based on generalized conjugacy. Several interesting classes of MSMINLP are identified, where the new algorithms are guaranteed to obtain the global optimum without the assumption of complete recourse. This significantly generalizes the classic SDDP algorithms. We also characterize the iteration complexity of the proposed algorithms. In particular, for a stage stochastic MINLP satisfying$$(T+1)$$ $(T+1)$L exact Lipschitz regularization withd dimensional state spaces, to obtain an optimal root node solution, we prove that the number of iterations of the proposed deterministic sampling algorithm is upper bounded by$$\varepsilon $$ $\epsilon $ , and is lower bounded by$${\mathcal {O}}((\frac{2LT}{\varepsilon })^d)$$ $O\left({\left(\frac{2LT}{\epsilon}\right)}^{d}\right)$ for the general case or by$${\mathcal {O}}((\frac{LT}{4\varepsilon })^d)$$ $O\left({\left(\frac{\mathrm{LT}}{4\epsilon}\right)}^{d}\right)$ for the convex case. This shows that the obtained complexity bounds are rather sharp. It also reveals that the iteration complexity depends$${\mathcal {O}}((\frac{LT}{8\varepsilon })^{d/21})$$ $O\left({\left(\frac{\mathrm{LT}}{8\epsilon}\right)}^{d/21}\right)$polynomially on the number of stages. We further show that the iteration complexity dependslinearly onT , if all the state spaces are finite sets, or ifmore » 
Abstract It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.
arXiv:2010.09793 ) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators associated to a domain$$L_{\beta ,\gamma } = {\text {div}}D^{d+1+\gamma n} \nabla $$ ${L}_{\beta ,\gamma}=\text{div}{D}^{d+1+\gamma n}\nabla $ with a uniformly rectifiable boundary$$\Omega \subset {\mathbb {R}}^n$$ $\Omega \subset {R}^{n}$ of dimension$$\Gamma $$ $\Gamma $ , the now usual distance to the boundary$$d < n1$$ $d<n1$ given by$$D = D_\beta $$ $D={D}_{\beta}$ for$$D_\beta (X)^{\beta } = \int _{\Gamma } Xy^{d\beta } d\sigma (y)$$ ${D}_{\beta}{\left(X\right)}^{\beta}={\int}_{\Gamma}{Xy}^{d\beta}d\sigma \left(y\right)$ , where$$X \in \Omega $$ $X\in \Omega $ and$$\beta >0$$ $\beta >0$ . In this paper we show that the Green function$$\gamma \in (1,1)$$ $\gamma \in (1,1)$G for , with pole at infinity, is well approximated by multiples of$$L_{\beta ,\gamma }$$ ${L}_{\beta ,\gamma}$ , in the sense that the function$$D^{1\gamma }$$ ${D}^{1\gamma}$ satisfies a Carleson measure estimate on$$\big  D\nabla \big (\ln \big ( \frac{G}{D^{1\gamma }} \big )\big )\big ^2$$ $D\nabla (ln(\frac{G}{{D}^{1\gamma}})){}^{2}$ . We underline that the strong and the weak results are different in nature and, of course, at the levelmore »$$\Omega $$ $\Omega $ 
Abstract We consider the problem of covering multiple submodular constraints. Given a finite ground set
N , a weight function ,$$w: N \rightarrow \mathbb {R}_+$$ $w:N\to {R}_{+}$r monotone submodular functions over$$f_1,f_2,\ldots ,f_r$$ ${f}_{1},{f}_{2},\dots ,{f}_{r}$N and requirements the goal is to find a minimum weight subset$$k_1,k_2,\ldots ,k_r$$ ${k}_{1},{k}_{2},\dots ,{k}_{r}$ such that$$S \subseteq N$$ $S\subseteq N$ for$$f_i(S) \ge k_i$$ ${f}_{i}\left(S\right)\ge {k}_{i}$ . We refer to this problem as$$1 \le i \le r$$ $1\le i\le r$MultiSubmodCover and it was recently considered by HarPeled and Jones (Few cuts meet many point sets. CoRR.arxiv:abs1808.03260 HarPeled and Jones 2018) who were motivated by an application in geometry. Even with$$r=1$$ $r=1$MultiSubmodCover generalizes the wellknown Submodular Set Cover problem (SubmodSC ), and it can also be easily reduced toSubmodSC . A simple greedy algorithm gives an approximation where$$O(\log (kr))$$ $O(log(kr\left)\right)$ and this ratio cannot be improved in the general case. In this paper, motivated by several concrete applications, we consider two ways to improve upon the approximation given by the greedy algorithm. First, we give a bicriteria approximation algorithm for$$k = \sum _i k_i$$ $k={\sum}_{i}{k}_{i}$MultiSubmodCover that covers each constraint to within a factor of while incurring an approximation of$$(11/e\varepsilon )$$ $(11/e\epsilon )$ in the cost. Second, we consider the special case when each$$O(\frac{1}{\epsilon }\log r)$$ $O(\frac{1}{\u03f5}logr)$ is a obtained from a truncated coverage function and obtain an algorithm that generalizes previous work on partial set cover ($$f_i$$ ${f}_{i}$PartialSC ), covering integer programs (CIPs ) and multiple vertex cover constraintsmore »