Compact in-plane dual-axis spring-steel accelerometer

Presented in this paper is an improvement over a spring-steel dual-axis accelerometer that we had reported earlier.The fabrication process (which entails wire-cut electro discharge machining of easily accessible and inexpensive spring-steelfoil) and the sensing of the displacement (which is done using off-the-shelf Hall-effect sensors) remain the same. Theimprovements reported here are twofold: (i) the footprint of the packaged accelerometer is reduced from 80 mm square to 40mm square, and (ii) almost perfect de-coupling and symmetry are achieved between the two in-plane axes of the packageddevice as opposed to the previous embodiment where this was not the case. Good linearity with about 40 mV/g was measuredalong both the in-plane axes over a range of 0.1 to 1 g. The first two natural frequencies of the devices are at 30 Hz and 100Hz, respectively, as per the experiment. The highlights of this work are cost-effective processing, easy integration of the Hall-effect sensing capability on a customised printed circuit board, and inexpensive packaging without overly compromising eitherthe overall size or the sensitivity of the accelerometer. Through this work, we have reaffirmed the practicability of spring-steelaccelerometers towards the eventual goal of making it compete with micro machined silicon accelerometers in terms of sizeand performance. The cost is likely to be much lower for the spring-steel accelerometers than that of silicon accelerometers, especially when the volume of production is low and the sensor is to be used as a single packaged unit.

Fixed-orientation equilateral triangle matching of point sets

Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. All rights reserved.

Combining data sets of satellite-retrieved products for basin-scale water balance study: 2. Evaluation on the Mississippi Basin and closure correction model

In this study, we applied the integration methodology developed in the companion paper by Aires (2014) by using real satellite observations over the Mississippi Basin. The methodology provides basin-scale estimates of the four water budget components (precipitation P, evapotranspiration E, water storage change Delta S, and runoff R) in a two-step process: the Simple Weighting (SW) integration and a Postprocessing Filtering (PF) that imposes the water budget closure. A comparison with in situ observations of P and E demonstrated that PF improved the estimation of both components. A Closure Correction Model (CCM) has been derived from the integrated product (SW+PF) that allows to correct each observation data set independently, unlike the SW+PF method which requires simultaneous estimates of the four components. The CCM allows to standardize the various data sets for each component and highly decrease the budget residual (P - E - Delta S - R). As a direct application, the CCM was combined with the water budget equation to reconstruct missing values in any component. Results of a Monte Carlo experiment with synthetic gaps demonstrated the good performances of the method, except for the runoff data that has a variability of the same order of magnitude as the budget residual. Similarly, we proposed a reconstruction of Delta S between 1990 and 2002 where no Gravity Recovery and Climate Experiment data are available. Unlike most of the studies dealing with the water budget closure at the basin scale, only satellite observations and in situ runoff measurements are used. Consequently, the integrated data sets are model independent and can be used for model calibration or validation.

Third post-Newtonian gravitational waveforms for compact binary systems in general orbits: Instantaneous terms

We compute the instantaneous contributions to the spherical harmonic modes of gravitational waveforms from compact binary systems in general orbits up to the third post-Newtonian (PN) order. We further extend these results for compact binaries in quasielliptical orbits using the 3PN quasi-Keplerian representation of the conserved dynamics of compact binaries in eccentric orbits. Using the multipolar post-Minkowskian formalism, starting from the different mass and current-type multipole moments, we compute the spin-weighted spherical harmonic decomposition of the instantaneous part of the gravitational waveform. These are terms which are functions of the retarded time and do not depend on the history of the binary evolution. Together with the hereditary part, which depends on the binary's dynamical history, these waveforms form the basis for construction of accurate templates for the detection of gravitational wave signals from binaries moving in quasielliptical orbits.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

L-infinity norms of holomorphic modular forms in the case of compact quotient

We prove a sub-convex estimate for the sup-norm of L-2-normalized holomorphic modular forms of weight k on the upper half plane, with respect to the unit group of a quaternion division algebra over Q. More precisely we show that when the L-2 norm of an eigenfunction f is one, parallel to f parallel to(infinity) <<(epsilon) k(1/2-1/33+epsilon) for any epsilon > 0 and for all k sufficiently large.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Asymptotic behavior and interpretation of virtual states: The effects of confinement and of basis sets

