Snow metamorphism: a fractal approach

Snow is a porous disordered medium consisting of air and three water phases: ice, vapour and liquid. The ice phase consists of an assemblage of grains, ice matrix, initially arranged over a random load bearing skeleton. The quantitative relationship between density and morphological characteristics of different snow microstructures is still an open issue. In this work, a three-dimensional fractal description of density corresponding to different snow microstructure is put forward. First, snow density is simulated in terms of a generalized Menger sponge model. Then, a fully three-dimensional compact stochastic fractal model is adopted. The latter approach yields a quantitative map of the randomness of the snow texture, which is described as a three-dimensional fractional Brownian field with the Hurst exponent H varying as continuous parameter. The Hurst exponent is found to be strongly dependent on snow morphology and density. The approach might be applied to all those cases where the morphological evolution of snow cover or ice sheets should be conveniently described at a quantitative level

The self-excitation damping ratio: A chatter criterion for time-domain milling simulations

Regenerative chatter is known to be a key factor that limits the productivity of high speed machining. Consequently, a great deal of research has focused on developing predictive models of milling dynamics, to aid engineers involved in both research and manufacturing practice. Time-domain models suffer from being computationally intensive, particularly when they are used to predict the boundary of chatter stability, when a large number of simulation runs are required under different milling conditions. Furthermore, to identify the boundary of stability each simulation must run for sufficient time for the chatter effect to manifest itself in the numerical data, and this is a major contributor to the inefficiency of the chatter prediction process. In the present article, a new chatter criterion is proposed for time-domain milling simulations, that aims to overcome this draw-back by considering the transient response of the modeled behavior, rather than the steady-state response. Using a series of numerical investigations, it is shown that in many cases the new criterion can enable the numerical prediction to be computed more than five times faster than was previously possible. In addition, the analysis yields greater detail concerning the nature of the chatter vibrations, and the degree of stability that is observed

Processor Allocation for Optimistic Parallelization of Irregular Programs

Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the amount of parallelism can usually be expressed as a function of the problem size, so it is reasonably straightforward to determine how many processors should be allocated to execute a regular algorithm of a certain size (this is called the processor allocation problem). In contrast, parallelism in irregular algorithms can be a function of input parameters, and the amount of parallelism can vary dramatically during the execution of the irregular algorithm. Therefore, the processor allocation problem for irregular algorithms is very difficult. In this paper, we describe the first systematic strategy for addressing this problem. Our approach is based on a construct called the conflict graph, which (i) provides insight into the amount of parallelism that can be extracted from an irregular algorithm, and (ii) can be used to address the processor allocation problem for irregular algorithms. We show that this problem is related to a generalization of the unfriendly seating problem and, by extending Tur\'an's theorem, we obtain a worst-case class of problems for optimistic parallelization, which we use to derive a lower bound on the exploitable parallelism. Finally, using some theoretically derived properties and some experimental facts, we design a quick and stable control strategy for solving the processor allocation problem heuristically.Comment: 12 pages, 3 figures, extended version of SPAA 2011 brief announcemen

Investigations of solutions of Einstein's field equations close to lambda-Taub-NUT

We present investigations of a class of solutions of Einstein's field equations close to the family of lambda-Taub-NUT spacetimes. The studies are done using a numerical code introduced by the author elsewhere. One of the main technical complication is due to the S3-topology of the Cauchy surfaces. Complementing these numerical results with heuristic arguments, we are able to yield some first insights into the strong cosmic censorship issue and the conjectures by Belinskii, Khalatnikov, and Lifschitz in this class of spacetimes. In particular, the current investigations suggest that strong cosmic censorship holds in this class. We further identify open issues in our current approach and point to future research projects.Comment: 24 pages, 12 figures, uses psfrag and hyperref; replaced with published version, only minor corrections of typos and reference

A new experimental snow avalanche test site at Seehore peak in Aosta Valley (NW Italian Alps) - Part II: Engineering aspects

The estimate of the effects produced by the impact of a snow avalanche against an obstacle is of the utmost importance in designing safe mountain constructions. For this purpose, an ad-hoc instrumented obstacle was designed and built in order to measure impact forces of small and medium snow avalanches at Seehore peak (NW Italian Alps). The structural design had to consider several specific and unusual demands dictated by the difficult environment. In this article, the new test facility is described from the engineering point of view, discussing the most important aspects of the analyzed problems which were solved before and after the construction. The performance of the instrumented obstacle in the first two operating seasons, and some proposals for future upgrading are eventually illustrate

Near Real-Time Data Labeling Using a Depth Sensor for EMG Based Prosthetic Arms

