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
 NSFPAR ID:
 10154066
 Publisher / Repository:
 Nature Publishing Group
 Date Published:
 Journal Name:
 Scientific Reports
 Volume:
 10
 Issue:
 1
 ISSN:
 20452322
 Format(s):
 Medium: X
 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 A longstanding problem in mathematical physics is the rigorous derivation of the incompressible Euler equation from Newtonian mechanics. Recently, HanKwan and Iacobelli (Proc Am Math Soc 149:3045–3061, 2021) showed that in the monokinetic regime, one can directly obtain the Euler equation from a system of
N particles interacting in ,$${\mathbb {T}}^d$$ ${T}^{d}$ , via Newton’s second law through a$$d\ge 2$$ $d\ge 2$supercritical meanfield limit . Namely, the coupling constant in front of the pair potential, which is Coulombic, scales like$$\lambda $$ $\lambda $ for some$$N^{\theta }$$ ${N}^{\theta}$ , in contrast to the usual meanfield scaling$$\theta \in (0,1)$$ $\theta \in (0,1)$ . Assuming$$\lambda \sim N^{1}$$ $\lambda \sim {N}^{1}$ , they showed that the empirical measure of the system is effectively described by the solution to the Euler equation as$$\theta \in (1\frac{2}{d(d+1)},1)$$ $\theta \in (1\frac{2}{d(d+1)},1)$ . HanKwan and Iacobelli asked if their range for$$N\rightarrow \infty $$ $N\to \infty $ was optimal. We answer this question in the negative by showing the validity of the incompressible Euler equation in the limit$$\theta $$ $\theta $ for$$N\rightarrow \infty $$ $N\to \infty $ . Our proof is based on Serfaty’s modulatedenergy method, but compared to that of HanKwan and Iacobelli, crucially uses an improved “renormalized commutator” estimate to obtain the larger range for$$\theta \in (1\frac{2}{d},1)$$ $\theta \in (1\frac{2}{d},1)$ . Additionally, we show that for$$\theta $$ $\theta $ , one cannot, in general, expect convergence in the modulated energy notion of distance.$$\theta \le 1\frac{2}{d}$$ $\theta \le 1\frac{2}{d}$ 
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 if we seek a optimal solution when the state spaces are infinite sets, i.e. allowing the optimality gap to scale with$$(T\varepsilon )$$ $\left(T\epsilon \right)$T . To the best of our knowledge, this is the first work that reports global optimization algorithms as well as iteration complexity results for solving such a large class of multistage stochastic programs. The iteration complexity study resolves a conjecture by the late Prof. Shabbir Ahmed in the general setting of multistage stochastic mixedinteger optimization. 
Abstract Finite volume, weighted essentially nonoscillatory (WENO) schemes require the computation of a smoothness indicator. This can be expensive, especially in multiple space dimensions. We consider the use of the simple smoothness indicator
, where$$\sigma ^{\textrm{S}}= \frac{1}{N_{\textrm{S}}1}\sum _{j} ({\bar{u}}_{j}  {\bar{u}}_{m})^2$$ ${\sigma}^{\text{S}}=\frac{1}{{N}_{\text{S}}1}{\sum}_{j}{({\overline{u}}_{j}{\overline{u}}_{m})}^{2}$ is the number of mesh elements in the stencil,$$N_{\textrm{S}}$$ ${N}_{\text{S}}$ is the local function average over mesh element$${\bar{u}}_j$$ ${\overline{u}}_{j}$j , and indexm gives the target element. Reconstructions utilizing standard WENO weighting fail with this smoothness indicator. We develop a modification of WENOZ weighting that gives a reliable and accurate reconstruction of adaptive order, which we denote as SWENOZAO. We prove that it attains the order of accuracy of the large stencil polynomial approximation when the solution is smooth, and drops to the order of the small stencil polynomial approximations when there is a jump discontinuity in the solution. Numerical examples in one and two space dimensions on general meshes verify the approximation properties of the reconstruction. They also show it to be about 10 times faster in two space dimensions than reconstructions using the classic smoothness indicator. The new reconstruction is applied to define finite volume schemes to approximate the solution of hyperbolic conservation laws. Numerical tests show results of the same quality as standard WENO schemes using the classic smoothness indicator, but with an overall speedup in the computation time of about 3.5–5 times in 2D tests. Moreover, the computational efficiency (CPU time versus error) is noticeably improved.