Adaptive density trajectory cluster based on time and space distance

NASA Astrophysics Data System (ADS)

Liu, Fagui; Zhang, Zhijie

2017-10-01

There are some hotspot problems remaining in trajectory cluster for discovering mobile behavior regularity, such as the computation of distance between sub trajectories, the setting of parameter values in cluster algorithm and the uncertainty/boundary problem of data set. As a result, based on the time and space, this paper tries to define the calculation method of distance between sub trajectories. The significance of distance calculation for sub trajectories is to clearly reveal the differences in moving trajectories and to promote the accuracy of cluster algorithm. Besides, a novel adaptive density trajectory cluster algorithm is proposed, in which cluster radius is computed through using the density of data distribution. In addition, cluster centers and number are selected by a certain strategy automatically, and uncertainty/boundary problem of data set is solved by designed weighted rough c-means. Experimental results demonstrate that the proposed algorithm can perform the fuzzy trajectory cluster effectively on the basis of the time and space distance, and obtain the optimal cluster centers and rich cluster results information adaptably for excavating the features of mobile behavior in mobile and sociology network.

Long-Time Numerical Integration of the Three-Dimensional Wave Equation in the Vicinity of a Moving Source

NASA Technical Reports Server (NTRS)

Ryabenkii, V. S.; Turchaninov, V. I.; Tsynkov, S. V.

1999-01-01

We propose a family of algorithms for solving numerically a Cauchy problem for the three-dimensional wave equation. The sources that drive the equation (i.e., the right-hand side) are compactly supported in space for any given time; they, however, may actually move in space with a subsonic speed. The solution is calculated inside a finite domain (e.g., sphere) that also moves with a subsonic speed and always contains the support of the right-hand side. The algorithms employ a standard consistent and stable explicit finite-difference scheme for the wave equation. They allow one to calculate tile solution for arbitrarily long time intervals without error accumulation and with the fixed non-growing amount of tile CPU time and memory required for advancing one time step. The algorithms are inherently three-dimensional; they rely on the presence of lacunae in the solutions of the wave equation in oddly dimensional spaces. The methodology presented in the paper is, in fact, a building block for constructing the nonlocal highly accurate unsteady artificial boundary conditions to be used for the numerical simulation of waves propagating with finite speed over unbounded domains.

Shape classification of malignant lymphomas and leukemia by morphological watersheds and ARMA modeling

NASA Astrophysics Data System (ADS)

Celenk, Mehmet; Song, Yinglei; Ma, Limin; Zhou, Min

2003-05-01

A new algorithm that can be used to automatically recognize and classify malignant lymphomas and lukemia is proposed in this paper. The algorithm utilizes the morphological watershed to extract boundaries of cells from their grey-level images. It generates a sequence of Euclidean distances by selecting pixels in clockwise direction on the boundary of the cell and calculating the Euclidean distances of the selected pixels from the centroid of the cell. A feature vector associated with each cell is then obtained by applying the auto-regressive moving-average (ARMA) model to the generated sequence of Euclidean distances. The clustering measure J3=trace{inverse(Sw-1)Sm} involving the within (Sw) and mixed (Sm) class-scattering matrices is computed for both cell classes to provide an insight into the extent to which different cell classes in the training data are separated. Our test results suggest that the algorithm is highly accurate for the development of an interactive, computer-assisted diagnosis (CAD) tool.

Quality Tetrahedral Mesh Smoothing via Boundary-Optimized Delaunay Triangulation

PubMed Central

Gao, Zhanheng; Yu, Zeyun; Holst, Michael

2012-01-01

Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing “bad” triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In our method, both inner and boundary vertices are repositioned by analytically minimizing the error between a paraboloid function and its piecewise linear interpolation over the neighborhood of each vertex. In addition to the guaranteed volume-preserving property, the proposed algorithm can be readily adapted to preserve sharp features in the original mesh. A number of experiments are included to demonstrate the performance of our method. PMID:23144522

Numerical Simulation Of Flow Through An Artificial Heart

NASA Technical Reports Server (NTRS)

Rogers, Stuart; Kutler, Paul; Kwak, Dochan; Kiris, Centin

1991-01-01

Research in both artificial hearts and fluid dynamics benefits from computational studies. Algorithm that implements Navier-Stokes equations of flow extended to simulate flow of viscous, incompressible blood through articifial heart. Ability to compute details of such flow important for two reasons: internal flows with moving boundaries of academic interest in their own right, and many of deficiencies of artificial hearts attributable to dynamics of flow.

Tangle-Free Finite Element Mesh Motion for Ablation Problems

NASA Technical Reports Server (NTRS)

Droba, Justin

2016-01-01

In numerical simulations involving boundaries that evolve in time, the primary challenge is updating the computational mesh to reflect the physical changes in the domain. In particular, the fundamental objective for any such \\mesh motion" scheme is to maintain mesh quality and suppress unphysical geometric anamolies and artifacts. External to a physical process of interest, mesh motion is an added component that determines the specifics of how to move the mesh given certain limited information from the main system. This paper develops a set of boundary conditions designed to eliminate tangling and internal collision within the context of PDE-based mesh motion (linear elasticity). These boundary conditions are developed for two- and three-dimensional meshes. The paper presents detailed algorithms for commonly occuring topological scenarios and explains how to apply them appropriately. Notably, the techniques discussed herein make use of none of the specifics of any particular formulation of mesh motion and thus are more broadly applicable. The two-dimensional algorithms are validated by an extensive verification procedure. Finally, many examples of diverse geometries in both two- and three-dimensions are shown to showcase the capabilities of the tangle-free boundary conditions.

Theoretical and experimental comparison of vapor cavitation in dynamically loaded journal bearings

NASA Astrophysics Data System (ADS)

Brewe, D. E.; Hamrock, B. J.; Jacobson, B. A.

Vapor cavitation for a submerged journal bearing under dynamically loaded conditions was investigated. The observation of vapor cavitation in the laboratory was done by high-speed photography. It was found that vapor cavitation occurs when the tensile stress applied to the oil exceeded the tensile strength of the oil or the binding of the oil to the surface. The theoretical solution to the Reynolds equation is determined numerically using a moving boundary algorithm. This algorithm conserves mass throughout the computational domain including the region of cavitation and its boundaries. An alternating direction implicit (MDI) method is used to effect the time march. A rotor undergoing circular whirl was studied. Predicted cavitation behavior was analyzed by three-dimensional computer graphic movies. The formation, growth, and collapse of the bubble in response to the dynamic conditions is shown. For the same conditions of dynamic loading, the cavitation bubble was studied in the laboratory using high-speed photography.

Theoretical and experimental comparison of vapor cavitation in dynamically loaded journal bearings

NASA Technical Reports Server (NTRS)

Brewe, D. E.; Hamrock, B. J.; Jacobson, B. A.

1985-01-01

Vapor cavitation for a submerged journal bearing under dynamically loaded conditions was investigated. The observation of vapor cavitation in the laboratory was done by high-speed photography. It was found that vapor cavitation occurs when the tensile stress applied to the oil exceeded the tensile strength of the oil or the binding of the oil to the surface. The theoretical solution to the Reynolds equation is determined numerically using a moving boundary algorithm. This algorithm conserves mass throughout the computational domain including the region of cavitation and its boundaries. An alternating direction implicit (MDI) method is used to effect the time march. A rotor undergoing circular whirl was studied. Predicted cavitation behavior was analyzed by three-dimensional computer graphic movies. The formation, growth, and collapse of the bubble in response to the dynamic conditions is shown. For the same conditions of dynamic loading, the cavitation bubble was studied in the laboratory using high-speed photography.

Shot boundary detection and label propagation for spatio-temporal video segmentation

NASA Astrophysics Data System (ADS)

Piramanayagam, Sankaranaryanan; Saber, Eli; Cahill, Nathan D.; Messinger, David

2015-02-01

This paper proposes a two stage algorithm for streaming video segmentation. In the first stage, shot boundaries are detected within a window of frames by comparing dissimilarity between 2-D segmentations of each frame. In the second stage, the 2-D segments are propagated across the window of frames in both spatial and temporal direction. The window is moved across the video to find all shot transitions and obtain spatio-temporal segments simultaneously. As opposed to techniques that operate on entire video, the proposed approach consumes significantly less memory and enables segmentation of lengthy videos. We tested our segmentation based shot detection method on the TRECVID 2007 video dataset and compared it with block-based technique. Cut detection results on the TRECVID 2007 dataset indicate that our algorithm has comparable results to the best of the block-based methods. The streaming video segmentation routine also achieves promising results on a challenging video segmentation benchmark database.

Application of Bayesian Inversion for Multilayer Reservoir Mapping while Drilling Measurements

NASA Astrophysics Data System (ADS)

Wang, J.; Chen, H.; Wang, X.

2017-12-01

Real-time geosteering technology plays a key role in horizontal well development, which keeps the wellbore trajectories within target zones to maximize reservoir contact. The new generation logging while drilling (LWD) resistivity tools have longer spacing and deeper investigation depth, but meanwhile bring a new challenge to inversion of logging data that is formation model not be restricted to few possible numbers of layer such as typical three layers model. If the inappropriate starting models of deterministic and gradient-based methods are adopted may mislead geophysicists in interpretation of subsurface structure. For this purpose, to take advantage of richness of the measurements and deep depth of investigation across multiple formation boundaries, a trans-dimensional Markov chain Monte Carlo(MCMC) inversion algorithm has been developed that combines phase and attenuation measurements at various frequencies and spacings. Unlike conventional gradient-based inversion approaches, MCMC algorithm does not introduce bias from prior information and require any subjective choice of regularization parameter. A synthetic three layers model example demonstrates how the algorithm can be used to image the subsurface using the LWD data. When the tool is far from top boundary, the inversion clearly resolves the boundary position; that is where the boundary histogram shows a large peak. But the measurements cannot resolve the bottom boundary; the large spread between quantiles reflects the uncertainty associated with the bed resolution. As the tool moves closer to the top boundary, the middle layer and bottom layer are resolved and retained models are more similar, the uncertainty associated with these two beds decreases. From the spread observed between models, we can evaluate actual depth of investigation, uncertainty, and sensitivity, which is more useful then just a single best model.

A novel spatial-temporal detection method of dim infrared moving small target

NASA Astrophysics Data System (ADS)

Chen, Zhong; Deng, Tao; Gao, Lei; Zhou, Heng; Luo, Song

2014-09-01

Moving small target detection under complex background in infrared image sequence is one of the major challenges of modern military in Early Warning Systems (EWS) and the use of Long-Range Strike (LRS). However, because of the low SNR and undulating background, the infrared moving small target detection is a difficult problem in a long time. To solve this problem, a novel spatial-temporal detection method based on bi-dimensional empirical mode decomposition (EMD) and time-domain difference is proposed in this paper. This method is downright self-data decomposition and do not rely on any transition kernel function, so it has a strong adaptive capacity. Firstly, we generalized the 1D EMD algorithm to the 2D case. In this process, the project has solved serial issues in 2D EMD, such as large amount of data operations, define and identify extrema in 2D case, and two-dimensional signal boundary corrosion. The EMD algorithm studied in this project can be well adapted to the automatic detection of small targets under low SNR and complex background. Secondly, considering the characteristics of moving target, we proposed an improved filtering method based on three-frame difference on basis of the original difference filtering in time-domain, which greatly improves the ability of anti-jamming algorithm. Finally, we proposed a new time-space fusion method based on a combined processing of 2D EMD and improved time-domain differential filtering. And, experimental results show that this method works well in infrared small moving target detection under low SNR and complex background.

Feature extraction and classification algorithms for high dimensional data

NASA Technical Reports Server (NTRS)

Lee, Chulhee; Landgrebe, David

1993-01-01

Feature extraction and classification algorithms for high dimensional data are investigated. Developments with regard to sensors for Earth observation are moving in the direction of providing much higher dimensional multispectral imagery than is now possible. In analyzing such high dimensional data, processing time becomes an important factor. With large increases in dimensionality and the number of classes, processing time will increase significantly. To address this problem, a multistage classification scheme is proposed which reduces the processing time substantially by eliminating unlikely classes from further consideration at each stage. Several truncation criteria are developed and the relationship between thresholds and the error caused by the truncation is investigated. Next an approach to feature extraction for classification is proposed based directly on the decision boundaries. It is shown that all the features needed for classification can be extracted from decision boundaries. A characteristic of the proposed method arises by noting that only a portion of the decision boundary is effective in discriminating between classes, and the concept of the effective decision boundary is introduced. The proposed feature extraction algorithm has several desirable properties: it predicts the minimum number of features necessary to achieve the same classification accuracy as in the original space for a given pattern recognition problem; and it finds the necessary feature vectors. The proposed algorithm does not deteriorate under the circumstances of equal means or equal covariances as some previous algorithms do. In addition, the decision boundary feature extraction algorithm can be used both for parametric and non-parametric classifiers. Finally, some problems encountered in analyzing high dimensional data are studied and possible solutions are proposed. First, the increased importance of the second order statistics in analyzing high dimensional data is recognized. By investigating the characteristics of high dimensional data, the reason why the second order statistics must be taken into account in high dimensional data is suggested. Recognizing the importance of the second order statistics, there is a need to represent the second order statistics. A method to visualize statistics using a color code is proposed. By representing statistics using color coding, one can easily extract and compare the first and the second statistics.

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

NASA Technical Reports Server (NTRS)

Ryabenkii, V. S.; Tsynkov, S. V.; Turchaninov, V. I.; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special non-deteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of 'non-reflecting kernels,' nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The non-deteriorating algorithm, which is the core of the new ABCs is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals, and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimension spaces, It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the non-modified scheme. In the paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABCs' algorithm.

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

NASA Astrophysics Data System (ADS)

Ryaben'kii, V. S.; Tsynkov, S. V.; Turchaninov, V. I.

2001-12-01

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special nondeteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of “nonreflecting kernels” nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The nondeteriorating algorithm, which is the core of the new ABCs, is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimensional spaces. It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the unmodified scheme. In this paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABC algorithm.

Incompressible SPH (ISPH) with fast Poisson solver on a GPU

NASA Astrophysics Data System (ADS)

Chow, Alex D.; Rogers, Benedict D.; Lind, Steven J.; Stansby, Peter K.

2018-05-01

This paper presents a fast incompressible SPH (ISPH) solver implemented to run entirely on a graphics processing unit (GPU) capable of simulating several millions of particles in three dimensions on a single GPU. The ISPH algorithm is implemented by converting the highly optimised open-source weakly-compressible SPH (WCSPH) code DualSPHysics to run ISPH on the GPU, combining it with the open-source linear algebra library ViennaCL for fast solutions of the pressure Poisson equation (PPE). Several challenges are addressed with this research: constructing a PPE matrix every timestep on the GPU for moving particles, optimising the limited GPU memory, and exploiting fast matrix solvers. The ISPH pressure projection algorithm is implemented as 4 separate stages, each with a particle sweep, including an algorithm for the population of the PPE matrix suitable for the GPU, and mixed precision storage methods. An accurate and robust ISPH boundary condition ideal for parallel processing is also established by adapting an existing WCSPH boundary condition for ISPH. A variety of validation cases are presented: an impulsively started plate, incompressible flow around a moving square in a box, and dambreaks (2-D and 3-D) which demonstrate the accuracy, flexibility, and speed of the methodology. Fragmentation of the free surface is shown to influence the performance of matrix preconditioners and therefore the PPE matrix solution time. The Jacobi preconditioner demonstrates robustness and reliability in the presence of fragmented flows. For a dambreak simulation, GPU speed ups demonstrate up to 10-18 times and 1.1-4.5 times compared to single-threaded and 16-threaded CPU run times respectively.

A sharp interface Cartesian grid method for viscous simulation of shocked particle-laden flows

NASA Astrophysics Data System (ADS)

Das, Pratik; Sen, Oishik; Jacobs, Gustaaf; Udaykumar, H. S.

2017-09-01

A Cartesian grid-based sharp interface method is presented for viscous simulations of shocked particle-laden flows. The moving solid-fluid interfaces are represented using level sets. A moving least-squares reconstruction is developed to apply the no-slip boundary condition at solid-fluid interfaces and to supply viscous stresses to the fluid. The algorithms developed in this paper are benchmarked against similarity solutions for the boundary layer over a fixed flat plate and against numerical solutions for moving interface problems such as shock-induced lift-off of a cylinder in a channel. The framework is extended to 3D and applied to calculate low Reynolds number steady supersonic flow over a sphere. Viscous simulation of the interaction of a particle cloud with an incident planar shock is demonstrated; the average drag on the particles and the vorticity field in the cloud are compared to the inviscid case to elucidate the effects of viscosity on momentum transfer between the particle and fluid phases. The methods developed will be useful for obtaining accurate momentum and heat transfer closure models for macro-scale shocked particulate flow applications such as blast waves and dust explosions.

The Linked Neighbour List (LNL) method for fast off-lattice Monte Carlo simulations of fluids

NASA Astrophysics Data System (ADS)

Mazzeo, M. D.; Ricci, M.; Zannoni, C.

2010-03-01

We present a new algorithm, called linked neighbour list (LNL), useful to substantially speed up off-lattice Monte Carlo simulations of fluids by avoiding the computation of the molecular energy before every attempted move. We introduce a few variants of the LNL method targeted to minimise memory footprint or augment memory coherence and cache utilisation. Additionally, we present a few algorithms which drastically accelerate neighbour finding. We test our methods on the simulation of a dense off-lattice Gay-Berne fluid subjected to periodic boundary conditions observing a speedup factor of about 2.5 with respect to a well-coded implementation based on a conventional link-cell. We provide several implementation details of the different key data structures and algorithms used in this work.

A Cartesian cut cell method for rarefied flow simulations around moving obstacles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dechristé, G., E-mail: Guillaume.Dechriste@math.u-bordeaux1.fr; CNRS, IMB, UMR 5251, F-33400 Talence; Mieussens, L., E-mail: Luc.Mieussens@math.u-bordeaux1.fr

2016-06-01

For accurate simulations of rarefied gas flows around moving obstacles, we propose a cut cell method on Cartesian grids: it allows exact conservation and accurate treatment of boundary conditions. Our approach is designed to treat Cartesian cells and various kinds of cut cells by the same algorithm, with no need to identify the specific shape of each cut cell. This makes the implementation quite simple, and allows a direct extension to 3D problems. Such simulations are also made possible by using an adaptive mesh refinement technique and a hybrid parallel implementation. This is illustrated by several test cases, including amore » 3D unsteady simulation of the Crookes radiometer.« less

GridMass: a fast two-dimensional feature detection method for LC/MS.

PubMed

Treviño, Victor; Yañez-Garza, Irma-Luz; Rodriguez-López, Carlos E; Urrea-López, Rafael; Garza-Rodriguez, Maria-Lourdes; Barrera-Saldaña, Hugo-Alberto; Tamez-Peña, José G; Winkler, Robert; Díaz de-la-Garza, Rocío-Isabel

2015-01-01

One of the initial and critical procedures for the analysis of metabolomics data using liquid chromatography and mass spectrometry is feature detection. Feature detection is the process to detect boundaries of the mass surface from raw data. It consists of detected abundances arranged in a two-dimensional (2D) matrix of mass/charge and elution time. MZmine 2 is one of the leading software environments that provide a full analysis pipeline for these data. However, the feature detection algorithms provided in MZmine 2 are based mainly on the analysis of one-dimension at a time. We propose GridMass, an efficient algorithm for 2D feature detection. The algorithm is based on landing probes across the chromatographic space that are moved to find local maxima providing accurate boundary estimations. We tested GridMass on a controlled marker experiment, on plasma samples, on plant fruits, and in a proteome sample. Compared with other algorithms, GridMass is faster and may achieve comparable or better sensitivity and specificity. As a proof of concept, GridMass has been implemented in Java under the MZmine 2 environment and is available at http://www.bioinformatica.mty.itesm.mx/GridMass and MASSyPup. It has also been submitted to the MZmine 2 developing community. Copyright © 2015 John Wiley & Sons, Ltd.

A numerical algorithm for MHD of free surface flows at low magnetic Reynolds numbers

NASA Astrophysics Data System (ADS)

Samulyak, Roman; Du, Jian; Glimm, James; Xu, Zhiliang

2007-10-01

We have developed a numerical algorithm and computational software for the study of magnetohydrodynamics (MHD) of free surface flows at low magnetic Reynolds numbers. The governing system of equations is a coupled hyperbolic-elliptic system in moving and geometrically complex domains. The numerical algorithm employs the method of front tracking and the Riemann problem for material interfaces, second order Godunov-type hyperbolic solvers, and the embedded boundary method for the elliptic problem in complex domains. The numerical algorithm has been implemented as an MHD extension of FronTier, a hydrodynamic code with free interface support. The code is applicable for numerical simulations of free surface flows of conductive liquids or weakly ionized plasmas. The code has been validated through the comparison of numerical simulations of a liquid metal jet in a non-uniform magnetic field with experiments and theory. Simulations of the Muon Collider/Neutrino Factory target have also been discussed.

Numerical Study of Periodic Traveling Wave Solutions for the Predator-Prey Model with Landscape Features

NASA Astrophysics Data System (ADS)

Yun, Ana; Shin, Jaemin; Li, Yibao; Lee, Seunggyu; Kim, Junseok

We numerically investigate periodic traveling wave solutions for a diffusive predator-prey system with landscape features. The landscape features are modeled through the homogeneous Dirichlet boundary condition which is imposed at the edge of the obstacle domain. To effectively treat the Dirichlet boundary condition, we employ a robust and accurate numerical technique by using a boundary control function. We also propose a robust algorithm for calculating the numerical periodicity of the traveling wave solution. In numerical experiments, we show that periodic traveling waves which move out and away from the obstacle are effectively generated. We explain the formation of the traveling waves by comparing the wavelengths. The spatial asynchrony has been shown in quantitative detail for various obstacles. Furthermore, we apply our numerical technique to the complicated real landscape features.

Unstructured grid methods for the simulation of 3D transient flows

NASA Technical Reports Server (NTRS)

Morgan, K.; Peraire, J.; Peiro, J.

1994-01-01

A description of the research work undertaken under NASA Research Grant NAGW-2962 has been given. Basic algorithmic development work, undertaken for the simulation of steady three dimensional inviscid flow, has been used as the basis for the construction of a procedure for the simulation of truly transient flows in three dimensions. To produce a viable procedure for implementation on the current generation of computers, moving boundary components are simulated by fixed boundaries plus a suitably modified boundary condition. Computational efficiency is increased by the use of an implicit time stepping scheme in which the equation system is solved by explicit multistage time stepping with multigrid acceleration. The viability of the proposed approach has been demonstrated by considering the application of the procedure to simulation of a transonic flow over an oscillating ONERA M6 wing.

Discretization of three-dimensional free surface flows and moving boundary problems via elliptic grid methods based on variational principles

NASA Astrophysics Data System (ADS)

Fraggedakis, D.; Papaioannou, J.; Dimakopoulos, Y.; Tsamopoulos, J.

2017-09-01

A new boundary-fitted technique to describe free surface and moving boundary problems is presented. We have extended the 2D elliptic grid generator developed by Dimakopoulos and Tsamopoulos (2003) [19] and further advanced by Chatzidai et al. (2009) [18] to 3D geometries. The set of equations arises from the fulfillment of the variational principles established by Brackbill and Saltzman (1982) [21], and refined by Christodoulou and Scriven (1992) [22]. These account for both smoothness and orthogonality of the grid lines of tessellated physical domains. The elliptic-grid equations are accompanied by new boundary constraints and conditions which are based either on the equidistribution of the nodes on boundary surfaces or on the existing 2D quasi-elliptic grid methodologies. The capabilities of the proposed algorithm are first demonstrated in tests with analytically described complex surfaces. The sequence in which these tests are presented is chosen to help the reader build up experience on the best choice of the elliptic grid parameters. Subsequently, the mesh equations are coupled with the Navier-Stokes equations, in order to reveal the full potential of the proposed methodology in free surface flows. More specifically, the problem of gas assisted injection in ducts of circular and square cross-sections is examined, where the fluid domain experiences extreme deformations. Finally, the flow-mesh solver is used to calculate the equilibrium shapes of static menisci in capillary tubes.

Dynamically Evolving Sectors for Convective Weather Impact

NASA Technical Reports Server (NTRS)

Drew, Michael C.

2010-01-01

A new strategy for altering existing sector boundaries in response to blocking convective weather is presented. This method seeks to improve the reduced capacity of sectors directly affected by weather by moving boundaries in a direction that offers the greatest capacity improvement. The boundary deformations are shared by neighboring sectors within the region in a manner that preserves their shapes and sizes as much as possible. This reduces the controller workload involved with learning new sector designs. The algorithm that produces the altered sectors is based on a force-deflection mesh model that needs only nominal traffic patterns and the shape of the blocking weather for input. It does not require weather-affected traffic patterns that would have to be predicted by simulation. When compared to an existing optimal sector design method, the sectors produced by the new algorithm are more similar to the original sector shapes, resulting in sectors that may be more suitable for operational use because the change is not as drastic. Also, preliminary results show that this method produces sectors that can equitably distribute the workload of rerouted weather-affected traffic throughout the region where inclement weather is present. This is demonstrated by sector aircraft count distributions of simulated traffic in weather-affected regions.

The solution of the Elrod algorithm for a dynamically loaded journal bearing using multigrid techniques

NASA Technical Reports Server (NTRS)

Woods, Claudia M.; Brewe, David E.

1988-01-01

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed utilizing a multigrid iteration technique. The method is compared with a noniterative approach in terms of computational time and accuracy. The computational model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobsson-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via a smeared mass or striated flow extending to both surfaces in the film gap. The mixed nature of the equations (parabolic in the full film zone and hyperbolic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

The solution of the Elrod algorithm for a dynamically loaded journal bearing using multigrid techniques

NASA Technical Reports Server (NTRS)

Woods, C. M.; Brewe, D. E.

1989-01-01

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed utilizing a multigrid iteration technique. The method is compared with a noniterative approach in terms of computational time and accuracy. The computational model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobsson-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via a smeared mass or striated flow extending to both surfaces in the film gap. The mixed nature of the equations (parabolic in the full film zone and hyperbolic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

The use of multigrid techniques in the solution of the Elrod algorithm for a dynamically loaded journal bearing. M.S. Thesis. Final Report

NASA Technical Reports Server (NTRS)

Woods, Claudia M.

1988-01-01

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed, utilizing a multigrid iterative technique. The code is compared with a presently existing direct solution in terms of computational time and accuracy. The model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobssen-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via liquid striations. The mixed nature of the equations (elliptic in the full film zone and nonelliptic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

Many-body calculations of low energy eigenstates in magnetic and periodic systems with self healing diffusion Monte Carlo: steps beyond the fixed-phase

DOE Office of Scientific and Technical Information (OSTI.GOV)

Reboredo, Fernando A.

The self-healing diffusion Monte Carlo algorithm (SHDMC) [Reboredo, Hood and Kent, Phys. Rev. B {\\bf 79}, 195117 (2009), Reboredo, {\\it ibid.} {\\bf 80}, 125110 (2009)] is extended to study the ground and excited states of magnetic and periodic systems. A recursive optimization algorithm is derived from the time evolution of the mixed probability density. The mixed probability density is given by an ensemble of electronic configurations (walkers) with complex weight. This complex weigh allows the amplitude of the fix-node wave function to move away from the trial wave function phase. This novel approach is both a generalization of SHDMC andmore » the fixed-phase approximation [Ortiz, Ceperley and Martin Phys Rev. Lett. {\\bf 71}, 2777 (1993)]. When used recursively it improves simultaneously the node and phase. The algorithm is demonstrated to converge to the nearly exact solutions of model systems with periodic boundary conditions or applied magnetic fields. The method is also applied to obtain low energy excitations with magnetic field or periodic boundary conditions. The potential applications of this new method to study periodic, magnetic, and complex Hamiltonians are discussed.« less

Segmentation and tracking in echocardiographic sequences: active contours guided by optical flow estimates

NASA Technical Reports Server (NTRS)

Mikic, I.; Krucinski, S.; Thomas, J. D.

1998-01-01

This paper presents a method for segmentation and tracking of cardiac structures in ultrasound image sequences. The developed algorithm is based on the active contour framework. This approach requires initial placement of the contour close to the desired position in the image, usually an object outline. Best contour shape and position are then calculated, assuming that at this configuration a global energy function, associated with a contour, attains its minimum. Active contours can be used for tracking by selecting a solution from a previous frame as an initial position in a present frame. Such an approach, however, fails for large displacements of the object of interest. This paper presents a technique that incorporates the information on pixel velocities (optical flow) into the estimate of initial contour to enable tracking of fast-moving objects. The algorithm was tested on several ultrasound image sequences, each covering one complete cardiac cycle. The contour successfully tracked boundaries of mitral valve leaflets, aortic root and endocardial borders of the left ventricle. The algorithm-generated outlines were compared against manual tracings by expert physicians. The automated method resulted in contours that were within the boundaries of intraobserver variability.

CALL FOR PAPERS: Topical issue on the nonstationary Casimir effect and quantum systems with moving boundaries

NASA Astrophysics Data System (ADS)

Barton, Gabriel; Dodonov, Victor V.; Man'ko, Vladimir I.

2004-05-01

The past few years have seen a growing interest in quantum mechanical systems with moving boundaries. One of its manifestations was the First International Workshop on Problems with Moving Boundaries organized by Professor J Dittrich in Prague in October 2003. Another event in this series will be the (first) International Workshop on the Dynamical Casimir Effect in Padua in June 2004, organized by Professor G Carugno (see webpage www.pd.infn.it/casimir/ for details). As Guest Editors we invite researchers working in any area related to moving boundaries to contribute to a Topical Issue of Journal of Optics B: Quantum and Semiclassical Optics on the nonstationary Casimir effect and quantum systems with moving boundaries. Our intention is to cover a wide range of topics. In particular, we envisage possible contributions in the following areas: Theoretical and experimental studies on quantum fields in cavities with moving boundaries and time-dependent media. This area includes, in particular, various manifestations of the nonstationary (dynamical) Casimir effect, such as creation of quanta and modifications of Casimir force due to the motion of boundaries. Other relevant subjects are: generation and evolution of nonclassical states of fields and moving mirrors; interaction between quantized fields and atoms in cavities with moving boundaries; decoherence and entanglement due to the motion of boundaries; field quantization in nonideal cavities with moving boundaries taking into account losses and dispersion; nano-devices with moving boundaries. Quantum particles in domains confined with moving boundaries. This area includes: new exact and approximate solutions of the evolution equations (Schrödinger, Klein-Gordon, Dirac, Fokker-Planck, etc); quantum carpets and revivals; escape and tunnelling through moving barriers; evolution of quantum packets in the presence of moving boundaries; ultracold atoms (ions) in traps with moving boundaries. The topical issue is scheduled for publication in March 2005 and the deadline for submission of contributions is 1 August 2004. The Editorial Division of Institute of Physics Publishing at the P. N. Lebedev Physical Institute in Moscow will oversee editorial procedures in association with the main Publishing Office in Bristol. All contributions will be peer-reviewed in accordance with the normal refereeing procedures and standards of Journal of Optics B: Quantum and Semiclassical Optics. Submissions should preferably be in either standard LaTeX form or Microsoft Word. Advice on publishing your work in the journal may be found at www.iop.org/journals/authors/jopb. There are no page charges for publication. Contributions to the topical issue, quoting `Topical Issue/NCE', should be submitted by e-mail to IOPP@sci.lebedev.ru or as hard copy (enclosing the electronic code) to IOPP Division, P. N. Lebedev Physical Institute, Leninskii Prospect 53, Moscow 119991 Russia.

3D Staggered-Grid Finite-Difference Simulation of Acoustic Waves in Turbulent Moving Media

NASA Astrophysics Data System (ADS)

Symons, N. P.; Aldridge, D. F.; Marlin, D.; Wilson, D. K.; Sullivan, P.; Ostashev, V.

2003-12-01

Acoustic wave propagation in a three-dimensional heterogeneous moving atmosphere is accurately simulated with a numerical algorithm recently developed under the DOD Common High Performance Computing Software Support Initiative (CHSSI). Sound waves within such a dynamic environment are mathematically described by a set of four, coupled, first-order partial differential equations governing small-amplitude fluctuations in pressure and particle velocity. The system is rigorously derived from fundamental principles of continuum mechanics, ideal-fluid constitutive relations, and reasonable assumptions that the ambient atmospheric motion is adiabatic and divergence-free. An explicit, time-domain, finite-difference (FD) numerical scheme is used to solve the system for both pressure and particle velocity wavefields. The atmosphere is characterized by 3D gridded models of sound speed, mass density, and the three components of the wind velocity vector. Dependent variables are stored on staggered spatial and temporal grids, and centered FD operators possess 2nd-order and 4th-order space/time accuracy. Accurate sound wave simulation is achieved provided grid intervals are chosen appropriately. The gridding must be fine enough to reduce numerical dispersion artifacts to an acceptable level and maintain stability. The algorithm is designed to execute on parallel computational platforms by utilizing a spatial domain-decomposition strategy. Currently, the algorithm has been validated on four different computational platforms, and parallel scalability of approximately 85% has been demonstrated. Comparisons with analytic solutions for uniform and vertically stratified wind models indicate that the FD algorithm generates accurate results with either a vanishing pressure or vanishing vertical-particle velocity boundary condition. Simulations are performed using a kinematic turbulence wind profile developed with the quasi-wavelet method. In addition, preliminary results are presented using high-resolution 3D dynamic turbulent flowfields generated by a large-eddy simulation model of a stably stratified planetary boundary layer. Sandia National Laboratories is a operated by Sandia Corporation, a Lockheed Martin Company, for the USDOE under contract 94-AL85000.

Use of the temporal median and trimmed mean mitigates effects of respiratory motion in multiple-acquisition abdominal diffusion imaging

NASA Astrophysics Data System (ADS)

Jerome, N. P.; Orton, M. R.; d'Arcy, J. A.; Feiweier, T.; Tunariu, N.; Koh, D.-M.; Leach, M. O.; Collins, D. J.

2015-01-01

Respiratory motion commonly confounds abdominal diffusion-weighted magnetic resonance imaging, where averaging of successive samples at different parts of the respiratory cycle, performed in the scanner, manifests the motion as blurring of tissue boundaries and structural features and can introduce bias into calculated diffusion metrics. Storing multiple averages separately allows processing using metrics other than the mean; in this prospective volunteer study, median and trimmed mean values of signal intensity for each voxel over repeated averages and diffusion-weighting directions are shown to give images with sharper tissue boundaries and structural features for moving tissues, while not compromising non-moving structures. Expert visual scoring of derived diffusion maps is significantly higher for the median than for the mean, with modest improvement from the trimmed mean. Diffusion metrics derived from mono- and bi-exponential diffusion models are comparable for non-moving structures, demonstrating a lack of introduced bias from using the median. The use of the median is a simple and computationally inexpensive alternative to complex and expensive registration algorithms, requiring only additional data storage (and no additional scanning time) while returning visually superior images that will facilitate the appropriate placement of regions-of-interest when analysing abdominal diffusion-weighted magnetic resonance images, for assessment of disease characteristics and treatment response.

Use of the temporal median and trimmed mean mitigates effects of respiratory motion in multiple-acquisition abdominal diffusion imaging.

PubMed

Jerome, N P; Orton, M R; d'Arcy, J A; Feiweier, T; Tunariu, N; Koh, D-M; Leach, M O; Collins, D J

2015-01-21

Respiratory motion commonly confounds abdominal diffusion-weighted magnetic resonance imaging, where averaging of successive samples at different parts of the respiratory cycle, performed in the scanner, manifests the motion as blurring of tissue boundaries and structural features and can introduce bias into calculated diffusion metrics. Storing multiple averages separately allows processing using metrics other than the mean; in this prospective volunteer study, median and trimmed mean values of signal intensity for each voxel over repeated averages and diffusion-weighting directions are shown to give images with sharper tissue boundaries and structural features for moving tissues, while not compromising non-moving structures. Expert visual scoring of derived diffusion maps is significantly higher for the median than for the mean, with modest improvement from the trimmed mean. Diffusion metrics derived from mono- and bi-exponential diffusion models are comparable for non-moving structures, demonstrating a lack of introduced bias from using the median. The use of the median is a simple and computationally inexpensive alternative to complex and expensive registration algorithms, requiring only additional data storage (and no additional scanning time) while returning visually superior images that will facilitate the appropriate placement of regions-of-interest when analysing abdominal diffusion-weighted magnetic resonance images, for assessment of disease characteristics and treatment response.

A color gamut description algorithm for liquid crystal displays in CIELAB space.

PubMed

Sun, Bangyong; Liu, Han; Li, Wenli; Zhou, Shisheng

2014-01-01

Because the accuracy of gamut boundary description is significant for gamut mapping process, a gamut boundary calculating method for LCD monitors is proposed in this paper. Within most of the previous gamut boundary calculation algorithms, the gamut boundary is calculated in CIELAB space directly, and part of inside-gamut points are mistaken for the boundary points. While, in the new proposed algorithm, the points on the surface of RGB cube are selected as the boundary points, and then converted and described in CIELAB color space. Thus, in our algorithm, the true gamut boundary points are found and a more accurate gamut boundary is described. In experiment, a Toshiba LCD monitor's 3D CIELAB gamut for evaluation is firstly described which has regular-shaped outer surface, and then two 2D gamut boundaries ( CIE-a*b* boundary and CIE-C*L* boundary) are calculated which are often used in gamut mapping process. When our algorithm is compared with several famous gamut calculating algorithms, the gamut volumes are very close, which indicates that our algorithm's accuracy is precise and acceptable.

A Color Gamut Description Algorithm for Liquid Crystal Displays in CIELAB Space

PubMed Central

Sun, Bangyong; Liu, Han; Li, Wenli; Zhou, Shisheng

2014-01-01

Because the accuracy of gamut boundary description is significant for gamut mapping process, a gamut boundary calculating method for LCD monitors is proposed in this paper. Within most of the previous gamut boundary calculation algorithms, the gamut boundary is calculated in CIELAB space directly, and part of inside-gamut points are mistaken for the boundary points. While, in the new proposed algorithm, the points on the surface of RGB cube are selected as the boundary points, and then converted and described in CIELAB color space. Thus, in our algorithm, the true gamut boundary points are found and a more accurate gamut boundary is described. In experiment, a Toshiba LCD monitor's 3D CIELAB gamut for evaluation is firstly described which has regular-shaped outer surface, and then two 2D gamut boundaries ( CIE-a*b* boundary and CIE-C*L* boundary) are calculated which are often used in gamut mapping process. When our algorithm is compared with several famous gamut calculating algorithms, the gamut volumes are very close, which indicates that our algorithm's accuracy is precise and acceptable. PMID:24892068

Bounded fractional diffusion in geological media: Definition and Lagrangian approximation

NASA Astrophysics Data System (ADS)

Zhang, Yong; Green, Christopher T.; LaBolle, Eric M.; Neupauer, Roseanna M.; Sun, HongGuang

2016-11-01

Spatiotemporal fractional-derivative models (FDMs) have been increasingly used to simulate non-Fickian diffusion, but methods have not been available to define boundary conditions for FDMs in bounded domains. This study defines boundary conditions and then develops a Lagrangian solver to approximate bounded, one-dimensional fractional diffusion. Both the zero-value and nonzero-value Dirichlet, Neumann, and mixed Robin boundary conditions are defined, where the sign of Riemann-Liouville fractional derivative (capturing nonzero-value spatial-nonlocal boundary conditions with directional superdiffusion) remains consistent with the sign of the fractional-diffusive flux term in the FDMs. New Lagrangian schemes are then proposed to track solute particles moving in bounded domains, where the solutions are checked against analytical or Eulerian solutions available for simplified FDMs. Numerical experiments show that the particle-tracking algorithm for non-Fickian diffusion differs from Fickian diffusion in relocating the particle position around the reflective boundary, likely due to the nonlocal and nonsymmetric fractional diffusion. For a nonzero-value Neumann or Robin boundary, a source cell with a reflective face can be applied to define the release rate of random-walking particles at the specified flux boundary. Mathematical definitions of physically meaningful nonlocal boundaries combined with bounded Lagrangian solvers in this study may provide the only viable techniques at present to quantify the impact of boundaries on anomalous diffusion, expanding the applicability of FDMs from infinite domains to those with any size and boundary conditions.

CELFE: Coupled Eulerian-Lagrangian Finite Element program for high velocity impact. Part 1: Theory and formulation. [hydroelasto-viscoplastic model

NASA Technical Reports Server (NTRS)

Lee, C. H.

1978-01-01

A 3-D finite element program capable of simulating the dynamic behavior in the vicinity of the impact point, together with predicting the dynamic response in the remaining part of the structural component subjected to high velocity impact is discussed. The finite algorithm is formulated in a general moving coordinate system. In the vicinity of the impact point contained by a moving failure front, the relative velocity of the coordinate system will approach the material particle velocity. The dynamic behavior inside the region is described by Eulerian formulation based on a hydroelasto-viscoplastic model. The failure front which can be regarded as the boundary of the impact zone is described by a transition layer. The layer changes the representation from the Eulerian mode to the Lagrangian mode outside the failure front by varying the relative velocity of the coordinate system to zero. The dynamic response in the remaining part of the structure described by the Lagrangian formulation is treated using advanced structural analysis. An interfacing algorithm for coupling CELFE with NASTRAN is constructed to provide computational capabilities for large structures.

The analytical solution for drug delivery system with nonhomogeneous moving boundary condition

NASA Astrophysics Data System (ADS)

Saudi, Muhamad Hakimi; Mahali, Shalela Mohd; Harun, Fatimah Noor

2017-08-01

This paper discusses the development and the analytical solution of a mathematical model based on drug release system from a swelling delivery device. The mathematical model is represented by a one-dimensional advection-diffusion equation with nonhomogeneous moving boundary condition. The solution procedures consist of three major steps. Firstly, the application of steady state solution method, which is used to transform the nonhomogeneous moving boundary condition to homogeneous boundary condition. Secondly, the application of the Landau transformation technique that gives a significant impact in removing the advection term in the system of equation and transforming the moving boundary condition to a fixed boundary condition. Thirdly, the used of separation of variables method to find the analytical solution for the resulted initial boundary value problem. The results show that the swelling rate of delivery device and drug release rate is influenced by value of growth factor r.

TDAAPS 2: Acoustic Wave Propagation in Attenuative Moving Media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Preston, Leiph A.

This report outlines recent enhancements to the TDAAPS algorithm first described by Symons et al., 2005. One of the primary additions to the code is the ability to specify an attenuative media using standard linear fluid mechanisms to match reasonably general frequency versus loss curves, including common frequency versus loss curves for the atmosphere and seawater. Other improvements that will be described are the addition of improved numerical boundary conditions via various forms of Perfectly Matched Layers, enhanced accuracy near high contrast media interfaces, and improved physics options.

Switching moving boundary models for two-phase flow evaporators and condensers

NASA Astrophysics Data System (ADS)

Bonilla, Javier; Dormido, Sebastián; Cellier, François E.

2015-03-01

The moving boundary method is an appealing approach for the design, testing and validation of advanced control schemes for evaporators and condensers. When it comes to advanced control strategies, not only accurate but fast dynamic models are required. Moving boundary models are fast low-order dynamic models, and they can describe the dynamic behavior with high accuracy. This paper presents a mathematical formulation based on physical principles for two-phase flow moving boundary evaporator and condenser models which support dynamic switching between all possible flow configurations. The models were implemented in a library using the equation-based object-oriented Modelica language. Several integrity tests in steady-state and transient predictions together with stability tests verified the models. Experimental data from a direct steam generation parabolic-trough solar thermal power plant is used to validate and compare the developed moving boundary models against finite volume models.

Probabilistic Open Set Recognition

NASA Astrophysics Data System (ADS)

Jain, Lalit Prithviraj

Real-world tasks in computer vision, pattern recognition and machine learning often touch upon the open set recognition problem: multi-class recognition with incomplete knowledge of the world and many unknown inputs. An obvious way to approach such problems is to develop a recognition system that thresholds probabilities to reject unknown classes. Traditional rejection techniques are not about the unknown; they are about the uncertain boundary and rejection around that boundary. Thus traditional techniques only represent the "known unknowns". However, a proper open set recognition algorithm is needed to reduce the risk from the "unknown unknowns". This dissertation examines this concept and finds existing probabilistic multi-class recognition approaches are ineffective for true open set recognition. We hypothesize the cause is due to weak adhoc assumptions combined with closed-world assumptions made by existing calibration techniques. Intuitively, if we could accurately model just the positive data for any known class without overfitting, we could reject the large set of unknown classes even under this assumption of incomplete class knowledge. For this, we formulate the problem as one of modeling positive training data by invoking statistical extreme value theory (EVT) near the decision boundary of positive data with respect to negative data. We provide a new algorithm called the PI-SVM for estimating the unnormalized posterior probability of class inclusion. This dissertation also introduces a new open set recognition model called Compact Abating Probability (CAP), where the probability of class membership decreases in value (abates) as points move from known data toward open space. We show that CAP models improve open set recognition for multiple algorithms. Leveraging the CAP formulation, we go on to describe the novel Weibull-calibrated SVM (W-SVM) algorithm, which combines the useful properties of statistical EVT for score calibration with one-class and binary support vector machines. Building from the success of statistical EVT based recognition methods such as PI-SVM and W-SVM on the open set problem, we present a new general supervised learning algorithm for multi-class classification and multi-class open set recognition called the Extreme Value Local Basis (EVLB). The design of this algorithm is motivated by the observation that extrema from known negative class distributions are the closest negative points to any positive sample during training, and thus should be used to define the parameters of a probabilistic decision model. In the EVLB, the kernel distribution for each positive training sample is estimated via an EVT distribution fit over the distances to the separating hyperplane between positive training sample and closest negative samples, with a subset of the overall positive training data retained to form a probabilistic decision boundary. Using this subset as a frame of reference, the probability of a sample at test time decreases as it moves away from the positive class. Possessing this property, the EVLB is well-suited to open set recognition problems where samples from unknown or novel classes are encountered at test. Our experimental evaluation shows that the EVLB provides a substantial improvement in scalability compared to standard radial basis function kernel machines, as well as P I-SVM and W-SVM, with improved accuracy in many cases. We evaluate our algorithm on open set variations of the standard visual learning benchmarks, as well as with an open subset of classes from Caltech 256 and ImageNet. Our experiments show that PI-SVM, WSVM and EVLB provide significant advances over the previous state-of-the-art solutions for the same tasks.

An Indoor Continuous Positioning Algorithm on the Move by Fusing Sensors and Wi-Fi on Smartphones.

PubMed

Li, Huaiyu; Chen, Xiuwan; Jing, Guifei; Wang, Yuan; Cao, Yanfeng; Li, Fei; Zhang, Xinlong; Xiao, Han

2015-12-11

Wi-Fi indoor positioning algorithms experience large positioning error and low stability when continuously positioning terminals that are on the move. This paper proposes a novel indoor continuous positioning algorithm that is on the move, fusing sensors and Wi-Fi on smartphones. The main innovative points include an improved Wi-Fi positioning algorithm and a novel positioning fusion algorithm named the Trust Chain Positioning Fusion (TCPF) algorithm. The improved Wi-Fi positioning algorithm was designed based on the properties of Wi-Fi signals on the move, which are found in a novel "quasi-dynamic" Wi-Fi signal experiment. The TCPF algorithm is proposed to realize the "process-level" fusion of Wi-Fi and Pedestrians Dead Reckoning (PDR) positioning, including three parts: trusted point determination, trust state and positioning fusion algorithm. An experiment is carried out for verification in a typical indoor environment, and the average positioning error on the move is 1.36 m, a decrease of 28.8% compared to an existing algorithm. The results show that the proposed algorithm can effectively reduce the influence caused by the unstable Wi-Fi signals, and improve the accuracy and stability of indoor continuous positioning on the move.

Boundary states at reflective moving boundaries

NASA Astrophysics Data System (ADS)

Acosta Minoli, Cesar A.; Kopriva, David A.

2012-06-01

We derive and evaluate boundary states for Maxwell's equations, the linear, and the nonlinear Euler gas-dynamics equations to compute wave reflection from moving boundaries. In this study we use a Discontinuous Galerkin Spectral Element method (DGSEM) with Arbitrary Lagrangian-Eulerian (ALE) mapping for the spatial approximation, but the boundary states can be used with other methods, like finite volume schemes. We present four studies using Maxwell's equations, one for the linear Euler equations, and one more for the nonlinear Euler equations. These are: reflection of light from a plane mirror moving at constant velocity, reflection of light from a moving cylinder, reflection of light from a vibrating mirror, reflection of sound from a plane wall and dipole sound generation by an oscillating cylinder in an inviscid flow. The studies show that the boundary states preserve spectral convergence in the solution and in derived quantities like divergence and vorticity.

Bounded fractional diffusion in geological media: Definition and Lagrangian approximation

USGS Publications Warehouse

Zhang, Yong; Green, Christopher T.; LaBolle, Eric M.; Neupauer, Roseanna M.; Sun, HongGuang

2016-01-01

Spatiotemporal Fractional-Derivative Models (FDMs) have been increasingly used to simulate non-Fickian diffusion, but methods have not been available to define boundary conditions for FDMs in bounded domains. This study defines boundary conditions and then develops a Lagrangian solver to approximate bounded, one-dimensional fractional diffusion. Both the zero-value and non-zero-value Dirichlet, Neumann, and mixed Robin boundary conditions are defined, where the sign of Riemann-Liouville fractional derivative (capturing non-zero-value spatial-nonlocal boundary conditions with directional super-diffusion) remains consistent with the sign of the fractional-diffusive flux term in the FDMs. New Lagrangian schemes are then proposed to track solute particles moving in bounded domains, where the solutions are checked against analytical or Eularian solutions available for simplified FDMs. Numerical experiments show that the particle-tracking algorithm for non-Fickian diffusion differs from Fickian diffusion in relocating the particle position around the reflective boundary, likely due to the non-local and non-symmetric fractional diffusion. For a non-zero-value Neumann or Robin boundary, a source cell with a reflective face can be applied to define the release rate of random-walking particles at the specified flux boundary. Mathematical definitions of physically meaningful nonlocal boundaries combined with bounded Lagrangian solvers in this study may provide the only viable techniques at present to quantify the impact of boundaries on anomalous diffusion, expanding the applicability of FDMs from infinite do mains to those with any size and boundary conditions.

The moving confluence route technology with WAD scheme for 3D hydrodynamic simulation in high altitude inland waters

NASA Astrophysics Data System (ADS)

Wang, Yonggui; Yang, Yinqun; Chen, Xiaolong; Engel, Bernard A.; Zhang, Wanshun

2018-04-01

For three-dimensional hydrodynamic simulations in inland waters, the rapid changes with moving boundary and various input conditions should be considered. Some models are developed with moving boundary but the dynamic change of discharges is unresolved or ignored. For better hydrodynamic simulation in inland waters, the widely used 3D model, ECOMSED, has been improved by moving confluence route (MCR) method with a wetting and drying scheme (WAD). The fixed locations of water and pollutants inputs from tributaries, point sources and non-point sources have been changed to dynamic confluence routes as the boundary moving. The improved model was applied in an inland water area, Qingshuihai reservoir, Kunming City, China, for a one-year hydrodynamic simulation. The results were verified by water level, flow velocity and water mass conservation. Detailed water level variation analysis and velocity field comparison at different times showed that the improved model has better performance for simulating the boundary moving phenomenon and moving discharges along with water level changing than the original one. The improved three-dimensional model is available for hydrodynamics simulation in water bodies where water boundary shifts along with change of water level and have various inlets.

Algorithms for Discovery of Multiple Markov Boundaries

PubMed Central

Statnikov, Alexander; Lytkin, Nikita I.; Lemeire, Jan; Aliferis, Constantin F.

2013-01-01

Algorithms for Markov boundary discovery from data constitute an important recent development in machine learning, primarily because they offer a principled solution to the variable/feature selection problem and give insight on local causal structure. Over the last decade many sound algorithms have been proposed to identify a single Markov boundary of the response variable. Even though faithful distributions and, more broadly, distributions that satisfy the intersection property always have a single Markov boundary, other distributions/data sets may have multiple Markov boundaries of the response variable. The latter distributions/data sets are common in practical data-analytic applications, and there are several reasons why it is important to induce multiple Markov boundaries from such data. However, there are currently no sound and efficient algorithms that can accomplish this task. This paper describes a family of algorithms TIE* that can discover all Markov boundaries in a distribution. The broad applicability as well as efficiency of the new algorithmic family is demonstrated in an extensive benchmarking study that involved comparison with 26 state-of-the-art algorithms/variants in 15 data sets from a diversity of application domains. PMID:25285052

Indoor Trajectory Tracking Scheme Based on Delaunay Triangulation and Heuristic Information in Wireless Sensor Networks.

PubMed

Qin, Junping; Sun, Shiwen; Deng, Qingxu; Liu, Limin; Tian, Yonghong

2017-06-02

Object tracking and detection is one of the most significant research areas for wireless sensor networks. Existing indoor trajectory tracking schemes in wireless sensor networks are based on continuous localization and moving object data mining. Indoor trajectory tracking based on the received signal strength indicator ( RSSI ) has received increased attention because it has low cost and requires no special infrastructure. However, RSSI tracking introduces uncertainty because of the inaccuracies of measurement instruments and the irregularities (unstable, multipath, diffraction) of wireless signal transmissions in indoor environments. Heuristic information includes some key factors for trajectory tracking procedures. This paper proposes a novel trajectory tracking scheme based on Delaunay triangulation and heuristic information (TTDH). In this scheme, the entire field is divided into a series of triangular regions. The common side of adjacent triangular regions is regarded as a regional boundary. Our scheme detects heuristic information related to a moving object's trajectory, including boundaries and triangular regions. Then, the trajectory is formed by means of a dynamic time-warping position-fingerprint-matching algorithm with heuristic information constraints. Field experiments show that the average error distance of our scheme is less than 1.5 m, and that error does not accumulate among the regions.

The boundary condition at the valve for numerical modelling of transient pipe flow with fluid structure interaction

NASA Astrophysics Data System (ADS)

Henclik, S.

2014-08-01

Transient flows in pipes (water hammer = WH) do appear in various situations and the accompanying pressure waves may involve serious perturbations in system functioning. To model these effects properly in the case of elastic pipe the dynamic fluid-structure interaction (FSI) should be taken into account. Fluid-structure couplings appear in various manners and the junction coupling is considered to be the strongest. This effect can be especially significant if the pipe can move as a whole body, which is possible when all its supports are not rigid. In the current paper a similar effect is numerically modelled. The pipe is fixed rigidly, but the valve at the end has a spring-dashpot mounting system, thus its motion is possible when WH is excited by the valve closuring. The boundary condition at the moving valve is modelled as a differential equation of motion. The valve hydraulic characteristics during closuring period are assumed by a time dependence of its loss factor. Preliminary numerical tests of that algorithm were done with an own computer program and it was found that the proper valve fixing system may produce significant lowering of WH pressures.

Performance of flapping airfoil propulsion with LBM method and DMD analysis

NASA Astrophysics Data System (ADS)

Li, Bing-Hua; Huang, Xian-Wen; Zheng, Yao; Xie, Fang-Fang; Wang, Jing; Zou, Jian-Feng

2018-05-01

In this work, the performance of flapping airfoil propulsion at low Reynolds number of Re = 100-400 is studied numerically with the lattice Boltzmann method (LBM). Combined with immersed boundary method (IBM), the LBM has been widely used to simulate moving boundary problems. The influences of the reduced frequency on the plunging and pitching airfoil are explored. It is found that the leading-edge vertex separation and inverted wake structures are two main coherent structures, which dominate the flapping airfoil propulsion. However, the two structures play different roles in the flow and the combination effects on the propulsion need to be clarified. To do so, we adopt the dynamic mode decomposition (DMD) algorithm to reveal the underlying physics. The DMD has been proven to be very suitable for analyzing the complex transient systems like the vortex structure of flapping flight.

An Indoor Continuous Positioning Algorithm on the Move by Fusing Sensors and Wi-Fi on Smartphones

PubMed Central

Li, Huaiyu; Chen, Xiuwan; Jing, Guifei; Wang, Yuan; Cao, Yanfeng; Li, Fei; Zhang, Xinlong; Xiao, Han

2015-01-01

Wi-Fi indoor positioning algorithms experience large positioning error and low stability when continuously positioning terminals that are on the move. This paper proposes a novel indoor continuous positioning algorithm that is on the move, fusing sensors and Wi-Fi on smartphones. The main innovative points include an improved Wi-Fi positioning algorithm and a novel positioning fusion algorithm named the Trust Chain Positioning Fusion (TCPF) algorithm. The improved Wi-Fi positioning algorithm was designed based on the properties of Wi-Fi signals on the move, which are found in a novel “quasi-dynamic” Wi-Fi signal experiment. The TCPF algorithm is proposed to realize the “process-level” fusion of Wi-Fi and Pedestrians Dead Reckoning (PDR) positioning, including three parts: trusted point determination, trust state and positioning fusion algorithm. An experiment is carried out for verification in a typical indoor environment, and the average positioning error on the move is 1.36 m, a decrease of 28.8% compared to an existing algorithm. The results show that the proposed algorithm can effectively reduce the influence caused by the unstable Wi-Fi signals, and improve the accuracy and stability of indoor continuous positioning on the move. PMID:26690447

Detecting Phase Boundaries in Hard-Sphere Suspensions

NASA Technical Reports Server (NTRS)

McDowell, Mark; Rogers, Richard B.; Gray, Elizabeth

2009-01-01

A special image-data-processing technique has been developed for use in experiments that involve observation, via optical microscopes equipped with electronic cameras, of moving boundaries between the colloidal-solid and colloidal-liquid phases of colloidal suspensions of monodisperse hard spheres. During an experiment, it is necessary to adjust the position of a microscope to keep the phase boundary within view. A boundary typically moves at a speed of the order of microns per hour. Because an experiment can last days or even weeks, it is impractical to require human intervention to keep the phase boundary in view. The present image-data-processing technique yields results within a computation time short enough to enable generation of automated-microscope-positioning commands to track the moving phase boundary

A finite element algorithm for high-lying eigenvalues with Neumann and Dirichlet boundary conditions

NASA Astrophysics Data System (ADS)

Báez, G.; Méndez-Sánchez, R. A.; Leyvraz, F.; Seligman, T. H.

2014-01-01

We present a finite element algorithm that computes eigenvalues and eigenfunctions of the Laplace operator for two-dimensional problems with homogeneous Neumann or Dirichlet boundary conditions, or combinations of either for different parts of the boundary. We use an inverse power plus Gauss-Seidel algorithm to solve the generalized eigenvalue problem. For Neumann boundary conditions the method is much more efficient than the equivalent finite difference algorithm. We checked the algorithm by comparing the cumulative level density of the spectrum obtained numerically with the theoretical prediction given by the Weyl formula. We found a systematic deviation due to the discretization, not to the algorithm itself.

Three-dimensional local ALE-FEM method for fluid flow in domains containing moving boundaries/objects interfaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carrington, David Bradley; Monayem, A. K. M.; Mazumder, H.

2015-03-05

A three-dimensional finite element method for the numerical simulations of fluid flow in domains containing moving rigid objects or boundaries is developed. The method falls into the general category of Arbitrary Lagrangian Eulerian methods; it is based on a fixed mesh that is locally adapted in the immediate vicinity of the moving interfaces and reverts to its original shape once the moving interfaces go past the elements. The moving interfaces are defined by separate sets of marker points so that the global mesh is independent of interface movement and the possibility of mesh entanglement is eliminated. The results is amore » fully robust formulation capable of calculating on domains of complex geometry with moving boundaries or devises that can also have a complex geometry without danger of the mesh becoming unsuitable due to its continuous deformation thus eliminating the need for repeated re-meshing and interpolation. Moreover, the boundary conditions on the interfaces are imposed exactly. This work is intended to support the internal combustion engines simulator KIVA developed at Los Alamos National Laboratories. The model's capabilities are illustrated through application to incompressible flows in different geometrical settings that show the robustness and flexibility of the technique to perform simulations involving moving boundaries in a three-dimensional domain.« less

Coverage Extension and Balancing the Transmitted Power of the Moving Relay Node at LTE-A Cellular Network

PubMed Central

Aldhaibani, Jaafar A.; Yahya, Abid; Ahmad, R. Badlishah

2014-01-01

The poor capacity at cell boundaries is not enough to meet the growing demand and stringent design which required high capacity and throughput irrespective of user's location in the cellular network. In this paper, we propose new schemes for an optimum fixed relay node (RN) placement in LTE-A cellular network to enhance throughput and coverage extension at cell edge region. The proposed approach mitigates interferences between all nodes and ensures optimum utilization with the optimization of transmitted power. Moreover, we proposed a new algorithm to balance the transmitted power of moving relay node (MR) over cell size and providing required SNR and throughput at the users inside vehicle along with reducing the transmitted power consumption by MR. The numerical analysis along with the simulation results indicates that an improvement in capacity for users is 40% increment at downlink transmission from cell capacity. Furthermore, the results revealed that there is saving nearly 75% from transmitted power in MR after using proposed balancing algorithm. ATDI simulator was used to verify the numerical results, which deals with real digital cartographic and standard formats for terrain. PMID:24672378

Coverage extension and balancing the transmitted power of the moving relay node at LTE-A cellular network.

PubMed

Aldhaibani, Jaafar A; Yahya, Abid; Ahmad, R Badlishah

2014-01-01

The poor capacity at cell boundaries is not enough to meet the growing demand and stringent design which required high capacity and throughput irrespective of user's location in the cellular network. In this paper, we propose new schemes for an optimum fixed relay node (RN) placement in LTE-A cellular network to enhance throughput and coverage extension at cell edge region. The proposed approach mitigates interferences between all nodes and ensures optimum utilization with the optimization of transmitted power. Moreover, we proposed a new algorithm to balance the transmitted power of moving relay node (MR) over cell size and providing required SNR and throughput at the users inside vehicle along with reducing the transmitted power consumption by MR. The numerical analysis along with the simulation results indicates that an improvement in capacity for users is 40% increment at downlink transmission from cell capacity. Furthermore, the results revealed that there is saving nearly 75% from transmitted power in MR after using proposed balancing algorithm. ATDI simulator was used to verify the numerical results, which deals with real digital cartographic and standard formats for terrain.

Numerical Simulation of Flow Through an Artificial Heart

NASA Technical Reports Server (NTRS)

Rogers, Stuart E.; Kutler, Paul; Kwak, Dochan; Kiris, Cetin

1989-01-01

A solution procedure was developed that solves the unsteady, incompressible Navier-Stokes equations, and was used to numerically simulate viscous incompressible flow through a model of the Pennsylvania State artificial heart. The solution algorithm is based on the artificial compressibility method, and uses flux-difference splitting to upwind the convective terms; a line-relaxation scheme is used to solve the equations. The time-accuracy of the method is obtained by iteratively solving the equations at each physical time step. The artificial heart geometry involves a piston-type action with a moving solid wall. A single H-grid is fit inside the heart chamber. The grid is continuously compressed and expanded with a constant number of grid points to accommodate the moving piston. The computational domain ends at the valve openings where nonreflective boundary conditions based on the method of characteristics are applied. Although a number of simplifing assumptions were made regarding the geometry, the computational results agreed reasonably well with an experimental picture. The computer time requirements for this flow simulation, however, are quite extensive. Computational study of this type of geometry would benefit greatly from improvements in computer hardware speed and algorithm efficiency enhancements.

Model creation of moving redox reaction boundary in agarose gel electrophoresis by traditional potassium permanganate method.

PubMed

Xie, Hai-Yang; Liu, Qian; Li, Jia-Hao; Fan, Liu-Yin; Cao, Cheng-Xi

2013-02-21

A novel moving redox reaction boundary (MRRB) model was developed for studying electrophoretic behaviors of analytes involving redox reaction on the principle of moving reaction boundary (MRB). Traditional potassium permanganate method was used to create the boundary model in agarose gel electrophoresis because of the rapid reaction rate associated with MnO(4)(-) ions and Fe(2+) ions. MRB velocity equation was proposed to describe the general functional relationship between velocity of moving redox reaction boundary (V(MRRB)) and concentration of reactant, and can be extrapolated to similar MRB techniques. Parameters affecting the redox reaction boundary were investigated in detail. Under the selected conditions, good linear relationship between boundary movement distance and time were obtained. The potential application of MRRB in electromigration redox reaction titration was performed in two different concentration levels. The precision of the V(MRRB) was studied and the relative standard deviations were below 8.1%, illustrating the good repeatability achieved in this experiment. The proposed MRRB model enriches the MRB theory and also provides a feasible realization of manual control of redox reaction process in electrophoretic analysis.

Predicting Loss-of-Control Boundaries Toward a Piloting Aid

NASA Technical Reports Server (NTRS)

Barlow, Jonathan; Stepanyan, Vahram; Krishnakumar, Kalmanje

2012-01-01

This work presents an approach to predicting loss-of-control with the goal of providing the pilot a decision aid focused on maintaining the pilot's control action within predicted loss-of-control boundaries. The predictive architecture combines quantitative loss-of-control boundaries, a data-based predictive control boundary estimation algorithm and an adaptive prediction method to estimate Markov model parameters in real-time. The data-based loss-of-control boundary estimation algorithm estimates the boundary of a safe set of control inputs that will keep the aircraft within the loss-of-control boundaries for a specified time horizon. The adaptive prediction model generates estimates of the system Markov Parameters, which are used by the data-based loss-of-control boundary estimation algorithm. The combined algorithm is applied to a nonlinear generic transport aircraft to illustrate the features of the architecture.

Global stability analysis of axisymmetric boundary layer over a circular cylinder

NASA Astrophysics Data System (ADS)

Bhoraniya, Ramesh; Vinod, Narayanan

2018-05-01

This paper presents a linear global stability analysis of the incompressible axisymmetric boundary layer on a circular cylinder. The base flow is parallel to the axis of the cylinder at inflow boundary. The pressure gradient is zero in the streamwise direction. The base flow velocity profile is fully non-parallel and non-similar in nature. The boundary layer grows continuously in the spatial directions. Linearized Navier-Stokes (LNS) equations are derived for the disturbance flow quantities in the cylindrical polar coordinates. The LNS equations along with homogeneous boundary conditions forms a generalized eigenvalues problem. Since the base flow is axisymmetric, the disturbances are periodic in azimuthal direction. Chebyshev spectral collocation method and Arnoldi's iterative algorithm is used for the solution of the general eigenvalues problem. The global temporal modes are computed for the range of Reynolds numbers and different azimuthal wave numbers. The largest imaginary part of the computed eigenmodes is negative, and hence, the flow is temporally stable. The spatial structure of the eigenmodes shows that the disturbance amplitudes grow in size and magnitude while they are moving towards downstream. The global modes of axisymmetric boundary layer are more stable than that of 2D flat-plate boundary layer at low Reynolds number. However, at higher Reynolds number they approach 2D flat-plate boundary layer. Thus, the damping effect of transverse curvature is significant at low Reynolds number. The wave-like nature of the disturbance amplitudes is found in the streamwise direction for the least stable eigenmodes.

Nonuniform Moving Boundary Method for Computational Fluid Dynamics Simulation of Intrathecal Cerebrospinal Flow Distribution in a Cynomolgus Monkey.

PubMed

Khani, Mohammadreza; Xing, Tao; Gibbs, Christina; Oshinski, John N; Stewart, Gregory R; Zeller, Jillynne R; Martin, Bryn A

2017-08-01

A detailed quantification and understanding of cerebrospinal fluid (CSF) dynamics may improve detection and treatment of central nervous system (CNS) diseases and help optimize CSF system-based delivery of CNS therapeutics. This study presents a computational fluid dynamics (CFD) model that utilizes a nonuniform moving boundary approach to accurately reproduce the nonuniform distribution of CSF flow along the spinal subarachnoid space (SAS) of a single cynomolgus monkey. A magnetic resonance imaging (MRI) protocol was developed and applied to quantify subject-specific CSF space geometry and flow and define the CFD domain and boundary conditions. An algorithm was implemented to reproduce the axial distribution of unsteady CSF flow by nonuniform deformation of the dura surface. Results showed that maximum difference between the MRI measurements and CFD simulation of CSF flow rates was <3.6%. CSF flow along the entire spine was laminar with a peak Reynolds number of ∼150 and average Womersley number of ∼5.4. Maximum CSF flow rate was present at the C4-C5 vertebral level. Deformation of the dura ranged up to a maximum of 134 μm. Geometric analysis indicated that total spinal CSF space volume was ∼8.7 ml. Average hydraulic diameter, wetted perimeter, and SAS area were 2.9 mm, 37.3 mm and 27.24 mm2, respectively. CSF pulse wave velocity (PWV) along the spine was quantified to be 1.2 m/s.

Heterogeneous Vision Data Fusion for Independently Moving Cameras

DTIC Science & Technology

2010-03-01

target detection , tracking , and identification over a large terrain. The goal of the project is to investigate and evaluate the existing image...fusion algorithms, develop new real-time algorithms for Category-II image fusion, and apply these algorithms in moving target detection and tracking . The...moving target detection and classification. 15. SUBJECT TERMS Image Fusion, Target Detection , Moving Cameras, IR Camera, EO Camera 16. SECURITY

Detection and Tracking of Moving Objects with Real-Time Onboard Vision System

NASA Astrophysics Data System (ADS)

Erokhin, D. Y.; Feldman, A. B.; Korepanov, S. E.

2017-05-01

Detection of moving objects in video sequence received from moving video sensor is a one of the most important problem in computer vision. The main purpose of this work is developing set of algorithms, which can detect and track moving objects in real time computer vision system. This set includes three main parts: the algorithm for estimation and compensation of geometric transformations of images, an algorithm for detection of moving objects, an algorithm to tracking of the detected objects and prediction their position. The results can be claimed to create onboard vision systems of aircraft, including those relating to small and unmanned aircraft.

Exact Solution for Capillary Bridges Properties by Shooting Method

NASA Astrophysics Data System (ADS)

Qiang-Nian, Li; Jia-Qi, Zhang; Feng-Xi, Zhou

2017-04-01

The investigation of liquid bridge force acting between wet particles has great significance in many fields. In this article, the exact solution of capillary force between two unequal-sized spherical particles is investigated. Firstly, The Young-Laplace equation with moving boundary is converted into a set of ordinary differential equations with two fix point boundary using variable substitution technique, in which the gravity effects have been neglected. The geometry of the liquid bridge between two particles is solved by shooting method. After that, the gorge method is applied to calculate the capillary-bridge force that is consists of contributions from the capillary suction and surface tension. Finally, the effect of various parameters including distance between two spheres, radii of spheres, and contact angles on the capillary force are investigated. It is shown that the presented approach is an efficient and accurate algorithm for capillary force between two particles in complex situations.

Solving Fluid Structure Interaction Problems with an Immersed Boundary Method

NASA Technical Reports Server (NTRS)

Barad, Michael F.; Brehm, Christoph; Kiris, Cetin C.

2016-01-01

An immersed boundary method for the compressible Navier-Stokes equations can be used for moving boundary problems as well as fully coupled fluid-structure interaction is presented. The underlying Cartesian immersed boundary method of the Launch Ascent and Vehicle Aerodynamics (LAVA) framework, based on the locally stabilized immersed boundary method previously presented by the authors, is extended to account for unsteady boundary motion and coupled to linear and geometrically nonlinear structural finite element solvers. The approach is validated for moving boundary problems with prescribed body motion and fully coupled fluid structure interaction problems. Keywords: Immersed Boundary Method, Higher-Order Finite Difference Method, Fluid Structure Interaction.

A VERSATILE SHARP INTERFACE IMMERSED BOUNDARY METHOD FOR INCOMPRESSIBLE FLOWS WITH COMPLEX BOUNDARIES

PubMed Central

Mittal, R.; Dong, H.; Bozkurttas, M.; Najjar, F.M.; Vargas, A.; von Loebbecke, A.

2010-01-01

A sharp interface immersed boundary method for simulating incompressible viscous flow past three-dimensional immersed bodies is described. The method employs a multi-dimensional ghost-cell methodology to satisfy the boundary conditions on the immersed boundary and the method is designed to handle highly complex three-dimensional, stationary, moving and/or deforming bodies. The complex immersed surfaces are represented by grids consisting of unstructured triangular elements; while the flow is computed on non-uniform Cartesian grids. The paper describes the salient features of the methodology with special emphasis on the immersed boundary treatment for stationary and moving boundaries. Simulations of a number of canonical two- and three-dimensional flows are used to verify the accuracy and fidelity of the solver over a range of Reynolds numbers. Flow past suddenly accelerated bodies are used to validate the solver for moving boundary problems. Finally two cases inspired from biology with highly complex three-dimensional bodies are simulated in order to demonstrate the versatility of the method. PMID:20216919

Computer-aided US diagnosis of breast lesions by using cell-based contour grouping.

PubMed

Cheng, Jie-Zhi; Chou, Yi-Hong; Huang, Chiun-Sheng; Chang, Yeun-Chung; Tiu, Chui-Mei; Chen, Kuei-Wu; Chen, Chung-Ming

2010-06-01

To develop a computer-aided diagnostic algorithm with automatic boundary delineation for differential diagnosis of benign and malignant breast lesions at ultrasonography (US) and investigate the effect of boundary quality on the performance of a computer-aided diagnostic algorithm. This was an institutional review board-approved retrospective study with waiver of informed consent. A cell-based contour grouping (CBCG) segmentation algorithm was used to delineate the lesion boundaries automatically. Seven morphologic features were extracted. The classifier was a logistic regression function. Five hundred twenty breast US scans were obtained from 520 subjects (age range, 15-89 years), including 275 benign (mean size, 15 mm; range, 5-35 mm) and 245 malignant (mean size, 18 mm; range, 8-29 mm) lesions. The newly developed computer-aided diagnostic algorithm was evaluated on the basis of boundary quality and differentiation performance. The segmentation algorithms and features in two conventional computer-aided diagnostic algorithms were used for comparative study. The CBCG-generated boundaries were shown to be comparable with the manually delineated boundaries. The area under the receiver operating characteristic curve (AUC) and differentiation accuracy were 0.968 +/- 0.010 and 93.1% +/- 0.7, respectively, for all 520 breast lesions. At the 5% significance level, the newly developed algorithm was shown to be superior to the use of the boundaries and features of the two conventional computer-aided diagnostic algorithms in terms of AUC (0.974 +/- 0.007 versus 0.890 +/- 0.008 and 0.788 +/- 0.024, respectively). The newly developed computer-aided diagnostic algorithm that used a CBCG segmentation method to measure boundaries achieved a high differentiation performance. Copyright RSNA, 2010

A dissipative particle dynamics method for arbitrarily complex geometries

NASA Astrophysics Data System (ADS)

Li, Zhen; Bian, Xin; Tang, Yu-Hang; Karniadakis, George Em

2018-02-01

Dissipative particle dynamics (DPD) is an effective Lagrangian method for modeling complex fluids in the mesoscale regime but so far it has been limited to relatively simple geometries. Here, we formulate a local detection method for DPD involving arbitrarily shaped geometric three-dimensional domains. By introducing an indicator variable of boundary volume fraction (BVF) for each fluid particle, the boundary of arbitrary-shape objects is detected on-the-fly for the moving fluid particles using only the local particle configuration. Therefore, this approach eliminates the need of an analytical description of the boundary and geometry of objects in DPD simulations and makes it possible to load the geometry of a system directly from experimental images or computer-aided designs/drawings. More specifically, the BVF of a fluid particle is defined by the weighted summation over its neighboring particles within a cutoff distance. Wall penetration is inferred from the value of the BVF and prevented by a predictor-corrector algorithm. The no-slip boundary condition is achieved by employing effective dissipative coefficients for liquid-solid interactions. Quantitative evaluations of the new method are performed for the plane Poiseuille flow, the plane Couette flow and the Wannier flow in a cylindrical domain and compared with their corresponding analytical solutions and (high-order) spectral element solution of the Navier-Stokes equations. We verify that the proposed method yields correct no-slip boundary conditions for velocity and generates negligible fluctuations of density and temperature in the vicinity of the wall surface. Moreover, we construct a very complex 3D geometry - the "Brown Pacman" microfluidic device - to explicitly demonstrate how to construct a DPD system with complex geometry directly from loading a graphical image. Subsequently, we simulate the flow of a surfactant solution through this complex microfluidic device using the new method. Its effectiveness is demonstrated by examining the rich dynamics of surfactant micelles, which are flowing around multiple small cylinders and stenotic regions in the microfluidic device without wall penetration. In addition to stationary arbitrary-shape objects, the new method is particularly useful for problems involving moving and deformable boundaries, because it only uses local information of neighboring particles and satisfies the desired boundary conditions on-the-fly.

Automatic extraction of building boundaries using aerial LiDAR data

NASA Astrophysics Data System (ADS)

Wang, Ruisheng; Hu, Yong; Wu, Huayi; Wang, Jian

2016-01-01

Building extraction is one of the main research topics of the photogrammetry community. This paper presents automatic algorithms for building boundary extractions from aerial LiDAR data. First, segmenting height information generated from LiDAR data, the outer boundaries of aboveground objects are expressed as closed chains of oriented edge pixels. Then, building boundaries are distinguished from nonbuilding ones by evaluating their shapes. The candidate building boundaries are reconstructed as rectangles or regular polygons by applying new algorithms, following the hypothesis verification paradigm. These algorithms include constrained searching in Hough space, enhanced Hough transformation, and the sequential linking technique. The experimental results show that the proposed algorithms successfully extract building boundaries at rates of 97%, 85%, and 92% for three LiDAR datasets with varying scene complexities.

Algorithm based on regional separation for automatic grain boundary extraction using improved mean shift method

NASA Astrophysics Data System (ADS)

Zhenying, Xu; Jiandong, Zhu; Qi, Zhang; Yamba, Philip

2018-06-01

Metallographic microscopy shows that the vast majority of metal materials are composed of many small grains; the grain size of a metal is important for determining the tensile strength, toughness, plasticity, and other mechanical properties. In order to quantitatively evaluate grain size in metals, grain boundaries must be identified in metallographic images. Based on the phenomenon of grain boundary blurring or disconnection in metallographic images, this study develops an algorithm based on regional separation for automatically extracting grain boundaries by an improved mean shift method. Experimental observation shows that the grain boundaries obtained by the proposed algorithm are highly complete and accurate. This research has practical value because the proposed algorithm is suitable for grain boundary extraction from most metallographic images.

Topology optimization analysis based on the direct coupling of the boundary element method and the level set method

NASA Astrophysics Data System (ADS)

Vitório, Paulo Cezar; Leonel, Edson Denner

2017-12-01

The structural design must ensure suitable working conditions by attending for safe and economic criteria. However, the optimal solution is not easily available, because these conditions depend on the bodies' dimensions, materials strength and structural system configuration. In this regard, topology optimization aims for achieving the optimal structural geometry, i.e. the shape that leads to the minimum requirement of material, respecting constraints related to the stress state at each material point. The present study applies an evolutionary approach for determining the optimal geometry of 2D structures using the coupling of the boundary element method (BEM) and the level set method (LSM). The proposed algorithm consists of mechanical modelling, topology optimization approach and structural reconstruction. The mechanical model is composed of singular and hyper-singular BEM algebraic equations. The topology optimization is performed through the LSM. Internal and external geometries are evolved by the LS function evaluated at its zero level. The reconstruction process concerns the remeshing. Because the structural boundary moves at each iteration, the body's geometry change and, consequently, a new mesh has to be defined. The proposed algorithm, which is based on the direct coupling of such approaches, introduces internal cavities automatically during the optimization process, according to the intensity of Von Mises stress. The developed optimization model was applied in two benchmarks available in the literature. Good agreement was observed among the results, which demonstrates its efficiency and accuracy.

Fermionic edge states and new physics

NASA Astrophysics Data System (ADS)

Govindarajan, T. R.; Tibrewala, Rakesh

2015-08-01

We investigate the properties of the Dirac operator on manifolds with boundaries in the presence of the Atiyah-Patodi-Singer boundary condition. An exact counting of the number of edge states for boundaries with isometry of a sphere is given. We show that the problem with the above boundary condition can be mapped to one where the manifold is extended beyond the boundary and the boundary condition is replaced by a delta function potential of suitable strength. We also briefly highlight how the problem of the self-adjointness of the operators in the presence of moving boundaries can be simplified by suitable transformations which render the boundary fixed and modify the Hamiltonian and the boundary condition to reflect the effect of moving boundary.

A Review of Algorithms for Segmentation of Optical Coherence Tomography from Retina

PubMed Central

Kafieh, Raheleh; Rabbani, Hossein; Kermani, Saeed

2013-01-01

Optical coherence tomography (OCT) is a recently established imaging technique to describe different information about the internal structures of an object and to image various aspects of biological tissues. OCT image segmentation is mostly introduced on retinal OCT to localize the intra-retinal boundaries. Here, we review some of the important image segmentation methods for processing retinal OCT images. We may classify the OCT segmentation approaches into five distinct groups according to the image domain subjected to the segmentation algorithm. Current researches in OCT segmentation are mostly based on improving the accuracy and precision, and on reducing the required processing time. There is no doubt that current 3-D imaging modalities are now moving the research projects toward volume segmentation along with 3-D rendering and visualization. It is also important to develop robust methods capable of dealing with pathologic cases in OCT imaging. PMID:24083137

Quantitative three-dimensional transrectal ultrasound (TRUS) for prostate imaging

NASA Astrophysics Data System (ADS)

Pathak, Sayan D.; Aarnink, Rene G.; de la Rosette, Jean J.; Chalana, Vikram; Wijkstra, Hessel; Haynor, David R.; Debruyne, Frans M. J.; Kim, Yongmin

1998-06-01

With the number of men seeking medical care for prostate diseases rising steadily, the need of a fast and accurate prostate boundary detection and volume estimation tool is being increasingly experienced by the clinicians. Currently, these measurements are made manually, which results in a large examination time. A possible solution is to improve the efficiency by automating the boundary detection and volume estimation process with minimal involvement from the human experts. In this paper, we present an algorithm based on SNAKES to detect the boundaries. Our approach is to selectively enhance the contrast along the edges using an algorithm called sticks and integrate it with a SNAKES model. This integrated algorithm requires an initial curve for each ultrasound image to initiate the boundary detection process. We have used different schemes to generate the curves with a varying degree of automation and evaluated its effects on the algorithm performance. After the boundaries are identified, the prostate volume is calculated using planimetric volumetry. We have tested our algorithm on 6 different prostate volumes and compared the performance against the volumes manually measured by 3 experts. With the increase in the user inputs, the algorithm performance improved as expected. The results demonstrate that given an initial contour reasonably close to the prostate boundaries, the algorithm successfully delineates the prostate boundaries in an image, and the resulting volume measurements are in close agreement with those made by the human experts.

ALGORITHM TO REDUCE APPROXIMATION ERROR FROM THE COMPLEX-VARIABLE BOUNDARY-ELEMENT METHOD APPLIED TO SOIL FREEZING.

USGS Publications Warehouse

Hromadka, T.V.; Guymon, G.L.

1985-01-01

An algorithm is presented for the numerical solution of the Laplace equation boundary-value problem, which is assumed to apply to soil freezing or thawing. The Laplace equation is numerically approximated by the complex-variable boundary-element method. The algorithm aids in reducing integrated relative error by providing a true measure of modeling error along the solution domain boundary. This measure of error can be used to select locations for adding, removing, or relocating nodal points on the boundary or to provide bounds for the integrated relative error of unknown nodal variable values along the boundary.

Adaptive step-size algorithm for Fourier beam-propagation method with absorbing boundary layer of auto-determined width.

PubMed

Learn, R; Feigenbaum, E

2016-06-01

Two algorithms that enhance the utility of the absorbing boundary layer are presented, mainly in the framework of the Fourier beam-propagation method. One is an automated boundary layer width selector that chooses a near-optimal boundary size based on the initial beam shape. The second algorithm adjusts the propagation step sizes based on the beam shape at the beginning of each step in order to reduce aliasing artifacts.

Adaptive step-size algorithm for Fourier beam-propagation method with absorbing boundary layer of auto-determined width

DOE Office of Scientific and Technical Information (OSTI.GOV)

Learn, R.; Feigenbaum, E.

Two algorithms that enhance the utility of the absorbing boundary layer are presented, mainly in the framework of the Fourier beam-propagation method. One is an automated boundary layer width selector that chooses a near-optimal boundary size based on the initial beam shape. Furthermore, the second algorithm adjusts the propagation step sizes based on the beam shape at the beginning of each step in order to reduce aliasing artifacts.

Adaptive step-size algorithm for Fourier beam-propagation method with absorbing boundary layer of auto-determined width

DOE PAGES

Learn, R.; Feigenbaum, E.

2016-05-27

Two algorithms that enhance the utility of the absorbing boundary layer are presented, mainly in the framework of the Fourier beam-propagation method. One is an automated boundary layer width selector that chooses a near-optimal boundary size based on the initial beam shape. Furthermore, the second algorithm adjusts the propagation step sizes based on the beam shape at the beginning of each step in order to reduce aliasing artifacts.

Video Shot Boundary Detection Using QR-Decomposition and Gaussian Transition Detection

NASA Astrophysics Data System (ADS)

Amiri, Ali; Fathy, Mahmood

2010-12-01

This article explores the problem of video shot boundary detection and examines a novel shot boundary detection algorithm by using QR-decomposition and modeling of gradual transitions by Gaussian functions. Specifically, the authors attend to the challenges of detecting gradual shots and extracting appropriate spatiotemporal features that affect the ability of algorithms to efficiently detect shot boundaries. The algorithm utilizes the properties of QR-decomposition and extracts a block-wise probability function that illustrates the probability of video frames to be in shot transitions. The probability function has abrupt changes in hard cut transitions, and semi-Gaussian behavior in gradual transitions. The algorithm detects these transitions by analyzing the probability function. Finally, we will report the results of the experiments using large-scale test sets provided by the TRECVID 2006, which has assessments for hard cut and gradual shot boundary detection. These results confirm the high performance of the proposed algorithm.

CFD study of the flow pattern in an ultrasonic horn reactor: Introducing a realistic vibrating boundary condition.

PubMed

Rahimi, Masoud; Movahedirad, Salman; Shahhosseini, Shahrokh

2017-03-01

Recently, great attention has been paid to predict the acoustic streaming field distribution inside the sonoreactors, induced by high-power ultrasonic wave generator. The focus of this paper is to model an ultrasonic vibrating horn and study the induced flow pattern with a newly developed moving boundary condition. The numerical simulation utilizes the modified cavitation model along with the "mixture" model for turbulent flow (RNG, k-ε), and a moving boundary condition with an oscillating parabolic-logarithmic profile, applied to the horn tip. This moving-boundary provides the situation in which the center of the horn tip vibrates stronger than that of the peripheral regions. The velocity field obtained by computational fluid dynamic was in a reasonably good agreement with the PIV results. The moving boundary model is more accurate since it better approximates the movement of the horn tip in the ultrasonic assisted process. From an optimizing point of view, the model with the new moving boundary is more suitable than the conventional models for design purposes because the displacement magnitude of the horn tip is the only fitting parameter. After developing and validating the numerical model, the model was utilized to predict various quantities such as cavitation zone, pressure field and stream function that are not experimentally feasible to measure. Copyright © 2016 Elsevier B.V. All rights reserved.

LiveWire interactive boundary extraction algorithm based on Haar wavelet transform and control point set direction search

NASA Astrophysics Data System (ADS)

Cheng, Jun; Zhang, Jun; Tian, Jinwen

2015-12-01

Based on deep analysis of the LiveWire interactive boundary extraction algorithm, a new algorithm focusing on improving the speed of LiveWire algorithm is proposed in this paper. Firstly, the Haar wavelet transform is carried on the input image, and the boundary is extracted on the low resolution image obtained by the wavelet transform of the input image. Secondly, calculating LiveWire shortest path is based on the control point set direction search by utilizing the spatial relationship between the two control points users provide in real time. Thirdly, the search order of the adjacent points of the starting node is set in advance. An ordinary queue instead of a priority queue is taken as the storage pool of the points when optimizing their shortest path value, thus reducing the complexity of the algorithm from O[n2] to O[n]. Finally, A region iterative backward projection method based on neighborhood pixel polling has been used to convert dual-pixel boundary of the reconstructed image to single-pixel boundary after Haar wavelet inverse transform. The algorithm proposed in this paper combines the advantage of the Haar wavelet transform and the advantage of the optimal path searching method based on control point set direction search. The former has fast speed of image decomposition and reconstruction and is more consistent with the texture features of the image and the latter can reduce the time complexity of the original algorithm. So that the algorithm can improve the speed in interactive boundary extraction as well as reflect the boundary information of the image more comprehensively. All methods mentioned above have a big role in improving the execution efficiency and the robustness of the algorithm.

On mechanical waves and Doppler shifts from moving boundaries

DOE PAGES

Christov, Ivan C.; Christov, Christo I.

2017-02-01

We investigate the propagation of infinitesimal harmonic mechanical waves emitted from a boundary with variable velocity and arriving at a stationary observer. In the classical Doppler effect, X s(t)=vt is the location of the source with constant velocity v. In the present work, however, we consider a source co-located with a moving boundary x=X s(t), where X s(t) can have an arbitrary functional form. For ‘slowly moving’ boundaries (i.e., ones for which the timescale set by the mechanical motion is large in comparison to the inverse of the frequency of the emitted wave), we present a multiple-scale asymptotic analysis of the moving boundary problem for the linear wave equation. Here, we obtain a closed-form leading-order (with respect to the latter small parameter) solution and show that the variable velocity of the boundary results not only in frequency modulation but also in amplitude modulation of the received signal. Consequently, our results extend the applicability of two basic tenets of the theory of a moving source on a stationary domain, specifically that (i)more » $$.\\atop{x}_s$$ for non-uniform boundary motion can be inserted in place of the constant velocity v in the classical Doppler formula and (ii) that the non-uniform boundary motion introduces variability in the amplitude of the wave. The specific examples of decelerating and oscillatory boundary motion are worked out and illustrated.« less

Grid generation methodology and CFD simulations in sliding vane compressors and expanders

NASA Astrophysics Data System (ADS)

Bianchi, Giuseppe; Rane, Sham; Kovacevic, Ahmed; Cipollone, Roberto; Murgia, Stefano; Contaldi, Giulio

2017-08-01

The limiting factor for the employment of advanced 3D CFD tools in the analysis and design of rotary vane machines is the unavailability of methods for generation of computational grids suitable for fast and reliable numerical analysis. The paper addresses this challenge presenting the development of an analytical grid generation for vane machines that is based on the user defined nodal displacement. In particular, mesh boundaries are defined as parametric curves generated using trigonometrical modelling of the axial cross section of the machine while the distribution of computational nodes is performed using algebraic algorithms with transfinite interpolation, post orthogonalisation and smoothing. Algebraic control functions are introduced for distribution of nodes on the rotor and casing boundaries in order to achieve good grid quality in terms of cell size and expansion. In this way, the moving and deforming fluid domain of the sliding vane machine is discretized and the conservation of intrinsic quantities in ensured by maintaining the cell connectivity and structure. For validation of generated grids, a mid-size air compressor and a small-scale expander for Organic Rankine Cycle applications have been investigated in this paper. Remarks on implementation of the mesh motion algorithm, stability and robustness experienced with the ANSYS CFX solver as well as the obtained flow results are presented.

Clustering analysis of moving target signatures

NASA Astrophysics Data System (ADS)

Martone, Anthony; Ranney, Kenneth; Innocenti, Roberto

2010-04-01

Previously, we developed a moving target indication (MTI) processing approach to detect and track slow-moving targets inside buildings, which successfully detected moving targets (MTs) from data collected by a low-frequency, ultra-wideband radar. Our MTI algorithms include change detection, automatic target detection (ATD), clustering, and tracking. The MTI algorithms can be implemented in a real-time or near-real-time system; however, a person-in-the-loop is needed to select input parameters for the clustering algorithm. Specifically, the number of clusters to input into the cluster algorithm is unknown and requires manual selection. A critical need exists to automate all aspects of the MTI processing formulation. In this paper, we investigate two techniques that automatically determine the number of clusters: the adaptive knee-point (KP) algorithm and the recursive pixel finding (RPF) algorithm. The KP algorithm is based on a well-known heuristic approach for determining the number of clusters. The RPF algorithm is analogous to the image processing, pixel labeling procedure. Both algorithms are used to analyze the false alarm and detection rates of three operational scenarios of personnel walking inside wood and cinderblock buildings.

EM algorithm applied for estimating non-stationary region boundaries using electrical impedance tomography

NASA Astrophysics Data System (ADS)

Khambampati, A. K.; Rashid, A.; Kim, B. S.; Liu, Dong; Kim, S.; Kim, K. Y.

2010-04-01

EIT has been used for the dynamic estimation of organ boundaries. One specific application in this context is the estimation of lung boundaries during pulmonary circulation. This would help track the size and shape of lungs of the patients suffering from diseases like pulmonary edema and acute respiratory failure (ARF). The dynamic boundary estimation of the lungs can also be utilized to set and control the air volume and pressure delivered to the patients during artificial ventilation. In this paper, the expectation-maximization (EM) algorithm is used as an inverse algorithm to estimate the non-stationary lung boundary. The uncertainties caused in Kalman-type filters due to inaccurate selection of model parameters are overcome using EM algorithm. Numerical experiments using chest shaped geometry are carried out with proposed method and the performance is compared with extended Kalman filter (EKF). Results show superior performance of EM in estimation of the lung boundary.

Applying Workspace Limitations in a Velocity-Controlled Robotic Mechanism

NASA Technical Reports Server (NTRS)

Abdallah, Muhammad E. (Inventor); Hargrave, Brian (Inventor); Platt, Robert J., Jr. (Inventor)

2014-01-01

A robotic system includes a robotic mechanism responsive to velocity control signals, and a permissible workspace defined by a convex-polygon boundary. A host machine determines a position of a reference point on the mechanism with respect to the boundary, and includes an algorithm for enforcing the boundary by automatically shaping the velocity control signals as a function of the position, thereby providing smooth and unperturbed operation of the mechanism along the edges and corners of the boundary. The algorithm is suited for application with higher speeds and/or external forces. A host machine includes an algorithm for enforcing the boundary by shaping the velocity control signals as a function of the reference point position, and a hardware module for executing the algorithm. A method for enforcing the convex-polygon boundary is also provided that shapes a velocity control signal via a host machine as a function of the reference point position.

Computational aeroelasticity using a pressure-based solver

NASA Astrophysics Data System (ADS)

Kamakoti, Ramji

A computational methodology for performing fluid-structure interaction computations for three-dimensional elastic wing geometries is presented. The flow solver used is based on an unsteady Reynolds-Averaged Navier-Stokes (RANS) model. A well validated k-ε turbulence model with wall function treatment for near wall region was used to perform turbulent flow calculations. Relative merits of alternative flow solvers were investigated. The predictor-corrector-based Pressure Implicit Splitting of Operators (PISO) algorithm was found to be computationally economic for unsteady flow computations. Wing structure was modeled using Bernoulli-Euler beam theory. A fully implicit time-marching scheme (using the Newmark integration method) was used to integrate the equations of motion for structure. Bilinear interpolation and linear extrapolation techniques were used to transfer necessary information between fluid and structure solvers. Geometry deformation was accounted for by using a moving boundary module. The moving grid capability was based on a master/slave concept and transfinite interpolation techniques. Since computations were performed on a moving mesh system, the geometric conservation law must be preserved. This is achieved by appropriately evaluating the Jacobian values associated with each cell. Accurate computation of contravariant velocities for unsteady flows using the momentum interpolation method on collocated, curvilinear grids was also addressed. Flutter computations were performed for the AGARD 445.6 wing at subsonic, transonic and supersonic Mach numbers. Unsteady computations were performed at various dynamic pressures to predict the flutter boundary. Results showed favorable agreement of experiment and previous numerical results. The computational methodology exhibited capabilities to predict both qualitative and quantitative features of aeroelasticity.

Neural substrates of perceptual integration during bistable object perception

PubMed Central

Flevaris, Anastasia V.; Martínez, Antigona; Hillyard, Steven A.

2013-01-01

The way we perceive an object depends both on feedforward, bottom-up processing of its physical stimulus properties and on top-down factors such as attention, context, expectation, and task relevance. Here we compared neural activity elicited by varying perceptions of the same physical image—a bistable moving image in which perception spontaneously alternates between dissociated fragments and a single, unified object. A time-frequency analysis of EEG changes associated with the perceptual switch from object to fragment and vice versa revealed a greater decrease in alpha (8–12 Hz) accompanying the switch to object percept than to fragment percept. Recordings of event-related potentials elicited by irrelevant probes superimposed on the moving image revealed an enhanced positivity between 184 and 212 ms when the probes were contained within the boundaries of the perceived unitary object. The topography of the positivity (P2) in this latency range elicited by probes during object perception was distinct from the topography elicited by probes during fragment perception, suggesting that the neural processing of probes differed as a function of perceptual state. Two source localization algorithms estimated the neural generator of this object-related difference to lie in the lateral occipital cortex, a region long associated with object perception. These data suggest that perceived objects attract attention, incorporate visual elements occurring within their boundaries into unified object representations, and enhance the visual processing of elements occurring within their boundaries. Importantly, the perceived object in this case emerged as a function of the fluctuating perceptual state of the viewer. PMID:24246467

A Mobile Anchor Assisted Localization Algorithm Based on Regular Hexagon in Wireless Sensor Networks

PubMed Central

Rodrigues, Joel J. P. C.

2014-01-01

Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints of cost and power consumption make it infeasible to equip each sensor node in the network with a global position system (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution. PMID:25133212

Mass-conserved volumetric lattice Boltzmann method for complex flows with willfully moving boundaries.

PubMed

Yu, Huidan; Chen, Xi; Wang, Zhiqiang; Deep, Debanjan; Lima, Everton; Zhao, Ye; Teague, Shawn D

2014-06-01

In this paper, we develop a mass-conserved volumetric lattice Boltzmann method (MCVLBM) for numerically solving fluid dynamics with willfully moving arbitrary boundaries. In MCVLBM, fluid particles are uniformly distributed in lattice cells and the lattice Boltzmann equations deal with the time evolution of the particle distribution function. By introducing a volumetric parameter P(x,y,z,t) defined as the occupation of solid volume in the cell, we distinguish three types of lattice cells in the simulation domain: solid cell (pure solid occupation, P=1), fluid cell (pure fluid occupation, P=0), and boundary cell (partial solid and partial fluid, 0

Moving overlapping grids with adaptive mesh refinement for high-speed reactive and non-reactive flow

NASA Astrophysics Data System (ADS)

Henshaw, William D.; Schwendeman, Donald W.

2006-08-01

We consider the solution of the reactive and non-reactive Euler equations on two-dimensional domains that evolve in time. The domains are discretized using moving overlapping grids. In a typical grid construction, boundary-fitted grids are used to represent moving boundaries, and these grids overlap with stationary background Cartesian grids. Block-structured adaptive mesh refinement (AMR) is used to resolve fine-scale features in the flow such as shocks and detonations. Refinement grids are added to base-level grids according to an estimate of the error, and these refinement grids move with their corresponding base-level grids. The numerical approximation of the governing equations takes place in the parameter space of each component grid which is defined by a mapping from (fixed) parameter space to (moving) physical space. The mapped equations are solved numerically using a second-order extension of Godunov's method. The stiff source term in the reactive case is handled using a Runge-Kutta error-control scheme. We consider cases when the boundaries move according to a prescribed function of time and when the boundaries of embedded bodies move according to the surface stress exerted by the fluid. In the latter case, the Newton-Euler equations describe the motion of the center of mass of the each body and the rotation about it, and these equations are integrated numerically using a second-order predictor-corrector scheme. Numerical boundary conditions at slip walls are described, and numerical results are presented for both reactive and non-reactive flows that demonstrate the use and accuracy of the numerical approach.

Transient analysis of bodies with moving boundaries using NASTRAN

NASA Technical Reports Server (NTRS)

Frye, J. W.

1975-01-01

A scheme is presented which allows the modeling of a moving boundary with NASTRAN NOLIN cards. Various aspects and limitations of the approach are explained. Recommendations are given as to the procedure to be used in implementing the method.

Numerical solution of the time fractional reaction-diffusion equation with a moving boundary

NASA Astrophysics Data System (ADS)

Zheng, Minling; Liu, Fawang; Liu, Qingxia; Burrage, Kevin; Simpson, Matthew J.

2017-06-01

A fractional reaction-diffusion model with a moving boundary is presented in this paper. An efficient numerical method is constructed to solve this moving boundary problem. Our method makes use of a finite difference approximation for the temporal discretization, and spectral approximation for the spatial discretization. The stability and convergence of the method is studied, and the errors of both the semi-discrete and fully-discrete schemes are derived. Numerical examples, motivated by problems from developmental biology, show a good agreement with the theoretical analysis and illustrate the efficiency of our method.

Single particle nonlocality, geometric phases and time-dependent boundary conditions

NASA Astrophysics Data System (ADS)

Matzkin, A.

2018-03-01

We investigate the issue of single particle nonlocality in a quantum system subjected to time-dependent boundary conditions. We discuss earlier claims according to which the quantum state of a particle remaining localized at the center of an infinite well with moving walls would be specifically modified by the change in boundary conditions due to the wall’s motion. We first prove that the evolution of an initially localized Gaussian state is not affected nonlocally by a linearly moving wall: as long as the quantum state has negligible amplitude near the wall, the boundary motion has no effect. This result is further extended to related confined time-dependent oscillators in which the boundary’s motion is known to give rise to geometric phases: for a Gaussian state remaining localized far from the boundaries, the effect of the geometric phases is washed out and the particle dynamics shows no traces of a nonlocal influence that would be induced by the moving boundaries.

Visual memory for moving scenes.

PubMed

DeLucia, Patricia R; Maldia, Maria M

2006-02-01

In the present study, memory for picture boundaries was measured with scenes that simulated self-motion along the depth axis. The results indicated that boundary extension (a distortion in memory for picture boundaries) occurred with moving scenes in the same manner as that reported previously for static scenes. Furthermore, motion affected memory for the boundaries but this effect of motion was not consistent with representational momentum of the self (memory being further forward in a motion trajectory than actually shown). We also found that memory for the final position of the depicted self in a moving scene was influenced by properties of the optical expansion pattern. The results are consistent with a conceptual framework in which the mechanisms that underlie boundary extension and representational momentum (a) process different information and (b) both contribute to the integration of successive views of a scene while the scene is changing.

MPLNET V3 Cloud and Planetary Boundary Layer Detection

NASA Technical Reports Server (NTRS)

Lewis, Jasper R.; Welton, Ellsworth J.; Campbell, James R.; Haftings, Phillip C.

2016-01-01

The NASA Micropulse Lidar Network Version 3 algorithms for planetary boundary layer and cloud detection are described and differences relative to the previous Version 2 algorithms are highlighted. A year of data from the Goddard Space Flight Center site in Greenbelt, MD consisting of diurnal and seasonal trends is used to demonstrate the results. Both the planetary boundary layer and cloud algorithms show significant improvement of the previous version.

Nonlinear vibration of a traveling belt with non-homogeneous boundaries

NASA Astrophysics Data System (ADS)

Ding, Hu; Lim, C. W.; Chen, Li-Qun

2018-06-01

Free and forced nonlinear vibrations of a traveling belt with non-homogeneous boundary conditions are studied. The axially moving materials in operation are always externally excited and produce strong vibrations. The moving materials with the homogeneous boundary condition are usually considered. In this paper, the non-homogeneous boundaries are introduced by the support wheels. Equilibrium deformation of the belt is produced by the non-homogeneous boundaries. In order to solve the equilibrium deformation, the differential and integral quadrature methods (DIQMs) are utilized to develop an iterative scheme. The influence of the equilibrium deformation on free and forced nonlinear vibrations of the belt is explored. The DIQMs are applied to solve the natural frequencies and forced resonance responses of transverse vibration around the equilibrium deformation. The Galerkin truncation method (GTM) is utilized to confirm the DIQMs' results. The numerical results demonstrate that the non-homogeneous boundary conditions cause the transverse vibration to deviate from the straight equilibrium, increase the natural frequencies, and lead to coexistence of square nonlinear terms and cubic nonlinear terms. Moreover, the influence of non-homogeneous boundaries can be exacerbated by the axial speed. Therefore, non-homogeneous boundary conditions of axially moving materials especially should be taken into account.

Spatiotemporal motion boundary detection and motion boundary velocity estimation for tracking moving objects with a moving camera: a level sets PDEs approach with concurrent camera motion compensation.

PubMed

Feghali, Rosario; Mitiche, Amar

2004-11-01

The purpose of this study is to investigate a method of tracking moving objects with a moving camera. This method estimates simultaneously the motion induced by camera movement. The problem is formulated as a Bayesian motion-based partitioning problem in the spatiotemporal domain of the image quence. An energy functional is derived from the Bayesian formulation. The Euler-Lagrange descent equations determine imultaneously an estimate of the image motion field induced by camera motion and an estimate of the spatiotemporal motion undary surface. The Euler-Lagrange equation corresponding to the surface is expressed as a level-set partial differential equation for topology independence and numerically stable implementation. The method can be initialized simply and can track multiple objects with nonsimultaneous motions. Velocities on motion boundaries can be estimated from geometrical properties of the motion boundary. Several examples of experimental verification are given using synthetic and real-image sequences.

Moving branes in the presence of background tachyon fields

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rezaei, Z., E-mail: z.rezaei@aut.ac.ir; Kamani, D., E-mail: kamani@aut.ac.ir

2011-12-15

We compute the boundary state associated with a moving Dp-brane in the presence of the open string tachyon field as a background field. The effect of the tachyon condensation on the boundary state is discussed. It leads to a boundary state associated with a lower-dimensional moving D-brane or a stationary instantonic D-brane. The former originates from condensation along the spatial directions and the latter comes from the temporal direction of the D-brane worldvolume. Using the boundary state, we also study the interaction amplitude between two arbitrary Dp{sub 1}- and Dp{sub 2}-branes. The long-range behavior of the amplitude is investigated, demonstratingmore » an obvious deviation from the conventional form, due to the presence of the background tachyon field.« less

Numerical grid generation in computational field simulations. Volume 1

DOE Office of Scientific and Technical Information (OSTI.GOV)

Soni, B.K.; Thompson, J.F.; Haeuser, J.

1996-12-31

To enhance the CFS technology to its next level of applicability (i.e., to create acceptance of CFS in an integrated product and process development involving multidisciplinary optimization) the basic requirements are: rapid turn-around time, reliable and accurate simulation, affordability and appropriate linkage to other engineering disciplines. In response to this demand, there has been a considerable growth in the grid generation related research activities involving automization, parallel processing, linkage with the CAD-CAM systems, CFS with dynamic motion and moving boundaries, strategies and algorithms associated with multi-block structured, unstructured, hybrid, hexahedral, and Cartesian grids, along with its applicability to various disciplinesmore » including biomedical, semiconductor, geophysical, ocean modeling, and multidisciplinary optimization.« less

Elasticity effects on cavitation in a squeeze film damper undergoing noncentered circular whirl

NASA Technical Reports Server (NTRS)

Brewe, David E.

1988-01-01

Elasticity of the liner and its effects on cavitation were numerically determined for a squeeze film damper subjected to dynamic loading. The loading was manifested as a prescribed motion of the rotor undergoing noncentered circular whirl. The boundary conditions were implemented using Elrod's algorithm which conserves lineal mass flux through the moving cavitation bubble as well as the oil film region of the damper. Computational movies were used to analyze the rapidly changing pressures and vapor bubble dynamics throughout the dynamic cycle for various flexibilities in the damper liner. The effects of liner elasticity on cavitation were only noticeable for the intermediate and high values of viscosity used in this study.

Use of the parameterised finite element method to robustly and efficiently evolve the edge of a moving cell.

PubMed

Neilson, Matthew P; Mackenzie, John A; Webb, Steven D; Insall, Robert H

2010-11-01

In this paper we present a computational tool that enables the simulation of mathematical models of cell migration and chemotaxis on an evolving cell membrane. Recent models require the numerical solution of systems of reaction-diffusion equations on the evolving cell membrane and then the solution state is used to drive the evolution of the cell edge. Previous work involved moving the cell edge using a level set method (LSM). However, the LSM is computationally very expensive, which severely limits the practical usefulness of the algorithm. To address this issue, we have employed the parameterised finite element method (PFEM) as an alternative method for evolving a cell boundary. We show that the PFEM is far more efficient and robust than the LSM. We therefore suggest that the PFEM potentially has an essential role to play in computational modelling efforts towards the understanding of many of the complex issues related to chemotaxis.

A density based algorithm to detect cavities and holes from planar points

NASA Astrophysics Data System (ADS)

Zhu, Jie; Sun, Yizhong; Pang, Yueyong

2017-12-01

Delaunay-based shape reconstruction algorithms are widely used in approximating the shape from planar points. However, these algorithms cannot ensure the optimality of varied reconstructed cavity boundaries and hole boundaries. This inadequate reconstruction can be primarily attributed to the lack of efficient mathematic formulation for the two structures (hole and cavity). In this paper, we develop an efficient algorithm for generating cavities and holes from planar points. The algorithm yields the final boundary based on an iterative removal of the Delaunay triangulation. Our algorithm is mainly divided into two steps, namely, rough and refined shape reconstructions. The rough shape reconstruction performed by the algorithm is controlled by a relative parameter. Based on the rough result, the refined shape reconstruction mainly aims to detect holes and pure cavities. Cavity and hole are conceptualized as a structure with a low-density region surrounded by the high-density region. With this structure, cavity and hole are characterized by a mathematic formulation called as compactness of point formed by the length variation of the edges incident to point in Delaunay triangulation. The boundaries of cavity and hole are then found by locating a shape gradient change in compactness of point set. The experimental comparison with other shape reconstruction approaches shows that the proposed algorithm is able to accurately yield the boundaries of cavity and hole with varying point set densities and distributions.

Iterative methods for plasma sheath calculations: Application to spherical probe

NASA Technical Reports Server (NTRS)

Parker, L. W.; Sullivan, E. C.

1973-01-01

The computer cost of a Poisson-Vlasov iteration procedure for the numerical solution of a steady-state collisionless plasma-sheath problem depends on: (1) the nature of the chosen iterative algorithm, (2) the position of the outer boundary of the grid, and (3) the nature of the boundary condition applied to simulate a condition at infinity (as in three-dimensional probe or satellite-wake problems). Two iterative algorithms, in conjunction with three types of boundary conditions, are analyzed theoretically and applied to the computation of current-voltage characteristics of a spherical electrostatic probe. The first algorithm was commonly used by physicists, and its computer costs depend primarily on the boundary conditions and are only slightly affected by the mesh interval. The second algorithm is not commonly used, and its costs depend primarily on the mesh interval and slightly on the boundary conditions.

A Genetic Algorithm and Fuzzy Logic Approach for Video Shot Boundary Detection

PubMed Central

Thounaojam, Dalton Meitei; Khelchandra, Thongam; Singh, Kh. Manglem; Roy, Sudipta

2016-01-01

This paper proposed a shot boundary detection approach using Genetic Algorithm and Fuzzy Logic. In this, the membership functions of the fuzzy system are calculated using Genetic Algorithm by taking preobserved actual values for shot boundaries. The classification of the types of shot transitions is done by the fuzzy system. Experimental results show that the accuracy of the shot boundary detection increases with the increase in iterations or generations of the GA optimization process. The proposed system is compared to latest techniques and yields better result in terms of F1score parameter. PMID:27127500

Efficient Boundary Extraction of BSP Solids Based on Clipping Operations.

PubMed

Wang, Charlie C L; Manocha, Dinesh

2013-01-01

We present an efficient algorithm to extract the manifold surface that approximates the boundary of a solid represented by a Binary Space Partition (BSP) tree. Our polygonization algorithm repeatedly performs clipping operations on volumetric cells that correspond to a spatial convex partition and computes the boundary by traversing the connected cells. We use point-based representations along with finite-precision arithmetic to improve the efficiency and generate the B-rep approximation of a BSP solid. The core of our polygonization method is a novel clipping algorithm that uses a set of logical operations to make it resistant to degeneracies resulting from limited precision of floating-point arithmetic. The overall BSP to B-rep conversion algorithm can accurately generate boundaries with sharp and small features, and is faster than prior methods. At the end of this paper, we use this algorithm for a few geometric processing applications including Boolean operations, model repair, and mesh reconstruction.

A neural model of visual figure-ground segregation from kinetic occlusion.

PubMed

Barnes, Timothy; Mingolla, Ennio

2013-01-01

Freezing is an effective defense strategy for some prey, because their predators rely on visual motion to distinguish objects from their surroundings. An object moving over a background progressively covers (deletes) and uncovers (accretes) background texture while simultaneously producing discontinuities in the optic flow field. These events unambiguously specify kinetic occlusion and can produce a crisp edge, depth perception, and figure-ground segmentation between identically textured surfaces--percepts which all disappear without motion. Given two abutting regions of uniform random texture with different motion velocities, one region appears to be situated farther away and behind the other (i.e., the ground) if its texture is accreted or deleted at the boundary between the regions, irrespective of region and boundary velocities. Consequently, a region with moving texture appears farther away than a stationary region if the boundary is stationary, but it appears closer (i.e., the figure) if the boundary is moving coherently with the moving texture. A computational model of visual areas V1 and V2 shows how interactions between orientation- and direction-selective cells first create a motion-defined boundary and then signal kinetic occlusion at that boundary. Activation of model occlusion detectors tuned to a particular velocity results in the model assigning the adjacent surface with a matching velocity to the far depth. A weak speed-depth bias brings faster-moving texture regions forward in depth in the absence of occlusion (shearing motion). These processes together reproduce human psychophysical reports of depth ordering for key cases of kinetic occlusion displays. Copyright © 2012 Elsevier Ltd. All rights reserved.

Spin-3 topologically massive gravity

NASA Astrophysics Data System (ADS)

Chen, Bin; Long, Jiang; Wu, Jun-bao

2011-11-01

In this Letter, we study the spin-3 topologically massive gravity (TMG), paying special attention to its properties at the chiral point. We propose an action describing the higher spin fields coupled to TMG. We discuss the traceless spin-3 fluctuations around the AdS3 vacuum and find that there is an extra local massive mode, besides the left-moving and right-moving boundary massless modes. At the chiral point, such extra mode becomes massless and degenerates with the left-moving mode. We show that at the chiral point the only degrees of freedom in the theory are the boundary right-moving graviton and spin-3 field. We conjecture that spin-3 chiral gravity with generalized Brown-Henneaux boundary condition is holographically dual to 2D chiral CFT with classical W3 algebra and central charge cR = 3 l / G.

Modeling local extinction in turbulent combustion using an embedding method

NASA Astrophysics Data System (ADS)

Knaus, Robert; Pantano, Carlos

2012-11-01

Local regions of extinction in diffusion flames, called ``flame holes,'' can reduce the efficiency of combustion and increase the production of certain pollutants. At sufficiently high speeds, a flame may also be lifted from the rim of the burner to a downstream location that may be stable. These two phenomena share a common underlying mechanism of propagation related to edge-flame dynamics where chemistry and fluid mechanics are equally important. We present a formulation that describes the formation, propagation, and growth of flames holes on the stoichiometric surface using edge flame dynamics. The boundary separating the flame from the quenched region is modeled using a progress variable defined on the moving stoichiometric surface that is embedded in the three-dimensional space using an extension algorithm. This Cartesian problem is solved using a high-order finite-volume WENO method extended to this nonconservative problem. This algorithm can track the dynamics of flame holes in a turbulent reacting-shear layer and model flame liftoff without requiring full chemistry calculations.

Implementation of a fully-balanced periodic tridiagonal solver on a parallel distributed memory architecture

NASA Technical Reports Server (NTRS)

Eidson, T. M.; Erlebacher, G.

1994-01-01

While parallel computers offer significant computational performance, it is generally necessary to evaluate several programming strategies. Two programming strategies for a fairly common problem - a periodic tridiagonal solver - are developed and evaluated. Simple model calculations as well as timing results are presented to evaluate the various strategies. The particular tridiagonal solver evaluated is used in many computational fluid dynamic simulation codes. The feature that makes this algorithm unique is that these simulation codes usually require simultaneous solutions for multiple right-hand-sides (RHS) of the system of equations. Each RHS solutions is independent and thus can be computed in parallel. Thus a Gaussian elimination type algorithm can be used in a parallel computation and the more complicated approaches such as cyclic reduction are not required. The two strategies are a transpose strategy and a distributed solver strategy. For the transpose strategy, the data is moved so that a subset of all the RHS problems is solved on each of the several processors. This usually requires significant data movement between processor memories across a network. The second strategy attempts to have the algorithm allow the data across processor boundaries in a chained manner. This usually requires significantly less data movement. An approach to accomplish this second strategy in a near-perfect load-balanced manner is developed. In addition, an algorithm will be shown to directly transform a sequential Gaussian elimination type algorithm into the parallel chained, load-balanced algorithm.

Reconstruction of multiple cracks from experimental electrostatic boundary measurements

NASA Technical Reports Server (NTRS)

Bryan, Kurt; Liepa, Valdis; Vogelius, Michael

1993-01-01

An algorithm for recovering a collection of linear cracks in a homogeneous electrical conductor from boundary measurements of voltages induced by specified current fluxes is described. The technique is a variation of Newton's method and is based on taking weighted averages of the boundary data. An apparatus that was constructed specifically for generating laboratory data on which to test the algorithm is also described. The algorithm is applied to a number of different test cases and the results are discussed.

A novel iris localization algorithm using correlation filtering

NASA Astrophysics Data System (ADS)

Pohit, Mausumi; Sharma, Jitu

2015-06-01

Fast and efficient segmentation of iris from the eye images is a primary requirement for robust database independent iris recognition. In this paper we have presented a new algorithm for computing the inner and outer boundaries of the iris and locating the pupil centre. Pupil-iris boundary computation is based on correlation filtering approach, whereas iris-sclera boundary is determined through one dimensional intensity mapping. The proposed approach is computationally less extensive when compared with the existing algorithms like Hough transform.

Tangle-Free Mesh Motion for Ablation Simulations

NASA Technical Reports Server (NTRS)

Droba, Justin

2016-01-01

Problems involving mesh motion-which should not be mistakenly associated with moving mesh methods, a class of adaptive mesh redistribution techniques-are of critical importance in numerical simulations of the thermal response of melting and ablative materials. Ablation is the process by which material vaporizes or otherwise erodes due to strong heating. Accurate modeling of such materials is of the utmost importance in design of passive thermal protection systems ("heatshields") for spacecraft, the layer of the vehicle that ensures survival of crew and craft during re-entry. In an explicit mesh motion approach, a complete thermal solve is first performed. Afterwards, the thermal response is used to determine surface recession rates. These values are then used to generate boundary conditions for an a posteriori correction designed to update the location of the mesh nodes. Most often, linear elastic or biharmonic equations are used to model this material response, traditionally in a finite element framework so that complex geometries can be simulated. A simple scheme for moving the boundary nodes involves receding along the surface normals. However, for all but the simplest problem geometries, evolution in time following such a scheme will eventually bring the mesh to intersect and "tangle" with itself, inducing failure. This presentation demonstrates a comprehensive and sophisticated scheme that analyzes the local geometry of each node with help from user-provided clues to eliminate the tangle and enable simulations on a wide-class of difficult problem geometries. The method developed is demonstrated for linear elastic equations but is general enough that it may be adapted to other modeling equations. The presentation will explicate the inner workings of the tangle-free mesh motion algorithm for both two and three-dimensional meshes. It will show abstract examples of the method's success, including a verification problem that demonstrates its accuracy and correctness. The focus of the presentation will be on the algorithm; specifics on how the techniques may be used in spacecraft design will be not discussed.

Comparison of Theoretical and Experimental Heat-Transfer Characteristics of Bodies of Revolution at Supersonic Speeds

NASA Technical Reports Server (NTRS)

Scherrer, Richard

1951-01-01

An investigation of the three important factors that determine convective heat-transfer characteristics at supersonic speeds, location boundary-layer transition, recovery factor, and heat-transfer parameter has been performed at Mach numbers from 1.49 to 1.18. The bodies of revolution that were tested had, in most cases, laminar boundary layers, and the test results have been compared with available theory. Boundary-layer transition was found to be affected by heat transfer. Adding heat to a laminar boundary layer caused transition to move forward on the test body, while removing heat caused transition to move rearward. These experimental results and the implications of boundary-layer-stability theory are in qualitative agreement.

Boundary Layer Flow Over a Moving Wavy Surface

NASA Astrophysics Data System (ADS)

Hendin, Gali; Toledo, Yaron

2016-04-01

Boundary Layer Flow Over a Moving Wavy Surface Gali Hendin(1), Yaron Toledo(1) January 13, 2016 (1)School of Mechanical Engineering, Tel-Aviv University, Israel Understanding the boundary layer flow over surface gravity waves is of great importance as various atmosphere-ocean processes are essentially coupled through these waves. Nevertheless, there are still significant gaps in our understanding of this complex flow behaviour. The present work investigates the fundamentals of the boundary layer air flow over progressive, small-amplitude waves. It aims to extend the well-known Blasius solution for a boundary layer over a flat plate to one over a moving wavy surface. The current analysis pro- claims the importance of the small curvature and the time-dependency as second order effects, with a meaningful impact on the similarity pattern in the first order. The air flow over the ocean surface is modelled using an outer, inviscid half-infinite flow, overlaying the viscous boundary layer above the wavy surface. The assumption of a uniform flow in the outer layer, used in former studies, is now replaced with a precise analytical solution of the potential flow over a moving wavy surface with a known celerity, wavelength and amplitude. This results in a conceptual change from former models as it shows that the pressure variations within the boundary layer cannot be neglected. In the boundary layer, time-dependent Navier-Stokes equations are formulated in a curvilinear, orthogonal coordinate system. The formulation is done in an elaborate way that presents additional, formerly neglected first-order effects, resulting from the time-varying coordinate system. The suggested time-dependent curvilinear orthogonal coordinate system introduces a platform that can also support the formulation of turbulent problems for any surface shape. In order to produce a self-similar Blasius-type solution, a small wave-steepness is assumed and a perturbation method is applied. Consequently, a novel self-similar solution is obtained from the first order set of equations. A second order solution is also obtained, stressing the role of small curvature on the boundary layer flow. The proposed model and solution for the boundary layer problem overlaying a moving wavy surface can also be used as a base flow for stability problems that can develop in a boundary layer, including phases of transitional states.

Detection of dominant flow and abnormal events in surveillance video

NASA Astrophysics Data System (ADS)

Kwak, Sooyeong; Byun, Hyeran

2011-02-01

We propose an algorithm for abnormal event detection in surveillance video. The proposed algorithm is based on a semi-unsupervised learning method, a kind of feature-based approach so that it does not detect the moving object individually. The proposed algorithm identifies dominant flow without individual object tracking using a latent Dirichlet allocation model in crowded environments. It can also automatically detect and localize an abnormally moving object in real-life video. The performance tests are taken with several real-life databases, and their results show that the proposed algorithm can efficiently detect abnormally moving objects in real time. The proposed algorithm can be applied to any situation in which abnormal directions or abnormal speeds are detected regardless of direction.

Moving walls and geometric phases

DOE Office of Scientific and Technical Information (OSTI.GOV)

Facchi, Paolo, E-mail: paolo.facchi@ba.infn.it; INFN, Sezione di Bari, I-70126 Bari; Garnero, Giancarlo, E-mail: giancarlo.garnero@uniba.it

2016-09-15

We unveil the existence of a non-trivial Berry phase associated to the dynamics of a quantum particle in a one dimensional box with moving walls. It is shown that a suitable choice of boundary conditions has to be made in order to preserve unitarity. For these boundary conditions we compute explicitly the geometric phase two-form on the parameter space. The unboundedness of the Hamiltonian describing the system leads to a natural prescription of renormalization for divergent contributions arising from the boundary.

The Boundary Element Method Applied to the Two Dimensional Stefan Moving Boundary Problem

DTIC Science & Technology

1991-03-15

Unc), - ( UGt )t - (UG,,),,] - (UG), If we integrate this equation with respect to r from 0 to t - c and with respect to and ij on the region 11(r...and others. "Moving Boundary Problems in Phase Change Mod- els," SIGNUM Newsletter, 20: 8-12 (1985). 21. Stefan, J. "Ober einige Probleme der Theorie ...ier Wirmelcitung," S.-B. \\Vein. Akad. Mat. Natur., 98: 173-484 (1889). 22.-. "flber (lie Theorie der Eisbildung insbesondere fiber die lisbildung im

Predicting Moves-on-Stills for Comic Art Using Viewer Gaze Data.

PubMed

Jain, Eakta; Sheikh, Yaser; Hodgins, Jessica

2016-01-01

Comic art consists of a sequence of panels of different shapes and sizes that visually communicate the narrative to the reader. The move-on-stills technique allows such still images to be retargeted for digital displays via camera moves. Today, moves-on-stills can be created by software applications given user-provided parameters for each desired camera move. The proposed algorithm uses viewer gaze as input to computationally predict camera move parameters. The authors demonstrate their algorithm on various comic book panels and evaluate its performance by comparing their results with a professional DVD.

Real-time Fluorescence Polarization Microscopy of the Moving Boundary in Cross-Gradient SDS-PAGE

NASA Astrophysics Data System (ADS)

Hwang, Jeeseong; Giulian, Gary

2003-03-01

Real-time Fluorescence Polarization Microscopy of the Moving Boundary in Cross-Gradient SDS-PAGE Jeeseong Hwang, Jeffrey R. Krogmeier, Angela M. Bardo, Scott N. Goldie, Lori S. Goldner; Optical Technology Division, National Institute of Standards and Technology, Gaithersburg, MD 20899 Gary G. Giulian, Carl R. Merril; National Institute of Mental Health, National Institutes of Health, Bethesda, MD 20892 Sodium Dodecyl Sulfate Polyacrylamide Gel Electrophoresis (SDS-PAGE) is a popular method to separate proteins by their apparent molecular weight. However, it is a limited technique due, in part, to its low spatial resolution. In order to improve the resolution and to enhance the detection sensitivity of proteins separated by SDS-PAGE we are studying the detergent properties at the moving boundary of precast Tris-Tricine-Acetate cross-gradient gels using fluorescent cationic and pH indicating dyes. We have developed real-time full-field fluorescence polarization microscopy to monitor the dynamic fluorescence anisotropy from the cationic tetramethylindocarbocyanine dyes localized in the "extended stack", a concentrated detergent zone. We will present quantitative results of the fluorescence anisotropy. Our system is capable of analyzing local structures of the detergent molecules in the moving boundary of SDS-PAGE and the microenvironment(s) near the boundary. We will discuss the significance of these results and their potential role in enhanced protein separation.

Wavelet Monte Carlo dynamics: A new algorithm for simulating the hydrodynamics of interacting Brownian particles

NASA Astrophysics Data System (ADS)

Dyer, Oliver T.; Ball, Robin C.

2017-03-01

We develop a new algorithm for the Brownian dynamics of soft matter systems that evolves time by spatially correlated Monte Carlo moves. The algorithm uses vector wavelets as its basic moves and produces hydrodynamics in the low Reynolds number regime propagated according to the Oseen tensor. When small moves are removed, the correlations closely approximate the Rotne-Prager tensor, itself widely used to correct for deficiencies in Oseen. We also include plane wave moves to provide the longest range correlations, which we detail for both infinite and periodic systems. The computational cost of the algorithm scales competitively with the number of particles simulated, N, scaling as N In N in homogeneous systems and as N in dilute systems. In comparisons to established lattice Boltzmann and Brownian dynamics algorithms, the wavelet method was found to be only a factor of order 1 times more expensive than the cheaper lattice Boltzmann algorithm in marginally semi-dilute simulations, while it is significantly faster than both algorithms at large N in dilute simulations. We also validate the algorithm by checking that it reproduces the correct dynamics and equilibrium properties of simple single polymer systems, as well as verifying the effect of periodicity on the mobility tensor.

Two Legendre-Dual-Petrov-Galerkin Algorithms for Solving the Integrated Forms of High Odd-Order Boundary Value Problems

PubMed Central

Abd-Elhameed, Waleed M.; Doha, Eid H.; Bassuony, Mahmoud A.

2014-01-01

Two numerical algorithms based on dual-Petrov-Galerkin method are developed for solving the integrated forms of high odd-order boundary value problems (BVPs) governed by homogeneous and nonhomogeneous boundary conditions. Two different choices of trial functions and test functions which satisfy the underlying boundary conditions of the differential equations and the dual boundary conditions are used for this purpose. These choices lead to linear systems with specially structured matrices that can be efficiently inverted, hence greatly reducing the cost. The various matrix systems resulting from these discretizations are carefully investigated, especially their complexities and their condition numbers. Numerical results are given to illustrate the efficiency of the proposed algorithms, and some comparisons with some other methods are made. PMID:24616620

Fast algorithm for calculation of the moving tsunami wave height

NASA Astrophysics Data System (ADS)

Krivorotko, Olga; Kabanikhin, Sergey

2014-05-01

One of the most urgent problems of mathematical tsunami modeling is estimation of a tsunami wave height while a wave approaches to the coastal zone. There are two methods for solving this problem, namely, Airy-Green formula in one-dimensional case ° --- S(x) = S(0) 4 H(0)/H (x), and numerical solution of an initial-boundary value problem for linear shallow water equations ( { ηtt = div (gH (x,y)gradη), (x,y,t) ∈ ΩT := Ω ×(0,T); ( η|t=0 = q(x,y), ηt|t=0 = 0, (x,y ) ∈ Ω := (0,Lx)× (0,Ly ); (1) η|δΩT = 0. Here η(x,y,t) is the free water surface vertical displacement, H(x,y) is the depth at point (x,y), q(x,y) is the initial amplitude of a tsunami wave, S(x) is a moving tsunami wave height at point x. The main difficulty problem of tsunami modeling is a very big size of the computational domain ΩT. The calculation of the function η(x,y,t) of three variables in ΩT requires large computing resources. We construct a new algorithm to solve numerically the problem of determining the moving tsunami wave height which is based on kinematic-type approach and analytical representation of fundamental solution (2). The wave is supposed to be generated by the seismic fault of the bottom η(x,y,0) = g(y) ·θ(x), where θ(x) is a Heaviside theta-function. Let τ(x,y) be a solution of the eikonal equation 1 τ2x +τ2y = --, gH (x,y) satisfying initial conditions τ(0,y) = 0 and τx(0,y) = (gH (0,y))-1/2. Introducing new variables and new functions: ° -- z = τ(x,y), u(z,y,t) = ηt(x,y,t), b(z,y) = gH(x,y). We obtain an initial-boundary value problem in new variables from (1) ( 2 2 (2 bz- ) { utt = uzz + b uyy + 2b τyuzy + b(τxx + τyy) + 2b + 2bbyτy uz+ ( +2b(bzτy + by)uy, z,y- >2 0,t > 0,2 -1/2 u|t 0,t > 0. Then after some mathematical transformation we get the structure of the function u(x,y,t) in the form u(z,y,t) = S(z,y)·θ(t - z) + ˜u(z,y,t). (2) Here Å©(z,y,t) is a smooth function, S(z,y) is the solution of the problem: { S + b2τ S + (1b2(τ +τ )+ bz+ bb τ )S = 0, z,y > 0, z ygy(y)( 2-2 xx yy2 b)-1/2y y (3) S(0,y) = 2 b (0,y)- τy(0,y) , y > 0. Note that the problem (3) is two-dimensional which allows one to reduce the number of operations in 1.5 times. The algorithm makes it possible to calculate the moving tsunami wave height S(z,y) coming to a given point (z0,y0) as well as the arrival time. This work was supported by the Russian Foundation for Basic Research (project No. 12-01-00773 «Theory and Numerical Methods for Solving Combined Inverse Problems of Mathematical Physics») and interdisciplinary project of SB RAS 14 «Inverse Problems and Applications: Theory, Algorithms, Software».

Tracking tumor boundary in MV-EPID images without implanted markers: A feasibility study.

PubMed

Zhang, Xiaoyong; Homma, Noriyasu; Ichiji, Kei; Takai, Yoshihiro; Yoshizawa, Makoto

2015-05-01

To develop a markerless tracking algorithm to track the tumor boundary in megavoltage (MV)-electronic portal imaging device (EPID) images for image-guided radiation therapy. A level set method (LSM)-based algorithm is developed to track tumor boundary in EPID image sequences. Given an EPID image sequence, an initial curve is manually specified in the first frame. Driven by a region-scalable energy fitting function, the initial curve automatically evolves toward the tumor boundary and stops on the desired boundary while the energy function reaches its minimum. For the subsequent frames, the tracking algorithm updates the initial curve by using the tracking result in the previous frame and reuses the LSM to detect the tumor boundary in the subsequent frame so that the tracking processing can be continued without user intervention. The tracking algorithm is tested on three image datasets, including a 4-D phantom EPID image sequence, four digitally deformable phantom image sequences with different noise levels, and four clinical EPID image sequences acquired in lung cancer treatment. The tracking accuracy is evaluated based on two metrics: centroid localization error (CLE) and volume overlap index (VOI) between the tracking result and the ground truth. For the 4-D phantom image sequence, the CLE is 0.23 ± 0.20 mm, and VOI is 95.6% ± 0.2%. For the digital phantom image sequences, the total CLE and VOI are 0.11 ± 0.08 mm and 96.7% ± 0.7%, respectively. In addition, for the clinical EPID image sequences, the proposed algorithm achieves 0.32 ± 0.77 mm in the CLE and 72.1% ± 5.5% in the VOI. These results demonstrate the effectiveness of the authors' proposed method both in tumor localization and boundary tracking in EPID images. In addition, compared with two existing tracking algorithms, the proposed method achieves a higher accuracy in tumor localization. In this paper, the authors presented a feasibility study of tracking tumor boundary in EPID images by using a LSM-based algorithm. Experimental results conducted on phantom and clinical EPID images demonstrated the effectiveness of the tracking algorithm for visible tumor target. Compared with previous tracking methods, the authors' algorithm has the potential to improve the tracking accuracy in radiation therapy. In addition, real-time tumor boundary information within the irradiation field will be potentially useful for further applications, such as adaptive beam delivery, dose evaluation.

Tracking tumor boundary in MV-EPID images without implanted markers: A feasibility study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Xiaoyong, E-mail: xiaoyong@ieee.org; Homma, Noriyasu, E-mail: homma@ieee.org; Ichiji, Kei, E-mail: ichiji@yoshizawa.ecei.tohoku.ac.jp

2015-05-15

Purpose: To develop a markerless tracking algorithm to track the tumor boundary in megavoltage (MV)-electronic portal imaging device (EPID) images for image-guided radiation therapy. Methods: A level set method (LSM)-based algorithm is developed to track tumor boundary in EPID image sequences. Given an EPID image sequence, an initial curve is manually specified in the first frame. Driven by a region-scalable energy fitting function, the initial curve automatically evolves toward the tumor boundary and stops on the desired boundary while the energy function reaches its minimum. For the subsequent frames, the tracking algorithm updates the initial curve by using the trackingmore » result in the previous frame and reuses the LSM to detect the tumor boundary in the subsequent frame so that the tracking processing can be continued without user intervention. The tracking algorithm is tested on three image datasets, including a 4-D phantom EPID image sequence, four digitally deformable phantom image sequences with different noise levels, and four clinical EPID image sequences acquired in lung cancer treatment. The tracking accuracy is evaluated based on two metrics: centroid localization error (CLE) and volume overlap index (VOI) between the tracking result and the ground truth. Results: For the 4-D phantom image sequence, the CLE is 0.23 ± 0.20 mm, and VOI is 95.6% ± 0.2%. For the digital phantom image sequences, the total CLE and VOI are 0.11 ± 0.08 mm and 96.7% ± 0.7%, respectively. In addition, for the clinical EPID image sequences, the proposed algorithm achieves 0.32 ± 0.77 mm in the CLE and 72.1% ± 5.5% in the VOI. These results demonstrate the effectiveness of the authors’ proposed method both in tumor localization and boundary tracking in EPID images. In addition, compared with two existing tracking algorithms, the proposed method achieves a higher accuracy in tumor localization. Conclusions: In this paper, the authors presented a feasibility study of tracking tumor boundary in EPID images by using a LSM-based algorithm. Experimental results conducted on phantom and clinical EPID images demonstrated the effectiveness of the tracking algorithm for visible tumor target. Compared with previous tracking methods, the authors’ algorithm has the potential to improve the tracking accuracy in radiation therapy. In addition, real-time tumor boundary information within the irradiation field will be potentially useful for further applications, such as adaptive beam delivery, dose evaluation.« less

Two-wavelength Lidar inversion algorithm for determining planetary boundary layer height

NASA Astrophysics Data System (ADS)

Liu, Boming; Ma, Yingying; Gong, Wei; Jian, Yang; Ming, Zhang

2018-02-01

This study proposes a two-wavelength Lidar inversion algorithm to determine the boundary layer height (BLH) based on the particles clustering. Color ratio and depolarization ratio are used to analyze the particle distribution, based on which the proposed algorithm can overcome the effects of complex aerosol layers to calculate the BLH. The algorithm is used to determine the top of the boundary layer under different mixing state. Experimental results demonstrate that the proposed algorithm can determine the top of the boundary layer even in a complex case. Moreover, it can better deal with the weak convection conditions. Finally, experimental data from June 2015 to December 2015 were used to verify the reliability of the proposed algorithm. The correlation between the results of the proposed algorithm and the manual method is R2 = 0.89 with a RMSE of 131 m and mean bias of 49 m; the correlation between the results of the ideal profile fitting method and the manual method is R2 = 0.64 with a RMSE of 270 m and a mean bias of 165 m; and the correlation between the results of the wavelet covariance transform method and manual method is R2 = 0.76, with a RMSE of 196 m and mean bias of 23 m. These findings indicate that the proposed algorithm has better reliability and stability than traditional algorithms.

Integral Method of Boundary Characteristics: Neumann Condition

NASA Astrophysics Data System (ADS)

Kot, V. A.

2018-05-01

A new algorithm, based on systems of identical equalities with integral and differential boundary characteristics, is proposed for solving boundary-value problems on the heat conduction in bodies canonical in shape at a Neumann boundary condition. Results of a numerical analysis of the accuracy of solving heat-conduction problems with variable boundary conditions with the use of this algorithm are presented. The solutions obtained with it can be considered as exact because their errors comprise hundredths and ten-thousandths of a persent for a wide range of change in the parameters of a problem.

Mathematical modeling of moving boundary problems in thermal energy storage

NASA Technical Reports Server (NTRS)

Solomon, A. D.

1980-01-01

The capability for predicting the performance of thermal energy storage (RES) subsystems and components using PCM's based on mathematical and physical models is developed. Mathematical models of the dynamic thermal behavior of (TES) subsystems using PCM's based on solutions of the moving boundary thermal conduction problem and on heat and mass transfer engineering correlations are also discussed.

Unsteady Aerodynamic Flow Control of Moving Platforms

DTIC Science & Technology

2014-05-29

aerodynamic forces and moments effected by fluidic actuation on the flow boundaries of stationary and moving platforms. Aerodynamic forces and...Control is effected fluidically by interactions of azimuthally- and streamwise-segmented individually-addressable synthetic jet actuators with...fundamental flow mechanisms that are associated with transitory aerodynamic forces and moments effected by fluidic actuation on the flow boundaries of

Single-pulse interference caused by temporal reflection at moving refractive-index boundaries

DOE Office of Scientific and Technical Information (OSTI.GOV)

Plansinis, Brent W.; Donaldson, William R.; Agrawal, Govind P.

Here, we show numerically and analytically that temporal reflections from a moving refractive-index boundary act as an analog of Lloyd’s mirror, allowing a single pulse to produce interference fringes in time as it propagates inside a dispersive medium. This interference can be viewed as the pulse interfering with a virtual pulse that is identical to the first, except for a π-phase shift. Furthermore, if a second moving refractive-index boundary is added to create the analog of an optical waveguide, a single pulse can be self-imaged or made to produce two or more pulses by adjusting the propagation length in amore » process similar to the Talbot effect.« less

Single-pulse interference caused by temporal reflection at moving refractive-index boundaries

DOE PAGES

Plansinis, Brent W.; Donaldson, William R.; Agrawal, Govind P.

2017-09-29

Here, we show numerically and analytically that temporal reflections from a moving refractive-index boundary act as an analog of Lloyd’s mirror, allowing a single pulse to produce interference fringes in time as it propagates inside a dispersive medium. This interference can be viewed as the pulse interfering with a virtual pulse that is identical to the first, except for a π-phase shift. Furthermore, if a second moving refractive-index boundary is added to create the analog of an optical waveguide, a single pulse can be self-imaged or made to produce two or more pulses by adjusting the propagation length in amore » process similar to the Talbot effect.« less

Considerations on the moving contact-line singularity, with application to frictional drag on a slender drop

NASA Technical Reports Server (NTRS)

Durbin, P. A.

1988-01-01

It has previously been shown that the no-slip boundary conditions leads to a singularity at a moving contact line and that this presumes some form of slip. Present considerations on the energetics of slip due to shear stress lead to a yield stress boundary condition. A model for the distortion of the liquid state near solid boundaries gives a physical basis for this boundary condition. The yield stress condition is illustrated by an analysis of a slender drop rolling down an incline. That analysis provides a formula for the frictional drag resisting the drop movement. With the present boundary condition, the length of the slip region becomes a property of the fluid flow.

Boundary and object detection in real world images. [by means of algorithms

NASA Technical Reports Server (NTRS)

Yakimovsky, Y.

1974-01-01

A solution to the problem of automatic location of objects in digital pictures by computer is presented. A self-scaling local edge detector which can be applied in parallel on a picture is described. Clustering algorithms and boundary following algorithms which are sequential in nature process the edge data to locate images of objects.

A mobile agent-based moving objects indexing algorithm in location based service

NASA Astrophysics Data System (ADS)

Fang, Zhixiang; Li, Qingquan; Xu, Hong

2006-10-01

This paper will extends the advantages of location based service, specifically using their ability to management and indexing the positions of moving object, Moreover with this objective in mind, a mobile agent-based moving objects indexing algorithm is proposed in this paper to efficiently process indexing request and acclimatize itself to limitation of location based service environment. The prominent feature of this structure is viewing moving object's behavior as the mobile agent's span, the unique mapping between the geographical position of moving objects and span point of mobile agent is built to maintain the close relationship of them, and is significant clue for mobile agent-based moving objects indexing to tracking moving objects.

Curvilinear immersed boundary method for simulating fluid structure interaction with complex 3D rigid bodies

NASA Astrophysics Data System (ADS)

Borazjani, Iman; Ge, Liang; Sotiropoulos, Fotis

2008-08-01

The sharp-interface CURVIB approach of Ge and Sotiropoulos [L. Ge, F. Sotiropoulos, A numerical method for solving the 3D unsteady incompressible Navier-Stokes equations in curvilinear domains with complex immersed boundaries, Journal of Computational Physics 225 (2007) 1782-1809] is extended to simulate fluid structure interaction (FSI) problems involving complex 3D rigid bodies undergoing large structural displacements. The FSI solver adopts the partitioned FSI solution approach and both loose and strong coupling strategies are implemented. The interfaces between immersed bodies and the fluid are discretized with a Lagrangian grid and tracked with an explicit front-tracking approach. An efficient ray-tracing algorithm is developed to quickly identify the relationship between the background grid and the moving bodies. Numerical experiments are carried out for two FSI problems: vortex induced vibration of elastically mounted cylinders and flow through a bileaflet mechanical heart valve at physiologic conditions. For both cases the computed results are in excellent agreement with benchmark simulations and experimental measurements. The numerical experiments suggest that both the properties of the structure (mass, geometry) and the local flow conditions can play an important role in determining the stability of the FSI algorithm. Under certain conditions the FSI algorithm is unconditionally unstable even when strong coupling FSI is employed. For such cases, however, combining the strong coupling iteration with under-relaxation in conjunction with the Aitken's acceleration technique is shown to effectively resolve the stability problems. A theoretical analysis is presented to explain the findings of the numerical experiments. It is shown that the ratio of the added mass to the mass of the structure as well as the sign of the local time rate of change of the force or moment imparted on the structure by the fluid determine the stability and convergence of the FSI algorithm. The stabilizing role of under-relaxation is also clarified and the upper bound of the under-relaxation coefficient, required for stability, is derived.

New algorithms for solving third- and fifth-order two point boundary value problems based on nonsymmetric generalized Jacobi Petrov–Galerkin method

PubMed Central

Doha, E.H.; Abd-Elhameed, W.M.; Youssri, Y.H.

2014-01-01

Two families of certain nonsymmetric generalized Jacobi polynomials with negative integer indexes are employed for solving third- and fifth-order two point boundary value problems governed by homogeneous and nonhomogeneous boundary conditions using a dual Petrov–Galerkin method. The idea behind our method is to use trial functions satisfying the underlying boundary conditions of the differential equations and the test functions satisfying the dual boundary conditions. The resulting linear systems from the application of our method are specially structured and they can be efficiently inverted. The use of generalized Jacobi polynomials simplify the theoretical and numerical analysis of the method and also leads to accurate and efficient numerical algorithms. The presented numerical results indicate that the proposed numerical algorithms are reliable and very efficient. PMID:26425358

Parametric boundary reconstruction algorithm for industrial CT metrology application.

PubMed

Yin, Zhye; Khare, Kedar; De Man, Bruno

2009-01-01

High-energy X-ray computed tomography (CT) systems have been recently used to produce high-resolution images in various nondestructive testing and evaluation (NDT/NDE) applications. The accuracy of the dimensional information extracted from CT images is rapidly approaching the accuracy achieved with a coordinate measuring machine (CMM), the conventional approach to acquire the metrology information directly. On the other hand, CT systems generate the sinogram which is transformed mathematically to the pixel-based images. The dimensional information of the scanned object is extracted later by performing edge detection on reconstructed CT images. The dimensional accuracy of this approach is limited by the grid size of the pixel-based representation of CT images since the edge detection is performed on the pixel grid. Moreover, reconstructed CT images usually display various artifacts due to the underlying physical process and resulting object boundaries from the edge detection fail to represent the true boundaries of the scanned object. In this paper, a novel algorithm to reconstruct the boundaries of an object with uniform material composition and uniform density is presented. There are three major benefits in the proposed approach. First, since the boundary parameters are reconstructed instead of image pixels, the complexity of the reconstruction algorithm is significantly reduced. The iterative approach, which can be computationally intensive, will be practical with the parametric boundary reconstruction. Second, the object of interest in metrology can be represented more directly and accurately by the boundary parameters instead of the image pixels. By eliminating the extra edge detection step, the overall dimensional accuracy and process time can be improved. Third, since the parametric reconstruction approach shares the boundary representation with other conventional metrology modalities such as CMM, boundary information from other modalities can be directly incorporated as prior knowledge to improve the convergence of an iterative approach. In this paper, the feasibility of parametric boundary reconstruction algorithm is demonstrated with both simple and complex simulated objects. Finally, the proposed algorithm is applied to the experimental industrial CT system data.

A numerical method for solving the 3D unsteady incompressible Navier Stokes equations in curvilinear domains with complex immersed boundaries

NASA Astrophysics Data System (ADS)

Ge, Liang; Sotiropoulos, Fotis

2007-08-01

A novel numerical method is developed that integrates boundary-conforming grids with a sharp interface, immersed boundary methodology. The method is intended for simulating internal flows containing complex, moving immersed boundaries such as those encountered in several cardiovascular applications. The background domain (e.g. the empty aorta) is discretized efficiently with a curvilinear boundary-fitted mesh while the complex moving immersed boundary (say a prosthetic heart valve) is treated with the sharp-interface, hybrid Cartesian/immersed-boundary approach of Gilmanov and Sotiropoulos [A. Gilmanov, F. Sotiropoulos, A hybrid cartesian/immersed boundary method for simulating flows with 3d, geometrically complex, moving bodies, Journal of Computational Physics 207 (2005) 457-492.]. To facilitate the implementation of this novel modeling paradigm in complex flow simulations, an accurate and efficient numerical method is developed for solving the unsteady, incompressible Navier-Stokes equations in generalized curvilinear coordinates. The method employs a novel, fully-curvilinear staggered grid discretization approach, which does not require either the explicit evaluation of the Christoffel symbols or the discretization of all three momentum equations at cell interfaces as done in previous formulations. The equations are integrated in time using an efficient, second-order accurate fractional step methodology coupled with a Jacobian-free, Newton-Krylov solver for the momentum equations and a GMRES solver enhanced with multigrid as preconditioner for the Poisson equation. Several numerical experiments are carried out on fine computational meshes to demonstrate the accuracy and efficiency of the proposed method for standard benchmark problems as well as for unsteady, pulsatile flow through a curved, pipe bend. To demonstrate the ability of the method to simulate flows with complex, moving immersed boundaries we apply it to calculate pulsatile, physiological flow through a mechanical, bileaflet heart valve mounted in a model straight aorta with an anatomical-like triple sinus.

Recalibration of the Palaeocene-Eocene boundary (P-E) using high precision U-Pb and Ar-Ar isotopic dating

NASA Astrophysics Data System (ADS)

Chambers, L.; Pringle, M.; Fitton, G.; Larsen, L. M.; Pedersen, A. K.; Parrish, R.

2003-04-01

In the current time scales (Cande and Kent, 95; Berggren et al, 95) the P-E Boundary is positioned at 55 Ma based primarily on the age of the -17 ash layer in Denmark. In the absence of a global stratigraphic section and point the boundary is an interval of 1 m.y. from 55.5 to 54.5 Ma that includes all of the different means of calibrating the boundary tie point, including the NP9/NP10 calcareous nannofossil zonal boundary, the planktonic foraminiferal P5/P6a zonal boundary, preliminary ages for the -17 and +19 ash layers (unpub.), the base of the London Clay Formation, and the δ13C spike. Here we present new Ar-Ar ages for the -17 and +19 ash layers in Denmark and combine this study with a calibration of the Ar-Ar with the U-Pb method. As Ar-Ar ages are relative to the known age of a standard or monitor, U-Pb ages on zircons from the same rocks from the British Tertiary Igneous Province provide an absolute age calibration for all of our Ar-Ar ages (including the monitors). An additional complication arises because the time scale is currently being revised (J. Ogg, Pers. Comm.). In the new time scale the P-E boundary will stay at 55 Ma and the K-T boundary will move by 0.5 m.y. to 65.5 Ma. Our results have a direct impact on the positioning of the P-E Boundary relative to the K-T boundary as definitive K-T tektite is used as one of our Ar-Ar standards. Ar-Ar ages and U-Pb ages for the same sample from the BTIP are indistinguishable when the ages used for the Ar-Ar monitor minerals are those recommended in Renne et al (98). This means that the K-T tektite is 65.78 ± 0.03 Ma, the -17 ash is 54.52 ± 0.05Ma, and the +19 ash is 54.04 ± 0.14 Ma. If the P-E boundary is taken to be between the -17 and +19 ash layers, as in DSDP Hole 550 (the ashes bracket the planktonic foraminiferal P5/P6a zonal boundary) then the current position at 55 Ma is too old. We therefore suggest that if the K-T boundary moves to 65.5 Ma, then the P-E boundary should not stay at 55 Ma, but move to 54.5 Ma (extending the Palaeocene by 1 m.y.). If the K-T boundary does not move by 0.5 m.y. then the P-E boundary would still have to move from its current position at 55 Ma and the ages used for the argon monitor minerals revised.

Experimental investigation of a moving averaging algorithm for motion perpendicular to the leaf travel direction in dynamic MLC target tracking.

PubMed

Yoon, Jai-Woong; Sawant, Amit; Suh, Yelin; Cho, Byung-Chul; Suh, Tae-Suk; Keall, Paul

2011-07-01

In dynamic multileaf collimator (MLC) motion tracking with complex intensity-modulated radiation therapy (IMRT) fields, target motion perpendicular to the MLC leaf travel direction can cause beam holds, which increase beam delivery time by up to a factor of 4. As a means to balance delivery efficiency and accuracy, a moving average algorithm was incorporated into a dynamic MLC motion tracking system (i.e., moving average tracking) to account for target motion perpendicular to the MLC leaf travel direction. The experimental investigation of the moving average algorithm compared with real-time tracking and no compensation beam delivery is described. The properties of the moving average algorithm were measured and compared with those of real-time tracking (dynamic MLC motion tracking accounting for both target motion parallel and perpendicular to the leaf travel direction) and no compensation beam delivery. The algorithm was investigated using a synthetic motion trace with a baseline drift and four patient-measured 3D tumor motion traces representing regular and irregular motions with varying baseline drifts. Each motion trace was reproduced by a moving platform. The delivery efficiency, geometric accuracy, and dosimetric accuracy were evaluated for conformal, step-and-shoot IMRT, and dynamic sliding window IMRT treatment plans using the synthetic and patient motion traces. The dosimetric accuracy was quantified via a tgamma-test with a 3%/3 mm criterion. The delivery efficiency ranged from 89 to 100% for moving average tracking, 26%-100% for real-time tracking, and 100% (by definition) for no compensation. The root-mean-square geometric error ranged from 3.2 to 4.0 mm for moving average tracking, 0.7-1.1 mm for real-time tracking, and 3.7-7.2 mm for no compensation. The percentage of dosimetric points failing the gamma-test ranged from 4 to 30% for moving average tracking, 0%-23% for real-time tracking, and 10%-47% for no compensation. The delivery efficiency of moving average tracking was up to four times higher than that of real-time tracking and approached the efficiency of no compensation for all cases. The geometric accuracy and dosimetric accuracy of the moving average algorithm was between real-time tracking and no compensation, approximately half the percentage of dosimetric points failing the gamma-test compared with no compensation.

A (137)Cs erosion model with moving boundary.

PubMed

Yin, Chuan; Ji, Hongbing

2015-12-01

A novel quantitative model of the relationship between diffused concentration changes and erosion rates using assessment of soil losses was developed. It derived from the analysis of surface soil (137)Cs flux variation under persistent erosion effect and based on the principle of geochemistry kinetics moving boundary. The new moving boundary model improves the basic simplified transport model (Zhang et al., 2008), and mainly applies to uniform rainfall areas which show a long-time soil erosion. The simulation results for this kind of erosion show under a long-time soil erosion, the influence of (137)Cs concentration will decrease exponentially with increasing depth. Using the new model fit to the measured (137)Cs depth distribution data in Zunyi site, Guizhou Province, China which has typical uniform rainfall provided a good fit with R(2) = 0.92. To compare the soil erosion rates calculated by the simple transport model and the new model, we take the Kaixian reference profile as example. The soil losses estimated by the previous simplified transport model are greater than those estimated by the new moving boundary model, which is consistent with our expectations. Copyright © 2015 Elsevier Ltd. All rights reserved.

COMPLEX VARIABLE BOUNDARY ELEMENT METHOD: APPLICATIONS.

USGS Publications Warehouse

Hromadka, T.V.; Yen, C.C.; Guymon, G.L.

1985-01-01

The complex variable boundary element method (CVBEM) is used to approximate several potential problems where analytical solutions are known. A modeling result produced from the CVBEM is a measure of relative error in matching the known boundary condition values of the problem. A CVBEM error-reduction algorithm is used to reduce the relative error of the approximation by adding nodal points in boundary regions where error is large. From the test problems, overall error is reduced significantly by utilizing the adaptive integration algorithm.

A fast Cauchy-Riemann solver. [differential equation solution for boundary conditions by finite difference approximation

NASA Technical Reports Server (NTRS)

Ghil, M.; Balgovind, R.

1979-01-01

The inhomogeneous Cauchy-Riemann equations in a rectangle are discretized by a finite difference approximation. Several different boundary conditions are treated explicitly, leading to algorithms which have overall second-order accuracy. All boundary conditions with either u or v prescribed along a side of the rectangle can be treated by similar methods. The algorithms presented here have nearly minimal time and storage requirements and seem suitable for development into a general-purpose direct Cauchy-Riemann solver for arbitrary boundary conditions.

Computation of the shock-wave boundary layer interaction with flow separation

NASA Technical Reports Server (NTRS)

Ardonceau, P.; Alziary, T.; Aymer, D.

1980-01-01

The boundary layer concept is used to describe the flow near the wall. The external flow is approximated by a pressure displacement relationship (tangent wedge in linearized supersonic flow). The boundary layer equations are solved in finite difference form and the question of the presence and unicity of the solution is considered for the direct problem (assumed pressure) or converse problem (assumed displacement thickness, friction ratio). The coupling algorithm presented implicitly processes the downstream boundary condition necessary to correctly define the interacting boundary layer problem. The algorithm uses a Newton linearization technique to provide a fast convergence.

Multifractal detrending moving-average cross-correlation analysis

NASA Astrophysics Data System (ADS)

Jiang, Zhi-Qiang; Zhou, Wei-Xing

2011-07-01

There are a number of situations in which several signals are simultaneously recorded in complex systems, which exhibit long-term power-law cross correlations. The multifractal detrended cross-correlation analysis (MFDCCA) approaches can be used to quantify such cross correlations, such as the MFDCCA based on the detrended fluctuation analysis (MFXDFA) method. We develop in this work a class of MFDCCA algorithms based on the detrending moving-average analysis, called MFXDMA. The performances of the proposed MFXDMA algorithms are compared with the MFXDFA method by extensive numerical experiments on pairs of time series generated from bivariate fractional Brownian motions, two-component autoregressive fractionally integrated moving-average processes, and binomial measures, which have theoretical expressions of the multifractal nature. In all cases, the scaling exponents hxy extracted from the MFXDMA and MFXDFA algorithms are very close to the theoretical values. For bivariate fractional Brownian motions, the scaling exponent of the cross correlation is independent of the cross-correlation coefficient between two time series, and the MFXDFA and centered MFXDMA algorithms have comparative performances, which outperform the forward and backward MFXDMA algorithms. For two-component autoregressive fractionally integrated moving-average processes, we also find that the MFXDFA and centered MFXDMA algorithms have comparative performances, while the forward and backward MFXDMA algorithms perform slightly worse. For binomial measures, the forward MFXDMA algorithm exhibits the best performance, the centered MFXDMA algorithms performs worst, and the backward MFXDMA algorithm outperforms the MFXDFA algorithm when the moment order q<0 and underperforms when q>0. We apply these algorithms to the return time series of two stock market indexes and to their volatilities. For the returns, the centered MFXDMA algorithm gives the best estimates of hxy(q) since its hxy(2) is closest to 0.5, as expected, and the MFXDFA algorithm has the second best performance. For the volatilities, the forward and backward MFXDMA algorithms give similar results, while the centered MFXDMA and the MFXDFA algorithms fail to extract rational multifractal nature.

Research on the Automatic Fusion Strategy of Fixed Value Boundary Based on the Weak Coupling Condition of Grid Partition

NASA Astrophysics Data System (ADS)

Wang, X. Y.; Dou, J. M.; Shen, H.; Li, J.; Yang, G. S.; Fan, R. Q.; Shen, Q.

2018-03-01

With the continuous strengthening of power grids, the network structure is becoming more and more complicated. An open and regional data modeling is used to complete the calculation of the protection fixed value based on the local region. At the same time, a high precision, quasi real-time boundary fusion technique is needed to seamlessly integrate the various regions so as to constitute an integrated fault computing platform which can conduct transient stability analysis of covering the whole network with high accuracy and multiple modes, deal with the impact results of non-single fault, interlocking fault and build “the first line of defense” of the power grid. The boundary fusion algorithm in this paper is an automatic fusion algorithm based on the boundary accurate coupling of the networking power grid partition, which takes the actual operation mode for qualification, complete the boundary coupling algorithm of various weak coupling partition based on open-loop mode, improving the fusion efficiency, truly reflecting its transient stability level, and effectively solving the problems of too much data, too many difficulties of partition fusion, and no effective fusion due to mutually exclusive conditions. In this paper, the basic principle of fusion process is introduced firstly, and then the method of boundary fusion customization is introduced by scene description. Finally, an example is given to illustrate the specific algorithm on how it effectively implements the boundary fusion after grid partition and to verify the accuracy and efficiency of the algorithm.

Similarity solutions for unsteady free-convection flow from a continuous moving vertical surface

NASA Astrophysics Data System (ADS)

Abd-El-Malek, Mina B.; Kassem, Magda M.; Mekky, Mohammad L.

2004-03-01

The transformation group theoretic approach is applied to present an analysis of the problem of unsteady free convection flow over a continuous moving vertical sheet in an ambient fluid. The thermal boundary layer induced within a vertical semi-infinite layer of Boussinseq fluid by a constant heated bounding plate. The application of two-parameter groups reduces the number of independent variables by two, and consequently the system of governing partial differential equations with the boundary conditions reduces to a system of ordinary differential equations with appropriate boundary conditions. The obtained ordinary differential equations are solved analytically for the temperature and numerically for the velocity using the shooting method. Effect of Prandtl number on the thermal boundary-layer and velocity boundary-layer are studied and plotted in curves.

An algorithm to help design fire simulation and other data base work

Treesearch

Romain Mees

1974-01-01

The data necessary for fire simulation may be made available through an algorithm based on tracing of boundaries composed of straight-line segments. Useful assumptions are that if a closed boundary does not contain a given point, then any other closed boundary contained within the former one does not contain the location; and that a given location will be contained in...

A finite element conjugate gradient FFT method for scattering

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Zapp, John; Hsa, Chang-Yu; Volakis, John L.

1990-01-01

An extension of a two dimensional formulation is presented for a three dimensional body of revolution. With the introduction of a Fourier expansion of the vector electric and magnetic fields, a coupled two dimensional system is generated and solved via the finite element method. An exact boundary condition is employed to terminate the mesh and the fast fourier transformation (FFT) is used to evaluate the boundary integrals for low O(n) memory demand when an iterative solution algorithm is used. By virtue of the finite element method, the algorithm is applicable to structures of arbitrary material composition. Several improvements to the two dimensional algorithm are also described. These include: (1) modifications for terminating the mesh at circular boundaries without distorting the convolutionality of the boundary integrals; (2) the development of nonproprietary mesh generation routines for two dimensional applications; (3) the development of preprocessors for interfacing SDRC IDEAS with the main algorithm; and (4) the development of post-processing algorithms based on the public domain package GRAFIC to generate two and three dimensional gray level and color field maps.

Adversarial search by evolutionary computation.

PubMed

Hong, T P; Huang, K Y; Lin, W Y

2001-01-01

In this paper, we consider the problem of finding good next moves in two-player games. Traditional search algorithms, such as minimax and alpha-beta pruning, suffer great temporal and spatial expansion when exploring deeply into search trees to find better next moves. The evolution of genetic algorithms with the ability to find global or near global optima in limited time seems promising, but they are inept at finding compound optima, such as the minimax in a game-search tree. We thus propose a new genetic algorithm-based approach that can find a good next move by reserving the board evaluation values of new offspring in a partial game-search tree. Experiments show that solution accuracy and search speed are greatly improved by our algorithm.

Non-fragile consensus algorithms for a network of diffusion PDEs with boundary local interaction

NASA Astrophysics Data System (ADS)

Xiong, Jun; Li, Junmin

2017-07-01

In this study, non-fragile consensus algorithm is proposed to solve the average consensus problem of a network of diffusion PDEs, modelled by boundary controlled heat equations. The problem deals with the case where the Neumann-type boundary controllers are corrupted by additive persistent disturbances. To achieve consensus between agents, a linear local interaction rule addressing this requirement is given. The proposed local interaction rules are analysed by applying a Lyapunov-based approach. The multiplicative and additive non-fragile feedback control algorithms are designed and sufficient conditions for the consensus of the multi-agent systems are presented in terms of linear matrix inequalities, respectively. Simulation results are presented to support the effectiveness of the proposed algorithms.

Adaptive mesh optimization and nonrigid motion recovery based image registration for wide-field-of-view ultrasound imaging.

PubMed

Tan, Chaowei; Wang, Bo; Liu, Paul; Liu, Dong

2008-01-01

Wide field of view (WFOV) imaging mode obtains an ultrasound image over an area much larger than the real time window normally available. As the probe is moved over the region of interest, new image frames are combined with prior frames to form a panorama image. Image registration techniques are used to recover the probe motion, eliminating the need for a position sensor. Speckle patterns, which are inherent in ultrasound imaging, change, or become decorrelated, as the scan plane moves, so we pre-smooth the image to reduce the effects of speckle in registration, as well as reducing effects from thermal noise. Because we wish to track the movement of features such as structural boundaries, we use an adaptive mesh over the entire smoothed image to home in on areas with feature. Motion estimation using blocks centered at the individual mesh nodes generates a field of motion vectors. After angular correction of motion vectors, we model the overall movement between frames as a nonrigid deformation. The polygon filling algorithm for precise, persistence-based spatial compounding constructs the final speckle reduced WFOV image.

Advances in the Application of High-order Techniques in Simulation of Multi-disciplinary Phenomena

NASA Astrophysics Data System (ADS)

Gaitonde, D. V.; Visbal, M. R.

2003-03-01

This paper describes the development of a comprehensive high-fidelity algorithmic framework to simulate the three-dimensional fields associated with multi-disciplinary physics. A wide range of phenomena is considered, from aero-acoustics and turbulence to electromagnetics, non-linear fluid-structure interactions, and magnetogasdynamics. The scheme depends primarily on "spectral-like," up to sixth-order accurate compact-differencing and up to tenth-order filtering techniques. The tightly coupled procedure suppresses numerical instabilities commonly encountered with high-order methods on non-uniform meshes, near computational boundaries or in the simulation of nonlinear dynamics. Particular emphasis is placed on developing the proper metric evaluation procedures for three-dimensional moving and curvilinear meshes so that the advantages of higher-order schemes are retained in practical calculations. A domain-decomposition strategy based on finite-sized overlap regions and interface boundary treatments enables the development of highly scalable solvers. The utility of the method to simulate problems governed by widely disparate governing equations is demonstrated with several examples encompassing vortex dynamics, wave scattering, electro-fluid plasma interactions, and panel flutter.

An advancing front Delaunay triangulation algorithm designed for robustness

NASA Technical Reports Server (NTRS)

Mavriplis, D. J.

1992-01-01

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Determining the Transference Number of H[superscript +](aq) by a Modified Moving Boundary Method: A Directed Study for the Undergraduate Physical Chemistry Laboratory

ERIC Educational Resources Information Center

Dabke, Rajeev B.; Gebeyehu, Zewdu; Padelford, Jonathan

2012-01-01

A directed study for the undergraduate physical chemistry laboratory for determining the transference number of H[superscript +](aq) using a modified moving boundary method is presented. The laboratory study combines Faraday's laws of electrolysis with mole ratios and the perfect gas equation. The volume of hydrogen gas produced at the cathode is…

Fast and Accurate Support Vector Machines on Large Scale Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vishnu, Abhinav; Narasimhan, Jayenthi; Holder, Larry

Support Vector Machines (SVM) is a supervised Machine Learning and Data Mining (MLDM) algorithm, which has become ubiquitous largely due to its high accuracy and obliviousness to dimensionality. The objective of SVM is to find an optimal boundary --- also known as hyperplane --- which separates the samples (examples in a dataset) of different classes by a maximum margin. Usually, very few samples contribute to the definition of the boundary. However, existing parallel algorithms use the entire dataset for finding the boundary, which is sub-optimal for performance reasons. In this paper, we propose a novel distributed memory algorithm to eliminatemore » the samples which do not contribute to the boundary definition in SVM. We propose several heuristics, which range from early (aggressive) to late (conservative) elimination of the samples, such that the overall time for generating the boundary is reduced considerably. In a few cases, a sample may be eliminated (shrunk) pre-emptively --- potentially resulting in an incorrect boundary. We propose a scalable approach to synchronize the necessary data structures such that the proposed algorithm maintains its accuracy. We consider the necessary trade-offs of single/multiple synchronization using in-depth time-space complexity analysis. We implement the proposed algorithm using MPI and compare it with libsvm--- de facto sequential SVM software --- which we enhance with OpenMP for multi-core/many-core parallelism. Our proposed approach shows excellent efficiency using up to 4096 processes on several large datasets such as UCI HIGGS Boson dataset and Offending URL dataset.« less

A fast multipole method combined with a reaction field for long-range electrostatics in molecular dynamics simulations: The effects of truncation on the properties of water

NASA Astrophysics Data System (ADS)

Mathias, Gerald; Egwolf, Bernhard; Nonella, Marco; Tavan, Paul

2003-06-01

We present a combination of the structure adapted multipole method with a reaction field (RF) correction for the efficient evaluation of electrostatic interactions in molecular dynamics simulations under periodic boundary conditions. The algorithm switches from an explicit electrostatics evaluation to a continuum description at the maximal distance that is consistent with the minimum image convention, and, thus, avoids the use of a periodic electrostatic potential. A physically motivated switching function enables charge clusters interacting with a given charge to smoothly move into the solvent continuum by passing through the spherical dielectric boundary surrounding this charge. This transition is complete as soon as the cluster has reached the so-called truncation radius Rc. The algorithm is used to examine the dependence of thermodynamic properties and correlation functions on Rc in the three point transferable intermolecular potential water model. Our test simulations on pure liquid water used either the RF correction or a straight cutoff and values of Rc ranging from 14 Å to 40 Å. In the RF setting, the thermodynamic properties and the correlation functions show convergence for Rc increasing towards 40 Å. In the straight cutoff case no such convergence is found. Here, in particular, the dipole-dipole correlation functions become completely artificial. The RF description of the long-range electrostatics is verified by comparison with the results of a particle-mesh Ewald simulation at identical conditions.

BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices

NASA Astrophysics Data System (ADS)

Janse van Rensburg, E. J.; Rechnitzer, A.

2011-04-01

In this paper, the elementary moves of the BFACF-algorithm (Aragão de Carvalho and Caracciolo 1983 Phys. Rev. B 27 1635-45, Aragão de Carvalho and Caracciolo 1983 Nucl. Phys. B 215 209-48, Berg and Foester 1981 Phys. Lett. B 106 323-6) for lattice polygons are generalized to elementary moves of BFACF-style algorithms for lattice polygons in the body-centered (BCC) and face-centered (FCC) cubic lattices. We prove that the ergodicity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice (see Janse van Rensburg and Whittington (1991 J. Phys. A: Math. Gen. 24 5553-67)). Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices.

Turbulent boundary layers over nonstationary plane boundaries

NASA Technical Reports Server (NTRS)

Roper, A. T.; Gentry, G. L., Jr.

1978-01-01

Methods of predicting integral parameters and skin friction coefficients of turbulent boundary layers developing over moving ground planes were evaluated. The three methods evaluated were: relative integral parameter method; relative power law method; and modified law of the wall method.

Spark formation as a moving boundary process

NASA Astrophysics Data System (ADS)

Ebert, Ute

2006-03-01

The growth process of spark channels recently becomes accessible through complementary methods. First, I will review experiments with nanosecond photographic resolution and with fast and well defined power supplies that appropriately resolve the dynamics of electric breakdown [1]. Second, I will discuss the elementary physical processes as well as present computations of spark growth and branching with adaptive grid refinement [2]. These computations resolve three well separated scales of the process that emerge dynamically. Third, this scale separation motivates a hierarchy of models on different length scales. In particular, I will discuss a moving boundary approximation for the ionization fronts that generate the conducting channel. The resulting moving boundary problem shows strong similarities with classical viscous fingering. For viscous fingering, it is known that the simplest model forms unphysical cusps within finite time that are suppressed by a regularizing condition on the moving boundary. For ionization fronts, we derive a new condition on the moving boundary of mixed Dirichlet-Neumann type (φ=ɛnφ) that indeed regularizes all structures investigated so far. In particular, we present compact analytical solutions with regularization, both for uniformly translating shapes and for their linear perturbations [3]. These solutions are so simple that they may acquire a paradigmatic role in the future. Within linear perturbation theory, they explicitly show the convective stabilization of a curved front while planar fronts are linearly unstable against perturbations of arbitrary wave length. [1] T.M.P. Briels, E.M. van Veldhuizen, U. Ebert, TU Eindhoven. [2] C. Montijn, J. Wackers, W. Hundsdorfer, U. Ebert, CWI Amsterdam. [3] B. Meulenbroek, U. Ebert, L. Schäfer, Phys. Rev. Lett. 95, 195004 (2005).

An Estimation of Turbulent Kinetic Energy and Energy Dissipation Rate Based on Atmospheric Boundary Layer Similarity Theory

NASA Technical Reports Server (NTRS)

Han, Jongil; Arya, S. Pal; Shaohua, Shen; Lin, Yuh-Lang; Proctor, Fred H. (Technical Monitor)

2000-01-01

Algorithms are developed to extract atmospheric boundary layer profiles for turbulence kinetic energy (TKE) and energy dissipation rate (EDR), with data from a meteorological tower as input. The profiles are based on similarity theory and scalings for the atmospheric boundary layer. The calculated profiles of EDR and TKE are required to match the observed values at 5 and 40 m. The algorithms are coded for operational use and yield plausible profiles over the diurnal variation of the atmospheric boundary layer.

A combined finite element-boundary integral formulation for solution of two-dimensional scattering problems via CGFFT. [Conjugate Gradient Fast Fourier Transformation

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Volakis, John L.; Jin, Jian-Ming

1990-01-01

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary-integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principal advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

A combined finite element and boundary integral formulation for solution via CGFFT of 2-dimensional scattering problems

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Volakis, John L.

1989-01-01

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principle advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

Transport of reacting solutes subject to a moving dissolution boundary: Numerical methods and solutions

USGS Publications Warehouse

Willis, Catherine; Rubin, Jacob

1987-01-01

A moving boundary problem which arises during transport with precipitation-dissolution reactions is solved by three different numerical methods. Two of these methods (one explicit and one implicit) are based on an integral formulation of mass balance and lead to an approximation of a weak solution. These methods are compared to a front-tracking scheme. Although the two approaches are conceptually different, the numerical solutions showed good agreement. As the ratio of dispersion to convection decreases, the methods based on the integral formulation become computationally more efficient. Specific reactions were modeled to examine the dependence of the system on the physical and chemical parameters. Although the water flow rate does not explicitly appear in the equation for the velocity of the moving boundary, the speed of the boundary depends more on the flux rate than on the dispersion coefficient. The discontinuity in the gradient of the solute concentration profile at the boundary increases with convection and with the initial concentration of the mineral. Our implicit method is extended to allow participation of the solutes in complexation reactions as well as the precipitation-dissolution reaction. This extension is easily made and does not change the basic method.

Dynamic Distributed Cooperative Control of Multiple Heterogeneous Resources

DTIC Science & Technology

2012-10-01

of the UAVs to maximize the total sensor footprint over the region of interest. The algorithm utilized to solve this problem was based on sampling a...and moving obstacles. Obstacle positions were assumed known a priori. Kingston and Beard [22] presented an algorithm to keep moving UAVs equally spaced...Planning Algorithms , Cambridge University Press, 2006. 11. Ma, C. S. and Miller, R. H., “Mixed integer linear programming trajectory generation for

Image analysis of multiple moving wood pieces in real time

NASA Astrophysics Data System (ADS)

Wang, Weixing

2006-02-01

This paper presents algorithms for image processing and image analysis of wood piece materials. The algorithms were designed for auto-detection of wood piece materials on a moving conveyor belt or a truck. When wood objects on moving, the hard task is to trace the contours of the objects in n optimal way. To make the algorithms work efficiently in the plant, a flexible online system was designed and developed, which mainly consists of image acquisition, image processing, object delineation and analysis. A number of newly-developed algorithms can delineate wood objects with high accuracy and high speed, and in the wood piece analysis part, each wood piece can be characterized by a number of visual parameters which can also be used for constructing experimental models directly in the system.

Discriminative Cooperative Networks for Detecting Phase Transitions

NASA Astrophysics Data System (ADS)

Liu, Ye-Hua; van Nieuwenburg, Evert P. L.

2018-04-01

The classification of states of matter and their corresponding phase transitions is a special kind of machine-learning task, where physical data allow for the analysis of new algorithms, which have not been considered in the general computer-science setting so far. Here we introduce an unsupervised machine-learning scheme for detecting phase transitions with a pair of discriminative cooperative networks (DCNs). In this scheme, a guesser network and a learner network cooperate to detect phase transitions from fully unlabeled data. The new scheme is efficient enough for dealing with phase diagrams in two-dimensional parameter spaces, where we can utilize an active contour model—the snake—from computer vision to host the two networks. The snake, with a DCN "brain," moves and learns actively in the parameter space, and locates phase boundaries automatically.

Application of the perturbation iteration method to boundary layer type problems.

PubMed

Pakdemirli, Mehmet

2016-01-01

The recently developed perturbation iteration method is applied to boundary layer type singular problems for the first time. As a preliminary work on the topic, the simplest algorithm of PIA(1,1) is employed in the calculations. Linear and nonlinear problems are solved to outline the basic ideas of the new solution technique. The inner and outer solutions are determined with the iteration algorithm and matched to construct a composite expansion valid within all parts of the domain. The solutions are contrasted with the available exact or numerical solutions. It is shown that the perturbation-iteration algorithm can be effectively used for solving boundary layer type problems.

The efficient simulation of separated three-dimensional viscous flows using the boundary-layer equations

NASA Technical Reports Server (NTRS)

Van Dalsem, W. R.; Steger, J. L.

1985-01-01

A simple and computationally efficient algorithm for solving the unsteady three-dimensional boundary-layer equations in the time-accurate or relaxation mode is presented. Results of the new algorithm are shown to be in quantitative agreement with detailed experimental data for flow over a swept infinite wing. The separated flow over a 6:1 ellipsoid at angle of attack, and the transonic flow over a finite-wing with shock-induced 'mushroom' separation are also computed and compared with available experimental data. It is concluded that complex, separated, three-dimensional viscous layers can be economically and routinely computed using a time-relaxation boundary-layer algorithm.

The mechanisms and boundary conditions of the Einstellung effect in chess: evidence from eye movements.

PubMed

Sheridan, Heather; Reingold, Eyal M

2013-01-01

In a wide range of problem-solving settings, the presence of a familiar solution can block the discovery of better solutions (i.e., the Einstellung effect). To investigate this effect, we monitored the eye movements of expert and novice chess players while they solved chess problems that contained a familiar move (i.e., the Einstellung move), as well as an optimal move that was located in a different region of the board. When the Einstellung move was an advantageous (but suboptimal) move, both the expert and novice chess players who chose the Einstellung move continued to look at this move throughout the trial, whereas the subset of expert players who chose the optimal move were able to gradually disengage their attention from the Einstellung move. However, when the Einstellung move was a blunder, all of the experts and the majority of the novices were able to avoid selecting the Einstellung move, and both the experts and novices gradually disengaged their attention from the Einstellung move. These findings shed light on the boundary conditions of the Einstellung effect, and provide convergent evidence for Bilalić, McLeod, & Gobet (2008)'s conclusion that the Einstellung effect operates by biasing attention towards problem features that are associated with the familiar solution rather than the optimal solution.

Semantics of directly manipulating spatializations.

PubMed

Hu, Xinran; Bradel, Lauren; Maiti, Dipayan; House, Leanna; North, Chris; Leman, Scotland

2013-12-01

When high-dimensional data is visualized in a 2D plane by using parametric projection algorithms, users may wish to manipulate the layout of the data points to better reflect their domain knowledge or to explore alternative structures. However, few users are well-versed in the algorithms behind the visualizations, making parameter tweaking more of a guessing game than a series of decisive interactions. Translating user interactions into algorithmic input is a key component of Visual to Parametric Interaction (V2PI) [13]. Instead of adjusting parameters, users directly move data points on the screen, which then updates the underlying statistical model. However, we have found that some data points that are not moved by the user are just as important in the interactions as the data points that are moved. Users frequently move some data points with respect to some other 'unmoved' data points that they consider as spatially contextual. However, in current V2PI interactions, these points are not explicitly identified when directly manipulating the moved points. We design a richer set of interactions that makes this context more explicit, and a new algorithm and sophisticated weighting scheme that incorporates the importance of these unmoved data points into V2PI.

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

PubMed

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

PubMed Central

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-01-01

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption. PMID:25196015

Segmentation of the Clustered Cells with Optimized Boundary Detection in Negative Phase Contrast Images

PubMed Central

Wang, Yuliang; Zhang, Zaicheng; Wang, Huimin; Bi, Shusheng

2015-01-01

Cell image segmentation plays a central role in numerous biology studies and clinical applications. As a result, the development of cell image segmentation algorithms with high robustness and accuracy is attracting more and more attention. In this study, an automated cell image segmentation algorithm is developed to get improved cell image segmentation with respect to cell boundary detection and segmentation of the clustered cells for all cells in the field of view in negative phase contrast images. A new method which combines the thresholding method and edge based active contour method was proposed to optimize cell boundary detection. In order to segment clustered cells, the geographic peaks of cell light intensity were utilized to detect numbers and locations of the clustered cells. In this paper, the working principles of the algorithms are described. The influence of parameters in cell boundary detection and the selection of the threshold value on the final segmentation results are investigated. At last, the proposed algorithm is applied to the negative phase contrast images from different experiments. The performance of the proposed method is evaluated. Results show that the proposed method can achieve optimized cell boundary detection and highly accurate segmentation for clustered cells. PMID:26066315

New algorithms for solving high even-order differential equations using third and fourth Chebyshev-Galerkin methods

NASA Astrophysics Data System (ADS)

Doha, E. H.; Abd-Elhameed, W. M.; Bassuony, M. A.

2013-03-01

This paper is concerned with spectral Galerkin algorithms for solving high even-order two point boundary value problems in one dimension subject to homogeneous and nonhomogeneous boundary conditions. The proposed algorithms are extended to solve two-dimensional high even-order differential equations. The key to the efficiency of these algorithms is to construct compact combinations of Chebyshev polynomials of the third and fourth kinds as basis functions. The algorithms lead to linear systems with specially structured matrices that can be efficiently inverted. Numerical examples are included to demonstrate the validity and applicability of the proposed algorithms, and some comparisons with some other methods are made.

Algorithms for detection of objects in image sequences captured from an airborne imaging system

NASA Technical Reports Server (NTRS)

Kasturi, Rangachar; Camps, Octavia; Tang, Yuan-Liang; Devadiga, Sadashiva; Gandhi, Tarak

1995-01-01

This research was initiated as a part of the effort at the NASA Ames Research Center to design a computer vision based system that can enhance the safety of navigation by aiding the pilots in detecting various obstacles on the runway during critical section of the flight such as a landing maneuver. The primary goal is the development of algorithms for detection of moving objects from a sequence of images obtained from an on-board video camera. Image regions corresponding to the independently moving objects are segmented from the background by applying constraint filtering on the optical flow computed from the initial few frames of the sequence. These detected regions are tracked over subsequent frames using a model based tracking algorithm. Position and velocity of the moving objects in the world coordinate is estimated using an extended Kalman filter. The algorithms are tested using the NASA line image sequence with six static trucks and a simulated moving truck and experimental results are described. Various limitations of the currently implemented version of the above algorithm are identified and possible solutions to build a practical working system are investigated.

Comparison of 3-D Multi-Lag Cross-Correlation and Speckle Brightness Aberration Correction Algorithms on Static and Moving Targets

PubMed Central

Ivancevich, Nikolas M.; Dahl, Jeremy J.; Smith, Stephen W.

2010-01-01

Phase correction has the potential to increase the image quality of 3-D ultrasound, especially transcranial ultrasound. We implemented and compared 2 algorithms for aberration correction, multi-lag cross-correlation and speckle brightness, using static and moving targets. We corrected three 75-ns rms electronic aberrators with full-width at half-maximum (FWHM) auto-correlation lengths of 1.35, 2.7, and 5.4 mm. Cross-correlation proved the better algorithm at 2.7 and 5.4 mm correlation lengths (P < 0.05). Static cross-correlation performed better than moving-target cross-correlation at the 2.7 mm correlation length (P < 0.05). Finally, we compared the static and moving-target cross-correlation on a flow phantom with a skull casting aberrator. Using signal from static targets, the correction resulted in an average contrast increase of 22.2%, compared with 13.2% using signal from moving targets. The contrast-to-noise ratio (CNR) increased by 20.5% and 12.8% using static and moving targets, respectively. Doppler signal strength increased by 5.6% and 4.9% for the static and moving-targets methods, respectively. PMID:19942503

Comparison of 3-D multi-lag cross- correlation and speckle brightness aberration correction algorithms on static and moving targets.

PubMed

Ivancevich, Nikolas M; Dahl, Jeremy J; Smith, Stephen W

2009-10-01

Phase correction has the potential to increase the image quality of 3-D ultrasound, especially transcranial ultrasound. We implemented and compared 2 algorithms for aberration correction, multi-lag cross-correlation and speckle brightness, using static and moving targets. We corrected three 75-ns rms electronic aberrators with full-width at half-maximum (FWHM) auto-correlation lengths of 1.35, 2.7, and 5.4 mm. Cross-correlation proved the better algorithm at 2.7 and 5.4 mm correlation lengths (P < 0.05). Static cross-correlation performed better than moving-target cross-correlation at the 2.7 mm correlation length (P < 0.05). Finally, we compared the static and moving-target cross-correlation on a flow phantom with a skull casting aberrator. Using signal from static targets, the correction resulted in an average contrast increase of 22.2%, compared with 13.2% using signal from moving targets. The contrast-to-noise ratio (CNR) increased by 20.5% and 12.8% using static and moving targets, respectively. Doppler signal strength increased by 5.6% and 4.9% for the static and moving-targets methods, respectively.

Elastic modelling in tilted transversely isotropic media with convolutional perfectly matched layer boundary conditions

NASA Astrophysics Data System (ADS)

Han, Byeongho; Seol, Soon Jee; Byun, Joongmoo

2012-04-01

To simulate wave propagation in a tilted transversely isotropic (TTI) medium with a tilting symmetry-axis of anisotropy, we develop a 2D elastic forward modelling algorithm. In this algorithm, we use the staggered-grid finite-difference method which has fourth-order accuracy in space and second-order accuracy in time. Since velocity-stress formulations are defined for staggered grids, we include auxiliary grid points in the z-direction to meet the free surface boundary conditions for shear stress. Through comparisons of displacements obtained from our algorithm, not only with analytical solutions but also with finite element solutions, we are able to validate that the free surface conditions operate appropriately and elastic waves propagate correctly. In order to handle the artificial boundary reflections efficiently, we also implement convolutional perfectly matched layer (CPML) absorbing boundaries in our algorithm. The CPML sufficiently attenuates energy at the grazing incidence by modifying the damping profile of the PML boundary. Numerical experiments indicate that the algorithm accurately expresses elastic wave propagation in the TTI medium. At the free surface, the numerical results show good agreement with analytical solutions not only for body waves but also for the Rayleigh wave which has strong amplitude along the surface. In addition, we demonstrate the efficiency of CPML for a homogeneous TI medium and a dipping layered model. Only using 10 grid points to the CPML regions, the artificial reflections are successfully suppressed and the energy of the boundary reflection back into the effective modelling area is significantly decayed.

MOVES Workshops and Presentations

EPA Pesticide Factsheets

The U.S. EPA held a three-day workshop including EPA presentations on MOVES 2010 algorithms and default data, information on ways to use MOVES more efficiently for various purposes, and discussion of ideas and plans for MOVES future development.

A novel algorithm for Bluetooth ECG.

PubMed

Pandya, Utpal T; Desai, Uday B

2012-11-01

In wireless transmission of ECG, data latency will be significant when battery power level and data transmission distance are not maintained. In applications like home monitoring or personalized care, to overcome the joint effect of previous issues of wireless transmission and other ECG measurement noises, a novel filtering strategy is required. Here, a novel algorithm, identified as peak rejection adaptive sampling modified moving average (PRASMMA) algorithm for wireless ECG is introduced. This algorithm first removes error in bit pattern of received data if occurred in wireless transmission and then removes baseline drift. Afterward, a modified moving average is implemented except in the region of each QRS complexes. The algorithm also sets its filtering parameters according to different sampling rate selected for acquisition of signals. To demonstrate the work, a prototyped Bluetooth-based ECG module is used to capture ECG with different sampling rate and in different position of patient. This module transmits ECG wirelessly to Bluetooth-enabled devices where the PRASMMA algorithm is applied on captured ECG. The performance of PRASMMA algorithm is compared with moving average and S-Golay algorithms visually as well as numerically. The results show that the PRASMMA algorithm can significantly improve the ECG reconstruction by efficiently removing the noise and its use can be extended to any parameters where peaks are importance for diagnostic purpose.

Using the Hilbert uniqueness method in a reconstruction algorithm for electrical impedance tomography.

PubMed

Dai, W W; Marsili, P M; Martinez, E; Morucci, J P

1994-05-01

This paper presents a new version of the layer stripping algorithm in the sense that it works essentially by repeatedly stripping away the outermost layer of the medium after having determined the conductivity value in this layer. In order to stabilize the ill posed boundary value problem related to each layer, we base our algorithm on the Hilbert uniqueness method (HUM) and implement it with the boundary element method (BEM).

Investigation of Tectonic Boundaries in Taiwan Obtained with a Hierarchical Clustering of Dense GNSS Data

NASA Astrophysics Data System (ADS)

Takahashi, A.; Hashimoto, M.; Hu, J. C.; Fukahata, Y.

2017-12-01

Taiwan Island is composed of many geological structures. The main tectonic feature is the collision of the Luzon volcanic arc with the Eurasian continent, which propagates westward and generates complicated crustal deformation. One way to model crustal deformation is to divide Taiwan island into man rigid blocks that moves relatively each other along the boundaries (deformation zones) of the blocks. Since earthquakes tend to occur in the deformation zones, identification of such tectonic boundaries is important. So far, many tectonic boundaries have been proposed on the basis of geology, geomorphology, seismology and geodesy. However, which is the most significant boundary depends on disciplines and there is no way to objectively classify them. Here, we introduce an objective method to identify significant tectonic boundaries with a hierarchical representation proposed by Simpson et al. [2012].We apply a hierarchical agglomerative clustering algorithm to dense GNSS horizontal velocity data in Taiwan. One of the significant merits of the hierarchical representation of the clustering results is that we can consistently explore crustal structures from larger to smaller scales. This is because a higher hierarchy corresponds to a larger crustal structure, and a lower hierarchy corresponds to a smaller crustal structure. Relative motion between clusters can be obtained from this analysis.The first major boundary is identified along the eastern margin of the Longitudinal Valley, which corresponds to the separation of the Philippine Sea plate and the Eurasian continental margin. The second major boundary appears along the Chaochou fault and the Chishan fault in southwestern Taiwan. The third major boundary appears along the eastern margin of the coastal plane. The identified major clusters can be divided into several smaller blocks without losing consistency with geological boundaries. For example, the Fengshun fault, concealed beneath thick sediment layers, is identified. Furthermore, obtained relative motion between clusters demands a reverse fault or a left lateral fault in the off shore of the coastal range.Our clustering based block modeling is consistent with tectonics of Taiwan, implying that observed crustal deformation in Taiwan can be attributed to motion or deformation of shallow structures.

Flexibility of Event Boundaries in Autobiographical Memory

PubMed Central

Hohman, Timothy J.; Peynircioğlu, Zehra F.; Beason-Held, Lori L.

2014-01-01

Events have clear and consistent boundaries that are defined during perception in a manner that influences memory performance. The natural process of event segmentation shapes event definitions during perception, and appears to play a critical role in defining distinct episodic memories at encoding. However, the role of retrieval processes in modifying event definitions is not clear. We explored how such processes changed event boundary definitions at recall. In Experiment 1 we showed that distance from encoding is related to boundary flexibility. Participants were more likely to move self-reported event boundaries to include information reported beyond those boundaries when recalling more distant events compared to more recent events. In Experiment 2, we showed that age also influenced boundary flexibility. Older Age adults were more likely to move event boundaries than College Age adults, and the relationship between distance from encoding and boundary flexibility seen in Experiment 1 was present only in College Age and Middle Age adults. These results suggest that factors at retrieval have a direct impact on event definitions in memory and that, although episodic memories may be initially defined at encoding, these definitions are not necessarily maintained in long-term memory. PMID:22989194

[Determination of total protein content in soya-bean milk via visual moving reaction boundary titration].

PubMed

Guo, Chengye; Wang, Houyu; Zhang, Lei; Fan, Liuyin; Cao, Chengxi

2013-11-01

A visual, rapid and accurate moving reaction boundary titration (MRBT) method was used for the determination of the total protein in soya-bean milk. During the process, moving reaction boundary (MRB) was formed by hydroxyl ions in the catholyte and soya-bean milk proteins immobilized in polyacrylamide gel (PAG), and an acid-base indicator was used to denote the boundary motion. The velocity of MRB has a relationship with protein concentration, which was used to obtain a standard curve. By paired t-test, there was no significant difference of the protein content between MRBT and Kjeldahl method at 95% confidence interval. The procedure of MRBT method required about 10 min, and it had linearity in the range of 2.0-14.0 g/L, low limit of detection (0.05 g/L), good precision (RSD of intra-day < 1.90% and inter-day < 4.39%), and high recoveries (97.41%-99.91%). In addition, non-protein nitrogen (NPN) such as melamine added into the soya-bean milk had weak influence on MRBT results.

Improvements to Level Set, Immersed Boundary methods for Interface Tracking

NASA Astrophysics Data System (ADS)

Vogl, Chris; Leveque, Randy

2014-11-01

It is not uncommon to find oneself solving a moving boundary problem under flow in the context of some application. Of particular interest is when the moving boundary exerts a curvature-dependent force on the liquid. Such a force arises when observing a boundary that is resistant to bending or has surface tension. Numerically speaking, stable numerical computation of the curvature can be difficult as it is often described in terms of high-order derivatives of either marker particle positions or of a level set function. To address this issue, the level set method is modified to track not only the position of the boundary, but the curvature as well. The definition of the signed-distance function that is used to modify the level set method is also used to develop an interpolation-free, closest-point method. These improvements are used to simulate a bending-resistant, inextensible boundary under shear flow to highlight area and volume conservation, as well as stable curvature calculation. Funded by a NSF MSPRF grant.

Group solution for unsteady free-convection flow from a vertical moving plate subjected to constant heat flux

NASA Astrophysics Data System (ADS)

Kassem, M.

2006-03-01

The problem of heat and mass transfer in an unsteady free-convection flow over a continuous moving vertical sheet in an ambient fluid is investigated for constant heat flux using the group theoretical method. The nonlinear coupled partial differential equation governing the flow and the boundary conditions are transformed to a system of ordinary differential equations with appropriate boundary conditions. The obtained ordinary differential equations are solved numerically using the shooting method. The effect of Prandlt number on the velocity and temperature of the boundary-layer is plotted in curves. A comparison with previous work is presented.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schlanderer, Stefan C., E-mail: stefan.schlanderer@unimelb.edu.au; Weymouth, Gabriel D., E-mail: G.D.Weymouth@soton.ac.uk; Sandberg, Richard D., E-mail: richard.sandberg@unimelb.edu.au

This paper introduces a virtual boundary method for compressible viscous fluid flow that is capable of accurately representing moving bodies in flow and aeroacoustic simulations. The method is the compressible extension of the boundary data immersion method (BDIM, Maertens & Weymouth (2015), ). The BDIM equations for the compressible Navier–Stokes equations are derived and the accuracy of the method for the hydrodynamic representation of solid bodies is demonstrated with challenging test cases, including a fully turbulent boundary layer flow and a supersonic instability wave. In addition we show that the compressible BDIM is able to accurately represent noise radiation frommore » moving bodies and flow induced noise generation without any penalty in allowable time step.« less

Effective search for stable segregation configurations at grain boundaries with data-mining techniques

NASA Astrophysics Data System (ADS)

Kiyohara, Shin; Mizoguchi, Teruyasu

2018-03-01

Grain boundary segregation of dopants plays a crucial role in materials properties. To investigate the dopant segregation behavior at the grain boundary, an enormous number of combinations have to be considered in the segregation of multiple dopants at the complex grain boundary structures. Here, two data mining techniques, the random-forests regression and the genetic algorithm, were applied to determine stable segregation sites at grain boundaries efficiently. Using the random-forests method, a predictive model was constructed from 2% of the segregation configurations and it has been shown that this model could determine the stable segregation configurations. Furthermore, the genetic algorithm also successfully determined the most stable segregation configuration with great efficiency. We demonstrate that these approaches are quite effective to investigate the dopant segregation behaviors at grain boundaries.

Corner detection and sorting method based on improved Harris algorithm in camera calibration

NASA Astrophysics Data System (ADS)

Xiao, Ying; Wang, Yonghong; Dan, Xizuo; Huang, Anqi; Hu, Yue; Yang, Lianxiang

2016-11-01

In traditional Harris corner detection algorithm, the appropriate threshold which is used to eliminate false corners is selected manually. In order to detect corners automatically, an improved algorithm which combines Harris and circular boundary theory of corners is proposed in this paper. After detecting accurate corner coordinates by using Harris algorithm and Forstner algorithm, false corners within chessboard pattern of the calibration plate can be eliminated automatically by using circular boundary theory. Moreover, a corner sorting method based on an improved calibration plate is proposed to eliminate false background corners and sort remaining corners in order. Experiment results show that the proposed algorithms can eliminate all false corners and sort remaining corners correctly and automatically.

Determination of boundary layer top on the basis of the characteristics of atmospheric particles

NASA Astrophysics Data System (ADS)

Liu, Boming; Ma, Yingying; Gong, Wei; Zhang, Ming; Yang, Jian

2018-04-01

The planetary boundary layer (PBL) is the lowest layer of the atmosphere that can be directly influenced with the Earth's surface. This layer can also respond to surface forcing. The determination of the PBL is significant to environmental and climate research. PBL can also serve as an input parameter for further data processing with atmospheric models. Traditional detection algorithms are susceptible to errors associated with the vertical distribution of aerosol concentrations. To overcome this limitation, a maximum difference search (MDS) algorithm was proposed to calculate the top of the boundary layer based on differences in particle characteristics. The top positions of the PBL from MDS algorithm under different convection states were compared with those from conventional methods. Experimental results demonstrated that the MDS method can determine the top of the boundary layer precisely. The proposed algorithm can also be used to calculate the top of the PBL accurately under weak convection conditions where the traditional methods cannot be applied. Finally, experimental data from June 2015 to December 2015 were analysed to verify the reliability of the MDS algorithm. The correlation coefficients R2 (RMSE) between the results of MDS algorithm and radiosonde measurements were 0.53 (115 m), 0.79 (141 m) and 0.96 (43 m) under weak, moderate and strong convections, respectively. These findings indicated that the proposed method possessed a good feasibility and stability.

A parallel row-based algorithm with error control for standard-cell replacement on a hypercube multiprocessor

NASA Technical Reports Server (NTRS)

Sargent, Jeff Scott

1988-01-01

A new row-based parallel algorithm for standard-cell placement targeted for execution on a hypercube multiprocessor is presented. Key features of this implementation include a dynamic simulated-annealing schedule, row-partitioning of the VLSI chip image, and two novel new approaches to controlling error in parallel cell-placement algorithms; Heuristic Cell-Coloring and Adaptive (Parallel Move) Sequence Control. Heuristic Cell-Coloring identifies sets of noninteracting cells that can be moved repeatedly, and in parallel, with no buildup of error in the placement cost. Adaptive Sequence Control allows multiple parallel cell moves to take place between global cell-position updates. This feedback mechanism is based on an error bound derived analytically from the traditional annealing move-acceptance profile. Placement results are presented for real industry circuits and the performance is summarized of an implementation on the Intel iPSC/2 Hypercube. The runtime of this algorithm is 5 to 16 times faster than a previous program developed for the Hypercube, while producing equivalent quality placement. An integrated place and route program for the Intel iPSC/2 Hypercube is currently being developed.

A three-dimensional spectral algorithm for simulations of transition and turbulence

NASA Technical Reports Server (NTRS)

Zang, T. A.; Hussaini, M. Y.

1985-01-01

A spectral algorithm for simulating three dimensional, incompressible, parallel shear flows is described. It applies to the channel, to the parallel boundary layer, and to other shear flows with one wall bounded and two periodic directions. Representative applications to the channel and to the heated boundary layer are presented.

Detached eddy simulation for turbulent fluid-structure interaction of moving bodies using the constraint-based immersed boundary method

NASA Astrophysics Data System (ADS)

Nangia, Nishant; Bhalla, Amneet P. S.; Griffith, Boyce E.; Patankar, Neelesh A.

2016-11-01

Flows over bodies of industrial importance often contain both an attached boundary layer region near the structure and a region of massively separated flow near its trailing edge. When simulating these flows with turbulence modeling, the Reynolds-averaged Navier-Stokes (RANS) approach is more efficient in the former, whereas large-eddy simulation (LES) is more accurate in the latter. Detached-eddy simulation (DES), based on the Spalart-Allmaras model, is a hybrid method that switches from RANS mode of solution in attached boundary layers to LES in detached flow regions. Simulations of turbulent flows over moving structures on a body-fitted mesh incur an enormous remeshing cost every time step. The constraint-based immersed boundary (cIB) method eliminates this operation by placing the structure on a Cartesian mesh and enforcing a rigidity constraint as an additional forcing in the Navier-Stokes momentum equation. We outline the formulation and development of a parallel DES-cIB method using adaptive mesh refinement. We show preliminary validation results for flows past stationary bodies with both attached and separated boundary layers along with results for turbulent flows past moving bodies. This work is supported by the National Science Foundation Graduate Research Fellowship under Grant No. DGE-1324585.

The energy-release rate and “self-force” of dynamically expanding spherical and plane inclusion boundaries with dilatational eigenstrain

NASA Astrophysics Data System (ADS)

Markenscoff, Xanthippi; Ni, Luqun

2010-01-01

In the context of the linear theory of elasticity with eigenstrains, the radiated field including inertia effects of a spherical inclusion with dilatational eigenstrain radially expanding is obtained on the basis of the dynamic Green's function, and one of the half-space inclusion boundary (with dilatational eigenstrain) moving from rest in general subsonic motion is obtained by a limiting process from the spherically expanding inclusion as the radius tends to infinity while the eigenstrain remains constrained, and this is the minimum energy solution. The global energy-release rate required to move the plane inclusion boundary and to create an incremental region of eigenstrain is defined analogously to the one for moving cracks and dislocations and represents the mechanical rate of work needed to be provide for the expansion of the inclusion. The calculated value, which is the "self-force" of the expanding inclusion, has a static component plus a dynamic one depending only on the current value of the velocity, while in the case of the spherical boundary, there is an additional contribution accounting for the jump in the strain at the farthest part at the back of the inclusion having the time to reach the front boundary, thus making the dynamic "self-force" history dependent.

Sources of spurious force oscillations from an immersed boundary method for moving-body problems

NASA Astrophysics Data System (ADS)

Lee, Jongho; Kim, Jungwoo; Choi, Haecheon; Yang, Kyung-Soo

2011-04-01

When a discrete-forcing immersed boundary method is applied to moving-body problems, it produces spurious force oscillations on a solid body. In the present study, we identify two sources of these force oscillations. One source is from the spatial discontinuity in the pressure across the immersed boundary when a grid point located inside a solid body becomes that of fluid with a body motion. The addition of mass source/sink together with momentum forcing proposed by Kim et al. [J. Kim, D. Kim, H. Choi, An immersed-boundary finite volume method for simulations of flow in complex geometries, Journal of Computational Physics 171 (2001) 132-150] reduces the spurious force oscillations by alleviating this pressure discontinuity. The other source is from the temporal discontinuity in the velocity at the grid points where fluid becomes solid with a body motion. The magnitude of velocity discontinuity decreases with decreasing the grid spacing near the immersed boundary. Four moving-body problems are simulated by varying the grid spacing at a fixed computational time step and at a constant CFL number, respectively. It is found that the spurious force oscillations decrease with decreasing the grid spacing and increasing the computational time step size, but they depend more on the grid spacing than on the computational time step size.

Spherical Harmonic Decomposition of Gravitational Waves Across Mesh Refinement Boundaries

NASA Technical Reports Server (NTRS)

Fiske, David R.; Baker, John; vanMeter, James R.; Centrella, Joan M.

2005-01-01

We evolve a linearized (Teukolsky) solution of the Einstein equations with a non-linear Einstein solver. Using this testbed, we are able to show that such gravitational waves, defined by the Weyl scalars in the Newman-Penrose formalism, propagate faithfully across mesh refinement boundaries, and use, for the first time to our knowledge, a novel algorithm due to Misner to compute spherical harmonic components of our waveforms. We show that the algorithm performs extremely well, even when the extraction sphere intersects refinement boundaries.

Linear segmentation algorithm for detecting layer boundary with lidar.

PubMed

Mao, Feiyue; Gong, Wei; Logan, Timothy

2013-11-04

The automatic detection of aerosol- and cloud-layer boundary (base and top) is important in atmospheric lidar data processing, because the boundary information is not only useful for environment and climate studies, but can also be used as input for further data processing. Previous methods have demonstrated limitations in defining the base and top, window-size setting, and have neglected the in-layer attenuation. To overcome these limitations, we present a new layer detection scheme for up-looking lidars based on linear segmentation with a reasonable threshold setting, boundary selecting, and false positive removing strategies. Preliminary results from both real and simulated data show that this algorithm cannot only detect the layer-base as accurate as the simple multi-scale method, but can also detect the layer-top more accurately than that of the simple multi-scale method. Our algorithm can be directly applied to uncalibrated data without requiring any additional measurements or window size selections.

Accurate mask-based spatially regularized correlation filter for visual tracking

NASA Astrophysics Data System (ADS)

Gu, Xiaodong; Xu, Xinping

2017-01-01

Recently, discriminative correlation filter (DCF)-based trackers have achieved extremely successful results in many competitions and benchmarks. These methods utilize a periodic assumption of the training samples to efficiently learn a classifier. However, this assumption will produce unwanted boundary effects, which severely degrade the tracking performance. Correlation filters with limited boundaries and spatially regularized DCFs were proposed to reduce boundary effects. However, their methods used the fixed mask or predesigned weights function, respectively, which was unsuitable for large appearance variation. We propose an accurate mask-based spatially regularized correlation filter for visual tracking. Our augmented objective can reduce the boundary effect even in large appearance variation. In our algorithm, the masking matrix is converted into the regularized function that acts on the correlation filter in frequency domain, which makes the algorithm fast convergence. Our online tracking algorithm performs favorably against state-of-the-art trackers on OTB-2015 Benchmark in terms of efficiency, accuracy, and robustness.

An Efficient and Robust Moving Shadow Removal Algorithm and Its Applications in ITS

NASA Astrophysics Data System (ADS)

Lin, Chin-Teng; Yang, Chien-Ting; Shou, Yu-Wen; Shen, Tzu-Kuei

2010-12-01

We propose an efficient algorithm for removing shadows of moving vehicles caused by non-uniform distributions of light reflections in the daytime. This paper presents a brand-new and complete structure in feature combination as well as analysis for orientating and labeling moving shadows so as to extract the defined objects in foregrounds more easily in each snapshot of the original files of videos which are acquired in the real traffic situations. Moreover, we make use of Gaussian Mixture Model (GMM) for background removal and detection of moving shadows in our tested images, and define two indices for characterizing non-shadowed regions where one indicates the characteristics of lines and the other index can be characterized by the information in gray scales of images which helps us to build a newly defined set of darkening ratios (modified darkening factors) based on Gaussian models. To prove the effectiveness of our moving shadow algorithm, we carry it out with a practical application of traffic flow detection in ITS (Intelligent Transportation System)—vehicle counting. Our algorithm shows the faster processing speed, 13.84 ms/frame, and can improve the accuracy rate in 4% ~ 10% for our three tested videos in the experimental results of vehicle counting.

Moving target parameter estimation of SAR after two looks cancellation

NASA Astrophysics Data System (ADS)

Gan, Rongbing; Wang, Jianguo; Gao, Xiang

2005-11-01

Moving target detection of synthetic aperture radar (SAR) by two looks cancellation is studied. First, two looks are got by the first and second half of the synthetic aperture. After two looks cancellation, the moving targets are reserved and stationary targets are removed. After that, a Constant False Alarm Rate (CFAR) detector detects moving targets. The ground range velocity and cross-range velocity of moving target can be got by the position shift between the two looks. We developed a method to estimate the cross-range shift due to slant range moving. we estimate cross-range shift by Doppler frequency center. Wigner-Ville Distribution (WVD) is used to estimate the Doppler frequency center (DFC). Because the range position and cross range before correction is known, estimation of DFC is much easier and efficient. Finally experiments results show that our algorithms have good performance. With the algorithms we can estimate the moving target parameter accurately.

An immersed boundary formulation for simulating high-speed compressible viscous flows with moving solids

NASA Astrophysics Data System (ADS)

Qu, Yegao; Shi, Ruchao; Batra, Romesh C.

2018-02-01

We present a robust sharp-interface immersed boundary method for numerically studying high speed flows of compressible and viscous fluids interacting with arbitrarily shaped either stationary or moving rigid solids. The Navier-Stokes equations are discretized on a rectangular Cartesian grid based on a low-diffusion flux splitting method for inviscid fluxes and conservative high-order central-difference schemes for the viscous components. Discontinuities such as those introduced by shock waves and contact surfaces are captured by using a high-resolution weighted essentially non-oscillatory (WENO) scheme. Ghost cells in the vicinity of the fluid-solid interface are introduced to satisfy boundary conditions on the interface. Values of variables in the ghost cells are found by using a constrained moving least squares method (CMLS) that eliminates numerical instabilities encountered in the conventional MLS formulation. The solution of the fluid flow and the solid motion equations is advanced in time by using the third-order Runge-Kutta and the implicit Newmark integration schemes, respectively. The performance of the proposed method has been assessed by computing results for the following four problems: shock-boundary layer interaction, supersonic viscous flows past a rigid cylinder, moving piston in a shock tube and lifting off from a flat surface of circular, rectangular and elliptic cylinders triggered by shock waves, and comparing computed results with those available in the literature.

Image registration of naval IR images

NASA Astrophysics Data System (ADS)

Rodland, Arne J.

1996-06-01

In a real world application an image from a stabilized sensor on a moving platform will not be 100 percent stabilized. There will always be a small unknown error in the stabilization due to factors such as dynamic deformations in the structure between sensor and reference Inertial Navigation Unit, servo inaccuracies, etc. For a high resolution imaging sensor this stabilization error causes the image to move several pixels in unknown direction between frames. TO be able to detect and track small moving objects from such a sensor, this unknown movement of the sensor image must be estimated. An algorithm that searches for land contours in the image has been evaluated. The algorithm searches for high contrast points distributed over the whole image. As long as moving objects in the scene only cover a small area of the scene, most of the points are located on solid ground. By matching the list of points from frame to frame, the movement of the image due to stabilization errors can be estimated and compensated. The point list is searched for points with diverging movement from the estimated stabilization error. These points are then assumed to be located on moving objects. Points assumed to be located on moving objects are gradually exchanged with new points located in the same area. Most of the processing is performed on the list of points and not on the complete image. The algorithm is therefore very fast and well suited for real time implementation. The algorithm has been tested on images from an experimental IR scanner. Stabilization errors were added artificially to the image such that the output from the algorithm could be compared with the artificially added stabilization errors.

A Numerical Method for Solving the 3D Unsteady Incompressible Navier-Stokes Equations in Curvilinear Domains with Complex Immersed Boundaries.

PubMed

Ge, Liang; Sotiropoulos, Fotis

2007-08-01

A novel numerical method is developed that integrates boundary-conforming grids with a sharp interface, immersed boundary methodology. The method is intended for simulating internal flows containing complex, moving immersed boundaries such as those encountered in several cardiovascular applications. The background domain (e.g the empty aorta) is discretized efficiently with a curvilinear boundary-fitted mesh while the complex moving immersed boundary (say a prosthetic heart valve) is treated with the sharp-interface, hybrid Cartesian/immersed-boundary approach of Gilmanov and Sotiropoulos [1]. To facilitate the implementation of this novel modeling paradigm in complex flow simulations, an accurate and efficient numerical method is developed for solving the unsteady, incompressible Navier-Stokes equations in generalized curvilinear coordinates. The method employs a novel, fully-curvilinear staggered grid discretization approach, which does not require either the explicit evaluation of the Christoffel symbols or the discretization of all three momentum equations at cell interfaces as done in previous formulations. The equations are integrated in time using an efficient, second-order accurate fractional step methodology coupled with a Jacobian-free, Newton-Krylov solver for the momentum equations and a GMRES solver enhanced with multigrid as preconditioner for the Poisson equation. Several numerical experiments are carried out on fine computational meshes to demonstrate the accuracy and efficiency of the proposed method for standard benchmark problems as well as for unsteady, pulsatile flow through a curved, pipe bend. To demonstrate the ability of the method to simulate flows with complex, moving immersed boundaries we apply it to calculate pulsatile, physiological flow through a mechanical, bileaflet heart valve mounted in a model straight aorta with an anatomical-like triple sinus.

A Numerical Method for Solving the 3D Unsteady Incompressible Navier-Stokes Equations in Curvilinear Domains with Complex Immersed Boundaries

PubMed Central

Ge, Liang; Sotiropoulos, Fotis

2008-01-01

A novel numerical method is developed that integrates boundary-conforming grids with a sharp interface, immersed boundary methodology. The method is intended for simulating internal flows containing complex, moving immersed boundaries such as those encountered in several cardiovascular applications. The background domain (e.g the empty aorta) is discretized efficiently with a curvilinear boundary-fitted mesh while the complex moving immersed boundary (say a prosthetic heart valve) is treated with the sharp-interface, hybrid Cartesian/immersed-boundary approach of Gilmanov and Sotiropoulos [1]. To facilitate the implementation of this novel modeling paradigm in complex flow simulations, an accurate and efficient numerical method is developed for solving the unsteady, incompressible Navier-Stokes equations in generalized curvilinear coordinates. The method employs a novel, fully-curvilinear staggered grid discretization approach, which does not require either the explicit evaluation of the Christoffel symbols or the discretization of all three momentum equations at cell interfaces as done in previous formulations. The equations are integrated in time using an efficient, second-order accurate fractional step methodology coupled with a Jacobian-free, Newton-Krylov solver for the momentum equations and a GMRES solver enhanced with multigrid as preconditioner for the Poisson equation. Several numerical experiments are carried out on fine computational meshes to demonstrate the accuracy and efficiency of the proposed method for standard benchmark problems as well as for unsteady, pulsatile flow through a curved, pipe bend. To demonstrate the ability of the method to simulate flows with complex, moving immersed boundaries we apply it to calculate pulsatile, physiological flow through a mechanical, bileaflet heart valve mounted in a model straight aorta with an anatomical-like triple sinus. PMID:19194533

Constant-pressure nested sampling with atomistic dynamics

NASA Astrophysics Data System (ADS)

Baldock, Robert J. N.; Bernstein, Noam; Salerno, K. Michael; Pártay, Lívia B.; Csányi, Gábor

2017-10-01

The nested sampling algorithm has been shown to be a general method for calculating the pressure-temperature-composition phase diagrams of materials. While the previous implementation used single-particle Monte Carlo moves, these are inefficient for condensed systems with general interactions where single-particle moves cannot be evaluated faster than the energy of the whole system. Here we enhance the method by using all-particle moves: either Galilean Monte Carlo or the total enthalpy Hamiltonian Monte Carlo algorithm, introduced in this paper. We show that these algorithms enable the determination of phase transition temperatures with equivalent accuracy to the previous method at 1 /N of the cost for an N -particle system with general interactions, or at equal cost when single-particle moves can be done in 1 /N of the cost of a full N -particle energy evaluation. We demonstrate this speed-up for the freezing and condensation transitions of the Lennard-Jones system and show the utility of the algorithms by calculating the order-disorder phase transition of a binary Lennard-Jones model alloy, the eutectic of copper-gold, the density anomaly of water, and the condensation and solidification of bead-spring polymers. The nested sampling method with all three algorithms is implemented in the pymatnest software.

Track-Before-Detect Algorithm for Faint Moving Objects based on Random Sampling and Consensus

NASA Astrophysics Data System (ADS)

Dao, P.; Rast, R.; Schlaegel, W.; Schmidt, V.; Dentamaro, A.

2014-09-01

There are many algorithms developed for tracking and detecting faint moving objects in congested backgrounds. One obvious application is detection of targets in images where each pixel corresponds to the received power in a particular location. In our application, a visible imager operated in stare mode observes geostationary objects as fixed, stars as moving and non-geostationary objects as drifting in the field of view. We would like to achieve high sensitivity detection of the drifters. The ability to improve SNR with track-before-detect (TBD) processing, where target information is collected and collated before the detection decision is made, allows respectable performance against dim moving objects. Generally, a TBD algorithm consists of a pre-processing stage that highlights potential targets and a temporal filtering stage. However, the algorithms that have been successfully demonstrated, e.g. Viterbi-based and Bayesian-based, demand formidable processing power and memory. We propose an algorithm that exploits the quasi constant velocity of objects, the predictability of the stellar clutter and the intrinsically low false alarm rate of detecting signature candidates in 3-D, based on an iterative method called "RANdom SAmple Consensus” and one that can run real-time on a typical PC. The technique is tailored for searching objects with small telescopes in stare mode. Our RANSAC-MT (Moving Target) algorithm estimates parameters of a mathematical model (e.g., linear motion) from a set of observed data which contains a significant number of outliers while identifying inliers. In the pre-processing phase, candidate blobs were selected based on morphology and an intensity threshold that would normally generate unacceptable level of false alarms. The RANSAC sampling rejects candidates that conform to the predictable motion of the stars. Data collected with a 17 inch telescope by AFRL/RH and a COTS lens/EM-CCD sensor by the AFRL/RD Satellite Assessment Center is used to assess the performance of the algorithm. In the second application, a visible imager operated in sidereal mode observes geostationary objects as moving, stars as fixed except for field rotation, and non-geostationary objects as drifting. RANSAC-MT is used to detect the drifter. In this set of data, the drifting space object was detected at a distance of 13800 km. The AFRL/RH set of data, collected in the stare mode, contained the signature of two geostationary satellites. The signature of a moving object was simulated and added to the sequence of frames to determine the sensitivity in magnitude. The performance compares well with the more intensive TBD algorithms reported in the literature.

Moving Particles Through a Finite Element Mesh

PubMed Central

Peskin, Adele P.; Hardin, Gary R.

1998-01-01

We present a new numerical technique for modeling the flow around multiple objects moving in a fluid. The method tracks the dynamic interaction between each particle and the fluid. The movements of the fluid and the object are directly coupled. A background mesh is designed to fit the geometry of the overall domain. The mesh is designed independently of the presence of the particles except in terms of how fine it must be to track particles of a given size. Each particle is represented by a geometric figure that describes its boundary. This figure overlies the mesh. Nodes are added to the mesh where the particle boundaries intersect the background mesh, increasing the number of nodes contained in each element whose boundary is intersected. These additional nodes are then used to describe and track the particle in the numerical scheme. Appropriate element shape functions are defined to approximate the solution on the elements with extra nodes. The particles are moved through the mesh by moving only the overlying nodes defining the particles. The regular finite element grid remains unchanged. In this method, the mesh does not distort as the particles move. Instead, only the placement of particle-defining nodes changes as the particles move. Element shape functions are updated as the nodes move through the elements. This method is especially suited for models of moderate numbers of moderate-size particles, where the details of the fluid-particle coupling are important. Both the complications of creating finite element meshes around appreciable numbers of particles, and extensive remeshing upon movement of the particles are simplified in this method. PMID:28009377

COMOC: Three dimensional boundary region variant, programmer's manual

NASA Technical Reports Server (NTRS)

Orzechowski, J. A.; Baker, A. J.

1974-01-01

The three-dimensional boundary region variant of the COMOC computer program system solves the partial differential equation system governing certain three-dimensional flows of a viscous, heat conducting, multiple-species, compressible fluid including combustion. The solution is established in physical variables, using a finite element algorithm for the boundary value portion of the problem description in combination with an explicit marching technique for the initial value character. The computational lattice may be arbitrarily nonregular, and boundary condition constraints are readily applied. The theoretical foundation of the algorithm, a detailed description on the construction and operation of the program, and instructions on utilization of the many features of the code are presented.

AgRISTARS. Supporting research: Algorithms for scene modelling

NASA Technical Reports Server (NTRS)

Rassbach, M. E. (Principal Investigator)

1982-01-01

The requirements for a comprehensive analysis of LANDSAT or other visual data scenes are defined. The development of a general model of a scene and a computer algorithm for finding the particular model for a given scene is discussed. The modelling system includes a boundary analysis subsystem, which detects all the boundaries and lines in the image and builds a boundary graph; a continuous variation analysis subsystem, which finds gradual variations not well approximated by a boundary structure; and a miscellaneous features analysis, which includes texture, line parallelism, etc. The noise reduction capabilities of this method and its use in image rectification and registration are discussed.

Comparison of imaging modalities and source-localization algorithms in locating the induced activity during deep brain stimulation of the STN.

PubMed

Mideksa, K G; Singh, A; Hoogenboom, N; Hellriegel, H; Krause, H; Schnitzler, A; Deuschl, G; Raethjen, J; Schmidt, G; Muthuraman, M

2016-08-01

One of the most commonly used therapy to treat patients with Parkinson's disease (PD) is deep brain stimulation (DBS) of the subthalamic nucleus (STN). Identifying the most optimal target area for the placement of the DBS electrodes have become one of the intensive research area. In this study, the first aim is to investigate the capabilities of different source-analysis techniques in detecting deep sources located at the sub-cortical level and validating it using the a-priori information about the location of the source, that is, the STN. Secondly, we aim at an investigation of whether EEG or MEG is best suited in mapping the DBS-induced brain activity. To do this, simultaneous EEG and MEG measurement were used to record the DBS-induced electromagnetic potentials and fields. The boundary-element method (BEM) have been used to solve the forward problem. The position of the DBS electrodes was then estimated using the dipole (moving, rotating, and fixed MUSIC), and current-density-reconstruction (CDR) (minimum-norm and sLORETA) approaches. The source-localization results from the dipole approaches demonstrated that the fixed MUSIC algorithm best localizes deep focal sources, whereas the moving dipole detects not only the region of interest but also neighboring regions that are affected by stimulating the STN. The results from the CDR approaches validated the capability of sLORETA in detecting the STN compared to minimum-norm. Moreover, the source-localization results using the EEG modality outperformed that of the MEG by locating the DBS-induced activity in the STN.

Inference of boundaries in causal sets

NASA Astrophysics Data System (ADS)

Cunningham, William J.

2018-05-01

We investigate the extrinsic geometry of causal sets in (1+1) -dimensional Minkowski spacetime. The properties of boundaries in an embedding space can be used not only to measure observables, but also to supplement the discrete action in the partition function via discretized Gibbons–Hawking–York boundary terms. We define several ways to represent a causal set using overlapping subsets, which then allows us to distinguish between null and non-null bounding hypersurfaces in an embedding space. We discuss algorithms to differentiate between different types of regions, consider when these distinctions are possible, and then apply the algorithms to several spacetime regions. Numerical results indicate the volumes of timelike boundaries can be measured to within 0.5% accuracy for flat boundaries and within 10% accuracy for highly curved boundaries for medium-sized causal sets with N  =  214 spacetime elements.

Heterogeneous CPU-GPU moving targets detection for UAV video

NASA Astrophysics Data System (ADS)

Li, Maowen; Tang, Linbo; Han, Yuqi; Yu, Chunlei; Zhang, Chao; Fu, Huiquan

2017-07-01

Moving targets detection is gaining popularity in civilian and military applications. On some monitoring platform of motion detection, some low-resolution stationary cameras are replaced by moving HD camera based on UAVs. The pixels of moving targets in the HD Video taken by UAV are always in a minority, and the background of the frame is usually moving because of the motion of UAVs. The high computational cost of the algorithm prevents running it at higher resolutions the pixels of frame. Hence, to solve the problem of moving targets detection based UAVs video, we propose a heterogeneous CPU-GPU moving target detection algorithm for UAV video. More specifically, we use background registration to eliminate the impact of the moving background and frame difference to detect small moving targets. In order to achieve the effect of real-time processing, we design the solution of heterogeneous CPU-GPU framework for our method. The experimental results show that our method can detect the main moving targets from the HD video taken by UAV, and the average process time is 52.16ms per frame which is fast enough to solve the problem.

A fast numerical method for ideal fluid flow in domains with multiple stirrers

NASA Astrophysics Data System (ADS)

Nasser, Mohamed M. S.; Green, Christopher C.

2018-03-01

A collection of arbitrarily-shaped solid objects, each moving at a constant speed, can be used to mix or stir ideal fluid, and can give rise to interesting flow patterns. Assuming these systems of fluid stirrers are two-dimensional, the mathematical problem of resolving the flow field—given a particular distribution of any finite number of stirrers of specified shape and speed—can be formulated as a Riemann-Hilbert (R-H) problem. We show that this R-H problem can be solved numerically using a fast and accurate algorithm for any finite number of stirrers based around a boundary integral equation with the generalized Neumann kernel. Various systems of fluid stirrers are considered, and our numerical scheme is shown to handle highly multiply connected domains (i.e. systems of many fluid stirrers) with minimal computational expense.

Validation of tsunami inundation model TUNA-RP using OAR-PMEL-135 benchmark problem set

NASA Astrophysics Data System (ADS)

Koh, H. L.; Teh, S. Y.; Tan, W. K.; Kh'ng, X. Y.

2017-05-01

A standard set of benchmark problems, known as OAR-PMEL-135, is developed by the US National Tsunami Hazard Mitigation Program for tsunami inundation model validation. Any tsunami inundation model must be tested for its accuracy and capability using this standard set of benchmark problems before it can be gainfully used for inundation simulation. The authors have previously developed an in-house tsunami inundation model known as TUNA-RP. This inundation model solves the two-dimensional nonlinear shallow water equations coupled with a wet-dry moving boundary algorithm. This paper presents the validation of TUNA-RP against the solutions provided in the OAR-PMEL-135 benchmark problem set. This benchmark validation testing shows that TUNA-RP can indeed perform inundation simulation with accuracy consistent with that in the tested benchmark problem set.

An Efficient Moving Target Detection Algorithm Based on Sparsity-Aware Spectrum Estimation

PubMed Central

Shen, Mingwei; Wang, Jie; Wu, Di; Zhu, Daiyin

2014-01-01

In this paper, an efficient direct data domain space-time adaptive processing (STAP) algorithm for moving targets detection is proposed, which is achieved based on the distinct spectrum features of clutter and target signals in the angle-Doppler domain. To reduce the computational complexity, the high-resolution angle-Doppler spectrum is obtained by finding the sparsest coefficients in the angle domain using the reduced-dimension data within each Doppler bin. Moreover, we will then present a knowledge-aided block-size detection algorithm that can discriminate between the moving targets and the clutter based on the extracted spectrum features. The feasibility and effectiveness of the proposed method are validated through both numerical simulations and raw data processing results. PMID:25222035

An image-space parallel convolution filtering algorithm based on shadow map

NASA Astrophysics Data System (ADS)

Li, Hua; Yang, Huamin; Zhao, Jianping

2017-07-01

Shadow mapping is commonly used in real-time rendering. In this paper, we presented an accurate and efficient method of soft shadows generation from planar area lights. First this method generated a depth map from light's view, and analyzed the depth-discontinuities areas as well as shadow boundaries. Then these areas were described as binary values in the texture map called binary light-visibility map, and a parallel convolution filtering algorithm based on GPU was enforced to smooth out the boundaries with a box filter. Experiments show that our algorithm is an effective shadow map based method that produces perceptually accurate soft shadows in real time with more details of shadow boundaries compared with the previous works.

Analytic Approximations to the Free Boundary and Multi-dimensional Problems in Financial Derivatives Pricing

NASA Astrophysics Data System (ADS)

Lau, Chun Sing

This thesis studies two types of problems in financial derivatives pricing. The first type is the free boundary problem, which can be formulated as a partial differential equation (PDE) subject to a set of free boundary condition. Although the functional form of the free boundary condition is given explicitly, the location of the free boundary is unknown and can only be determined implicitly by imposing continuity conditions on the solution. Two specific problems are studied in details, namely the valuation of fixed-rate mortgages and CEV American options. The second type is the multi-dimensional problem, which involves multiple correlated stochastic variables and their governing PDE. One typical problem we focus on is the valuation of basket-spread options, whose underlying asset prices are driven by correlated geometric Brownian motions (GBMs). Analytic approximate solutions are derived for each of these three problems. For each of the two free boundary problems, we propose a parametric moving boundary to approximate the unknown free boundary, so that the original problem transforms into a moving boundary problem which can be solved analytically. The governing parameter of the moving boundary is determined by imposing the first derivative continuity condition on the solution. The analytic form of the solution allows the price and the hedging parameters to be computed very efficiently. When compared against the benchmark finite-difference method, the computational time is significantly reduced without compromising the accuracy. The multi-stage scheme further allows the approximate results to systematically converge to the benchmark results as one recasts the moving boundary into a piecewise smooth continuous function. For the multi-dimensional problem, we generalize the Kirk (1995) approximate two-asset spread option formula to the case of multi-asset basket-spread option. Since the final formula is in closed form, all the hedging parameters can also be derived in closed form. Numerical examples demonstrate that the pricing and hedging errors are in general less than 1% relative to the benchmark prices obtained by numerical integration or Monte Carlo simulation. By exploiting an explicit relationship between the option price and the underlying probability distribution, we further derive an approximate distribution function for the general basket-spread variable. It can be used to approximate the transition probability distribution of any linear combination of correlated GBMs. Finally, an implicit perturbation is applied to reduce the pricing errors by factors of up to 100. When compared against the existing methods, the basket-spread option formula coupled with the implicit perturbation turns out to be one of the most robust and accurate approximation methods.

Inner hair cell stereocilia movements captured in-situ by a high-speed camera with subpixel image processing

NASA Astrophysics Data System (ADS)

Wang, Yanli; Puria, Sunil; Steele, Charles R.; Ricci, Anthony J.

2018-05-01

Mechanical stimulation of the stereocilia hair bundles of the inner and outer hair cells (IHCs and OHCs, respectively) drives IHC synaptic release and OHC electromotility. The modes of hair-bundle motion can have a dramatic influence on the electrophysiological responses of the hair cells. The in vivo modes of motion are, however, unknown for both IHC and OHC bundles. In this work, we are developing technology to investigate the in situ hair-bundle motion in excised mouse cochleae, for which the hair bundles of the OHCs are embedded in the tectorial membrane but those of the IHCs are not. Motion is generated by pushing onto the stapes at 1 kHz with a glass probe coupled to a piezo stack, and recorded using a high-speed camera at 10,000 frames per second. The motions of individual IHC stereocilia and the cell boundary are analyzed using 2D and 1D Gaussian fitting algorithms, respectively. Preliminary results show that the IHC bundle moves mainly in the radial direction and exhibits a small degree of splay, and that the stereocilia in the second row move less than those in the first row, even in the same focal plane.

Finite element formulation of fluctuating hydrodynamics for fluids filled with rigid particles using boundary fitted meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

De Corato, M., E-mail: marco.decorato@unina.it; Slot, J.J.M., E-mail: j.j.m.slot@tue.nl; Hütter, M., E-mail: m.huetter@tue.nl

In this paper, we present a finite element implementation of fluctuating hydrodynamics with a moving boundary fitted mesh for treating the suspended particles. The thermal fluctuations are incorporated into the continuum equations using the Landau and Lifshitz approach [1]. The proposed implementation fulfills the fluctuation–dissipation theorem exactly at the discrete level. Since we restrict the equations to the creeping flow case, this takes the form of a relation between the diffusion coefficient matrix and friction matrix both at the particle and nodal level of the finite elements. Brownian motion of arbitrarily shaped particles in complex confinements can be considered withinmore » the present formulation. A multi-step time integration scheme is developed to correctly capture the drift term required in the stochastic differential equation (SDE) describing the evolution of the positions of the particles. The proposed approach is validated by simulating the Brownian motion of a sphere between two parallel plates and the motion of a spherical particle in a cylindrical cavity. The time integration algorithm and the fluctuating hydrodynamics implementation are then applied to study the diffusion and the equilibrium probability distribution of a confined circle under an external harmonic potential.« less

A finite element computation of turbulent boundary layer flows with an algebraic stress turbulence model

NASA Technical Reports Server (NTRS)

Kim, Sang-Wook; Chen, Yen-Sen

1988-01-01

An algebraic stress turbulence model and a computational procedure for turbulent boundary layer flows which is based on the semidiscrete Galerkin FEM are discussed. In the algebraic stress turbulence model, the eddy viscosity expression is obtained from the Reynolds stress turbulence model, and the turbulent kinetic energy dissipation rate equation is improved by including a production range time scale. Good agreement with experimental data is found for the examples of a fully developed channel flow, a fully developed pipe flow, a flat plate boundary layer flow, a plane jet exhausting into a moving stream, a circular jet exhausting into a moving stream, and a wall jet flow.

Road-Aided Ground Slowly Moving Target 2D Motion Estimation for Single-Channel Synthetic Aperture Radar.

PubMed

Wang, Zhirui; Xu, Jia; Huang, Zuzhen; Zhang, Xudong; Xia, Xiang-Gen; Long, Teng; Bao, Qian

2016-03-16

To detect and estimate ground slowly moving targets in airborne single-channel synthetic aperture radar (SAR), a road-aided ground moving target indication (GMTI) algorithm is proposed in this paper. First, the road area is extracted from a focused SAR image based on radar vision. Second, after stationary clutter suppression in the range-Doppler domain, a moving target is detected and located in the image domain via the watershed method. The target's position on the road as well as its radial velocity can be determined according to the target's offset distance and traffic rules. Furthermore, the target's azimuth velocity is estimated based on the road slope obtained via polynomial fitting. Compared with the traditional algorithms, the proposed method can effectively cope with slowly moving targets partly submerged in a stationary clutter spectrum. In addition, the proposed method can be easily extended to a multi-channel system to further improve the performance of clutter suppression and motion estimation. Finally, the results of numerical experiments are provided to demonstrate the effectiveness of the proposed algorithm.

Unsteady Boundary-Layer Flow over Jerked Plate Moving in a Free Stream of Viscoelastic Fluid

PubMed Central

Mehmood, Ahmer; Ali, Asif; Saleem, Najma

2014-01-01

This study aims to investigate the unsteady boundary-layer flow of a viscoelastic non-Newtonian fluid over a flat surface. The plate is suddenly jerked to move with uniform velocity in a uniform stream of non-Newtonian fluid. Purely analytic solution to governing nonlinear equation is obtained. The solution is highly accurate and valid for all values of the dimensionless time 0 ≤ τ < ∞. Flow properties of the viscoelastic fluid are discussed through graphs. PMID:24892060

Global conservation model for a mushy region over a moving substrate

NASA Astrophysics Data System (ADS)

Kyselica, J.; Šimkanin, J.

2018-03-01

We study solidification over a cool substrate moving with a relative velocity with respect to the rest of the fluid. A mathematical model based on global conservation of solute is presented. The explicit solutions of the governing equations are found and analysed via the asymptotic methods. The assessment of how the boundary-layer flow influences the physical characteristics of the mushy region is given, together with the discussion of a possible connection with the solidification at the inner core boundary.

Algebraic grid generation using tensor product B-splines. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Saunders, B. V.

1985-01-01

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

A-Track: Detecting Moving Objects in FITS images

NASA Astrophysics Data System (ADS)

Atay, T.; Kaplan, M.; Kilic, Y.; Karapinar, N.

2017-04-01

A-Track is a fast, open-source, cross-platform pipeline for detecting moving objects (asteroids and comets) in sequential telescope images in FITS format. The moving objects are detected using a modified line detection algorithm.

Curvilinear Immersed Boundary Method for Simulating Fluid Structure Interaction with Complex 3D Rigid Bodies

PubMed Central

Borazjani, Iman; Ge, Liang; Sotiropoulos, Fotis

2010-01-01

The sharp-interface CURVIB approach of Ge and Sotiropoulos [L. Ge, F. Sotiropoulos, A Numerical Method for Solving the 3D Unsteady Incompressible Navier-Stokes Equations in Curvilinear Domains with Complex Immersed Boundaries, Journal of Computational Physics 225 (2007) 1782–1809] is extended to simulate fluid structure interaction (FSI) problems involving complex 3D rigid bodies undergoing large structural displacements. The FSI solver adopts the partitioned FSI solution approach and both loose and strong coupling strategies are implemented. The interfaces between immersed bodies and the fluid are discretized with a Lagrangian grid and tracked with an explicit front-tracking approach. An efficient ray-tracing algorithm is developed to quickly identify the relationship between the background grid and the moving bodies. Numerical experiments are carried out for two FSI problems: vortex induced vibration of elastically mounted cylinders and flow through a bileaflet mechanical heart valve at physiologic conditions. For both cases the computed results are in excellent agreement with benchmark simulations and experimental measurements. The numerical experiments suggest that both the properties of the structure (mass, geometry) and the local flow conditions can play an important role in determining the stability of the FSI algorithm. Under certain conditions unconditionally unstable iteration schemes result even when strong coupling FSI is employed. For such cases, however, combining the strong-coupling iteration with under-relaxation in conjunction with the Aitken’s acceleration technique is shown to effectively resolve the stability problems. A theoretical analysis is presented to explain the findings of the numerical experiments. It is shown that the ratio of the added mass to the mass of the structure as well as the sign of the local time rate of change of the force or moment imparted on the structure by the fluid determine the stability and convergence of the FSI algorithm. The stabilizing role of under-relaxation is also clarified and an upper bound of the required for stability under-relaxation coefficient is derived. PMID:20981246

Parameter estimation for chaotic systems using improved bird swarm algorithm

NASA Astrophysics Data System (ADS)

Xu, Chuangbiao; Yang, Renhuan

2017-12-01

Parameter estimation of chaotic systems is an important problem in nonlinear science and has aroused increasing interest of many research fields, which can be basically reduced to a multidimensional optimization problem. In this paper, an improved boundary bird swarm algorithm is used to estimate the parameters of chaotic systems. This algorithm can combine the good global convergence and robustness of the bird swarm algorithm and the exploitation capability of improved boundary learning strategy. Experiments are conducted on the Lorenz system and the coupling motor system. Numerical simulation results reveal the effectiveness and with desirable performance of IBBSA for parameter estimation of chaotic systems.

Efficient Geometric Sound Propagation Using Visibility Culling

NASA Astrophysics Data System (ADS)

Chandak, Anish

2011-07-01

Simulating propagation of sound can improve the sense of realism in interactive applications such as video games and can lead to better designs in engineering applications such as architectural acoustics. In this thesis, we present geometric sound propagation techniques which are faster than prior methods and map well to upcoming parallel multi-core CPUs. We model specular reflections by using the image-source method and model finite-edge diffraction by using the well-known Biot-Tolstoy-Medwin (BTM) model. We accelerate the computation of specular reflections by applying novel visibility algorithms, FastV and AD-Frustum, which compute visibility from a point. We accelerate finite-edge diffraction modeling by applying a novel visibility algorithm which computes visibility from a region. Our visibility algorithms are based on frustum tracing and exploit recent advances in fast ray-hierarchy intersections, data-parallel computations, and scalable, multi-core algorithms. The AD-Frustum algorithm adapts its computation to the scene complexity and allows small errors in computing specular reflection paths for higher computational efficiency. FastV and our visibility algorithm from a region are general, object-space, conservative visibility algorithms that together significantly reduce the number of image sources compared to other techniques while preserving the same accuracy. Our geometric propagation algorithms are an order of magnitude faster than prior approaches for modeling specular reflections and two to ten times faster for modeling finite-edge diffraction. Our algorithms are interactive, scale almost linearly on multi-core CPUs, and can handle large, complex, and dynamic scenes. We also compare the accuracy of our sound propagation algorithms with other methods. Once sound propagation is performed, it is desirable to listen to the propagated sound in interactive and engineering applications. We can generate smooth, artifact-free output audio signals by applying efficient audio-processing algorithms. We also present the first efficient audio-processing algorithm for scenarios with simultaneously moving source and moving receiver (MS-MR) which incurs less than 25% overhead compared to static source and moving receiver (SS-MR) or moving source and static receiver (MS-SR) scenario.

Denni Algorithm An Enhanced Of SMS (Scan, Move and Sort) Algorithm

NASA Astrophysics Data System (ADS)

Aprilsyah Lubis, Denni; Salim Sitompul, Opim; Marwan; Tulus; Andri Budiman, M.

2017-12-01

Sorting has been a profound area for the algorithmic researchers, and many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly. Sorting has been considered as a fundamental problem in the study of algorithms that due to many reasons namely, the necessary to sort information is inherent in many applications, algorithms often use sorting as a key subroutine, in algorithm design there are many essential techniques represented in the body of sorting algorithms, and many engineering issues come to the fore when implementing sorting algorithms., Many algorithms are very well known for sorting the unordered lists, and one of the well-known algorithms that make the process of sorting to be more economical and efficient is SMS (Scan, Move and Sort) algorithm, an enhancement of Quicksort invented Rami Mansi in 2010. This paper presents a new sorting algorithm called Denni-algorithm. The Denni algorithm is considered as an enhancement on the SMS algorithm in average, and worst cases. The Denni algorithm is compared with the SMS algorithm and the results were promising.

Electrolyte system strategies for anionic ITP with ESI-MS detection. 3. The ITP spacer technique in moving-boundary systems and configurations with two self-maintained ITP subsystems.

PubMed

Gebauer, Petr; Malá, Zdena; Boček, Petr

2014-03-01

This contribution is the third part of the project on strategies used in the selection and tuning of electrolyte systems for anionic ITP with ESI-MS detection. The strategy presented here is based on the creation of self-maintained ITP subsystems in moving-boundary systems and describes two new principal approaches offering physical separation of analyte zones from their common ITP stack and/or simultaneous selective stacking of two different analyte groups. Both strategic directions are based on extending the number of components forming the electrolyte system by adding a third suitable anion. The first method is the application of the spacer technique to moving-boundary anionic ITP systems, the second method is a technique utilizing a moving-boundary ITP system in which two ITP subsystems exist and move with mutually different velocities. It is essential for ESI detection that both methods can be based on electrolyte systems containing only several simple chemicals, such as simple volatile organic acids (formic and acetic) and their ammonium salts. The properties of both techniques are defined theoretically and discussed from the viewpoint of their applicability to trace analysis by ITP-ESI-MS. Examples of system design for selected model separations of preservatives and pharmaceuticals illustrate the validity of the theoretical model and application potential of the proposed techniques by both computer simulations and experiments. Both new methods enhance the application range of ITP-MS and may be beneficial particularly for complex multicomponent samples or for analytes with identical molecular mass. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A space-time tensor formulation for continuum mechanics in general curvilinear, moving, and deforming coordinate systems

NASA Technical Reports Server (NTRS)

Avis, L. M.

1976-01-01

Tensor methods are used to express the continuum equations of motion in general curvilinear, moving, and deforming coordinate systems. The space-time tensor formulation is applicable to situations in which, for example, the boundaries move and deform. Placing a coordinate surface on such a boundary simplifies the boundary condition treatment. The space-time tensor formulation is also applicable to coordinate systems with coordinate surfaces defined as surfaces of constant pressure, density, temperature, or any other scalar continuum field function. The vanishing of the function gradient components along the coordinate surfaces may simplify the set of governing equations. In numerical integration of the equations of motion, the freedom of motion of the coordinate surfaces provides a potential for enhanced resolution of the continuum field function. An example problem of an incompressible, inviscid fluid with a top free surface is considered, where the surfaces of constant pressure (including the top free surface) are coordinate surfaces.

From video to computation of biological fluid-structure interaction problems

NASA Astrophysics Data System (ADS)

Dillard, Seth I.; Buchholz, James H. J.; Udaykumar, H. S.

2016-04-01

This work deals with the techniques necessary to obtain a purely Eulerian procedure to conduct CFD simulations of biological systems with moving boundary flow phenomena. Eulerian approaches obviate difficulties associated with mesh generation to describe or fit flow meshes to body surfaces. The challenges associated with constructing embedded boundary information, body motions and applying boundary conditions on the moving bodies for flow computation are addressed in the work. The overall approach is applied to the study of a fluid-structure interaction problem, i.e., the hydrodynamics of swimming of an American eel, where the motion of the eel is derived from video imaging. It is shown that some first-blush approaches do not work, and therefore, careful consideration of appropriate techniques to connect moving images to flow simulations is necessary and forms the main contribution of the paper. A combination of level set-based active contour segmentation with optical flow and image morphing is shown to enable the image-to-computation process.

Formulation and Implementation of Inflow/Outflow Boundary Conditions to Simulate Propulsive Effects

NASA Technical Reports Server (NTRS)

Rodriguez, David L.; Aftosmis, Michael J.; Nemec, Marian

2018-01-01

Boundary conditions appropriate for simulating flow entering or exiting the computational domain to mimic propulsion effects have been implemented in an adaptive Cartesian simulation package. A robust iterative algorithm to control mass flow rate through an outflow boundary surface is presented, along with a formulation to explicitly specify mass flow rate through an inflow boundary surface. The boundary conditions have been applied within a mesh adaptation framework based on the method of adjoint-weighted residuals. This allows for proper adaptive mesh refinement when modeling propulsion systems. The new boundary conditions are demonstrated on several notional propulsion systems operating in flow regimes ranging from low subsonic to hypersonic. The examples show that the prescribed boundary state is more properly imposed as the mesh is refined. The mass-flowrate steering algorithm is shown to be an efficient approach in each example. To demonstrate the boundary conditions on a realistic complex aircraft geometry, two of the new boundary conditions are also applied to a modern low-boom supersonic demonstrator design with multiple flow inlets and outlets.

Robust pupil center detection using a curvature algorithm

NASA Technical Reports Server (NTRS)

Zhu, D.; Moore, S. T.; Raphan, T.; Wall, C. C. (Principal Investigator)

1999-01-01

Determining the pupil center is fundamental for calculating eye orientation in video-based systems. Existing techniques are error prone and not robust because eyelids, eyelashes, corneal reflections or shadows in many instances occlude the pupil. We have developed a new algorithm which utilizes curvature characteristics of the pupil boundary to eliminate these artifacts. Pupil center is computed based solely on points related to the pupil boundary. For each boundary point, a curvature value is computed. Occlusion of the boundary induces characteristic peaks in the curvature function. Curvature values for normal pupil sizes were determined and a threshold was found which together with heuristics discriminated normal from abnormal curvature. Remaining boundary points were fit with an ellipse using a least squares error criterion. The center of the ellipse is an estimate of the pupil center. This technique is robust and accurately estimates pupil center with less than 40% of the pupil boundary points visible.

Acoustic coupled fluid-structure interactions using a unified fast multipole boundary element method.

PubMed

Wilkes, Daniel R; Duncan, Alec J

2015-04-01

This paper presents a numerical model for the acoustic coupled fluid-structure interaction (FSI) of a submerged finite elastic body using the fast multipole boundary element method (FMBEM). The Helmholtz and elastodynamic boundary integral equations (BIEs) are, respectively, employed to model the exterior fluid and interior solid domains, and the pressure and displacement unknowns are coupled between conforming meshes at the shared boundary interface to achieve the acoustic FSI. The low frequency FMBEM is applied to both BIEs to reduce the algorithmic complexity of the iterative solution from O(N(2)) to O(N(1.5)) operations per matrix-vector product for N boundary unknowns. Numerical examples are presented to demonstrate the algorithmic and memory complexity of the method, which are shown to be in good agreement with the theoretical estimates, while the solution accuracy is comparable to that achieved by a conventional finite element-boundary element FSI model.

Lubrication theory for a random fibrous medium

NASA Astrophysics Data System (ADS)

Mirbod, Parisa; Andreopoulos, Yiannis; Weinbaum, Sheldon

2007-11-01

In the classical theory for a slipper bearing one examines the relative motion of an inclined planar surface and a horizontal planar surface. The solution for the pressure distribution and lift force are independent of which boundary is moving and there is an optimum tilt k=h1/h2=2.2 for maximum lift. This symmetry is lost if the intervening space is filled with a soft porous fibrous material. In this paper the generalized Reynolds equation derived in Feng and Weinbaum (2000) J. Fluid Mech. 422:281 is extended to treat a random fiber matrix satisfying the widely used Carman-Kozeny equation. We show that the solutions are strikingly different depending on whether a) the inclined upper boundary moves or b) the upper boundary is stationary and the horizontal lower boundary moves beneath it. The behavior depends critically on the value of the dimensionless fiber interaction layer thickness α=H/√Kp . In a) the pressure and lift force increase as 2̂ and asymptotically approach a limiting behavior for large values of α since the fluid is pushed forward by the tilt of the upper boundary. In b) the pressure and lift force decay as &-2circ; since the fiber interaction layer thickness decreases and the amount of fluid dragged though the fluid gap decreases as α increases and vanishes for α>> 1.

High order solution of Poisson problems with piecewise constant coefficients and interface jumps

NASA Astrophysics Data System (ADS)

Marques, Alexandre Noll; Nave, Jean-Christophe; Rosales, Rodolfo Ruben

2017-04-01

We present a fast and accurate algorithm to solve Poisson problems in complex geometries, using regular Cartesian grids. We consider a variety of configurations, including Poisson problems with interfaces across which the solution is discontinuous (of the type arising in multi-fluid flows). The algorithm is based on a combination of the Correction Function Method (CFM) and Boundary Integral Methods (BIM). Interface and boundary conditions can be treated in a fast and accurate manner using boundary integral equations, and the associated BIM. Unfortunately, BIM can be costly when the solution is needed everywhere in a grid, e.g. fluid flow problems. We use the CFM to circumvent this issue. The solution from the BIM is used to rewrite the problem as a series of Poisson problems in rectangular domains-which requires the BIM solution at interfaces/boundaries only. These Poisson problems involve discontinuities at interfaces, of the type that the CFM can handle. Hence we use the CFM to solve them (to high order of accuracy) with finite differences and a Fast Fourier Transform based fast Poisson solver. We present 2-D examples of the algorithm applied to Poisson problems involving complex geometries, including cases in which the solution is discontinuous. We show that the algorithm produces solutions that converge with either 3rd or 4th order of accuracy, depending on the type of boundary condition and solution discontinuity.

A visual detection of protein content based on titration of moving reaction boundary electrophoresis.

PubMed

Wang, Hou-Yu; Guo, Cheng-Ye; Guo, Chen-Gang; Fan, Liu-Yin; Zhang, Lei; Cao, Cheng-Xi

2013-04-24

A visual electrophoretic titration method was firstly developed from the concept of moving reaction boundary (MRB) for protein content analysis. In the developed method, when the voltage was applied, the hydroxide ions in the cathodic vessel moved towards the anode, and neutralized the carboxyl groups of protein immobilized via highly cross-linked polyacrylamide gel (PAG), generating a MRB between the alkali and the immobilized protein. The boundary moving velocity (V(MRB)) was as a function of protein content, and an acid-base indicator was used to denote the boundary displacement. As a proof of concept, standard model proteins and biological samples were chosen for the experiments to study the feasibility of the developed method. The experiments revealed that good linear calibration functions between V(MRB) and protein content (correlation coefficients R>0.98). The experiments further demonstrated the following merits of developed method: (1) weak influence of non-protein nitrogen additives (e.g., melamine) adulterated in protein samples, (2) good agreement with the classic Kjeldahl method (R=0.9945), (3) fast measuring speed in total protein analysis of large samples from the same source, and (4) low limit of detection (0.02-0.15 mg mL(-1) for protein content), good precision (R.S.D. of intra-day less than 1.7% and inter-day less than 2.7%), and high recoveries (105-107%). Crown Copyright © 2013. Published by Elsevier B.V. All rights reserved.

Assessment of Mixed-Layer Height Estimation from Single-wavelength Ceilometer Profiles.

PubMed

Knepp, Travis N; Szykman, James J; Long, Russell; Duvall, Rachelle M; Krug, Jonathan; Beaver, Melinda; Cavender, Kevin; Kronmiller, Keith; Wheeler, Michael; Delgado, Ruben; Hoff, Raymond; Berkoff, Timothy; Olson, Erik; Clark, Richard; Wolfe, Daniel; Van Gilst, David; Neil, Doreen

2017-01-01

Differing boundary/mixed-layer height measurement methods were assessed in moderately-polluted and clean environments, with a focus on the Vaisala CL51 ceilometer. This intercomparison was performed as part of ongoing measurements at the Chemistry And Physics of the Atmospheric Boundary Layer Experiment (CAPABLE) site in Hampton, Virginia and during the 2014 Deriving Information on Surface Conditions from Column and Vertically Resolved Observations Relevant to Air Quality (DISCOVER-AQ) field campaign that took place in and around Denver, Colorado. We analyzed CL51 data that were collected via two different methods (BLView software, which applied correction factors, and simple terminal emulation logging) to determine the impact of data collection methodology. Further, we evaluated the STRucture of the ATmosphere (STRAT) algorithm as an open-source alternative to BLView (note that the current work presents an evaluation of the BLView and STRAT algorithms and does not intend to act as a validation of either). Filtering criteria were defined according to the change in mixed-layer height (MLH) distributions for each instrument and algorithm and were applied throughout the analysis to remove high-frequency fluctuations from the MLH retrievals. Of primary interest was determining how the different data-collection methodologies and algorithms compare to each other and to radiosonde-derived boundary-layer heights when deployed as part of a larger instrument network. We determined that data-collection methodology is not as important as the processing algorithm and that much of the algorithm differences might be driven by impacts of local meteorology and precipitation events that pose algorithm difficulties. The results of this study show that a common processing algorithm is necessary for LIght Detection And Ranging (LIDAR)-based MLH intercomparisons, and ceilometer-network operation and that sonde-derived boundary layer heights are higher (10-15% at mid-day) than LIDAR-derived mixed-layer heights. We show that averaging the retrieved MLH to 1-hour resolution (an appropriate time scale for a priori data model initialization) significantly improved correlation between differing instruments and differing algorithms.

A fourth-order Cartesian grid embeddedboundary method for Poisson’s equation

DOE PAGES

Devendran, Dharshi; Graves, Daniel; Johansen, Hans; ...

2017-05-08

In this paper, we present a fourth-order algorithm to solve Poisson's equation in two and three dimensions. We use a Cartesian grid, embedded boundary method to resolve complex boundaries. We use a weighted least squares algorithm to solve for our stencils. We use convergence tests to demonstrate accuracy and we show the eigenvalues of the operator to demonstrate stability. We compare accuracy and performance with an established second-order algorithm. We also discuss in depth strategies for retaining higher-order accuracy in the presence of nonsmooth geometries.

A fourth-order Cartesian grid embeddedboundary method for Poisson’s equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Devendran, Dharshi; Graves, Daniel; Johansen, Hans

In this paper, we present a fourth-order algorithm to solve Poisson's equation in two and three dimensions. We use a Cartesian grid, embedded boundary method to resolve complex boundaries. We use a weighted least squares algorithm to solve for our stencils. We use convergence tests to demonstrate accuracy and we show the eigenvalues of the operator to demonstrate stability. We compare accuracy and performance with an established second-order algorithm. We also discuss in depth strategies for retaining higher-order accuracy in the presence of nonsmooth geometries.

Technique for Chestband Contour Shape-Mapping in Lateral Impact

PubMed Central

Hallman, Jason J; Yoganandan, Narayan; Pintar, Frank A

2011-01-01

The chestband transducer permits noninvasive measurement of transverse plane biomechanical response during blunt thorax impact. Although experiments may reveal complex two-dimensional (2D) deformation response to boundary conditions, biomechanical studies have heretofore employed only uniaxial chestband contour quantifying measurements. The present study described and evaluated an algorithm by which source subject-specific contour data may be systematically mapped to a target generalized anthropometry for computational studies of biomechanical response or anthropomorphic test dummy development. Algorithm performance was evaluated using chestband contour datasets from two rigid lateral impact boundary conditions: Flat wall and anterior-oblique wall. Comparing source and target anthropometry contours, peak deflections and deformation-time traces deviated by less than 4%. These results suggest that the algorithm is appropriate for 2D deformation response to lateral impact boundary conditions. PMID:21676399

Hydrodynamic and Thermal Slip Effect on Double-Diffusive Free Convective Boundary Layer Flow of a Nanofluid Past a Flat Vertical Plate in the Moving Free Stream

PubMed Central

Khan, Waqar A.; Uddin, Md Jashim; Ismail, A. I. Md.

2013-01-01

The effects of hydrodynamic and thermal slip boundary conditions on the double-diffusive free convective flow of a nanofluid along a semi-infinite flat solid vertical plate are investigated numerically. It is assumed that free stream is moving. The governing boundary layer equations are non-dimensionalized and transformed into a system of nonlinear, coupled similarity equations. The effects of the controlling parameters on the dimensionless velocity, temperature, solute and nanofluid concentration as well as on the reduced Nusselt number, reduced Sherwood number and the reduced nanoparticle Sherwood number are investigated and presented graphically. To the best of our knowledge, the effects of hydrodynamic and thermal slip boundary conditions have not been investigated yet. It is found that the reduced local Nusselt, local solute and the local nanofluid Sherwood numbers increase with hydrodynamic slip and decrease with thermal slip parameters. PMID:23533566

Application of the perfectly matched layer in 3-D marine controlled-source electromagnetic modelling

NASA Astrophysics Data System (ADS)

Li, Gang; Li, Yuguo; Han, Bo; Liu, Zhan

2018-01-01

In this study, the complex frequency-shifted perfectly matched layer (CFS-PML) in stretching Cartesian coordinates is successfully applied to 3-D frequency-domain marine controlled-source electromagnetic (CSEM) field modelling. The Dirichlet boundary, which is usually used within the traditional framework of EM modelling algorithms, assumes that the electric or magnetic field values are zero at the boundaries. This requires the boundaries to be sufficiently far away from the area of interest. To mitigate the boundary artefacts, a large modelling area may be necessary even though cell sizes are allowed to grow toward the boundaries due to the diffusion of the electromagnetic wave propagation. Compared with the conventional Dirichlet boundary, the PML boundary is preferred as the modelling area of interest could be restricted to the target region and only a few absorbing layers surrounding can effectively depress the artificial boundary effect without losing the numerical accuracy. Furthermore, for joint inversion of seismic and marine CSEM data, if we use the PML for CSEM field simulation instead of the conventional Dirichlet, the modelling area for these two different geophysical data collected from the same survey area could be the same, which is convenient for joint inversion grid matching. We apply the CFS-PML boundary to 3-D marine CSEM modelling by using the staggered finite-difference discretization. Numerical test indicates that the modelling algorithm using the CFS-PML also shows good accuracy compared to the Dirichlet. Furthermore, the modelling algorithm using the CFS-PML shows advantages in computational time and memory saving than that using the Dirichlet boundary. For the 3-D example in this study, the memory saving using the PML is nearly 42 per cent and the time saving is around 48 per cent compared to using the Dirichlet.

Compressor airfoil tip clearance optimization system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Little, David A.; Pu, Zhengxiang

2015-08-18

A compressor airfoil tip clearance optimization system for reducing a gap between a tip of a compressor airfoil and a radially adjacent component of a turbine engine is disclosed. The turbine engine may include ID and OD flowpath boundaries configured to minimize compressor airfoil tip clearances during turbine engine operation in cooperation with one or more clearance reduction systems that are configured to move the rotor assembly axially to reduce tip clearance. The configurations of the ID and OD flowpath boundaries enhance the effectiveness of the axial movement of the rotor assembly, which includes movement of the ID flowpath boundary.more » During operation of the turbine engine, the rotor assembly may be moved axially to increase the efficiency of the turbine engine.« less

On The Determination of Shadow Boundaries and Relevant Eigenrays For Sound Propagation In Stratified Moving Media

NASA Technical Reports Server (NTRS)

Mcaninch, Gerry L.; Heath, Stephanie L.

2006-01-01

The eiconal and ray equations for a stratified moving medium are analyzed to determine which rays connect a source located at an altitude z = z(sub s) to an observer on the ground plane. The characteristics of all available rays are ascertained. Further, the rays which determine the shadow boundary are found. Thus, the shadow boundary may be easily calculated and any observers for which an eigenray does not exist eliminated from further consideration. Therefore, the analysis may be applied to save computer time in two ways. First, rays that do not reach the ground may be eliminated before they are traced, and observers for which no eigenray exists may be eliminated from consideration.

Techniques and computations for mapping plot clusters that straddle stand boundaries

Treesearch

Charles T. Scott; William A. Bechtold

1995-01-01

Many regional (extensive) forest surveys use clusters of subplots or prism points to reduce survey costs. Two common methods of handling clusters that straddle stand boundaries entail: (1) moving all subplots into a single forest cover type, or (2)"averaging" data across multiple conditions without regard to the boundaries. these methods result in biased...

Respiration-rate estimation of a moving target using impulse-based ultra wideband radars.

PubMed

Sharafi, Azadeh; Baboli, Mehran; Eshghi, Mohammad; Ahmadian, Alireza

2012-03-01

Recently, Ultra-wide band signals have become attractive for their particular advantage of having high spatial resolution and good penetration ability which makes them suitable in medical applications. One of these applications is wireless detection of heart rate and respiration rate. Two hypothesis of static environment and fixed patient are considered in the method presented in previous literatures which are not valid for long term monitoring of ambulant patients. In this article, a new method to detect the respiration rate of a moving target is presented. The first algorithm is applied to the simulated and experimental data for detecting respiration rate of a fixed target. Then, the second algorithm is developed to detect respiration rate of a moving target. The proposed algorithm uses correlation for body movement cancellation, and then detects the respiration rate based on energy in frequency domain. The results of algorithm prove an accuracy of 98.4 and 97% in simulated and experimental data, respectively.

Metaheuristic optimisation methods for approximate solving of singular boundary value problems

NASA Astrophysics Data System (ADS)

Sadollah, Ali; Yadav, Neha; Gao, Kaizhou; Su, Rong

2017-07-01

This paper presents a novel approximation technique based on metaheuristics and weighted residual function (WRF) for tackling singular boundary value problems (BVPs) arising in engineering and science. With the aid of certain fundamental concepts of mathematics, Fourier series expansion, and metaheuristic optimisation algorithms, singular BVPs can be approximated as an optimisation problem with boundary conditions as constraints. The target is to minimise the WRF (i.e. error function) constructed in approximation of BVPs. The scheme involves generational distance metric for quality evaluation of the approximate solutions against exact solutions (i.e. error evaluator metric). Four test problems including two linear and two non-linear singular BVPs are considered in this paper to check the efficiency and accuracy of the proposed algorithm. The optimisation task is performed using three different optimisers including the particle swarm optimisation, the water cycle algorithm, and the harmony search algorithm. Optimisation results obtained show that the suggested technique can be successfully applied for approximate solving of singular BVPs.

Text extraction via an edge-bounded averaging and a parametric character model

NASA Astrophysics Data System (ADS)

Fan, Jian

2003-01-01

We present a deterministic text extraction algorithm that relies on three basic assumptions: color/luminance uniformity of the interior region, closed boundaries of sharp edges and the consistency of local contrast. The algorithm is basically independent of the character alphabet, text layout, font size and orientation. The heart of this algorithm is an edge-bounded averaging for the classification of smooth regions that enhances robustness against noise without sacrificing boundary accuracy. We have also developed a verification process to clean up the residue of incoherent segmentation. Our framework provides a symmetric treatment for both regular and inverse text. We have proposed three heuristics for identifying the type of text from a cluster consisting of two types of pixel aggregates. Finally, we have demonstrated the advantages of the proposed algorithm over adaptive thresholding and block-based clustering methods in terms of boundary accuracy, segmentation coherency, and capability to identify inverse text and separate characters from background patches.

Distilling the Verification Process for Prognostics Algorithms

NASA Technical Reports Server (NTRS)

Roychoudhury, Indranil; Saxena, Abhinav; Celaya, Jose R.; Goebel, Kai

2013-01-01

The goal of prognostics and health management (PHM) systems is to ensure system safety, and reduce downtime and maintenance costs. It is important that a PHM system is verified and validated before it can be successfully deployed. Prognostics algorithms are integral parts of PHM systems. This paper investigates a systematic process of verification of such prognostics algorithms. To this end, first, this paper distinguishes between technology maturation and product development. Then, the paper describes the verification process for a prognostics algorithm as it moves up to higher maturity levels. This process is shown to be an iterative process where verification activities are interleaved with validation activities at each maturation level. In this work, we adopt the concept of technology readiness levels (TRLs) to represent the different maturity levels of a prognostics algorithm. It is shown that at each TRL, the verification of a prognostics algorithm depends on verifying the different components of the algorithm according to the requirements laid out by the PHM system that adopts this prognostics algorithm. Finally, using simplified examples, the systematic process for verifying a prognostics algorithm is demonstrated as the prognostics algorithm moves up TRLs.

Dynamic-MLC leaf control utilizing on-flight intensity calculations: a robust method for real-time IMRT delivery over moving rigid targets.

PubMed

McMahon, Ryan; Papiez, Lech; Rangaraj, Dharanipathy

2007-08-01

An algorithm is presented that allows for the control of multileaf collimation (MLC) leaves based entirely on real-time calculations of the intensity delivered over the target. The algorithm is capable of efficiently correcting generalized delivery errors without requiring the interruption of delivery (self-correcting trajectories), where a generalized delivery error represents anything that causes a discrepancy between the delivered and intended intensity profiles. The intensity actually delivered over the target is continually compared to its intended value. For each pair of leaves, these comparisons are used to guide the control of the following leaf and keep this discrepancy below a user-specified value. To demonstrate the basic principles of the algorithm, results of corrected delivery are shown for a leading leaf positional error during dynamic-MLC (DMLC) IMRT delivery over a rigid moving target. It is then shown that, with slight modifications, the algorithm can be used to track moving targets in real time. The primary results of this article indicate that the algorithm is capable of accurately delivering DMLC IMRT over a rigid moving target whose motion is (1) completely unknown prior to delivery and (2) not faster than the maximum MLC leaf velocity over extended periods of time. These capabilities are demonstrated for clinically derived intensity profiles and actual tumor motion data, including situations when the target moves in some instances faster than the maximum admissible MLC leaf velocity. The results show that using the algorithm while calculating the delivered intensity every 50 ms will provide a good level of accuracy when delivering IMRT over a rigid moving target translating along the direction of MLC leaf travel. When the maximum velocities of the MLC leaves and target were 4 and 4.2 cm/s, respectively, the resulting error in the two intensity profiles used was 0.1 +/- 3.1% and -0.5 +/- 2.8% relative to the maximum of the intensity profiles. For the same target motion, the error was shown to increase rapidly as (1) the maximum MLC leaf velocity was reduced below 75% of the maximum target velocity and (2) the system response time was increased.

[Motion control of moving mirror based on fixed-mirror adjustment in FTIR spectrometer].

PubMed

Li, Zhong-bing; Xu, Xian-ze; Le, Yi; Xu, Feng-qiu; Li, Jun-wei

2012-08-01

The performance of the uniform motion of the moving mirror, which is the only constant motion part in FTIR spectrometer, and the performance of the alignment of the fixed mirror play a key role in FTIR spectrometer, and affect the interference effect and the quality of the spectrogram and may restrict the precision and resolution of the instrument directly. The present article focuses on the research on the uniform motion of the moving mirror and the alignment of the fixed mirror. In order to improve the FTIR spectrometer, the maglev support system was designed for the moving mirror and the phase detection technology was adopted to adjust the tilt angle between the moving mirror and the fixed mirror. This paper also introduces an improved fuzzy PID control algorithm to get the accurate speed of the moving mirror and realize the control strategy from both hardware design and algorithm. The results show that the development of the moving mirror motion control system gets sufficient accuracy and real-time, which can ensure the uniform motion of the moving mirror and the alignment of the fixed mirror.

Automated boundary detection of the optic disc and layer segmentation of the peripapillary retina in volumetric structural and angiographic optical coherence tomography.

PubMed

Zang, Pengxiao; Gao, Simon S; Hwang, Thomas S; Flaxel, Christina J; Wilson, David J; Morrison, John C; Huang, David; Li, Dengwang; Jia, Yali

2017-03-01

To improve optic disc boundary detection and peripapillary retinal layer segmentation, we propose an automated approach for structural and angiographic optical coherence tomography. The algorithm was performed on radial cross-sectional B-scans. The disc boundary was detected by searching for the position of Bruch's membrane opening, and retinal layer boundaries were detected using a dynamic programming-based graph search algorithm on each B-scan without the disc region. A comparison of the disc boundary using our method with that determined by manual delineation showed good accuracy, with an average Dice similarity coefficient ≥0.90 in healthy eyes and eyes with diabetic retinopathy and glaucoma. The layer segmentation accuracy in the same cases was on average less than one pixel (3.13 μm).

Automated boundary detection of the optic disc and layer segmentation of the peripapillary retina in volumetric structural and angiographic optical coherence tomography

PubMed Central

Zang, Pengxiao; Gao, Simon S.; Hwang, Thomas S.; Flaxel, Christina J.; Wilson, David J.; Morrison, John C.; Huang, David; Li, Dengwang; Jia, Yali

2017-01-01

To improve optic disc boundary detection and peripapillary retinal layer segmentation, we propose an automated approach for structural and angiographic optical coherence tomography. The algorithm was performed on radial cross-sectional B-scans. The disc boundary was detected by searching for the position of Bruch’s membrane opening, and retinal layer boundaries were detected using a dynamic programming-based graph search algorithm on each B-scan without the disc region. A comparison of the disc boundary using our method with that determined by manual delineation showed good accuracy, with an average Dice similarity coefficient ≥0.90 in healthy eyes and eyes with diabetic retinopathy and glaucoma. The layer segmentation accuracy in the same cases was on average less than one pixel (3.13 μm). PMID:28663830

Cubic spline anchored grid pattern algorithm for high-resolution detection of subsurface cavities by the IR-CAT method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kassab, A.J.; Pollard, J.E.

An algorithm is presented for the high-resolution detection of irregular-shaped subsurface cavities within irregular-shaped bodies by the IR-CAT method. The theoretical basis of the algorithm is rooted in the solution of an inverse geometric steady-state heat conduction problem. A Cauchy boundary condition is prescribed at the exposed surface, and the inverse geometric heat conduction problem is formulated by specifying the thermal condition at the inner cavities walls, whose unknown geometries are to be detected. The location of the inner cavities is initially estimated, and the domain boundaries are discretized. Linear boundary elements are used in conjunction with cubic splines formore » high resolution of the cavity walls. An anchored grid pattern (AGP) is established to constrain the cubic spline knots that control the inner cavity geometry to evolve along the AGP at each iterative step. A residual is defined measuring the difference between imposed and computed boundary conditions. A Newton-Raphson method with a Broyden update is used to automate the detection of inner cavity walls. During the iterative procedure, the movement of the inner cavity walls is restricted to physically realistic intermediate solutions. Numerical simulation demonstrates the superior resolution of the cubic spline AGP algorithm over the linear spline-based AGP in the detection of an irregular-shaped cavity. Numerical simulation is also used to test the sensitivity of the linear and cubic spline AGP algorithms by simulating bias and random error in measured surface temperature. The proposed AGP algorithm is shown to satisfactorily detect cavities with these simulated data.« less

Detection and tracking of a moving target using SAR images with the particle filter-based track-before-detect algorithm.

PubMed

Gao, Han; Li, Jingwen

2014-06-19

A novel approach to detecting and tracking a moving target using synthetic aperture radar (SAR) images is proposed in this paper. Achieved with the particle filter (PF) based track-before-detect (TBD) algorithm, the approach is capable of detecting and tracking the low signal-to-noise ratio (SNR) moving target with SAR systems, which the traditional track-after-detect (TAD) approach is inadequate for. By incorporating the signal model of the SAR moving target into the algorithm, the ambiguity in target azimuth position and radial velocity is resolved while tracking, which leads directly to the true estimation. With the sub-area substituted for the whole area to calculate the likelihood ratio and a pertinent choice of the number of particles, the computational efficiency is improved with little loss in the detection and tracking performance. The feasibility of the approach is validated and the performance is evaluated with Monte Carlo trials. It is demonstrated that the proposed approach is capable to detect and track a moving target with SNR as low as 7 dB, and outperforms the traditional TAD approach when the SNR is below 14 dB.

Detection and Tracking of a Moving Target Using SAR Images with the Particle Filter-Based Track-Before-Detect Algorithm

PubMed Central

Gao, Han; Li, Jingwen

2014-01-01

A novel approach to detecting and tracking a moving target using synthetic aperture radar (SAR) images is proposed in this paper. Achieved with the particle filter (PF) based track-before-detect (TBD) algorithm, the approach is capable of detecting and tracking the low signal-to-noise ratio (SNR) moving target with SAR systems, which the traditional track-after-detect (TAD) approach is inadequate for. By incorporating the signal model of the SAR moving target into the algorithm, the ambiguity in target azimuth position and radial velocity is resolved while tracking, which leads directly to the true estimation. With the sub-area substituted for the whole area to calculate the likelihood ratio and a pertinent choice of the number of particles, the computational efficiency is improved with little loss in the detection and tracking performance. The feasibility of the approach is validated and the performance is evaluated with Monte Carlo trials. It is demonstrated that the proposed approach is capable to detect and track a moving target with SNR as low as 7 dB, and outperforms the traditional TAD approach when the SNR is below 14 dB. PMID:24949640

Fronts propagating with curvature dependent speed: Algorithms based on Hamilton-Jacobi formulations

NASA Technical Reports Server (NTRS)

Osher, Stanley; Sethian, James A.

1987-01-01

New numerical algorithms are devised (PSC algorithms) for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, which resemble Hamilton-Jacobi equations with parabolic right-hand-sides, by using techniques from the hyperbolic conservation laws. Non-oscillatory schemes of various orders of accuracy are used to solve the equations, providing methods that accurately capture the formation of sharp gradients and cusps in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be used also for more general Hamilton-Jacobi-type problems. The algorithms are demonstrated by computing the solution to a variety of surface motion problems.

Collective translational and rotational Monte Carlo cluster move for general pairwise interaction

NASA Astrophysics Data System (ADS)

Růžička, Štěpán; Allen, Michael P.

2014-09-01

Virtual move Monte Carlo is a cluster algorithm which was originally developed for strongly attractive colloidal, molecular, or atomistic systems in order to both approximate the collective dynamics and avoid sampling of unphysical kinetic traps. In this paper, we present the algorithm in the form, which selects the moving cluster through a wider class of virtual states and which is applicable to general pairwise interactions, including hard-core repulsion. The newly proposed way of selecting the cluster increases the acceptance probability by up to several orders of magnitude, especially for rotational moves. The results have their applications in simulations of systems interacting via anisotropic potentials both to enhance the sampling of the phase space and to approximate the dynamics.

Pulsation Detection from Noisy Ultrasound-Echo Moving Images of Newborn Baby Head Using Fourier Transform

NASA Astrophysics Data System (ADS)

Yamada, Masayoshi; Fukuzawa, Masayuki; Kitsunezuka, Yoshiki; Kishida, Jun; Nakamori, Nobuyuki; Kanamori, Hitoshi; Sakurai, Takashi; Kodama, Souichi

1995-05-01

In order to detect pulsation from a series of noisy ultrasound-echo moving images of a newborn baby's head for pediatric diagnosis, a digital image processing system capable of recording at the video rate and processing the recorded series of images was constructed. The time-sequence variations of each pixel value in a series of moving images were analyzed and then an algorithm based on Fourier transform was developed for the pulsation detection, noting that the pulsation associated with blood flow was periodically changed by heartbeat. Pulsation detection for pediatric diagnosis was successfully made from a series of noisy ultrasound-echo moving images of newborn baby's head by using the image processing system and the pulsation detection algorithm developed here.

Dynamic boundary layer based neural network quasi-sliding mode control for soft touching down on asteroid

NASA Astrophysics Data System (ADS)

Liu, Xiaosong; Shan, Zebiao; Li, Yuanchun

2017-04-01

Pinpoint landing is a critical step in some asteroid exploring missions. This paper is concerned with the descent trajectory control for soft touching down on a small irregularly-shaped asteroid. A dynamic boundary layer based neural network quasi-sliding mode control law is proposed to track a desired descending path. The asteroid's gravitational acceleration acting on the spacecraft is described by the polyhedron method. Considering the presence of input constraint and unmodeled acceleration, the dynamic equation of relative motion is presented first. The desired descending path is planned using cubic polynomial method, and a collision detection algorithm is designed. To perform trajectory tracking, a neural network sliding mode control law is given first, where the sliding mode control is used to ensure the convergence of system states. Two radial basis function neural networks (RBFNNs) are respectively used as an approximator for the unmodeled term and a compensator for the difference between the actual control input with magnitude constraint and nominal control. To improve the chattering induced by the traditional sliding mode control and guarantee the reachability of the system, a specific saturation function with dynamic boundary layer is proposed to replace the sign function in the preceding control law. Through the Lyapunov approach, the reachability condition of the control system is given. The improved control law can guarantee the system state move within a gradually shrinking quasi-sliding mode band. Numerical simulation results demonstrate the effectiveness of the proposed control strategy.

Lane detection using Randomized Hough Transform

NASA Astrophysics Data System (ADS)

Mongkonyong, Peerawat; Nuthong, Chaiwat; Siddhichai, Supakorn; Yamakita, Masaki

2018-01-01

According to the report of the Royal Thai Police between 2006 and 2015, lane changing without consciousness is one of the most accident causes. To solve this problem, many methods are considered. Lane Departure Warning System (LDWS) is considered to be one of the potential solutions. LDWS is a mechanism designed to warn the driver when the vehicle begins to move out of its current lane. LDWS contains many parts including lane boundary detection, driver warning and lane marker tracking. This article focuses on the lane boundary detection part. The proposed lane boundary detection detects the lines of the image from the input video and selects the lane marker of the road surface from those lines. Standard Hough Transform (SHT) and Randomized Hough Transform (RHT) are considered in this article. They are used to extract lines of an image. SHT extracts the lines from all of the edge pixels. RHT extracts only the lines randomly picked by the point pairs from edge pixels. RHT algorithm reduces the time and memory usage when compared with SHT. The increase of the threshold value in RHT will increase the voted limit of the line that has a high possibility to be the lane marker, but it also consumes the time and memory. By comparison between SHT and RHT with the different threshold values, 500 frames of input video from the front car camera will be processed. The accuracy and the computational time of RHT are similar to those of SHT in the result of the comparison.

Unweighted least squares phase unwrapping by means of multigrid techniques

NASA Astrophysics Data System (ADS)

Pritt, Mark D.

1995-11-01

We present a multigrid algorithm for unweighted least squares phase unwrapping. This algorithm applies Gauss-Seidel relaxation schemes to solve the Poisson equation on smaller, coarser grids and transfers the intermediate results to the finer grids. This approach forms the basis of our multigrid algorithm for weighted least squares phase unwrapping, which is described in a separate paper. The key idea of our multigrid approach is to maintain the partial derivatives of the phase data in separate arrays and to correct these derivatives at the boundaries of the coarser grids. This maintains the boundary conditions necessary for rapid convergence to the correct solution. Although the multigrid algorithm is an iterative algorithm, we demonstrate that it is nearly as fast as the direct Fourier-based method. We also describe how to parallelize the algorithm for execution on a distributed-memory parallel processor computer or a network-cluster of workstations.

Numerical study of steady dissipative mixed convection optically-thick micropolar flow with thermal radiation effects

NASA Astrophysics Data System (ADS)

Gupta, Diksha; Kumar, Lokendra; Bég, O. Anwar; Singh, Bani

2017-10-01

The objective of this paper is to study theoretically and numerically the effect of thermal radiation on mixed convection boundary layer flow of a dissipative micropolar non-Newtonian fluid from a continuously moving vertical porous sheet. The governing partial differential equations are transformed into a set of non-linear differential equations by using similarity transformations. These equations are solved iteratively with the Bellman-Kalaba quasi-linearization algorithm. This method converges quadratically and the solution is valid for a large range of parameters. The effects of transpiration (suction or injection) parameter, buoyancy parameter, radiation parameter and Eckert number on velocity, microrotation and temperature functions have been studied. Under a special case comparison of the present numerical results is made with the results available in the literature and an excellent agreement is found. Additionally skin friction and rate of heat transfer have also been computed. The study has applications in polymer processing.

YORP torques with 1D thermal model

NASA Astrophysics Data System (ADS)

Breiter, S.; Bartczak, P.; Czekaj, M.

2010-11-01

A numerical model of the Yarkovsky-O'Keefe-Radzievskii-Paddack (YORP) effect for objects defined in terms of a triangular mesh is described. The algorithm requires that each surface triangle can be handled independently, which implies the use of a 1D thermal model. Insolation of each triangle is determined by an optimized ray-triangle intersection search. Surface temperature is modelled with a spectral approach; imposing a quasi-periodic solution we replace heat conduction equation by the Helmholtz equation. Non-linear boundary conditions are handled by an iterative, fast Fourier transform based solver. The results resolve the question of the YORP effect in rotation rate independence on conductivity within the non-linear 1D thermal model regardless of the accuracy issues and homogeneity assumptions. A seasonal YORP effect in attitude is revealed for objects moving on elliptic orbits when a non-linear thermal model is used.

Incompressible viscous flow computations for the pump components and the artificial heart

NASA Technical Reports Server (NTRS)

Kiris, Cetin

1992-01-01

A finite-difference, three-dimensional incompressible Navier-Stokes formulation to calculate the flow through turbopump components is utilized. The solution method is based on the pseudocompressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. Both steady and unsteady flow calculations can be performed using the current algorithm. In this work, the equations are solved in steadily rotating reference frames by using the steady-state formulation in order to simulate the flow through a turbopump inducer. Eddy viscosity is computed by using an algebraic mixing-length turbulence model. Numerical results are compared with experimental measurements and a good agreement is found between the two. Included in the appendix is a paper on incompressible viscous flow through artificial heart devices with moving boundaries. Time-accurate calculations, such as impeller and diffusor interaction, will be reported in future work.

Convergence issues in domain decomposition parallel computation of hovering rotor

NASA Astrophysics Data System (ADS)

Xiao, Zhongyun; Liu, Gang; Mou, Bin; Jiang, Xiong

2018-05-01

Implicit LU-SGS time integration algorithm has been widely used in parallel computation in spite of its lack of information from adjacent domains. When applied to parallel computation of hovering rotor flows in a rotating frame, it brings about convergence issues. To remedy the problem, three LU factorization-based implicit schemes (consisting of LU-SGS, DP-LUR and HLU-SGS) are investigated comparatively. A test case of pure grid rotation is designed to verify these algorithms, which show that LU-SGS algorithm introduces errors on boundary cells. When partition boundaries are circumferential, errors arise in proportion to grid speed, accumulating along with the rotation, and leading to computational failure in the end. Meanwhile, DP-LUR and HLU-SGS methods show good convergence owing to boundary treatment which are desirable in domain decomposition parallel computations.

A level-set method for two-phase flows with moving contact line and insoluble surfactant

NASA Astrophysics Data System (ADS)

Xu, Jian-Jun; Ren, Weiqing

2014-04-01

A level-set method for two-phase flows with moving contact line and insoluble surfactant is presented. The mathematical model consists of the Navier-Stokes equation for the flow field, a convection-diffusion equation for the surfactant concentration, together with the Navier boundary condition and a condition for the dynamic contact angle derived by Ren et al. (2010) [37]. The numerical method is based on the level-set continuum surface force method for two-phase flows with surfactant developed by Xu et al. (2012) [54] with some cautious treatment for the boundary conditions. The numerical method consists of three components: a flow solver for the velocity field, a solver for the surfactant concentration, and a solver for the level-set function. In the flow solver, the surface force is dealt with using the continuum surface force model. The unbalanced Young stress at the moving contact line is incorporated into the Navier boundary condition. A convergence study of the numerical method and a parametric study are presented. The influence of surfactant on the dynamics of the moving contact line is illustrated using examples. The capability of the level-set method to handle complex geometries is demonstrated by simulating a pendant drop detaching from a wall under gravity.

Automated Development of Accurate Algorithms and Efficient Codes for Computational Aeroacoustics

NASA Technical Reports Server (NTRS)

Goodrich, John W.; Dyson, Rodger W.

1999-01-01

The simulation of sound generation and propagation in three space dimensions with realistic aircraft components is a very large time dependent computation with fine details. Simulations in open domains with embedded objects require accurate and robust algorithms for propagation, for artificial inflow and outflow boundaries, and for the definition of geometrically complex objects. The development, implementation, and validation of methods for solving these demanding problems is being done to support the NASA pillar goals for reducing aircraft noise levels. Our goal is to provide algorithms which are sufficiently accurate and efficient to produce usable results rapidly enough to allow design engineers to study the effects on sound levels of design changes in propulsion systems, and in the integration of propulsion systems with airframes. There is a lack of design tools for these purposes at this time. Our technical approach to this problem combines the development of new, algorithms with the use of Mathematica and Unix utilities to automate the algorithm development, code implementation, and validation. We use explicit methods to ensure effective implementation by domain decomposition for SPMD parallel computing. There are several orders of magnitude difference in the computational efficiencies of the algorithms which we have considered. We currently have new artificial inflow and outflow boundary conditions that are stable, accurate, and unobtrusive, with implementations that match the accuracy and efficiency of the propagation methods. The artificial numerical boundary treatments have been proven to have solutions which converge to the full open domain problems, so that the error from the boundary treatments can be driven as low as is required. The purpose of this paper is to briefly present a method for developing highly accurate algorithms for computational aeroacoustics, the use of computer automation in this process, and a brief survey of the algorithms that have resulted from this work. A review of computational aeroacoustics has recently been given by Lele.

A three-dimensional polyhedral unit model for grain boundary structure in fcc metals

NASA Astrophysics Data System (ADS)

Banadaki, Arash Dehghan; Patala, Srikanth

2017-03-01

One of the biggest challenges in developing truly bottom-up models for the performance of polycrystalline materials is the lack of robust quantitative structure-property relationships for interfaces. As a first step in analyzing such relationships, we present a polyhedral unit model to classify the geometrical nature of atomic packing along grain boundaries. While the atomic structure in disordered systems has been a topic of interest for many decades, geometrical analyses of grain boundaries has proven to be particularly challenging because of the wide range of structures that are possible depending on the underlying macroscopic crystallographic character. In this article, we propose an algorithm that can partition the atomic structure into a connected array of three-dimensional polyhedra, and thus, present a three-dimensional polyhedral unit model for grain boundaries. A point-pattern matching algorithm is also provided for quantifying the distortions of the observed grain boundary polyhedral units. The polyhedral unit model is robust enough to capture the structure of high-Σ, mixed character interfaces and, hence, provides a geometric tool for comparing grain boundary structures across the five-parameter crystallographic phase-space. Since the obtained polyhedral units circumscribe the voids present in the structure, such a description provides valuable information concerning segregation sites within the grain boundary. We anticipate that this technique will serve as a powerful tool in the analysis of grain boundary structure. The polyhedral unit model is also applicable to a wide array of material systems as the proposed algorithm is not limited by the underlying lattice structure.

An Immersed Boundary Method for Solving the Compressible Navier-Stokes Equations with Fluid Structure Interaction

NASA Technical Reports Server (NTRS)

Brehm, Christoph; Barad, Michael F.; Kiris, Cetin C.

2016-01-01

An immersed boundary method for the compressible Navier-Stokes equation and the additional infrastructure that is needed to solve moving boundary problems and fully coupled fluid-structure interaction is described. All the methods described in this paper were implemented in NASA's LAVA solver framework. The underlying immersed boundary method is based on the locally stabilized immersed boundary method that was previously introduced by the authors. In the present paper this method is extended to account for all aspects that are involved for fluid structure interaction simulations, such as fast geometry queries and stencil computations, the treatment of freshly cleared cells, and the coupling of the computational fluid dynamics solver with a linear structural finite element method. The current approach is validated for moving boundary problems with prescribed body motion and fully coupled fluid structure interaction problems in 2D and 3D. As part of the validation procedure, results from the second AIAA aeroelastic prediction workshop are also presented. The current paper is regarded as a proof of concept study, while more advanced methods for fluid structure interaction are currently being investigated, such as geometric and material nonlinearities, and advanced coupling approaches.

A Two-Phase Coverage-Enhancing Algorithm for Hybrid Wireless Sensor Networks.

PubMed

Zhang, Qingguo; Fok, Mable P

2017-01-09

Providing field coverage is a key task in many sensor network applications. In certain scenarios, the sensor field may have coverage holes due to random initial deployment of sensors; thus, the desired level of coverage cannot be achieved. A hybrid wireless sensor network is a cost-effective solution to this problem, which is achieved by repositioning a portion of the mobile sensors in the network to meet the network coverage requirement. This paper investigates how to redeploy mobile sensor nodes to improve network coverage in hybrid wireless sensor networks. We propose a two-phase coverage-enhancing algorithm for hybrid wireless sensor networks. In phase one, we use a differential evolution algorithm to compute the candidate's target positions in the mobile sensor nodes that could potentially improve coverage. In the second phase, we use an optimization scheme on the candidate's target positions calculated from phase one to reduce the accumulated potential moving distance of mobile sensors, such that the exact mobile sensor nodes that need to be moved as well as their final target positions can be determined. Experimental results show that the proposed algorithm provided significant improvement in terms of area coverage rate, average moving distance, area coverage-distance rate and the number of moved mobile sensors, when compare with other approaches.

A Two-Phase Coverage-Enhancing Algorithm for Hybrid Wireless Sensor Networks

PubMed Central

Zhang, Qingguo; Fok, Mable P.

2017-01-01

Providing field coverage is a key task in many sensor network applications. In certain scenarios, the sensor field may have coverage holes due to random initial deployment of sensors; thus, the desired level of coverage cannot be achieved. A hybrid wireless sensor network is a cost-effective solution to this problem, which is achieved by repositioning a portion of the mobile sensors in the network to meet the network coverage requirement. This paper investigates how to redeploy mobile sensor nodes to improve network coverage in hybrid wireless sensor networks. We propose a two-phase coverage-enhancing algorithm for hybrid wireless sensor networks. In phase one, we use a differential evolution algorithm to compute the candidate’s target positions in the mobile sensor nodes that could potentially improve coverage. In the second phase, we use an optimization scheme on the candidate’s target positions calculated from phase one to reduce the accumulated potential moving distance of mobile sensors, such that the exact mobile sensor nodes that need to be moved as well as their final target positions can be determined. Experimental results show that the proposed algorithm provided significant improvement in terms of area coverage rate, average moving distance, area coverage–distance rate and the number of moved mobile sensors, when compare with other approaches. PMID:28075365

Distribution majorization of corner points by reinforcement learning for moving object detection

NASA Astrophysics Data System (ADS)

Wu, Hao; Yu, Hao; Zhou, Dongxiang; Cheng, Yongqiang

2018-04-01

Corner points play an important role in moving object detection, especially in the case of free-moving camera. Corner points provide more accurate information than other pixels and reduce the computation which is unnecessary. Previous works only use intensity information to locate the corner points, however, the information that former and the last frames provided also can be used. We utilize the information to focus on more valuable area and ignore the invaluable area. The proposed algorithm is based on reinforcement learning, which regards the detection of corner points as a Markov process. In the Markov model, the video to be detected is regarded as environment, the selections of blocks for one corner point are regarded as actions and the performance of detection is regarded as state. Corner points are assigned to be the blocks which are seperated from original whole image. Experimentally, we select a conventional method which uses marching and Random Sample Consensus algorithm to obtain objects as the main framework and utilize our algorithm to improve the result. The comparison between the conventional method and the same one with our algorithm show that our algorithm reduce 70% of the false detection.

Segmentation of hand radiographs using fast marching methods

NASA Astrophysics Data System (ADS)

Chen, Hong; Novak, Carol L.

2006-03-01

Rheumatoid Arthritis is one of the most common chronic diseases. Joint space width in hand radiographs is evaluated to assess joint damage in order to monitor progression of disease and response to treatment. Manual measurement of joint space width is time-consuming and highly prone to inter- and intra-observer variation. We propose a method for automatic extraction of finger bone boundaries using fast marching methods for quantitative evaluation of joint space width. The proposed algorithm includes two stages: location of hand joints followed by extraction of bone boundaries. By setting the propagation speed of the wave front as a function of image intensity values, the fast marching algorithm extracts the skeleton of the hands, in which each branch corresponds to a finger. The finger joint locations are then determined by using the image gradients along the skeletal branches. In order to extract bone boundaries at joints, the gradient magnitudes are utilized for setting the propagation speed, and the gradient phases are used for discriminating the boundaries of adjacent bones. The bone boundaries are detected by searching for the fastest paths from one side of each joint to the other side. Finally, joint space width is computed based on the extracted upper and lower bone boundaries. The algorithm was evaluated on a test set of 8 two-hand radiographs, including images from healthy patients and from patients suffering from arthritis, gout and psoriasis. Using our method, 97% of 208 joints were accurately located and 89% of 416 bone boundaries were correctly extracted.

Decentralized control algorithms of a group of vehicles in 2D space

NASA Astrophysics Data System (ADS)

Pshikhopov, V. K.; Medvedev, M. Y.; Fedorenko, R. V.; Gurenko, B. V.

2017-02-01

The problem of decentralized control of group of robots, described by kinematic and dynamic equations of motion in the plane, is considered. Group performs predetermined rectangular area passing at a fixed speed, keeping the line and a uniform distribution. The environment may contain a priori unknown moving or stationary obstacles. Decentralized control algorithms, based on the formation of repellers in the state space of robots, are proposed. These repellers form repulsive forces generated by dynamic subsystems that extend the state space of robots. These repulsive forces are dynamic functions of distances and velocities of robots in the area of operation of the group. The process of formation of repellers allows to take into account the dynamic properties of robots, such as the maximum speed and acceleration. The robots local control law formulas are derived based on positionally-trajectory control method, which allows to operate with non-linear models. Lyapunov function in the form of a quadratic function of the state variables is constructed to obtain a nonlinear closed-loop control system. Due to the fact that a closed system is decomposed into two independent subsystems Lyapunov function is also constructed as two independent functions. Numerical simulation of the motion of a group of five robots is presented. In this simulation obstacles are presented by the boundaries of working area and a movable object of a given radius, moving rectilinear and uniform. Obstacle speed is comparable to the speeds of the robots in a group. The advantage of the proposed method is ensuring the stability of the trajectories and consideration of the limitations on the speed and acceleration at the trajectory planning stage. Proposed approach can be used for more general robots' models, including robots in the three-dimensional environment.

Phase separation in the six-vertex model with a variety of boundary conditions

NASA Astrophysics Data System (ADS)

Lyberg, I.; Korepin, V.; Ribeiro, G. A. P.; Viti, J.

2018-05-01

We present numerical results for the six-vertex model with a variety of boundary conditions. Adapting an algorithm for domain wall boundary conditions, proposed in the work of Allison and Reshetikhin [Ann. Inst. Fourier 55(6), 1847-1869 (2005)], we examine some modifications of these boundary conditions. To be precise, we discuss partial domain wall boundary conditions, reflecting ends, and half turn boundary conditions (domain wall boundary conditions with half turn symmetry). Dedicated to the memory of Ludwig Faddeev

A parallel simulated annealing algorithm for standard cell placement on a hypercube computer

NASA Technical Reports Server (NTRS)

Jones, Mark Howard

1987-01-01

A parallel version of a simulated annealing algorithm is presented which is targeted to run on a hypercube computer. A strategy for mapping the cells in a two dimensional area of a chip onto processors in an n-dimensional hypercube is proposed such that both small and large distance moves can be applied. Two types of moves are allowed: cell exchanges and cell displacements. The computation of the cost function in parallel among all the processors in the hypercube is described along with a distributed data structure that needs to be stored in the hypercube to support parallel cost evaluation. A novel tree broadcasting strategy is used extensively in the algorithm for updating cell locations in the parallel environment. Studies on the performance of the algorithm on example industrial circuits show that it is faster and gives better final placement results than the uniprocessor simulated annealing algorithms. An improved uniprocessor algorithm is proposed which is based on the improved results obtained from parallelization of the simulated annealing algorithm.

Vibration analysis of beams traversed by uniform partially distributed moving masses

NASA Astrophysics Data System (ADS)

Esmailzadeh, E.; Ghorashi, M.

1995-07-01

An investigation into the dynamic behavior of beams with simply supported boundary conditions, carrying either uniform partially distributed moving masses or forces, has been carried out. The present analysis in its general form may well be applied to beams with various boundary conditions. However, the results from the computer simulation model given in this paper are for beams with simply supported end conditions. Results from the numerical solutions of the differential equations of motion are shown graphically and their close agreement, in some extreme cases, with those published previously by the authors is demonstrated. It is shown that the inertial effect of the moving mass is of importance in the dynamic behavior of such structures. Moreover, when considering the maximum deflection for the mid-span of the beam, the critical speeds of the moving load have been evaluated. It is also verified that the length of the distributed moving mass affects the dynamic response considerably. These effects are shown to be of significant practical importance when designing beam-type structures such as long suspension and railway bridges.

Synthetic aperture radar image formation for the moving-target and near-field bistatic cases

NASA Astrophysics Data System (ADS)

Ding, Yu

This dissertation addresses topics in two areas of synthetic aperture radar (SAR) image formation: time-frequency based SAR imaging of moving targets and a fast backprojection (BP) algorithm for near-field bistatic SAR imaging. SAR imaging of a moving target is a challenging task due to unknown motion of the target. We approach this problem in a theoretical way, by analyzing the Wigner-Ville distribution (WVD) based SAR imaging technique. We derive approximate closed-form expressions for the point-target response of the SAR imaging system, which quantify the image resolution, and show how the blurring in conventional SAR imaging can be eliminated, while the target shift still remains. Our analyses lead to accurate prediction of the target position in the reconstructed images. The derived expressions also enable us to further study additional aspects of WVD-based SAR imaging. Bistatic SAR imaging is more involved than the monostatic SAR case, because of the separation of the transmitter and the receiver, and possibly the changing bistatic geometry. For near-field bistatic SAR imaging, we develop a novel fast BP algorithm, motivated by a newly proposed fast BP algorithm in computer tomography. First we show that the BP algorithm is the spatial-domain counterpart of the benchmark o -- k algorithm in bistatic SAR imaging, yet it avoids the frequency-domain interpolation in the o -- k algorithm, which may cause artifacts in the reconstructed image. We then derive the band-limited property for BP methods in both monostatic and bistatic SAR imaging, which is the basis for developing the fast BP algorithm. We compare our algorithm with other frequency-domain based algorithms, and show that it achieves better reconstructed image quality, while having the same computational complexity as that of the frequency-domain based algorithms.

Shear wave speed recovery using moving interference patterns obtained in sonoelastography experiments.

PubMed

McLaughlin, Joyce; Renzi, Daniel; Parker, Kevin; Wu, Zhe

2007-04-01

Two new experiments were created to characterize the elasticity of soft tissue using sonoelastography. In both experiments the spectral variance image displayed on a GE LOGIC 700 ultrasound machine shows a moving interference pattern that travels at a very small fraction of the shear wave speed. The goal of this paper is to devise and test algorithms to calculate the speed of the moving interference pattern using the arrival times of these same patterns. A geometric optics expansion is used to obtain Eikonal equations relating the moving interference pattern arrival times to the moving interference pattern speed and then to the shear wave speed. A cross-correlation procedure is employed to find the arrival times; and an inverse Eikonal solver called the level curve method computes the speed of the interference pattern. The algorithm is tested on data from a phantom experiment performed at the University of Rochester Center for Biomedical Ultrasound.

The research on the mean shift algorithm for target tracking

NASA Astrophysics Data System (ADS)

CAO, Honghong

2017-06-01

The traditional mean shift algorithm for target tracking is effective and high real-time, but there still are some shortcomings. The traditional mean shift algorithm is easy to fall into local optimum in the tracking process, the effectiveness of the method is weak when the object is moving fast. And the size of the tracking window never changes, the method will fail when the size of the moving object changes, as a result, we come up with a new method. We use particle swarm optimization algorithm to optimize the mean shift algorithm for target tracking, Meanwhile, SIFT (scale-invariant feature transform) and affine transformation make the size of tracking window adaptive. At last, we evaluate the method by comparing experiments. Experimental result indicates that the proposed method can effectively track the object and the size of the tracking window changes.

Emergence of an optimal search strategy from a simple random walk

PubMed Central

Sakiyama, Tomoko; Gunji, Yukio-Pegio

2013-01-01

In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths. PMID:23804445

Emergence of an optimal search strategy from a simple random walk.

PubMed

Sakiyama, Tomoko; Gunji, Yukio-Pegio

2013-09-06

In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths.

Data integration modeling applied to drill hole planning through semi-supervised learning: A case study from the Dalli Cu-Au porphyry deposit in the central Iran

NASA Astrophysics Data System (ADS)

Fatehi, Moslem; Asadi, Hooshang H.

2017-04-01

In this study, the application of a transductive support vector machine (TSVM), an innovative semi-supervised learning algorithm, has been proposed for mapping the potential drill targets at a detailed exploration stage. The semi-supervised learning method is a hybrid of supervised and unsupervised learning approach that simultaneously uses both training and non-training data to design a classifier. By using the TSVM algorithm, exploration layers at the Dalli porphyry Cu-Au deposit in the central Iran were integrated to locate the boundary of the Cu-Au mineralization for further drilling. By applying this algorithm on the non-training (unlabeled) and limited training (labeled) Dalli exploration data, the study area was classified in two domains of Cu-Au ore and waste. Then, the results were validated by the earlier block models created, using the available borehole and trench data. In addition to TSVM, the support vector machine (SVM) algorithm was also implemented on the study area for comparison. Thirty percent of the labeled exploration data was used to evaluate the performance of these two algorithms. The results revealed 87 percent correct recognition accuracy for the TSVM algorithm and 82 percent for the SVM algorithm. The deepest inclined borehole, recently drilled in the western part of the Dalli deposit, indicated that the boundary of Cu-Au mineralization, as identified by the TSVM algorithm, was only 15 m off from the actual boundary intersected by this borehole. According to the results of the TSVM algorithm, six new boreholes were suggested for further drilling at the Dalli deposit. This study showed that the TSVM algorithm could be a useful tool for enhancing the mineralization zones and consequently, ensuring a more accurate drill hole planning.

Efficient boundary hunting via vector quantization

NASA Astrophysics Data System (ADS)

Diamantini, Claudia; Panti, Maurizio

2001-03-01

A great amount of information about a classification problem is contained in those instances falling near the decision boundary. This intuition dates back to the earliest studies in pattern recognition, and in the more recent adaptive approaches to the so called boundary hunting, such as the work of Aha et alii on Instance Based Learning and the work of Vapnik et alii on Support Vector Machines. The last work is of particular interest, since theoretical and experimental results ensure the accuracy of boundary reconstruction. However, its optimization approach has heavy computational and memory requirements, which limits its application on huge amounts of data. In the paper we describe an alternative approach to boundary hunting based on adaptive labeled quantization architectures. The adaptation is performed by a stochastic gradient algorithm for the minimization of the error probability. Error probability minimization guarantees the accurate approximation of the optimal decision boundary, while the use of a stochastic gradient algorithm defines an efficient method to reach such approximation. In the paper comparisons to Support Vector Machines are considered.

LayTracks3D: A new approach for meshing general solids using medial axis transform

DOE PAGES

Quadros, William Roshan

2015-08-22

This study presents an extension of the all-quad meshing algorithm called LayTracks to generate high quality hex-dominant meshes of general solids. LayTracks3D uses the mapping between the Medial Axis (MA) and the boundary of the 3D domain to decompose complex 3D domains into simpler domains called Tracks. Tracks in 3D have no branches and are symmetric, non-intersecting, orthogonal to the boundary, and the shortest path from the MA to the boundary. These properties of tracks result in desired meshes with near cube shape elements at the boundary, structured mesh along the boundary normal with any irregular nodes restricted to themore » MA, and sharp boundary feature preservation. The algorithm has been tested on a few industrial CAD models and hex-dominant meshes are shown in the Results section. Work is underway to extend LayTracks3D to generate all-hex meshes.« less

High-order finite-volume solutions of the steady-state advection-diffusion equation with nonlinear Robin boundary conditions

NASA Astrophysics Data System (ADS)

Lin, Zhi; Zhang, Qinghai

2017-09-01

We propose high-order finite-volume schemes for numerically solving the steady-state advection-diffusion equation with nonlinear Robin boundary conditions. Although the original motivation comes from a mathematical model of blood clotting, the nonlinear boundary conditions may also apply to other scientific problems. The main contribution of this work is a generic algorithm for generating third-order, fourth-order, and even higher-order explicit ghost-filling formulas to enforce nonlinear Robin boundary conditions in multiple dimensions. Under the framework of finite volume methods, this appears to be the first algorithm of its kind. Numerical experiments on boundary value problems show that the proposed fourth-order formula can be much more accurate and efficient than a simple second-order formula. Furthermore, the proposed ghost-filling formulas may also be useful for solving other partial differential equations.

A Rotational Pressure-Correction Scheme for Incompressible Two-Phase Flows with Open Boundaries

PubMed Central

Dong, S.; Wang, X.

2016-01-01

Two-phase outflows refer to situations where the interface formed between two immiscible incompressible fluids passes through open portions of the domain boundary. We present several new forms of open boundary conditions for two-phase outflow simulations within the phase field framework, as well as a rotational pressure correction based algorithm for numerically treating these open boundary conditions. Our algorithm gives rise to linear algebraic systems for the velocity and the pressure that involve only constant and time-independent coefficient matrices after discretization, despite the variable density and variable viscosity of the two-phase mixture. By comparing simulation results with theory and the experimental data, we show that the method produces physically accurate results. We also present numerical experiments to demonstrate the long-term stability of the method in situations where large density contrast, large viscosity contrast, and backflows occur at the two-phase open boundaries. PMID:27163909

Precipitation of low energy electrons at high latitudes: Effects of substorms, interplanetary magnetic field and dipole tilt angle

NASA Technical Reports Server (NTRS)

Burch, J. L.

1972-01-01

Data from the auroral particles experiment on OGO-4 were used to study effects of substorm activity, interplanetary magnetic field latitutde, and dipole tilt angle on high-latitude precipitation of 700 eV electrons. It was found that: (1) The high-latitude zone of 700 eV electron precipitation in late evening and early morning hours moves equatorward by 5 to 10 deg during substorms. (2) The low-latitude boundary of polar cusp electron precipitation at 9 to 15 hours MLT also moves equatorward by several degrees during substorms and, in the absence of significant substorm activity, after a period of southward interplanetary magnetic field. (3) With times containing substorm activity or a southward interplanetary magnetic field eliminated, the low-latitude boundary of polar cusp electron precipitation is found to move by approximately 4 deg over the total yearly range of tilt angles. At maximum winter and summer conditions the invariant latitude of the boundary is shown to shift by approximately -3 deg and +1 deg respectively from its equinox location.

Modeling and simulation of dust behaviors behind a moving vehicle

NASA Astrophysics Data System (ADS)

Wang, Jingfang

Simulation of physically realistic complex dust behaviors is a difficult and attractive problem in computer graphics. A fast, interactive and visually convincing model of dust behaviors behind moving vehicles is very useful in computer simulation, training, education, art, advertising, and entertainment. In my dissertation, an experimental interactive system has been implemented for the simulation of dust behaviors behind moving vehicles. The system includes physically-based models, particle systems, rendering engines and graphical user interface (GUI). I have employed several vehicle models including tanks, cars, and jeeps to test and simulate in different scenarios and conditions. Calm weather, winding condition, vehicle turning left or right, and vehicle simulation controlled by users from the GUI are all included. I have also tested the factors which play against the physical behaviors and graphics appearances of the dust particles through GUI or off-line scripts. The simulations are done on a Silicon Graphics Octane station. The animation of dust behaviors is achieved by physically-based modeling and simulation. The flow around a moving vehicle is modeled using computational fluid dynamics (CFD) techniques. I implement a primitive variable and pressure-correction approach to solve the three dimensional incompressible Navier Stokes equations in a volume covering the moving vehicle. An alternating- direction implicit (ADI) method is used for the solution of the momentum equations, with a successive-over- relaxation (SOR) method for the solution of the Poisson pressure equation. Boundary conditions are defined and simplified according to their dynamic properties. The dust particle dynamics is modeled using particle systems, statistics, and procedure modeling techniques. Graphics and real-time simulation techniques, such as dynamics synchronization, motion blur, blending, and clipping have been employed in the rendering to achieve realistic appearing dust behaviors. In addition, I introduce a temporal smoothing technique to eliminate the jagged effect caused by large simulation time. Several algorithms are used to speed up the simulation. For example, pre-calculated tables and display lists are created to replace some of the most commonly used functions, scripts and processes. The performance study shows that both time and space costs of the algorithms are linear in the number of particles in the system. On a Silicon Graphics Octane, three vehicles with 20,000 particles run at 6-8 frames per second on average. This speed does not include the extra calculations of convergence of the numerical integration for fluid dynamics which usually takes about 4-5 minutes to achieve steady state.

Prostate segmentation by feature enhancement using domain knowledge and adaptive region based operations

NASA Astrophysics Data System (ADS)

Nanayakkara, Nuwan D.; Samarabandu, Jagath; Fenster, Aaron

2006-04-01

Estimation of prostate location and volume is essential in determining a dose plan for ultrasound-guided brachytherapy, a common prostate cancer treatment. However, manual segmentation is difficult, time consuming and prone to variability. In this paper, we present a semi-automatic discrete dynamic contour (DDC) model based image segmentation algorithm, which effectively combines a multi-resolution model refinement procedure together with the domain knowledge of the image class. The segmentation begins on a low-resolution image by defining a closed DDC model by the user. This contour model is then deformed progressively towards higher resolution images. We use a combination of a domain knowledge based fuzzy inference system (FIS) and a set of adaptive region based operators to enhance the edges of interest and to govern the model refinement using a DDC model. The automatic vertex relocation process, embedded into the algorithm, relocates deviated contour points back onto the actual prostate boundary, eliminating the need of user interaction after initialization. The accuracy of the prostate boundary produced by the proposed algorithm was evaluated by comparing it with a manually outlined contour by an expert observer. We used this algorithm to segment the prostate boundary in 114 2D transrectal ultrasound (TRUS) images of six patients scheduled for brachytherapy. The mean distance between the contours produced by the proposed algorithm and the manual outlines was 2.70 ± 0.51 pixels (0.54 ± 0.10 mm). We also showed that the algorithm is insensitive to variations of the initial model and parameter values, thus increasing the accuracy and reproducibility of the resulting boundaries in the presence of noise and artefacts.

An Empirical Derivation of the Run Time of the Bubble Sort Algorithm.

ERIC Educational Resources Information Center

Gonzales, Michael G.

1984-01-01

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

A multi-block adaptive solving technique based on lattice Boltzmann method

NASA Astrophysics Data System (ADS)

Zhang, Yang; Xie, Jiahua; Li, Xiaoyue; Ma, Zhenghai; Zou, Jianfeng; Zheng, Yao

2018-05-01

In this paper, a CFD parallel adaptive algorithm is self-developed by combining the multi-block Lattice Boltzmann Method (LBM) with Adaptive Mesh Refinement (AMR). The mesh refinement criterion of this algorithm is based on the density, velocity and vortices of the flow field. The refined grid boundary is obtained by extending outward half a ghost cell from the coarse grid boundary, which makes the adaptive mesh more compact and the boundary treatment more convenient. Two numerical examples of the backward step flow separation and the unsteady flow around circular cylinder demonstrate the vortex structure of the cold flow field accurately and specifically.

Optimal control and optimal trajectories of regional macroeconomic dynamics based on the Pontryagin maximum principle

NASA Astrophysics Data System (ADS)

Bulgakov, V. K.; Strigunov, V. V.

2009-05-01

The Pontryagin maximum principle is used to prove a theorem concerning optimal control in regional macroeconomics. A boundary value problem for optimal trajectories of the state and adjoint variables is formulated, and optimal curves are analyzed. An algorithm is proposed for solving the boundary value problem of optimal control. The performance of the algorithm is demonstrated by computing an optimal control and the corresponding optimal trajectories.

Implementation of the block-Krylov boundary flexibility method of component synthesis

NASA Technical Reports Server (NTRS)

Carney, Kelly S.; Abdallah, Ayman A.; Hucklebridge, Arthur A.

1993-01-01

A method of dynamic substructuring is presented which utilizes a set of static Ritz vectors as a replacement for normal eigenvectors in component mode synthesis. This set of Ritz vectors is generated in a recurrence relationship, which has the form of a block-Krylov subspace. The initial seed to the recurrence algorithm is based on the boundary flexibility vectors of the component. This algorithm is not load-dependent, is applicable to both fixed and free-interface boundary components, and results in a general component model appropriate for any type of dynamic analysis. This methodology was implemented in the MSC/NASTRAN normal modes solution sequence using DMAP. The accuracy is found to be comparable to that of component synthesis based upon normal modes. The block-Krylov recurrence algorithm is a series of static solutions and so requires significantly less computation than solving the normal eigenspace problem.

Assessment of Mixed-Layer Height Estimation from Single-wavelength Ceilometer Profiles

PubMed Central

Knepp, Travis N.; Szykman, James J.; Long, Russell; Duvall, Rachelle M.; Krug, Jonathan; Beaver, Melinda; Cavender, Kevin; Kronmiller, Keith; Wheeler, Michael; Delgado, Ruben; Hoff, Raymond; Berkoff, Timothy; Olson, Erik; Clark, Richard; Wolfe, Daniel; Van Gilst, David; Neil, Doreen

2018-01-01

Differing boundary/mixed-layer height measurement methods were assessed in moderately-polluted and clean environments, with a focus on the Vaisala CL51 ceilometer. This intercomparison was performed as part of ongoing measurements at the Chemistry And Physics of the Atmospheric Boundary Layer Experiment (CAPABLE) site in Hampton, Virginia and during the 2014 Deriving Information on Surface Conditions from Column and Vertically Resolved Observations Relevant to Air Quality (DISCOVER-AQ) field campaign that took place in and around Denver, Colorado. We analyzed CL51 data that were collected via two different methods (BLView software, which applied correction factors, and simple terminal emulation logging) to determine the impact of data collection methodology. Further, we evaluated the STRucture of the ATmosphere (STRAT) algorithm as an open-source alternative to BLView (note that the current work presents an evaluation of the BLView and STRAT algorithms and does not intend to act as a validation of either). Filtering criteria were defined according to the change in mixed-layer height (MLH) distributions for each instrument and algorithm and were applied throughout the analysis to remove high-frequency fluctuations from the MLH retrievals. Of primary interest was determining how the different data-collection methodologies and algorithms compare to each other and to radiosonde-derived boundary-layer heights when deployed as part of a larger instrument network. We determined that data-collection methodology is not as important as the processing algorithm and that much of the algorithm differences might be driven by impacts of local meteorology and precipitation events that pose algorithm difficulties. The results of this study show that a common processing algorithm is necessary for LIght Detection And Ranging (LIDAR)-based MLH intercomparisons, and ceilometer-network operation and that sonde-derived boundary layer heights are higher (10–15% at mid-day) than LIDAR-derived mixed-layer heights. We show that averaging the retrieved MLH to 1-hour resolution (an appropriate time scale for a priori data model initialization) significantly improved correlation between differing instruments and differing algorithms. PMID:29682087

Application of the perfectly matched layer in 2.5D marine controlled-source electromagnetic modeling

NASA Astrophysics Data System (ADS)

Li, Gang; Han, Bo

2017-09-01

For the traditional framework of EM modeling algorithms, the Dirichlet boundary is usually used which assumes the field values are zero at the boundaries. This crude condition requires that the boundaries should be sufficiently far away from the area of interest. Although cell sizes could become larger toward the boundaries as electromagnetic wave is propagated diffusively, a large modeling area may still be necessary to mitigate the boundary artifacts. In this paper, the complex frequency-shifted perfectly matched layer (CFS-PML) in stretching Cartesian coordinates is successfully applied to 2.5D frequency-domain marine controlled-source electromagnetic (CSEM) field modeling. By using this PML boundary, one can restrict the modeling area of interest to the target region. Only a few absorbing layers surrounding the computational area can effectively depress the artificial boundary effect without losing the numerical accuracy. A 2.5D marine CSEM modeling scheme with the CFS-PML is developed by using the staggered finite-difference discretization. This modeling algorithm using the CFS-PML is of high accuracy, and shows advantages in computational time and memory saving than that using the Dirichlet boundary. For 3D problem, this computation time and memory saving should be more significant.

A new approach to increase the two-dimensional detection probability of CSI algorithm for WAS-GMTI mode

NASA Astrophysics Data System (ADS)

Yan, H.; Zheng, M. J.; Zhu, D. Y.; Wang, H. T.; Chang, W. S.

2015-07-01

When using clutter suppression interferometry (CSI) algorithm to perform signal processing in a three-channel wide-area surveillance radar system, the primary concern is to effectively suppress the ground clutter. However, a portion of moving target's energy is also lost in the process of channel cancellation, which is often neglected in conventional applications. In this paper, we firstly investigate the two-dimensional (radial velocity dimension and squint angle dimension) residual amplitude of moving targets after channel cancellation with CSI algorithm. Then, a new approach is proposed to increase the two-dimensional detection probability of moving targets by reserving the maximum value of the three channel cancellation results in non-uniformly spaced channel system. Besides, theoretical expression of the false alarm probability with the proposed approach is derived in the paper. Compared with the conventional approaches in uniformly spaced channel system, simulation results validate the effectiveness of the proposed approach. To our knowledge, it is the first time that the two-dimensional detection probability of CSI algorithm is studied.

Adjoint-based optimization of PDEs in moving domains

NASA Astrophysics Data System (ADS)

Protas, Bartosz; Liao, Wenyuan

2008-02-01

In this investigation we address the problem of adjoint-based optimization of PDE systems in moving domains. As an example we consider the one-dimensional heat equation with prescribed boundary temperatures and heat fluxes. We discuss two methods of deriving an adjoint system necessary to obtain a gradient of a cost functional. In the first approach we derive the adjoint system after mapping the problem to a fixed domain, whereas in the second approach we derive the adjoint directly in the moving domain by employing methods of the noncylindrical calculus. We show that the operations of transforming the system from a variable to a fixed domain and deriving the adjoint do not commute and that, while the gradient information contained in both systems is the same, the second approach results in an adjoint problem with a simpler structure which is therefore easier to implement numerically. This approach is then used to solve a moving boundary optimization problem for our model system.

Using advanced computer vision algorithms on small mobile robots

NASA Astrophysics Data System (ADS)

Kogut, G.; Birchmore, F.; Biagtan Pacis, E.; Everett, H. R.

2006-05-01

The Technology Transfer project employs a spiral development process to enhance the functionality and autonomy of mobile robot systems in the Joint Robotics Program (JRP) Robotic Systems Pool by converging existing component technologies onto a transition platform for optimization. An example of this approach is the implementation of advanced computer vision algorithms on small mobile robots. We demonstrate the implementation and testing of the following two algorithms useful on mobile robots: 1) object classification using a boosted Cascade of classifiers trained with the Adaboost training algorithm, and 2) human presence detection from a moving platform. Object classification is performed with an Adaboost training system developed at the University of California, San Diego (UCSD) Computer Vision Lab. This classification algorithm has been used to successfully detect the license plates of automobiles in motion in real-time. While working towards a solution to increase the robustness of this system to perform generic object recognition, this paper demonstrates an extension to this application by detecting soda cans in a cluttered indoor environment. The human presence detection from a moving platform system uses a data fusion algorithm which combines results from a scanning laser and a thermal imager. The system is able to detect the presence of humans while both the humans and the robot are moving simultaneously. In both systems, the two aforementioned algorithms were implemented on embedded hardware and optimized for use in real-time. Test results are shown for a variety of environments.

Motion of 1/3⟨111⟩ dislocations on Σ3 {112} twin boundaries in nanotwinned copper

NASA Astrophysics Data System (ADS)

Lu, N.; Du, K.; Lu, L.; Ye, H. Q.

2014-01-01

The atomic structure of Σ3 {112} ITBs in nanotwinned Cu is investigated by using aberration-corrected high resolution transmission electron microscopy (HRTEM) and in situ HRTEM observations. The Σ3 {112} ITBs are consisted of periodically repeated three partial dislocations. The in situ HRTEM results show that 1/3[111] partial dislocation moves on the Σ3 {112} incoherent twin boundary (ITB), which was accompanied by a migration of the ITB. A dislocation reaction mechanism is proposed for the motion of 1/3[111] Frank partial dislocation, in which the 1/3[111] partial dislocation exchanges its position with twin boundary dislocations in sequence. In this way, the 1/3[111] dislocation can move on the incoherent twin boundary in metals with low stacking fault energy. Meanwhile, the ITB will migrate in its normal direction accordingly. These results provide insight into the reaction mechanism of 1/3[111] dislocations and ITBs and the associated migration of ITBs.

Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm

NASA Astrophysics Data System (ADS)

Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam

2017-04-01

The paper aims to present a design algorithm for multi quadrotor lanes in order to move towards the goal quickly and avoid obstacles in an area with obstacles. There are several problems in path planning including how to get to the goal position quickly and avoid static and dynamic obstacles. To overcome the problem, therefore, the paper presents fuzzy logic algorithm and fuzzy cell decomposition algorithm. Fuzzy logic algorithm is one of the artificial intelligence algorithms which can be applied to robot path planning that is able to detect static and dynamic obstacles. Cell decomposition algorithm is an algorithm of graph theory used to make a robot path map. By using the two algorithms the robot is able to get to the goal position and avoid obstacles but it takes a considerable time because they are able to find the shortest path. Therefore, this paper describes a modification of the algorithms by adding a potential field algorithm used to provide weight values on the map applied for each quadrotor by using decentralized controlled, so that the quadrotor is able to move to the goal position quickly by finding the shortest path. The simulations conducted have shown that multi-quadrotor can avoid various obstacles and find the shortest path by using the proposed algorithms.

Computer simulations of polymer chain structure and dynamics on a hypersphere in four-space

NASA Astrophysics Data System (ADS)

Râsmark, Per Johan; Ekholm, Tobias; Elvingson, Christer

2005-05-01

There is a rapidly growing interest in performing computer simulations in a closed space, avoiding periodic boundary conditions. To extend the range of potential systems to include also macromolecules, we describe an algorithm for computer simulations of polymer chain molecules on S3, a hypersphere in four dimensions. In particular, we show how to generate initial conformations with a bond angle distribution given by the persistence length of the chain and how to calculate the bending forces for a molecule moving on S3. Furthermore, we discuss how to describe the shape of a macromolecule on S3, by deriving the radius of gyration tensor in this non-Euclidean space. The results from both Monte Carlo and Brownian dynamics simulations in the infinite dilution limit show that the results on S3 and in R3 coincide, both with respect to the size and shape as well as for the diffusion coefficient. All data on S3 can also be described by master curves by suitable scaling by the corresponding values in R3. We thus show how to extend the use of spherical boundary conditions, which are most effective for calculating electrostatic forces, to polymer chain molecules, making it possible to perform simulations on S3 also for polyelectrolyte systems.

Magnetic field dependent dynamics and field-driven metal-to-insulator transition of the half-filled Hubbard model: A DMFT+DMRG study

DOE PAGES

Zhu, Wei; Sheng, D. N.; Zhu, Jian -Xin

2017-08-14

Here, we study the magnetic field-driven metal-to-insulator transition in half-filled Hubbard model on the Bethe lattice, using the dynamical mean-field theory by solving the quantum impurity problem with density-matrix renormalization group algorithm. The method enables us to obtain a high-resolution spectral densities in the presence of a magnetic field. It is found that the Kondo resonance at the Fermi level splits at relatively high magnetic field: the spin-up and -down components move away from the Fermi level and finally form a spin-polarized band insulator. By calculating the magnetization and spin susceptibility, we clarify that an applied magnetic field drives amore » transition from a paramagnetic metallic phase to a band insulating phase. In the weak interaction regime, the nature of the transition is continuous and captured by the Stoner's description, while in the strong interaction regime the transition is very likely to be metamagnetic, evidenced by the hysteresis curve. Furthermore, we determine the phase boundary by tracking the kink in the magnetic susceptibility, and the steplike change of the entanglement entropy and the entanglement gap closing. Interestingly, the phase boundaries determined from these two different ways are largely consistent with each other.« less

Magnetic field dependent dynamics and field-driven metal-to-insulator transition of the half-filled Hubbard model: A DMFT+DMRG study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhu, Wei; Sheng, D. N.; Zhu, Jian -Xin

Here, we study the magnetic field-driven metal-to-insulator transition in half-filled Hubbard model on the Bethe lattice, using the dynamical mean-field theory by solving the quantum impurity problem with density-matrix renormalization group algorithm. The method enables us to obtain a high-resolution spectral densities in the presence of a magnetic field. It is found that the Kondo resonance at the Fermi level splits at relatively high magnetic field: the spin-up and -down components move away from the Fermi level and finally form a spin-polarized band insulator. By calculating the magnetization and spin susceptibility, we clarify that an applied magnetic field drives amore » transition from a paramagnetic metallic phase to a band insulating phase. In the weak interaction regime, the nature of the transition is continuous and captured by the Stoner's description, while in the strong interaction regime the transition is very likely to be metamagnetic, evidenced by the hysteresis curve. Furthermore, we determine the phase boundary by tracking the kink in the magnetic susceptibility, and the steplike change of the entanglement entropy and the entanglement gap closing. Interestingly, the phase boundaries determined from these two different ways are largely consistent with each other.« less

A stable partitioned FSI algorithm for rigid bodies and incompressible flow. Part II: General formulation

NASA Astrophysics Data System (ADS)

Banks, J. W.; Henshaw, W. D.; Schwendeman, D. W.; Tang, Qi

2017-08-01

A stable partitioned algorithm is developed for fluid-structure interaction (FSI) problems involving viscous incompressible flow and rigid bodies. This added-mass partitioned (AMP) algorithm remains stable, without sub-iterations, for light and even zero mass rigid bodies when added-mass and viscous added-damping effects are large. The scheme is based on a generalized Robin interface condition for the fluid pressure that includes terms involving the linear acceleration and angular acceleration of the rigid body. Added mass effects are handled in the Robin condition by inclusion of a boundary integral term that depends on the pressure. Added-damping effects due to the viscous shear forces on the body are treated by inclusion of added-damping tensors that are derived through a linearization of the integrals defining the force and torque. Added-damping effects may be important at low Reynolds number, or, for example, in the case of a rotating cylinder or rotating sphere when the rotational moments of inertia are small. In this second part of a two-part series, the general formulation of the AMP scheme is presented including the form of the AMP interface conditions and added-damping tensors for general geometries. A fully second-order accurate implementation of the AMP scheme is developed in two dimensions based on a fractional-step method for the incompressible Navier-Stokes equations using finite difference methods and overlapping grids to handle the moving geometry. The numerical scheme is verified on a number of difficult benchmark problems.

Proposal of an Algorithm to Synthesize Music Suitable for Dance

NASA Astrophysics Data System (ADS)

Morioka, Hirofumi; Nakatani, Mie; Nishida, Shogo

This paper proposes an algorithm for synthesizing music suitable for emotions in moving pictures. Our goal is to support multi-media content creation; web page design, animation films and so on. Here we adopt a human dance as a moving picture to examine the availability of our method. Because we think the dance image has high affinity with music. This algorithm is composed of three modules. The first is the module for computing emotions from an input dance image, the second is for computing emotions from music in the database and the last is for selecting music suitable for input dance via an interface of emotion.

A new approach of data clustering using a flock of agents.

PubMed

Picarougne, Fabien; Azzag, Hanene; Venturini, Gilles; Guinot, Christiane

2007-01-01

This paper presents a new bio-inspired algorithm (FClust) that dynamically creates and visualizes groups of data. This algorithm uses the concepts of a flock of agents that move together in a complex manner with simple local rules. Each agent represents one data. The agents move together in a 2D environment with the aim of creating homogeneous groups of data. These groups are visualized in real time, and help the domain expert to understand the underlying structure of the data set, like for example a realistic number of classes, clusters of similar data, isolated data. We also present several extensions of this algorithm, which reduce its computational cost, and make use of a 3D display. This algorithm is then tested on artificial and real-world data, and a heuristic algorithm is used to evaluate the relevance of the obtained partitioning.

Automatic estimation of heart boundaries and cardiothoracic ratio from chest x-ray images

NASA Astrophysics Data System (ADS)

Dallal, Ahmed H.; Agarwal, Chirag; Arbabshirani, Mohammad R.; Patel, Aalpen; Moore, Gregory

2017-03-01

Cardiothoracic ratio (CTR) is a widely used radiographic index to assess heart size on chest X-rays (CXRs). Recent studies have suggested that also two-dimensional CTR might contain clinical information about the heart function. However, manual measurement of such indices is both subjective and time consuming. This study proposes a fast algorithm to automatically estimate CTR indices based on CXRs. The algorithm has three main steps: 1) model based lung segmentation, 2) estimation of heart boundaries from lung contours, and 3) computation of cardiothoracic indices from the estimated boundaries. We extended a previously employed lung detection algorithm to automatically estimate heart boundaries without using ground truth heart markings. We used two datasets: a publicly available dataset with 247 images as well as clinical dataset with 167 studies from Geisinger Health System. The models of lung fields are learned from both datasets. The lung regions in a given test image are estimated by registering the learned models to patient CXRs. Then, heart region is estimated by applying Harris operator on segmented lung fields to detect the corner points corresponding to the heart boundaries. The algorithm calculates three indices, CTR1D, CTR2D, and cardiothoracic area ratio (CTAR). The method was tested on 103 clinical CXRs and average error rates of 7.9%, 25.5%, and 26.4% (for CTR1D, CTR2D, and CTAR respectively) were achieved. The proposed method outperforms previous CTR estimation methods without using any heart templates. This method can have important clinical implications as it can provide fast and accurate estimate of cardiothoracic indices.

Mesoscale observational analysis of lifting mechanism of a warm-sector convective system producing the maximal daily precipitation in China mainland during pre-summer rainy season of 2015

NASA Astrophysics Data System (ADS)

Wu, Mengwen; Luo, Yali

2016-08-01

A long-lived, quasi-stationary mesoscale convective system (MCS) producing extreme rainfall (maximum of 542 mm) over the eastern coastal area of Guangdong Province on 20 May 2015 is analyzed by using high-resolution surface observations, sounding data, and radar measurements. New convective cells are continuously initiated along a mesoscale boundary at the surface, leading to formation and maintenance of the quasi-linear-shaped MCS from about 2000 BT 19 to 1200 BT 20 May. The boundary is originally formed between a cold dome generated by previous convection and southwesterly flow from the ocean carrying higher equivalent potential temperature ( θ e) air. The boundary is subsequently maintained and reinforced by the contrast between the MCS-generated cold outflow and the oceanic higher- θ e air. The cold outflow is weak (wind speed ≤ 5 m s -1), which is attributable to the characteristic environmental conditions, i.e., high humidity in the lower troposphere and weak horizontal winds in the middle and lower troposphere. The low speed of the cold outflow is comparable to that of the near surface southerly flow from the ocean, resulting in very slow southward movement of the boundary. The boundary features temperature contrasts of 2-3°C and is roughly 500-m deep. Despite its shallowness, the boundary appears to exert a profound influence on continuous convection initiation because of the very low level of free convection and small convection inhibition of the near surface oceanic air, building several parallel rainbands (of about 50-km length) that move slowly eastward along the MCS and produce about 80% of the total rainfall. Another MCS moves into the area from the northwest and merges with the local MCS at about 1200 BT. The cold outflow subsequently strengthens and the boundary moves more rapidly toward the southeast, leading to end of the event in 3 h.

An Improved Harmonic Current Detection Method Based on Parallel Active Power Filter

NASA Astrophysics Data System (ADS)

Zeng, Zhiwu; Xie, Yunxiang; Wang, Yingpin; Guan, Yuanpeng; Li, Lanfang; Zhang, Xiaoyu

2017-05-01

Harmonic detection technology plays an important role in the applications of active power filter. The accuracy and real-time performance of harmonic detection are the precondition to ensure the compensation performance of Active Power Filter (APF). This paper proposed an improved instantaneous reactive power harmonic current detection algorithm. The algorithm uses an improved ip -iq algorithm which is combined with the moving average value filter. The proposed ip -iq algorithm can remove the αβ and dq coordinate transformation, decreasing the cost of calculation, simplifying the extraction process of fundamental components of load currents, and improving the detection speed. The traditional low-pass filter is replaced by the moving average filter, detecting the harmonic currents more precisely and quickly. Compared with the traditional algorithm, the THD (Total Harmonic Distortion) of the grid currents is reduced from 4.41% to 3.89% for the simulations and from 8.50% to 4.37% for the experiments after the improvement. The results show the proposed algorithm is more accurate and efficient.

Scalability problems of simple genetic algorithms.

PubMed

Thierens, D

1999-01-01

Scalable evolutionary computation has become an intensively studied research topic in recent years. The issue of scalability is predominant in any field of algorithmic design, but it became particularly relevant for the design of competent genetic algorithms once the scalability problems of simple genetic algorithms were understood. Here we present some of the work that has aided in getting a clear insight in the scalability problems of simple genetic algorithms. Particularly, we discuss the important issue of building block mixing. We show how the need for mixing places a boundary in the GA parameter space that, together with the boundary from the schema theorem, delimits the region where the GA converges reliably to the optimum in problems of bounded difficulty. This region shrinks rapidly with increasing problem size unless the building blocks are tightly linked in the problem coding structure. In addition, we look at how straightforward extensions of the simple genetic algorithm-namely elitism, niching, and restricted mating are not significantly improving the scalability problems.

Induced rotational motion with nonabutting inducing and induced stimuli: implications regarding two forms of induced motion.

PubMed

Reinhardt-Rutland, A H

2003-07-01

Induced motion is the illusory motion of a static stimulus in the opposite direction to a moving stimulus. Two types of induced motion have been distinguished: (a) when the moving stimulus is distant from the static stimulus and undergoes overall displacement, and (b) when the moving stimulus is pattern viewed within fixed boundaries that abut the static stimulus. Explanations of the 1st type of induced motion refer to mediating phenomena, such as vection, whereas the 2nd type is attributed to local processing by motion-sensitive neurons. The present research was directed to a display that elicited induced rotational motion with the characteristics of both types of induced motion: the moving stimulus lay within fixed boundaries, but the inducing and induced stimuli were distant from each other. The author investigated the properties that distinguished the two types of induced motion. In 3 experiments, induced motion persisted indefinitely, interocular transfer of the aftereffect of induced motion was limited to about 20%, and the time-course of the aftereffect of induced motion could not be attributed to vection. Those results were consistent with fixed-boundary induced motion. However, they could not be explained by local processing. Instead, the results might reflect the detection of object motion within a complex flow-field that resulted from the observer's motion.

Fast and selective determination of total protein in milk powder via titration of moving reaction boundary electrophoresis.

PubMed

Guo, Cheng-ye; Wang, Hou-yu; Liu, Xiao-ping; Fan, Liu-yin; Zhang, Lei; Cao, Cheng-xi

2013-05-01

In this paper, moving reaction boundary titration (MRBT) was developed for rapid and accurate quantification of total protein in infant milk powder, from the concept of moving reaction boundary (MRB) electrophoresis. In the method, the MRB was formed by the hydroxide ions and the acidic residues of milk proteins immobilized via cross-linked polyacrylamide gel (PAG), an acid-base indicator was used to denote the boundary motion. As a proof of concept, we chose five brands of infant milk powders to study the feasibility of MRBT method. The calibration curve of MRB velocity versus logarithmic total protein content of infant milk powder sample was established based on the visual signal of MRB motion as a function of logarithmic milk protein content. Weak influence of nonprotein nitrogen (NPN) reagents (e.g., melamine and urea) on MRBT method was observed, due to the fact that MRB was formed with hydroxide ions and the acidic residues of captured milk proteins, rather than the alkaline residues or the NPN reagents added. The total protein contents in infant milk powder samples detected via the MRBT method were in good agreement with those achieved by the classic Kjeldahl method. In addition, the developed method had much faster measuring speed compared with the Kjeldahl method. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Segmentation of ribs in digital chest radiographs

NASA Astrophysics Data System (ADS)

Cong, Lin; Guo, Wei; Li, Qiang

2016-03-01

Ribs and clavicles in posterior-anterior (PA) digital chest radiographs often overlap with lung abnormalities such as nodules, and cause missing of these abnormalities, it is therefore necessary to remove or reduce the ribs in chest radiographs. The purpose of this study was to develop a fully automated algorithm to segment ribs within lung area in digital radiography (DR) for removal of the ribs. The rib segmentation algorithm consists of three steps. Firstly, a radiograph was pre-processed for contrast adjustment and noise removal; second, generalized Hough transform was employed to localize the lower boundary of the ribs. In the third step, a novel bilateral dynamic programming algorithm was used to accurately segment the upper and lower boundaries of ribs simultaneously. The width of the ribs and the smoothness of the rib boundaries were incorporated in the cost function of the bilateral dynamic programming for obtaining consistent results for the upper and lower boundaries. Our database consisted of 93 DR images, including, respectively, 23 and 70 images acquired with a DR system from Shanghai United-Imaging Healthcare Co. and from GE Healthcare Co. The rib localization algorithm achieved a sensitivity of 98.2% with 0.1 false positives per image. The accuracy of the detected ribs was further evaluated subjectively in 3 levels: "1", good; "2", acceptable; "3", poor. The percentages of good, acceptable, and poor segmentation results were 91.1%, 7.2%, and 1.7%, respectively. Our algorithm can obtain good segmentation results for ribs in chest radiography and would be useful for rib reduction in our future study.

2-D transmitral flows simulation by means of the immersed boundary method on unstructured grids

NASA Astrophysics Data System (ADS)

Denaro, F. M.; Sarghini, F.

2002-04-01

Interaction between computational fluid dynamics and clinical researches recently allowed a deeper understanding of the physiology of complex phenomena involving cardio-vascular mechanisms. The aim of this paper is to develop a simplified numerical model based on the Immersed Boundary Method and to perform numerical simulations in order to study the cardiac diastolic phase during which the left ventricle is filled with blood flowing from the atrium throughout the mitral valve. As one of the diagnostic problems to be faced by clinicians is the lack of a univocal definition of the diastolic performance from the velocity measurements obtained by Eco-Doppler techniques, numerical simulations are supposed to provide an insight both into the physics of the diastole and into the interpretation of experimental data. An innovative application of the Immersed Boundary Method on unstructured grids is presented, fulfilling accuracy requirements related to the development of a thin boundary layer along the moving immersed boundary. It appears that this coupling between unstructured meshes and the Immersed Boundary Method is a promising technique when a wide range of spatial scales is involved together with a moving boundary. Numerical simulations are performed in a range of physiological parameters and a qualitative comparison with experimental data is presented, in order to demonstrate that, despite the simplified model, the main physiological characteristics of the diastole are well represented. Copyright

The Need to Proactively Develop Flexible, Adaptable Plans for Logistics

DTIC Science & Technology

2013-03-01

operational reach.6 The deployment and distribution capability moves forces 4 and logistic support globally and on time meeting the required...forcing function, as supplies were moving efficiently through Pakistan. The northern routes were more expensive, so there was not a keen interest in...products to State valuing relationships more than rank.22 Clarifying the boundaries of what combatant commanders could do to move the agenda along

Pulmonary lobe segmentation based on ridge surface sampling and shape model fitting

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ross, James C., E-mail: jross@bwh.harvard.edu; Surgical Planning Lab, Brigham and Women's Hospital, Boston, Massachusetts 02215; Laboratory of Mathematics in Imaging, Brigham and Women's Hospital, Boston, Massachusetts 02126

2013-12-15

Purpose: Performing lobe-based quantitative analysis of the lung in computed tomography (CT) scans can assist in efforts to better characterize complex diseases such as chronic obstructive pulmonary disease (COPD). While airways and vessels can help to indicate the location of lobe boundaries, segmentations of these structures are not always available, so methods to define the lobes in the absence of these structures are desirable. Methods: The authors present a fully automatic lung lobe segmentation algorithm that is effective in volumetric inspiratory and expiratory computed tomography (CT) datasets. The authors rely on ridge surface image features indicating fissure locations and amore » novel approach to modeling shape variation in the surfaces defining the lobe boundaries. The authors employ a particle system that efficiently samples ridge surfaces in the image domain and provides a set of candidate fissure locations based on the Hessian matrix. Following this, lobe boundary shape models generated from principal component analysis (PCA) are fit to the particles data to discriminate between fissure and nonfissure candidates. The resulting set of particle points are used to fit thin plate spline (TPS) interpolating surfaces to form the final boundaries between the lung lobes. Results: The authors tested algorithm performance on 50 inspiratory and 50 expiratory CT scans taken from the COPDGene study. Results indicate that the authors' algorithm performs comparably to pulmonologist-generated lung lobe segmentations and can produce good results in cases with accessory fissures, incomplete fissures, advanced emphysema, and low dose acquisition protocols. Dice scores indicate that only 29 out of 500 (5.85%) lobes showed Dice scores lower than 0.9. Two different approaches for evaluating lobe boundary surface discrepancies were applied and indicate that algorithm boundary identification is most accurate in the vicinity of fissures detectable on CT. Conclusions: The proposed algorithm is effective for lung lobe segmentation in absence of auxiliary structures such as vessels and airways. The most challenging cases are those with mostly incomplete, absent, or near-absent fissures and in cases with poorly revealed fissures due to high image noise. However, the authors observe good performance even in the majority of these cases.« less

Fast adaptive diamond search algorithm for block-matching motion estimation using spatial correlation

NASA Astrophysics Data System (ADS)

Park, Sang-Gon; Jeong, Dong-Seok

2000-12-01

In this paper, we propose a fast adaptive diamond search algorithm (FADS) for block matching motion estimation. Many fast motion estimation algorithms reduce the computational complexity by the UESA (Unimodal Error Surface Assumption) where the matching error monotonically increases as the search moves away from the global minimum point. Recently, many fast BMAs (Block Matching Algorithms) make use of the fact that global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the neighboring blocks. We move the search origin according to the motion vectors of the spatially neighboring blocks and their MAEs (Mean Absolute Errors). The computer simulation shows that the proposed algorithm has almost the same computational complexity with DS (Diamond Search), but enhances PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS (Full Search), even for the large motion with half the computational load.

Internationalization in German Academic Libraries: Moving beyond North American Perspectives

ERIC Educational Resources Information Center

Bordonaro, Karen; Rauchmann, Sabine

2015-01-01

This paper explores how internationalization is understood and experienced in German academic libraries. Its main purpose is to move the discussion of internationalization in academic libraries beyond the boundaries of English-speaking North America by investigating a European perspective. Its secondary purpose is to investigate the role of…

Transient and asymptotic behaviour of the binary breakage problem

NASA Astrophysics Data System (ADS)

Mantzaris, Nikos V.

2005-06-01

The general binary breakage problem with power-law breakage functions and two families of symmetric and asymmetric breakage kernels is studied in this work. A useful transformation leads to an equation that predicts self-similar solutions in its asymptotic limit and offers explicit knowledge of the mean size and particle density at each point in dimensionless time. A novel moving boundary algorithm in the transformed coordinate system is developed, allowing the accurate prediction of the full transient behaviour of the system from the initial condition up to the point where self-similarity is achieved, and beyond if necessary. The numerical algorithm is very rapid and its results are in excellent agreement with known analytical solutions. In the case of the symmetric breakage kernels only unimodal, self-similar number density functions are obtained asymptotically for all parameter values and independent of the initial conditions, while in the case of asymmetric breakage kernels, bimodality appears for high degrees of asymmetry and sharp breakage functions. For symmetric and discrete breakage kernels, self-similarity is not achieved. The solution exhibits sustained oscillations with amplitude that depends on the initial condition and the sharpness of the breakage mechanism, while the period is always fixed and equal to ln 2 with respect to dimensionless time.

Multimedia systems in ultrasound image boundary detection and measurements

NASA Astrophysics Data System (ADS)

Pathak, Sayan D.; Chalana, Vikram; Kim, Yongmin

1997-05-01

Ultrasound as a medical imaging modality offers the clinician a real-time of the anatomy of the internal organs/tissues, their movement, and flow noninvasively. One of the applications of ultrasound is to monitor fetal growth by measuring biparietal diameter (BPD) and head circumference (HC). We have been working on automatic detection of fetal head boundaries in ultrasound images. These detected boundaries are used to measure BPD and HC. The boundary detection algorithm is based on active contour models and takes 32 seconds on an external high-end workstation, SUN SparcStation 20/71. Our goal has been to make this tool available within an ultrasound machine and at the same time significantly improve its performance utilizing multimedia technology. With the advent of high- performance programmable digital signal processors (DSP), the software solution within an ultrasound machine instead of the traditional hardwired approach or requiring an external computer is now possible. We have integrated our boundary detection algorithm into a programmable ultrasound image processor (PUIP) that fits into a commercial ultrasound machine. The PUIP provides both the high computing power and flexibility needed to support computationally-intensive image processing algorithms within an ultrasound machine. According to our data analysis, BPD/HC measurements made on PUIP lie within the interobserver variability. Hence, the errors in the automated BPD/HC measurements using the algorithm are on the same order as the average interobserver differences. On PUIP, it takes 360 ms to measure the values of BPD/HC on one head image. When processing multiple head images in sequence, it takes 185 ms per image, thus enabling 5.4 BPD/HC measurements per second. Reduction in the overall execution time from 32 seconds to a fraction of a second and making this multimedia system available within an ultrasound machine will help this image processing algorithm and other computer-intensive imaging applications become a practical tool for the sonographers in the feature.

Interaction of aerodynamic noise with laminar boundary layers in supersonic wind tunnels

NASA Technical Reports Server (NTRS)

Schopper, M. R.

1984-01-01

The interaction between incoming aerodynamic noise and the supersonic laminar boundary layer is studied. The noise field is modeled as a Mach wave radiation field consisting of discrete waves emanating from coherent turbulent entities moving downstream within the supersonic turbulent boundary layer. The individual disturbances are likened to miniature sonic booms and the laminar boundary layer is staffed by the waves as the sources move downstream. The mean, autocorrelation, and power spectral density of the field are expressed in terms of the wave shapes and their average arrival rates. Some consideration is given to the possible appreciable thickness of the weak shock fronts. The emphasis in the interaction analysis is on the behavior of the shocklets in the noise field. The shocklets are shown to be focused by the laminar boundary layer in its outer region. Borrowing wave propagation terminology, this region is termed the caustic region. Using scaling laws from sonic boom work, focus factors at the caustic are estimated to vary from 2 to 6 for incoming shocklet strengths of 1 to .01 percent of the free stream pressure level. The situation regarding experimental evidence of the caustic region is reviewed.

Automatic Generation of Boundary Conditions Using Demons Nonrigid Image Registration for Use in 3-D Modality-Independent Elastography

PubMed Central

Ou, Jao J.; Ong, Rowena E.; Miga, Michael I.

2013-01-01

Modality-independent elastography (MIE) is a method of elastography that reconstructs the elastic properties of tissue using images acquired under different loading conditions and a biomechanical model. Boundary conditions are a critical input to the algorithm and are often determined by time-consuming point correspondence methods requiring manual user input. This study presents a novel method of automatically generating boundary conditions by nonrigidly registering two image sets with a demons diffusion-based registration algorithm. The use of this method was successfully performed in silico using magnetic resonance and X-ray-computed tomography image data with known boundary conditions. These preliminary results produced boundary conditions with an accuracy of up to 80% compared to the known conditions. Demons-based boundary conditions were utilized within a 3-D MIE reconstruction to determine an elasticity contrast ratio between tumor and normal tissue. Two phantom experiments were then conducted to further test the accuracy of the demons boundary conditions and the MIE reconstruction arising from the use of these conditions. Preliminary results show a reasonable characterization of the material properties on this first attempt and a significant improvement in the automation level and viability of the method. PMID:21690002

Automatic generation of boundary conditions using demons nonrigid image registration for use in 3-D modality-independent elastography.

PubMed

Pheiffer, Thomas S; Ou, Jao J; Ong, Rowena E; Miga, Michael I

2011-09-01

Modality-independent elastography (MIE) is a method of elastography that reconstructs the elastic properties of tissue using images acquired under different loading conditions and a biomechanical model. Boundary conditions are a critical input to the algorithm and are often determined by time-consuming point correspondence methods requiring manual user input. This study presents a novel method of automatically generating boundary conditions by nonrigidly registering two image sets with a demons diffusion-based registration algorithm. The use of this method was successfully performed in silico using magnetic resonance and X-ray-computed tomography image data with known boundary conditions. These preliminary results produced boundary conditions with an accuracy of up to 80% compared to the known conditions. Demons-based boundary conditions were utilized within a 3-D MIE reconstruction to determine an elasticity contrast ratio between tumor and normal tissue. Two phantom experiments were then conducted to further test the accuracy of the demons boundary conditions and the MIE reconstruction arising from the use of these conditions. Preliminary results show a reasonable characterization of the material properties on this first attempt and a significant improvement in the automation level and viability of the method.

First order augmentation to tensor voting for boundary inference and multiscale analysis in 3D.

PubMed

Tong, Wai-Shun; Tang, Chi-Keung; Mordohai, Philippos; Medioni, Gérard

2004-05-01

Most computer vision applications require the reliable detection of boundaries. In the presence of outliers, missing data, orientation discontinuities, and occlusion, this problem is particularly challenging. We propose to address it by complementing the tensor voting framework, which was limited to second order properties, with first order representation and voting. First order voting fields and a mechanism to vote for 3D surface and volume boundaries and curve endpoints in 3D are defined. Boundary inference is also useful for a second difficult problem in grouping, namely, automatic scale selection. We propose an algorithm that automatically infers the smallest scale that can preserve the finest details. Our algorithm then proceeds with progressively larger scales to ensure continuity where it has not been achieved. Therefore, the proposed approach does not oversmooth features or delay the handling of boundaries and discontinuities until model misfit occurs. The interaction of smooth features, boundaries, and outliers is accommodated by the unified representation, making possible the perceptual organization of data in curves, surfaces, volumes, and their boundaries simultaneously. We present results on a variety of data sets to show the efficacy of the improved formalism.

A method of boundary equations for unsteady hyperbolic problems in 3D

NASA Astrophysics Data System (ADS)

Petropavlovsky, S.; Tsynkov, S.; Turkel, E.

2018-07-01

We consider interior and exterior initial boundary value problems for the three-dimensional wave (d'Alembert) equation. First, we reduce a given problem to an equivalent operator equation with respect to unknown sources defined only at the boundary of the original domain. In doing so, the Huygens' principle enables us to obtain the operator equation in a form that involves only finite and non-increasing pre-history of the solution in time. Next, we discretize the resulting boundary equation and solve it efficiently by the method of difference potentials (MDP). The overall numerical algorithm handles boundaries of general shape using regular structured grids with no deterioration of accuracy. For long simulation times it offers sub-linear complexity with respect to the grid dimension, i.e., is asymptotically cheaper than the cost of a typical explicit scheme. In addition, our algorithm allows one to share the computational cost between multiple similar problems. On multi-processor (multi-core) platforms, it benefits from what can be considered an effective parallelization in time.

EDITORIAL: The nonstationary Casimir effect and quantum systems with moving boundaries

NASA Astrophysics Data System (ADS)

Barton, Gabriel; Dodonov, Victor V.; Man'ko, Vladimir I.

2005-03-01

This topical issue of Journal of Optics B: Quantum and Semiclassical Optics contains 16 contributions devoted to quantum systems with moving boundaries. In a broad sense, the papers continue the studies opened exactly 100 years ago by Einstein in his seminal work on the electrodynamics of moving bodies and the quantum nature of light. Another jubilee which we wish to celebrate by launching this issue is the 80th anniversary of the publication of two papers, where the first solutions of the classical Maxwell equations in a one-dimensional cavity with moving boundaries were obtained, by T H Havelock (1924 Some dynamical illustrations of the pressure of radiation and of adiabatic invariance Phil. Mag. 47 754-71) and by E L Nicolai (1925 On a dynamical illustration of the pressure of radiation Phil. Mag. 49 171-7). As was shown by Einstein, studying the fluctuations of the electromagnetic field inevitably leads one to its quantum (corpuscular) nature. Many papers in this issue deal with problems where moving boundaries produce parametric excitation of vacuum fluctuations of the field, which could result in several different observable effects, like the modification of the famous Casimir force, or the creation of real quanta from the vacuum. It is worth emphasizing that these phenomena, frequently referred to as nonstationary (or dynamical) Casimir effects, are no longer the province only of pure theorists: some experimental groups have already started long-term work aimed at observing such effects in the laboratory. Of course, many difficult problems remain to be resolved before this dream becomes reality. Several papers here show both important progress in this direction, and possible difficulties still to be tackled. Problems that have been considered include, in particular, decoherence, entanglement, and the roles of geometry and polarization. Other papers deal with fundamental problems like the Unruh effect, the interaction of accelerated relativistic atoms with radiation, vacuum friction, and so on. Solutions of some interesting problems of nonrelativistic quantum mechanics with time-dependent boundary conditions, including applications to Bose-Einstein condensates, can also be found here. Since nonstationary Casimir effects can exist not only for photons but for any other quanta (e.g., phonons in solids or in liquid helium), we believe the approaches and results presented in this collection will find interesting applications in other branches of physics too. One possible example might be the generation of squeezed and other 'nonclassical' states of different fields by time-dependent boundary conditions. Approximately half the contributed papers stem from talks at two recent conferences: the First International Workshop on Problems with Moving Boundaries, organized by Professor J Dittrich in Prague in October 2003, and the International Workshop on the Dynamical Casimir Effect, organized by Professor G Carugno in Padua in June 2004. We wish to thank all the authors and reviewers for their efforts in preparing high quality papers, which we hope will attract the attention of other researchers, and especially of young people, to the fascinating areas covered by this special issue.

Variational data assimilation for limited-area models: solution of the open boundary control problem and its application for the Gulf of Finland

NASA Astrophysics Data System (ADS)

Sheloput, Tatiana; Agoshkov, Valery

2017-04-01

The problem of modeling water areas with `liquid' (open) lateral boundaries is discussed. There are different known methods dealing with open boundaries in limited-area models, and one of the most efficient is data assimilation. Although this method is popular, there are not so many articles concerning its implementation for recovering boundary functions. However, the problem of specifying boundary conditions at the open boundary of a limited area is still actual and important. The mathematical model of the Baltic Sea circulation, developed in INM RAS, is considered. It is based on the system of thermo-hydrodynamic equations in the Boussinesq and hydrostatic approximations. The splitting method that is used for time approximation in the model allows to consider the data assimilation problem as a sequence of linear problems. One of such `simple' temperature (salinity) assimilation problem is investigated in the study. Using well known techniques of study and solution of inverse problems and optimal control problems [1], we propose an iterative solution algorithm and we obtain conditions for existence of the solution, for unique and dense solvability of the problem and for convergence of the iterative algorithm. The investigation shows that if observations satisfy certain conditions, the proposed algorithm converges to the solution of the boundary control problem. Particularly, it converges when observational data are given on the `liquid' boundary [2]. Theoretical results are confirmed by the results of numerical experiments. The numerical algorithm was implemented to water area of the Baltic Sea. Two numerical experiments were carried out in the Gulf of Finland: one with the application of the assimilation procedure and the other without. The analyses have shown that the surface temperature field in the first experiment is close to the observed one, while the result of the second experiment misfits. Number of iterations depends on the regularisation parameter, but generally the algorithm converges after 10 iterations. The results of the numerical experiments show that the usage of the proposed method makes sense. The work was supported by the Russian Science Foundation (project 14-11-00609, the formulation of the iterative process and numerical experiments) and by the Russian Foundation for Basic Research (project 16-01-00548, the formulation of the problem and its study). [1] Agoshkov V. I. Methods of Optimal Control and Adjoint Equations in Problems of Mathematical Physics. INM RAS, Moscow, 2003 (in Russian). [2] Agoshkov V.I., Sheloput T.O. The study and numerical solution of the problem of heat and salinity transfer assuming 'liquid' boundaries // Russ. J. Numer. Anal. Math. Modelling. 2016. Vol. 31, No. 2. P. 71-80.

A mathematical model for computer image tracking.

PubMed

Legters, G R; Young, T Y

1982-06-01

A mathematical model using an operator formulation for a moving object in a sequence of images is presented. Time-varying translation and rotation operators are derived to describe the motion. A variational estimation algorithm is developed to track the dynamic parameters of the operators. The occlusion problem is alleviated by using a predictive Kalman filter to keep the tracking on course during severe occlusion. The tracking algorithm (variational estimation in conjunction with Kalman filter) is implemented to track moving objects with occasional occlusion in computer-simulated binary images.

Sound Generation in the Presence of Moving Surfaces with Application to Internally Generated Aircraft Engine Noise

NASA Technical Reports Server (NTRS)

Goldstein, Marvin E.; Envia, E.

2002-01-01

In many cases of technological interest solid boundaries play a direct role in the aerodynamic sound generation process and their presence often results in a large increase in the acoustic radiation. A generalized treatment of the emission of sound from moving boundaries is presented. The approach is similar to that of Ffowcs Williams and Hawkings (1969) but the effect of the surrounding mean flow is explicitly accounted for. The results are used to develop a rational framework for the prediction of internally generated aero-engine noise. The final formulas suggest some new noise sources that may be of practical significance.

Analysis of a turbulent boundary layer over a moving ground plane

NASA Technical Reports Server (NTRS)

Roper, A. T.; Gentry, G. L., Jr.

1972-01-01

Four methods of predicting the integral and friction parameters for a turbulent boundary layer over a moving ground plane were evaluated by using test information obtained in 76.2- by 50.8-centimeter tunnel. The tunnel was operated in the open sidewall configuration. These methods are (1) relative integral parameter method, (2) modified power law method, (3) relative power law method, and (4) modified law of the wall method. The modified law of the wall method predicts a more rapid decrease in skin friction with an increase in the ratio of belt velocity to free steam velocity than do methods (1) and (3).

NetFlow Dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Corbet Jr., Thomas F; Beyeler, Walter E; Vanwestrienen, Dirk

NetFlow Dynamics is a web-accessible analysis environment for simulating dynamic flows of materials on model networks. Performing a simulation requires both the NetFlow Dynamics application and a network model which is a description of the structure of the nodes and edges of a network including the flow capacity of each edge and the storage capacity of each node, and the sources and sinks of the material flowing on the network. NetFlow Dynamics consists of databases for storing network models, algorithms to calculate flows on networks, and a GIS-based graphical interface for performing simulations and viewing simulation results. Simulated flows aremore » dynamic in the sense that flows on each edge of the network and inventories at each node change with time and can be out of equilibrium with boundary conditions. Any number of network models could be simulated using Net Flow Dynamics. To date, the models simulated have been models of petroleum infrastructure. The main model has been the National Transportation Fuels Model (NTFM), a network of U.S. oil fields, transmission pipelines, rail lines, refineries, tank farms, and distribution terminals. NetFlow Dynamics supports two different flow algorithms, the Gradient Flow algorithm and the Inventory Control algorithm, that were developed specifically for the NetFlow Dynamics application. The intent is to add additional algorithms in the future as needed. The ability to select from multiple algorithms is desirable because a single algorithm never covers all analysis needs. The current algorithms use a demand-driven capacity-constrained formulation which means that the algorithms strive to use all available capacity and stored inventory to meet desired flows to sinks, subject to the capacity constraints of each network component. The current flow algorithms are best suited for problems in which a material flows on a capacity-constrained network representing a supply chain in which the material supplied can be stored at each node of the network. In the petroleum models, the flowing materials are crude oil and refined products that can be stored at tank farms, refineries, or terminals (i.e. the nodes of the network). Examples of other network models that could be simulated are currency flowing in a financial network, agricultural products moving to market, or natural gas flowing on a pipeline network.« less

Grid generation in three dimensions by Poisson equations with control of cell size and skewness at boundary surfaces

NASA Technical Reports Server (NTRS)

Sorenson, R. L.; Steger, J. L.

1983-01-01

An algorithm for generating computational grids about arbitrary three-dimensional bodies is developed. The elliptic partial differential equation (PDE) approach developed by Steger and Sorenson and used in the NASA computer program GRAPE is extended from two to three dimensions. Forcing functions which are found automatically by the algorithm give the user the ability to control mesh cell size and skewness at boundary surfaces. This algorithm, as is typical of PDE grid generators, gives smooth grid lines and spacing in the interior of the grid. The method is applied to a rectilinear wind-tunnel case and to two body shapes in spherical coordinates.

Parallel algorithms for boundary value problems

NASA Technical Reports Server (NTRS)

Lin, Avi

1990-01-01

A general approach to solve boundary value problems numerically in a parallel environment is discussed. The basic algorithm consists of two steps: the local step where all the P available processors work in parallel, and the global step where one processor solves a tridiagonal linear system of the order P. The main advantages of this approach are two fold. First, this suggested approach is very flexible, especially in the local step and thus the algorithm can be used with any number of processors and with any of the SIMD or MIMD machines. Secondly, the communication complexity is very small and thus can be used as easily with shared memory machines. Several examples for using this strategy are discussed.

Using external sensors in solution of SLAM task

NASA Astrophysics Data System (ADS)

Provkov, V. S.; Starodubtsev, I. S.

2018-05-01

This article describes the algorithms of spatial orientation of SLAM, PTAM and their positive and negative sides. Based on the SLAM method, a method that uses an RGBD camera and additional sensors was developed: an accelerometer, a gyroscope, and a magnetometer. The investigated orientation methods have their advantages when moving along a straight trajectory or when rotating a moving platform. As a result of experiments and a weighted linear combination of the positions obtained from data of the RGBD camera and the nine-axis sensor, it became possible to improve the accuracy of the original algorithm even using a constant as a weight function. In the future, it is planned to develop an algorithm for the dynamic construction of a weight function, as a result of which an increase in the accuracy of the algorithm is expected.

Searching Dynamic Agents with a Team of Mobile Robots

PubMed Central

Juliá, Miguel; Gil, Arturo; Reinoso, Oscar

2012-01-01

This paper presents a new algorithm that allows a team of robots to cooperatively search for a set of moving targets. An estimation of the areas of the environment that are more likely to hold a target agent is obtained using a grid-based Bayesian filter. The robot sensor readings and the maximum speed of the moving targets are used in order to update the grid. This representation is used in a search algorithm that commands the robots to those areas that are more likely to present target agents. This algorithm splits the environment in a tree of connected regions using dynamic programming. This tree is used in order to decide the destination for each robot in a coordinated manner. The algorithm has been successfully tested in known and unknown environments showing the validity of the approach. PMID:23012519

Searching dynamic agents with a team of mobile robots.

PubMed

Juliá, Miguel; Gil, Arturo; Reinoso, Oscar

2012-01-01

This paper presents a new algorithm that allows a team of robots to cooperatively search for a set of moving targets. An estimation of the areas of the environment that are more likely to hold a target agent is obtained using a grid-based Bayesian filter. The robot sensor readings and the maximum speed of the moving targets are used in order to update the grid. This representation is used in a search algorithm that commands the robots to those areas that are more likely to present target agents. This algorithm splits the environment in a tree of connected regions using dynamic programming. This tree is used in order to decide the destination for each robot in a coordinated manner. The algorithm has been successfully tested in known and unknown environments showing the validity of the approach.

Mixed convection boundary layer flow over a moving vertical flat plate in an external fluid flow with viscous dissipation effect.

PubMed

Bachok, Norfifah; Ishak, Anuar; Pop, Ioan

2013-01-01

The steady boundary layer flow of a viscous and incompressible fluid over a moving vertical flat plate in an external moving fluid with viscous dissipation is theoretically investigated. Using appropriate similarity variables, the governing system of partial differential equations is transformed into a system of ordinary (similarity) differential equations, which is then solved numerically using a Maple software. Results for the skin friction or shear stress coefficient, local Nusselt number, velocity and temperature profiles are presented for different values of the governing parameters. It is found that the set of the similarity equations has unique solutions, dual solutions or no solutions, depending on the values of the mixed convection parameter, the velocity ratio parameter and the Eckert number. The Eckert number significantly affects the surface shear stress as well as the heat transfer rate at the surface.

Slip effects on MHD flow and heat transfer of ferrofluids over a moving flat plate

NASA Astrophysics Data System (ADS)

Ramli, Norshafira; Ahmad, Syakila; Pop, Ioan

2017-08-01

In this study, the problem of MHD flow and heat transfer of ferrofluids over a moving flat plate with slip effect and uniform heat flux is considered. The governing ordinary differential equations are solved via shooting method. The effect of slip parameter on the dimensionless velocity, temperature, skin friction and Nusselt numbers are numerically studied for the three selected ferroparticles; magnetite (Fe3O4), cobalt ferrite (CoFe2O4) and Mn-Zn ferrite (Mn-ZnFe2O4) with water-based fluid. The results indicate that dual solutions exist for a plate moving towards the origin. It is found that the slip process delays the boundary layer separation. Moreover, the velocity and thermal boundary-layer thicknesses decrease in the first solution while increase with the increase of the value of slip parameters in second solution.

Slip-mediated dewetting of polymer microdroplets

PubMed Central

McGraw, Joshua D.; Chan, Tak Shing; Maurer, Simon; Salez, Thomas; Benzaquen, Michael; Raphaël, Elie; Brinkmann, Martin; Jacobs, Karin

2016-01-01

Classical hydrodynamic models predict that infinite work is required to move a three-phase contact line, defined here as the line where a liquid/vapor interface intersects a solid surface. Assuming a slip boundary condition, in which the liquid slides against the solid, such an unphysical prediction is avoided. In this article, we present the results of experiments in which a contact line moves and where slip is a dominating and controllable factor. Spherical cap-shaped polystyrene microdroplets, with nonequilibrium contact angle, are placed on solid self-assembled monolayer coatings from which they dewet. The relaxation is monitored using in situ atomic force microscopy. We find that slip has a strong influence on the droplet evolutions, both on the transient nonspherical shapes and contact line dynamics. The observations are in agreement with scaling analysis and boundary element numerical integration of the governing Stokes equations, including a Navier slip boundary condition. PMID:26787903

An Adjoint-Based Approach to Study a Flexible Flapping Wing in Pitching-Rolling Motion

NASA Astrophysics Data System (ADS)

Jia, Kun; Wei, Mingjun; Xu, Min; Li, Chengyu; Dong, Haibo

2017-11-01

Flapping-wing aerodynamics, with advantages in agility, efficiency, and hovering capability, has been the choice of many flyers in nature. However, the study of bio-inspired flapping-wing propulsion is often hindered by the problem's large control space with different wing kinematics and deformation. The adjoint-based approach reduces largely the computational cost to a feasible level by solving an inverse problem. Facing the complication from moving boundaries, non-cylindrical calculus provides an easy extension of traditional adjoint-based approach to handle the optimization involving moving boundaries. The improved adjoint method with non-cylindrical calculus for boundary treatment is first applied on a rigid pitching-rolling plate, then extended to a flexible one with active deformation to further increase its propulsion efficiency. The comparison of flow dynamics with the initial and optimal kinematics and deformation provides a unique opportunity to understand the flapping-wing mechanism. Supported by AFOSR and ARL.

Robust object tacking based on self-adaptive search area

NASA Astrophysics Data System (ADS)

Dong, Taihang; Zhong, Sheng

2018-02-01

Discriminative correlation filter (DCF) based trackers have recently achieved excellent performance with great computational efficiency. However, DCF based trackers suffer boundary effects, which result in the unstable performance in challenging situations exhibiting fast motion. In this paper, we propose a novel method to mitigate this side-effect in DCF based trackers. We change the search area according to the prediction of target motion. When the object moves fast, broad search area could alleviate boundary effects and reserve the probability of locating object. When the object moves slowly, narrow search area could prevent effect of useless background information and improve computational efficiency to attain real-time performance. This strategy can impressively soothe boundary effects in situations exhibiting fast motion and motion blur, and it can be used in almost all DCF based trackers. The experiments on OTB benchmark show that the proposed framework improves the performance compared with the baseline trackers.

Dynamic expression of a Hydra FGF at boundaries and termini.

PubMed

Lange, Ellen; Bertrand, Stephanie; Holz, Oliver; Rebscher, Nicole; Hassel, Monika

2014-12-01

Guidance of cells and tissue sheets is an essential function in developing and differentiating animal tissues. In Hydra, where cells and tissue move dynamically due to constant cell proliferation towards the termini or into lateral, vegetative buds, factors essential for guidance are still unknown. Good candidates to take over this function are fibroblast growth factors (FGFs). We present the phylogeny of several Hydra FGFs and analysis of their expression patterns. One of the FGFs is expressed in all terminal regions targeted by tissue movement and at boundaries crossed by moving tissue and cells with an expression pattern slightly differing in two Hydra strains. A model addressing an involvement of this FGF in cell movement and morphogenesis is proposed: Hydra FGFf-expressing cells might serve as sources to attract tissue and cells towards the termini of the body column and across morphological boundaries. Moreover, a function in morphogenesis and/or differentiation of cells and tissue is suggested.

Detrending moving average algorithm for multifractals

NASA Astrophysics Data System (ADS)

Gu, Gao-Feng; Zhou, Wei-Xing

2010-07-01

The detrending moving average (DMA) algorithm is a widely used technique to quantify the long-term correlations of nonstationary time series and the long-range correlations of fractal surfaces, which contains a parameter θ determining the position of the detrending window. We develop multifractal detrending moving average (MFDMA) algorithms for the analysis of one-dimensional multifractal measures and higher-dimensional multifractals, which is a generalization of the DMA method. The performance of the one-dimensional and two-dimensional MFDMA methods is investigated using synthetic multifractal measures with analytical solutions for backward (θ=0) , centered (θ=0.5) , and forward (θ=1) detrending windows. We find that the estimated multifractal scaling exponent τ(q) and the singularity spectrum f(α) are in good agreement with the theoretical values. In addition, the backward MFDMA method has the best performance, which provides the most accurate estimates of the scaling exponents with lowest error bars, while the centered MFDMA method has the worse performance. It is found that the backward MFDMA algorithm also outperforms the multifractal detrended fluctuation analysis. The one-dimensional backward MFDMA method is applied to analyzing the time series of Shanghai Stock Exchange Composite Index and its multifractal nature is confirmed.

Space moving target detection and tracking method in complex background

NASA Astrophysics Data System (ADS)

Lv, Ping-Yue; Sun, Sheng-Li; Lin, Chang-Qing; Liu, Gao-Rui

2018-06-01

The background of the space-borne detectors in real space-based environment is extremely complex and the signal-to-clutter ratio is very low (SCR ≈ 1), which increases the difficulty for detecting space moving targets. In order to solve this problem, an algorithm combining background suppression processing based on two-dimensional least mean square filter (TDLMS) and target enhancement based on neighborhood gray-scale difference (GSD) is proposed in this paper. The latter can filter out most of the residual background clutter processed by the former such as cloud edge. Through this procedure, both global and local SCR have obtained substantial improvement, indicating that the target has been greatly enhanced. After removing the detector's inherent clutter region through connected domain processing, the image only contains the target point and the isolated noise, in which the isolated noise could be filtered out effectively through multi-frame association. The proposed algorithm in this paper has been compared with some state-of-the-art algorithms for moving target detection and tracking tasks. The experimental results show that the performance of this algorithm is the best in terms of SCR gain, background suppression factor (BSF) and detection results.

Boundary Recovery For Delaunay Tetrahedral Meshes Using Local Topological Transformations

PubMed Central

Ghadyani, Hamid; Sullivan, John; Wu, Ziji

2009-01-01

Numerous high-quality, volume mesh-generation systems exist. However, no strategy can address all geometry situations without some element qualities being compromised. Many 3D mesh generation algorithms are based on Delaunay tetrahedralization which frequently fails to preserve the input boundary surface topology. For biomedical applications, this surface preservation can be critical as they usually contain multiple material regions of interest coherently connected. In this paper we present an algorithm as a post-processing method that optimizes local regions of compromised element quality and recovers the original boundary surface facets (triangles) regardless of the original mesh generation strategy. The algorithm carves out a small sub-volume in the vicinity of the missing boundary facet or compromised element, creating a cavity. If the task is to recover a surface boundary facet, a natural exit hole in the cavity will be present. This hole is patched with the missing boundary surface face first followed by other patches to seal the cavity. If the task was to improve a compromised region, then the cavity is already sealed. Every triangular facet of the cavity shell is classified as an active face and can be connected to another shell node creating a tetrahedron. In the process the base of the tetrahedron is removed from the active face list and potentially 3 new active faces are created. This methodology is the underpinnings of our last resort method. Each active face can be viewed as the trunk of a tree. An exhaustive breath and depth search will identify all possible tetrahedral combinations to uniquely fill the cavity. We have streamlined this recursive process reducing the time complexity by orders of magnitude. The original surfaces boundaries (internal and external) are fully restored and the quality of compromised regions improved. PMID:20305743

Lymph node segmentation by dynamic programming and active contours.

PubMed

Tan, Yongqiang; Lu, Lin; Bonde, Apurva; Wang, Deling; Qi, Jing; Schwartz, Lawrence H; Zhao, Binsheng

2018-03-03

Enlarged lymph nodes are indicators of cancer staging, and the change in their size is a reflection of treatment response. Automatic lymph node segmentation is challenging, as the boundary can be unclear and the surrounding structures complex. This work communicates a new three-dimensional algorithm for the segmentation of enlarged lymph nodes. The algorithm requires a user to draw a region of interest (ROI) enclosing the lymph node. Rays are cast from the center of the ROI, and the intersections of the rays and the boundary of the lymph node form a triangle mesh. The intersection points are determined by dynamic programming. The triangle mesh initializes an active contour which evolves to low-energy boundary. Three radiologists independently delineated the contours of 54 lesions from 48 patients. Dice coefficient was used to evaluate the algorithm's performance. The mean Dice coefficient between computer and the majority vote results was 83.2%. The mean Dice coefficients between the three radiologists' manual segmentations were 84.6%, 86.2%, and 88.3%. The performance of this segmentation algorithm suggests its potential clinical value for quantifying enlarged lymph nodes. © 2018 American Association of Physicists in Medicine.

Quantified moving average strategy of crude oil futures market based on fuzzy logic rules and genetic algorithms

NASA Astrophysics Data System (ADS)

Liu, Xiaojia; An, Haizhong; Wang, Lijun; Guan, Qing

2017-09-01

The moving average strategy is a technical indicator that can generate trading signals to assist investment. While the trading signals tell the traders timing to buy or sell, the moving average cannot tell the trading volume, which is a crucial factor for investment. This paper proposes a fuzzy moving average strategy, in which the fuzzy logic rule is used to determine the strength of trading signals, i.e., the trading volume. To compose one fuzzy logic rule, we use four types of moving averages, the length of the moving average period, the fuzzy extent, and the recommend value. Ten fuzzy logic rules form a fuzzy set, which generates a rating level that decides the trading volume. In this process, we apply genetic algorithms to identify an optimal fuzzy logic rule set and utilize crude oil futures prices from the New York Mercantile Exchange (NYMEX) as the experiment data. Each experiment is repeated for 20 times. The results show that firstly the fuzzy moving average strategy can obtain a more stable rate of return than the moving average strategies. Secondly, holding amounts series is highly sensitive to price series. Thirdly, simple moving average methods are more efficient. Lastly, the fuzzy extents of extremely low, high, and very high are more popular. These results are helpful in investment decisions.

Robust mobility in human-populated environments

NASA Astrophysics Data System (ADS)

Gonzalez, Juan Pablo; Phillips, Mike; Neuman, Brad; Likhachev, Max

2012-06-01

Creating robots that can help humans in a variety of tasks requires robust mobility and the ability to safely navigate among moving obstacles. This paper presents an overview of recent research in the Robotics Collaborative Technology Alliance (RCTA) that addresses many of the core requirements for robust mobility in human-populated environments. Safe Interval Path Planning (SIPP) allows for very fast planning in dynamic environments when planning timeminimal trajectories. Generalized Safe Interval Path Planning extends this concept to trajectories that minimize arbitrary cost functions. Finally, generalized PPCP algorithm is used to generate plans that reason about the uncertainty in the predicted trajectories of moving obstacles and try to actively disambiguate the intentions of humans whenever necessary. We show how these approaches consider moving obstacles and temporal constraints and produce high-fidelity paths. Experiments in simulated environments show the performance of the algorithms under different controlled conditions, and experiments on physical mobile robots interacting with humans show how the algorithms perform under the uncertainties of the real world.

Computation of multi-dimensional viscous supersonic jet flow

NASA Technical Reports Server (NTRS)

Kim, Y. N.; Buggeln, R. C.; Mcdonald, H.

1986-01-01

A new method has been developed for two- and three-dimensional computations of viscous supersonic flows with embedded subsonic regions adjacent to solid boundaries. The approach employs a reduced form of the Navier-Stokes equations which allows solution as an initial-boundary value problem in space, using an efficient noniterative forward marching algorithm. Numerical instability associated with forward marching algorithms for flows with embedded subsonic regions is avoided by approximation of the reduced form of the Navier-Stokes equations in the subsonic regions of the boundary layers. Supersonic and subsonic portions of the flow field are simultaneously calculated by a consistently split linearized block implicit computational algorithm. The results of computations for a series of test cases relevant to internal supersonic flow is presented and compared with data. Comparison between data and computation are in general excellent thus indicating that the computational technique has great promise as a tool for calculating supersonic flow with embedded subsonic regions. Finally, a User's Manual is presented for the computer code used to perform the calculations.

On-line Model Structure Selection for Estimation of Plasma Boundary in a Tokamak

NASA Astrophysics Data System (ADS)

Škvára, Vít; Šmídl, Václav; Urban, Jakub

2015-11-01

Control of the plasma field in the tokamak requires reliable estimation of the plasma boundary. The plasma boundary is given by a complex mathematical model and the only available measurements are responses of induction coils around the plasma. For the purpose of boundary estimation the model can be reduced to simple linear regression with potentially infinitely many elements. The number of elements must be selected manually and this choice significantly influences the resulting shape. In this paper, we investigate the use of formal model structure estimation techniques for the problem. Specifically, we formulate a sparse least squares estimator using the automatic relevance principle. The resulting algorithm is a repetitive evaluation of the least squares problem which could be computed in real time. Performance of the resulting algorithm is illustrated on simulated data and evaluated with respect to a more detailed and computationally costly model FREEBIE.

27 CFR 9.126 - Santa Clara Valley.

Code of Federal Regulations, 2014 CFR

2014-04-01

...: (1) The beginning point is at the junction of Elephant Head Creek and Pacheco Creek (approx. .75 mile... point the boundary moves in a northerly direction up Elephant Head Creek approx. 1.2 miles until it....G.S. map; (29) Then it moves northeast along Pacheco Creek approx. .5 mile to Elephant Head Creek at...

27 CFR 9.126 - Santa Clara Valley.

Code of Federal Regulations, 2013 CFR

2013-04-01

...: (1) The beginning point is at the junction of Elephant Head Creek and Pacheco Creek (approx. .75 mile... point the boundary moves in a northerly direction up Elephant Head Creek approx. 1.2 miles until it....G.S. map; (29) Then it moves northeast along Pacheco Creek approx. .5 mile to Elephant Head Creek at...

27 CFR 9.126 - Santa Clara Valley.

Code of Federal Regulations, 2010 CFR

2010-04-01

...: (1) The beginning point is at the junction of Elephant Head Creek and Pacheco Creek (approx. .75 mile... point the boundary moves in a northerly direction up Elephant Head Creek approx. 1.2 miles until it....G.S. map; (29) Then it moves northeast along Pacheco Creek approx. .5 mile to Elephant Head Creek at...

27 CFR 9.126 - Santa Clara Valley.

Code of Federal Regulations, 2012 CFR

2012-04-01

...: (1) The beginning point is at the junction of Elephant Head Creek and Pacheco Creek (approx. .75 mile... point the boundary moves in a northerly direction up Elephant Head Creek approx. 1.2 miles until it....G.S. map; (29) Then it moves northeast along Pacheco Creek approx. .5 mile to Elephant Head Creek at...

27 CFR 9.126 - Santa Clara Valley.

Code of Federal Regulations, 2011 CFR

2011-04-01

...: (1) The beginning point is at the junction of Elephant Head Creek and Pacheco Creek (approx. .75 mile... point the boundary moves in a northerly direction up Elephant Head Creek approx. 1.2 miles until it....G.S. map; (29) Then it moves northeast along Pacheco Creek approx. .5 mile to Elephant Head Creek at...

Terrestrial-style slow-moving earthflow kinematics in a submarine landslide complex

Treesearch

Joshu J. Mountjoy; Jim McKean; Philip M. Barnes; Jarg R. Pettinga

2009-01-01

Morphometric analysis of Simrad EM300 multibeam bathymetric DEMs reveals details of deformation patterns in a ~145 km2 submarine landslide complex that are commonly associated with slow-moving earthflows in terrestrial settings. This mode of failure, where existing landslide debris is remobilised repeatedly along discrete shear boundaries and is...

Linear and nonlinear stability of periodic orbits in annular billiards.

PubMed

Dettmann, Carl P; Fain, Vitaly

2017-04-01

An annular billiard is a dynamical system in which a particle moves freely in a disk except for elastic collisions with the boundary and also a circular scatterer in the interior of the disk. We investigate the stability properties of some periodic orbits in annular billiards in which the scatterer is touching or close to the boundary. We analytically show that there exist linearly stable periodic orbits of an arbitrary period for scatterers with decreasing radii that are located near the boundary of the disk. As the position of the scatterer moves away from a symmetry line of a periodic orbit, the stability of periodic orbits changes from elliptic to hyperbolic, corresponding to a saddle-center bifurcation. When the scatterer is tangent to the boundary, the periodic orbit is parabolic. We prove that slightly changing the reflection angle of the orbit in the tangential situation leads to the existence of Kolmogorov-Arnold-Moser islands. Thus, we show that there exists a decreasing to zero sequence of open intervals of scatterer radii, along which the billiard table is not ergodic.

Linear and nonlinear stability of periodic orbits in annular billiards

NASA Astrophysics Data System (ADS)

Dettmann, Carl P.; Fain, Vitaly

2017-04-01

An annular billiard is a dynamical system in which a particle moves freely in a disk except for elastic collisions with the boundary and also a circular scatterer in the interior of the disk. We investigate the stability properties of some periodic orbits in annular billiards in which the scatterer is touching or close to the boundary. We analytically show that there exist linearly stable periodic orbits of an arbitrary period for scatterers with decreasing radii that are located near the boundary of the disk. As the position of the scatterer moves away from a symmetry line of a periodic orbit, the stability of periodic orbits changes from elliptic to hyperbolic, corresponding to a saddle-center bifurcation. When the scatterer is tangent to the boundary, the periodic orbit is parabolic. We prove that slightly changing the reflection angle of the orbit in the tangential situation leads to the existence of Kolmogorov-Arnold-Moser islands. Thus, we show that there exists a decreasing to zero sequence of open intervals of scatterer radii, along which the billiard table is not ergodic.

Relationship research between meteorological disasters and stock markets based on a multifractal detrending moving average algorithm

NASA Astrophysics Data System (ADS)

Li, Qingchen; Cao, Guangxi; Xu, Wei

2018-01-01

Based on a multifractal detrending moving average algorithm (MFDMA), this study uses the fractionally autoregressive integrated moving average process (ARFIMA) to demonstrate the effectiveness of MFDMA in the detection of auto-correlation at different sample lengths and to simulate some artificial time series with the same length as the actual sample interval. We analyze the effect of predictable and unpredictable meteorological disasters on the US and Chinese stock markets and the degree of long memory in different sectors. Furthermore, we conduct a preliminary investigation to determine whether the fluctuations of financial markets caused by meteorological disasters are derived from the normal evolution of the financial system itself or not. We also propose several reasonable recommendations.

The Optimization of Automatically Generated Compilers.

DTIC Science & Technology

1987-01-01

than their procedural counterparts, and are also easier to analyze for storage optimizations; (2) AGs can be algorithmically checked to be non-circular...Providing algorithms to move the storage for many attributes from the For structure tree into global stacks and variables. -Dd(2) Creating AEs which build and...54 3.5.2. Partitioning algorithm

SOSS User Guide

NASA Technical Reports Server (NTRS)

Zhu, Zhifan; Gridnev, Sergei; Windhorst, Robert D.

2015-01-01

This User Guide describes SOSS (Surface Operations Simulator and Scheduler) software build and graphic user interface. SOSS is a desktop application that simulates airport surface operations in fast time using traffic management algorithms. It moves aircraft on the airport surface based on information provided by scheduling algorithm prototypes, monitors separation violation and scheduling conformance, and produces scheduling algorithm performance data.

Algorithm and code development for unsteady three-dimensional Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Obayashi, Shigeru

1991-01-01

A streamwise upwind algorithm for solving the unsteady 3-D Navier-Stokes equations was extended to handle the moving grid system. It is noted that the finite volume concept is essential to extend the algorithm. The resulting algorithm is conservative for any motion of the coordinate system. Two extensions to an implicit method were considered and the implicit extension that makes the algorithm computationally efficient is implemented into Ames's aeroelasticity code, ENSAERO. The new flow solver has been validated through the solution of test problems. Test cases include three-dimensional problems with fixed and moving grids. The first test case shown is an unsteady viscous flow over an F-5 wing, while the second test considers the motion of the leading edge vortex as well as the motion of the shock wave for a clipped delta wing. The resulting algorithm has been implemented into ENSAERO. The upwind version leads to higher accuracy in both steady and unsteady computations than the previously used central-difference method does, while the increase in the computational time is small.

Improved Boundary Layer Depth Retrievals from MPLNET

NASA Technical Reports Server (NTRS)

Lewis, Jasper R.; Welton, Ellsworth J.; Molod, Andrea M.; Joseph, Everette

2013-01-01

Continuous lidar observations of the planetary boundary layer (PBL) depth have been made at the Micropulse Lidar Network (MPLNET) site in Greenbelt, MD since April 2001. However, because of issues with the operational PBL depth algorithm, the data is not reliable for determining seasonal and diurnal trends. Therefore, an improved PBL depth algorithm has been developed which uses a combination of the wavelet technique and image processing. The new algorithm is less susceptible to contamination by clouds and residual layers, and in general, produces lower PBL depths. A 2010 comparison shows the operational algorithm overestimates the daily mean PBL depth when compared to the improved algorithm (1.85 and 1.07 km, respectively). The improved MPLNET PBL depths are validated using radiosonde comparisons which suggests the algorithm performs well to determine the depth of a fully developed PBL. A comparison with the Goddard Earth Observing System-version 5 (GEOS-5) model suggests that the model may underestimate the maximum daytime PBL depth by 410 m during the spring and summer. The best agreement between MPLNET and GEOS-5 occurred during the fall and they diered the most in the winter.

Experimental investigation of moving surfaces for boundary layer and circulation control of airfoils and wings

NASA Astrophysics Data System (ADS)

Vets, Robert

An experimental study was conducted to assess the application of a moving surface to affect boundary layers and circulation around airfoils for the purpose of altering and enhancing aerodynamic performance of finite wings at moderate Reynolds numbers. The moving surface was established by a wide, lightweight, nylon belt that enveloped a wing's symmetric airfoil profile articulated via a friction drive cylinder such that the direction of the upper surface was in the direction of the free stream. A water tunnel visualization study accompanied wind tunnel testing at the University of Washington, Kirsten Wind Tunnel of finite wings. An experimental study was conducted to assess the application of a moving surface to affect boundary layers and circulation around airfoils for the purpose of altering and enhancing aerodynamic performance of finite wings at moderate Reynolds numbers. The moving surface was established by a wide, lightweight, nylon belt that enveloped a wing's symmetric airfoil profile articulated via a friction drive cylinder such that the direction of the upper surface was in the direction of the free stream. A water tunnel visualization study accompanied wind tunnel testing at the University of Washington, Kirsten Wind Tunnel of finite wings. The defining non-dimensional parameter for the system is the ratio of the surface velocity to the free stream velocity, us/Uo. Results show a general increase in lift with increasing us/Uo. The endurance parameter served as an additional metric for the system's performance. Examining the results of the endurance parameter shows general increase in endurance and lift with the moving surface activated. Peak performance in terms of increased endurance along with increased lift occurs at or slightly above us/Uo = 1. Water tunnel visualization showed a marked difference in the downwash for velocity ratios greater than 1, supporting the measured data. Reynolds numbers for this investigation were 1.9E5 and 4.3E5, relevant to the class of fixed wing, Tier-1, Unmanned Aerial Vehicles (UAV).

A moving control volume approach to computing hydrodynamic forces and torques on immersed bodies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nangia, Nishant; Johansen, Hans; Patankar, Neelesh A.

Here, we present a moving control volume (CV) approach to computing hydrodynamic forces and torques on complex geometries. The method requires surface and volumetric integrals over a simple and regular Cartesian box that moves with an arbitrary velocity to enclose the body at all times. The moving box is aligned with Cartesian grid faces, which makes the integral evaluation straightforward in an immersed boundary (IB) framework. Discontinuous and noisy derivatives of velocity and pressure at the fluid–structure interface are avoided and far-field (smooth) velo city and pressure information is used. We re-visit the approach to compute hydrodynamic forces and torquesmore » through force/torque balance equations in a Lagrangian frame that some of us took in a prior work (Bhalla et al., 2013 [13]). We prove the equivalence of the two approaches for IB methods, thanks to the use of Peskin's delta functions. Both approaches are able to suppress spurious force oscillations and are in excellent agreement, as expected theoretically. Test cases ranging from Stokes to high Reynolds number regimes are considered. We discuss regridding issues for the moving CV method in an adaptive mesh refinement (AMR) context. The proposed moving CV method is not limited to a specific IB method and can also be used, for example, with embedded boundary methods.« less

A moving control volume approach to computing hydrodynamic forces and torques on immersed bodies

DOE PAGES

Nangia, Nishant; Johansen, Hans; Patankar, Neelesh A.; ...

2017-10-01

Here, we present a moving control volume (CV) approach to computing hydrodynamic forces and torques on complex geometries. The method requires surface and volumetric integrals over a simple and regular Cartesian box that moves with an arbitrary velocity to enclose the body at all times. The moving box is aligned with Cartesian grid faces, which makes the integral evaluation straightforward in an immersed boundary (IB) framework. Discontinuous and noisy derivatives of velocity and pressure at the fluid–structure interface are avoided and far-field (smooth) velo city and pressure information is used. We re-visit the approach to compute hydrodynamic forces and torquesmore » through force/torque balance equations in a Lagrangian frame that some of us took in a prior work (Bhalla et al., 2013 [13]). We prove the equivalence of the two approaches for IB methods, thanks to the use of Peskin's delta functions. Both approaches are able to suppress spurious force oscillations and are in excellent agreement, as expected theoretically. Test cases ranging from Stokes to high Reynolds number regimes are considered. We discuss regridding issues for the moving CV method in an adaptive mesh refinement (AMR) context. The proposed moving CV method is not limited to a specific IB method and can also be used, for example, with embedded boundary methods.« less

A comparison between anisotropic analytical and multigrid superposition dose calculation algorithms in radiotherapy treatment planning

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Vincent W.C., E-mail: htvinwu@polyu.edu.hk; Tse, Teddy K.H.; Ho, Cola L.M.

2013-07-01

Monte Carlo (MC) simulation is currently the most accurate dose calculation algorithm in radiotherapy planning but requires relatively long processing time. Faster model-based algorithms such as the anisotropic analytical algorithm (AAA) by the Eclipse treatment planning system and multigrid superposition (MGS) by the XiO treatment planning system are 2 commonly used algorithms. This study compared AAA and MGS against MC, as the gold standard, on brain, nasopharynx, lung, and prostate cancer patients. Computed tomography of 6 patients of each cancer type was used. The same hypothetical treatment plan using the same machine and treatment prescription was computed for each casemore » by each planning system using their respective dose calculation algorithm. The doses at reference points including (1) soft tissues only, (2) bones only, (3) air cavities only, (4) soft tissue-bone boundary (Soft/Bone), (5) soft tissue-air boundary (Soft/Air), and (6) bone-air boundary (Bone/Air), were measured and compared using the mean absolute percentage error (MAPE), which was a function of the percentage dose deviations from MC. Besides, the computation time of each treatment plan was recorded and compared. The MAPEs of MGS were significantly lower than AAA in all types of cancers (p<0.001). With regards to body density combinations, the MAPE of AAA ranged from 1.8% (soft tissue) to 4.9% (Bone/Air), whereas that of MGS from 1.6% (air cavities) to 2.9% (Soft/Bone). The MAPEs of MGS (2.6%±2.1) were significantly lower than that of AAA (3.7%±2.5) in all tissue density combinations (p<0.001). The mean computation time of AAA for all treatment plans was significantly lower than that of the MGS (p<0.001). Both AAA and MGS algorithms demonstrated dose deviations of less than 4.0% in most clinical cases and their performance was better in homogeneous tissues than at tissue boundaries. In general, MGS demonstrated relatively smaller dose deviations than AAA but required longer computation time.« less

Unsteady solute-transport simulation in streamflow using a finite-difference model

USGS Publications Warehouse

Land, Larry F.

1978-01-01

This report documents a rather simple, general purpose, one-dimensional, one-parameter, mass-transport model for field use. The model assumes a well-mixed conservative solute that may be coming from an unsteady source and is moving in unsteady streamflow. The quantity of solute being transported is in the units of concentration. Results are reported as such. An implicit finite-difference technique is used to solve the mass transport equation. It consists of creating a tridiagonal matrix and using the Thomas algorithm to solve the matrix for the unknown concentrations at the new time step. The computer program pesented is designed to compute the concentration of a water-quality constituent at any point and at any preselected time in a one-dimensional stream. The model is driven by the inflowing concentration of solute at the upstream boundary and is influenced by the solute entering the stream from tributaries and lateral ground-water inflow and from a source or sink. (Woodard-USGS)

Launch flexibility using NLP guidance and remote wind sensing

NASA Technical Reports Server (NTRS)

Cramer, Evin J.; Bradt, Jerre E.; Hardtla, John W.

1990-01-01

This paper examines the use of lidar wind measurements in the implementation of a guidance strategy for a nonlinear programming (NLP) launch guidance algorithm. The NLP algorithm uses B-spline command function representation for flexibility in the design of the guidance steering commands. Using this algorithm, the guidance system solves a two-point boundary value problem at each guidance update. The specification of different boundary value problems at each guidance update provides flexibility that can be used in the design of the guidance strategy. The algorithm can use lidar wind measurements for on pad guidance retargeting and for load limiting guidance steering commands. Examples presented in the paper use simulated wind updates to correct wind induced final orbit errors and to adjust the guidance steering commands to limit the product of the dynamic pressure and angle-of-attack for launch vehicle load alleviation.

Fast and accurate metrology of multi-layered ceramic materials by an automated boundary detection algorithm developed for optical coherence tomography data

PubMed Central

Ekberg, Peter; Su, Rong; Chang, Ernest W.; Yun, Seok Hyun; Mattsson, Lars

2014-01-01

Optical coherence tomography (OCT) is useful for materials defect analysis and inspection with the additional possibility of quantitative dimensional metrology. Here, we present an automated image-processing algorithm for OCT analysis of roll-to-roll multilayers in 3D manufacturing of advanced ceramics. It has the advantage of avoiding filtering and preset modeling, and will, thus, introduce a simplification. The algorithm is validated for its capability of measuring the thickness of ceramic layers, extracting the boundaries of embedded features with irregular shapes, and detecting the geometric deformations. The accuracy of the algorithm is very high, and the reliability is better than 1 µm when evaluating with the OCT images using the same gauge block step height reference. The method may be suitable for industrial applications to the rapid inspection of manufactured samples with high accuracy and robustness. PMID:24562018

Novel lidar algorithms for atmospheric slantrange visibility, planetary boundary layer height, meteorogical phenomena and atmospheric layering measurements

NASA Astrophysics Data System (ADS)

Pantazis, Alexandros; Papayannis, Alexandros; Georgoussis, Georgios

2018-04-01

In this paper we present a development of novel algorithms and techniques implemented within the Laser Remote Sensing Laboratory (LRSL) of the National Technical University of Athens (NTUA), in collaboration with Raymetrics S.A., in order to incorporate them into a 3-Dimensional (3D) lidar. The lidar is transmitting at 355 nm in the eye safe region and the measurements then are transposed to the visual range at 550 nm, according to the World Meteorological Organization (WMO) and the International Civil Aviation Organization (ICAO) rules of daytime visibility. These algorithms are able to provide horizontal, slant and vertical visibility for tower aircraft controllers, meteorologists, but also from pilot's point of view. Other algorithms are also provided for detection of atmospheric layering in any given direction and vertical angle, along with the detection of the Planetary Boundary Layer Height (PBLH).

[Delimitation of urban growth boundary based on ecological suitability and risk control: A case of Taibai Lake New District in Jining City, Shandong, China.

PubMed

Liu, Yan Xu; Peng, Jian; Sun, Mao Long; Yang, Yang

2016-08-01

Urban growth boundary, with full consideration of regional ecological constraints, can effectively control the unordered urban sprawl. Thus, urban growth boundary is a significant planning concept integrating regional ecological protection and urban construction. Finding the preferential position for urban construction, as well as controlling the ecological risk, has always been the core content of urban growth boundary delimitation. This study selected Taibai Lake New District in Jining City as a case area, and analyzed the scenario of ecological suitability by ordered weighted ave-raging algorithm. Surface temperature retrieval and rain flooding simulation were used to identify the spatial ecological risk. In the result of ecological suitability, the suitable construction zone accounted for 25.3% of the total area, the unsuitable construction zone accounted for 20.4%, and the other area was in the limit construction zone. Excluding the ecological risk control region, the flexible urban growth boundary covered 2975 hm 2 in near term, and covered 6754 hm 2 in long term. The final inflexible urban growth boundary covered 9405 hm 2 . As a new method, the scenario algorithms of ordered weighted averaging and ecological risk modeling could provide effective support in urban growth boundary identification.

SLIC superpixels compared to state-of-the-art superpixel methods.

PubMed

Achanta, Radhakrishna; Shaji, Appu; Smith, Kevin; Lucchi, Aurelien; Fua, Pascal; Süsstrunk, Sabine

2012-11-01

Computer vision applications have come to rely increasingly on superpixels in recent years, but it is not always clear what constitutes a good superpixel algorithm. In an effort to understand the benefits and drawbacks of existing methods, we empirically compare five state-of-the-art superpixel algorithms for their ability to adhere to image boundaries, speed, memory efficiency, and their impact on segmentation performance. We then introduce a new superpixel algorithm, simple linear iterative clustering (SLIC), which adapts a k-means clustering approach to efficiently generate superpixels. Despite its simplicity, SLIC adheres to boundaries as well as or better than previous methods. At the same time, it is faster and more memory efficient, improves segmentation performance, and is straightforward to extend to supervoxel generation.

A Noniterative Technique for the Direct Implementation of Well Bore Boundary Conditions in Three-Dimensional Heterogeneous Formations

NASA Astrophysics Data System (ADS)

Sudicky, E. A.; Unger, A. J. A.; Lacombe, S.

1995-02-01

A noniterative algorithm for handling prescribed well bore boundary conditions while pumping or injecting fluid in a three-dimensional heterogeneous aquifer is described. The algorithm is formulated by superimposing conductive one-dimensional line elements representing the well screen onto the three-dimensional matrix elements epresenting the aquifer. Storage in the well casing is also naturally accommodated by the superposition of the line elements. The numerical algorithm is verified by comparison with results obtained from the solution of Papadopulos and Cooper (1967). A large-scale example problem involving groundwater extraction from a partially penetrating pumping well located in a highly heterogeneous confined aquifer is presented to demonstrate the utility of the approach.

Unified anomaly suppression and boundary extraction in laser radar range imagery based on a joint curve-evolution and expectation-maximization algorithm.

PubMed

Feng, Haihua; Karl, William Clem; Castañon, David A

2008-05-01

In this paper, we develop a new unified approach for laser radar range anomaly suppression, range profiling, and segmentation. This approach combines an object-based hybrid scene model for representing the range distribution of the field and a statistical mixture model for the range data measurement noise. The image segmentation problem is formulated as a minimization problem which jointly estimates the target boundary together with the target region range variation and background range variation directly from the noisy and anomaly-filled range data. This formulation allows direct incorporation of prior information concerning the target boundary, target ranges, and background ranges into an optimal reconstruction process. Curve evolution techniques and a generalized expectation-maximization algorithm are jointly employed as an efficient solver for minimizing the objective energy, resulting in a coupled pair of object and intensity optimization tasks. The method directly and optimally extracts the target boundary, avoiding a suboptimal two-step process involving image smoothing followed by boundary extraction. Experiments are presented demonstrating that the proposed approach is robust to anomalous pixels (missing data) and capable of producing accurate estimation of the target boundary and range values from noisy data.

Compressible Fluids Interacting with a Linear-Elastic Shell

NASA Astrophysics Data System (ADS)

Breit, Dominic; Schwarzacher, Sebastian

2018-05-01

We study the Navier-Stokes equations governing the motion of an isentropic compressible fluid in three dimensions interacting with a flexible shell of Koiter type. The latter one constitutes a moving part of the boundary of the physical domain. Its deformation is modeled by a linearized version of Koiter's elastic energy. We show the existence of weak solutions to the corresponding system of PDEs provided the adiabatic exponent satisfies {γ > 12/7} ({γ >1 } in two dimensions). The solution exists until the moving boundary approaches a self-intersection. This provides a compressible counterpart of the results in Lengeler and Růžičkaka (Arch Ration Mech Anal 211(1):205-255, 2014) on incompressible Navier-Stokes equations.

Finite element analysis of steady and transiently moving/rolling nonlinear viscoelastic structure. III - Impact/contact simulations

NASA Technical Reports Server (NTRS)

Nakajima, Yukio; Padovan, Joe

1987-01-01

In a three-part series of papers, a generalized finite element methodology is formulated to handle traveling load problems involving large deformation fields in structure composed of viscoelastic media. The main thrust of this paper is to develop an overall finite element methodology and associated solution algorithms to handle the transient aspects of moving problems involving contact impact type loading fields. Based on the methodology and algorithms formulated, several numerical experiments are considered. These include the rolling/sliding impact of tires with road obstructions.

Computer simulation of solutions of polyharmonic equations in plane domain

NASA Astrophysics Data System (ADS)

Kazakova, A. O.

2018-05-01

A systematic study of plane problems of the theory of polyharmonic functions is presented. A method of reducing boundary problems for polyharmonic functions to the system of integral equations on the boundary of the domain is given and a numerical algorithm for simulation of solutions of this system is suggested. Particular attention is paid to the numerical solution of the main tasks when the values of the function and its derivatives are given. Test examples are considered that confirm the effectiveness and accuracy of the suggested algorithm.

Conservative treatment of boundary interfaces for overlaid grids and multi-level grid adaptations

NASA Technical Reports Server (NTRS)

Moon, Young J.; Liou, Meng-Sing

1989-01-01

Conservative algorithms for boundary interfaces of overlaid grids are presented. The basic method is zeroth order, and is extended to a higher order method using interpolation and subcell decomposition. The present method, strictly based on a conservative constraint, is tested with overlaid grids for various applications of unsteady and steady supersonic inviscid flows with strong shock waves. The algorithm is also applied to a multi-level grid adaptation in which the next level finer grid is overlaid on the coarse base grid with an arbitrary orientation.

Geometric and shading correction for images of printed materials using boundary.

PubMed

Brown, Michael S; Tsoi, Yau-Chat

2006-06-01

A novel technique that uses boundary interpolation to correct geometric distortion and shading artifacts present in images of printed materials is presented. Unlike existing techniques, our algorithm can simultaneously correct a variety of geometric distortions, including skew, fold distortion, binder curl, and combinations of these. In addition, the same interpolation framework can be used to estimate the intrinsic illumination component of the distorted image to correct shading artifacts. We detail our algorithm for geometric and shading correction and demonstrate its usefulness on real-world and synthetic data.

A stable partitioned FSI algorithm for rigid bodies and incompressible flow. Part I: Model problem analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Banks, J. W.; Henshaw, W. D.; Schwendeman, D. W.

A stable partitioned algorithm is developed for fluid-structure interaction (FSI) problems involving viscous incompressible flow and rigid bodies. This added-mass partitioned (AMP) algorithm remains stable, without sub-iterations, for light and even zero mass rigid bodies when added-mass and viscous added-damping effects are large. The scheme is based on a generalized Robin interface condition for the fluid pressure that includes terms involving the linear acceleration and angular acceleration of the rigid body. Added mass effects are handled in the Robin condition by inclusion of a boundary integral term that depends on the pressure. Added-damping effects due to the viscous shear forcesmore » on the body are treated by inclusion of added-damping tensors that are derived through a linearization of the integrals defining the force and torque. Added-damping effects may be important at low Reynolds number, or, for example, in the case of a rotating cylinder or rotating sphere when the rotational moments of inertia are small. In this second part of a two-part series, the general formulation of the AMP scheme is presented including the form of the AMP interface conditions and added-damping tensors for general geometries. A fully second-order accurate implementation of the AMP scheme is developed in two dimensions based on a fractional-step method for the incompressible Navier-Stokes equations using finite difference methods and overlapping grids to handle the moving geometry. Here, the numerical scheme is verified on a number of difficult benchmark problems.« less

A stable partitioned FSI algorithm for rigid bodies and incompressible flow. Part I: Model problem analysis

DOE PAGES

Banks, J. W.; Henshaw, W. D.; Schwendeman, D. W.; ...

2017-01-20

A stable partitioned algorithm is developed for fluid-structure interaction (FSI) problems involving viscous incompressible flow and rigid bodies. This added-mass partitioned (AMP) algorithm remains stable, without sub-iterations, for light and even zero mass rigid bodies when added-mass and viscous added-damping effects are large. The scheme is based on a generalized Robin interface condition for the fluid pressure that includes terms involving the linear acceleration and angular acceleration of the rigid body. Added mass effects are handled in the Robin condition by inclusion of a boundary integral term that depends on the pressure. Added-damping effects due to the viscous shear forcesmore » on the body are treated by inclusion of added-damping tensors that are derived through a linearization of the integrals defining the force and torque. Added-damping effects may be important at low Reynolds number, or, for example, in the case of a rotating cylinder or rotating sphere when the rotational moments of inertia are small. In this second part of a two-part series, the general formulation of the AMP scheme is presented including the form of the AMP interface conditions and added-damping tensors for general geometries. A fully second-order accurate implementation of the AMP scheme is developed in two dimensions based on a fractional-step method for the incompressible Navier-Stokes equations using finite difference methods and overlapping grids to handle the moving geometry. Here, the numerical scheme is verified on a number of difficult benchmark problems.« less

A free-boundary model of a motile cell explains turning behavior.

PubMed

Nickaeen, Masoud; Novak, Igor L; Pulford, Stephanie; Rumack, Aaron; Brandon, Jamie; Slepchenko, Boris M; Mogilner, Alex

2017-11-01

To understand shapes and movements of cells undergoing lamellipodial motility, we systematically explore minimal free-boundary models of actin-myosin contractility consisting of the force-balance and myosin transport equations. The models account for isotropic contraction proportional to myosin density, viscous stresses in the actin network, and constant-strength viscous-like adhesion. The contraction generates a spatially graded centripetal actin flow, which in turn reinforces the contraction via myosin redistribution and causes retraction of the lamellipodial boundary. Actin protrusion at the boundary counters the retraction, and the balance of the protrusion and retraction shapes the lamellipodium. The model analysis shows that initiation of motility critically depends on three dimensionless parameter combinations, which represent myosin-dependent contractility, a characteristic viscosity-adhesion length, and a rate of actin protrusion. When the contractility is sufficiently strong, cells break symmetry and move steadily along either straight or circular trajectories, and the motile behavior is sensitive to conditions at the cell boundary. Scanning of a model parameter space shows that the contractile mechanism of motility supports robust cell turning in conditions where short viscosity-adhesion lengths and fast protrusion cause an accumulation of myosin in a small region at the cell rear, destabilizing the axial symmetry of a moving cell.

2010 and Beyond: Virtual Reality and the Communication Classroom.

ERIC Educational Resources Information Center

Siddens, Paul J., III

The use of virtual reality technology in the Communication discipline is a challenge that educators in the field should investigate thoroughly and begin to embrace as they move into the 21st century. Classrooms with access to the Internet allow students to move outside the physical boundaries of the classroom and suggest a significant change in…

Quantum field between moving mirrors: A three dimensional example

NASA Technical Reports Server (NTRS)

Hacyan, S.; Jauregui, Roco; Villarreal, Carlos

1995-01-01

The scalar quantum field uniformly moving plates in three dimensional space is studied. Field equations for Dirichlet boundary conditions are solved exactly. Comparison of the resulting wavefunctions with their instantaneous static counterpart is performed via Bogolubov coefficients. Unlike the one dimensional problem, 'particle' creation as well as squeezing may occur. The time dependent Casimir energy is also evaluated.

Determination of feature generation methods for PTZ camera object tracking

NASA Astrophysics Data System (ADS)

Doyle, Daniel D.; Black, Jonathan T.

2012-06-01

Object detection and tracking using computer vision (CV) techniques have been widely applied to sensor fusion applications. Many papers continue to be written that speed up performance and increase learning of artificially intelligent systems through improved algorithms, workload distribution, and information fusion. Military application of real-time tracking systems is becoming more and more complex with an ever increasing need of fusion and CV techniques to actively track and control dynamic systems. Examples include the use of metrology systems for tracking and measuring micro air vehicles (MAVs) and autonomous navigation systems for controlling MAVs. This paper seeks to contribute to the determination of select tracking algorithms that best track a moving object using a pan/tilt/zoom (PTZ) camera applicable to both of the examples presented. The select feature generation algorithms compared in this paper are the trained Scale-Invariant Feature Transform (SIFT) and Speeded Up Robust Features (SURF), the Mixture of Gaussians (MoG) background subtraction method, the Lucas- Kanade optical flow method (2000) and the Farneback optical flow method (2003). The matching algorithm used in this paper for the trained feature generation algorithms is the Fast Library for Approximate Nearest Neighbors (FLANN). The BSD licensed OpenCV library is used extensively to demonstrate the viability of each algorithm and its performance. Initial testing is performed on a sequence of images using a stationary camera. Further testing is performed on a sequence of images such that the PTZ camera is moving in order to capture the moving object. Comparisons are made based upon accuracy, speed and memory.

Tracing the boundaries of Cenozoic volcanic edifices from Sardinia (Italy): a geomorphometric contribution

NASA Astrophysics Data System (ADS)

Melis, M. T.; Mundula, F.; DessÌ, F.; Cioni, R.; Funedda, A.

2014-09-01

Unequivocal delimitation of landforms is an important issue for different purposes, from science-driven morphometric analysis to legal issues related to land conservation. This study is aimed at giving a new contribution to the morphometric approach for the delineation of the boundaries of volcanic edifices, applied to 13 monogenetic volcanoes (scoria cones) related to the Pliocene-Pleistocene volcanic cycle in Sardinia (Italy). External boundary delimitation of the edifices is discussed based on an integrated methodology using automatic elaboration of digital elevation models together with geomorphological and geological observations. Different elaborations of surface slope and profile curvature have been proposed and discussed; among them, two algorithms based on simple mathematical functions combining slope and profile curvature well fit the requirements of this study. One of theses algorithms is a modification of a function introduced by Grosse et al. (2011), which better performs for recognizing and tracing the boundary between the volcanic scoria cone and its basement. Although the geological constraints still drive the final decision, the proposed method improves the existing tools for a semi-automatic tracing of the boundaries.

Tracing the boundaries of Cenozoic volcanic edifices from Sardinia (Italy): a geomorphometric contribution

NASA Astrophysics Data System (ADS)

Melis, M. T.; Mundula, F.; Dessì, F.; Cioni, R.; Funedda, A.

2014-05-01

Unequivocal delimitation of landforms is an important issue for different purposes, from science-driven morphometric analysis to legal issues related to land conservation. This study is aimed at giving a new contribution to the morphometric approach for the delineation of the boundaries of volcanic edifices, applied to 13 monogenetic volcanoes (scoria cones) related to the Pliocene-Pleistocene volcanic cycle in Sardinia (Italy). External boundary delimitation of the edifices is discussed based on an integrated methodology using automatic elaboration of digital elevation models together with geomorphological and geological observations. Different elaborations of surface slope and profile curvature have been proposed and discussed; among them, two algorithms based on simple mathematical functions combining slope and profile curvature well fit the requirements of this study. One of theses algorithms is a modification of a function already discussed by Grosse et al. (2011), which better perform for recognizing and tracing the boundary between the volcanic scoria cone and its basement. Although the geological constraints still drive the final decision, the proposed method improves the existing tools for a semi-automatic tracing of the boundaries.

A wideband fast multipole boundary element method for half-space/plane-symmetric acoustic wave problems

NASA Astrophysics Data System (ADS)

Zheng, Chang-Jun; Chen, Hai-Bo; Chen, Lei-Lei

2013-04-01

This paper presents a novel wideband fast multipole boundary element approach to 3D half-space/plane-symmetric acoustic wave problems. The half-space fundamental solution is employed in the boundary integral equations so that the tree structure required in the fast multipole algorithm is constructed for the boundary elements in the real domain only. Moreover, a set of symmetric relations between the multipole expansion coefficients of the real and image domains are derived, and the half-space fundamental solution is modified for the purpose of applying such relations to avoid calculating, translating and saving the multipole/local expansion coefficients of the image domain. The wideband adaptive multilevel fast multipole algorithm associated with the iterative solver GMRES is employed so that the present method is accurate and efficient for both lowand high-frequency acoustic wave problems. As for exterior acoustic problems, the Burton-Miller method is adopted to tackle the fictitious eigenfrequency problem involved in the conventional boundary integral equation method. Details on the implementation of the present method are described, and numerical examples are given to demonstrate its accuracy and efficiency.

Immersed boundary methods for simulating fluid-structure interaction

NASA Astrophysics Data System (ADS)

Sotiropoulos, Fotis; Yang, Xiaolei

2014-02-01

Fluid-structure interaction (FSI) problems commonly encountered in engineering and biological applications involve geometrically complex flexible or rigid bodies undergoing large deformations. Immersed boundary (IB) methods have emerged as a powerful simulation tool for tackling such flows due to their inherent ability to handle arbitrarily complex bodies without the need for expensive and cumbersome dynamic re-meshing strategies. Depending on the approach such methods adopt to satisfy boundary conditions on solid surfaces they can be broadly classified as diffused and sharp interface methods. In this review, we present an overview of the fundamentals of both classes of methods with emphasis on solution algorithms for simulating FSI problems. We summarize and juxtapose different IB approaches for imposing boundary conditions, efficient iterative algorithms for solving the incompressible Navier-Stokes equations in the presence of dynamic immersed boundaries, and strong and loose coupling FSI strategies. We also present recent results from the application of such methods to study a wide range of problems, including vortex-induced vibrations, aquatic swimming, insect flying, human walking and renewable energy. Limitations of such methods and the need for future research to mitigate them are also discussed.

Recursive recovery of Markov transition probabilities from boundary value data

DOE Office of Scientific and Technical Information (OSTI.GOV)

Patch, Sarah Kathyrn

1994-04-01

In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requiresmore » finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 x 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 x 2 x 2 problem, is solved.« less

Multi-model stereo restitution

USGS Publications Warehouse

Dueholm, K.S.

1990-01-01

Methods are described that permit simultaneous orientation of many small-frame photogrammetric models in an analytical plotter. The multi-model software program enables the operator to move freely between the oriented models during interpretation and mapping. Models change automatically when the measuring mark is moved from one frame to another, moving to the same ground coordinates in the neighboring model. Thus, data collection and plotting can be performed continuously across model boundaries. The orientation of the models is accomplished by a bundle block adjustment. -from Author

Effect of Surface Waviness on Transition in Three-Dimensional Boundary-Layer Flow

NASA Technical Reports Server (NTRS)

Masad, Jamal A.

1996-01-01

The effect of a surface wave on transition in three-dimensional boundary-layer flow over an infinite swept wing was studied. The mean flow computed using interacting boundary-layer theory, and transition was predicted using linear stability theory coupled with the empirical eN method. It was found that decreasing the wave height, sweep angle, or freestream unit Reynolds number, and increasing the freestream Mach number or suction level all stabilized the flow and moved transition onset to downstream locations.

Numerical Experiments in Error Control for Sound Propagation Using a Damping Layer Boundary Treatment

NASA Technical Reports Server (NTRS)

Goodrich, John W.

2017-01-01

This paper presents results from numerical experiments for controlling the error caused by a damping layer boundary treatment when simulating the propagation of an acoustic signal from a continuous pressure source. The computations are with the 2D Linearized Euler Equations (LEE) for both a uniform mean flow and a steady parallel jet. The numerical experiments are with algorithms that are third, fifth, seventh and ninth order accurate in space and time. The numerical domain is enclosed in a damping layer boundary treatment. The damping is implemented in a time accurate manner, with simple polynomial damping profiles of second, fourth, sixth and eighth power. At the outer boundaries of the damping layer the propagating solution is uniformly set to zero. The complete boundary treatment is remarkably simple and intrinsically independant from the dimension of the spatial domain. The reported results show the relative effect on the error from the boundary treatment by varying the damping layer width, damping profile power, damping amplitude, propagtion time, grid resolution and algorithm order. The issue that is being addressed is not the accuracy of the numerical solution when compared to a mathematical solution, but the effect of the complete boundary treatment on the numerical solution, and to what degree the error in the numerical solution from the complete boundary treatment can be controlled. We report maximum relative absolute errors from just the boundary treatment that range from O[10-2] to O[10-7].

Continuous protein concentration via free-flow moving reaction boundary electrophoresis.

PubMed

Kong, Fanzhi; Zhang, Min; Chen, Jingjing; Fan, Liuyin; Xiao, Hua; Liu, Shaorong; Cao, Chengxi

2017-07-28

In this work, we developed the model and theory of free-flow moving reaction boundary electrophoresis (FFMRB) for continuous protein concentration for the first time. The theoretical results indicated that (i) the moving reaction boundary (MRB) can be quantitatively designed in free-flow electrophoresis (FFE) system; (ii) charge-to-mass ratio (Z/M) analysis could provide guidance for protein concentration optimization; and (iii) the maximum processing capacity could be predicted. To demonstrate the model and theory, three model proteins of hemoglobin (Hb), cytochrome C (Cyt C) and C-phycocyanin (C-PC) were chosen for the experiments. The experimental results verified that (i) stable MRBs with different velocities could be established in FFE apparatus with weak acid/weak base neutralization reaction system; (ii) proteins of Hb, Cyt C and C-PC were well concentrated with FFMRB; and (iii) a maximum processing capacity and recovery ratio of Cyt C enrichment were 126mL/h and 95.5% respectively, and a maximum enrichment factor was achieved 12.6 times for Hb. All of the experiments demonstrated the protein concentration model and theory. In contrast to other methods, the continuous processing ability enables FFMRB to efficiently enrich diluted protein or peptide in large volume solution. Copyright © 2017 Elsevier B.V. All rights reserved.

Autonomous dynamic obstacle avoidance for bacteria-powered microrobots (BPMs) with modified vector field histogram

PubMed Central

Kim, Hoyeon; Cheang, U. Kei

2017-01-01

In order to broaden the use of microrobots in practical fields, autonomous control algorithms such as obstacle avoidance must be further developed. However, most previous studies of microrobots used manual motion control to navigate past tight spaces and obstacles while very few studies demonstrated the use of autonomous motion. In this paper, we demonstrated a dynamic obstacle avoidance algorithm for bacteria-powered microrobots (BPMs) using electric field in fluidic environments. A BPM consists of an artificial body, which is made of SU-8, and a high dense layer of harnessed bacteria. BPMs can be controlled using externally applied electric fields due to the electrokinetic property of bacteria. For developing dynamic obstacle avoidance for BPMs, a kinematic model of BPMs was utilized to prevent collision and a finite element model was used to characteristic the deformation of an electric field near the obstacle walls. In order to avoid fast moving obstacles, we modified our previously static obstacle avoidance approach using a modified vector field histogram (VFH) method. To validate the advanced algorithm in experiments, magnetically controlled moving obstacles were used to intercept the BPMs as the BPMs move from the initial position to final position. The algorithm was able to successfully guide the BPMs to reach their respective goal positions while avoiding the dynamic obstacles. PMID:29020016

Direct Position Determination of Multiple Non-Circular Sources with a Moving Coprime Array.

PubMed

Zhang, Yankui; Ba, Bin; Wang, Daming; Geng, Wei; Xu, Haiyun

2018-05-08

Direct position determination (DPD) is currently a hot topic in wireless localization research as it is more accurate than traditional two-step positioning. However, current DPD algorithms are all based on uniform arrays, which have an insufficient degree of freedom and limited estimation accuracy. To improve the DPD accuracy, this paper introduces a coprime array to the position model of multiple non-circular sources with a moving array. To maximize the advantages of this coprime array, we reconstruct the covariance matrix by vectorization, apply a spatial smoothing technique, and converge the subspace data from each measuring position to establish the cost function. Finally, we obtain the position coordinates of the multiple non-circular sources. The complexity of the proposed method is computed and compared with that of other methods, and the Cramer⁻Rao lower bound of DPD for multiple sources with a moving coprime array, is derived. Theoretical analysis and simulation results show that the proposed algorithm is not only applicable to circular sources, but can also improve the positioning accuracy of non-circular sources. Compared with existing two-step positioning algorithms and DPD algorithms based on uniform linear arrays, the proposed technique offers a significant improvement in positioning accuracy with a slight increase in complexity.

Autonomous dynamic obstacle avoidance for bacteria-powered microrobots (BPMs) with modified vector field histogram.

PubMed

Kim, Hoyeon; Cheang, U Kei; Kim, Min Jun

2017-01-01

In order to broaden the use of microrobots in practical fields, autonomous control algorithms such as obstacle avoidance must be further developed. However, most previous studies of microrobots used manual motion control to navigate past tight spaces and obstacles while very few studies demonstrated the use of autonomous motion. In this paper, we demonstrated a dynamic obstacle avoidance algorithm for bacteria-powered microrobots (BPMs) using electric field in fluidic environments. A BPM consists of an artificial body, which is made of SU-8, and a high dense layer of harnessed bacteria. BPMs can be controlled using externally applied electric fields due to the electrokinetic property of bacteria. For developing dynamic obstacle avoidance for BPMs, a kinematic model of BPMs was utilized to prevent collision and a finite element model was used to characteristic the deformation of an electric field near the obstacle walls. In order to avoid fast moving obstacles, we modified our previously static obstacle avoidance approach using a modified vector field histogram (VFH) method. To validate the advanced algorithm in experiments, magnetically controlled moving obstacles were used to intercept the BPMs as the BPMs move from the initial position to final position. The algorithm was able to successfully guide the BPMs to reach their respective goal positions while avoiding the dynamic obstacles.

Incomplete projection reconstruction of computed tomography based on the modified discrete algebraic reconstruction technique

NASA Astrophysics Data System (ADS)

Yang, Fuqiang; Zhang, Dinghua; Huang, Kuidong; Gao, Zongzhao; Yang, YaFei

2018-02-01

Based on the discrete algebraic reconstruction technique (DART), this study aims to address and test a new improved algorithm applied to incomplete projection data to generate a high quality reconstruction image by reducing the artifacts and noise in computed tomography. For the incomplete projections, an augmented Lagrangian based on compressed sensing is first used in the initial reconstruction for segmentation of the DART to get higher contrast graphics for boundary and non-boundary pixels. Then, the block matching 3D filtering operator was used to suppress the noise and to improve the gray distribution of the reconstructed image. Finally, simulation studies on the polychromatic spectrum were performed to test the performance of the new algorithm. Study results show a significant improvement in the signal-to-noise ratios (SNRs) and average gradients (AGs) of the images reconstructed from incomplete data. The SNRs and AGs of the new images reconstructed by DART-ALBM were on average 30%-40% and 10% higher than the images reconstructed by DART algorithms. Since the improved DART-ALBM algorithm has a better robustness to limited-view reconstruction, which not only makes the edge of the image clear but also makes the gray distribution of non-boundary pixels better, it has the potential to improve image quality from incomplete projections or sparse projections.

Breast boundary detection with active contours

NASA Astrophysics Data System (ADS)

Balic, I.; Goyal, P.; Roy, O.; Duric, N.

2014-03-01

Ultrasound tomography is a modality that can be used to image various characteristics of the breast, such as sound speed, attenuation, and reflectivity. In the considered setup, the breast is immersed in water and scanned along the coronal axis from the chest wall to the nipple region. To improve image visualization, it is desirable to remove the water background. To this end, the 3D boundary of the breast must be accurately estimated. We present an iterative algorithm based on active contours that automatically detects the boundary of a breast using a 3D stack of attenuation images obtained from an ultrasound tomography scanner. We build upon an existing method to design an algorithm that is fast, fully automated, and reliable. We demonstrate the effectiveness of the proposed technique using clinical data sets.

Visual offline sample stacking via moving neutralization boundary electrophoresis for analysis of heavy metal ion.

PubMed

Fan, Yinping; Li, Shan; Fan, Liuyin; Cao, Chengxi

2012-06-15

In this paper, a moving neutralization boundary (MNB) electrophoresis is developed as a novel model of visual offline sample stacking for the trace analysis of heavy metal ions (HMIs). In the stacking system, the cathodic-direction motion MNB is designed with 1.95-2.8mM HCl+98 mM KCl in phase alfa and 4.0mM NaOH+96 mM KCl in phase beta. If a little of HMI is present in phase alfa, the metal ion electrically migrates towards the MNB and react with hydroxyl ion, producing precipitation and moving precipitation boundary (MPB). The alkaline precipitation is neutralized by hydrogen ion, leading to a moving eluting boundary (MEB), release of HMI from its precipitation, circle of HMI from the MEB to the MPB, and highly efficient visual stacking. As a proof of concept, a set of metal ions (Cu(II), Co(II), Mn(II), Pb(II) and Cr(III)) were chosen as the model HMIs and capillary electrophoresis (CE) was selected as an analytical tool for the experiments demonstrating the feasibility of MNB-based stacking. As shown in this paper, (i) the visual stacking model was manifested by the experiments; (ii) there was a controllable stacking of HMI in the MNB system; (iii) the offline stacking could achieve higher than 123 fold preconcentration; and (iv) the five HMIs were simultaneously stacked via the developed stacking technique for the trace analyses with the limits of detection (LOD): 3.67×10(-3) (Cu(II)), 1.67×10(-3) (Co(II), 4.17×10(-3) (Mn(II)), 4.6×10(-4) (Pb(II)) and 8.40×10(-4)mM (Cr(III)). Even the off-line stacking was demonstrated for the use of CE-based HMI analysis, it has potential applications in atomic absorption spectroscopy (AAS), inductively coupled plasma-mass spectrometry (ICP-MS) and ion chromatography (IC) etc. Copyright © 2012 Elsevier B.V. All rights reserved.

An autonomous robot inspired by insect neurophysiology pursues moving features in natural environments

NASA Astrophysics Data System (ADS)

Bagheri, Zahra M.; Cazzolato, Benjamin S.; Grainger, Steven; O'Carroll, David C.; Wiederman, Steven D.

2017-08-01

Objective. Many computer vision and robotic applications require the implementation of robust and efficient target-tracking algorithms on a moving platform. However, deployment of a real-time system is challenging, even with the computational power of modern hardware. Lightweight and low-powered flying insects, such as dragonflies, track prey or conspecifics within cluttered natural environments, illustrating an efficient biological solution to the target-tracking problem. Approach. We used our recent recordings from ‘small target motion detector’ neurons in the dragonfly brain to inspire the development of a closed-loop target detection and tracking algorithm. This model exploits facilitation, a slow build-up of response to targets which move along long, continuous trajectories, as seen in our electrophysiological data. To test performance in real-world conditions, we implemented this model on a robotic platform that uses active pursuit strategies based on insect behaviour. Main results. Our robot performs robustly in closed-loop pursuit of targets, despite a range of challenging conditions used in our experiments; low contrast targets, heavily cluttered environments and the presence of distracters. We show that the facilitation stage boosts responses to targets moving along continuous trajectories, improving contrast sensitivity and detection of small moving targets against textured backgrounds. Moreover, the temporal properties of facilitation play a useful role in handling vibration of the robotic platform. We also show that the adoption of feed-forward models which predict the sensory consequences of self-movement can significantly improve target detection during saccadic movements. Significance. Our results provide insight into the neuronal mechanisms that underlie biological target detection and selection (from a moving platform), as well as highlight the effectiveness of our bio-inspired algorithm in an artificial visual system.

On the Effective Construction of Compactly Supported Wavelets Satisfying Homogenous Boundary Conditions on the Interval

NASA Technical Reports Server (NTRS)

Chiavassa, G.; Liandrat, J.

1996-01-01

We construct compactly supported wavelet bases satisfying homogeneous boundary conditions on the interval (0,1). The maximum features of multiresolution analysis on the line are retained, including polynomial approximation and tree algorithms. The case of H(sub 0)(sup 1)(0, 1)is detailed, and numerical values, required for the implementation, are provided for the Neumann and Dirichlet boundary conditions.

A landscape model for predicting potential natural vegetation of the Olympic Peninsula USA using boundary equations and newly developed environmental variables.

Treesearch

Jan A. Henderson; Robin D. Lesher; David H. Peter; Chris D. Ringo

2011-01-01

A gradient-analysis-based model and grid-based map are presented that use the potential vegetation zone as the object of the model. Several new variables are presented that describe the environmental gradients of the landscape at different scales. Boundary algorithms are conceptualized, and then defined, that describe the environmental boundaries between vegetation...

A Nearest Neighbor Classifier Employing Critical Boundary Vectors for Efficient On-Chip Template Reduction.

PubMed

Xia, Wenjun; Mita, Yoshio; Shibata, Tadashi

2016-05-01

Aiming at efficient data condensation and improving accuracy, this paper presents a hardware-friendly template reduction (TR) method for the nearest neighbor (NN) classifiers by introducing the concept of critical boundary vectors. A hardware system is also implemented to demonstrate the feasibility of using an field-programmable gate array (FPGA) to accelerate the proposed method. Initially, k -means centers are used as substitutes for the entire template set. Then, to enhance the classification performance, critical boundary vectors are selected by a novel learning algorithm, which is completed within a single iteration. Moreover, to remove noisy boundary vectors that can mislead the classification in a generalized manner, a global categorization scheme has been explored and applied to the algorithm. The global characterization automatically categorizes each classification problem and rapidly selects the boundary vectors according to the nature of the problem. Finally, only critical boundary vectors and k -means centers are used as the new template set for classification. Experimental results for 24 data sets show that the proposed algorithm can effectively reduce the number of template vectors for classification with a high learning speed. At the same time, it improves the accuracy by an average of 2.17% compared with the traditional NN classifiers and also shows greater accuracy than seven other TR methods. We have shown the feasibility of using a proof-of-concept FPGA system of 256 64-D vectors to accelerate the proposed method on hardware. At a 50-MHz clock frequency, the proposed system achieves a 3.86 times higher learning speed than on a 3.4-GHz PC, while consuming only 1% of the power of that used by the PC.

On the Creation of An Urban Boundary Layer Product Using The Radar Wind Profiler of the New York City Meteorological Network

NASA Astrophysics Data System (ADS)

Dempsey, M. J.; Booth, J.; Arend, M.; Melecio-Vazquez, D.

2016-12-01

The radar wind profiler (RWP) located on the Liberty Science Center in Jersey City, NJ is a part of the New York City Meteorological Network (NYCMetNet). An automatic algorithm based on those by Angevine [1] and Molod [2] is expanded upon and implemented to take RWP signal to noise ratio data and create an urban boundary layer (UBL) height product. Time series of the RWP UBL heights from clear and cloudy days are examined and compared to UBL height time series calculated from thermal data obtained from a NYCMetNet radiometer located on the roof of the Grove School of Engineering at The City College of New York. UBL data from the RWP are also compared to the MERRA (Modern Era Retrospective Analysis for Research and Applications) planetary boundary layer height time series product. A limited seasonal climatology is created from the available RWP data for clear and cloudy days and then compared to a limited seasonal climatology produced from boundary layer data obtained from MERRA and boundary layer data calculated from the CCNY radiometer. As with wind profilers in the NOAA wind profiler network, the signal return to the lowest range gates is not always the result of turbulent scattering, but from scattering from other targets such as the building itself, birds and insects. The algorithm attempts to address this during the daytime, when strong signal returns at the lowest range gates mask the SNR maxima above which are representative of the actual UBL height. Detecting the collapse and fall of the boundary layer meets with limited success, also, from the hours of 2:30pm to 5:00pm. Upper and lower range gates from the wind profiler limit observation of the nighttime boundary layer for heights falling below the lowest range gate and daytime convective boundary layer maxima rising above the highest. Due to the constraints of the instrument and the algorithm it is recommended that the boundary layer height product be constrained to the hours of 8am to 7pm.

Velocity fields and optical turbulence near the boundary in a strongly convective laboratory flow

NASA Astrophysics Data System (ADS)

Matt, Silvia; Hou, Weilin; Goode, Wesley; Hellman, Samuel

2016-05-01

Boundary layers around moving underwater vehicles or other platforms can be a limiting factor for optical communication. Turbulence in the boundary layer of a body moving through a stratified medium can lead to small variations in the index of refraction, which impede optical signals. As a first step towards investigating this boundary layer effect on underwater optics, we study the flow near the boundary in the Rayleigh-Bénard laboratory tank at the Naval Research Laboratory Stennis Space Center. The tank is set up to generate temperature-driven, i.e., convective turbulence, and allows control of the turbulence intensity. This controlled turbulence environment is complemented by computational fluid dynamics simulations to visualize and quantify multi-scale flow patterns. The boundary layer dynamics in the laboratory tank are quantified using a state-of-the-art Particle Image Velocimetry (PIV) system to examine the boundary layer velocities and turbulence parameters. The velocity fields and flow dynamics from the PIV are compared to the numerical model and show the model to accurately reproduce the velocity range and flow dynamics. The temperature variations and thus optical turbulence effects can then be inferred from the model temperature data. Optical turbulence is also visible in the raw data from the PIV system. The newly collected data are consistent with previously reported measurements from high-resolution Acoustic Doppler Velocimeter profilers (Nortek Vectrino), as well as fast thermistor probes and novel next-generation fiber-optics temperature sensors. This multi-level approach to studying optical turbulence near a boundary, combining in-situ measurements, optical techniques, and numerical simulations, can provide new insight and aid in mitigating turbulence impacts on underwater optical signal transmission.

Numerical Models of Human Circulatory System under Altered Gravity: Brain Circulation

NASA Technical Reports Server (NTRS)

Kim, Chang Sung; Kiris, Cetin; Kwak, Dochan; David, Tim

2003-01-01

A computational fluid dynamics (CFD) approach is presented to model the blood flow through the human circulatory system under altered gravity conditions. Models required for CFD simulation relevant to major hemodynamic issues are introduced such as non-Newtonian flow models governed by red blood cells, a model for arterial wall motion due to fluid-wall interactions, a vascular bed model for outflow boundary conditions, and a model for auto-regulation mechanism. The three-dimensional unsteady incompressible Navier-Stokes equations coupled with these models are solved iteratively using the pseudocompressibility method and dual time stepping. Moving wall boundary conditions from the first-order fluid-wall interaction model are used to study the influence of arterial wall distensibility on flow patterns and wall shear stresses during the heart pulse. A vascular bed modeling utilizing the analogy with electric circuits is coupled with an auto-regulation algorithm for multiple outflow boundaries. For the treatment of complex geometry, a chimera overset grid technique is adopted to obtain connectivity between arterial branches. For code validation, computed results are compared with experimental data for steady and unsteady non-Newtonian flows. Good agreement is obtained for both cases. In sin-type Gravity Benchmark Problems, gravity source terms are added to the Navier-Stokes equations to study the effect of gravitational variation on the human circulatory system. This computational approach is then applied to localized blood flows through a realistic carotid bifurcation and two Circle of Willis models, one using an idealized geometry and the other model using an anatomical data set. A three- dimensional anatomical Circle of Willis configuration is reconstructed from human-specific magnetic resonance images using an image segmentation method. The blood flow through these Circle of Willis models is simulated to provide means for studying gravitational effects on the brain circulation under auto-regulation.

Advances in Numerical Boundary Conditions for Computational Aeroacoustics

NASA Technical Reports Server (NTRS)

Tam, Christopher K. W.

1997-01-01

Advances in Computational Aeroacoustics (CAA) depend critically on the availability of accurate, nondispersive, least dissipative computation algorithm as well as high quality numerical boundary treatments. This paper focuses on the recent developments of numerical boundary conditions. In a typical CAA problem, one often encounters two types of boundaries. Because a finite computation domain is used, there are external boundaries. On the external boundaries, boundary conditions simulating the solution outside the computation domain are to be imposed. Inside the computation domain, there may be internal boundaries. On these internal boundaries, boundary conditions simulating the presence of an object or surface with specific acoustic characteristics are to be applied. Numerical boundary conditions, both external or internal, developed for simple model problems are reviewed and examined. Numerical boundary conditions for real aeroacoustic problems are also discussed through specific examples. The paper concludes with a description of some much needed research in numerical boundary conditions for CAA.

Real-time detection of small and dim moving objects in IR video sequences using a robust background estimator and a noise-adaptive double thresholding

NASA Astrophysics Data System (ADS)

Zingoni, Andrea; Diani, Marco; Corsini, Giovanni

2016-10-01

We developed an algorithm for automatically detecting small and poorly contrasted (dim) moving objects in real-time, within video sequences acquired through a steady infrared camera. The algorithm is suitable for different situations since it is independent of the background characteristics and of changes in illumination. Unlike other solutions, small objects of any size (up to single-pixel), either hotter or colder than the background, can be successfully detected. The algorithm is based on accurately estimating the background at the pixel level and then rejecting it. A novel approach permits background estimation to be robust to changes in the scene illumination and to noise, and not to be biased by the transit of moving objects. Care was taken in avoiding computationally costly procedures, in order to ensure the real-time performance even using low-cost hardware. The algorithm was tested on a dataset of 12 video sequences acquired in different conditions, providing promising results in terms of detection rate and false alarm rate, independently of background and objects characteristics. In addition, the detection map was produced frame by frame in real-time, using cheap commercial hardware. The algorithm is particularly suitable for applications in the fields of video-surveillance and computer vision. Its reliability and speed permit it to be used also in critical situations, like in search and rescue, defence and disaster monitoring.

Explicitly represented polygon wall boundary model for the explicit MPS method

NASA Astrophysics Data System (ADS)

Mitsume, Naoto; Yoshimura, Shinobu; Murotani, Kohei; Yamada, Tomonori

2015-05-01

This study presents an accurate and robust boundary model, the explicitly represented polygon (ERP) wall boundary model, to treat arbitrarily shaped wall boundaries in the explicit moving particle simulation (E-MPS) method, which is a mesh-free particle method for strong form partial differential equations. The ERP model expresses wall boundaries as polygons, which are explicitly represented without using the distance function. These are derived so that for viscous fluids, and with less computational cost, they satisfy the Neumann boundary condition for the pressure and the slip/no-slip condition on the wall surface. The proposed model is verified and validated by comparing computed results with the theoretical solution, results obtained by other models, and experimental results. Two simulations with complex boundary movements are conducted to demonstrate the applicability of the E-MPS method to the ERP model.

On the Formulation of Weakly Singular Displacement/Traction Integral Equations; and Their Solution by the MLPG Method

NASA Technical Reports Server (NTRS)

Atluri, Satya N.; Shen, Shengping

2002-01-01

In this paper, a very simple method is used to derive the weakly singular traction boundary integral equation based on the integral relationships for displacement gradients. The concept of the MLPG method is employed to solve the integral equations, especially those arising in solid mechanics. A moving Least Squares (MLS) interpolation is selected to approximate the trial functions in this paper. Five boundary integral Solution methods are introduced: direct solution method; displacement boundary-value problem; traction boundary-value problem; mixed boundary-value problem; and boundary variational principle. Based on the local weak form of the BIE, four different nodal-based local test functions are selected, leading to four different MLPG methods for each BIE solution method. These methods combine the advantages of the MLPG method and the boundary element method.

Three-dimensional electrical impedance tomography: a topology optimization approach.

PubMed

Mello, Luís Augusto Motta; de Lima, Cícero Ribeiro; Amato, Marcelo Britto Passos; Lima, Raul Gonzalez; Silva, Emílio Carlos Nelli

2008-02-01

Electrical impedance tomography is a technique to estimate the impedance distribution within a domain, based on measurements on its boundary. In other words, given the mathematical model of the domain, its geometry and boundary conditions, a nonlinear inverse problem of estimating the electric impedance distribution can be solved. Several impedance estimation algorithms have been proposed to solve this problem. In this paper, we present a three-dimensional algorithm, based on the topology optimization method, as an alternative. A sequence of linear programming problems, allowing for constraints, is solved utilizing this method. In each iteration, the finite element method provides the electric potential field within the model of the domain. An electrode model is also proposed (thus, increasing the accuracy of the finite element results). The algorithm is tested using numerically simulated data and also experimental data, and absolute resistivity values are obtained. These results, corresponding to phantoms with two different conductive materials, exhibit relatively well-defined boundaries between them, and show that this is a practical and potentially useful technique to be applied to monitor lung aeration, including the possibility of imaging a pneumothorax.

Mastering the game of Go without human knowledge.

PubMed

Silver, David; Schrittwieser, Julian; Simonyan, Karen; Antonoglou, Ioannis; Huang, Aja; Guez, Arthur; Hubert, Thomas; Baker, Lucas; Lai, Matthew; Bolton, Adrian; Chen, Yutian; Lillicrap, Timothy; Hui, Fan; Sifre, Laurent; van den Driessche, George; Graepel, Thore; Hassabis, Demis

2017-10-18

A long-standing goal of artificial intelligence is an algorithm that learns, tabula rasa, superhuman proficiency in challenging domains. Recently, AlphaGo became the first program to defeat a world champion in the game of Go. The tree search in AlphaGo evaluated positions and selected moves using deep neural networks. These neural networks were trained by supervised learning from human expert moves, and by reinforcement learning from self-play. Here we introduce an algorithm based solely on reinforcement learning, without human data, guidance or domain knowledge beyond game rules. AlphaGo becomes its own teacher: a neural network is trained to predict AlphaGo's own move selections and also the winner of AlphaGo's games. This neural network improves the strength of the tree search, resulting in higher quality move selection and stronger self-play in the next iteration. Starting tabula rasa, our new program AlphaGo Zero achieved superhuman performance, winning 100-0 against the previously published, champion-defeating AlphaGo.

Mastering the game of Go without human knowledge

NASA Astrophysics Data System (ADS)

Silver, David; Schrittwieser, Julian; Simonyan, Karen; Antonoglou, Ioannis; Huang, Aja; Guez, Arthur; Hubert, Thomas; Baker, Lucas; Lai, Matthew; Bolton, Adrian; Chen, Yutian; Lillicrap, Timothy; Hui, Fan; Sifre, Laurent; van den Driessche, George; Graepel, Thore; Hassabis, Demis

2017-10-01

A long-standing goal of artificial intelligence is an algorithm that learns, tabula rasa, superhuman proficiency in challenging domains. Recently, AlphaGo became the first program to defeat a world champion in the game of Go. The tree search in AlphaGo evaluated positions and selected moves using deep neural networks. These neural networks were trained by supervised learning from human expert moves, and by reinforcement learning from self-play. Here we introduce an algorithm based solely on reinforcement learning, without human data, guidance or domain knowledge beyond game rules. AlphaGo becomes its own teacher: a neural network is trained to predict AlphaGo’s own move selections and also the winner of AlphaGo’s games. This neural network improves the strength of the tree search, resulting in higher quality move selection and stronger self-play in the next iteration. Starting tabula rasa, our new program AlphaGo Zero achieved superhuman performance, winning 100-0 against the previously published, champion-defeating AlphaGo.

An algorithm for testing the efficient market hypothesis.

PubMed

Boboc, Ioana-Andreea; Dinică, Mihai-Cristian

2013-01-01

The objective of this research is to examine the efficiency of EUR/USD market through the application of a trading system. The system uses a genetic algorithm based on technical analysis indicators such as Exponential Moving Average (EMA), Moving Average Convergence Divergence (MACD), Relative Strength Index (RSI) and Filter that gives buying and selling recommendations to investors. The algorithm optimizes the strategies by dynamically searching for parameters that improve profitability in the training period. The best sets of rules are then applied on the testing period. The results show inconsistency in finding a set of trading rules that performs well in both periods. Strategies that achieve very good returns in the training period show difficulty in returning positive results in the testing period, this being consistent with the efficient market hypothesis (EMH).

An Algorithm for Testing the Efficient Market Hypothesis

PubMed Central

Boboc, Ioana-Andreea; Dinică, Mihai-Cristian

2013-01-01

The objective of this research is to examine the efficiency of EUR/USD market through the application of a trading system. The system uses a genetic algorithm based on technical analysis indicators such as Exponential Moving Average (EMA), Moving Average Convergence Divergence (MACD), Relative Strength Index (RSI) and Filter that gives buying and selling recommendations to investors. The algorithm optimizes the strategies by dynamically searching for parameters that improve profitability in the training period. The best sets of rules are then applied on the testing period. The results show inconsistency in finding a set of trading rules that performs well in both periods. Strategies that achieve very good returns in the training period show difficulty in returning positive results in the testing period, this being consistent with the efficient market hypothesis (EMH). PMID:24205148

Formation flying design and applications in weak stability boundary regions.

PubMed

Folta, David

2004-05-01

Weak stability regions serve as superior locations for interferomertric scientific investigations. These regions are often selected to minimize environmental disturbances and maximize observation efficiency. Designs of formations in these regions are becoming ever more challenging as more complex missions are envisioned. The development of algorithms to enable the capability for formation design must be further enabled to incorporate better understanding of weak stability boundary solution space. This development will improve the efficiency and expand the capabilities of current approaches. The Goddard Space Flight Center (GSFC) is currently supporting multiple formation missions in weak stability boundary regions. This end-to-end support consists of mission operations, trajectory design, and control. It also includes both algorithm and software development. The Constellation-X, Maxim, and Stellar Imager missions are examples of the use of improved numeric methods to attain constrained formation geometries and control their dynamical evolution. This paper presents a survey of formation missions in the weak stability boundary regions and a brief description of formation design using numerical and dynamical techniques.

A wideband FMBEM for 2D acoustic design sensitivity analysis based on direct differentiation method

NASA Astrophysics Data System (ADS)

Chen, Leilei; Zheng, Changjun; Chen, Haibo

2013-09-01

This paper presents a wideband fast multipole boundary element method (FMBEM) for two dimensional acoustic design sensitivity analysis based on the direct differentiation method. The wideband fast multipole method (FMM) formed by combining the original FMM and the diagonal form FMM is used to accelerate the matrix-vector products in the boundary element analysis. The Burton-Miller formulation is used to overcome the fictitious frequency problem when using a single Helmholtz boundary integral equation for exterior boundary-value problems. The strongly singular and hypersingular integrals in the sensitivity equations can be evaluated explicitly and directly by using the piecewise constant discretization. The iterative solver GMRES is applied to accelerate the solution of the linear system of equations. A set of optimal parameters for the wideband FMBEM design sensitivity analysis are obtained by observing the performances of the wideband FMM algorithm in terms of computing time and memory usage. Numerical examples are presented to demonstrate the efficiency and validity of the proposed algorithm.

Parabolized Navier-Stokes solutions of separation and trailing-edge flows

NASA Technical Reports Server (NTRS)

Brown, J. L.

1983-01-01

A robust, iterative solution procedure is presented for the parabolized Navier-Stokes or higher order boundary layer equations as applied to subsonic viscous-inviscid interaction flows. The robustness of the present procedure is due, in part, to an improved algorithmic formulation. The present formulation is based on a reinterpretation of stability requirements for this class of algorithms and requires only second order accurate backward or central differences for all streamwise derivatives. Upstream influence is provided for through the algorithmic formulation and iterative sweeps in x. The primary contribution to robustness, however, is the boundary condition treatment, which imposes global constraints to control the convergence path. Discussed are successful calculations of subsonic, strong viscous-inviscid interactions, including separation. These results are consistent with Navier-Stokes solutions and triple deck theory.

A dynamical regularization algorithm for solving inverse source problems of elliptic partial differential equations

NASA Astrophysics Data System (ADS)

Zhang, Ye; Gong, Rongfang; Cheng, Xiaoliang; Gulliksson, Mårten

2018-06-01

This study considers the inverse source problem for elliptic partial differential equations with both Dirichlet and Neumann boundary data. The unknown source term is to be determined by additional boundary conditions. Unlike the existing methods found in the literature, which usually employ the first-order in time gradient-like system (such as the steepest descent methods) for numerically solving the regularized optimization problem with a fixed regularization parameter, we propose a novel method with a second-order in time dissipative gradient-like system and a dynamical selected regularization parameter. A damped symplectic scheme is proposed for the numerical solution. Theoretical analysis is given for both the continuous model and the numerical algorithm. Several numerical examples are provided to show the robustness of the proposed algorithm.

An algorithm for automating the registration of USDA segment ground data to LANDSAT MSS data

NASA Technical Reports Server (NTRS)

Graham, M. H. (Principal Investigator)

1981-01-01

The algorithm is referred to as the Automatic Segment Matching Algorithm (ASMA). The ASMA uses control points or the annotation record of a P-format LANDSAT compter compatible tape as the initial registration to relate latitude and longitude to LANDSAT rows and columns. It searches a given area of LANDSAT data with a 2x2 sliding window and computes gradient values for bands 5 and 7 to match the segment boundaries. The gradient values are held in memory during the shifting (or matching) process. The reconstructed segment array, containing ones (1's) for boundaries and zeros elsewhere are computer compared to the LANDSAT array and the best match computed. Initial testing of the ASMA indicates that it has good potential for replacing the manual technique.

Dynamic analysis of ultrasonically levitated droplet with moving particle semi-implicit and distributed point source method

NASA Astrophysics Data System (ADS)

Wada, Yuji; Yuge, Kohei; Nakamura, Ryohei; Tanaka, Hiroki; Nakamura, Kentaro

2015-07-01

Numerical analysis of an ultrasonically levitated droplet with a free surface boundary is discussed. The droplet is known to change its shape from sphere to spheroid when it is suspended in a standing wave owing to the acoustic radiation force. However, few studies on numerical simulation have been reported in association with this phenomenon including fluid dynamics inside the droplet. In this paper, coupled analysis using the distributed point source method (DPSM) and the moving particle semi-implicit (MPS) method, both of which do not require grids or meshes to handle the moving boundary with ease, is suggested. A droplet levitated in a plane standing wave field between a piston-vibrating ultrasonic transducer and a reflector is simulated with the DPSM-MPS coupled method. The dynamic change in the spheroidal shape of the droplet is successfully reproduced numerically, and the gravitational center and the change in the spheroidal aspect ratio are discussed and compared with the previous literature.

The Agendas of Distance Teaching Universities: Moving from the Margins to the Center Stage of Higher Education.

ERIC Educational Resources Information Center

Guri-Rosenblit, Sarah

1999-01-01

Examined from a comparative perspective the extent to which the agendas of distance teaching universities have moved from the margins to the center stage of higher education. Demonstrates that the boundaries between distance and campus universities are blurring and converging, and that future relations between them will be marked by competition…

Collaboration, Partnerships and Alliances: Perspectives on Erasmus Mundus MA/Magistr in Special Education Needs

ERIC Educational Resources Information Center

Armstrong, Ann Cheryl

2013-01-01

It has been argued that higher education has irreversibly changed over the past 15-20 years. University education has moved from an elite system to a mass system. The frontiers of higher education have expanded more rapidly than they have ever done before by extensively moving across geographical boundaries and accommodating different forms of…

The analytical solution of the problem of a shock focusing in a gas for one-dimensional case

NASA Astrophysics Data System (ADS)

Shestakovskaya, E. S.; Magazov, F. G.

2018-03-01

The analytical solution of the problem of an imploding shock wave in the vessel with an impermeable wall is constructed for the cases of planar, cylindrical and spherical symmetry. The negative velocity is set at the vessel boundary. The velocity of cold ideal gas is zero. At the initial time the shock spreads from this point into the center of symmetry. The boundary moves under the particular law which conforms to the movement of the shock. In Euler variables it moves but in Lagrangian variables its trajectory is a vertical line. Equations that determine the structure of the gas flow between the shock front and the boundary as a function of time and the Lagrangian coordinate as well as the dependence of the entropy on the shock wave velocity are obtained. Self-similar coefficients and corresponding critical values of self-similar coordinates were found for a wide range of adiabatic index. The problem is solved for Lagrangian coordinates.

Viscous diffusion of vorticity in unsteady wall layers using the diffusion velocity concept

DOE Office of Scientific and Technical Information (OSTI.GOV)

Strickland, J.H.; Kempka, S.N.; Wolfe, W.P.

1995-03-01

The primary purpose of this paper is to provide a careful evaluation of the diffusion velocity concept with regard to its ability to predict the diffusion of vorticity near a moving wall. A computer code BDIF has been written which simulates the evolution of the vorticity field near a wall of infinite length which is moving in an arbitrary fashion. The simulations generated by this code are found to give excellent results when compared to several exact solutions. We also outline a two-dimensional unsteady viscous boundary layer model which utilizes the diffusion velocity concept and is compatible with vortex methods.more » A primary goal of this boundary layer model is to minimize the number of vortices generated on the surface at each time step while achieving good resolution of the vorticity field near the wall. Preliminary results have been obtained for simulating a simple two-dimensional laminar boundary layer.« less

Saltmarsh Boundary Modulates Dispersal of Mangrove Propagules: Implications for Mangrove Migration with Sea-Level Rise

PubMed Central

Peterson, Jennifer M.; Bell, Susan S.

2015-01-01

Few studies have empirically examined the suite of mechanisms that underlie the distributional shifts displayed by organisms in response to changing climatic condition. Mangrove forests are expected to move inland as sea-level rises, encroaching on saltmarsh plants inhabiting higher elevations. Mangrove propagules are transported by tidal waters and propagule dispersal is likely modified upon encountering the mangrove-saltmarsh ecotone, the implications of which are poorly known. Here, using an experimental approach, we record landward and seaward dispersal and subsequent establishment of mangrove propagules that encounter biotic boundaries composed of two types of saltmarsh taxa: succulents and grasses. Our findings revealed that propagules emplaced within saltmarsh vegetation immediately landward of the extant mangrove fringe boundary frequently dispersed in the seaward direction. However, propagules moved seaward less frequently and over shorter distances upon encountering boundaries composed of saltmarsh grasses versus succulents. We uniquely confirmed that the small subset of propagules dispersing landward displayed proportionately higher establishment success than those transported seaward. Although impacts of ecotones on plant dispersal have rarely been investigated in situ, our experimental results indicate that the interplay between tidal transport and physical attributes of saltmarsh vegetation influence boundary permeability to propagules, thereby directing the initial phase of shifting mangrove distributions. The incorporation of tidal inundation information and detailed data on landscape features, such as the structure of saltmarsh vegetation at mangrove boundaries, should improve the accuracy of models that are being developed to forecast mangrove distributional shifts in response to sea-level rise. PMID:25760867

Shear flow of dense granular materials near smooth walls. I. Shear localization and constitutive laws in the boundary region.

PubMed

Shojaaee, Zahra; Roux, Jean-Noël; Chevoir, François; Wolf, Dietrich E

2012-07-01

We report on a numerical study of the shear flow of a simple two-dimensional model of a granular material under controlled normal stress between two parallel smooth frictional walls moving with opposite velocities ± V. Discrete simulations, which are carried out with the contact dynamics method in dense assemblies of disks, reveal that, unlike rough walls made of strands of particles, smooth ones can lead to shear strain localization in the boundary layer. Specifically, we observe, for decreasing V, first a fluidlike regime (A), in which the whole granular layer is sheared, with a homogeneous strain rate except near the walls, then (B) a symmetric velocity profile with a solid block in the middle and strain localized near the walls, and finally (C) a state with broken symmetry in which the shear rate is confined to one boundary layer, while the bulk of the material moves together with the opposite wall. Both transitions are independent of system size and occur for specific values of V. Transient times are discussed. We show that the first transition, between regimes A and B, can be deduced from constitutive laws identified for the bulk material and the boundary layer, while the second one could be associated with an instability in the behavior of the boundary layer. The boundary zone constitutive law, however, is observed to depend on the state of the bulk material nearby.

Saltmarsh boundary modulates dispersal of mangrove propagules: implications for mangrove migration with sea-level rise.

PubMed

Peterson, Jennifer M; Bell, Susan S

2015-01-01

Few studies have empirically examined the suite of mechanisms that underlie the distributional shifts displayed by organisms in response to changing climatic condition. Mangrove forests are expected to move inland as sea-level rises, encroaching on saltmarsh plants inhabiting higher elevations. Mangrove propagules are transported by tidal waters and propagule dispersal is likely modified upon encountering the mangrove-saltmarsh ecotone, the implications of which are poorly known. Here, using an experimental approach, we record landward and seaward dispersal and subsequent establishment of mangrove propagules that encounter biotic boundaries composed of two types of saltmarsh taxa: succulents and grasses. Our findings revealed that propagules emplaced within saltmarsh vegetation immediately landward of the extant mangrove fringe boundary frequently dispersed in the seaward direction. However, propagules moved seaward less frequently and over shorter distances upon encountering boundaries composed of saltmarsh grasses versus succulents. We uniquely confirmed that the small subset of propagules dispersing landward displayed proportionately higher establishment success than those transported seaward. Although impacts of ecotones on plant dispersal have rarely been investigated in situ, our experimental results indicate that the interplay between tidal transport and physical attributes of saltmarsh vegetation influence boundary permeability to propagules, thereby directing the initial phase of shifting mangrove distributions. The incorporation of tidal inundation information and detailed data on landscape features, such as the structure of saltmarsh vegetation at mangrove boundaries, should improve the accuracy of models that are being developed to forecast mangrove distributional shifts in response to sea-level rise.

Vorticity dipoles and a theoretical model of a finite force at the moving contact line singularity

NASA Astrophysics Data System (ADS)

Zhang, Peter; Devoria, Adam; Mohseni, Kamran

2017-11-01

In the well known works of Moffatt (1964) and Huh & Scriven (1971), an infinite force was reported at the moving contact line (MCL) and attributed to a non-integrable stress along the fluid-solid boundary. In our recent investigation of the boundary driven wedge, a model of the MCL, we find that the classical solution theoretically predicts a finite force at the contact line if the forces applied by the two boundaries that make up the corner are taken into consideration. Mathematically, this force can be obtained by the complex contour integral of the holomorphic vorticity-pressure function given by G = μω + ip . Alternatively, this force can also be found using a carefully defined real integral that incorporates the two boundaries. Motivated by this discovery, we have found that the rate of change in circulation, viscous energy dissipation, and viscous energy flux is also finite per unit contact line length. The analysis presented demonstrates that despite a singular stress and a relatively simple geometry, the no-slip semi-infinite wedge is capable of capturing some physical quantities of interest. Furthermore, this result provides a foundation for other challenging topics such as dynamic contact angle.

Thermo-fluid-dynamics of turbulent boundary layer over a moving continuous flat sheet in a parallel free stream

NASA Astrophysics Data System (ADS)

Afzal, Bushra; Noor Afzal Team; Bushra Afzal Team

2014-11-01

The momentum and thermal turbulent boundary layers over a continuous moving sheet subjected to a free stream have been analyzed in two layers (inner wall and outer wake) theory at large Reynolds number. The present work is based on open Reynolds equations of momentum and heat transfer without any closure model say, like eddy viscosity or mixing length etc. The matching of inner and outer layers has been carried out by Izakson-Millikan-Kolmogorov hypothesis. The matching for velocity and temperature profiles yields the logarithmic laws and power laws in overlap region of inner and outer layers, along with friction factor and heat transfer laws. The uniformly valid solution for velocity, Reynolds shear stress, temperature and thermal Reynolds heat flux have been proposed by introducing the outer wake functions due to momentum and thermal boundary layers. The comparison with experimental data for velocity profile, temperature profile, skin friction and heat transfer are presented. In outer non-linear layers, the lowest order momentum and thermal boundary layer equations have also been analyses by using eddy viscosity closure model, and results are compared with experimental data. Retired Professor, Embassy Hotel, Rasal Ganj, Aligarh 202001 India.

Simulation of blood flow through an artificial heart

NASA Technical Reports Server (NTRS)

Kiris, Cetin; Chang, I-Dee; Rogers, Stuart E.; Kwak, Dochan

1991-01-01

A numerical simulation of the incompressible viscous flow through a prosthetic tilting disk heart valve is presented in order to demonstrate the current capability to model unsteady flows with moving boundaries. Both steady state and unsteady flow calculations are done by solving the incompressible Navier-Stokes equations in 3-D generalized curvilinear coordinates. In order to handle the moving boundary problems, the chimera grid embedding scheme which decomposes a complex computational domain into several simple subdomains is used. An algebraic turbulence model for internal flows is incorporated to reach the physiological values of Reynolds number. Good agreement is obtained between the numerical results and experimental measurements. It is found that the tilting disk valve causes large regions of separated flow, and regions of high shear.

A system for learning statistical motion patterns.

PubMed

Hu, Weiming; Xiao, Xuejuan; Fu, Zhouyu; Xie, Dan; Tan, Tieniu; Maybank, Steve

2006-09-01

Analysis of motion patterns is an effective approach for anomaly detection and behavior prediction. Current approaches for the analysis of motion patterns depend on known scenes, where objects move in predefined ways. It is highly desirable to automatically construct object motion patterns which reflect the knowledge of the scene. In this paper, we present a system for automatically learning motion patterns for anomaly detection and behavior prediction based on a proposed algorithm for robustly tracking multiple objects. In the tracking algorithm, foreground pixels are clustered using a fast accurate fuzzy K-means algorithm. Growing and prediction of the cluster centroids of foreground pixels ensure that each cluster centroid is associated with a moving object in the scene. In the algorithm for learning motion patterns, trajectories are clustered hierarchically using spatial and temporal information and then each motion pattern is represented with a chain of Gaussian distributions. Based on the learned statistical motion patterns, statistical methods are used to detect anomalies and predict behaviors. Our system is tested using image sequences acquired, respectively, from a crowded real traffic scene and a model traffic scene. Experimental results show the robustness of the tracking algorithm, the efficiency of the algorithm for learning motion patterns, and the encouraging performance of algorithms for anomaly detection and behavior prediction.

A Novel Optical/digital Processing System for Pattern Recognition

NASA Technical Reports Server (NTRS)

Boone, Bradley G.; Shukla, Oodaye B.

1993-01-01

This paper describes two processing algorithms that can be implemented optically: the Radon transform and angular correlation. These two algorithms can be combined in one optical processor to extract all the basic geometric and amplitude features from objects embedded in video imagery. We show that the internal amplitude structure of objects is recovered by the Radon transform, which is a well-known result, but, in addition, we show simulation results that calculate angular correlation, a simple but unique algorithm that extracts object boundaries from suitably threshold images from which length, width, area, aspect ratio, and orientation can be derived. In addition to circumventing scale and rotation distortions, these simulations indicate that the features derived from the angular correlation algorithm are relatively insensitive to tracking shifts and image noise. Some optical architecture concepts, including one based on micro-optical lenslet arrays, have been developed to implement these algorithms. Simulation test and evaluation using simple synthetic object data will be described, including results of a study that uses object boundaries (derivable from angular correlation) to classify simple objects using a neural network.

Attributed relational graphs for cell nucleus segmentation in fluorescence microscopy images.

PubMed

Arslan, Salim; Ersahin, Tulin; Cetin-Atalay, Rengul; Gunduz-Demir, Cigdem

2013-06-01

More rapid and accurate high-throughput screening in molecular cellular biology research has become possible with the development of automated microscopy imaging, for which cell nucleus segmentation commonly constitutes the core step. Although several promising methods exist for segmenting the nuclei of monolayer isolated and less-confluent cells, it still remains an open problem to segment the nuclei of more-confluent cells, which tend to grow in overlayers. To address this problem, we propose a new model-based nucleus segmentation algorithm. This algorithm models how a human locates a nucleus by identifying the nucleus boundaries and piecing them together. In this algorithm, we define four types of primitives to represent nucleus boundaries at different orientations and construct an attributed relational graph on the primitives to represent their spatial relations. Then, we reduce the nucleus identification problem to finding predefined structural patterns in the constructed graph and also use the primitives in region growing to delineate the nucleus borders. Working with fluorescence microscopy images, our experiments demonstrate that the proposed algorithm identifies nuclei better than previous nucleus segmentation algorithms.

Consistent and efficient processing of ADCP streamflow measurements

USGS Publications Warehouse

Mueller, David S.; Constantinescu, George; Garcia, Marcelo H.; Hanes, Dan

2016-01-01

The use of Acoustic Doppler Current Profilers (ADCPs) from a moving boat is a commonly used method for measuring streamflow. Currently, the algorithms used to compute the average depth, compute edge discharge, identify invalid data, and estimate velocity and discharge for invalid data vary among manufacturers. These differences could result in different discharges being computed from identical data. Consistent computational algorithm, automated filtering, and quality assessment of ADCP streamflow measurements that are independent of the ADCP manufacturer are being developed in a software program that can process ADCP moving-boat discharge measurements independent of the ADCP used to collect the data.

Application of particle swarm optimization in path planning of mobile robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In order to realize the optimal path planning of mobile robot in unknown environment, a particle swarm optimization algorithm based on path length as fitness function is proposed. The location of the global optimal particle is determined by the minimum fitness value, and the robot moves along the points of the optimal particles to the target position. The process of moving to the target point is done with MATLAB R2014a. Compared with the standard particle swarm optimization algorithm, the simulation results show that this method can effectively avoid all obstacles and get the optimal path.

Finite-difference simulation of transonic separated flow using a full potential boundary layer interaction approach

NASA Technical Reports Server (NTRS)

Van Dalsem, W. R.; Steger, J. L.

1983-01-01

A new, fast, direct-inverse, finite-difference boundary-layer code has been developed and coupled with a full-potential transonic airfoil analysis code via new inviscid-viscous interaction algorithms. The resulting code has been used to calculate transonic separated flows. The results are in good agreement with Navier-Stokes calculations and experimental data. Solutions are obtained in considerably less computer time than Navier-Stokes solutions of equal resolution. Because efficient inviscid and viscous algorithms are used, it is expected this code will also compare favorably with other codes of its type as they become available.

Laminar supersonic flow over a backstep - A numerical solution at higher Reynolds numbers

NASA Technical Reports Server (NTRS)

Kronzon, Y.; Rom, J.; Seginer, A.

1976-01-01

The Allen-Cheng solution of the flow over a backward facing step is extended to Reynolds numbers up to 16,000 and to inflow boundary-layer height ratios as low as 0.1 by moving the downstream boundary into the recompression region and by smoothing the resulting errors. The boundary conditions in the supersonic outer flow and the downstream boundary conditions in the wake are determined by an extrapolation procedure. Computational results are compared with relevant experimental data. Fair agreement is found between the calculated base pressures and the experimental values, whereas agreement between heat transfer rates appears to be qualitative only.

Boundary effects in a quasi-two-dimensional driven granular fluid.

PubMed

Smith, N D; Smith, M I

2017-12-01

The effect of a confining boundary on the spatial variations in granular temperature of a driven quasi-two-dimensional layer of particles is investigated experimentally. The radial drop in the relative granular temperature ΔT/T exhibits a maximum at intermediate particle numbers which coincides with a crossover from kinetic to collisional transport of energy. It is also found that at low particle numbers, the distributions of radial velocities are increasingly asymmetric as one approaches the boundary. The radial and tangential granular temperatures split, and in the tails of the radial velocity distribution there is a higher population of fast moving particles traveling away rather than towards the boundary.

Calculation of grain boundary normals directly from 3D microstructure images

DOE PAGES

Lieberman, E. J.; Rollett, A. D.; Lebensohn, R. A.; ...

2015-03-11

The determination of grain boundary normals is an integral part of the characterization of grain boundaries in polycrystalline materials. These normal vectors are difficult to quantify due to the discretized nature of available microstructure characterization techniques. The most common method to determine grain boundary normals is by generating a surface mesh from an image of the microstructure, but this process can be slow, and is subject to smoothing issues. A new technique is proposed, utilizing first order Cartesian moments of binary indicator functions, to determine grain boundary normals directly from a voxelized microstructure image. In order to validate the accuracymore » of this technique, the surface normals obtained by the proposed method are compared to those generated by a surface meshing algorithm. Specifically, the local divergence between the surface normals obtained by different variants of the proposed technique and those generated from a surface mesh of a synthetic microstructure constructed using a marching cubes algorithm followed by Laplacian smoothing is quantified. Next, surface normals obtained with the proposed method from a measured 3D microstructure image of a Ni polycrystal are used to generate grain boundary character distributions (GBCD) for Σ3 and Σ9 boundaries, and compared to the GBCD generated using a surface mesh obtained from the same image. Finally, the results show that the proposed technique is an efficient and accurate method to determine voxelized fields of grain boundary normals.« less

Velocity boundary conditions for vorticity formulations of the incompressible Navier-Stokes equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kempka, S.N.; Strickland, J.H.; Glass, M.W.

1995-04-01

formulation to satisfy velocity boundary conditions for the vorticity form of the incompressible, viscous fluid momentum equations is presented. The tangential and normal components of the velocity boundary condition are satisfied simultaneously by creating vorticity adjacent to boundaries. The newly created vorticity is determined using a kinematical formulation which is a generalization of Helmholtz` decomposition of a vector field. Though it has not been generally recognized, these formulations resolve the over-specification issue associated with creating voracity to satisfy velocity boundary conditions. The generalized decomposition has not been widely used, apparently due to a lack of a useful physical interpretation. Anmore » analysis is presented which shows that the generalized decomposition has a relatively simple physical interpretation which facilitates its numerical implementation. The implementation of the generalized decomposition is discussed in detail. As an example the flow in a two-dimensional lid-driven cavity is simulated. The solution technique is based on a Lagrangian transport algorithm in the hydrocode ALEGRA. ALEGRA`s Lagrangian transport algorithm has been modified to solve the vorticity transport equation and the generalized decomposition, thus providing a new, accurate method to simulate incompressible flows. This numerical implementation and the new boundary condition formulation allow vorticity-based formulations to be used in a wider range of engineering problems.« less

Multiple shooting algorithms for jump-discontinuous problems in optimal control and estimation

NASA Technical Reports Server (NTRS)

Mook, D. J.; Lew, Jiann-Shiun

1991-01-01

Multiple shooting algorithms are developed for jump-discontinuous two-point boundary value problems arising in optimal control and optimal estimation. Examples illustrating the origin of such problems are given to motivate the development of the solution algorithms. The algorithms convert the necessary conditions, consisting of differential equations and transversality conditions, into algebraic equations. The solution of the algebraic equations provides exact solutions for linear problems. The existence and uniqueness of the solution are proved.

The bilinear complexity and practical algorithms for matrix multiplication

NASA Astrophysics Data System (ADS)

Smirnov, A. V.

2013-12-01

A method for deriving bilinear algorithms for matrix multiplication is proposed. New estimates for the bilinear complexity of a number of problems of the exact and approximate multiplication of rectangular matrices are obtained. In particular, the estimate for the boundary rank of multiplying 3 × 3 matrices is improved and a practical algorithm for the exact multiplication of square n × n matrices is proposed. The asymptotic arithmetic complexity of this algorithm is O( n 2.7743).

Vehicle Counting and Moving Direction Identification Based on Small-Aperture Microphone Array.

PubMed

Zu, Xingshui; Zhang, Shaojie; Guo, Feng; Zhao, Qin; Zhang, Xin; You, Xing; Liu, Huawei; Li, Baoqing; Yuan, Xiaobing

2017-05-10

The varying trend of a moving vehicle's angles provides much important intelligence for an unattended ground sensor (UGS) monitoring system. The present study investigates the capabilities of a small-aperture microphone array (SAMA) based system to identify the number and moving direction of vehicles travelling on a previously established route. In this paper, a SAMA-based acoustic monitoring system, including the system hardware architecture and algorithm mechanism, is designed as a single node sensor for the application of UGS. The algorithm is built on the varying trend of a vehicle's bearing angles around the closest point of approach (CPA). We demonstrate the effectiveness of our proposed method with our designed SAMA-based monitoring system in various experimental sites. The experimental results in harsh conditions validate the usefulness of our proposed UGS monitoring system.

A tire contact solution technique

NASA Technical Reports Server (NTRS)

Tielking, J. T.

1983-01-01

An efficient method for calculating the contact boundary and interfacial pressure distribution was developed. This solution technique utilizes the discrete Fourier transform to establish an influence coefficient matrix for the portion of the pressurized tire surface that may be in the contact region. This matrix is used in a linear algebra algorithm to determine the contact boundary and the array of forces within the boundary that are necessary to hold the tire in equilibrium against a specified contact surface. The algorithm also determines the normal and tangential displacements of those points on the tire surface that are included in the influence coefficient matrix. Displacements within and outside the contact region are calculated. The solution technique is implemented with a finite-element tire model that is based on orthotropic, nonlinear shell of revolution elements which can respond to nonaxisymmetric loads. A sample contact solution is presented.

Algorithm for Automatic Segmentation of Nuclear Boundaries in Cancer Cells in Three-Channel Luminescent Images

NASA Astrophysics Data System (ADS)

Lisitsa, Y. V.; Yatskou, M. M.; Apanasovich, V. V.; Apanasovich, T. V.

2015-09-01

We have developed an algorithm for segmentation of cancer cell nuclei in three-channel luminescent images of microbiological specimens. The algorithm is based on using a correlation between fluorescence signals in the detection channels for object segmentation, which permits complete automation of the data analysis procedure. We have carried out a comparative analysis of the proposed method and conventional algorithms implemented in the CellProfiler and ImageJ software packages. Our algorithm has an object localization uncertainty which is 2-3 times smaller than for the conventional algorithms, with comparable segmentation accuracy.

Feasibility study for the administration of remifentanil based on the difference between response entropy and state entropy.

PubMed

Mathews, D M; Cirullo, P M; Struys, M M R F; De Smet, T; Malik, R J; Chang, C L; Neuman, G G

2007-06-01

Facial electromyography (FEMG) may have utility in the assessment of nociception during surgery. The difference between state entropy (SE) and response entropy (RE) is an indirect measure of FEMG. This study assesses an automated algorithm for remifentanil administration that is based on maintaining an entropy difference (ED) that is less than an upper boundary condition and greater than a lower boundary condition. The algorithm was constructed with a development set (n = 40), and then automated and studied with a validation set (n = 20) of patients undergoing anterior cruciate ligament repair. The percentage of time that the ED was maintained between the two boundary conditions was determined. Remifentanil and propofol predicted effect-site concentrations (Ce) were determined at surgical milestones and, after drug discontinuation, the time to response to verbal stimulation and orientation was measured. The median (25th-75th percentile) per cent of time that the ED was recorded between the boundary conditions was 99.3% (98.1-99.8%). Predicted propofol (microg ml(-1)) and remifentanil (ng ml(-1)) Ce (sd), respectively, were 3.5 and 4.0 at induction, 1.9 (0.8) and 7.2 (3.7) at the end of surgery, and 1.1 (0.5) and 3.2 (2.2) at eye opening. The median time to eye opening and orientation was 3.8 and 6.8 min, respectively. This feasibility study supports the concept that remifentanil may be delivered using an algorithm that maintains the difference between SE and RE between the upper and lower boundary condition.

Early time evolution of negative ion clouds and electron density depletions produced during electron attachment chemical release experiments

NASA Technical Reports Server (NTRS)

Scales, W. A.; Bernhardt, P. A.; Ganguli, G.

1994-01-01

Two-dimensional electrostatic particle-in-cell simulations are used to study the early time evolution of electron depletions and negative ion clouds produced during electron attachment chemical releases in the ionosphere. The simulation model considers the evolution in the plane perpendicular to the magnetic field and a three-species plasma that contains electrons, positive ions, and also heavy negative ions that result as a by-product of the electron attachment reaction. The early time evolution (less than the negative ion cyclotron period) of the system shows that a negative charge surplus initially develops outside of the depletion boundary as the heavy negative ions move across the boundary. The electrons are initially restricted from moving into the depletion due to the magnetic field. An inhomogenous electric field develops across the boundary layer due to this charge separation. A highly sheared electron flow velocity develops in the depletion boundary due to E x B and Delta-N x B drifts that result from electron density gradients and this inhomogenous electric field. Structure eventually develops in the depletion boundary layer due to low-frequency electrostatic waves that have growth times shorter than the negative ion cyclotron period. It is proposed that these waves are most likely produced by the electron-ion hybrid instability that results from sufficiently large shears in the electron flow velocity.

Capillary Electrophoresis Sensitivity Enhancement Based on Adaptive Moving Average Method.

PubMed

Drevinskas, Tomas; Telksnys, Laimutis; Maruška, Audrius; Gorbatsova, Jelena; Kaljurand, Mihkel

2018-06-05

In the present work, we demonstrate a novel approach to improve the sensitivity of the "out of lab" portable capillary electrophoretic measurements. Nowadays, many signal enhancement methods are (i) underused (nonoptimal), (ii) overused (distorts the data), or (iii) inapplicable in field-portable instrumentation because of a lack of computational power. The described innovative migration velocity-adaptive moving average method uses an optimal averaging window size and can be easily implemented with a microcontroller. The contactless conductivity detection was used as a model for the development of a signal processing method and the demonstration of its impact on the sensitivity. The frequency characteristics of the recorded electropherograms and peaks were clarified. Higher electrophoretic mobility analytes exhibit higher-frequency peaks, whereas lower electrophoretic mobility analytes exhibit lower-frequency peaks. On the basis of the obtained data, a migration velocity-adaptive moving average algorithm was created, adapted, and programmed into capillary electrophoresis data-processing software. Employing the developed algorithm, each data point is processed depending on a certain migration time of the analyte. Because of the implemented migration velocity-adaptive moving average method, the signal-to-noise ratio improved up to 11 times for sampling frequency of 4.6 Hz and up to 22 times for sampling frequency of 25 Hz. This paper could potentially be used as a methodological guideline for the development of new smoothing algorithms that require adaptive conditions in capillary electrophoresis and other separation methods.

AN FDTD ALGORITHM WITH PERFECTLY MATCHED LAYERS FOR CONDUCTIVE MEDIA. (R825225)

EPA Science Inventory

We extend Berenger's perfectly matched layers (PML) to conductive media. A finite-difference-time-domain (FDTD) algorithm with PML as an absorbing boundary condition is developed for solutions of Maxwell's equations in inhomogeneous, conductive media. For a perfectly matched laye...

A PML-FDTD ALGORITHM FOR SIMULATING PLASMA-COVERED CAVITY-BACKED SLOT ANTENNAS. (R825225)

EPA Science Inventory

A three-dimensional frequency-dependent finite-difference time-domain (FDTD) algorithm with perfectly matched layer (PML) absorbing boundary condition (ABC) and recursive convolution approaches is developed to model plasma-covered open-ended waveguide or cavity-backed slot antenn...

Substorm injection boundaries. [magnetospheric electric field model

NASA Technical Reports Server (NTRS)

Mcilwain, C. E.

1974-01-01

An improved magnetospheric electric field model is used to compute the initial locations of particles injected by several substorms. Trajectories are traced from the time of their encounter with the ATS-5 satellite backwards to the onset time given by ground-based magnetometers. A spiral shaped inner boundary of injection is found which is quite similar to that found by a statistical analysis. This injection boundary is shown to move in an energy dependent fashion which can explain the soft energy spectra observed at the inner edge of the electrons plasma sheet.

Dynamics of place, boundary and object encoding in rat anterior claustrum

PubMed Central

Jankowski, Maciej M.; O’Mara, Shane M.

2015-01-01

Discrete populations of brain cells signal differing types of spatial information. These “spatial cells” are largely confined to a closely-connected network of sites. We describe here, for the first time, cells in the anterior claustrum of the freely-moving rat encoding place, boundary and object information. This novel claustral spatial signal potentially directly modulates a wide variety of anterior cortical regions. We hypothesize that one of the functions of the claustrum is to provide information about body position, boundaries and landmark information, enabling dynamic control of behavior. PMID:26557060

The Linear Bicharacteristic Scheme for Computational Electromagnetics

NASA Technical Reports Server (NTRS)

Beggs, John H.; Chan, Siew-Loong

2000-01-01

The upwind leapfrog or Linear Bicharacteristic Scheme (LBS) has previously been implemented and demonstrated on electromagnetic wave propagation problems. This paper extends the Linear Bicharacteristic Scheme for computational electromagnetics to treat lossy dielectric and magnetic materials and perfect electrical conductors. This is accomplished by proper implementation of the LBS for homogeneous lossy dielectric and magnetic media, and treatment of perfect electrical conductors (PECs) are shown to follow directly in the limit of high conductivity. Heterogeneous media are treated through implementation of surface boundary conditions and no special extrapolations or interpolations at dielectric material boundaries are required. Results are presented for one-dimensional model problems on both uniform and nonuniform grids, and the FDTD algorithm is chosen as a convenient reference algorithm for comparison. The results demonstrate that the explicit LBS is a dissipation-free, second-order accurate algorithm which uses a smaller stencil than the FDTD algorithm, yet it has approximately one-third the phase velocity error. The LBS is also more accurate on nonuniform grids.

Reducing noise component on medical images

NASA Astrophysics Data System (ADS)

Semenishchev, Evgeny; Voronin, Viacheslav; Dub, Vladimir; Balabaeva, Oksana

2018-04-01

Medical visualization and analysis of medical data is an actual direction. Medical images are used in microbiology, genetics, roentgenology, oncology, surgery, ophthalmology, etc. Initial data processing is a major step towards obtaining a good diagnostic result. The paper considers the approach allows an image filtering with preservation of objects borders. The algorithm proposed in this paper is based on sequential data processing. At the first stage, local areas are determined, for this purpose the method of threshold processing, as well as the classical ICI algorithm, is applied. The second stage uses a method based on based on two criteria, namely, L2 norm and the first order square difference. To preserve the boundaries of objects, we will process the transition boundary and local neighborhood the filtering algorithm with a fixed-coefficient. For example, reconstructed images of CT, x-ray, and microbiological studies are shown. The test images show the effectiveness of the proposed algorithm. This shows the applicability of analysis many medical imaging applications.

A Two-Dimensional Linear Bicharacteristic Scheme for Electromagnetics

NASA Technical Reports Server (NTRS)

Beggs, John H.

2002-01-01

The upwind leapfrog or Linear Bicharacteristic Scheme (LBS) has previously been implemented and demonstrated on one-dimensional electromagnetic wave propagation problems. This memorandum extends the Linear Bicharacteristic Scheme for computational electromagnetics to model lossy dielectric and magnetic materials and perfect electrical conductors in two dimensions. This is accomplished by proper implementation of the LBS for homogeneous lossy dielectric and magnetic media and for perfect electrical conductors. Both the Transverse Electric and Transverse Magnetic polarizations are considered. Computational requirements and a Fourier analysis are also discussed. Heterogeneous media are modeled through implementation of surface boundary conditions and no special extrapolations or interpolations at dielectric material boundaries are required. Results are presented for two-dimensional model problems on uniform grids, and the Finite Difference Time Domain (FDTD) algorithm is chosen as a convenient reference algorithm for comparison. The results demonstrate that the two-dimensional explicit LBS is a dissipation-free, second-order accurate algorithm which uses a smaller stencil than the FDTD algorithm, yet it has less phase velocity error.

Numerical algorithms for computations of feedback laws arising in control of flexible systems

NASA Technical Reports Server (NTRS)

Lasiecka, Irena

1989-01-01

Several continuous models will be examined, which describe flexible structures with boundary or point control/observation. Issues related to the computation of feedback laws are examined (particularly stabilizing feedbacks) with sensors and actuators located either on the boundary or at specific point locations of the structure. One of the main difficulties is due to the great sensitivity of the system (hyperbolic systems with unbounded control actions), with respect to perturbations caused either by uncertainty of the model or by the errors introduced in implementing numerical algorithms. Thus, special care must be taken in the choice of the appropriate numerical schemes which eventually lead to implementable finite dimensional solutions. Finite dimensional algorithms are constructed on a basis of a priority analysis of the properties of the original, continuous (infinite diversional) systems with the following criteria in mind: (1) convergence and stability of the algorithms and (2) robustness (reasonable insensitivity with respect to the unknown parameters of the systems). Examples with mixed finite element methods and spectral methods are provided.

Changes in magnetic domain structure during twin boundary motion in single crystal Ni-Mn-Ga exhibiting magnetic shape memory effect

NASA Astrophysics Data System (ADS)

Kopecký, V.; Fekete, L.; Perevertov, O.; Heczko, O.

2016-05-01

The complexity of Ni-Mn-Ga single crystal originates from the interplay between ferromagnetic domain structure and ferroelastic twinned microstructure. Magnetic domain structure in the vicinity of single twin boundary was studied using magneto-optical indicator film and magnetic force microscopy technique. The single twin boundary of Type I was formed mechanically and an initial magnetization state in both variants were restored by local application of magnetic field (≈40 kA/m). The differently oriented variants exhibited either stripe or labyrinth magnetic domain pattern in agreement with the uniaxial magnetocrystalline anisotropy of the martensite. The twin boundary was then moved by compressive or tensile stress. The passage of the boundary resulted in the formation of granular or rake domains, respectively. Additionally, the specific magnetic domains pattern projected by twin boundary gradually vanished during twin boundary motion.

Machine Learning for Biological Trajectory Classification Applications

NASA Technical Reports Server (NTRS)

Sbalzarini, Ivo F.; Theriot, Julie; Koumoutsakos, Petros

2002-01-01

Machine-learning techniques, including clustering algorithms, support vector machines and hidden Markov models, are applied to the task of classifying trajectories of moving keratocyte cells. The different algorithms axe compared to each other as well as to expert and non-expert test persons, using concepts from signal-detection theory. The algorithms performed very well as compared to humans, suggesting a robust tool for trajectory classification in biological applications.

Discrete-State Simulated Annealing For Traveling-Wave Tube Slow-Wave Circuit Optimization

NASA Technical Reports Server (NTRS)

Wilson, Jeffrey D.; Bulson, Brian A.; Kory, Carol L.; Williams, W. Dan (Technical Monitor)

2001-01-01

Algorithms based on the global optimization technique of simulated annealing (SA) have proven useful in designing traveling-wave tube (TWT) slow-wave circuits for high RF power efficiency. The characteristic of SA that enables it to determine a globally optimized solution is its ability to accept non-improving moves in a controlled manner. In the initial stages of the optimization, the algorithm moves freely through configuration space, accepting most of the proposed designs. This freedom of movement allows non-intuitive designs to be explored rather than restricting the optimization to local improvement upon the initial configuration. As the optimization proceeds, the rate of acceptance of non-improving moves is gradually reduced until the algorithm converges to the optimized solution. The rate at which the freedom of movement is decreased is known as the annealing or cooling schedule of the SA algorithm. The main disadvantage of SA is that there is not a rigorous theoretical foundation for determining the parameters of the cooling schedule. The choice of these parameters is highly problem dependent and the designer needs to experiment in order to determine values that will provide a good optimization in a reasonable amount of computational time. This experimentation can absorb a large amount of time especially when the algorithm is being applied to a new type of design. In order to eliminate this disadvantage, a variation of SA known as discrete-state simulated annealing (DSSA), was recently developed. DSSA provides the theoretical foundation for a generic cooling schedule which is problem independent, Results of similar quality to SA can be obtained, but without the extra computational time required to tune the cooling parameters. Two algorithm variations based on DSSA were developed and programmed into a Microsoft Excel spreadsheet graphical user interface (GUI) to the two-dimensional nonlinear multisignal helix traveling-wave amplifier analysis program TWA3. The algorithms were used to optimize the computed RF efficiency of a TWT by determining the phase velocity profile of the slow-wave circuit. The mathematical theory and computational details of the DSSA algorithms will be presented and results will be compared to those obtained with a SA algorithm.

Retinal layer segmentation of macular OCT images using boundary classification

PubMed Central

Lang, Andrew; Carass, Aaron; Hauser, Matthew; Sotirchos, Elias S.; Calabresi, Peter A.; Ying, Howard S.; Prince, Jerry L.

2013-01-01

Optical coherence tomography (OCT) has proven to be an essential imaging modality for ophthalmology and is proving to be very important in neurology. OCT enables high resolution imaging of the retina, both at the optic nerve head and the macula. Macular retinal layer thicknesses provide useful diagnostic information and have been shown to correlate well with measures of disease severity in several diseases. Since manual segmentation of these layers is time consuming and prone to bias, automatic segmentation methods are critical for full utilization of this technology. In this work, we build a random forest classifier to segment eight retinal layers in macular cube images acquired by OCT. The random forest classifier learns the boundary pixels between layers, producing an accurate probability map for each boundary, which is then processed to finalize the boundaries. Using this algorithm, we can accurately segment the entire retina contained in the macular cube to an accuracy of at least 4.3 microns for any of the nine boundaries. Experiments were carried out on both healthy and multiple sclerosis subjects, with no difference in the accuracy of our algorithm found between the groups. PMID:23847738

Comparison of Bayesian clustering and edge detection methods for inferring boundaries in landscape genetics

USGS Publications Warehouse

Safner, T.; Miller, M.P.; McRae, B.H.; Fortin, M.-J.; Manel, S.

2011-01-01

Recently, techniques available for identifying clusters of individuals or boundaries between clusters using genetic data from natural populations have expanded rapidly. Consequently, there is a need to evaluate these different techniques. We used spatially-explicit simulation models to compare three spatial Bayesian clustering programs and two edge detection methods. Spatially-structured populations were simulated where a continuous population was subdivided by barriers. We evaluated the ability of each method to correctly identify boundary locations while varying: (i) time after divergence, (ii) strength of isolation by distance, (iii) level of genetic diversity, and (iv) amount of gene flow across barriers. To further evaluate the methods' effectiveness to detect genetic clusters in natural populations, we used previously published data on North American pumas and a European shrub. Our results show that with simulated and empirical data, the Bayesian spatial clustering algorithms outperformed direct edge detection methods. All methods incorrectly detected boundaries in the presence of strong patterns of isolation by distance. Based on this finding, we support the application of Bayesian spatial clustering algorithms for boundary detection in empirical datasets, with necessary tests for the influence of isolation by distance. ?? 2011 by the authors; licensee MDPI, Basel, Switzerland.

Ecological and life-history traits explain recent boundary shifts in elevation and latitude of western North American songbirds

Treesearch

Sonya K. Auer; David I. King

2014-01-01

Species are expected to move uphill or poleward in response to climate change, yet their distributions show idiosyncratic responses; many species are moving in the predicted direction, but others are not shifting at all or are shifting downhill or towards the equator. Fundamental questions remain about the causes of interspecific variation in range responses and...

Two-dimensional shear wave speed and crawling wave speed recoveries from in vitro prostate data

PubMed Central

Lin, Kui; McLaughlin, Joyce R.; Thomas, Ashley; Parker, Kevin; Castaneda, Benjamin; Rubens, Deborah J.

2011-01-01

The crawling wave experiment was developed to capture a shear wave induced moving interference pattern that is created by two harmonic vibration sources oscillating at different but almost the same frequencies. Using the vibration sonoelastography technique, the spectral variance image reveals a moving interference pattern. It has been shown that the speed of the moving interference pattern, i.e., the crawling wave speed, is proportional to the shear wave speed with a nonlinear factor. This factor can generate high-speed artifacts in the crawling wave speed images that do not actually correspond to increased stiffness. In this paper, an inverse algorithm is developed to reconstruct both the crawling wave speed and the shear wave speed using the phases of the crawling wave and the shear wave. The feature for the data is the application to in vitro prostate data, while the features for the algorithm include the following: (1) A directional filter is implemented to obtain a wave moving in only one direction; and (2) an L1 minimization technique with physics inspired constraints is employed to calculate the phase of the crawling wave and to eliminate jump discontinuities from the phase of the shear wave. The algorithm is tested on in vitro prostate data measured at the Rochester Center for Biomedical Ultrasound and University of Rochester. Each aspect of the algorithm is shown to yield image improvement. The results demonstrate that the shear wave speed images can have less artifacts than the crawling wave images. Examples are presented where the shear wave speed recoveries have excellent agreement with histology results on the size, shape, and location of cancerous tissues in the glands. PMID:21786924

Preliminary Work for Modeling the Propellers of an Aircraft as a Noise Source in an Acoustic Boundary Element Analysis

NASA Technical Reports Server (NTRS)

Vlahopoulos, Nickolas; Lyle, Karen H.; Burley, Casey L.

1998-01-01

An algorithm for generating appropriate velocity boundary conditions for an acoustic boundary element analysis from the kinematics of an operating propeller is presented. It constitutes the initial phase of Integrating sophisticated rotorcraft models into a conventional boundary element analysis. Currently, the pressure field is computed by a linear approximation. An initial validation of the developed process was performed by comparing numerical results to test data for the external acoustic pressure on the surface of a tilt-rotor aircraft for one flight condition.

Experimental verification of a 4D MLEM reconstruction algorithm used for in-beam PET measurements in particle therapy

NASA Astrophysics Data System (ADS)

Stützer, K.; Bert, C.; Enghardt, W.; Helmbrecht, S.; Parodi, K.; Priegnitz, M.; Saito, N.; Fiedler, F.

2013-08-01

In-beam positron emission tomography (PET) has been proven to be a reliable technique in ion beam radiotherapy for the in situ and non-invasive evaluation of the correct dose deposition in static tumour entities. In the presence of intra-fractional target motion an appropriate time-resolved (four-dimensional, 4D) reconstruction algorithm has to be used to avoid reconstructed activity distributions suffering from motion-related blurring artefacts and to allow for a dedicated dose monitoring. Four-dimensional reconstruction algorithms from diagnostic PET imaging that can properly handle the typically low counting statistics of in-beam PET data have been adapted and optimized for the characteristics of the double-head PET scanner BASTEI installed at GSI Helmholtzzentrum Darmstadt, Germany (GSI). Systematic investigations with moving radioactive sources demonstrate the more effective reduction of motion artefacts by applying a 4D maximum likelihood expectation maximization (MLEM) algorithm instead of the retrospective co-registration of phasewise reconstructed quasi-static activity distributions. Further 4D MLEM results are presented from in-beam PET measurements of irradiated moving phantoms which verify the accessibility of relevant parameters for the dose monitoring of intra-fractionally moving targets. From in-beam PET listmode data sets acquired together with a motion surrogate signal, valuable images can be generated by the 4D MLEM reconstruction for different motion patterns and motion-compensated beam delivery techniques.

CT brush and CancerZap!: two video games for computed tomography dose minimization.

PubMed

Alvare, Graham; Gordon, Richard

2015-05-12

X-ray dose from computed tomography (CT) scanners has become a significant public health concern. All CT scanners spray x-ray photons across a patient, including those using compressive sensing algorithms. New technologies make it possible to aim x-ray beams where they are most needed to form a diagnostic or screening image. We have designed a computer game, CT Brush, that takes advantage of this new flexibility. It uses a standard MART algorithm (Multiplicative Algebraic Reconstruction Technique), but with a user defined dynamically selected subset of the rays. The image appears as the player moves the CT brush over an initially blank scene, with dose accumulating with every "mouse down" move. The goal is to find the "tumor" with as few moves (least dose) as possible. We have successfully implemented CT Brush in Java and made it available publicly, requesting crowdsourced feedback on improving the open source code. With this experience, we also outline a "shoot 'em up game" CancerZap! for photon limited CT. We anticipate that human computing games like these, analyzed by methods similar to those used to understand eye tracking, will lead to new object dependent CT algorithms that will require significantly less dose than object independent nonlinear and compressive sensing algorithms that depend on sprayed photons. Preliminary results suggest substantial dose reduction is achievable.

The Stefan problem of solidification of ternary systems in the presence of moving phase transition regions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alexandrov, D. V., E-mail: Dmitri.Alexandrov@usu.ru; Ivanov, A. A.

2009-05-15

The process of solidification of ternary systems in the presence of moving phase transition regions has been investigated theoretically in terms of the nonlinear equation of the liquidus surface. A mathematical model is developed and an approximate analytical solution to the Stefan problem is constructed for a linear temperature profile in two-phase zones. The temperature and impurity concentration distributions are determined, the solid-phase fractions in the phase transition regions are obtained, and the laws of motion of their boundaries are established. It is demonstrated that all boundaries move in accordance with the laws of direct proportionality to the square rootmore » of time, which is a general property of self-similar processes. It is substantiated that the concentration of an impurity of the substance undergoing a phase transition only in the cotectic zone increases in this zone and decreases in the main two-phase zone in which the other component of the substance undergoes a phase transition. In the process, the concentration reaches a maximum at the interface between the main two-phase zone and the cotectic two-phase zone. The revealed laws of motion of the outer boundaries of the entire phase transition region do not depend on the amount of the components under consideration and hold true for crystallization of a multicomponent system.« less

Boundary layer height determination from Lidar for improving air pollution episode modelling: development of new algorithm and evaluation

NASA Astrophysics Data System (ADS)

Yang, T.; Wang, Z.; Zhang, W.; Gbaguidi, A.; Sugimoto, N.; Matsui, I.; Wang, X.; Yele, S.

2017-12-01

Predicting air pollution events in low atmosphere over megacities requires thorough understanding of the tropospheric dynamic and chemical processes, involving notably, continuous and accurate determination of the boundary layer height (BLH). Through intensive observations experimented over Beijing (China), and an exhaustive evaluation existing algorithms applied to the BLH determination, persistent critical limitations are noticed, in particular over polluted episodes. Basically, under weak thermal convection with high aerosol loading, none of the retrieval algorithms is able to fully capture the diurnal cycle of the BLH due to pollutant insufficient vertical mixing in the boundary layer associated with the impact of gravity waves on the tropospheric structure. Subsequently, a new approach based on gravity wave theory (the cubic root gradient method: CRGM), is developed to overcome such weakness and accurately reproduce the fluctuations of the BLH under various atmospheric pollution conditions. Comprehensive evaluation of CRGM highlights its high performance in determining BLH from Lidar. In comparison with the existing retrieval algorithms, the CRGM potentially reduces related computational uncertainties and errors from BLH determination (strong increase of correlation coefficient from 0.44 to 0.91 and significant decreases of the root mean square error from 643 m to 142 m). Such newly developed technique is undoubtedly expected to contribute to improve the accuracy of air quality modelling and forecasting systems.

Lung boundary detection in pediatric chest x-rays

NASA Astrophysics Data System (ADS)

Candemir, Sema; Antani, Sameer; Jaeger, Stefan; Browning, Renee; Thoma, George R.

2015-03-01

Tuberculosis (TB) is a major public health problem worldwide, and highly prevalent in developing countries. According to the World Health Organization (WHO), over 95% of TB deaths occur in low- and middle- income countries that often have under-resourced health care systems. In an effort to aid population screening in such resource challenged settings, the U.S. National Library of Medicine has developed a chest X-ray (CXR) screening system that provides a pre-decision on pulmonary abnormalities. When the system is presented with a digital CXR image from the Picture Archive and Communication Systems (PACS) or an imaging source, it automatically identifies the lung regions in the image, extracts image features, and classifies the image as normal or abnormal using trained machine-learning algorithms. The system has been trained on adult CXR images, and this article presents enhancements toward including pediatric CXR images. Our adult lung boundary detection algorithm is model-based. We note the lung shape differences during pediatric developmental stages, and adulthood, and propose building new lung models suitable for pediatric developmental stages. In this study, we quantify changes in lung shape from infancy to adulthood toward enhancing our lung segmentation algorithm. Our initial findings suggest pediatric age groupings of 0 - 23 months, 2 - 10 years, and 11 - 18 years. We present justification for our groupings. We report on the quality of boundary detection algorithm with the pediatric lung models.

A shifted Jacobi collocation algorithm for wave type equations with non-local conservation conditions

NASA Astrophysics Data System (ADS)

Doha, Eid H.; Bhrawy, Ali H.; Abdelkawy, Mohammed A.

2014-09-01

In this paper, we propose an efficient spectral collocation algorithm to solve numerically wave type equations subject to initial, boundary and non-local conservation conditions. The shifted Jacobi pseudospectral approximation is investigated for the discretization of the spatial variable of such equations. It possesses spectral accuracy in the spatial variable. The shifted Jacobi-Gauss-Lobatto (SJ-GL) quadrature rule is established for treating the non-local conservation conditions, and then the problem with its initial and non-local boundary conditions are reduced to a system of second-order ordinary differential equations in temporal variable. This system is solved by two-stage forth-order A-stable implicit RK scheme. Five numerical examples with comparisons are given. The computational results demonstrate that the proposed algorithm is more accurate than finite difference method, method of lines and spline collocation approach

Assimilation of Wave and Current Data for Prediction of Inlet and River Mouth Dynamics

DTIC Science & Technology

2013-07-01

onto the Delft3D computational grid and the specification of Riemann -type boundary conditions for the boundary-normal velocity and surface elevation...conditions from time- history data from in situ tide gages. The corrections are applied to the surface-elevation contribution to the Riemann boundary...The algorithms described above are all of the strong-constraint variational variety, and make use of adjoint solvers corresponding to the various

Radar Detection of Marine Mammals

DTIC Science & Technology

2010-09-30

associative tracker using the Munkres algorithm was used. This was then expanded to include a track - before - detect algorithm, the Baysean Field...small, slow moving objects (i.e. whales). In order to address the third concern (M2 mode), we have tested using a track - before - detect tracker termed

An analysis of the effect of defect structures on catalytic surfaces by the boundary element technique

NASA Astrophysics Data System (ADS)

Peirce, Anthony P.; Rabitz, Herschel

1988-08-01

The boundary element (BE) technique is used to analyze the effect of defects on one-dimensional chemically active surfaces. The standard BE algorithm for diffusion is modified to include the effects of bulk desorption by making use of an asymptotic expansion technique to evaluate influences near boundaries and defect sites. An explicit time evolution scheme is proposed to treat the non-linear equations associated with defect sites. The proposed BE algorithm is shown to provide an efficient and convergent algorithm for modelling localized non-linear behavior. Since it exploits the actual Green's function of the linear diffusion-desorption process that takes place on the surface, the BE algorithm is extremely stable. The BE algorithm is applied to a number of interesting physical problems in which non-linear reactions occur at localized defects. The Lotka-Volterra system is considered in which the source, sink and predator-prey interaction terms are distributed at different defect sites in the domain and in which the defects are coupled by diffusion. This example provides a stringent test of the stability of the numerical algorithm. Marginal stability oscillations are analyzed for the Prigogine-Lefever reaction that occurs on a lattice of defects. Dissipative effects are observed for large perturbations to the marginal stability state, and rapid spatial reorganization of uniformly distributed initial perturbations is seen to take place. In another series of examples the effect of defect locations on the balance between desorptive processes on chemically active surfaces is considered. The effect of dynamic pulsing at various time-scales is considered for a one species reactive trapping model. Similar competitive behavior between neighboring defects previously observed for static adsorption levels is shown to persist for dynamic loading of the surface. The analysis of a more complex three species reaction process also provides evidence of competitive behavior between neighboring defect sites. The proposed BE algorithm is shown to provide a useful technique for analyzing the effect of defect sites on chemically active surfaces.