106,801 research outputs found

    Dynamic holographic interferometry using a Bi12SiO20 photorefractive crystal and monomode optical fibres

    Get PDF
    Dynamic holographic interferometry using polarization preserving opticai fibres as light guides and incorporating a photorefractive Bi12SiO20 (BSO) crystal as the recording medium is described. An experimental investigation of the recording of time average holograms through the diffusion process (employing anisotropic self-diffraction) and the drift process (application of d.c. and a.c. electric fields across the crystal) is also described. The holographic interferometer was optimised to produce holograms with a high diffraction efficiency and a high signal-to-noise ratio. Results are presented on optimising parameters such as the writing beam angle and writing beam intensity ratio. The advantages that can be gained by deploying this holographic interferometer in an industrial environment, where the laser light is guided to the location of the object by means of monomode fibres and images are stored within a photorefractive crystal is described. The holographic interferometer is capable of producing time average and double exposure interferograms of vibrating and deformed objects which can be displayed in real time

    Eigensolution analysis of spectral/hp continuous Galerkin approximations to advection-diffusion problems: insights into spectral vanishing viscosity

    Get PDF
    AbstractThis study addresses linear dispersion–diffusion analysis for the spectral/hp continuous Galerkin (CG) formulation in one dimension. First, numerical dispersion and diffusion curves are obtained for the advection–diffusion problem and the role of multiple eigencurves peculiar to spectral/hp methods is discussed. From the eigencurves' behaviour, we observe that CG might feature potentially undesirable non-smooth dispersion/diffusion characteristics for under-resolved simulations of problems strongly dominated by either convection or diffusion. Subsequently, the linear advection equation augmented with spectral vanishing viscosity (SVV) is analysed. Dispersion and diffusion characteristics of CG with SVV-based stabilization are verified to display similar non-smooth features in flow regions where convection is much stronger than dissipation or vice-versa, owing to a dependency of the standard SVV operator on a local Péclet number. First a modification is proposed to the traditional SVV scaling that enforces a globally constant Péclet number so as to avoid the previous issues. In addition, a new SVV kernel function is suggested and shown to provide a more regular behaviour for the eigencurves along with a consistent increase in resolution power for higher-order discretizations, as measured by the extent of the wavenumber range where numerical errors are negligible. The dissipation characteristics of CG with the SVV modifications suggested are then verified to be broadly equivalent to those obtained through upwinding in the discontinuous Galerkin (DG) scheme. Nevertheless, for the kernel function proposed, the full upwind DG scheme is found to have a slightly higher resolution power for the same dissipation levels. These results show that improved CG-SVV characteristics can be pursued via different kernel functions with the aid of optimization algorithms

    Filtered screens and augmented Teichm\"uller space

    Get PDF
    We study a new bordification of the decorated Teichm\"uller space for a multiply punctured surface F by a space of filtered screens on the surface that arises from a natural elaboration of earlier work of McShane-Penner. We identify necessary and sufficient conditions for paths in this space of filtered screens to yield short curves having vanishing length in the underlying surface F. As a result, an appropriate quotient of this space of filtered screens on F yields a decorated augmented Teichm\"uller space which is shown to admit a CW decomposition that naturally projects to the augmented Teichm\"uller space by forgetting decorations and whose strata are indexed by a new object termed partially oriented stratum graphs.Comment: Final version to appear in Geometriae Dedicat

    Linear dispersion-diffusion analysis and its application to under-resolved turbulence simulations using discontinuous Galerkin spectral/hp methods

    Get PDF
    We investigate the potential of linear dispersion–diffusion analysis in providing direct guidelines for turbulence simulations through the under-resolved DNS (sometimes called implicit LES) approach via spectral/hp methods. The discontinuous Galerkin (DG) formulation is assessed in particular as a representative of these methods. We revisit the eigensolutions technique as applied to linear advection and suggest a new perspective to the role of multiple numerical modes, peculiar to spectral/hp methods. From this new perspective, “secondary” eigenmodes are seen to replicate the propagation behaviour of a “primary” mode, so that DG's propagation characteristics can be obtained directly from the dispersion–diffusion curves of the primary mode. Numerical dissipation is then appraised from these primary eigencurves and its effect over poorly-resolved scales is quantified. Within this scenario, a simple criterion is proposed to estimate DG's effective resolution in terms of the largest wavenumber it can accurately resolve in a given hp approximation space, also allowing us to present points per wavelength estimates typically used in spectral and finite difference methods. Although strictly valid for linear advection, the devised criterion is tested against (1D) Burgers turbulence and found to predict with good accuracy the beginning of the dissipation range on the energy spectra of under-resolved simulations. The analysis of these test cases through the proposed methodology clarifies why and how the DG formulation can be used for under-resolved turbulence simulations without explicit subgrid-scale modelling. In particular, when dealing with communication limited hardware which forces one to consider the performance for a fixed number of degrees of freedom, the use of higher polynomial orders along with moderately coarser meshes is shown to be the best way to translate available degrees of freedom into resolution power

    Certificate Transparency with Enhancements and Short Proofs

    Full text link
    Browsers can detect malicious websites that are provisioned with forged or fake TLS/SSL certificates. However, they are not so good at detecting malicious websites if they are provisioned with mistakenly issued certificates or certificates that have been issued by a compromised certificate authority. Google proposed certificate transparency which is an open framework to monitor and audit certificates in real time. Thereafter, a few other certificate transparency schemes have been proposed which can even handle revocation. All currently known constructions use Merkle hash trees and have proof size logarithmic in the number of certificates/domain owners. We present a new certificate transparency scheme with short (constant size) proofs. Our construction makes use of dynamic bilinear-map accumulators. The scheme has many desirable properties like efficient revocation, low verification cost and update costs comparable to the existing schemes. We provide proofs of security and evaluate the performance of our scheme.Comment: A preliminary version of the paper was published in ACISP 201

    Major Surge Activity of Super-Active Region NOAA 10484

    Full text link
    We observed two surges in H-alpha from the super-active region NOAA 10484. The first surge was associated with an SF/C4.3 class flare. The second one was a major surge associated with a SF/C3.9 flare. This surge was also observed with SOHO/EIT in 195 angstrom and NoRh in 17 GHz, and showed similar evolution in these wavelengths. The major surge had an ejective funnel-shaped spray structure with fast expansion in linear (about 1.2 x 10^5 km) and angular (about 65 deg) size during its maximum phase. The mass motion of the surge was along open magnetic field lines, with average velocity about 100 km/s. The de-twisting motion of the surge reveals relaxation of sheared and twisted magnetic flux. The SOHO/MDI magnetograms reveal that the surges occurred at the site of companion sunspots where positive flux emerged, converged, and canceled against surrounding field of opposite polarity. Our observations support magnetic reconnection models for the surges and jets.Comment: 4 pages, 3 figures; To appear in "Magnetic Coupling between the Interior and the Atmosphere of the Sun", eds. S.S. Hasan and R.J. Rutten, Astrophysics and Space Science Series, Springer-Verlag, Heidelberg, Berlin, 200

    Robust estimation of stationary continuous-time ARMA models via indirect inference

    Full text link
    In this paper we present a robust estimator for the parameters of a continuous-time ARMA(p,q) (CARMA(p,q)) process sampled equidistantly which is not necessarily Gaussian. Therefore, an indirect estimation procedure is used. It is an indirect estimation because we first estimate the parameters of the auxiliary AR(r) representation (r2p1r\geq 2p-1) of the sampled CARMA process using a generalized M- (GM-)estimator. Since the map which maps the parameters of the auxiliary AR(r) representation to the parameters of the CARMA process is not given explicitly, a separate simulation part is necessary where the parameters of the AR(r) representation are estimated from simulated CARMA processes. Then, the parameter which takes the minimum distance between the estimated AR parameters and the simulated AR parameters gives an estimator for the CARMA parameters. First, we show that under some standard assumptions the GM-estimator for the AR(r) parameters is consistent and asymptotically normally distributed. Next, we prove that the indirect estimator is consistent and asymptotically normally distributed as well using in the simulation part the asymptotically normally distributed LS-estimator. The indirect estimator satisfies several important robustness properties such as weak resistance, πdn\pi_{d_n}-robustness and it has a bounded influence functional. The practical applicability of our method is demonstrated through a simulation study with replacement outliers and compared to the non-robust quasi-maximum-likelihood estimation method

    The anabolic action of intermittent parathyroid hormone on cortical bone depends partly on its ability to induce nitric oxide-mediated vasorelaxation in BALB/c mice

    Get PDF
    There is strong evidence that vasodilatory nitric oxide (NO) donors have anabolic effects on bone in humans. Parathyroid hormone (PTH), the only osteoanabolic drug currently approved, is also a vasodilator. We investigated whether the NO synthase inhibitor L-NAME might alter the effect of PTH on bone by blocking its vasodilatory effect. BALB/c mice received 28 daily injections of PTH[1-34] (80 µg/kg/day) or L-NAME (30 mg/kg/day), alone or in combination. Hindlimb blood perfusion was measured by laser Doppler imaging. Bone architecture, turnover and mechanical properties in the femur were analysed respectively by micro-CT, histomorphometry and three-point bending. PTH increased hindlimb blood flow by >30% within 10 min of injection (P < 0.001). Co-treatment with L-NAME blocked the action of PTH on blood flow, whereas L-NAME alone had no effect. PTH treatment increased femoral cortical bone volume and formation rate by 20% and 110%, respectively (P < 0.001). PTH had no effect on trabecular bone volume in the femoral metaphysis although trabecular thickness and number were increased and decreased by 25%, respectively. Co-treatment with L-NAME restricted the PTH-stimulated increase in cortical bone formation but had no clear-cut effects in trabecular bone. Co-treatment with L-NAME did not affect the mechanical strength in femurs induced by iPTH. These results suggest that NO-mediated vasorelaxation plays partly a role in the anabolic action of PTH on cortical bone

    Generalized Bayesian Record Linkage and Regression with Exact Error Propagation

    Full text link
    Record linkage (de-duplication or entity resolution) is the process of merging noisy databases to remove duplicate entities. While record linkage removes duplicate entities from such databases, the downstream task is any inferential, predictive, or post-linkage task on the linked data. One goal of the downstream task is obtaining a larger reference data set, allowing one to perform more accurate statistical analyses. In addition, there is inherent record linkage uncertainty passed to the downstream task. Motivated by the above, we propose a generalized Bayesian record linkage method and consider multiple regression analysis as the downstream task. Records are linked via a random partition model, which allows for a wide class to be considered. In addition, we jointly model the record linkage and downstream task, which allows one to account for the record linkage uncertainty exactly. Moreover, one is able to generate a feedback propagation mechanism of the information from the proposed Bayesian record linkage model into the downstream task. This feedback effect is essential to eliminate potential biases that can jeopardize resulting downstream task. We apply our methodology to multiple linear regression, and illustrate empirically that the "feedback effect" is able to improve the performance of record linkage.Comment: 18 pages, 5 figure

    Distributed Random Process for a Large-Scale Peer-to-Peer Lottery

    Get PDF
    Most online lotteries today fail to ensure the verifiability of the random process and rely on a trusted third party. This issue has received little attention since the emergence of distributed protocols like Bitcoin that demonstrated the potential of protocols with no trusted third party. We argue that the security requirements of online lotteries are similar to those of online voting, and propose a novel distributed online lottery protocol that applies techniques developed for voting applications to an existing lottery protocol. As a result, the protocol is scalable, provides efficient verification of the random process and does not rely on a trusted third party nor on assumptions of bounded computational resources. An early prototype confirms the feasibility of our approach
    corecore