Recognizing sEMG (Surface Electromyography) signals belonging to a particular action (e.g., lateral arm raise) automatically is a challenging task as EMG signals themselves have a lot of variation even for the same action due to several factors. To overcome this issue, there should be a proper separation which indicates similar patterns repetitively for a particular action in raw signals. A repetitive pattern is not always matched because the same action can be carried out with different time duration. Thus, a depth sensor (Kinect) was used for pattern identification where three joint angles were recording continuously which is clearly separable for a particular action while recording sEMG signals. To Segment out a repetitive pattern in angle data, MDTW (Moving Dynamic Time Warping) approach is introduced. This technique is allowed to retrieve suspected motion of interest from raw signals. MDTW based on DTW algorithm, but it will be moving through the whole dataset in a pre-defined manner which is capable of picking up almost all the suspected segments inside a given dataset an optimal way. Elevated bicep curl and lateral arm raise movements are taken as motions of interest to show how the proposed technique can be employed to achieve auto identification and labelling. The full implementation is available at https://github.com/GPrathap/OpenBCIPytho

StreamJIT: A Commensal Compiler for High-Performance Stream Programming

There are many domain libraries, but despite the performance benefits of compilation, domain-specific languages are comparatively rare due to the high cost of implementing an optimizing compiler. We propose commensal compilation, a new strategy for compiling embedded domain-specific languages by reusing the massive investment in modern language virtual machine platforms. Commensal compilers use the host language's front-end, use host platform APIs that enable back-end optimizations by the host platform JIT, and use an autotuner for optimization selection. The cost of implementing a commensal compiler is only the cost of implementing the domain-specific optimizations. We demonstrate the concept by implementing a commensal compiler for the stream programming language StreamJIT atop the Java platform. Our compiler achieves performance 2.8 times better than the StreamIt native code (via GCC) compiler with considerably less implementation effort.United States. Dept. of Energy. Office of Science (X-Stack Award DE-SC0008923)Intel Corporation (Science and Technology Center for Big Data)SMART3 Graduate Fellowshi

A Wavelet-Based Algorithm for the Spatial Analysis of Poisson Data

Wavelets are scaleable, oscillatory functions that deviate from zero only within a limited spatial regime and have average value zero. In addition to their use as source characterizers, wavelet functions are rapidly gaining currency within the source detection field. Wavelet-based source detection involves the correlation of scaled wavelet functions with binned, two-dimensional image data. If the chosen wavelet function exhibits the property of vanishing moments, significantly non-zero correlation coefficients will be observed only where there are high-order variations in the data; e.g., they will be observed in the vicinity of sources. In this paper, we describe the mission-independent, wavelet-based source detection algorithm WAVDETECT, part of the CIAO software package. Aspects of our algorithm include: (1) the computation of local, exposure-corrected normalized (i.e. flat-fielded) background maps; (2) the correction for exposure variations within the field-of-view; (3) its applicability within the low-counts regime, as it does not require a minimum number of background counts per pixel for the accurate computation of source detection thresholds; (4) the generation of a source list in a manner that does not depend upon a detailed knowledge of the point spread function (PSF) shape; and (5) error analysis. These features make our algorithm considerably more general than previous methods developed for the analysis of X-ray image data, especially in the low count regime. We demonstrate the algorithm's robustness by applying it to various images.Comment: Accepted for publication in Ap. J. Supp. (v. 138 Jan. 2002). 61 pages, 23 figures, expands to 3.8 Mb. Abstract abridged for astro-ph submissio

Thermochemistry of Alane Complexes for Hydrogen Storage: A Theoretical and Experimental Comparison

Knowledge of the relative stabilities of alane (AlH3) complexes with electron donors is essential for identifying hydrogen storage materials for vehicular applications that can be regenerated by off-board methods; however, almost no thermodynamic data are available to make this assessment. To fill this gap, we employed the G4(MP2) method to determine heats of formation, entropies, and Gibbs free energies of formation for thirty-eight alane complexes with NH3-nRn (R = Me, Et; n = 0-3), pyridine, pyrazine, triethylenediamine (TEDA), quinuclidine, OH2-nRn (R = Me, Et; n = 0-2), dioxane, and tetrahydrofuran (THF). Monomer, bis, and selected dimer complex geometries were considered. Using these data, we computed the thermodynamics of the key formation and dehydrogenation reactions that would occur during hydrogen delivery and alane regeneration, from which trends in complex stability were identified. These predictions were tested by synthesizing six amine-alane complexes involving trimethylamine, triethylamine, dimethylethylamine, TEDA, quinuclidine, and hexamine, and obtaining upper limits of delta G for their formation from metallic aluminum. Combining these computational and experimental results, we establish a criterion for complex stability relevant to hydrogen storage that can be used to assess potential ligands prior to attempting synthesis of the alane complex. Based on this, we conclude that only a subset of the tertiary amine complexes considered and none of the ether complexes can be successfully formed by direct reaction with aluminum and regenerated in an alane-based hydrogen storage system.Comment: Accepted by the Journal of Physical Chemistry

Bayesian inference on compact binary inspiral gravitational radiation signals in interferometric data

Presented is a description of a Markov chain Monte Carlo (MCMC) parameter estimation routine for use with interferometric gravitational radiational data in searches for binary neutron star inspiral signals. Five parameters associated with the inspiral can be estimated, and summary statistics are produced. Advanced MCMC methods were implemented, including importance resampling and prior distributions based on detection probability, in order to increase the efficiency of the code. An example is presented from an application using realistic, albeit fictitious, data.Comment: submitted to Classical and Quantum Gravity. 14 pages, 5 figure