A real-space high order finite difference method is used to analyze the effect of spherical domain size on the Hartree-Fock (and density functional theory) virtual eigenstates. We show the domain size dependence of both positive and negative virtual eigenvalues of the Hartree-Fock equations for small molecules. We demonstrate that positive states behave like a particle in spherical well and show how they approach zero. For the negative eigenstates, we show that large domains are needed to get the correct eigenvalues. We compare our results to those of Gaussian basis sets and draw some conclusions for real-space, basis-sets, and plane-waves calculations. (C) 2016 AIP Publishing LLC.

Numerical solution of the incompressible Navier-Stokes equations with an upwind compact difference scheme

A new finite difference method for the discretization of the incompressible Navier-Stokes equations is presented. The scheme is constructed on a staggered-mesh grid system. The convection terms are discretized with a fifth-order-accurate upwind compact difference approximation, the viscous terms are discretized with a sixth-order symmetrical compact difference approximation, the continuity equation and the pressure gradient in the momentum equations are discretized with a fourth-order difference approximation on a cell-centered mesh. Time advancement uses a three-stage Runge-Kutta method. The Poisson equation for computing the pressure is solved with preconditioning. Accuracy analysis shows that the new method has high resolving efficiency. Validation of the method by computation of Taylor's vortex array is presented.

High-Resolution Finite Compact Difference Schemes for Hyperbolic Conservation Laws

A finite compact (FC) difference scheme requiring only bi-diagonal matrix inversion is proposed by using the known high-resolution flux. Introducing TVD or ENO limiters in the numerical flux, several high-resolution FC-schemes of hyperbolic conservation law are developed, including the FC-TVD, third-order FC-ENO and fifth-order FC-ENO schemes. Boundary conditions formulated need only one unknown variable for third-order FC-ENO scheme and two unknown variables for fifth-order FC-ENO scheme. Numerical test results of the proposed FC-scheme were compared with traditional TVD, ENO and WENO schemes to demonstrate its high-order accuracy and high-resolution.

Fourth order accurate compact scheme with group velocity control (GVC)

For solving complex flow field with multi-scale structure higher order accurate schemes are preferred. Among high order schemes the compact schemes have higher resolving efficiency. When the compact and upwind compact schemes are used to solve aerodynamic problems there are numerical oscillations near the shocks. The reason of oscillation production is because of non-uniform group velocity of wave packets in numerical solutions. For improvement of resolution of the shock a parameter function is introduced in compact scheme to control the group velocity. The newly developed method is simple. It has higher accuracy and less stencil of grid points.

Analysis of super compact finite difference method and application to simulation of vortex-shock interaction

Turbulence and aeroacoustic noise high-order accurate schemes are required, and preferred, for solving complex flow fields with multi-scale structures. In this paper a super compact finite difference method (SCFDM) is presented, the accuracy is analysed and the method is compared with a sixth-order traditional and compact finite difference approximation. The comparison shows that the sixth-order accurate super compact method has higher resolving efficiency. The sixth-order super compact method, with a three-stage Runge-Kutta method for approximation of the compressible Navier-Stokes equations, is used to solve the complex flow structures induced by vortex-shock interactions. The basic nature of the near-field sound generated by interaction is studied.

Hybrid Finite Compact-WENO Schemes for Shock Calculation

Hybrid finite compact (FC)-WENO schemes are proposed for shock calculations. The two sub-schemes (finite compact difference scheme and WENO scheme) are hybridized by means of the similar treatment as in ENO schemes. The hybrid schemes have the advantages of FC and WENO schemes. One is that they possess the merit of the finite compact difference scheme, which requires only bi-diagonal matrix inversion and can apply the known high-resolution flux to obtain high-performance numerical flux function; another is that they have the high-resolution property of WENO scheme for shock capturing. The numerical results show that FC-WENO schemes have better resolution properties than both FC-ENO schemes and WENO schemes. In addition, some comparisons of FC-ENO and artificial compression method (ACM) filter scheme of Yee et al. are also given.

Practical Criterion for Universal Laws and Practical Methods for Construction of Co-variance Sets

给出相对论力学中普遍定律的实用判别法和协变集的实用构造法,还给出实现非普遍定律的“可导出性”的一种实用方法．