An Approach to Quad Meshing Based On Cross Valued Maps and the Ginzburg-Landau Theory

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

Viertel, Ryan; Osting, Braxton

2017-08-01

A generalization of vector fields, referred to as N-direction fields or cross fields when N=4, has been recently introduced and studied for geometry processing, with applications in quadrilateral (quad) meshing, texture mapping, and parameterization. We make the observation that cross field design for two-dimensional quad meshing is related to the well-known Ginzburg-Landau problem from mathematical physics. This identification yields a variety of theoretical tools for efficiently computing boundary-aligned quad meshes, with provable guarantees on the resulting mesh, for example, the number of mesh defects and bounds on the defect locations. The procedure for generating the quad mesh is to (i)more » find a complex-valued "representation" field that minimizes the Dirichlet energy subject to a boundary constraint, (ii) convert the representation field into a boundary-aligned, smooth cross field, (iii) use separatrices of the cross field to partition the domain into four sided regions, and (iv) mesh each of these four-sided regions using standard techniques. Under certain assumptions on the geometry of the domain, we prove that this procedure can be used to produce a cross field whose separatrices partition the domain into four sided regions. To solve the energy minimization problem for the representation field, we use an extension of the Merriman-Bence-Osher (MBO) threshold dynamics method, originally conceived as an algorithm to simulate motion by mean curvature, to minimize the Ginzburg-Landau energy for the optimal representation field. Lastly, we demonstrate the method on a variety of test domains.« less

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.

Cross contrast multi-channel image registration using image synthesis for MR brain images.

PubMed

Chen, Min; Carass, Aaron; Jog, Amod; Lee, Junghoon; Roy, Snehashis; Prince, Jerry L

2017-02-01

Multi-modal deformable registration is important for many medical image analysis tasks such as atlas alignment, image fusion, and distortion correction. Whereas a conventional method would register images with different modalities using modality independent features or information theoretic metrics such as mutual information, this paper presents a new framework that addresses the problem using a two-channel registration algorithm capable of using mono-modal similarity measures such as sum of squared differences or cross-correlation. To make it possible to use these same-modality measures, image synthesis is used to create proxy images for the opposite modality as well as intensity-normalized images from each of the two available images. The new deformable registration framework was evaluated by performing intra-subject deformation recovery, intra-subject boundary alignment, and inter-subject label transfer experiments using multi-contrast magnetic resonance brain imaging data. Three different multi-channel registration algorithms were evaluated, revealing that the framework is robust to the multi-channel deformable registration algorithm that is used. With a single exception, all results demonstrated improvements when compared against single channel registrations using the same algorithm with mutual information. Copyright © 2016 Elsevier B.V. All rights reserved.

Three-dimensional forward solver and its performance analysis for magnetic resonance electrical impedance tomography (MREIT) using recessed electrodes.

PubMed

Lee, Byung Il; Oh, Suk Hoon; Woo, Eung Je; Lee, Soo Yeol; Cho, Min Hyoung; Kwon, Ohin; Seo, Jin Keun; Lee, June-Yub; Baek, Woon Sik

2003-07-07

In magnetic resonance electrical impedance tomography (MREIT), we try to reconstruct a cross-sectional resistivity (or conductivity) image of a subject. When we inject a current through surface electrodes, it generates a magnetic field. Using a magnetic resonance imaging (MRI) scanner, we can obtain the induced magnetic flux density from MR phase images of the subject. We use recessed electrodes to avoid undesirable artefacts near electrodes in measuring magnetic flux densities. An MREIT image reconstruction algorithm produces cross-sectional resistivity images utilizing the measured internal magnetic flux density in addition to boundary voltage data. In order to develop such an image reconstruction algorithm, we need a three-dimensional forward solver. Given injection currents as boundary conditions, the forward solver described in this paper computes voltage and current density distributions using the finite element method (FEM). Then, it calculates the magnetic flux density within the subject using the Biot-Savart law and FEM. The performance of the forward solver is analysed and found to be enough for use in MREIT for resistivity image reconstructions and also experimental designs and validations. The forward solver may find other applications where one needs to compute voltage, current density and magnetic flux density distributions all within a volume conductor.

A memory-efficient staining algorithm in 3D seismic modelling and imaging

NASA Astrophysics Data System (ADS)

Jia, Xiaofeng; Yang, Lu

2017-08-01

The staining algorithm has been proven to generate high signal-to-noise ratio (S/N) images in poorly illuminated areas in two-dimensional cases. In the staining algorithm, the stained wavefield relevant to the target area and the regular source wavefield forward propagate synchronously. Cross-correlating these two wavefields with the backward propagated receiver wavefield separately, we obtain two images: the local image of the target area and the conventional reverse time migration (RTM) image. This imaging process costs massive computer memory for wavefield storage, especially in large scale three-dimensional cases. To make the staining algorithm applicable to three-dimensional RTM, we develop a method to implement the staining algorithm in three-dimensional acoustic modelling in a standard staggered grid finite difference (FD) scheme. The implementation is adaptive to the order of spatial accuracy of the FD operator. The method can be applied to elastic, electromagnetic, and other wave equations. Taking the memory requirement into account, we adopt a random boundary condition (RBC) to backward extrapolate the receiver wavefield and reconstruct it by reverse propagation using the final wavefield snapshot only. Meanwhile, we forward simulate the stained wavefield and source wavefield simultaneously using the nearly perfectly matched layer (NPML) boundary condition. Experiments on a complex geologic model indicate that the RBC-NPML collaborative strategy not only minimizes the memory consumption but also guarantees high quality imaging results. We apply the staining algorithm to three-dimensional RTM via the proposed strategy. Numerical results show that our staining algorithm can produce high S/N images in the target areas with other structures effectively muted.

Driving mechanism of unsteady separation shock motion in hypersonic interactive flow

NASA Technical Reports Server (NTRS)

Dolling, D. S.; Narlo, J. C., II

1987-01-01

Wall pressure fluctuations were measured under the steady separation shock waves in Mach 5 turbulent interactions induced by unswept circular cylinders on a flat plate. The wall temperature was adiabatic. A conditional sampling algorithm was developed to examine the statistics of the shock wave motion. The same algorithm was used to examine data taken in earlier studies in the Princeton University Mach 3 blowdown tunnel. In these earlier studies, hemicylindrically blunted fins of different leading-edge diameters were tested in boundary layers which developed on the tunnel floor and on a flat plate. A description of the algorithm, the reasons why it was developed and the sensitivity of the results to the threshold settings, are discussed. The results from the algorithm, together with cross correlations and power spectral density estimates suggests that the shock motion is driven by the low-frequency unsteadiness of the downstream separated, vortical flow.

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

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.

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.

Two-dimensional joint inversion of Magnetotelluric and local earthquake data: Discussion on the contribution to the solution of deep subsurface structures

NASA Astrophysics Data System (ADS)

Demirci, İsmail; Dikmen, Ünal; Candansayar, M. Emin

2018-02-01

Joint inversion of data sets collected by using several geophysical exploration methods has gained importance and associated algorithms have been developed. To explore the deep subsurface structures, Magnetotelluric and local earthquake tomography algorithms are generally used individually. Due to the usage of natural resources in both methods, it is not possible to increase data quality and resolution of model parameters. For this reason, the solution of the deep structures with the individual usage of the methods cannot be fully attained. In this paper, we firstly focused on the effects of both Magnetotelluric and local earthquake data sets on the solution of deep structures and discussed the results on the basis of the resolving power of the methods. The presence of deep-focus seismic sources increase the resolution of deep structures. Moreover, conductivity distribution of relatively shallow structures can be solved with high resolution by using MT algorithm. Therefore, we developed a new joint inversion algorithm based on the cross gradient function in order to jointly invert Magnetotelluric and local earthquake data sets. In the study, we added a new regularization parameter into the second term of the parameter correction vector of Gallardo and Meju (2003). The new regularization parameter is enhancing the stability of the algorithm and controls the contribution of the cross gradient term in the solution. The results show that even in cases where resistivity and velocity boundaries are different, both methods influence each other positively. In addition, the region of common structural boundaries of the models are clearly mapped compared with original models. Furthermore, deep structures are identified satisfactorily even with using the minimum number of seismic sources. In this paper, in order to understand the future studies, we discussed joint inversion of Magnetotelluric and local earthquake data sets only in two-dimensional space. In the light of these results and by means of the acceleration on the three-dimensional modelling and inversion algorithms, it is thought that it may be easier to identify underground structures with high resolution.

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.

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.

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.

Digital floodplain mapping and an analysis of errors involved

USGS Publications Warehouse

Hamblen, C.S.; Soong, D.T.; Cai, X.

2007-01-01

Mapping floodplain boundaries using geographical information system (GIS) and digital elevation models (DEMs) was completed in a recent study. However convenient this method may appear at first, the resulting maps potentially can have unaccounted errors. Mapping the floodplain using GIS is faster than mapping manually, and digital mapping is expected to be more common in the future. When mapping is done manually, the experience and judgment of the engineer or geographer completing the mapping and the contour resolution of the surface topography are critical in determining the flood-plain and floodway boundaries between cross sections. When mapping is done digitally, discrepancies can result from the use of the computing algorithm and digital topographic datasets. Understanding the possible sources of error and how the error accumulates through these processes is necessary for the validation of automated digital mapping. This study will evaluate the procedure of floodplain mapping using GIS and a 3 m by 3 m resolution DEM with a focus on the accumulated errors involved in the process. Within the GIS environment of this mapping method, the procedural steps of most interest, initially, include: (1) the accurate spatial representation of the stream centerline and cross sections, (2) properly using a triangulated irregular network (TIN) model for the flood elevations of the studied cross sections, the interpolated elevations between them and the extrapolated flood elevations beyond the cross sections, and (3) the comparison of the flood elevation TIN with the ground elevation DEM, from which the appropriate inundation boundaries are delineated. The study area involved is of relatively low topographic relief; thereby, making it representative of common suburban development and a prime setting for the need of accurately mapped floodplains. This paper emphasizes the impacts of integrating supplemental digital terrain data between cross sections on floodplain delineation. ?? 2007 ASCE.

Color naming: color scientists do it between Munsell sheets of color

NASA Astrophysics Data System (ADS)

Beretta, Giordano B.; Moroney, Nathan M.

2010-01-01

With the advent of high dynamic range imaging and wide gamut color spaces, gamut mapping algorithms have to nudge image colors much more drastically to constrain them within a rendering device's gamut. Classical colorimetry is concerned with color matching and the developed color difference metrics are for small distances. For larger distances, categorization becomes a more useful concept. In the gamut mapping case, lexical distance induced by color names is a more useful metric, which translates to the condition that a nudged color may not cross a name boundary. The new problem is to find these color name boundaries. We compare the experimental procedures used for color naming by linguists, ethnologists, and color scientists and propose a methodology that leads to robust repeatable experiments.

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.

Superpixel-based segmentation of muscle fibers in multi-channel microscopy.

PubMed

Nguyen, Binh P; Heemskerk, Hans; So, Peter T C; Tucker-Kellogg, Lisa

2016-12-05

Confetti fluorescence and other multi-color genetic labelling strategies are useful for observing stem cell regeneration and for other problems of cell lineage tracing. One difficulty of such strategies is segmenting the cell boundaries, which is a very different problem from segmenting color images from the real world. This paper addresses the difficulties and presents a superpixel-based framework for segmentation of regenerated muscle fibers in mice. We propose to integrate an edge detector into a superpixel algorithm and customize the method for multi-channel images. The enhanced superpixel method outperforms the original and another advanced superpixel algorithm in terms of both boundary recall and under-segmentation error. Our framework was applied to cross-section and lateral section images of regenerated muscle fibers from confetti-fluorescent mice. Compared with "ground-truth" segmentations, our framework yielded median Dice similarity coefficients of 0.92 and higher. Our segmentation framework is flexible and provides very good segmentations of multi-color muscle fibers. We anticipate our methods will be useful for segmenting a variety of tissues in confetti fluorecent mice and in mice with similar multi-color labels.

Accelerating Pathology Image Data Cross-Comparison on CPU-GPU Hybrid Systems

PubMed Central

Wang, Kaibo; Huai, Yin; Lee, Rubao; Wang, Fusheng; Zhang, Xiaodong; Saltz, Joel H.

2012-01-01

As an important application of spatial databases in pathology imaging analysis, cross-comparing the spatial boundaries of a huge amount of segmented micro-anatomic objects demands extremely data- and compute-intensive operations, requiring high throughput at an affordable cost. However, the performance of spatial database systems has not been satisfactory since their implementations of spatial operations cannot fully utilize the power of modern parallel hardware. In this paper, we provide a customized software solution that exploits GPUs and multi-core CPUs to accelerate spatial cross-comparison in a cost-effective way. Our solution consists of an efficient GPU algorithm and a pipelined system framework with task migration support. Extensive experiments with real-world data sets demonstrate the effectiveness of our solution, which improves the performance of spatial cross-comparison by over 18 times compared with a parallelized spatial database approach. PMID:23355955

Scattering of targets over layered half space using a semi-analytic method in conjunction with FDTD algorithm.

PubMed

Cao, Le; Wei, Bing

2014-08-25

Finite-difference time-domain (FDTD) algorithm with a new method of plane wave excitation is used to investigate the RCS (Radar Cross Section) characteristics of targets over layered half space. Compare with the traditional excitation plane wave method, the calculation memory and time requirement is greatly decreased. The FDTD calculation is performed with a plane wave incidence, and the RCS of far field is obtained by extrapolating the currently calculated data on the output boundary. However, methods available for extrapolating have to evaluate the half space Green function. In this paper, a new method which avoids using the complex and time-consuming half space Green function is proposed. Numerical results show that this method is in good agreement with classic algorithm and it can be used in the fast calculation of scattering and radiation of targets over layered half space.

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.

References and benchmarks for pore-scale flow simulated using micro-CT images of porous media and digital rocks

NASA Astrophysics Data System (ADS)

Saxena, Nishank; Hofmann, Ronny; Alpak, Faruk O.; Berg, Steffen; Dietderich, Jesse; Agarwal, Umang; Tandon, Kunj; Hunter, Sander; Freeman, Justin; Wilson, Ove Bjorn

2017-11-01

We generate a novel reference dataset to quantify the impact of numerical solvers, boundary conditions, and simulation platforms. We consider a variety of microstructures ranging from idealized pipes to digital rocks. Pore throats of the digital rocks considered are large enough to be well resolved with state-of-the-art micro-computerized tomography technology. Permeability is computed using multiple numerical engines, 12 in total, including, Lattice-Boltzmann, computational fluid dynamics, voxel based, fast semi-analytical, and known empirical models. Thus, we provide a measure of uncertainty associated with flow computations of digital media. Moreover, the reference and standards dataset generated is the first of its kind and can be used to test and improve new fluid flow algorithms. We find that there is an overall good agreement between solvers for idealized cross-section shape pipes. As expected, the disagreement increases with increase in complexity of the pore space. Numerical solutions for pipes with sinusoidal variation of cross section show larger variability compared to pipes of constant cross-section shapes. We notice relatively larger variability in computed permeability of digital rocks with coefficient of variation (of up to 25%) in computed values between various solvers. Still, these differences are small given other subsurface uncertainties. The observed differences between solvers can be attributed to several causes including, differences in boundary conditions, numerical convergence criteria, and parameterization of fundamental physics equations. Solvers that perform additional meshing of irregular pore shapes require an additional step in practical workflows which involves skill and can introduce further uncertainty. Computation times for digital rocks vary from minutes to several days depending on the algorithm and available computational resources. We find that more stringent convergence criteria can improve solver accuracy but at the expense of longer computation time.

The Mars Crustal Magnetic Field Control of Plasma Boundary Locations and Atmospheric Loss: MHD Prediction and Comparison with MAVEN

NASA Technical Reports Server (NTRS)

Fang, Xiaohua; Ma, Yingjuan; Masunaga, Kei; Dong, Chuanfei; Brain, David; Halekas, Jasper; Lillis, Robert; Jakosky, Bruce M.; Connerney, Jack; Grebowsky, Joseph;

Multi-contrast MRI registration of carotid arteries based on cross-sectional images and lumen boundaries

NASA Astrophysics Data System (ADS)

Wu, Yu-Xia; Zhang, Xi; Xu, Xiao-Pan; Liu, Yang; Zhang, Guo-Peng; Li, Bao-Juan; Chen, Hui-Jun; Lu, Hong-Bing

2017-02-01

Ischemic stroke has great correlation with carotid atherosclerosis and is mostly caused by vulnerable plaques. It's particularly important to analysis the components of plaques for the detection of vulnerable plaques. Recently plaque analysis based on multi-contrast magnetic resonance imaging has attracted great attention. Though multi-contrast MR imaging has potentials in enhanced demonstration of carotid wall, its performance is hampered by the misalignment of different imaging sequences. In this study, a coarse-to-fine registration strategy based on cross-sectional images and wall boundaries is proposed to solve the problem. It includes two steps: a rigid step using the iterative closest points to register the centerlines of carotid artery extracted from multi-contrast MR images, and a non-rigid step using the thin plate spline to register the lumen boundaries of carotid artery. In the rigid step, the centerline was extracted by tracking the crosssectional images along the vessel direction calculated by Hessian matrix. In the non-rigid step, a shape context descriptor is introduced to find corresponding points of two similar boundaries. In addition, the deterministic annealing technique is used to find a globally optimized solution. The proposed strategy was evaluated by newly developed three-dimensional, fast and high resolution multi-contrast black blood MR imaging. Quantitative validation indicated that after registration, the overlap of two boundaries from different sequences is 95%, and their mean surface distance is 0.12 mm. In conclusion, the proposed algorithm has improved the accuracy of registration effectively for further component analysis of carotid plaques.

Evaluation of the new electron-transport algorithm in MCNP6.1 for the simulation of dose point kernel in water

NASA Astrophysics Data System (ADS)

Antoni, Rodolphe; Bourgois, Laurent

2017-12-01

In this work, the calculation of specific dose distribution in water is evaluated in MCNP6.1 with the regular condensed history algorithm the "detailed electron energy-loss straggling logic" and the new electrons transport algorithm proposed the "single event algorithm". Dose Point Kernel (DPK) is calculated with monoenergetic electrons of 50, 100, 500, 1000 and 3000 keV for different scoring cells dimensions. A comparison between MCNP6 results and well-validated codes for electron-dosimetry, i.e., EGSnrc or Penelope, is performed. When the detailed electron energy-loss straggling logic is used with default setting (down to the cut-off energy 1 keV), we infer that the depth of the dose peak increases with decreasing thickness of the scoring cell, largely due to combined step-size and boundary crossing artifacts. This finding is less prominent for 500 keV, 1 MeV and 3 MeV dose profile. With an appropriate number of sub-steps (ESTEP value in MCNP6), the dose-peak shift is almost complete absent to 50 keV and 100 keV electrons. However, the dose-peak is more prominent compared to EGSnrc and the absorbed dose tends to be underestimated at greater depths, meaning that boundaries crossing artifact are still occurring while step-size artifacts are greatly reduced. When the single-event mode is used for the whole transport, we observe the good agreement of reference and calculated profile for 50 and 100 keV electrons. Remaining artifacts are fully vanished, showing a possible transport treatment for energies less than a hundred of keV and accordance with reference for whatever scoring cell dimension, even if the single event method initially intended to support electron transport at energies below 1 keV. Conversely, results for 500 keV, 1 MeV and 3 MeV undergo a dramatic discrepancy with reference curves. These poor results and so the current unreliability of the method is for a part due to inappropriate elastic cross section treatment from the ENDF/B-VI.8 library in those energy ranges. Accordingly, special care has to be taken in setting choice for calculating electron dose distribution with MCNP6, in particular with regards to dosimetry or nuclear medicine applications.

Generation of three-dimensional delaunay meshes from weakly structured and inconsistent data

NASA Astrophysics Data System (ADS)

Garanzha, V. A.; Kudryavtseva, L. N.

2012-03-01

A method is proposed for the generation of three-dimensional tetrahedral meshes from incomplete, weakly structured, and inconsistent data describing a geometric model. The method is based on the construction of a piecewise smooth scalar function defining the body so that its boundary is the zero isosurface of the function. Such implicit description of three-dimensional domains can be defined analytically or can be constructed from a cloud of points, a set of cross sections, or a "soup" of individual vertices, edges, and faces. By applying Boolean operations over domains, simple primitives can be combined with reconstruction results to produce complex geometric models without resorting to specialized software. Sharp edges and conical vertices on the domain boundary are reproduced automatically without using special algorithms. Refs. 42. Figs. 25.

A study of the geographic coverage properties of a satellite borne Doppler lidar wind velocity measuring system

NASA Technical Reports Server (NTRS)

Pate, T. H.

1982-01-01

Geographic coverage frequency and geographic shot density for a satellite borne Doppler lidar wind velocity measuring system are measured. The equations of motion of the light path on the ground were derived and a computer program devised to compute shot density and coverage frequency by latitude-longitude sections. The equations for the coverage boundaries were derived and a computer program developed to plot these boundaries, thus making it possible, after an application of a map coloring algorithm, to actually see the areas of multiple coverage. A theoretical cross-swath shot density function that gives close approximations in certain cases was also derived. This information should aid in the design of an efficient data-processing system for the Doppler lidar.

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.

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

Automated bow shock and radiation belt edge identification methods and their application for Cluster, THEMIS/ARTEMIS and Van Allen Probes data

NASA Astrophysics Data System (ADS)

Facsko, Gabor; Sibeck, David; Balogh, Tamas; Kis, Arpad; Wesztergom, Viktor

2017-04-01

The bow shock and the outer rim of the outer radiation belt are detected automatically by our algorithm developed as a part of the Boundary Layer Identification Code Cluster Active Archive project. The radiation belt positions are determined from energized electron measurements working properly onboard all Cluster spacecraft. For bow shock identification we use magnetometer data and, when available, ion plasma instrument data. In addition, electrostatic wave instrument electron density, spacecraft potential measurements and wake indicator auxiliary data are also used so the events can be identified by all Cluster probes in highly redundant way, as the magnetometer and these instruments are still operational in all spacecraft. The capability and performance of the bow shock identification algorithm were tested using known bow shock crossing determined manually from January 29, 2002 to February 3,. The verification enabled 70% of the bow shock crossings to be identified automatically. The method shows high flexibility and it can be applied to observations from various spacecraft. Now these tools have been applied to Time History of Events and Macroscale Interactions during Substorms (THEMIS)/Acceleration, Reconnection, Turbulence, and Electrodynamics of the Moon's Interaction with the Sun (ARTEMIS) magnetic field, plasma and spacecraft potential observations to identify bow shock crossings; and to Van Allen Probes supra-thermal electron observations to identify the edges of the radiation belt. The outcomes of the algorithms are checked manually and the parameters used to search for bow shock identification are refined.

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

Superpixel-based and boundary-sensitive convolutional neural network for automated liver segmentation

NASA Astrophysics Data System (ADS)

Qin, Wenjian; Wu, Jia; Han, Fei; Yuan, Yixuan; Zhao, Wei; Ibragimov, Bulat; Gu, Jia; Xing, Lei

2018-05-01

Segmentation of liver in abdominal computed tomography (CT) is an important step for radiation therapy planning of hepatocellular carcinoma. Practically, a fully automatic segmentation of liver remains challenging because of low soft tissue contrast between liver and its surrounding organs, and its highly deformable shape. The purpose of this work is to develop a novel superpixel-based and boundary sensitive convolutional neural network (SBBS-CNN) pipeline for automated liver segmentation. The entire CT images were first partitioned into superpixel regions, where nearby pixels with similar CT number were aggregated. Secondly, we converted the conventional binary segmentation into a multinomial classification by labeling the superpixels into three classes: interior liver, liver boundary, and non-liver background. By doing this, the boundary region of the liver was explicitly identified and highlighted for the subsequent classification. Thirdly, we computed an entropy-based saliency map for each CT volume, and leveraged this map to guide the sampling of image patches over the superpixels. In this way, more patches were extracted from informative regions (e.g. the liver boundary with irregular changes) and fewer patches were extracted from homogeneous regions. Finally, deep CNN pipeline was built and trained to predict the probability map of the liver boundary. We tested the proposed algorithm in a cohort of 100 patients. With 10-fold cross validation, the SBBS-CNN achieved mean Dice similarity coefficients of 97.31  ±  0.36% and average symmetric surface distance of 1.77  ±  0.49 mm. Moreover, it showed superior performance in comparison with state-of-art methods, including U-Net, pixel-based CNN, active contour, level-sets and graph-cut algorithms. SBBS-CNN provides an accurate and effective tool for automated liver segmentation. It is also envisioned that the proposed framework is directly applicable in other medical image segmentation scenarios.

An approach to the development of numerical algorithms for first order linear hyperbolic systems in multiple space dimensions: The constant coefficient case

NASA Technical Reports Server (NTRS)

Goodrich, John W.

1995-01-01

Two methods for developing high order single step explicit algorithms on symmetric stencils with data on only one time level are presented. Examples are given for the convection and linearized Euler equations with up to the eighth order accuracy in both space and time in one space dimension, and up to the sixth in two space dimensions. The method of characteristics is generalized to nondiagonalizable hyperbolic systems by using exact local polynominal solutions of the system, and the resulting exact propagator methods automatically incorporate the correct multidimensional wave propagation dynamics. Multivariate Taylor or Cauchy-Kowaleskaya expansions are also used to develop algorithms. Both of these methods can be applied to obtain algorithms of arbitrarily high order for hyperbolic systems in multiple space dimensions. Cross derivatives are included in the local approximations used to develop the algorithms in this paper in order to obtain high order accuracy, and improved isotropy and stability. Efficiency in meeting global error bounds is an important criterion for evaluating algorithms, and the higher order algorithms are shown to be up to several orders of magnitude more efficient even though they are more complex. Stable high order boundary conditions for the linearized Euler equations are developed in one space dimension, and demonstrated in two space dimensions.

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.

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.

Application of continuous-wave terahertz computed tomography for the analysis of chicken bone structure

NASA Astrophysics Data System (ADS)

Li, Bin; Wang, Dayong; Rong, Lu; Zhai, Changchao; Wang, Yunxin; Zhao, Jie

2018-02-01

Terahertz (THz) radiation is able to penetrate many different types of nonpolar and nonmetallic materials without the damaging effects of x-rays. THz technology can be combined with computed tomography (CT) to form THz CT, which is an effective imaging method that is used to visualize the internal structure of a three-dimensional sample as cross-sectional images. Here, we reported an application of THz as the radiation source in CT imaging by replacing the x-rays. In this method, the sample cross section is scanned in all translation and rotation directions. Then, the projection data are reconstructed using a tomographic reconstruction algorithm. Two-dimensional (2-D) cross-sectional images of the chicken ulna were obtained through the continuous-wave (CW) THz CT system. Given by the difference of the THz absorption of different substances, the compact bone and spongy bone inside the chicken ulna are structurally distinguishable in the 2-D cross-sectional images. Using the filtered back projection algorithm, we reconstructed the projection data of the chicken ulna at different projection angle intervals and found that the artifacts and noise in the images are strikingly increased when the projection angle intervals become larger, reflected by the blurred boundary of the compact bone. The quality and fidelity of the 2-D cross-sectional images could be substantially improved by reducing the projection angle intervals. Our experimental data demonstrated a feasible application of the CW THz CT system in biological imaging.

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

An O(Nm(sup 2)) Plane Solver for the Compressible Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Thomas, J. L.; Bonhaus, D. L.; Anderson, W. K.; Rumsey, C. L.; Biedron, R. T.

1999-01-01

A hierarchical multigrid algorithm for efficient steady solutions to the two-dimensional compressible Navier-Stokes equations is developed and demonstrated. The algorithm applies multigrid in two ways: a Full Approximation Scheme (FAS) for a nonlinear residual equation and a Correction Scheme (CS) for a linearized defect correction implicit equation. Multigrid analyses which include the effect of boundary conditions in one direction are used to estimate the convergence rate of the algorithm for a model convection equation. Three alternating-line- implicit algorithms are compared in terms of efficiency. The analyses indicate that full multigrid efficiency is not attained in the general case; the number of cycles to attain convergence is dependent on the mesh density for high-frequency cross-stream variations. However, the dependence is reasonably small and fast convergence is eventually attained for any given frequency with either the FAS or the CS scheme alone. The paper summarizes numerical computations for which convergence has been attained to within truncation error in a few multigrid cycles for both inviscid and viscous ow simulations on highly stretched meshes.

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.

An experimental comparison of various methods of nearfield acoustic holography

DOE PAGES

Chelliah, Kanthasamy; Raman, Ganesh; Muehleisen, Ralph T.

2017-05-19

An experimental comparison of four different methods of nearfield acoustic holography (NAH) is presented in this study for planar acoustic sources. The four NAH methods considered in this study are based on: (1) spatial Fourier transform, (2) equivalent sources model, (3) boundary element methods and (4) statistically optimized NAH. Two dimensional measurements were obtained at different distances in front of a tonal sound source and the NAH methods were used to reconstruct the sound field at the source surface. Reconstructed particle velocity and acoustic pressure fields presented in this study showed that the equivalent sources model based algorithm along withmore » Tikhonov regularization provided the best localization of the sources. Reconstruction errors were found to be smaller for the equivalent sources model based algorithm and the statistically optimized NAH algorithm. Effect of hologram distance on the performance of various algorithms is discussed in detail. The study also compares the computational time required by each algorithm to complete the comparison. Four different regularization parameter choice methods were compared. The L-curve method provided more accurate reconstructions than the generalized cross validation and the Morozov discrepancy principle. Finally, the performance of fixed parameter regularization was comparable to that of the L-curve method.« less

An experimental comparison of various methods of nearfield acoustic holography

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

Chelliah, Kanthasamy; Raman, Ganesh; Muehleisen, Ralph T.

An experimental comparison of four different methods of nearfield acoustic holography (NAH) is presented in this study for planar acoustic sources. The four NAH methods considered in this study are based on: (1) spatial Fourier transform, (2) equivalent sources model, (3) boundary element methods and (4) statistically optimized NAH. Two dimensional measurements were obtained at different distances in front of a tonal sound source and the NAH methods were used to reconstruct the sound field at the source surface. Reconstructed particle velocity and acoustic pressure fields presented in this study showed that the equivalent sources model based algorithm along withmore » Tikhonov regularization provided the best localization of the sources. Reconstruction errors were found to be smaller for the equivalent sources model based algorithm and the statistically optimized NAH algorithm. Effect of hologram distance on the performance of various algorithms is discussed in detail. The study also compares the computational time required by each algorithm to complete the comparison. Four different regularization parameter choice methods were compared. The L-curve method provided more accurate reconstructions than the generalized cross validation and the Morozov discrepancy principle. Finally, the performance of fixed parameter regularization was comparable to that of the L-curve method.« less

An improved molecular dynamics algorithm to study thermodiffusion in binary hydrocarbon mixtures

NASA Astrophysics Data System (ADS)

Antoun, Sylvie; Saghir, M. Ziad; Srinivasan, Seshasai

2018-03-01

In multicomponent liquid mixtures, the diffusion flow of chemical species can be induced by temperature gradients, which leads to a separation of the constituent components. This cross effect between temperature and concentration is known as thermodiffusion or the Ludwig-Soret effect. The performance of boundary driven non-equilibrium molecular dynamics along with the enhanced heat exchange (eHEX) algorithm was studied by assessing the thermodiffusion process in n-pentane/n-decane (nC5-nC10) binary mixtures. The eHEX algorithm consists of an extended version of the HEX algorithm with an improved energy conservation property. In addition to this, the transferable potentials for phase equilibria-united atom force field were employed in all molecular dynamics (MD) simulations to precisely model the molecular interactions in the fluid. The Soret coefficients of the n-pentane/n-decane (nC5-nC10) mixture for three different compositions (at 300.15 K and 0.1 MPa) were calculated and compared with the experimental data and other MD results available in the literature. Results of our newly employed MD algorithm showed great agreement with experimental data and a better accuracy compared to other MD procedures.

Semi-automatic 3D lung nodule segmentation in CT using dynamic programming

NASA Astrophysics Data System (ADS)

Sargent, Dustin; Park, Sun Young

2017-02-01

We present a method for semi-automatic segmentation of lung nodules in chest CT that can be extended to general lesion segmentation in multiple modalities. Most semi-automatic algorithms for lesion segmentation or similar tasks use region-growing or edge-based contour finding methods such as level-set. However, lung nodules and other lesions are often connected to surrounding tissues, which makes these algorithms prone to growing the nodule boundary into the surrounding tissue. To solve this problem, we apply a 3D extension of the 2D edge linking method with dynamic programming to find a closed surface in a spherical representation of the nodule ROI. The algorithm requires a user to draw a maximal diameter across the nodule in the slice in which the nodule cross section is the largest. We report the lesion volume estimation accuracy of our algorithm on the FDA lung phantom dataset, and the RECIST diameter estimation accuracy on the lung nodule dataset from the SPIE 2016 lung nodule classification challenge. The phantom results in particular demonstrate that our algorithm has the potential to mitigate the disparity in measurements performed by different radiologists on the same lesions, which could improve the accuracy of disease progression tracking.

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.

Navigating Cross-Boundary Connections in Educational Research

ERIC Educational Resources Information Center

Oikonomidoy, Eleni; Wiest, Lynda R.

2017-01-01

Drawing on insights from reflective research accounts in the social sciences, this paper attends to the complexities of conducting cross-boundary educational research. Cross-boundary research is defined as any type of inquiry that is conducted across cultural and/or structural boundaries, including but not limited to race, class, gender, language,…

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.

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.

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.

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.

Applying the Explicit Time Central Difference Method for Numerical Simulation of the Dynamic Behavior of Elastoplastic Flexible Reinforced Plates

NASA Astrophysics Data System (ADS)

Yankovskii, A. P.

2017-12-01

Based on a stepwise algorithm involving central finite differences for the approximation in time, a mathematical model is developed for elastoplastic deformation of cross-reinforced plates with isotropically hardening materials of components of the composition. The model allows obtaining the solution of elastoplastic problems at discrete points in time by an explicit scheme. The initial boundary value problem of the dynamic behavior of flexible plates reinforced in their own plane is formulated in the von Kármán approximation with allowance for their weakened resistance to the transverse shear. With a common approach, the resolving equations corresponding to two variants of the Timoshenko theory are obtained. An explicit "cross" scheme for numerical integration of the posed initial boundary value problem has been constructed. The scheme is consistent with the incremental algorithm used for simulating the elastoplastic behavior of a reinforced medium. Calculations of the dynamic behavior have been performed for elastoplastic cylindrical bending of differently reinforced fiberglass rectangular elongated plates. It is shown that the reinforcement structure significantly affects their elastoplastic dynamic behavior. It has been found that the classical theory of plates is as a rule unacceptable for carrying out the required calculations (except for very thin plates), and the first version of the Timoshenko theory yields reasonable results only in cases of relatively thin constructions reinforced by lowmodulus fibers. Proceeding from the results of the work, it is recommended to use the second variant of the Timoshenko theory (as a more accurate one) for calculations of the elastoplastic behavior of reinforced plates.

Direct simulation of high-speed mixing layers

NASA Technical Reports Server (NTRS)

Mukunda, H. S.; Sekar, B.; Carpenter, M. H.; Drummond, J. Philip; Kumar, Ajay

1992-01-01

A computational study of a nonreacting high-speed mixing layer is performed. A higher order algorithm with sufficient grid points is used to resolve all relevant scales. In all cases, a temporal free-stream disturbance is introduced. The resulting flow is time-sampled to generate a statistical cross section of the flow properties. The studies are conducted at two convective Mach numbers, three free-stream turbulence intensities, three Reynolds numbers, and two types of initial profiles-hyperbolic tangent (tanh) and boundary layer. The boundary-layer profile leads to more realistic predictions of the transition processes. The predicted transition Reynolds number of 0.18 x 10(exp 6) compares well with experimental data. Normalized vortex spacings for the boundary-layer case are about 3.5 and compare favorably with the 1.5 to 2.5 found in experimental measurements. The tanh profile produces spacings of about 10. The growth rate of the layer is shown to be moderately affected by the initial disturbance field, but comparison with experimental data shows moderate agreement. For the boundary-layer case, it is shown that noise at the Strouhal number of 0.007 is selectively amplified and shows little Reynolds number dependence.

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.

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

Dual agency, dual relationships, boundary crossings, and associated boundary violations: a survey of military and civilian psychiatrists.

PubMed

Hines, A H; Ader, D N; Chang, A S; Rundell, J R

1998-12-01

We hypothesized that psychiatrists with high dual-agency potential (military and health maintenance organization [HMO] psychiatrists) were more likely than non-HMO civilian psychiatrists to engage in dual relationships, report pressures to do so, participate in other general boundary-crossing activities, and report associated counter-therapeutic outcomes (boundary violations). Ninety military and 191 demographically matched civilian psychiatrists reported the number of boundary-crossing activities (including dual relationships) and associated counter-therapeutic outcomes in the preceding year with adult patients. Military and HMO psychiatrists reported greater external pressures than non-HMO civilian psychiatrists to engage in dual relationships; however, all three groups were similar in their reported numbers of dual relationships. The reported boundary-crossing activities and dual relationships studied here are not necessarily associated with reported boundary violations. The relative risk of a particular boundary crossing associating with harm to a patient likely depends on the therapeutic context and should be determined on a case-by-case basis.

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.

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.

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

Privacy protection versus cluster detection in spatial epidemiology.

PubMed

Olson, Karen L; Grannis, Shaun J; Mandl, Kenneth D

2006-11-01

Patient data that includes precise locations can reveal patients' identities, whereas data aggregated into administrative regions may preserve privacy and confidentiality. We investigated the effect of varying degrees of address precision (exact latitude and longitude vs the center points of zip code or census tracts) on detection of spatial clusters of cases. We simulated disease outbreaks by adding supplementary spatially clustered emergency department visits to authentic hospital emergency department syndromic surveillance data. We identified clusters with a spatial scan statistic and evaluated detection rate and accuracy. More clusters were identified, and clusters were more accurately detected, when exact locations were used. That is, these clusters contained at least half of the simulated points and involved few additional emergency department visits. These results were especially apparent when the synthetic clustered points crossed administrative boundaries and fell into multiple zip code or census tracts. The spatial cluster detection algorithm performed better when addresses were analyzed as exact locations than when they were analyzed as center points of zip code or census tracts, particularly when the clustered points crossed administrative boundaries. Use of precise addresses offers improved performance, but this practice must be weighed against privacy concerns in the establishment of public health data exchange policies.

Determination of the boundary conditions of the grinding load in ball mills

NASA Astrophysics Data System (ADS)

Sharapov, Rashid R.

2018-02-01

The prospects of application in ball mills for grinding cement clinker with inclined partitions are shown. It is noted that ball mills with inclined partitions are more effective. An algorithm is proposed for calculating the power consumed by a ball mill with inclined inter-chamber partitions in which an axial movement of the ball load takes place. The boundary conditions in which the ball load is located are determined. The equations of bounding the grinding load are determined. The behavior of a grinding load is considered in view of the characteristic cross sections. The coordinates of the centers of gravity of the grinding load with a definite step and the shape of the cross sections are determined. It is theoretically shown that grinding load in some parts of the ball mill not only consumes, but also helps to rotate the ball mill. Methods for calculating complex analytical expressions for determining the coordinates of the centers of gravity of the grinding load under the conditions of its longitudinal motion have developed. The carried out researches allow to approach from the general positions to research of behavior of a grinding load in the ball mills equipped with various in-mill devices.

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.

A finite element-based algorithm for rubbing induced vibration prediction in rotors

NASA Astrophysics Data System (ADS)

Behzad, Mehdi; Alvandi, Mehdi; Mba, David; Jamali, Jalil

2013-10-01

In this paper, an algorithm is developed for more realistic investigation of rotor-to-stator rubbing vibration, based on finite element theory with unilateral contact and friction conditions. To model the rotor, cross sections are assumed to be radially rigid. A finite element discretization based on traditional beam theories which sufficiently accounts for axial and transversal flexibility of the rotor is used. A general finite element discretization model considering inertial and viscoelastic characteristics of the stator is used for modeling the stator. Therefore, for contact analysis, only the boundary of the stator is discretized. The contact problem is defined as the contact between the circular rigid cross section of the rotor and “nodes” of the stator only. Next, Gap function and contact conditions are described for the contact problem. Two finite element models of the rotor and the stator are coupled via the Lagrange multipliers method in order to obtain the constrained equation of motion. A case study of the partial rubbing is simulated using the algorithm. The synchronous and subsynchronous responses of the partial rubbing are obtained for different rotational speeds. In addition, a sensitivity analysis is carried out with respect to the initial clearance, the stator stiffness, the damping parameter, and the coefficient of friction. There is a good agreement between the result of this research and the experimental result in the literature.

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.

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).

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.

Boundary layer noise subtraction in hydrodynamic tunnel using robust principal component analysis.

PubMed

Amailland, Sylvain; Thomas, Jean-Hugh; Pézerat, Charles; Boucheron, Romuald

2018-04-01

The acoustic study of propellers in a hydrodynamic tunnel is of paramount importance during the design process, but can involve significant difficulties due to the boundary layer noise (BLN). Indeed, advanced denoising methods are needed to recover the acoustic signal in case of poor signal-to-noise ratio. The technique proposed in this paper is based on the decomposition of the wall-pressure cross-spectral matrix (CSM) by taking advantage of both the low-rank property of the acoustic CSM and the sparse property of the BLN CSM. Thus, the algorithm belongs to the class of robust principal component analysis (RPCA), which derives from the widely used principal component analysis. If the BLN is spatially decorrelated, the proposed RPCA algorithm can blindly recover the acoustical signals even for negative signal-to-noise ratio. Unfortunately, in a realistic case, acoustic signals recorded in a hydrodynamic tunnel show that the noise may be partially correlated. A prewhitening strategy is then considered in order to take into account the spatially coherent background noise. Numerical simulations and experimental results show an improvement in terms of BLN reduction in the large hydrodynamic tunnel. The effectiveness of the denoising method is also investigated in the context of acoustic source localization.

[Image reconstruction of conductivity on magnetoacoustic tomography with magnetic induction].

PubMed

Li, Jingyu; Yin, Tao; Liu, Zhipeng; Xu, Guohui

2010-04-01

The electric characteristics such as impedance and conductivity of the organization will change in the case where pathological changes occurred in the biological tissue. The change in electric characteristics usually took place before the change in the density of tissues, and also, the difference in electric characteristics such as conductivity between normal tissue and pathological tissue is obvious. The method of magneto-acoustic tomography with magnetic induction is based on the theory of magnetic eddy current induction, the principle of vibration generation and acoustic transmission to get the boundary of the pathological tissue. The pathological change could be inspected by electricity characteristic imaging which is invasive to the tissue. In this study, a two-layer concentric spherical model is established to simulate the malignant tumor tissue surrounded by normal tissue mutual relations of the magneto-sound coupling effect and the coupling equations in the magnetic field are used to get the algorithms for reconstructing the conductivity. Simulation study is conducted to test the proposed model and validate the performance of the reconstructed algorithms. The result indicates that the use of signal processing method in this paper can image the conductivity boundaries of the sample in the scanning cross section. The computer simulating results validate the feasibility of applying the method of magneto-acoustic tomography with magnetic induction for malignant tumor imaging.

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.

Improving arrival time identification in transient elastography

NASA Astrophysics Data System (ADS)

Klein, Jens; McLaughlin, Joyce; Renzi, Daniel

2012-04-01

In this paper, we improve the first step in the arrival time algorithm used for shear wave speed recovery in transient elastography. In transient elastography, a shear wave is initiated at the boundary and the interior displacement of the propagating shear wave is imaged with an ultrasound ultra-fast imaging system. The first step in the arrival time algorithm finds the arrival times of the shear wave by cross correlating displacement time traces (the time history of the displacement at a single point) with a reference time trace located near the shear wave source. The second step finds the shear wave speed from the arrival times. In performing the first step, we observe that the wave pulse decorrelates as it travels through the medium, which leads to inaccurate estimates of the arrival times and ultimately to blurring and artifacts in the shear wave speed image. In particular, wave ‘spreading’ accounts for much of this decorrelation. Here we remove most of the decorrelation by allowing the reference wave pulse to spread during the cross correlation. This dramatically improves the images obtained from arrival time identification. We illustrate the improvement of this method on phantom and in vivo data obtained from the laboratory of Mathias Fink at ESPCI, Paris.

29 CFR 776.13 - Commerce crossing international boundaries.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 29 Labor 3 2014-07-01 2014-07-01 false Commerce crossing international boundaries. 776.13 Section... Engaging âin Commerceâ § 776.13 Commerce crossing international boundaries. Under the Act, as amended, an employee engaged in “trade commerce, transportation, transmission, or communication” between any State and...

29 CFR 776.13 - Commerce crossing international boundaries.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 29 Labor 3 2012-07-01 2012-07-01 false Commerce crossing international boundaries. 776.13 Section... Engaging âin Commerceâ § 776.13 Commerce crossing international boundaries. Under the Act, as amended, an employee engaged in “trade commerce, transportation, transmission, or communication” between any State and...

29 CFR 776.13 - Commerce crossing international boundaries.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 29 Labor 3 2010-07-01 2010-07-01 false Commerce crossing international boundaries. 776.13 Section... Engaging âin Commerceâ § 776.13 Commerce crossing international boundaries. Under the Act, as amended, an employee engaged in “trade commerce, transportation, transmission, or communication” between any State and...

29 CFR 776.13 - Commerce crossing international boundaries.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 29 Labor 3 2011-07-01 2011-07-01 false Commerce crossing international boundaries. 776.13 Section... Engaging âin Commerceâ § 776.13 Commerce crossing international boundaries. Under the Act, as amended, an employee engaged in “trade commerce, transportation, transmission, or communication” between any State and...

29 CFR 776.13 - Commerce crossing international boundaries.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 29 Labor 3 2013-07-01 2013-07-01 false Commerce crossing international boundaries. 776.13 Section... Engaging âin Commerceâ § 776.13 Commerce crossing international boundaries. Under the Act, as amended, an employee engaged in “trade commerce, transportation, transmission, or communication” between any State and...

Computer-Mediated Communication in Intimate Relationships: Associations of Boundary Crossing, Intrusion, Relationship Satisfaction, and Partner Responsiveness.

PubMed

Norton, Aaron M; Baptist, Joyce; Hogan, Bernie

2018-01-01

This study examined the impact of technology on couples in committed relationships through the lens of the couple and technology framework. Specifically, we used data from 6,756 European couples to examine associations between online boundary crossing, online intrusion, relationship satisfaction, and partner responsiveness. The results suggest that participants' reports of online boundary crossing were linked with lower relationship satisfaction and partner responsiveness. Also, lower relationship satisfaction and partner responsiveness were associated with increased online boundary crossing. The results suggest that men, but not women, who reported greater acceptability for online boundary crossing were more likely to have partners who reported lower relationship satisfaction in their relationships. Implications for clinicians, relationship educators, and researchers are discussed. © 2017 American Association for Marriage and Family Therapy.

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 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.

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.

3-D Flow Visualization with a Light-field Camera

NASA Astrophysics Data System (ADS)

Thurow, B.

2012-12-01

Light-field cameras have received attention recently due to their ability to acquire photographs that can be computationally refocused after they have been acquired. In this work, we describe the development of a light-field camera system for 3D visualization of turbulent flows. The camera developed in our lab, also known as a plenoptic camera, uses an array of microlenses mounted next to an image sensor to resolve both the position and angle of light rays incident upon the camera. For flow visualization, the flow field is seeded with small particles that follow the fluid's motion and are imaged using the camera and a pulsed light source. The tomographic MART algorithm is then applied to the light-field data in order to reconstruct a 3D volume of the instantaneous particle field. 3D, 3C velocity vectors are then determined from a pair of 3D particle fields using conventional cross-correlation algorithms. As an illustration of the concept, 3D/3C velocity measurements of a turbulent boundary layer produced on the wall of a conventional wind tunnel are presented. Future experiments are planned to use the camera to study the influence of wall permeability on the 3-D structure of the turbulent boundary layer.Schematic illustrating the concept of a plenoptic camera where each pixel represents both the position and angle of light rays entering the camera. This information can be used to computationally refocus an image after it has been acquired. Instantaneous 3D velocity field of a turbulent boundary layer determined using light-field data captured by a plenoptic camera.

Numerical Study of Boundary Layer Interaction with Shocks: Method Improvement and Test Computation

NASA Technical Reports Server (NTRS)

Adams, N. A.

1995-01-01

The objective is the development of a high-order and high-resolution method for the direct numerical simulation of shock turbulent-boundary-layer interaction. Details concerning the spatial discretization of the convective terms can be found in Adams and Shariff (1995). The computer code based on this method as introduced in Adams (1994) was formulated in Cartesian coordinates and thus has been limited to simple rectangular domains. For more general two-dimensional geometries, as a compression corner, an extension to generalized coordinates is necessary. To keep the requirements or limitations for grid generation low, the extended formulation should allow for non-orthogonal grids. Still, for simplicity and cost efficiency, periodicity can be assumed in one cross-flow direction. For easy vectorization, the compact-ENO coupling algorithm as used in Adams (1994) treated whole planes normal to the derivative direction with the ENO scheme whenever at least one point of this plane satisfied the detection criterion. This is apparently too restrictive for more general geometries and more complex shock patterns. Here we introduce a localized compact-ENO coupling algorithm, which is efficient as long as the overall number of grid points treated by the ENO scheme is small compared to the total number of grid points. Validation and test computations with the final code are performed to assess the efficiency and suitability of the computer code for the problems of interest. We define a set of parameters where a direct numerical simulation of a turbulent boundary layer along a compression corner with reasonably fine resolution is affordable.

Automatic segmentation of the choroid in enhanced depth imaging optical coherence tomography images.

PubMed

Tian, Jing; Marziliano, Pina; Baskaran, Mani; Tun, Tin Aung; Aung, Tin

2013-03-01

Enhanced Depth Imaging (EDI) optical coherence tomography (OCT) provides high-definition cross-sectional images of the choroid in vivo, and hence is used in many clinical studies. However, the quantification of the choroid depends on the manual labelings of two boundaries, Bruch's membrane and the choroidal-scleral interface. This labeling process is tedious and subjective of inter-observer differences, hence, automatic segmentation of the choroid layer is highly desirable. In this paper, we present a fast and accurate algorithm that could segment the choroid automatically. Bruch's membrane is detected by searching the pixel with the biggest gradient value above the retinal pigment epithelium (RPE) and the choroidal-scleral interface is delineated by finding the shortest path of the graph formed by valley pixels using Dijkstra's algorithm. The experiments comparing automatic segmentation results with the manual labelings are conducted on 45 EDI-OCT images and the average of Dice's Coefficient is 90.5%, which shows good consistency of the algorithm with the manual labelings. The processing time for each image is about 1.25 seconds.

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.

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.

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.

The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic.

PubMed

Li, Ning; Martínez, José-Fernán; Hernández Díaz, Vicente

2015-08-10

Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters' dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively.

The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic

PubMed Central

Li, Ning; Martínez, José-Fernán; Díaz, Vicente Hernández

2015-01-01

Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters’ dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively. PMID:26266412

Educating Students to Cross Boundaries between Disciplines and Cultures and between Theory and Practice

ERIC Educational Resources Information Center

Fortuin, Ir. Karen P. J.; Bush, Simon R.

2010-01-01

Purpose: The purpose of this paper is to evaluate and analyse the didactic model of a university course, which concerns an applied academic consultancy project and which focuses on skills related to crossing boundaries between disciplines and cultures, and between theory and practice. These boundary crossing skills are needed to develop…

Crossing Educational Boundaries: Text, Technology, and Dialogue as a Critical Pathway

ERIC Educational Resources Information Center

Abnet, LaNae; Nichols, Joe D.; Moss, Glenda

2008-01-01

Can the perceived boundary between professor and student be crossed? Can technology be used as a pathway to cross that boundary? These questions were answered as a result of a project initiated to meet the requirements in creating an honors option for an undergraduate educational psychology course. In constructing the course requirements, the…

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.

Matrix quality and disturbance frequency drive evolution of species behavior at habitat boundaries.

PubMed

Martin, Amanda E; Fahrig, Lenore

2015-12-01

Previous theoretical studies suggest that a species' landscape should influence the evolution of its dispersal characteristics, because landscape structure affects the costs and benefits of dispersal. However, these studies have not considered the evolution of boundary crossing, that is, the tendency of animals to cross from habitat to nonhabitat ("matrix"). It is important to understand this dispersal behavior, because of its effects on the probability of population persistence. Boundary-crossing behavior drives the rate of interaction with matrix, and thus, it influences the rate of movement among populations and the risk of dispersal mortality. We used an individual-based, spatially explicit model to simulate the evolution of boundary crossing in response to landscape structure. Our simulations predict higher evolved probabilities of boundary crossing in landscapes with more habitat, less fragmented habitat, higher-quality matrix, and more frequent disturbances (i.e., fewer generations between local population extinction events). Unexpectedly, our simulations also suggest that matrix quality and disturbance frequency have much stronger effects on the evolution of boundary crossing than either habitat amount or habitat fragmentation. Our results suggest that boundary-crossing responses are most affected by the costs of dispersal through matrix and the benefits of escaping local extinction events. Evolution of optimal behavior at habitat boundaries in response to the landscape may have implications for species in human-altered landscapes, because this behavior may become suboptimal if the landscape changes faster than the species' evolutionary response to that change. Understanding how matrix quality and habitat disturbance drive evolution of behavior at boundaries, and how this in turn influences the extinction risk of species in human-altered landscapes should help us identify species of conservation concern and target them for management.

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.

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.

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.

Privacy Protection Versus Cluster Detection in Spatial Epidemiology

PubMed Central

Olson, Karen L.; Grannis, Shaun J.; Mandl, Kenneth D.

2006-01-01

Objectives. Patient data that includes precise locations can reveal patients’ identities, whereas data aggregated into administrative regions may preserve privacy and confidentiality. We investigated the effect of varying degrees of address precision (exact latitude and longitude vs the center points of zip code or census tracts) on detection of spatial clusters of cases. Methods. We simulated disease outbreaks by adding supplementary spatially clustered emergency department visits to authentic hospital emergency department syndromic surveillance data. We identified clusters with a spatial scan statistic and evaluated detection rate and accuracy. Results. More clusters were identified, and clusters were more accurately detected, when exact locations were used. That is, these clusters contained at least half of the simulated points and involved few additional emergency department visits. These results were especially apparent when the synthetic clustered points crossed administrative boundaries and fell into multiple zip code or census tracts. Conclusions. The spatial cluster detection algorithm performed better when addresses were analyzed as exact locations than when they were analyzed as center points of zip code or census tracts, particularly when the clustered points crossed administrative boundaries. Use of precise addresses offers improved performance, but this practice must be weighed against privacy concerns in the establishment of public health data exchange policies. PMID:17018828

A study of the compressible flow through a diffusing S-duct

NASA Technical Reports Server (NTRS)

Wellborn, Steven R.; Okiishi, Theodore H.; Reichert, Bruce A.

1993-01-01

Benchmark aerodynamic data are presented for compressible flow through a representative S-duct configuration. A numerical prediction of the S-duct flow field, obtained from a subsonic parabolized Navier-Stokes algorithm, is also shown. The experimental and numerical results are compared. Measurements of the three-dimensional velocity field, total pressures, and static pressures were obtained at five cross-sectional planes. Aerodynamic data were gathered with calibrated pneumatic probes. Surface static pressure and surface flow visualization data were also acquired. All reported tests were conducted with an inlet centerline Mach number of 0.6. The Reynolds number, based on the inlet centerline velocity and duct inlet diameter, was 2.6 x 10(exp 6). Thin inlet turbulent boundary layers existed. The collected data should be beneficial to aircraft inlet designers and the measurements are suitable for the validation of computational codes. The results show that a region of streamwise flow separation occurred within the duct. Details about the separated flow region, including mechanisms which drive this complicated flow phenomenon, are discussed. Results also indicate that the duct curvature induces strong pressure driven secondary flows. The cross flows evolve into counter-rotating vortices. These vortices convect low momentum fluid of the boundary layer toward the center of the duct, degrading both the uniformity and magnitude of the total pressure profile.

The steak dinner--a professional boundary crossing.

PubMed

Vig, Elizabeth K; Foglia, Mary Beth

2014-09-01

Maintaining professional boundaries enables clinicians to keep their patients' best interests in mind. Palliative care clinicians may be at risk for professional boundary crossings because of the intimate nature of caring for people with life-threatening illnesses. In some instances, boundary crossings can be beneficial to the patient, but must be considered thoughtfully and with trusted others. We describe the case of a primary care physician and clinic nurse who were asked by a long-time clinic patient, who was now terminally ill, to join him for a steak dinner. We discuss the approach that the physician and nurse took in deciding about whether the boundary crossing was ethically permissible. We also offer sample questions for palliative care clinicians to consider when thinking about their actions. Published by Elsevier Inc.

Observations of the magnetopause current layer: Cases with no boundary layer and tests of recent models

NASA Technical Reports Server (NTRS)

Eastman, Timothy E.

1995-01-01

Evidence for the probable existence of magnetospheric boundary layers was first presented by Hones, et al. (1972), based on VELA satellite plasma observations (no magnetic field measurements were obtained). This magnetotail boundary layer is now known to be the tailward extension of the high-latitude boundary layer or plasma mantle (first uniquely identified using HEOS 2 plasma and field observations by Rosenbauer et al., 1975) and the low-latitude boundary layer (first uniquely identified using IMP 6 plasma and field observations by Eastman et al., 1976). The magnetospheric boundary layer is the region of magnetosheath-like plasma located Earthward of, but generally contiguous with the magnetopause. This boundary layer is typically identified by comparing low-energy (less than 10 keV) ion spectra across the magnetopause. Low-energy electron measurements are also useful for identifying the boundary layer because the shocked solar wind or magnetosheath has a characteristic spectral signature for electrons as well. However, there are magnetopause crossings where low-energy electrons might suggest a depletion layer outside the magnetopause even though the traditional field-rotation signature indicates that this same region is a boundary layer Earthward of the current layer. Our analyses avoided crossings which exhibit such ambiguities. Pristine magnetopause crossings are magnetopause crossings for which the current layer is well defined and for which there is no adjoining magnetospheric boundary layer as defined above. Although most magnetopause models to date apply to such crossings, few comparisons between such theory and observations of pristine magnetopause crossings have been made because most crossings have an associated magnetospheric boundary layer which significantly affects the applicable boundary conditions for the magnetopause current layer. Furthermore, almost no observational studies of magnetopause microstructure have been done even though key theoretical issues have been discussed for over two decades. This is because plasma instruments deployed prior to the ISEE and AMPTE missions did not have the required time resolution and most ISEE investigations to-date have focused on tests of MHD plasma models, especially reconnection. More recently, many phenomenological and theoretical models have been developed to explain the existence and characteristics of the magnetospheric boundary layers with only limited success to date. The cases with no boundary layer treated in this study provide a contrary set of conditions to those observed with a boundary layer. For the measured parameters of such cases, a successful boundary layer model should predict no plasma penetration across the magnetopause. Thus, this research project provides the first direct observational tests of magnetopause models using pristine magnetopause crossings and provides important new results on magnetopause microstructure and associated kinetic processes.

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

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.

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.

Meso-scale anisotropic hydrogen segregation near grain-boundaries in polycrystalline nickel characterized by EBSD/SIMS

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

Oudriss, A.; Le Guernic, Solenne; Wang, Zhaoying

2016-02-15

To study anisotropic hydrogen segregation and diffusion in nickel polycrystalline, Secondary Ion Mass Spectrometry (SIMS) and Electron Back Scattered Diffraction (EBSD) are integrated to investigate hydrogen distribution around grain boundaries. Hydrogen distribution in pre-charged samples were correlated with grain boundary character by integrating high-resolution grain microstructure from EBSD inverse pole figure map and low-resolution hydrogen concentration profile map from SIMS. This multimodal imaging instrumentation shows that grain boundaries in nickel can be categorized into two families based on behavior of hydrogen distribution crossing grain boundary: the first one includes random grain boundaries with fast hydrogen diffusivity, showing a sharp gapmore » for hydrogen concentration profile cross the grain boundaries. The second family are special Σ3n grain boundaries with low hydrogen diffusivity, showing a smooth gradient of hydrogen concentration cross the grain boundary. Heterogeneous hydrogen distributions due to grain boundary family revealed by SIMS/EBSD on mesoscale further validate the recent hydrogen permeation data and anisotropic ab-initio calculations in nanoscale. The results highlight the fact that grain boundaries character impacts hydrogen distribution significantly.« less

Segmentation of neuronal structures using SARSA (λ)-based boundary amendment with reinforced gradient-descent curve shape fitting.

PubMed

Zhu, Fei; Liu, Quan; Fu, Yuchen; Shen, Bairong

2014-01-01

The segmentation of structures in electron microscopy (EM) images is very important for neurobiological research. The low resolution neuronal EM images contain noise and generally few features are available for segmentation, therefore application of the conventional approaches to identify the neuron structure from EM images is not successful. We therefore present a multi-scale fused structure boundary detection algorithm in this study. In the algorithm, we generate an EM image Gaussian pyramid first, then at each level of the pyramid, we utilize Laplacian of Gaussian function (LoG) to attain structure boundary, we finally assemble the detected boundaries by using fusion algorithm to attain a combined neuron structure image. Since the obtained neuron structures usually have gaps, we put forward a reinforcement learning-based boundary amendment method to connect the gaps in the detected boundaries. We use a SARSA (λ)-based curve traveling and amendment approach derived from reinforcement learning to repair the incomplete curves. Using this algorithm, a moving point starts from one end of the incomplete curve and walks through the image where the decisions are supervised by the approximated curve model, with the aim of minimizing the connection cost until the gap is closed. Our approach provided stable and efficient structure segmentation. The test results using 30 EM images from ISBI 2012 indicated that both of our approaches, i.e., with or without boundary amendment, performed better than six conventional boundary detection approaches. In particular, after amendment, the Rand error and warping error, which are the most important performance measurements during structure segmentation, were reduced to very low values. The comparison with the benchmark method of ISBI 2012 and the recent developed methods also indicates that our method performs better for the accurate identification of substructures in EM images and therefore useful for the identification of imaging features related to brain diseases.

Segmentation of Neuronal Structures Using SARSA (λ)-Based Boundary Amendment with Reinforced Gradient-Descent Curve Shape Fitting

PubMed Central

Zhu, Fei; Liu, Quan; Fu, Yuchen; Shen, Bairong

2014-01-01

The segmentation of structures in electron microscopy (EM) images is very important for neurobiological research. The low resolution neuronal EM images contain noise and generally few features are available for segmentation, therefore application of the conventional approaches to identify the neuron structure from EM images is not successful. We therefore present a multi-scale fused structure boundary detection algorithm in this study. In the algorithm, we generate an EM image Gaussian pyramid first, then at each level of the pyramid, we utilize Laplacian of Gaussian function (LoG) to attain structure boundary, we finally assemble the detected boundaries by using fusion algorithm to attain a combined neuron structure image. Since the obtained neuron structures usually have gaps, we put forward a reinforcement learning-based boundary amendment method to connect the gaps in the detected boundaries. We use a SARSA (λ)-based curve traveling and amendment approach derived from reinforcement learning to repair the incomplete curves. Using this algorithm, a moving point starts from one end of the incomplete curve and walks through the image where the decisions are supervised by the approximated curve model, with the aim of minimizing the connection cost until the gap is closed. Our approach provided stable and efficient structure segmentation. The test results using 30 EM images from ISBI 2012 indicated that both of our approaches, i.e., with or without boundary amendment, performed better than six conventional boundary detection approaches. In particular, after amendment, the Rand error and warping error, which are the most important performance measurements during structure segmentation, were reduced to very low values. The comparison with the benchmark method of ISBI 2012 and the recent developed methods also indicates that our method performs better for the accurate identification of substructures in EM images and therefore useful for the identification of imaging features related to brain diseases. PMID:24625699

Computer-Aided Diagnosis with Deep Learning Architecture: Applications to Breast Lesions in US Images and Pulmonary Nodules in CT Scans

NASA Astrophysics Data System (ADS)

Cheng, Jie-Zhi; Ni, Dong; Chou, Yi-Hong; Qin, Jing; Tiu, Chui-Mei; Chang, Yeun-Chung; Huang, Chiun-Sheng; Shen, Dinggang; Chen, Chung-Ming

2016-04-01

This paper performs a comprehensive study on the deep-learning-based computer-aided diagnosis (CADx) for the differential diagnosis of benign and malignant nodules/lesions by avoiding the potential errors caused by inaccurate image processing results (e.g., boundary segmentation), as well as the classification bias resulting from a less robust feature set, as involved in most conventional CADx algorithms. Specifically, the stacked denoising auto-encoder (SDAE) is exploited on the two CADx applications for the differentiation of breast ultrasound lesions and lung CT nodules. The SDAE architecture is well equipped with the automatic feature exploration mechanism and noise tolerance advantage, and hence may be suitable to deal with the intrinsically noisy property of medical image data from various imaging modalities. To show the outperformance of SDAE-based CADx over the conventional scheme, two latest conventional CADx algorithms are implemented for comparison. 10 times of 10-fold cross-validations are conducted to illustrate the efficacy of the SDAE-based CADx algorithm. The experimental results show the significant performance boost by the SDAE-based CADx algorithm over the two conventional methods, suggesting that deep learning techniques can potentially change the design paradigm of the CADx systems without the need of explicit design and selection of problem-oriented features.

Computer-Aided Diagnosis with Deep Learning Architecture: Applications to Breast Lesions in US Images and Pulmonary Nodules in CT Scans.

PubMed

Cheng, Jie-Zhi; Ni, Dong; Chou, Yi-Hong; Qin, Jing; Tiu, Chui-Mei; Chang, Yeun-Chung; Huang, Chiun-Sheng; Shen, Dinggang; Chen, Chung-Ming

2016-04-15

This paper performs a comprehensive study on the deep-learning-based computer-aided diagnosis (CADx) for the differential diagnosis of benign and malignant nodules/lesions by avoiding the potential errors caused by inaccurate image processing results (e.g., boundary segmentation), as well as the classification bias resulting from a less robust feature set, as involved in most conventional CADx algorithms. Specifically, the stacked denoising auto-encoder (SDAE) is exploited on the two CADx applications for the differentiation of breast ultrasound lesions and lung CT nodules. The SDAE architecture is well equipped with the automatic feature exploration mechanism and noise tolerance advantage, and hence may be suitable to deal with the intrinsically noisy property of medical image data from various imaging modalities. To show the outperformance of SDAE-based CADx over the conventional scheme, two latest conventional CADx algorithms are implemented for comparison. 10 times of 10-fold cross-validations are conducted to illustrate the efficacy of the SDAE-based CADx algorithm. The experimental results show the significant performance boost by the SDAE-based CADx algorithm over the two conventional methods, suggesting that deep learning techniques can potentially change the design paradigm of the CADx systems without the need of explicit design and selection of problem-oriented features.

Computer-Aided Diagnosis with Deep Learning Architecture: Applications to Breast Lesions in US Images and Pulmonary Nodules in CT Scans

PubMed Central

Cheng, Jie-Zhi; Ni, Dong; Chou, Yi-Hong; Qin, Jing; Tiu, Chui-Mei; Chang, Yeun-Chung; Huang, Chiun-Sheng; Shen, Dinggang; Chen, Chung-Ming

2016-01-01

This paper performs a comprehensive study on the deep-learning-based computer-aided diagnosis (CADx) for the differential diagnosis of benign and malignant nodules/lesions by avoiding the potential errors caused by inaccurate image processing results (e.g., boundary segmentation), as well as the classification bias resulting from a less robust feature set, as involved in most conventional CADx algorithms. Specifically, the stacked denoising auto-encoder (SDAE) is exploited on the two CADx applications for the differentiation of breast ultrasound lesions and lung CT nodules. The SDAE architecture is well equipped with the automatic feature exploration mechanism and noise tolerance advantage, and hence may be suitable to deal with the intrinsically noisy property of medical image data from various imaging modalities. To show the outperformance of SDAE-based CADx over the conventional scheme, two latest conventional CADx algorithms are implemented for comparison. 10 times of 10-fold cross-validations are conducted to illustrate the efficacy of the SDAE-based CADx algorithm. The experimental results show the significant performance boost by the SDAE-based CADx algorithm over the two conventional methods, suggesting that deep learning techniques can potentially change the design paradigm of the CADx systems without the need of explicit design and selection of problem-oriented features. PMID:27079888

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.

Computation of the inviscid supersonic flow about cones at large angles of attack by a floating discontinuity approach

NASA Technical Reports Server (NTRS)

Daywitt, J.; Kutler, P.; Anderson, D.

1977-01-01

The technique of floating shock fitting is adapted to the computation of the inviscid flowfield about circular cones in a supersonic free stream at angles of attack that exceed the cone half-angle. The resulting equations are applicable over the complete range of free-stream Mach numbers, angles of attack and cone half-angles for which the bow shock is attached. A finite difference algorithm is used to obtain the solution by an unsteady relaxation approach. The bow shock, embedded cross-flow shock, and vortical singularity in the leeward symmetry plane are treated as floating discontinuities in a fixed computational mesh. Where possible, the flowfield is partitioned into windward, shoulder, and leeward regions with each region computed separately to achieve maximum computational efficiency. An alternative shock fitting technique which treats the bow shock as a computational boundary is developed and compared with the floating-fitting approach. Several surface boundary condition schemes are also analyzed.

The impact of groundwater velocity fields on streamlines in an aquifer system with a discontinuous aquitard (Inner Mongolia, China)

NASA Astrophysics Data System (ADS)

Wu, Qiang; Zhao, Yingwang; Xu, Hua

2018-04-01

Many numerical methods that simulate groundwater flow, particularly the continuous Galerkin finite element method, do not produce velocity information directly. Many algorithms have been proposed to improve the accuracy of velocity fields computed from hydraulic potentials. The differences in the streamlines generated from velocity fields obtained using different algorithms are presented in this report. The superconvergence method employed by FEFLOW, a popular commercial code, and some dual-mesh methods proposed in recent years are selected for comparison. The applications to depict hydrogeologic conditions using streamlines are used, and errors in streamlines are shown to lead to notable errors in boundary conditions, the locations of material interfaces, fluxes and conductivities. Furthermore, the effects of the procedures used in these two types of methods, including velocity integration and local conservation, are analyzed. The method of interpolating velocities across edges using fluxes is shown to be able to eliminate errors associated with refraction points that are not located along material interfaces and streamline ends at no-flow boundaries. Local conservation is shown to be a crucial property of velocity fields and can result in more accurate streamline densities. A case study involving both three-dimensional and two-dimensional cross-sectional models of a coal mine in Inner Mongolia, China, are used to support the conclusions presented.

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

Joint simulation of stationary grade and non-stationary rock type for quantifying geological uncertainty in a copper deposit

NASA Astrophysics Data System (ADS)

Maleki, Mohammad; Emery, Xavier

2017-12-01

In mineral resources evaluation, the joint simulation of a quantitative variable, such as a metal grade, and a categorical variable, such as a rock type, is challenging when one wants to reproduce spatial trends of the rock type domains, a feature that makes a stationarity assumption questionable. To address this problem, this work presents methodological and practical proposals for jointly simulating a grade and a rock type, when the former is represented by the transform of a stationary Gaussian random field and the latter is obtained by truncating an intrinsic random field of order k with Gaussian generalized increments. The proposals concern both the inference of the model parameters and the construction of realizations conditioned to existing data. The main difficulty is the identification of the spatial correlation structure, for which a semi-automated algorithm is designed, based on a least squares fitting of the data-to-data indicator covariances and grade-indicator cross-covariances. The proposed models and algorithms are applied to jointly simulate the copper grade and the rock type in a Chilean porphyry copper deposit. The results show their ability to reproduce the gradual transitions of the grade when crossing a rock type boundary, as well as the spatial zonation of the rock type.

Optical Coherence Tomography (OCT) Device Independent Intraretinal Layer Segmentation

PubMed Central

Ehnes, Alexander; Wenner, Yaroslava; Friedburg, Christoph; Preising, Markus N.; Bowl, Wadim; Sekundo, Walter; zu Bexten, Erdmuthe Meyer; Stieger, Knut; Lorenz, Birgit

2014-01-01

Purpose To develop and test an algorithm to segment intraretinal layers irrespectively of the actual Optical Coherence Tomography (OCT) device used. Methods The developed algorithm is based on the graph theory optimization. The algorithm's performance was evaluated against that of three expert graders for unsigned boundary position difference and thickness measurement of a retinal layer group in 50 and 41 B-scans, respectively. Reproducibility of the algorithm was tested in 30 C-scans of 10 healthy subjects each with the Spectralis and the Stratus OCT. Comparability between different devices was evaluated in 84 C-scans (volume or radial scans) obtained from 21 healthy subjects, two scans per subject with the Spectralis OCT, and one scan per subject each with the Stratus OCT and the RTVue-100 OCT. Each C-scan was segmented and the mean thickness for each retinal layer in sections of the early treatment of diabetic retinopathy study (ETDRS) grid was measured. Results The algorithm was able to segment up to 11 intraretinal layers. Measurements with the algorithm were within the 95% confidence interval of a single grader and the difference was smaller than the interindividual difference between the expert graders themselves. The cross-device examination of ETDRS-grid related layer thicknesses highly agreed between the three OCT devices. The algorithm correctly segmented a C-scan of a patient with X-linked retinitis pigmentosa. Conclusions The segmentation software provides device-independent, reliable, and reproducible analysis of intraretinal layers, similar to what is obtained from expert graders. Translational Relevance Potential application of the software includes routine clinical practice and multicenter clinical trials. PMID:24820053

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.

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.

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.

Shifting Institutional Boundaries through Cross-Border Higher Education

ERIC Educational Resources Information Center

Amaral, Alberto; Tavares, Orlanda; Cardoso, Sónia; Sin, Cristina

2016-01-01

Cross-border higher education (CBHE) has been changing the organizational boundaries of higher education institutions (HEIs). This study aims to analyze the shifting boundaries of Portuguese HEIs through the lens of the identity concept in organization theories, considering three contexts with different levels of regulation: African…

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.

Boundary Crossing in R&D Projects in Schools: Learning through Cross-Professional Collaboration

ERIC Educational Resources Information Center

Schenke, Wouter; van Driel, Jan; Geijsel, Femke P.; Volman, Monique L. L.

2017-01-01

Background/Context: School leaders, teachers, and researchers are increasingly involved in collaborative research and development (R&D) projects in schools, which encourage crossing boundaries between the fields of school and research. It is not clear, however, what and how professionals in these projects learn through cross-professional…

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.

Integrating medical and environmental sociology with environmental health: crossing boundaries and building connections through advocacy.

PubMed

Brown, Phil

2013-06-01

This article reviews the personal and professional processes of developing an interdisciplinary approach to understanding the complex issues of environmental health in their community, political-economic, social science, and scientific contexts. This interdisciplinary approach includes a synthesis of research, policy work, and advocacy. To examine multiple forms of interdisciplinarity, I examine pathways of integrating medical and environmental sociology via three challenges to the boundaries of traditional research: (1) crossing the boundaries of medical and environmental sociology, (2) linking social science and environmental health science, and (3) crossing the boundary of research and advocacy. These boundary crossings are discussed in light of conceptual and theoretical developments of popular epidemiology, contested illnesses, and health social movements. This interdisciplinary work offers a more comprehensive sociological lens for understanding complex problems and a practical ability to join with scientists, activists, and officials to meet public health needs for amelioration and prevention of environmental health threats.

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

Volumetric PIV with a Plenoptic Camera

NASA Astrophysics Data System (ADS)

Thurow, Brian; Fahringer, Tim

2012-11-01

Plenoptic cameras have received attention recently due to their ability to computationally refocus an image after it has been acquired. We describe the development of a robust, economical and easy-to-use volumetric PIV technique using a unique plenoptic camera built in our laboratory. The tomographic MART algorithm is used to reconstruct pairs of 3D particle volumes with velocity determined using conventional cross-correlation techniques. 3D/3C velocity measurements (volumetric dimensions of 2 . 8 ' ' × 1 . 9 ' ' × 1 . 6 ' ') of a turbulent boundary layer produced on the wall of a conventional wind tunnel are presented. This work has been supported by the Air Force Office of Scientific Research,(Grant #FA9550-100100576).

Flux splitting algorithms for two-dimensional viscous flows with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Shuen, Jian-Shun; Liou, Meng-Sing

1989-01-01

The Roe flux difference splitting method was extended to treat 2-D viscous flows with nonequilibrium chemistry. The derivations have avoided unnecessary assumptions or approximations. For spatial discretization, the second-order Roe upwind differencing is used for the convective terms and central differencing for the viscous terms. An upwind-based TVD scheme is applied to eliminate oscillations and obtain a sharp representation of discontinuities. A two-state Runge-Kutta method is used to time integrate the discretized Navier-Stokes and species transport equations for the asymptotic steady solutions. The present method is then applied to two types of flows: the shock wave/boundary layer interaction problems and the jet in cross flows.

Flux splitting algorithms for two-dimensional viscous flows with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Shuen, Jian-Shun; Liou, Meng-Sing

1989-01-01

The Roe flux-difference splitting method has been extended to treat two-dimensional viscous flows with nonequilibrium chemistry. The derivations have avoided unnecessary assumptions or approximations. For spatial discretization, the second-order Roe upwind differencing is used for the convective terms and central differencing for the viscous terms. An upwind-based TVD scheme is applied to eliminate oscillations and obtain a sharp representation of discontinuities. A two-stage Runge-Kutta method is used to time integrate the discretized Navier-Stokes and species transport equations for the asymptotic steady solutions. The present method is then applied to two types of flows: the shock wave/boundary layer interaction problems and the jet in cross flows.

Automated measurement of stent strut coverage in intravascular optical coherence tomography

NASA Astrophysics Data System (ADS)

Ahn, Chi Young; Kim, Byeong-Keuk; Hong, Myeong-Ki; Jang, Yangsoo; Heo, Jung; Joo, Chulmin; Seo, Jin Keun

2015-02-01

Optical coherence tomography (OCT) is a non-invasive, cross-sectional imaging modality that has become a prominent imaging method in percutaneous intracoronary intervention. We present an automated detection algorithm for stent strut coordinates and coverage in OCT images. The algorithm for stent strut detection is composed of a coordinate transformation from the polar to the Cartesian domains and application of second derivative operators in the radial and the circumferential directions. Local region-based active contouring was employed to detect lumen boundaries. We applied the method to the OCT pullback images acquired from human patients in vivo to quantitatively measure stent strut coverage. The validation studies against manual expert assessments demonstrated high Pearson's coefficients ( R = 0.99) in terms of the stent strut coordinates, with no significant bias. An averaged Hausdorff distance of < 120 μm was obtained for vessel border detection. Quantitative comparison in stent strut to vessel wall distance found a bias of < 12.3 μm and a 95% confidence of < 110 μm.

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.

Maintaining Professional Nursing Boundaries in the Pediatric Home Care Setting.

PubMed

Petosa, Sarah Diane

Pediatric home care nurses often become a valuable part of the family unit, and this can blur the professional boundary between nurse and patient. Home care professionals must educate themselves as well as patients and family members about the integrity of their professional relationship, and prevent boundary crossing before it occurs. This article highlights four case studies that describe situations of boundary crossing that could have been managed differently. Strategies for maintaining professional boundaries with patients and their families are provided.

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

SU-G-BRA-02: Development of a Learning Based Block Matching Algorithm for Ultrasound Tracking in Radiotherapy

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

Shepard, A; Bednarz, B

Purpose: To develop an ultrasound learning-based tracking algorithm with the potential to provide real-time motion traces of anatomy-based fiducials that may aid in the effective delivery of external beam radiation. Methods: The algorithm was developed in Matlab R2015a and consists of two main stages: reference frame selection, and localized block matching. Immediately following frame acquisition, a normalized cross-correlation (NCC) similarity metric is used to determine a reference frame most similar to the current frame from a series of training set images that were acquired during a pretreatment scan. Segmented features in the reference frame provide the basis for the localizedmore » block matching to determine the feature locations in the current frame. The boundary points of the reference frame segmentation are used as the initial locations for the block matching and NCC is used to find the most similar block in the current frame. The best matched block locations in the current frame comprise the updated feature boundary. The algorithm was tested using five features from two sets of ultrasound patient data obtained from MICCAI 2014 CLUST. Due to the lack of a training set associated with the image sequences, the first 200 frames of the image sets were considered a valid training set for preliminary testing, and tracking was performed over the remaining frames. Results: Tracking of the five vessel features resulted in an average tracking error of 1.21 mm relative to predefined annotations. The average analysis rate was 15.7 FPS with analysis for one of the two patients reaching real-time speeds. Computations were performed on an i5-3230M at 2.60 GHz. Conclusion: Preliminary tests show tracking errors comparable with similar algorithms at close to real-time speeds. Extension of the work onto a GPU platform has the potential to achieve real-time performance, making tracking for therapy applications a feasible option. This work is partially funded by NIH grant R01CA190298.« less

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.

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

A biomolecular electrostatics solver using Python, GPUs and boundary elements that can handle solvent-filled cavities and Stern layers.

PubMed

Cooper, Christopher D; Bardhan, Jaydeep P; Barba, L A

2014-03-01

The continuum theory applied to biomolecular electrostatics leads to an implicit-solvent model governed by the Poisson-Boltzmann equation. Solvers relying on a boundary integral representation typically do not consider features like solvent-filled cavities or ion-exclusion (Stern) layers, due to the added difficulty of treating multiple boundary surfaces. This has hindered meaningful comparisons with volume-based methods, and the effects on accuracy of including these features has remained unknown. This work presents a solver called PyGBe that uses a boundary-element formulation and can handle multiple interacting surfaces. It was used to study the effects of solvent-filled cavities and Stern layers on the accuracy of calculating solvation energy and binding energy of proteins, using the well-known apbs finite-difference code for comparison. The results suggest that if required accuracy for an application allows errors larger than about 2% in solvation energy, then the simpler, single-surface model can be used. When calculating binding energies, the need for a multi-surface model is problem-dependent, becoming more critical when ligand and receptor are of comparable size. Comparing with the apbs solver, the boundary-element solver is faster when the accuracy requirements are higher. The cross-over point for the PyGBe code is in the order of 1-2% error, when running on one gpu card (nvidia Tesla C2075), compared with apbs running on six Intel Xeon cpu cores. PyGBe achieves algorithmic acceleration of the boundary element method using a treecode, and hardware acceleration using gpus via PyCuda from a user-visible code that is all Python. The code is open-source under MIT license.

A biomolecular electrostatics solver using Python, GPUs and boundary elements that can handle solvent-filled cavities and Stern layers

NASA Astrophysics Data System (ADS)

Cooper, Christopher D.; Bardhan, Jaydeep P.; Barba, L. A.

2014-03-01

The continuum theory applied to biomolecular electrostatics leads to an implicit-solvent model governed by the Poisson-Boltzmann equation. Solvers relying on a boundary integral representation typically do not consider features like solvent-filled cavities or ion-exclusion (Stern) layers, due to the added difficulty of treating multiple boundary surfaces. This has hindered meaningful comparisons with volume-based methods, and the effects on accuracy of including these features has remained unknown. This work presents a solver called PyGBe that uses a boundary-element formulation and can handle multiple interacting surfaces. It was used to study the effects of solvent-filled cavities and Stern layers on the accuracy of calculating solvation energy and binding energy of proteins, using the well-known APBS finite-difference code for comparison. The results suggest that if required accuracy for an application allows errors larger than about 2% in solvation energy, then the simpler, single-surface model can be used. When calculating binding energies, the need for a multi-surface model is problem-dependent, becoming more critical when ligand and receptor are of comparable size. Comparing with the APBS solver, the boundary-element solver is faster when the accuracy requirements are higher. The cross-over point for the PyGBe code is on the order of 1-2% error, when running on one GPU card (NVIDIA Tesla C2075), compared with APBS running on six Intel Xeon CPU cores. PyGBe achieves algorithmic acceleration of the boundary element method using a treecode, and hardware acceleration using GPUs via PyCuda from a user-visible code that is all Python. The code is open-source under MIT license.

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.

Detail Extraction from Electron Backscatter Diffraction Patterns

NASA Astrophysics Data System (ADS)

Basinger, Jay

Cross-correlation based analysis of electron backscatter diffraction (EBSD) patterns and the use of simulated reference patterns has opened up entirely new avenues of insight into local lattice properties within EBSD scans. The benefits of accessing new levels of orientation resolution and multiple types of previously inaccessible data measures are accompanied with new challenges in characterizing microscope geometry and other error previously ignored in EBSD systems. The foremost of these challenges, when using simulated patterns in high resolution EBSD (HR-EBSD), is the determination of pattern center (the location on the sample from which the EBSD pattern originated) with sufficient accuracy to avoid the introduction of phantom lattice rotations and elastic strain into these highly sensitive measures. This dissertation demonstrates how to greatly improve pattern center determination. It also presents a method for the extraction of grain boundary plane information from single two-dimensional surface scans. These are accomplished through the use of previously un-accessed detail within EBSD images, coupled with physical models of the backscattering phenomena. A software algorithm is detailed and applied for the determination of pattern center with an accuracy of ˜0.03% of the phosphor screen width, or ˜10μm. This resolution makes it possible to apply a simulated pattern method (developed at BYU) in HR-EBSD, with several important benefits over the original HR-EBSD approach developed by Angus Wilkinson. Experimental work is done on epitaxially-grown silicon and germanium in order to gauge the precision of HR-EBSD with simulated reference patterns using the new pattern center calibration approach. It is found that strain resolution with a calibrated pattern center and simulated reference patterns can be as low as 7x10-4. Finally, Monte Carlo-based models of the electron interaction volume are used in conjunction with pattern-mixing-strength curves of line scans crossing grain boundaries in order to recover 3D grain boundary plane information. Validation of the approach is done using 3D serial scan data and coherent twin boundaries in tantalum and copper. The proposed method for recovery of grain boundary plane orientation exhibits an average error of 3 degrees.

Dissolved organic carbon fluxes in the Middle Atlantic Bight: An integrated approach based on satellite data and ocean model products

NASA Astrophysics Data System (ADS)

Mannino, Antonio; Signorini, Sergio R.; Novak, Michael G.; Wilkin, John; Friedrichs, Marjorie A. M.; Najjar, Raymond G.

2016-02-01

Continental margins play an important role in global carbon cycle, accounting for 15-21% of the global marine primary production. Since carbon fluxes across continental margins from land to the open ocean are not well constrained, we undertook a study to develop satellite algorithms to retrieve dissolved organic carbon (DOC) and combined these satellite data with physical circulation model products to quantify the shelf boundary fluxes of DOC for the U.S. Middle Atlantic Bight (MAB). Satellite DOC was computed through seasonal relationships of DOC with colored dissolved organic matter absorption coefficients, which were derived from an extensive set of in situ measurements. The multiyear time series of satellite-derived DOC stocks (4.9 Teragrams C; Tg) shows that freshwater discharge influences the magnitude and seasonal variability of DOC on the continental shelf. For the 2010-2012 period studied, the average total estuarine export of DOC into the MAB shelf is 0.77 Tg C yr-1 (year). The integrated DOC tracer fluxes across the shelf boundaries are 12.1 Tg C yr-1 entering the MAB from the southwest alongshore boundary, 18.5 Tg C yr-1 entering the MAB from the northeast alongshore boundary, and 29.0 Tg C yr-1 flowing out of the MAB across the entire length of the 100 m isobath. The magnitude of the cross-shelf DOC flux is quite variable in time (monthly) and space (north to south). The highly dynamic exchange of water along the shelf boundaries regulates the DOC budget of the MAB at subseasonal time scales.

Dissolved organic carbon fluxes in the Middle Atlantic Bight: An integrated approach based on satellite data and ocean model products.

PubMed

Mannino, Antonio; Signorini, Sergio R; Novak, Michael G; Wilkin, John; Friedrichs, Marjorie A M; Najjar, Raymond G

2016-02-01

Continental margins play an important role in global carbon cycle, accounting for 15-21% of the global marine primary production. Since carbon fluxes across continental margins from land to the open ocean are not well constrained, we undertook a study to develop satellite algorithms to retrieve dissolved organic carbon (DOC) and combined these satellite data with physical circulation model products to quantify the shelf boundary fluxes of DOC for the U.S. Middle Atlantic Bight (MAB). Satellite DOC was computed through seasonal relationships of DOC with colored dissolved organic matter absorption coefficients, which were derived from an extensive set of in situ measurements. The multiyear time series of satellite-derived DOC stocks (4.9 Teragrams C; Tg) shows that freshwater discharge influences the magnitude and seasonal variability of DOC on the continental shelf. For the 2010-2012 period studied, the average total estuarine export of DOC into the MAB shelf is 0.77 Tg C yr -1 (year). The integrated DOC tracer fluxes across the shelf boundaries are 12.1 Tg C yr -1 entering the MAB from the southwest alongshore boundary, 18.5 Tg C yr -1 entering the MAB from the northeast alongshore boundary, and 29.0 Tg C yr -1 flowing out of the MAB across the entire length of the 100 m isobath. The magnitude of the cross-shelf DOC flux is quite variable in time (monthly) and space (north to south). The highly dynamic exchange of water along the shelf boundaries regulates the DOC budget of the MAB at subseasonal time scales.

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.

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.

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.

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.

A random forest algorithm for nowcasting of intense precipitation events

NASA Astrophysics Data System (ADS)

Das, Saurabh; Chakraborty, Rohit; Maitra, Animesh

2017-09-01

Automatic nowcasting of convective initiation and thunderstorms has potential applications in several sectors including aviation planning and disaster management. In this paper, random forest based machine learning algorithm is tested for nowcasting of convective rain with a ground based radiometer. Brightness temperatures measured at 14 frequencies (7 frequencies in 22-31 GHz band and 7 frequencies in 51-58 GHz bands) are utilized as the inputs of the model. The lower frequency band is associated to the water vapor absorption whereas the upper frequency band relates to the oxygen absorption and hence, provide information on the temperature and humidity of the atmosphere. Synthetic minority over-sampling technique is used to balance the data set and 10-fold cross validation is used to assess the performance of the model. Results indicate that random forest algorithm with fixed alarm generation time of 30 min and 60 min performs quite well (probability of detection of all types of weather condition ∼90%) with low false alarms. It is, however, also observed that reducing the alarm generation time improves the threat score significantly and also decreases false alarms. The proposed model is found to be very sensitive to the boundary layer instability as indicated by the variable importance measure. The study shows the suitability of a random forest algorithm for nowcasting application utilizing a large number of input parameters from diverse sources and can be utilized in other forecasting problems.

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

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.

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.

Galilean-invariant algorithm coupling immersed moving boundary conditions and Lees-Edwards boundary conditions

NASA Astrophysics Data System (ADS)

Zhou, Guofeng; Wang, Limin; Wang, Xiaowei; Ge, Wei

2011-12-01

Many investigators have coupled the Lees-Edwards boundary conditions (LEBCs) and suspension methods in the framework of the lattice Boltzmann method to study the pure bulk properties of particle-fluid suspensions. However, these suspension methods are all link-based and are more or less exposed to the disadvantages of violating Galilean invariance. In this paper, we have coupled LEBCs with a node-based suspension method, which is demonstrated to be Galilean invariant in benchmark simulations. We use the coupled algorithm to predict the viscosity of a particle-fluid suspension at very low Reynolds number, and the simulation results are in good agreement with the semiempirical Krieger-Dougherty formula.

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.

The automatic extraction of pitch perturbation using microcomputers: some methodological considerations.

PubMed

Deem, J F; Manning, W H; Knack, J V; Matesich, J S

1989-09-01

A program for the automatic extraction of jitter (PAEJ) was developed for the clinical measurement of pitch perturbations using a microcomputer. The program currently includes 12 implementations of an algorithm for marking the boundary criteria for a fundamental period of vocal fold vibration. The relative sensitivity of these extraction procedures for identifying the pitch period was compared using sine waves. Data obtained to date provide information for each procedure concerning the effects of waveform peakedness and slope, sample duration in cycles, noise level of the analysis system with both direct and tape recorded input, and the influence of interpolation. Zero crossing extraction procedures provided lower jitter values regardless of sine wave frequency or sample duration. The procedures making use of positive- or negative-going zero crossings with interpolation provided the lowest measures of jitter with the sine wave stimuli. Pilot data obtained with normal-speaking adults indicated that jitter measures varied as a function of the speaker, vowel, and sample duration.

Skin Effect Modeling in Conductors of Arbitrary Shape Through a Surface Admittance Operator and the Contour Integral Method

NASA Astrophysics Data System (ADS)

Patel, Utkarsh R.; Triverio, Piero

2016-09-01

An accurate modeling of skin effect inside conductors is of capital importance to solve transmission line and scattering problems. This paper presents a surface-based formulation to model skin effect in conductors of arbitrary cross section, and compute the per-unit-length impedance of a multiconductor transmission line. The proposed formulation is based on the Dirichlet-Neumann operator that relates the longitudinal electric field to the tangential magnetic field on the boundary of a conductor. We demonstrate how the surface operator can be obtained through the contour integral method for conductors of arbitrary shape. The proposed algorithm is simple to implement, efficient, and can handle arbitrary cross-sections, which is a main advantage over the existing approach based on eigenfunctions, which is available only for canonical conductor's shapes. The versatility of the method is illustrated through a diverse set of examples, which includes transmission lines with trapezoidal, curved, and V-shaped conductors. Numerical results demonstrate the accuracy, versatility, and efficiency of the proposed technique.

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.

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.

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.

Adaptivity and smart algorithms for fluid-structure interaction

NASA Technical Reports Server (NTRS)

Oden, J. Tinsley

1990-01-01

This paper reviews new approaches in CFD which have the potential for significantly increasing current capabilities of modeling complex flow phenomena and of treating difficult problems in fluid-structure interaction. These approaches are based on the notions of adaptive methods and smart algorithms, which use instantaneous measures of the quality and other features of the numerical flowfields as a basis for making changes in the structure of the computational grid and of algorithms designed to function on the grid. The application of these new techniques to several problem classes are addressed, including problems with moving boundaries, fluid-structure interaction in high-speed turbine flows, flow in domains with receding boundaries, and related problems.

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.

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.

Greenhouse gas emission footprints and energy use benchmarks for eight U.S. cities.

PubMed

Hillman, Tim; Ramaswami, Anu

2010-03-15

A hybrid life cycle-based trans-boundary greenhouse gas (GHG) emissions footprint is elucidated at the city-scale and evaluated for 8 US cities. The method incorporates end-uses of energy within city boundaries, plus cross-boundary demand for airline/freight transport and embodied energy of four key urban materials [food, water, energy (fuels), and shelter (cement)], essential for life in all cities. These cross-boundary activities contributed 47% on average more than the in-boundary GHG contributions traditionally reported for cities, indicating significant truncation at city boundaries of GHG emissions associated with urban activities. Incorporating cross-boundary contributions created convergence in per capita GHG emissions from the city-scale (average 23.7 mt-CO(2)e/capita) to the national-scale (24.5 mt-CO(2)e/capita), suggesting that six key cross-boundary activities may suffice to yield a holistic GHG emission footprint for cities, with important policy ramifications. Average GHG contributions from various human activity sectors include buildings/facilities energy use (47.1%), regional surface transport (20.8%), food production (14.7%), transport fuel production (6.4%), airline transport (4.8%), long-distance freight trucking (2.8%), cement production (2.2%), and water/wastewater/waste processing (1.3%). Energy-, travel-, and key materials-consumption efficiency metrics are elucidated in these sectors; these consumption metrics are observed to be largely similar across the eight U.S. cities and consistent with national/regional averages.

DPM, a fast, accurate Monte Carlo code optimized for photon and electron radiotherapy treatment planning dose calculations

NASA Astrophysics Data System (ADS)

Sempau, Josep; Wilderman, Scott J.; Bielajew, Alex F.

2000-08-01

A new Monte Carlo (MC) algorithm, the `dose planning method' (DPM), and its associated computer program for simulating the transport of electrons and photons in radiotherapy class problems employing primary electron beams, is presented. DPM is intended to be a high-accuracy MC alternative to the current generation of treatment planning codes which rely on analytical algorithms based on an approximate solution of the photon/electron Boltzmann transport equation. For primary electron beams, DPM is capable of computing 3D dose distributions (in 1 mm3 voxels) which agree to within 1% in dose maximum with widely used and exhaustively benchmarked general-purpose public-domain MC codes in only a fraction of the CPU time. A representative problem, the simulation of 1 million 10 MeV electrons impinging upon a water phantom of 1283 voxels of 1 mm on a side, can be performed by DPM in roughly 3 min on a modern desktop workstation. DPM achieves this performance by employing transport mechanics and electron multiple scattering distribution functions which have been derived to permit long transport steps (of the order of 5 mm) which can cross heterogeneity boundaries. The underlying algorithm is a `mixed' class simulation scheme, with differential cross sections for hard inelastic collisions and bremsstrahlung events described in an approximate manner to simplify their sampling. The continuous energy loss approximation is employed for energy losses below some predefined thresholds, and photon transport (including Compton, photoelectric absorption and pair production) is simulated in an analogue manner. The δ-scattering method (Woodcock tracking) is adopted to minimize the computational costs of transporting photons across voxels.

Evidence That Descending Cortical Axons Are Essential for Thalamocortical Axons to Cross the Pallial-Subpallial Boundary in the Embryonic Forebrain

PubMed Central

Chen, Yijing; Magnani, Dario; Theil, Thomas; Pratt, Thomas; Price, David J.

2012-01-01

Developing thalamocortical axons traverse the subpallium to reach the cortex located in the pallium. We tested the hypothesis that descending corticofugal axons are important for guiding thalamocortical axons across the pallial-subpallial boundary, using conditional mutagenesis to assess the effects of blocking corticofugal axonal development without disrupting thalamus, subpallium or the pallial-subpallial boundary. We found that thalamic axons still traversed the subpallium in topographic order but did not cross the pallial-subpallial boundary. Co-culture experiments indicated that the inability of thalamic axons to cross the boundary was not explained by mutant cortex developing a long-range chemorepulsive action on thalamic axons. On the contrary, cortex from conditional mutants retained its thalamic axonal growth-promoting activity and continued to express Nrg-1, which is responsible for this stimulatory effect. When mutant cortex was replaced with control cortex, corticofugal efferents were restored and thalamic axons from conditional mutants associated with them and crossed the pallial-subpallial boundary. Our study provides the most compelling evidence to date that cortical efferents are required to guide thalamocortical axons across the pallial-subpallial boundary, which is otherwise hostile to thalamic axons. These results support the hypothesis that thalamic axons grow from subpallium to cortex guided by cortical efferents, with stimulation from diffusible cortical growth-promoting factors. PMID:22412988

Scattering calculation and image reconstruction using elevation-focused beams

PubMed Central

Duncan, David P.; Astheimer, Jeffrey P.; Waag, Robert C.

2009-01-01

Pressure scattered by cylindrical and spherical objects with elevation-focused illumination and reception has been analytically calculated, and corresponding cross sections have been reconstructed with a two-dimensional algorithm. Elevation focusing was used to elucidate constraints on quantitative imaging of three-dimensional objects with two-dimensional algorithms. Focused illumination and reception are represented by angular spectra of plane waves that were efficiently computed using a Fourier interpolation method to maintain the same angles for all temporal frequencies. Reconstructions were formed using an eigenfunction method with multiple frequencies, phase compensation, and iteration. The results show that the scattered pressure reduces to a two-dimensional expression, and two-dimensional algorithms are applicable when the region of a three-dimensional object within an elevation-focused beam is approximately constant in elevation. The results also show that energy scattered out of the reception aperture by objects contained within the focused beam can result in the reconstructed values of attenuation slope being greater than true values at the boundary of the object. Reconstructed sound speed images, however, appear to be relatively unaffected by the loss in scattered energy. The broad conclusion that can be drawn from these results is that two-dimensional reconstructions require compensation to account for uncaptured three-dimensional scattering. PMID:19425653

Scattering calculation and image reconstruction using elevation-focused beams.

PubMed

Duncan, David P; Astheimer, Jeffrey P; Waag, Robert C

2009-05-01

Pressure scattered by cylindrical and spherical objects with elevation-focused illumination and reception has been analytically calculated, and corresponding cross sections have been reconstructed with a two-dimensional algorithm. Elevation focusing was used to elucidate constraints on quantitative imaging of three-dimensional objects with two-dimensional algorithms. Focused illumination and reception are represented by angular spectra of plane waves that were efficiently computed using a Fourier interpolation method to maintain the same angles for all temporal frequencies. Reconstructions were formed using an eigenfunction method with multiple frequencies, phase compensation, and iteration. The results show that the scattered pressure reduces to a two-dimensional expression, and two-dimensional algorithms are applicable when the region of a three-dimensional object within an elevation-focused beam is approximately constant in elevation. The results also show that energy scattered out of the reception aperture by objects contained within the focused beam can result in the reconstructed values of attenuation slope being greater than true values at the boundary of the object. Reconstructed sound speed images, however, appear to be relatively unaffected by the loss in scattered energy. The broad conclusion that can be drawn from these results is that two-dimensional reconstructions require compensation to account for uncaptured three-dimensional scattering.

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.

The relationship between the microwave radar cross section and both wind speed and stress: Model function studies using Frontal Air-Sea Interaction Experiment data

NASA Astrophysics Data System (ADS)

Weissman, David E.; Davidson, Kenneth L.; Brown, Robert A.; Friehe, Carl A.; Li, Fuk

1994-05-01

The Frontal Air-Sea Interaction Experiment (FASINEX) provided a unique data set with coincident airborne scatterometer measurements of the ocean surface radar cross section (RCS) (at Ku band) and near-surface wind and wind stress. These data have been analyzed to study new model functions which relate wind speed and surface friction velocity (square root of the kinematic wind stress) to the radar cross section and to better understand the processes in the boundary layer that have a strong influence on the radar backscatter. Studies of data from FASINEX indicate that the RCS has a different relation to the friction velocity than to the wind speed. The difference between the RCS models using these two variables depends on the polarization and the incidence angle. The radar data have been acquired from the Jet Propulsion Laboratory airborne scatterometer. These data span 10 different flight days. Stress measurements were inferred from shipboard instruments and from aircraft flying at low altitudes, closely following the scatterometer. Wide ranges of radar incidence angles and environmental conditions needed to fully develop algorithms are available from this experiment.

The relationship between the microwave radar cross section and both wind speed and stress: Model function studies using Frontal Air-Sea Interaction Experiment data

NASA Technical Reports Server (NTRS)

Weissman, David E.; Davidson, Kenneth L.; Brown, Robert A.; Friehe, Carl A.; Li, Fuk

1994-01-01

The Frontal Air-Sea Interaction Experiment (FASINEX) provided a unique data set with coincident airborne scatterometer measurements of the ocean surface radar cross section (RCS)(at Ku band) and near-surface wind and wind stress. These data have been analyzed to study new model functions which relate wind speed and surface friction velocity (square root of the kinematic wind stress) to the radar cross section and to better understand the processes in the boundary layer that have a strong influence on the radar backscatter. Studies of data from FASINEX indicate that the RCS has a different relation to the friction velocity than to the wind speed. The difference between the RCS models using these two variables depends on the polarization and the incidence angle. The radar data have been acquired from the Jet Propulsion Laboratory airborne scatterometer. These data span 10 different flight days. Stress measurements were inferred from shipboard instruments and from aircraft flying at low altitudes, closely following the scatterometer. Wide ranges of radar incidence angles and environmental conditions needed to fully develop algorithms are available from this experiment.

Change detection of riverbed movements using river cross-sections and LiDAR data

NASA Astrophysics Data System (ADS)

Vetter, Michael; Höfle, Bernhard; Mandlburger, Gottfried; Rutzinger, Martin

2010-05-01

Today, Airborne LiDAR derived digital terrain models (DTMs) are used for several aspects in different scientific disciplines, such as hydrology, geomorphology or archaeology. In the field of river geomorphology, LiDAR data sets can provide information on the riverine vegetation, the level and boundary of the water body, the elevation of the riparian foreland and their roughness. The LiDAR systems in use for topographic data acquisition mainly operate with wavelengths of at least 1064nm and, thus, are not able to penetrate water. LiDAR sensors with two wavelengths are available (bathymetric LiDAR), but they can only provide elevation information of riverbeds or lakes, if the water is clear and the minimum water depth exceeds 1.5m. In small and shallow rivers it is impossible to collect information of the riverbed, regardless of the used LiDAR sensor. In this article, we present a method to derive a high-resolution DTM of the riverbed and to combine it with the LiDAR DTM resulting in a watercourse DTM (DTM-W) as a basis for calculating the changes in the riverbed during several years. To obtain such a DTM-W we use river cross-sections acquired by terrestrial survey or echo-sounding. First, a differentiation between water and land has to be done. A highly accurate water surface can be derived by using a water surface delineation algorithm, which incorporates the amplitude information of the LiDAR point cloud and additional geometrical features (e.g. local surface roughness). The second step is to calculate a thalweg line, which is the lowest flow path in the riverbed. This is achieved by extracting the lowest point of each river cross section and by fitting a B-spline curve through those points. In the next step, the centerline of the river is calculated by applying a shrinking algorithm of the water boundary polygon. By averaging the thalweg line and the centerline, a main flow path line can be computed. Subsequently, a dense array of 2D-profiles perpendicular to the flow path line is defined and the heights are computed by linear interpolation of the original cross sections. Thus, a very dense 3D point cloud of the riverbed is obtained from which a grid model of the river bed can be calculated applying any suitable interpolation technique like triangulation, linear prediction or inverse distance mapping. In a final step, the river bed model and the LiDAR DTM are combined resulting in a watercourse DTM. By computing different DTM-Ws from multiple cross section data sets, the volume and the magnitude of changes in the riverbed can be estimated. Hence, the erosion or accumulation areas and their volume changes during several years can be quantified.

Dissolved organic carbon fluxes in the Middle Atlantic Bight: An integrated approach based on satellite data and ocean model products

PubMed Central

Mannino, Antonio; Signorini, Sergio R.; Novak, Michael G.; Wilkin, John; Friedrichs, Marjorie A. M.; Najjar, Raymond G.

2017-01-01

Continental margins play an important role in global carbon cycle, accounting for 15–21% of the global marine primary production. Since carbon fluxes across continental margins from land to the open ocean are not well constrained, we undertook a study to develop satellite algorithms to retrieve dissolved organic carbon (DOC) and combined these satellite data with physical circulation model products to quantify the shelf boundary fluxes of DOC for the U.S. Middle Atlantic Bight (MAB). Satellite DOC was computed through seasonal relationships of DOC with colored dissolved organic matter absorption coefficients, which were derived from an extensive set of in situ measurements. The multiyear time series of satellite-derived DOC stocks (4.9 Teragrams C; Tg) shows that freshwater discharge influences the magnitude and seasonal variability of DOC on the continental shelf. For the 2010–2012 period studied, the average total estuarine export of DOC into the MAB shelf is 0.77 Tg C yr−1 (year). The integrated DOC tracer fluxes across the shelf boundaries are 12.1 Tg C yr−1 entering the MAB from the southwest alongshore boundary, 18.5 Tg C yr−1 entering the MAB from the northeast alongshore boundary, and 29.0 Tg C yr−1 flowing out of the MAB across the entire length of the 100 m isobath. The magnitude of the cross-shelf DOC flux is quite variable in time (monthly) and space (north to south). The highly dynamic exchange of water along the shelf boundaries regulates the DOC budget of the MAB at subseasonal time scales. PMID:29201582

Vibration Sensor-Based Bearing Fault Diagnosis Using Ellipsoid-ARTMAP and Differential Evolution Algorithms

PubMed Central

Liu, Chang; Wang, Guofeng; Xie, Qinglu; Zhang, Yanchao

2014-01-01

Effective fault classification of rolling element bearings provides an important basis for ensuring safe operation of rotating machinery. In this paper, a novel vibration sensor-based fault diagnosis method using an Ellipsoid-ARTMAP network (EAM) and a differential evolution (DE) algorithm is proposed. The original features are firstly extracted from vibration signals based on wavelet packet decomposition. Then, a minimum-redundancy maximum-relevancy algorithm is introduced to select the most prominent features so as to decrease feature dimensions. Finally, a DE-based EAM (DE-EAM) classifier is constructed to realize the fault diagnosis. The major characteristic of EAM is that the sample distribution of each category is realized by using a hyper-ellipsoid node and smoothing operation algorithm. Therefore, it can depict the decision boundary of disperse samples accurately and effectively avoid over-fitting phenomena. To optimize EAM network parameters, the DE algorithm is presented and two objectives, including both classification accuracy and nodes number, are simultaneously introduced as the fitness functions. Meanwhile, an exponential criterion is proposed to realize final selection of the optimal parameters. To prove the effectiveness of the proposed method, the vibration signals of four types of rolling element bearings under different loads were collected. Moreover, to improve the robustness of the classifier evaluation, a two-fold cross validation scheme is adopted and the order of feature samples is randomly arranged ten times within each fold. The results show that DE-EAM classifier can recognize the fault categories of the rolling element bearings reliably and accurately. PMID:24936949

Application of a fast sorting algorithm to the assignment of mass spectrometric cross-linking data.

PubMed

Petrotchenko, Evgeniy V; Borchers, Christoph H

2014-09-01

Cross-linking combined with MS involves enzymatic digestion of cross-linked proteins and identifying cross-linked peptides. Assignment of cross-linked peptide masses requires a search of all possible binary combinations of peptides from the cross-linked proteins' sequences, which becomes impractical with increasing complexity of the protein system and/or if digestion enzyme specificity is relaxed. Here, we describe the application of a fast sorting algorithm to search large sequence databases for cross-linked peptide assignments based on mass. This same algorithm has been used previously for assigning disulfide-bridged peptides (Choi et al., ), but has not previously been applied to cross-linking studies. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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

Reducing cross-sectional data using a genetic algorithm method and effects on cross-section geometry and steady-flow profiles

USGS Publications Warehouse

Berenbrock, Charles E.

2015-01-01

The effects of reduced cross-sectional data points on steady-flow profiles were also determined. Thirty-five cross sections of the original steady-flow model of the Kootenai River were used. These two methods were tested for all cross sections with each cross section resolution reduced to 10, 20 and 30 data points, that is, six tests were completed for each of the thirty-five cross sections. Generally, differences from the original water-surface elevation were smaller as the number of data points in reduced cross sections increased, but this was not always the case, especially in the braided reach. Differences were smaller for reduced cross sections developed by the genetic algorithm method than the standard algorithm method.

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.

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.

The impact of Border policy effect on cross-border ethnic areas

NASA Astrophysics Data System (ADS)

Bie, Q. L.; Zhou, S. Y.; Li, C. S.

2013-11-01

Boundary effect analysis is related to border policy making in the cross-border ethnic area. The border effect literatures show that geographic boundaries have obvious impacts on economic, social and cultural relations in both sides of a nation border. Particularly in cross-border ethnic areas, each ethnic group has strong internal spatial structure relevance, and the boundary effect is more obvious. However, most of China's border areas are cross-border ethnic areas, each of border issues is unique. Under this perspective, we analyze the border effects of various boundaries can provide basis for formulating border management policies. For small scale of cross-border ethnic minority areas, how to formulate the boundary management policy is a good question to explore. This paper is demonstrated by a study of the impact of border management policies in Dehong Dai and Jingpo Autonomous Prefecture in Yunnan Province at the border area to Burma. The comparative method is used to analysis the border management policies in past 50 decades for the border area of Yunnan Province .This research aims to define trends within border policy and its influences to national security. This paper also examines Wendy Brown's liberal theory of border management policy. We found that it is not suitable for Sino-Burma border area. The conclusion is that the changes or instability of international economic and political situation has more influence to this cross-border ethnic area, and only innovative policy will be effective in cross-border ethnic area. So the border management policies should reflect the change of international context.

Two-step design method for highly compact three-dimensional freeform optical system for LED surface light source.

PubMed

Mao, Xianglong; Li, Hongtao; Han, Yanjun; Luo, Yi

2014-10-20

Designing an illumination system for a surface light source with a strict compactness requirement is quite challenging, especially for the general three-dimensional (3D) case. In accordance with the two key features of an expected illumination distribution, i.e., a well-controlled boundary and a precise illumination pattern, a two-step design method is proposed in this paper for highly compact 3D freeform illumination systems. In the first step, a target shape scaling strategy is combined with an iterative feedback modification algorithm to generate an optimized freeform optical system with a well-controlled boundary of the target distribution. In the second step, a set of selected radii of the system obtained in the first step are optimized to further improve the illuminating quality within the target region. The method is quite flexible and effective to design highly compact optical systems with almost no restriction on the shape of the desired target field. As examples, three highly compact freeform lenses with ratio of center height h of the lens and the maximum dimension D of the source ≤ 2.5:1 are designed for LED surface light sources to form a uniform illumination distribution on a rectangular, a cross-shaped and a complex cross pierced target plane respectively. High light control efficiency of η > 0.7 as well as low relative standard illumination deviation of RSD < 0.07 is obtained simultaneously for all the three design examples.

Cross-Boundary Coordination on Forested Landscapes: Investigating Alternatives for Implementation

NASA Astrophysics Data System (ADS)

Gass, Rebecca J.; Rickenbach, Mark; Schulte, Lisa A.; Zeuli, Kimberly

2009-01-01

Cross-boundary coordination is a tool for ecosystem management whereby landowners voluntarily coordinate management practices toward economic and/or ecological landscape-scale outcomes (e.g., fiber, invasive species control, habitat). Past research indicates that it may be particularly applicable on landscapes that include small forest landholdings. To explore alternatives by which coordination might occur, we conducted seven focus groups with landowners ( n = 51) who actively manage their forests in southwest Wisconsin and northeast Iowa. Focus group participants were presented with three hypothetical alternatives to coordinate with their neighbors; landowners could self-organize, work with a natural resource professional (i.e., forester), or work with an organization to complete a cross-boundary practice. In this article, we focus on the latter two alternatives and the role of two social theories—principal-agent and cooperation—in explaining landowners’ evaluations of these alternatives. Key findings are that (1) cross-boundary coordination has the potential to alleviate problems between landowners and resource professionals inherent to their typical working relationship, and (2) social relationships are a major factor contributing to landowners’ willingness to participate. We posit that cross-boundary coordination offers a non-economic incentive for landowners to work together as it may reduce the uncertainty associated with hiring a resource professional. At the same time, professionals can provide a bridging function among landowners who are unacquainted. To achieve these outcomes and expand the adoption of cross-boundary coordination, we suggest four guidelines. First, foster dialogue among landowners toward shared cognition and oversight. Second, match landowners’ practices and objectives such that there are clear benefits to all. Third, develop relationships through low risk activities where possible. Fourth, do not expect on-going commitments.

Cross-boundary coordination on forested landscapes: investigating alternatives for implementation.

PubMed

Gass, Rebecca J; Rickenbach, Mark; Schulte, Lisa A; Zeuli, Kimberly

2009-01-01

Cross-boundary coordination is a tool for ecosystem management whereby landowners voluntarily coordinate management practices toward economic and/or ecological landscape-scale outcomes (e.g., fiber, invasive species control, habitat). Past research indicates that it may be particularly applicable on landscapes that include small forest landholdings. To explore alternatives by which coordination might occur, we conducted seven focus groups with landowners (n=51) who actively manage their forests in southwest Wisconsin and northeast Iowa. Focus group participants were presented with three hypothetical alternatives to coordinate with their neighbors; landowners could self-organize, work with a natural resource professional (i.e., forester), or work with an organization to complete a cross-boundary practice. In this article, we focus on the latter two alternatives and the role of two social theories--principal-agent and cooperation--in explaining landowners' evaluations of these alternatives. Key findings are that (1) cross-boundary coordination has the potential to alleviate problems between landowners and resource professionals inherent to their typical working relationship, and (2) social relationships are a major factor contributing to landowners' willingness to participate. We posit that cross-boundary coordination offers a non-economic incentive for landowners to work together as it may reduce the uncertainty associated with hiring a resource professional. At the same time, professionals can provide a bridging function among landowners who are unacquainted. To achieve these outcomes and expand the adoption of cross-boundary coordination, we suggest four guidelines. First, foster dialogue among landowners toward shared cognition and oversight. Second, match landowners' practices and objectives such that there are clear benefits to all. Third, develop relationships through low risk activities where possible. Fourth, do not expect on-going commitments.

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

Estimation of TOA based MUSIC algorithm and cross correlation algorithm of appropriate interval

NASA Astrophysics Data System (ADS)

Lin, Wei; Liu, Jun; Zhou, Yineng; Huang, Jiyan

2017-03-01

Localization of mobile station (MS) has now gained considerable attention due to its wide applications in military, environmental, health and commercial systems. Phrase angle and encode data of MSK system model are two critical parameters in time-of-arrival (TOA) localization technique; nevertheless, precise value of phrase angle and encode data are not easy to achieved in general. In order to meet the actual situation, we should consider the condition that phase angle and encode data is unknown. In this paper, a novel TOA localization method, which combine MUSIC algorithm and cross correlation algorithm in an appropriate interval, is proposed. Simulations show that the proposed method has better performance than music algorithm and cross correlation algorithm of the whole interval.

Automated hexahedral mesh generation from biomedical image data: applications in limb prosthetics.

PubMed

Zachariah, S G; Sanders, J E; Turkiyyah, G M

1996-06-01

A general method to generate hexahedral meshes for finite element analysis of residual limbs and similar biomedical geometries is presented. The method utilizes skeleton-based subdivision of cross-sectional domains to produce simple subdomains in which structured meshes are easily generated. Application to a below-knee residual limb and external prosthetic socket is described. The residual limb was modeled as consisting of bones, soft tissue, and skin. The prosthetic socket model comprised a socket wall with an inner liner. The geometries of these structures were defined using axial cross-sectional contour data from X-ray computed tomography, optical scanning, and mechanical surface digitization. A tubular surface representation, using B-splines to define the directrix and generator, is shown to be convenient for definition of the structure geometries. Conversion of cross-sectional data to the compact tubular surface representation is direct, and the analytical representation simplifies geometric querying and numerical optimization within the mesh generation algorithms. The element meshes remain geometrically accurate since boundary nodes are constrained to lie on the tubular surfaces. Several element meshes of increasing mesh density were generated for two residual limbs and prosthetic sockets. Convergence testing demonstrated that approximately 19 elements are required along a circumference of the residual limb surface for a simple linear elastic model. A model with the fibula absent compared with the same geometry with the fibula present showed differences suggesting higher distal stresses in the absence of the fibula. Automated hexahedral mesh generation algorithms for sliced data represent an advancement in prosthetic stress analysis since they allow rapid modeling of any given residual limb and optimization of mesh parameters.

Cross-boundary substance uses among Hong Kong Chinese young adults.

PubMed

Lau, Joseph T F; Tsui, Hi Yi; Lam, Lawrence T; Lau, Mason

2007-09-01

The study documents the characteristics of Hong Kong residents who used substances in mainland China. Characteristics of such users were compared with those using substances elsewhere. A cross-sectional survey was used. Data analyses were stratified by gender, and multivariate analyses were performed. Respondents, Hong Kong adults aged 18-30 (n = 6,528), were interviewed using a mixed interviewer and computerized mobile phone method, at the Hong Kong-mainland China boundary. Cross-border substance users and other types of substance users had characteristics that were quite different (e.g., education level, perceived harmfulness of substance use in general, having friends who frequently used substances in mainland China). Cross-boundary substance users also found it easier to obtain substances in mainland China than in Hong Kong (males: 60.5%, females: 39.6%) and perceived no chance of being arrested in mainland China because of substance use (men: 28.8%, women: 24.5%). They tended to use substances in discos/rave parties together with friends (men: 77%, women: 81%), and substances were often obtained for free (men: 63.2%, women: 78%). Ecstasy and ketamine were often used (men: 86.5% & 79.4%, women: 81% & 70.2%), and multiple uses of different substances were common (men: 81.3%, women: 68.6%). Lower price, peer influence, and better availability were reasons behind cross-boundary substance use behaviors. Cross-boundary substance users have specific characteristics. Prevention policies should take these characteristics into account. Regional collaborations are highly warranted.

Cross-boundary Substance Uses Among Hong Kong Chinese Young Adults

PubMed Central

Tsui, Hi Yi; Lam, Lawrence T.; Lau, Mason

2007-01-01

The study documents the characteristics of Hong Kong residents who used substances in mainland China. Characteristics of such users were compared with those using substances elsewhere. A cross-sectional survey was used. Data analyses were stratified by gender, and multivariate analyses were performed. Respondents, Hong Kong adults aged 18–30 (n = 6,528), were interviewed using a mixed interviewer and computerized mobile phone method, at the Hong Kong-mainland China boundary. Cross-border substance users and other types of substance users had characteristics that were quite different (e.g., education level, perceived harmfulness of substance use in general, having friends who frequently used substances in mainland China). Cross-boundary substance users also found it easier to obtain substances in mainland China than in Hong Kong (males: 60.5%, females: 39.6%) and perceived no chance of being arrested in mainland China because of substance use (men: 28.8%, women: 24.5%). They tended to use substances in discos/rave parties together with friends (men: 77%, women: 81%), and substances were often obtained for free (men: 63.2%, women: 78%). Ecstasy and ketamine were often used (men: 86.5% & 79.4%, women: 81% & 70.2%), and multiple uses of different substances were common (men: 81.3%, women: 68.6%). Lower price, peer influence, and better availability were reasons behind cross-boundary substance use behaviors. Cross-boundary substance users have specific characteristics. Prevention policies should take these characteristics into account. Regional collaborations are highly warranted. PMID:17610070

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].

Multilevel Boundary Crossing in a Professional Development School Partnership

ERIC Educational Resources Information Center

Akkerman, Sanne; Bruining, Ton

2016-01-01

This study aims to understand the recurrent challenges of professional development school (PDS) partnerships experienced by many countries. It does so by conceptualizing PDS partnerships as endeavors to cross institutionally and epistemologically developed boundaries between teacher education, schooling, and academic research. After introducing…

Cross-boundary cooperation in a watershed context: the sentiments of private forest landowners.

PubMed

Rickenbach, Mark G; Reed, A Scott

2002-10-01

Ecosystem management and sustainable forestry on mixed ownership landscapes will require some level of cross-boundary coordination or management. Oregon's experiment with local, voluntary, collaborative forums, called watershed councils, is one mechanism to foster cross-boundary management. Fifty qualitative, in-depth interviews in three study areas were conducted with nonindustrial private forest (NIPF) landowners, watershed council members, and agency employees to learn how and why landowners participate (or not) on watershed councils. Study areas were located in three different areas of the state to reflect different ecological and organizational settings. Our case study identified three themes-stewardship ethic, property rights amid uncertainty, and action orientation-that were most salient among landowners when deciding to participate in their local watershed council. Other factors related to competing opportunities were also identified. Our results relate to the social psychological antecedents to cooperation of perceived consensus, group identity, and legitimacy of authority as well as to applied situations where cross-boundary coordination and management are goals.

On the effects of nonlinear boundary conditions in diffusive logistic equations on bounded domains

NASA Astrophysics Data System (ADS)

Cantrell, Robert Stephen; Cosner, Chris

We study a diffusive logistic equation with nonlinear boundary conditions. The equation arises as a model for a population that grows logistically inside a patch and crosses the patch boundary at a rate that depends on the population density. Specifically, the rate at which the population crosses the boundary is assumed to decrease as the density of the population increases. The model is motivated by empirical work on the Glanville fritillary butterfly. We derive local and global bifurcation results which show that the model can have multiple equilibria and in some parameter ranges can support Allee effects. The analysis leads to eigenvalue problems with nonstandard boundary conditions.

Enhancing multiple-point geostatistical modeling: 1. Graph theory and pattern adjustment

NASA Astrophysics Data System (ADS)

Tahmasebi, Pejman; Sahimi, Muhammad

2016-03-01

In recent years, higher-order geostatistical methods have been used for modeling of a wide variety of large-scale porous media, such as groundwater aquifers and oil reservoirs. Their popularity stems from their ability to account for qualitative data and the great flexibility that they offer for conditioning the models to hard (quantitative) data, which endow them with the capability for generating realistic realizations of porous formations with very complex channels, as well as features that are mainly a barrier to fluid flow. One group of such models consists of pattern-based methods that use a set of data points for generating stochastic realizations by which the large-scale structure and highly-connected features are reproduced accurately. The cross correlation-based simulation (CCSIM) algorithm, proposed previously by the authors, is a member of this group that has been shown to be capable of simulating multimillion cell models in a matter of a few CPU seconds. The method is, however, sensitive to pattern's specifications, such as boundaries and the number of replicates. In this paper the original CCSIM algorithm is reconsidered and two significant improvements are proposed for accurately reproducing large-scale patterns of heterogeneities in porous media. First, an effective boundary-correction method based on the graph theory is presented by which one identifies the optimal cutting path/surface for removing the patchiness and discontinuities in the realization of a porous medium. Next, a new pattern adjustment method is proposed that automatically transfers the features in a pattern to one that seamlessly matches the surrounding patterns. The original CCSIM algorithm is then combined with the two methods and is tested using various complex two- and three-dimensional examples. It should, however, be emphasized that the methods that we propose in this paper are applicable to other pattern-based geostatistical simulation methods.

Processing the Bouguer anomaly map of Biga and the surrounding area by the cellular neural network: application to the southwestern Marmara region

NASA Astrophysics Data System (ADS)

Aydogan, D.

2007-04-01

An image processing technique called the cellular neural network (CNN) approach is used in this study to locate geological features giving rise to gravity anomalies such as faults or the boundary of two geologic zones. CNN is a stochastic image processing technique based on template optimization using the neighborhood relationships of cells. These cells can be characterized by a functional block diagram that is typical of neural network theory. The functionality of CNN is described in its entirety by a number of small matrices (A, B and I) called the cloning template. CNN can also be considered to be a nonlinear convolution of these matrices. This template describes the strength of the nearest neighbor interconnections in the network. The recurrent perceptron learning algorithm (RPLA) is used in optimization of cloning template. The CNN and standard Canny algorithms were first tested on two sets of synthetic gravity data with the aim of checking the reliability of the proposed approach. The CNN method was compared with classical derivative techniques by applying the cross-correlation method (CC) to the same anomaly map as this latter approach can detect some features that are difficult to identify on the Bouguer anomaly maps. This approach was then applied to the Bouguer anomaly map of Biga and its surrounding area, in Turkey. Structural features in the area between Bandirma, Biga, Yenice and Gonen in the southwest Marmara region are investigated by applying the CNN and CC to the Bouguer anomaly map. Faults identified by these algorithms are generally in accordance with previously mapped surface faults. These examples show that the geologic boundaries can be detected from Bouguer anomaly maps using the cloning template approach. A visual evaluation of the outputs of the CNN and CC approaches is carried out, and the results are compared with each other. This approach provides quantitative solutions based on just a few assumptions, which makes the method more powerful than the classical methods.

Multiresolution Iterative Reconstruction in High-Resolution Extremity Cone-Beam CT

PubMed Central

Cao, Qian; Zbijewski, Wojciech; Sisniega, Alejandro; Yorkston, John; Siewerdsen, Jeffrey H; Stayman, J Webster

2016-01-01

Application of model-based iterative reconstruction (MBIR) to high resolution cone-beam CT (CBCT) is computationally challenging because of the very fine discretization (voxel size <100 µm) of the reconstructed volume. Moreover, standard MBIR techniques require that the complete transaxial support for the acquired projections is reconstructed, thus precluding acceleration by restricting the reconstruction to a region-of-interest. To reduce the computational burden of high resolution MBIR, we propose a multiresolution Penalized-Weighted Least Squares (PWLS) algorithm, where the volume is parameterized as a union of fine and coarse voxel grids as well as selective binning of detector pixels. We introduce a penalty function designed to regularize across the boundaries between the two grids. The algorithm was evaluated in simulation studies emulating an extremity CBCT system and in a physical study on a test-bench. Artifacts arising from the mismatched discretization of the fine and coarse sub-volumes were investigated. The fine grid region was parameterized using 0.15 mm voxels and the voxel size in the coarse grid region was varied by changing a downsampling factor. No significant artifacts were found in either of the regions for downsampling factors of up to 4×. For a typical extremities CBCT volume size, this downsampling corresponds to an acceleration of the reconstruction that is more than five times faster than a brute force solution that applies fine voxel parameterization to the entire volume. For certain configurations of the coarse and fine grid regions, in particular when the boundary between the regions does not cross high attenuation gradients, downsampling factors as high as 10× can be used without introducing artifacts, yielding a ~50× speedup in PWLS. The proposed multiresolution algorithm significantly reduces the computational burden of high resolution iterative CBCT reconstruction and can be extended to other applications of MBIR where computationally expensive, high-fidelity forward models are applied only to a sub-region of the field-of-view. PMID:27694701

In-Space Radiator Shape Optimization using Genetic Algorithms

NASA Technical Reports Server (NTRS)

Hull, Patrick V.; Kittredge, Ken; Tinker, Michael; SanSoucie, Michael

2006-01-01

Future space exploration missions will require the development of more advanced in-space radiators. These radiators should be highly efficient and lightweight, deployable heat rejection systems. Typical radiators for in-space heat mitigation commonly comprise a substantial portion of the total vehicle mass. A small mass savings of even 5-10% can greatly improve vehicle performance. The objective of this paper is to present the development of detailed tools for the analysis and design of in-space radiators using evolutionary computation techniques. The optimality criterion is defined as a two-dimensional radiator with a shape demonstrating the smallest mass for the greatest overall heat transfer, thus the end result is a set of highly functional radiator designs. This cross-disciplinary work combines topology optimization and thermal analysis design by means of a genetic algorithm The proposed design tool consists of the following steps; design parameterization based on the exterior boundary of the radiator, objective function definition (mass minimization and heat loss maximization), objective function evaluation via finite element analysis (thermal radiation analysis) and optimization based on evolutionary algorithms. The radiator design problem is defined as follows: the input force is a driving temperature and the output reaction is heat loss. Appropriate modeling of the space environment is added to capture its effect on the radiator. The design parameters chosen for this radiator shape optimization problem fall into two classes, variable height along the width of the radiator and a spline curve defining the -material boundary of the radiator. The implementation of multiple design parameter schemes allows the user to have more confidence in the radiator optimization tool upon demonstration of convergence between the two design parameter schemes. This tool easily allows the user to manipulate the driving temperature regions thus permitting detailed design of in-space radiators for unique situations. Preliminary results indicate an optimized shape following that of the temperature distribution regions in the "cooler" portions of the radiator. The results closely follow the expected radiator shape.

Robust moving mesh algorithms for hybrid stretched meshes: Application to moving boundaries problems

NASA Astrophysics Data System (ADS)

Landry, Jonathan; Soulaïmani, Azzeddine; Luke, Edward; Ben Haj Ali, Amine

2016-12-01

A robust Mesh-Mover Algorithm (MMA) approach is designed to adapt meshes of moving boundaries problems. A new methodology is developed from the best combination of well-known algorithms in order to preserve the quality of initial meshes. In most situations, MMAs distribute mesh deformation while preserving a good mesh quality. However, invalid meshes are generated when the motion is complex and/or involves multiple bodies. After studying a few MMA limitations, we propose the following approach: use the Inverse Distance Weighting (IDW) function to produce the displacement field, then apply the Geometric Element Transformation Method (GETMe) smoothing algorithms to improve the resulting mesh quality, and use an untangler to revert negative elements. The proposed approach has been proven efficient to adapt meshes for various realistic aerodynamic motions: a symmetric wing that has suffered large tip bending and twisting and the high-lift components of a swept wing that has moved to different flight stages. Finally, the fluid flow problem has been solved on meshes that have moved and they have produced results close to experimental ones. However, for situations where moving boundaries are too close to each other, more improvements need to be made or other approaches should be taken, such as an overset grid method.

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.

Multi-resolution MPS method

NASA Astrophysics Data System (ADS)

Tanaka, Masayuki; Cardoso, Rui; Bahai, Hamid

2018-04-01

In this work, the Moving Particle Semi-implicit (MPS) method is enhanced for multi-resolution problems with different resolutions at different parts of the domain utilising a particle splitting algorithm for the finer resolution and a particle merging algorithm for the coarser resolution. The Least Square MPS (LSMPS) method is used for higher stability and accuracy. Novel boundary conditions are developed for the treatment of wall and pressure boundaries for the Multi-Resolution LSMPS method. A wall is represented by polygons for effective simulations of fluid flows with complex wall geometries and the pressure boundary condition allows arbitrary inflow and outflow, making the method easier to be used in flow simulations of channel flows. By conducting simulations of channel flows and free surface flows, the accuracy of the proposed method was verified.

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.

The reduced basis method for the electric field integral equation

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

Fares, M., E-mail: fares@cerfacs.f; Hesthaven, J.S., E-mail: Jan_Hesthaven@Brown.ed; Maday, Y., E-mail: maday@ann.jussieu.f

We introduce the reduced basis method (RBM) as an efficient tool for parametrized scattering problems in computational electromagnetics for problems where field solutions are computed using a standard Boundary Element Method (BEM) for the parametrized electric field integral equation (EFIE). This combination enables an algorithmic cooperation which results in a two step procedure. The first step consists of a computationally intense assembling of the reduced basis, that needs to be effected only once. In the second step, we compute output functionals of the solution, such as the Radar Cross Section (RCS), independently of the dimension of the discretization space, formore » many different parameter values in a many-query context at very little cost. Parameters include the wavenumber, the angle of the incident plane wave and its polarization.« less

MOM3D method of moments code theory manual

NASA Technical Reports Server (NTRS)

Shaeffer, John F.

1992-01-01

MOM3D is a FORTRAN algorithm that solves Maxwell's equations as expressed via the electric field integral equation for the electromagnetic response of open or closed three dimensional surfaces modeled with triangle patches. Two joined triangles (couples) form the vector current unknowns for the surface. Boundary conditions are for perfectly conducting or resistive surfaces. The impedance matrix represents the fundamental electromagnetic interaction of the body with itself. A variety of electromagnetic analysis options are possible once the impedance matrix is computed including backscatter radar cross section (RCS), bistatic RCS, antenna pattern prediction for user specified body voltage excitation ports, RCS image projection showing RCS scattering center locations, surface currents excited on the body as induced by specified plane wave excitation, and near field computation for the electric field on or near the body.

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...

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 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.

Cross-Boundary Leadership: A Framework for Understanding Leadership Preparation

ERIC Educational Resources Information Center

Curry, Katherine; Krumm, Bernita

2016-01-01

Through the conceptual framework of Cross-boundary leadership, this case study examines the influence of EDLE 6633 School/Community Collaboration, a doctoral course at Oklahoma State University, on course completer's capacity to effectively facilitate and sustain collaborative partnerships between schools and communities. Findings suggest that the…

Traversing School-Community Partnerships Utilizing Cross-Boundary Leadership

ERIC Educational Resources Information Center

Krumm, Bernita L.; Curry, Katherine

2017-01-01

Utilizing the conceptual framework of cross-boundary leadership, researchers conducted this qualitative case study to gain a better understanding of district-level leaders' actions and attitudes that led to meaningful, sustainable partnerships between the school, families, and community. Administrators in two urban, two suburban, and two rural…

How Students View the Boundaries Between Their Science and Religious Education Concerning the Origins of Life and the Universe.

PubMed

Billingsley, Berry; Brock, Richard; Taber, Keith S; Riga, Fran

2016-05-01

Internationally in secondary schools, lessons are typically taught by subject specialists, raising the question of how to accommodate teaching which bridges the sciences and humanities. This is the first study to look at how students make sense of the teaching they receive in two subjects (science and religious education [RE]) when one subject's curriculum explicitly refers to cross-disciplinary study and the other does not. Interviews with 61 students in seven schools in England suggested that students perceive a permeable boundary between science and their learning in science lessons and also a permeable boundary between religion and their learning in RE lessons, yet perceive a firm boundary between science lessons and RE lessons. We concluded that it is unreasonable to expect students to transfer instruction about cross-disciplinary perspectives across such impermeable subject boundaries. Finally, we consider the implications of these findings for the successful management of cross-disciplinary education.

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.

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.

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.

A Passage through Science: Crossing Disciplinary Boundaries.

ERIC Educational Resources Information Center

Small, Henry

1999-01-01

Presents a methodology for creating pathways through the scientific literature following strong cocitation links. A path is described starting in economics and ending in astrophysics, traversing 331 documents. Attention is given to where the path crosses disciplinary boundaries and how analogy can be used to model the thought processes involved in…

Cross counter-based adaptive assembly scheme in optical burst switching networks

NASA Astrophysics Data System (ADS)

Zhu, Zhi-jun; Dong, Wen; Le, Zi-chun; Chen, Wan-jun; Sun, Xingshu

2009-11-01

A novel adaptive assembly algorithm called Cross-counter Balance Adaptive Assembly Period (CBAAP) is proposed in this paper. The major difference between CBAAP and other adaptive assembly algorithms is that the threshold of CBAAP can be dynamically adjusted according to the cross counter and step length value. In terms of assembly period and the burst loss probability, we compare the performance of CBAAP with those of three typical algorithms FAP (Fixed Assembly Period), FBL (Fixed Burst Length) and MBMAP (Min-Burst length-Max-Assembly-Period) in the simulation part. The simulation results demonstrate the effectiveness of our algorithm.

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.

Cross-sectional scanning tunneling microscopy of antiphase boundaries in epitaxially grown GaP layers on Si(001)

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

Prohl, Christopher; Lenz, Andrea, E-mail: alenz@physik.tu-berlin.de; Döscher, Henning

2016-05-15

In a fundamental cross-sectional scanning tunneling microscopy investigation on epitaxially grown GaP layers on a Si(001) substrate, differently oriented antiphase boundaries are studied. They can be identified by a specific contrast and by surface step edges starting/ending at the position of an antiphase boundary. Moreover, a change in the atomic position of P and Ga atoms along the direction of growth is observed in agreement with the structure model of antiphase boundaries in the GaP lattice. This investigation opens the perspective to reveal the orientation and position of the antiphase boundaries at the atomic scale due to the excellent surfacemore » sensitivity of this method.« less

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.

The evolution of movements and behaviour at boundaries in different landscapes: a common arena experiment with butterflies.

PubMed Central

Merckx, Thomas; Van Dyck, Hans; Karlsson, Bengt; Leimar, Olof

2003-01-01

As landscapes change, mobility patterns of species may alter. Different mechanistic scenarios may, however, lead to particular patterns. Here, we tested conflicting predictions from two hypotheses on butterfly movements in relation to habitat fragmentation. According to the resource distribution hypothesis, butterflies in more fragmented landscapes would have higher levels of mobility as resources are more scattered. However, these butterflies could have lower levels of mobility as they experience 'hard' habitat boundaries more frequently (i.e. higher crossing costs) compared with butterflies in landscapes with continuous habitat; i.e. the behaviour-at-boundaries hypothesis. We studied movements, habitat boundary crossing and habitat preference of laboratory-reared individuals of Pararge aegeria that originated from woodland and agricultural landscapes, by using an experimental landscape as a common environment (outdoor cages) to test the predictions, taking into account sexual differences and weather. Woodland butterflies covered longer distances, were more prone to cross open-shade boundaries, travelled more frequently between woodland parts of the cages and were more at flight than agricultural butterflies. Our results support the behaviour-at-boundaries hypothesis, with 'softer' boundaries for woodland landscapes. Because the butterflies were reared in a common environment, the observed behavioural differences rely on heritable variation between populations from woodland and agricultural landscapes. PMID:12964984

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).

A boundary integral method for numerical computation of radar cross section of 3D targets using hybrid BEM/FEM with edge elements

NASA Astrophysics Data System (ADS)

Dodig, H.

2017-11-01

This contribution presents the boundary integral formulation for numerical computation of time-harmonic radar cross section for 3D targets. Method relies on hybrid edge element BEM/FEM to compute near field edge element coefficients that are associated with near electric and magnetic fields at the boundary of the computational domain. Special boundary integral formulation is presented that computes radar cross section directly from these edge element coefficients. Consequently, there is no need for near-to-far field transformation (NTFFT) which is common step in RCS computations. By the end of the paper it is demonstrated that the formulation yields accurate results for canonical models such as spheres, cubes, cones and pyramids. Method has demonstrated accuracy even in the case of dielectrically coated PEC sphere at interior resonance frequency which is common problem for computational electromagnetic codes.

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.

Shape classification of wear particles by image boundary analysis using machine learning algorithms

NASA Astrophysics Data System (ADS)

Yuan, Wei; Chin, K. S.; Hua, Meng; Dong, Guangneng; Wang, Chunhui

2016-05-01

The shape features of wear particles generated from wear track usually contain plenty of information about the wear states of a machinery operational condition. Techniques to quickly identify types of wear particles quickly to respond to the machine operation and prolong the machine's life appear to be lacking and are yet to be established. To bridge rapid off-line feature recognition with on-line wear mode identification, this paper presents a new radial concave deviation (RCD) method that mainly involves the use of the particle boundary signal to analyze wear particle features. Signal output from the RCDs subsequently facilitates the determination of several other feature parameters, typically relevant to the shape and size of the wear particle. Debris feature and type are identified through the use of various classification methods, such as linear discriminant analysis, quadratic discriminant analysis, naïve Bayesian method, and classification and regression tree method (CART). The average errors of the training and test via ten-fold cross validation suggest CART is a highly suitable approach for classifying and analyzing particle features. Furthermore, the results of the wear debris analysis enable the maintenance team to diagnose faults appropriately.

Complete grain boundaries from incomplete EBSD maps: the influence of segmentation on grain size determinations

NASA Astrophysics Data System (ADS)

Heilbronner, Renée; Kilian, Ruediger

2017-04-01

Grain size analyses are carried out for a number of reasons, for example, the dynamically recrystallized grain size of quartz is used to assess the flow stresses during deformation. Typically a thin section or polished surface is used. If the expected grain size is large enough (10 µm or larger), the images can be obtained on a light microscope, if the grain size is smaller, the SEM is used. The grain boundaries are traced (the process is called segmentation and can be done manually or via image processing) and the size of the cross sectional areas (segments) is determined. From the resulting size distributions, 'the grain size' or 'average grain size', usually a mean diameter or similar, is derived. When carrying out such grain size analyses, a number of aspects are critical for the reproducibility of the result: the resolution of the imaging equipment (light microscope or SEM), the type of images that are used for segmentation (cross polarized, partial or full orientation images, CIP versus EBSD), the segmentation procedure (algorithm) itself, the quality of the segmentation and the mathematical definition and calculation of 'the average grain size'. The quality of the segmentation depends very strongly on the criteria that are used for identifying grain boundaries (for example, angles of misorientation versus shape considerations), on pre- and post-processing (filtering) and on the quality of the recorded images (most notably on the indexing ratio). In this contribution, we consider experimentally deformed Black Hills quartzite with dynamically re-crystallized grain sizes in the range of 2 - 15 µm. We compare two basic methods of segmentations of EBSD maps (orientation based versus shape based) and explore how the choice of methods influences the result of the grain size analysis. We also compare different measures for grain size (mean versus mode versus RMS, and 2D versus 3D) in order to determine which of the definitions of 'average grain size yields the most stable results.

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...

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.

Between School and Working Life: Vocational Teachers' Agency in Boundary-Crossing Settings

ERIC Educational Resources Information Center

Vahasantanen, Katja; Saarinen, Jaana; Etelapelto, Anneli

2009-01-01

This paper investigates agency among vocational teachers with reference to boundary-crossing between school and working life. Our study utilised interviews with sixteen Finnish vocational teachers. Adopting a narrative analysis approach, we found that the teachers had a variety of forms of exercising agency in terms of decisions deliberately…

Crossing Boundaries: Multi-National Action Research on Family-School Collaboration. Report No. 33.

ERIC Educational Resources Information Center

Davies, Don, Ed.; Johnson, Vivian, Ed.

This report details studies by eight researchers from five countries--Australia, Chile, the Czech Republic, Portugal, and Spain--that examine boundary-crossing issues between teachers and parents, between policies and school reality, between cultures, and between research and practice. All of the studies were based in elementary schools and…

The Learning Potential of Boundary Crossing in the Context of Product Introduction

ERIC Educational Resources Information Center

Gustavsson, Maria; Säfsten, Kristina

2017-01-01

The aim is to explore challenges related to the integration between product development and production in product introduction and, given these challenges, to analyse the learning potential of boundary crossing in the context of product introduction. The paper draws on evidence from a Swedish manufacturing company. The theoretical framework is…

Overcoming Species Boundaries in Peptide Identification with Bayesian Information Criterion-driven Error-tolerant Peptide Search (BICEPS)*

PubMed Central

Renard, Bernhard Y.; Xu, Buote; Kirchner, Marc; Zickmann, Franziska; Winter, Dominic; Korten, Simone; Brattig, Norbert W.; Tzur, Amit; Hamprecht, Fred A.; Steen, Hanno

2012-01-01

Currently, the reliable identification of peptides and proteins is only feasible when thoroughly annotated sequence databases are available. Although sequencing capacities continue to grow, many organisms remain without reliable, fully annotated reference genomes required for proteomic analyses. Standard database search algorithms fail to identify peptides that are not exactly contained in a protein database. De novo searches are generally hindered by their restricted reliability, and current error-tolerant search strategies are limited by global, heuristic tradeoffs between database and spectral information. We propose a Bayesian information criterion-driven error-tolerant peptide search (BICEPS) and offer an open source implementation based on this statistical criterion to automatically balance the information of each single spectrum and the database, while limiting the run time. We show that BICEPS performs as well as current database search algorithms when such algorithms are applied to sequenced organisms, whereas BICEPS only uses a remotely related organism database. For instance, we use a chicken instead of a human database corresponding to an evolutionary distance of more than 300 million years (International Chicken Genome Sequencing Consortium (2004) Sequence and comparative analysis of the chicken genome provide unique perspectives on vertebrate evolution. Nature 432, 695–716). We demonstrate the successful application to cross-species proteomics with a 33% increase in the number of identified proteins for a filarial nematode sample of Litomosoides sigmodontis. PMID:22493179

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.

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.

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.

Multi-Level Sequential Pattern Mining Based on Prime Encoding

NASA Astrophysics Data System (ADS)

Lianglei, Sun; Yun, Li; Jiang, Yin

Encoding is not only to express the hierarchical relationship, but also to facilitate the identification of the relationship between different levels, which will directly affect the efficiency of the algorithm in the area of mining the multi-level sequential pattern. In this paper, we prove that one step of division operation can decide the parent-child relationship between different levels by using prime encoding and present PMSM algorithm and CROSS-PMSM algorithm which are based on prime encoding for mining multi-level sequential pattern and cross-level sequential pattern respectively. Experimental results show that the algorithm can effectively extract multi-level and cross-level sequential pattern from the sequence database.

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

Cross-validation pitfalls when selecting and assessing regression and classification models.

PubMed

Krstajic, Damjan; Buturovic, Ljubomir J; Leahy, David E; Thomas, Simon

2014-03-29

We address the problem of selecting and assessing classification and regression models using cross-validation. Current state-of-the-art methods can yield models with high variance, rendering them unsuitable for a number of practical applications including QSAR. In this paper we describe and evaluate best practices which improve reliability and increase confidence in selected models. A key operational component of the proposed methods is cloud computing which enables routine use of previously infeasible approaches. We describe in detail an algorithm for repeated grid-search V-fold cross-validation for parameter tuning in classification and regression, and we define a repeated nested cross-validation algorithm for model assessment. As regards variable selection and parameter tuning we define two algorithms (repeated grid-search cross-validation and double cross-validation), and provide arguments for using the repeated grid-search in the general case. We show results of our algorithms on seven QSAR datasets. The variation of the prediction performance, which is the result of choosing different splits of the dataset in V-fold cross-validation, needs to be taken into account when selecting and assessing classification and regression models. We demonstrate the importance of repeating cross-validation when selecting an optimal model, as well as the importance of repeating nested cross-validation when assessing a prediction error.

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.

New Graph Models and Algorithms for Detecting Salient Structures from Cluttered Images

DTIC Science & Technology

2010-02-24

Development of graph models and algorithms to detect boundaries that show certain levels of symmetry, an important geometric property of many...Bookstein. Morphometric tools for landmark data. Cambridge University Press, 1991. [8] F. L. Bookstein. Principal warps: Thin-plate splines and the

Static resistivity image of a cubic saline phantom in magnetic resonance electrical impedance tomography (MREIT).

PubMed

Lee, Byung Il; Oh, Suk Hoon; Woo, Eung Je; Lee, Soo Yeol; Cho, Min Hyeong; Kwon, Ohin; Seo, Jin Keun; Baek, Woon Sik

2003-05-01

In magnetic resonance electrical impedance tomography (MREIT) we inject currents through electrodes placed on the surface of a subject and try to reconstruct cross-sectional resistivity (or conductivity) images using internal magnetic flux density as well as boundary voltage measurements. In this paper we present a static resistivity image of a cubic saline phantom (50 x 50 x 50 mm3) containing a cylindrical sausage object with an average resistivity value of 123.7 ohms cm. Our current MREIT system is based on an experimental 0.3 T MRI scanner and a current injection apparatus. We captured MR phase images of the phantom while injecting currents of 28 mA through two pairs of surface electrodes. We computed current density images from magnetic flux density images that are proportional to the MR phase images. From the current density images and boundary voltage data we reconstructed a cross-sectional resistivity image within a central region of 38.5 x 38.5 mm2 at the middle of the phantom using the J-substitution algorithm. The spatial resolution of the reconstructed image was 64 x 64 and the reconstructed average resistivity of the sausage was 117.7 ohms cm. Even though the error in the reconstructed average resistivity value was small, the relative L2-error of the reconstructed image was 25.5% due to the noise in measured MR phase images. We expect improvements in the accuracy by utilizing an MRI scanner with higher SNR and increasing the size of voxels scarifying the spatial resolution.

Imaging using cross-hole seismoelectric tomography

USGS Publications Warehouse

Araji, A.H.; Revil, A.; Jardani, A.; Minsley, B.

2011-01-01

We propose a new cross-hole imaging approach based on seismoelectric conversions associated with the transmission of seismic waves from seismic sources located in a borehole to receivers electrodes located in a second borehole. The seismoelectric seismic-to-electric problem is solved using Biot theory coupled with a generalized Ohm's law with an electrokinetic coupling term. The components of the displacement of the solid phase, the fluid pressure, and the electrical potential are solved using a finite element approach with PML boundary conditions for the seismic waves and boundary conditions mimicking an infinite material for the electrostatic problem. We have developed an inversion algorithm using the electrical disturbances recorded in the second borehole to localize the position of the heterogeneities responsible for the seismoelectric conversions. Because of the ill-posed nature of the inverse problem, regularization is used to constrain the solution at each time in the seismoelectric time window comprised between the time of the seismic shot and the time of the first arrival of the seismic waves in the second borehole. All the inverted volumetric current source densities are stacked to produce an image of the position of the heterogeneities between the two boreholes. Two simple synthetic case studies are presented to test this concept. The first case study corresponds to a vertical discontinuity between two homogeneous sub-domains. The second case study corresponds to a poroelastic inclusion embedded into an homogenous poroelastic formation. In both cases, the position of the heterogeneity is fairly well-recovered using only the electrical disturbances associated with the seismoelectric conversions. ?? 2011 Society of Exploration Geophysicists.

Fully automated prostate segmentation in 3D MR based on normalized gradient fields cross-correlation initialization and LOGISMOS refinement

NASA Astrophysics Data System (ADS)

Yin, Yin; Fotin, Sergei V.; Periaswamy, Senthil; Kunz, Justin; Haldankar, Hrishikesh; Muradyan, Naira; Cornud, François; Turkbey, Baris; Choyke, Peter

2012-02-01

Manual delineation of the prostate is a challenging task for a clinician due to its complex and irregular shape. Furthermore, the need for precisely targeting the prostate boundary continues to grow. Planning for radiation therapy, MR-ultrasound fusion for image-guided biopsy, multi-parametric MRI tissue characterization, and context-based organ retrieval are examples where accurate prostate delineation can play a critical role in a successful patient outcome. Therefore, a robust automated full prostate segmentation system is desired. In this paper, we present an automated prostate segmentation system for 3D MR images. In this system, the prostate is segmented in two steps: the prostate displacement and size are first detected, and then the boundary is refined by a shape model. The detection approach is based on normalized gradient fields cross-correlation. This approach is fast, robust to intensity variation and provides good accuracy to initialize a prostate mean shape model. The refinement model is based on a graph-search based framework, which contains both shape and topology information during deformation. We generated the graph cost using trained classifiers and used coarse-to-fine search and region-specific classifier training. The proposed algorithm was developed using 261 training images and tested on another 290 cases. The segmentation performance using mean DSC ranging from 0.89 to 0.91 depending on the evaluation subset demonstrates state of the art performance. Running time for the system is about 20 to 40 seconds depending on image size and resolution.

Dispersion analysis of leaky guided waves in fluid-loaded waveguides of generic shape.

PubMed

Mazzotti, M; Marzani, A; Bartoli, I

2014-01-01

A fully coupled 2.5D formulation is proposed to compute the dispersive parameters of waveguides with arbitrary cross-section immersed in infinite inviscid fluids. The discretization of the waveguide is performed by means of a Semi-Analytical Finite Element (SAFE) approach, whereas a 2.5D BEM formulation is used to model the impedance of the surrounding infinite fluid. The kernels of the boundary integrals contain the fundamental solutions of the space Fourier-transformed Helmholtz equation, which governs the wave propagation process in the fluid domain. Numerical difficulties related to the evaluation of singular integrals are avoided by using a regularization procedure. To improve the numerical stability of the discretized boundary integral equations for the external Helmholtz problem, the so called CHIEF method is used. The discrete wave equation results in a nonlinear eigenvalue problem in the complex axial wavenumbers that is solved at the frequencies of interest by means of a contour integral algorithm. In order to separate physical from non-physical solutions and to fulfill the requirement of holomorphicity of the dynamic stiffness matrix inside the complex wavenumber contour, the phase of the radial bulk wavenumber is uniquely defined by enforcing the Snell-Descartes law at the fluid-waveguide interface. Three numerical applications are presented. The computed dispersion curves for a circular bar immersed in oil are in agreement with those extracted using the Global Matrix Method. Novel results are presented for viscoelastic steel bars of square and L-shaped cross-section immersed in water. Copyright © 2013 Elsevier B.V. All rights reserved.

Planification de trajectoires pour placement automatise de fibres sur surfaces de geometries complexes

NASA Astrophysics Data System (ADS)

Hely, Clement

During the past 50 years, the use of composite materials drastically increase, mainly thanks to the interest of aeronautical industries for these strong and lightweight materials. To improve the productivity of composite materials manufacturing some of the largest aeronautics companies began to develop automated processes such as Automated Fibre Placement (AFP). The AFP workcells currently used by the industry were mainly developed for production of large, nearly flat, plates with low curvatures such as aircraft fuselages. However, the fields of aeronautics and sport goods production begin nowadays to show an interest for manufacturing of smaller and more complex parts. The aim of the project in which this research takes place is to design a new AFP workcell and to develop new techniques allowing production of parts with small size and complex geometry. The work presented in this thesis focuses on the path planning on multi-axial revolution surfaces, e.g. Y-shaped tubes of constant circular cross section. Several path planning algorithms will be presented aiming at the exhaustive coverage of a mandrel with pre-impregnated (prepreg) composite tape. The methodology used in two of these algorithms is to individually cover each branch of the Y-shaped part with paths deriving from a helix. In the first one, the helix will be cut at the boundary between a branch and the junction region (algorithm HD) while in the second (algorithm HA) the pseudo-helix path can be adjusted to follow this boundary. These two methods were shown to have some drawbacks compromising their practical use and possibly leading to parts with diminished mechanical properties. To avoid these drawbacks, two others algorithms were developed with a new methodology. With them, the aim is to cover two branches of the Y-shape with a continuous course (i.e. without cut). The first one uses a well known strategy which defines plies with a constant fibre orientation. Parallel paths are then computed to generate a full and uniform ply covering two branches. Once again this method suffers from a main drawback, namely that it can produce highly curved paths leading to manufacturing defects. To overcome this limitation, a last algorithm is proposed ensuring that the maximal curvature of a trajectory stays below a fixed threshold. However, fulfilling this constraint prevents to predict the complete shape of the path and to ensure a perfectly uniform coverage. It is thus proposed to generate an exhaustive set of trajectories having different shapes and covering all the part. Then, a selection algorithm is used to choose the ones which are best suited according to selection criteria. To help the definition of these criteria, a finite element analysis is conducted to give some insight concerning the best suited shapes for specific loading cases. Finally, simulations were carried out with a workcell constituted by a robotic manipulator associated with a rotary table to verify the feasibility of the paths generated by the different algorithms.

Deformation Response of Unsymmetrically Laminated Plates Subjected to Inplane Loading

NASA Technical Reports Server (NTRS)

Ochinero, Tomoya T.; Hyer, Michael W.

2002-01-01

This paper discusses the out-of-plane deformation behavior of unsymmetric cross-ply composite plates compressed inplane by displacing one edge of the plate a known amount. The plates are assumed to be initially flat and several boundary conditions are considered. Geometrically nonlinear behavior is assumed. The primary objectives are to study the out-of-plane behavior as a function of increasing inplane compression and to determine if bifurcation behavior and secondary buckling can occur. It is shown that, depending on the boundary conditions, both can occur, though the characteristics are different than the pre and post-buckling behavior of a companion symmetric cross-ply plate. Furthermore, while a symmetric cross-ply plate can postbuckle with either a positive or negative out-of-plane displacement, the unsymmetric cross-ply plates studied deflect out-of-plane only in one direction throughout the range of inplane compression, the direction again depending on the boundary conditions

A hybrid method of estimating pulsating flow parameters in the space-time domain

NASA Astrophysics Data System (ADS)

Pałczyński, Tomasz

2017-05-01

This paper presents a method for estimating pulsating flow parameters in partially open pipes, such as pipelines, internal combustion engine inlets, exhaust pipes and piston compressors. The procedure is based on the method of characteristics, and employs a combination of measurements and simulations. An experimental test rig is described, which enables pressure, temperature and mass flow rate to be measured within a defined cross section. The second part of the paper discusses the main assumptions of a simulation algorithm elaborated in the Matlab/Simulink environment. The simulation results are shown as 3D plots in the space-time domain, and compared with proposed models of phenomena relating to wave propagation, boundary conditions, acoustics and fluid mechanics. The simulation results are finally compared with acoustic phenomena, with an emphasis on the identification of resonant frequencies.

The suppression effect of a periodic surface with semicircular grooves on the high power microwave long pill-box window multipactor phenomenon

NASA Astrophysics Data System (ADS)

Zhang, Xue; Wang, Yong; Fan, Junjie; Zhong, Yong; Zhang, Rui

2014-09-01

To improve the transmitting power in an S-band klystron, a long pill-box window that has a disk with grooves with a semicircular cross section is theoretically investigated and simulated. A Monte-Carlo algorithm is used to track the secondary electron trajectories and analyze the multipactor scenario in the long pill-box window and on the grooved surface. Extending the height of the long-box window can decrease the normal electric field on the surface of the window disk, but the single surface multipactor still exists. It is confirmed that the window disk with periodic semicircular grooves can explicitly suppress the multipactor and predominantly depresses the local field enhancement and the bottom continuous multipactor. The difference between semicircular and sharp boundary grooves is clarified numerically and analytically.

Conditions for Boundary Crossing: Social Practices of Newly Qualified Swedish Teachers

ERIC Educational Resources Information Center

Andersson, Ingrid; Andersson, Sven B.

2008-01-01

The purpose of this study is to gain knowledge about conditions for boundary crossing between academic and vocational practices and to identify dimensions of social practice within workplaces. The data consist of 28 questionnaires and 14 in-depth interviews with newly qualified secondary school teachers in their first year of teaching. We use the…

Space, Scale and Languages: Identity Construction of Cross-Boundary Students in a Multilingual University in Hong Kong

ERIC Educational Resources Information Center

Gu, Mingyue Michelle; Tong, Ho Kin

2012-01-01

Drawing on the notions of scale and space, this paper investigates identity construction among a group of mainland Chinese cross-boundary students by analysing their language choices and linguistic practices in a multilingual university in Hong Kong. The research illustrates how movement across spaces by these students produces varying index…

Inter-Professional Pedagogical Collaboration between Teachers and Their Out-of-School Partners

ERIC Educational Resources Information Center

Vesterinen, Olli; Kangas, Marjaana; Krokfors, Leena; Kopisto, Kaisa; Salo, Laura

2017-01-01

Teachers cross boundaries when they collaborate with out-of-school partners to provide more authentic learning experiences for students. Using the framework of boundary crossing, the study draws on interview data from schools and their out-of-school partners to examine the research question of how the research participants viewed the beginning of…

"A Guided Walk in the Woods": Boundary Crossing in a Collaborative Action Research Project

ERIC Educational Resources Information Center

Jacobs, Gaby

2017-01-01

This article discusses the ideal and practice of collaboration in a collaborative action research project in which university researchers work together with staff from the field of primary education. A qualitative case study was conducted using the theory of boundary crossing to make sense of the ways collaboration took place within the project…

Formulation of boundary conditions for the multigrid acceleration of the Euler and Navier Stokes equations

NASA Technical Reports Server (NTRS)

Jentink, Thomas Neil; Usab, William J., Jr.

1990-01-01

An explicit, Multigrid algorithm was written to solve the Euler and Navier-Stokes equations with special consideration given to the coarse mesh boundary conditions. These are formulated in a manner consistent with the interior solution, utilizing forcing terms to prevent coarse-mesh truncation error from affecting the fine-mesh solution. A 4-Stage Hybrid Runge-Kutta Scheme is used to advance the solution in time, and Multigrid convergence is further enhanced by using local time-stepping and implicit residual smoothing. Details of the algorithm are presented along with a description of Jameson's standard Multigrid method and a new approach to formulating the Multigrid equations.

Solution of internal ballistic problem for SRM with grain of complex shape during main firing phase

NASA Astrophysics Data System (ADS)

Kiryushkin, A. E.; Minkov, L. L.

2017-10-01

Solid rocket motor (SRM) internal ballistics problems are related to the problems with moving boundaries. The algorithm able to solve similar problems in axisymmetric formulation on Cartesian mesh with an arbitrary order of accuracy is considered in this paper. The base of this algorithm is the ghost point extrapolation using inverse Lax-Wendroff procedure. Level set method is used as an implicit representation of the domain boundary. As an example, the internal ballistics problem for SRM with umbrella type grain was solved during the main firing phase. In addition, flow parameters distribution in the combustion chamber was obtained for different time moments.

Three-dimensional zonal grids about arbitrary shapes by Poisson's equation

NASA Technical Reports Server (NTRS)

Sorenson, Reese L.

1988-01-01

A method for generating 3-D finite difference grids about or within arbitrary shapes is presented. The 3-D Poisson equations are solved numerically, with values for the inhomogeneous terms found automatically by the algorithm. Those inhomogeneous terms have the effect near boundaries of reducing cell skewness and imposing arbitrary cell height. The method allows the region of interest to be divided into zones (blocks), allowing the method to be applicable to almost any physical domain. A FORTRAN program called 3DGRAPE has been written to implement the algorithm. Lastly, a method for redistributing grid points along lines normal to boundaries will be described.

A two-component Matched Interface and Boundary (MIB) regularization for charge singularity in implicit solvation

NASA Astrophysics Data System (ADS)

Geng, Weihua; Zhao, Shan

2017-12-01

We present a new Matched Interface and Boundary (MIB) regularization method for treating charge singularity in solvated biomolecules whose electrostatics are described by the Poisson-Boltzmann (PB) equation. In a regularization method, by decomposing the potential function into two or three components, the singular component can be analytically represented by the Green's function, while other components possess a higher regularity. Our new regularization combines the efficiency of two-component schemes with the accuracy of the three-component schemes. Based on this regularization, a new MIB finite difference algorithm is developed for solving both linear and nonlinear PB equations, where the nonlinearity is handled by using the inexact-Newton's method. Compared with the existing MIB PB solver based on a three-component regularization, the present algorithm is simpler to implement by circumventing the work to solve a boundary value Poisson equation inside the molecular interface and to compute related interface jump conditions numerically. Moreover, the new MIB algorithm becomes computationally less expensive, while maintains the same second order accuracy. This is numerically verified by calculating the electrostatic potential and solvation energy on the Kirkwood sphere on which the analytical solutions are available and on a series of proteins with various sizes.

Aerial Imagery and LIDAR Data Fusion for Unambiguous Extraction of Adjacent Level-Buildings Footprints

NASA Astrophysics Data System (ADS)

Mola Ebrahimi, S.; Arefi, H.; Rasti Veis, H.

2017-09-01

Our paper aims to present a new approach to identify and extract building footprints using aerial images and LiDAR data. Employing an edge detector algorithm, our method first extracts the outer boundary of buildings, and then by taking advantage of Hough transform and extracting the boundary of connected buildings in a building block, it extracts building footprints located in each block. The proposed method first recognizes the predominant leading orientation of a building block using Hough transform, and then rotates the block according to the inverted complement of the dominant line's angle. Therefore the block poses horizontally. Afterwards, by use of another Hough transform, vertical lines, which might be the building boundaries of interest, are extracted and the final building footprints within a block are obtained. The proposed algorithm is implemented and tested on the urban area of Zeebruges, Belgium(IEEE Contest,2015). The areas of extracted footprints are compared to the corresponding areas in the reference data and mean error is equal to 7.43 m2. Besides, qualitative and quantitative evaluations suggest that the proposed algorithm leads to acceptable results in automated precise extraction of building footprints.

Real-time deformation of human soft tissues: A radial basis meshless 3D model based on Marquardt's algorithm.

PubMed

Zhou, Jianyong; Luo, Zu; Li, Chunquan; Deng, Mi

2018-01-01

When the meshless method is used to establish the mathematical-mechanical model of human soft tissues, it is necessary to define the space occupied by human tissues as the problem domain and the boundary of the domain as the surface of those tissues. Nodes should be distributed in both the problem domain and on the boundaries. Under external force, the displacement of the node is computed by the meshless method to represent the deformation of biological soft tissues. However, computation by the meshless method consumes too much time, which will affect the simulation of real-time deformation of human tissues in virtual surgery. In this article, the Marquardt's Algorithm is proposed to fit the nodal displacement at the problem domain's boundary and obtain the relationship between surface deformation and force. When different external forces are applied, the deformation of soft tissues can be quickly obtained based on this relationship. The analysis and discussion show that the improved model equations with Marquardt's Algorithm not only can simulate the deformation in real-time but also preserve the authenticity of the deformation model's physical properties. Copyright © 2017 Elsevier B.V. All rights reserved.

Boundary identification and error analysis of shocked material images

NASA Astrophysics Data System (ADS)

Hock, Margaret; Howard, Marylesa; Cooper, Leora; Meehan, Bernard; Nelson, Keith

2017-06-01

To compute quantities such as pressure and velocity from laser-induced shock waves propagating through materials, high-speed images are captured and analyzed. Shock images typically display high noise and spatially-varying intensities, causing conventional analysis techniques to have difficulty identifying boundaries in the images without making significant assumptions about the data. We present a novel machine learning algorithm that efficiently segments, or partitions, images with high noise and spatially-varying intensities, and provides error maps that describe a level of uncertainty in the partitioning. The user trains the algorithm by providing locations of known materials within the image but no assumptions are made on the geometries in the image. The error maps are used to provide lower and upper bounds on quantities of interest, such as velocity and pressure, once boundaries have been identified and propagated through equations of state. This algorithm will be demonstrated on images of shock waves with noise and aberrations to quantify properties of the wave as it progresses. DOE/NV/25946-3126 This work was done by National Security Technologies, LLC, under Contract No. DE- AC52-06NA25946 with the U.S. Department of Energy and supported by the SDRD Program.

An empirical method to correct for temperature-dependent variations in the overlap function of CHM15k ceilometers

NASA Astrophysics Data System (ADS)

Hervo, Maxime; Poltera, Yann; Haefele, Alexander

2016-07-01

Imperfections in a lidar's overlap function lead to artefacts in the background, range and overlap-corrected lidar signals. These artefacts can erroneously be interpreted as an aerosol gradient or, in extreme cases, as a cloud base leading to false cloud detection. A correct specification of the overlap function is hence crucial in the use of automatic elastic lidars (ceilometers) for the detection of the planetary boundary layer or of low cloud. In this study, an algorithm is presented to correct such artefacts. It is based on the assumption of a homogeneous boundary layer and a correct specification of the overlap function down to a minimum range, which must be situated within the boundary layer. The strength of the algorithm lies in a sophisticated quality-check scheme which allows the reliable identification of favourable atmospheric conditions. The algorithm was applied to 2 years of data from a CHM15k ceilometer from the company Lufft. Backscatter signals corrected for background, range and overlap were compared using the overlap function provided by the manufacturer and the one corrected with the presented algorithm. Differences between corrected and uncorrected signals reached up to 45 % in the first 300 m above ground. The amplitude of the correction turned out to be temperature dependent and was larger for higher temperatures. A linear model of the correction as a function of the instrument's internal temperature was derived from the experimental data. Case studies and a statistical analysis of the strongest gradient derived from corrected signals reveal that the temperature model is capable of a high-quality correction of overlap artefacts, in particular those due to diurnal variations. The presented correction method has the potential to significantly improve the detection of the boundary layer with gradient-based methods because it removes false candidates and hence simplifies the attribution of the detected gradients to the planetary boundary layer. A particularly significant benefit can be expected for the detection of shallow stable layers typical of night-time situations. The algorithm is completely automatic and does not require any on-site intervention but requires the definition of an adequate instrument-specific configuration. It is therefore suited for use in large ceilometer networks.

Application of Plenoptic PIV for 3D Velocity Measurements Over Roughness Elements in a Refractive Index Matched Facility

NASA Astrophysics Data System (ADS)

Thurow, Brian; Johnson, Kyle; Kim, Taehoon; Blois, Gianluca; Best, Jim; Christensen, Ken

2014-11-01

The application of Plenoptic PIV in a Refractive Index Matched (RIM) facility housed at Illinois is presented. Plenoptic PIV is an emerging 3D diagnostic that exploits the light-field imaging capabilities of a plenoptic camera. Plenoptic cameras utilize a microlens array to measure the position and angle of light rays captured by the camera. 3D/3C velocity fields are determined through application of the MART algorithm for volume reconstruction and a conventional 3D cross-correlation PIV algorithm. The RIM facility is a recirculating tunnel with a 62.5% aqueous solution of sodium iodide used as the working fluid. Its resulting index of 1.49 is equal to that of acrylic. Plenoptic PIV was used to measure the 3D velocity field of a turbulent boundary layer flow over a smooth wall, a single wall-mounted hemisphere and a full array of hemispheres (i.e. a rough wall) with a k/ δ ~ 4.6. Preliminary time averaged and instantaneous 3D velocity fields will be presented. This material is based upon work supported by the National Science Foundation under Grant No. 1235726.

Free-end adaptive nudged elastic band method for locating transition states in minimum energy path calculation.

PubMed

Zhang, Jiayong; Zhang, Hongwu; Ye, Hongfei; Zheng, Yonggang

2016-09-07

A free-end adaptive nudged elastic band (FEA-NEB) method is presented for finding transition states on minimum energy paths, where the energy barrier is very narrow compared to the whole paths. The previously proposed free-end nudged elastic band method may suffer from convergence problems because of the kinks arising on the elastic band if the initial elastic band is far from the minimum energy path and weak springs are adopted. We analyze the origin of the formation of kinks and present an improved free-end algorithm to avoid the convergence problem. Moreover, by coupling the improved free-end algorithm and an adaptive strategy, we develop a FEA-NEB method to accurately locate the transition state with the elastic band cut off repeatedly and the density of images near the transition state increased. Several representative numerical examples, including the dislocation nucleation in a penta-twinned nanowire, the twin boundary migration under a shear stress, and the cross-slip of screw dislocation in face-centered cubic metals, are investigated by using the FEA-NEB method. Numerical results demonstrate both the stability and efficiency of the proposed method.

Plenoptic PIV: Towards simple, robust 3D flow measurements

NASA Astrophysics Data System (ADS)

Thurow, Brian; Fahringer, Tim

2013-11-01

In this work, we report on the recent development of plenoptic PIV for the measurement of 3D flow fields. Plenoptic PIV uses a plenoptic camera to record the 4D light-field generated by a volume of particles seeded into a flow field. Plenoptic cameras are primarily known for their ability to computational refocus or change the perspective of an image after it has been acquired. In this work, we use tomographic algorithms to reconstruct a 3D volume of the particle field and apply a cross-correlation algorithm to a pair of particle volumes to determine the 3D/3C velocity field. The primary advantage of plenoptic PIV over multi-camera techniques is that it only uses a single camera, which greatly reduces the cost and simplifies a typical experimental arrangement. In addition, plenoptic PIV is capable of making measurements over dimensions on the order of 100 mm × 100 mm × 100 mm. The spatial resolution and accuracy of the technique are presented along with examples of 3D velocity data acquired in turbulent boundary layers and supersonic jets. This work was primarily supported through an AFOSR grant.

Interactive 3D segmentation of the prostate in magnetic resonance images using shape and local appearance similarity analysis

NASA Astrophysics Data System (ADS)

Shahedi, Maysam; Fenster, Aaron; Cool, Derek W.; Romagnoli, Cesare; Ward, Aaron D.

2013-03-01

3D segmentation of the prostate in medical images is useful to prostate cancer diagnosis and therapy guidance, but is time-consuming to perform manually. Clinical translation of computer-assisted segmentation algorithms for this purpose requires a comprehensive and complementary set of evaluation metrics that are informative to the clinical end user. We have developed an interactive 3D prostate segmentation method for 1.5T and 3.0T T2-weighted magnetic resonance imaging (T2W MRI) acquired using an endorectal coil. We evaluated our method against manual segmentations of 36 3D images using complementary boundary-based (mean absolute distance; MAD), regional overlap (Dice similarity coefficient; DSC) and volume difference (ΔV) metrics. Our technique is based on inter-subject prostate shape and local boundary appearance similarity. In the training phase, we calculated a point distribution model (PDM) and a set of local mean intensity patches centered on the prostate border to capture shape and appearance variability. To segment an unseen image, we defined a set of rays - one corresponding to each of the mean intensity patches computed in training - emanating from the prostate centre. We used a radial-based search strategy and translated each mean intensity patch along its corresponding ray, selecting as a candidate the boundary point with the highest normalized cross correlation along each ray. These boundary points were then regularized using the PDM. For the whole gland, we measured a mean+/-std MAD of 2.5+/-0.7 mm, DSC of 80+/-4%, and ΔV of 1.1+/-8.8 cc. We also provided an anatomic breakdown of these metrics within the prostatic base, mid-gland, and apex.

Novel approach for image skeleton and distance transformation parallel algorithms

NASA Astrophysics Data System (ADS)

Qing, Kent P.; Means, Robert W.

1994-05-01

Image Understanding is more important in medical imaging than ever, particularly where real-time automatic inspection, screening and classification systems are installed. Skeleton and distance transformations are among the common operations that extract useful information from binary images and aid in Image Understanding. The distance transformation describes the objects in an image by labeling every pixel in each object with the distance to its nearest boundary. The skeleton algorithm starts from the distance transformation and finds the set of pixels that have a locally maximum label. The distance algorithm has to scan the entire image several times depending on the object width. For each pixel, the algorithm must access the neighboring pixels and find the maximum distance from the nearest boundary. It is a computational and memory access intensive procedure. In this paper, we propose a novel parallel approach to the distance transform and skeleton algorithms using the latest VLSI high- speed convolutional chips such as HNC's ViP. The algorithm speed is dependent on the object's width and takes (k + [(k-1)/3]) * 7 milliseconds for a 512 X 512 image with k being the maximum distance of the largest object. All objects in the image will be skeletonized at the same time in parallel.

Algorithm of composing the schedule of construction and installation works

NASA Astrophysics Data System (ADS)

Nehaj, Rustam; Molotkov, Georgij; Rudchenko, Ivan; Grinev, Anatolij; Sekisov, Aleksandr

2017-10-01

An algorithm for scheduling works is developed, in which the priority of the work corresponds to the total weight of the subordinate works, the vertices of the graph, and it is proved that for graphs of the tree type the algorithm is optimal. An algorithm is synthesized to reduce the search for solutions when drawing up schedules of construction and installation works, allocating a subset with the optimal solution of the problem of the minimum power, which is determined by the structure of its initial data and numerical values. An algorithm for scheduling construction and installation work is developed, taking into account the schedule for the movement of brigades, which is characterized by the possibility to efficiently calculate the values of minimizing the time of work performance by the parameters of organizational and technological reliability through the use of the branch and boundary method. The program of the computational algorithm was compiled in the MatLAB-2008 program. For the initial data of the matrix, random numbers were taken, uniformly distributed in the range from 1 to 100. It takes 0.5; 2.5; 7.5; 27 minutes to solve the problem. Thus, the proposed method for estimating the lower boundary of the solution is sufficiently accurate and allows efficient solution of the minimax task of scheduling construction and installation works.

Global Artificial Boundary Conditions for Computation of External Flow Problems with Propulsive Jets

NASA Technical Reports Server (NTRS)

Tsynkov, Semyon; Abarbanel, Saul; Nordstrom, Jan; Ryabenkii, Viktor; Vatsa, Veer

1998-01-01

We propose new global artificial boundary conditions (ABC's) for computation of flows with propulsive jets. The algorithm is based on application of the difference potentials method (DPM). Previously, similar boundary conditions have been implemented for calculation of external compressible viscous flows around finite bodies. The proposed modification substantially extends the applicability range of the DPM-based algorithm. In the paper, we present the general formulation of the problem, describe our numerical methodology, and discuss the corresponding computational results. The particular configuration that we analyze is a slender three-dimensional body with boat-tail geometry and supersonic jet exhaust in a subsonic external flow under zero angle of attack. Similarly to the results obtained earlier for the flows around airfoils and wings, current results for the jet flow case corroborate the superiority of the DPM-based ABC's over standard local methodologies from the standpoints of accuracy, overall numerical performance, and robustness.

A Human-in-the Loop Exploration of the Dynamic Airspace Configuration Concept

NASA Technical Reports Server (NTRS)

Homola, Jeffrey; Lee, Paul U.; Prevot, Thomas; Lee, Hwasoo; Kessell, Angela; Brasil, Connie; Smith, Nancy

2010-01-01

An exploratory human-in-the-loop study was conducted to better understand the impact of Dynamic Airspace Configuration (DAC) on air traffic controllers. To do so, a range of three progressively more aggressive algorithmic approaches to sectorizations were chosen. Sectorizations from these algorithms were used to test and quantify the range of impact on the controller and traffic. Results show that traffic count was more equitably distributed between the four test sectors and duration of counts over MAP were progressively lower as the magnitude of boundary change increased. However, taskload and workload were also shown to increase with the increase in aggressiveness and acceptability of the boundary changes decreased. Overall, simulated operations of the DAC concept did not appear to compromise safety. Feedback from the participants highlighted the importance of limiting some aspects of boundary changes such as amount of volume gained or lost and the extent of change relative to the initial airspace design.

First-Principle Construction of U(1) Symmetric Matrix Product States

NASA Astrophysics Data System (ADS)

Rakov, Mykhailo V.

2018-07-01

The algorithm to calculate the sets of symmetry sectors for virtual indices of U(1) symmetric matrix product states (MPS) is described. The principal differences between open (OBC) and periodic (PBC) boundary conditions are stressed, and the extension of PBC MPS algorithm to projected entangled pair states is outlined.

Calculating Shocks In Flows At Chemical Equilibrium

NASA Technical Reports Server (NTRS)

Eberhardt, Scott; Palmer, Grant

1988-01-01

Boundary conditions prove critical. Conference paper describes algorithm for calculation of shocks in hypersonic flows of gases at chemical equilibrium. Although algorithm represents intermediate stage in development of reliable, accurate computer code for two-dimensional flow, research leading up to it contributes to understanding of what is needed to complete task.

UAS Collision Avoidance Algorithm that Minimizes the Impact on Route Surveillance

DTIC Science & Technology

2009-03-01

Appendix A: Collision Avoidance Algorithm/Virtual Cockpit Interface .......................124 Appendix B : Collision Cone Boundary Rates... b ) Split Cone (c) Multiple Intruders, Single and Split Cones [27] ........................................................ 27 3-3: Collision Cone...Approach in the Vertical Plane (a) Single Cone ( b ) Multiple Intruders, Single and Split Cone [27

Boundary transfer matrices and boundary quantum KZ equations

NASA Astrophysics Data System (ADS)

Vlaar, Bart

2015-07-01

A simple relation between inhomogeneous transfer matrices and boundary quantum Knizhnik-Zamolodchikov (KZ) equations is exhibited for quantum integrable systems with reflecting boundary conditions, analogous to an observation by Gaudin for periodic systems. Thus, the boundary quantum KZ equations receive a new motivation. We also derive the commutativity of Sklyanin's boundary transfer matrices by merely imposing appropriate reflection equations, in particular without using the conditions of crossing symmetry and unitarity of the R-matrix.

Efficient algorithms for analyzing the singularly perturbed boundary value problems of fractional order

NASA Astrophysics Data System (ADS)

Sayevand, K.; Pichaghchi, K.

2018-04-01

In this paper, we were concerned with the description of the singularly perturbed boundary value problems in the scope of fractional calculus. We should mention that, one of the main methods used to solve these problems in classical calculus is the so-called matched asymptotic expansion method. However we shall note that, this was not achievable via the existing classical definitions of fractional derivative, because they do not obey the chain rule which one of the key elements of the matched asymptotic expansion method. In order to accommodate this method to fractional derivative, we employ a relatively new derivative so-called the local fractional derivative. Using the properties of local fractional derivative, we extend the matched asymptotic expansion method to the scope of fractional calculus and introduce a reliable new algorithm to develop approximate solutions of the singularly perturbed boundary value problems of fractional order. In the new method, the original problem is partitioned into inner and outer solution equations. The reduced equation is solved with suitable boundary conditions which provide the terminal boundary conditions for the boundary layer correction. The inner solution problem is next solved as a solvable boundary value problem. The width of the boundary layer is approximated using appropriate resemblance function. Some theoretical results are established and proved. Some illustrating examples are solved and the results are compared with those of matched asymptotic expansion method and homotopy analysis method to demonstrate the accuracy and efficiency of the method. It can be observed that, the proposed method approximates the exact solution very well not only in the boundary layer, but also away from the layer.

A MULTI-STREAM MODEL FOR VERTICAL MIXING OF A PASSIVE TRACER IN THE CONVECTIVE BOUNDARY LAYER

EPA Science Inventory

We study a multi-stream model (MSM) for vertical mixing of a passive tracer in the convective boundary layer, in which the tracer is advected by many vertical streams with different probabilities and diffused by small scale turbulence. We test the MSM algorithm for investigatin...

Construction Method of Analytical Solutions to the Mathematical Physics Boundary Problems for Non-Canonical Domains

NASA Astrophysics Data System (ADS)

Mobarakeh, Pouyan Shakeri; Grinchenko, Victor T.

2015-06-01

The majority of practical cases of acoustics problems requires solving the boundary problems in non-canonical domains. Therefore construction of analytical solutions of mathematical physics boundary problems for non-canonical domains is both lucrative from the academic viewpoint, and very instrumental for elaboration of efficient algorithms of quantitative estimation of the field characteristics under study. One of the main solving ideologies for such problems is based on the superposition method that allows one to analyze a wide class of specific problems with domains which can be constructed as the union of canonically-shaped subdomains. It is also assumed that an analytical solution (or quasi-solution) can be constructed for each subdomain in one form or another. However, this case implies some difficulties in the construction of calculation algorithms, insofar as the boundary conditions are incompletely defined in the intervals, where the functions appearing in the general solution are orthogonal to each other. We discuss several typical examples of problems with such difficulties, we study their nature and identify the optimal methods to overcome them.

Localizing text in scene images by boundary clustering, stroke segmentation, and string fragment classification.

PubMed

Yi, Chucai; Tian, Yingli

2012-09-01

In this paper, we propose a novel framework to extract text regions from scene images with complex backgrounds and multiple text appearances. This framework consists of three main steps: boundary clustering (BC), stroke segmentation, and string fragment classification. In BC, we propose a new bigram-color-uniformity-based method to model both text and attachment surface, and cluster edge pixels based on color pairs and spatial positions into boundary layers. Then, stroke segmentation is performed at each boundary layer by color assignment to extract character candidates. We propose two algorithms to combine the structural analysis of text stroke with color assignment and filter out background interferences. Further, we design a robust string fragment classification based on Gabor-based text features. The features are obtained from feature maps of gradient, stroke distribution, and stroke width. The proposed framework of text localization is evaluated on scene images, born-digital images, broadcast video images, and images of handheld objects captured by blind persons. Experimental results on respective datasets demonstrate that the framework outperforms state-of-the-art localization algorithms.

Reconstructing cortical current density by exploring sparseness in the transform domain

NASA Astrophysics Data System (ADS)

Ding, Lei

2009-05-01

In the present study, we have developed a novel electromagnetic source imaging approach to reconstruct extended cortical sources by means of cortical current density (CCD) modeling and a novel EEG imaging algorithm which explores sparseness in cortical source representations through the use of L1-norm in objective functions. The new sparse cortical current density (SCCD) imaging algorithm is unique since it reconstructs cortical sources by attaining sparseness in a transform domain (the variation map of cortical source distributions). While large variations are expected to occur along boundaries (sparseness) between active and inactive cortical regions, cortical sources can be reconstructed and their spatial extents can be estimated by locating these boundaries. We studied the SCCD algorithm using numerous simulations to investigate its capability in reconstructing cortical sources with different extents and in reconstructing multiple cortical sources with different extent contrasts. The SCCD algorithm was compared with two L2-norm solutions, i.e. weighted minimum norm estimate (wMNE) and cortical LORETA. Our simulation data from the comparison study show that the proposed sparse source imaging algorithm is able to accurately and efficiently recover extended cortical sources and is promising to provide high-accuracy estimation of cortical source extents.

Virtual network embedding in cross-domain network based on topology and resource attributes

NASA Astrophysics Data System (ADS)

Zhu, Lei; Zhang, Zhizhong; Feng, Linlin; Liu, Lilan

2018-03-01

Aiming at the network architecture ossification and the diversity of access technologies issues, this paper researches the cross-domain virtual network embedding algorithm. By analysing the topological attribute from the local and global perspective of nodes in the virtual network and the physical network, combined with the local network resource property, we rank the embedding priority of the nodes with PCA and TOPSIS methods. Besides, the link load distribution is considered. Above all, We proposed an cross-domain virtual network embedding algorithm based on topology and resource attributes. The simulation results depicts that our algorithm increases the acceptance rate of multi-domain virtual network requests, compared with the existing virtual network embedding algorithm.

Automatic detection of zebra crossings from mobile LiDAR data

NASA Astrophysics Data System (ADS)

Riveiro, B.; González-Jorge, H.; Martínez-Sánchez, J.; Díaz-Vilariño, L.; Arias, P.

2015-07-01

An algorithm for the automatic detection of zebra crossings from mobile LiDAR data is developed and tested to be applied for road management purposes. The algorithm consists of several subsequent processes starting with road segmentation by performing a curvature analysis for each laser cycle. Then, intensity images are created from the point cloud using rasterization techniques, in order to detect zebra crossing using the Standard Hough Transform and logical constrains. To optimize the results, image processing algorithms are applied to the intensity images from the point cloud. These algorithms include binarization to separate the painting area from the rest of the pavement, median filtering to avoid noisy points, and mathematical morphology to fill the gaps between the pixels in the border of white marks. Once the road marking is detected, its position is calculated. This information is valuable for inventorying purposes of road managers that use Geographic Information Systems. The performance of the algorithm has been evaluated over several mobile LiDAR strips accounting for a total of 30 zebra crossings. That test showed a completeness of 83%. Non-detected marks mainly come from painting deterioration of the zebra crossing or by occlusions in the point cloud produced by other vehicles on the road.

An Automated Cloud-edge Detection Algorithm Using Cloud Physics and Radar Data

NASA Technical Reports Server (NTRS)

Ward, Jennifer G.; Merceret, Francis J.; Grainger, Cedric A.

2003-01-01

An automated cloud edge detection algorithm was developed and extensively tested. The algorithm uses in-situ cloud physics data measured by a research aircraft coupled with ground-based weather radar measurements to determine whether the aircraft is in or out of cloud. Cloud edges are determined when the in/out state changes, subject to a hysteresis constraint. The hysteresis constraint prevents isolated transient cloud puffs or data dropouts from being identified as cloud boundaries. The algorithm was verified by detailed manual examination of the data set in comparison to the results from application of the automated algorithm.

Numerical Treatment of Degenerate Diffusion Equations via Feller's Boundary Classification, and Applications

NASA Technical Reports Server (NTRS)

Cacio, Emanuela; Cohn, Stephen E.; Spigler, Renato

2011-01-01

A numerical method is devised to solve a class of linear boundary-value problems for one-dimensional parabolic equations degenerate at the boundaries. Feller theory, which classifies the nature of the boundary points, is used to decide whether boundary conditions are needed to ensure uniqueness, and, if so, which ones they are. The algorithm is based on a suitable preconditioned implicit finite-difference scheme, grid, and treatment of the boundary data. Second-order accuracy, unconditional stability, and unconditional convergence of solutions of the finite-difference scheme to a constant as the time-step index tends to infinity are further properties of the method. Several examples, pertaining to financial mathematics, physics, and genetics, are presented for the purpose of illustration.

Xilmass: A New Approach toward the Identification of Cross-Linked Peptides.

PubMed

Yılmaz, Şule; Drepper, Friedel; Hulstaert, Niels; Černič, Maša; Gevaert, Kris; Economou, Anastassios; Warscheid, Bettina; Martens, Lennart; Vandermarliere, Elien

2016-10-18

Chemical cross-linking coupled with mass spectrometry plays an important role in unravelling protein interactions, especially weak and transient ones. Moreover, cross-linking complements several structural determination approaches such as cryo-EM. Although several computational approaches are available for the annotation of spectra obtained from cross-linked peptides, there remains room for improvement. Here, we present Xilmass, a novel algorithm to identify cross-linked peptides that introduces two new concepts: (i) the cross-linked peptides are represented in the search database such that the cross-linking sites are explicitly encoded, and (ii) the scoring function derived from the Andromeda algorithm was adapted to score against a theoretical tandem mass spectrometry (MS/MS) spectrum that contains the peaks from all possible fragment ions of a cross-linked peptide pair. The performance of Xilmass was evaluated against the recently published Kojak and the popular pLink algorithms on a calmodulin-plectin complex data set, as well as three additional, published data sets. The results show that Xilmass typically had the highest number of identified distinct cross-linked sites and also the highest number of predicted cross-linked sites.

The DANTE Boltzmann transport solver: An unstructured mesh, 3-D, spherical harmonics algorithm compatible with parallel computer architectures

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

McGhee, J.M.; Roberts, R.M.; Morel, J.E.

1997-06-01

A spherical harmonics research code (DANTE) has been developed which is compatible with parallel computer architectures. DANTE provides 3-D, multi-material, deterministic, transport capabilities using an arbitrary finite element mesh. The linearized Boltzmann transport equation is solved in a second order self-adjoint form utilizing a Galerkin finite element spatial differencing scheme. The core solver utilizes a preconditioned conjugate gradient algorithm. Other distinguishing features of the code include options for discrete-ordinates and simplified spherical harmonics angular differencing, an exact Marshak boundary treatment for arbitrarily oriented boundary faces, in-line matrix construction techniques to minimize memory consumption, and an effective diffusion based preconditioner formore » scattering dominated problems. Algorithm efficiency is demonstrated for a massively parallel SIMD architecture (CM-5), and compatibility with MPP multiprocessor platforms or workstation clusters is anticipated.« less

Application of Three Existing Stope Boundary Optimisation Methods in an Operating Underground Mine

NASA Astrophysics Data System (ADS)

Erdogan, Gamze; Yavuz, Mahmut

2017-12-01

The underground mine planning and design optimisation process have received little attention because of complexity and variability of problems in underground mines. Although a number of optimisation studies and software tools are available and some of them, in special, have been implemented effectively to determine the ultimate-pit limits in an open pit mine, there is still a lack of studies for optimisation of ultimate stope boundaries in underground mines. The proposed approaches for this purpose aim at maximizing the economic profit by selecting the best possible layout under operational, technical and physical constraints. In this paper, the existing three heuristic techniques including Floating Stope Algorithm, Maximum Value Algorithm and Mineable Shape Optimiser (MSO) are examined for optimisation of stope layout in a case study. Each technique is assessed in terms of applicability, algorithm capabilities and limitations considering the underground mine planning challenges. Finally, the results are evaluated and compared.

Semi-automated segmentation of the prostate gland boundary in ultrasound images using a machine learning approach

NASA Astrophysics Data System (ADS)

Diaz, Kristians; Castaneda, Benjamin

2008-03-01

This paper presents a semi-automated algorithm for prostate boundary segmentation from three-dimensional (3D) ultrasound (US) images. The US volume is sampled into 72 slices which go through the center of the prostate gland and are separated at a uniform angular spacing of 2.5 degrees. The approach requires the user to select four points from slices (at 0, 45, 90 and 135 degrees) which are used to initialize a discrete dynamic contour (DDC) algorithm. 4 Support Vector Machines (SVMs) are trained over the output of the DDC and classify the rest of the slices. The output of the SVMs is refined using binary morphological operations and DDC to produce the final result. The algorithm was tested on seven ex vivo 3D US images of prostate glands embedded in an agar mold. Results show good agreement with manual segmentation.

A Family of Well-Clear Boundary Models for the Integration of UAS in the NAS

NASA Technical Reports Server (NTRS)

Munoz, Cesar A.; Narkawicz, Anthony; Chamberlain, James; Consiglio, Maria; Upchurch, Jason

2014-01-01

The FAA-sponsored Sense and Avoid Workshop for Unmanned Aircraft Systems (UAS) defines the concept of sense and avoid for remote pilots as "the capability of a UAS to remain well clear from and avoid collisions with other airborne traffic." Hence, a rigorous definition of well clear is fundamental to any separation assurance concept for the integration of UAS into civil airspace. This paper presents a family of well-clear boundary models based on the TCAS II Resolution Advisory logic. For these models, algorithms that predict well-clear violations along aircraft current trajectories are provided. These algorithms are analogous to conflict detection algorithms but instead of predicting loss of separation, they predict whether well-clear violations will occur during a given lookahead time interval. Analytical techniques are used to study the properties and relationships satisfied by the models.

Electromagnetic MUSIC-type imaging of perfectly conducting, arc-like cracks at single frequency

NASA Astrophysics Data System (ADS)

Park, Won-Kwang; Lesselier, Dominique

2009-11-01

We propose a non-iterative MUSIC (MUltiple SIgnal Classification)-type algorithm for the time-harmonic electromagnetic imaging of one or more perfectly conducting, arc-like cracks found within a homogeneous space R2. The algorithm is based on a factorization of the Multi-Static Response (MSR) matrix collected in the far-field at a single, nonzero frequency in either Transverse Magnetic (TM) mode (Dirichlet boundary condition) or Transverse Electric (TE) mode (Neumann boundary condition), followed by the calculation of a MUSIC cost functional expected to exhibit peaks along the crack curves each half a wavelength. Numerical experimentation from exact, noiseless and noisy data shows that this is indeed the case and that the proposed algorithm behaves in robust manner, with better results in the TM mode than in the TE mode for which one would have to estimate the normal to the crack to get the most optimal results.

Perceiving the writing sequence of Chinese characters: an ERP investigation.

PubMed

Qiu, Yinchen; Zhou, Xiaolin

2010-04-01

The neural dynamics in perceiving well-learned sequences and its modulation by task demand were investigated in this study in which participants were asked to observe stroke-by-stroke display of Chinese characters composed of two radicals while their brain activity was monitored with the event-related potential (ERP) technique. Experiment 1 used an accuracy judgment task that would draw participants' attention to the violation of the writing sequence whereas Experiment 2 required participants to judge the completion of the display and thus the more automatic aspects of sequence processing could be revealed. In Experiment 1, the within-radical boundary reversal produced bilateral posterior N2 enhancement and the cross-boundary reversal elicited a left N2 effect and right posterior N2 reduction on the critical stroke. Both types of reversal elicited P3 effects on the critical stroke and sustained negativity effects on the following stroke, with the size being larger for the cross-boundary reversal. In Experiment 2, in addition to the P3 effects, the within-boundary reversal elicited a left posterior N2 effect and the cross-boundary reversal elicited right posterior N2 reduction on the critical stroke. Moreover, on the following stroke, the cross-boundary reversal elicited a right N2 effect and both types of reversal elicited sustained positivity effects. These findings demonstrate that native Chinese readers use their sequential knowledge to predict upcoming strokes in perceiving the writing of characters and to construct appropriate representations for the action sequence regardless of whether such predictions and constructions are required by the task. Copyright 2009 Elsevier Inc. All rights reserved.

Observed bottom boundary layer transport and uplift on the continental shelf adjacent to a western boundary current

NASA Astrophysics Data System (ADS)

Schaeffer, A.; Roughan, M.; Wood, J. E.

2014-08-01

Western boundary currents strongly influence the dynamics on the adjacent continental shelf and in particular the cross-shelf transport and uplift through the bottom boundary layer. Four years of moored in situ observations on the narrow southeastern Australian shelf (in water depths of between 65 and 140 m) were used to investigate bottom cross-shelf transport, both upstream (30°S) and downstream (34°S) of the separation zone of the East Australian Current (EAC). Bottom transport was estimated and assessed against Ekman theory, showing consistent results for a number of different formulations of the boundary layer thickness. Net bottom cross-shelf transport was onshore at all locations. Ekman theory indicates that up to 64% of the transport variability is driven by the along-shelf bottom stress. Onshore transport in the bottom boundary layer was more intense and frequent upstream than downstream, occurring 64% of the time at 30°S. Wind-driven surface Ekman transport estimates did not balance the bottom cross-shelf flow. At both locations, strong variability was found in bottom water transport at periods of approximately 90-100 days. This corresponds with periodicity in EAC fluctuations and eddy shedding as evidenced from altimeter observations, highlighting the EAC as a driver of variability in the continental shelf waters. Ocean glider and HF radar observations were used to identify the bio-physical response to an EAC encroachment event, resulting in a strong onshore bottom flow, the uplift of cold slope water, and elevated coastal chlorophyll concentrations.

Towards Inclusion of Cross-Boundary Students from Mainland China in Educational Policies and Practices in Hong Kong

ERIC Educational Resources Information Center

Yuen, Celeste Yuet-Mui

2011-01-01

Every society has an obligation to provide quality education to children regardless of their socio-economic and cultural backgrounds. The number of cross-boundary students (CBS) from Mainland China in Hong Kong schools is increasing. This article reviews educational policy and provision for educating CBS, presenting data from an empirical study.…

Boundary Crossing between Higher Education and the World of Work: A Case Study in Post-1994 Rwanda

ERIC Educational Resources Information Center

Mutwarasibo, Faustin; Ruterana, Pierre Canisius; Andersson, Ingrid

2014-01-01

Workplaces abound with knowledge that is different from the knowledge students gain at universities. Crossing the boundary from a university to a workplace can, therefore, be difficult for students. To compensate for the dearth of knowledge on how these issues play out in an African context, this study investigates how knowledge and experiences…

Crossing the Cultural Boundary from Home to Kindergarten in Hong Kong: A Case Study of a Child's Strategic Actions

ERIC Educational Resources Information Center

Lam, Mei Seung

2009-01-01

Transition from home to kindergarten is the first and major ecological transition in children's educational lives in Hong Kong. In this transition, children cross a cultural boundary from home to kindergarten and start to learn about "school" as a place to learn and about themselves as "pupils" in kindergarten. The conceptual…

Learning at Trade Vocational School and Learning at Work: Boundary Crossing in Apprentices' Everyday Life

ERIC Educational Resources Information Center

Tanggaard, Lene

2007-01-01

This article argues in favour of a situated approach to understanding learning in practice at trade vocational school and at trade in vocational education. Boundary crossing is regarded as contributing to expansive situated learning by apprentices across trade vocational school and the trade. The purpose of the article is to show that the…

A Survival Analysis of the Impact of Boundary Crossings on Managerial Career Advancement up to Midcareer

ERIC Educational Resources Information Center

Chen, Zheng; Veiga, John F.; Powell, Gary N.

2011-01-01

Although managers and professionals still compete in a career tournament for advancement and pay, the career boundaries that they cross in order to compete have changed. Traditionally, such individuals came up through the ranks within the same company by specializing in one functional area and changing, as needed, the geographic location of work…

In Situ Boundary Layer Coral Metabolism in the Atlantic Ocean Acidification Test Bed

NASA Astrophysics Data System (ADS)

McGillis, Wade

2013-04-01

and Chris Langdon, Brice Loose, Dwight Gledhill, Diana Hsueh, Derek Manzello, Ian Enochs, Ryan Moyer We present net ecosystem productivity (nep) and net ecosystem calcification (nec) in coral and seagrass ecosystems using the boundary layer gradient flux technique (CROSS). Coastal anthropogenic inputs and changes in global ocean chemistry in response to rising levels of atmospheric carbon dioxide has emerged in recent years as a topic of considerable concern. Coral reefs are particularly vulnerable from eroded environmental conditions including ocean acidification and water pollution. The Atlantic Ocean Acidification Testbed (AOAT) project monitors metabolism to ascertain the continuing health of coral reef ecosystems. The CROSS boundary layer nep/nec approach is one component of this diagnostic program. Certification of CROSS as an operational monitoring tool is underway in the AOAT. CROSS inspects a benthic community and measures productivity/respiration and calcification/dissolution over an area of 10 square meters. Being a boundary layer tool, advection and complex mesoscale flows are not a factor or concern and CROSS is autonomous and can be used at deep benthic sites. The interrogation area is not enclosed therefore exposed to ambient light, flow, and nutrient levels. CROSS is easy to deploy, unambiguous, and affordable. Repeated measurements have been made from 2011-2012 in reefal systems in La Parguera Puerto Rico and the Florida Keys, USA. Diurnal, seasonal and regional metabolism will be compared and discussed. The ability to accurately probe benthic ecosystems provides a powerful management and research tool to policy makers and researchers.

Moving charged particles in lattice Boltzmann-based electrokinetics

NASA Astrophysics Data System (ADS)

Kuron, Michael; Rempfer, Georg; Schornbaum, Florian; Bauer, Martin; Godenschwager, Christian; Holm, Christian; de Graaf, Joost

2016-12-01

The motion of ionic solutes and charged particles under the influence of an electric field and the ensuing hydrodynamic flow of the underlying solvent is ubiquitous in aqueous colloidal suspensions. The physics of such systems is described by a coupled set of differential equations, along with boundary conditions, collectively referred to as the electrokinetic equations. Capuani et al. [J. Chem. Phys. 121, 973 (2004)] introduced a lattice-based method for solving this system of equations, which builds upon the lattice Boltzmann algorithm for the simulation of hydrodynamic flow and exploits computational locality. However, thus far, a description of how to incorporate moving boundary conditions into the Capuani scheme has been lacking. Moving boundary conditions are needed to simulate multiple arbitrarily moving colloids. In this paper, we detail how to introduce such a particle coupling scheme, based on an analogue to the moving boundary method for the pure lattice Boltzmann solver. The key ingredients in our method are mass and charge conservation for the solute species and a partial-volume smoothing of the solute fluxes to minimize discretization artifacts. We demonstrate our algorithm's effectiveness by simulating the electrophoresis of charged spheres in an external field; for a single sphere we compare to the equivalent electro-osmotic (co-moving) problem. Our method's efficiency and ease of implementation should prove beneficial to future simulations of the dynamics in a wide range of complex nanoscopic and colloidal systems that were previously inaccessible to lattice-based continuum algorithms.

The asymptotic spectra of banded Toeplitz and quasi-Toeplitz matrices

NASA Technical Reports Server (NTRS)

Beam, Richard M.; Warming, Robert F.

1991-01-01

Toeplitz matrices occur in many mathematical, as well as, scientific and engineering investigations. This paper considers the spectra of banded Toeplitz and quasi-Toeplitz matrices with emphasis on non-normal matrices of arbitrarily large order and relatively small bandwidth. These are the type of matrices that appear in the investigation of stability and convergence of difference approximations to partial differential equations. Quasi-Toeplitz matrices are the result of non-Dirichlet boundary conditions for the difference approximations. The eigenvalue problem for a banded Toeplitz or quasi-Toeplitz matrix of large order is, in general, analytically intractable and (for non-normal matrices) numerically unreliable. An asymptotic (matrix order approaches infinity) approach partitions the eigenvalue analysis of a quasi-Toeplitz matrix into two parts, namely the analysis for the boundary condition independent spectrum and the analysis for the boundary condition dependent spectrum. The boundary condition independent spectrum is the same as the pure Toeplitz matrix spectrum. Algorithms for computing both parts of the spectrum are presented. Examples are used to demonstrate the utility of the algorithms, to present some interesting spectra, and to point out some of the numerical difficulties encountered when conventional matrix eigenvalue routines are employed for non-normal matrices of large order. The analysis for the Toeplitz spectrum also leads to a diagonal similarity transformation that improves conventional numerical eigenvalue computations. Finally, the algorithm for the asymptotic spectrum is extended to the Toeplitz generalized eigenvalue problem which occurs, for example, in the stability of Pade type difference approximations to differential equations.

Bridging a translational gap: using machine learning to improve the prediction of PTSD.

PubMed

Karstoft, Karen-Inge; Galatzer-Levy, Isaac R; Statnikov, Alexander; Li, Zhiguo; Shalev, Arieh Y

2015-03-16

Predicting Posttraumatic Stress Disorder (PTSD) is a pre-requisite for targeted prevention. Current research has identified group-level risk-indicators, many of which (e.g., head trauma, receiving opiates) concern but a subset of survivors. Identifying interchangeable sets of risk indicators may increase the efficiency of early risk assessment. The study goal is to use supervised machine learning (ML) to uncover interchangeable, maximally predictive combinations of early risk indicators. Data variables (features) reflecting event characteristics, emergency department (ED) records and early symptoms were collected in 957 trauma survivors within ten days of ED admission, and used to predict PTSD symptom trajectories during the following fifteen months. A Target Information Equivalence Algorithm (TIE*) identified all minimal sets of features (Markov Boundaries; MBs) that maximized the prediction of a non-remitting PTSD symptom trajectory when integrated in a support vector machine (SVM). The predictive accuracy of each set of predictors was evaluated in a repeated 10-fold cross-validation and expressed as average area under the Receiver Operating Characteristics curve (AUC) for all validation trials. The average number of MBs per cross validation was 800. MBs' mean AUC was 0.75 (95% range: 0.67-0.80). The average number of features per MB was 18 (range: 12-32) with 13 features present in over 75% of the sets. Our findings support the hypothesized existence of multiple and interchangeable sets of risk indicators that equally and exhaustively predict non-remitting PTSD. ML's ability to increase prediction versatility is a promising step towards developing algorithmic, knowledge-based, personalized prediction of post-traumatic psychopathology.

Flow of variably fluidized granular masses across three-dimensional terrain 2. Numerical predictions and experimental tests

USGS Publications Warehouse

Denlinger, R.P.; Iverson, R.M.

2001-01-01

Numerical solutions of the equations describing flow of variably fluidized Coulomb mixtures predict key features of dry granular avalanches and water-saturated debris flows measured in physical experiments. These features include time-dependent speeds, depths, and widths of flows as well as the geometry of resulting deposits. Threedimensional (3-D) boundary surfaces strongly influence flow dynamics because transverse shearing and cross-stream momentum transport occur where topography obstructs or redirects motion. Consequent energy dissipation can cause local deceleration and deposition, even on steep slopes. Velocities of surge fronts and other discontinuities that develop as flows cross 3-D terrain are predicted accurately by using a Riemann solution algorithm. The algorithm employs a gravity wave speed that accounts for different intensities of lateral stress transfer in regions of extending and compressing flow and in regions with different degrees of fluidization. Field observations and experiments indicate that flows in which fluid plays a significant role typically have high-friction margins with weaker interiors partly fluidized by pore pressure. Interaction of the strong perimeter and weak interior produces relatively steep-sided, flat-topped deposits. To simulate these effects, we compute pore pressure distributions using an advection-diffusion model with enhanced diffusivity near flow margins. Although challenges remain in evaluating pore pressure distributions in diverse geophysical flows, Riemann solutions of the depthaveraged 3-D Coulomb mixture equations provide a powerful tool for interpreting and predicting flow behavior. They provide a means of modeling debris flows, rock avalanches, pyroclastic flows, and related phenomena without invoking and calibrating Theological parameters that have questionable physical significance.

Analysis of modal behavior at frequency cross-over

NASA Astrophysics Data System (ADS)

Costa, Robert N., Jr.

1994-11-01

The existence of the mode crossing condition is detected and analyzed in the Active Control of Space Structures Model 4 (ACOSS4). The condition is studied for its contribution to the inability of previous algorithms to successfully optimize the structure and converge to a feasible solution. A new algorithm is developed to detect and correct for mode crossings. The existence of the mode crossing condition is verified in ACOSS4 and found not to have appreciably affected the solution. The structure is then successfully optimized using new analytic methods based on modal expansion. An unrelated error in the optimization algorithm previously used is verified and corrected, thereby equipping the optimization algorithm with a second analytic method for eigenvector differentiation based on Nelson's Method. The second structure is the Control of Flexible Structures (COFS). The COFS structure is successfully reproduced and an initial eigenanalysis completed.

Changes to the COS Extraction Algorithm for Lifetime Position 3

NASA Astrophysics Data System (ADS)

Proffitt, Charles R.; Bostroem, K. Azalee; Ely, Justin; Foster, Deatrick; Hernandez, Svea; Hodge, Philip; Jedrzejewski, Robert I.; Lockwood, Sean A.; Massa, Derck; Peeples, Molly S.; Oliveira, Cristina M.; Penton, Steven V.; Plesha, Rachel; Roman-Duval, Julia; Sana, Hugues; Sahnow, David J.; Sonnentrucker, Paule; Taylor, Joanna M.

2015-09-01

The COS FUV Detector Lifetime Position 3 (LP3) has been placed only 2.5" below the original lifetime position (LP1). This is sufficiently close to gain-sagged regions at LP1 that a revised extraction algorithm is needed to ensure good spectral quality. We provide an overview of this new "TWOZONE" extraction algorithm, discuss its strengths and limitations, describe new output columns in the X1D files that show the boundaries of the new extraction regions, and provide some advice on how to manually tune the algorithm for specialized applications.

Bio-inspired optimization algorithms for optical parameter extraction of dielectric materials: A comparative study

NASA Astrophysics Data System (ADS)

Ghulam Saber, Md; Arif Shahriar, Kh; Ahmed, Ashik; Hasan Sagor, Rakibul

2016-10-01

Particle swarm optimization (PSO) and invasive weed optimization (IWO) algorithms are used for extracting the modeling parameters of materials useful for optics and photonics research community. These two bio-inspired algorithms are used here for the first time in this particular field to the best of our knowledge. The algorithms are used for modeling graphene oxide and the performances of the two are compared. Two objective functions are used for different boundary values. Root mean square (RMS) deviation is determined and compared.

Marine Boundary Layer Cloud Property Retrievals from High-Resolution ASTER Observations: Case Studies and Comparison with Terra MODIS

NASA Technical Reports Server (NTRS)

Werner, Frank; Wind, Galina; Zhang, Zhibo; Platnick, Steven; Di Girolamo, Larry; Zhao, Guangyu; Amarasinghe, Nandana; Meyer, Kerry

2016-01-01

A research-level retrieval algorithm for cloud optical and microphysical properties is developed for the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) aboard the Terra satellite. It is based on the operational MODIS algorithm. This paper documents the technical details of this algorithm and evaluates the retrievals for selected marine boundary layer cloud scenes through comparisons with the operational MODIS Data Collection 6 (C6) cloud product. The newly developed, ASTERspecific cloud masking algorithm is evaluated through comparison with an independent algorithm reported in Zhao and Di Girolamo (2006). To validate and evaluate the cloud optical thickness (tau) and cloud effective radius (r(sub eff)) from ASTER, the high-spatial-resolution ASTER observations are first aggregated to the same 1000m resolution as MODIS. Subsequently, tau(sub aA) and r(sub eff, aA) retrieved from the aggregated ASTER radiances are compared with the collocated MODIS retrievals. For overcast pixels, the two data sets agree very well with Pearson's product-moment correlation coefficients of R greater than 0.970. However, for partially cloudy pixels there are significant differences between r(sub eff, aA) and the MODIS results which can exceed 10 micrometers. Moreover, it is shown that the numerous delicate cloud structures in the example marine boundary layer scenes, resolved by the high-resolution ASTER retrievals, are smoothed by the MODIS observations. The overall good agreement between the research-level ASTER results and the operational MODIS C6 products proves the feasibility of MODIS-like retrievals from ASTER reflectance measurements and provides the basis for future studies concerning the scale dependency of satellite observations and three-dimensional radiative effects.

Marine boundary layer cloud property retrievals from high-resolution ASTER observations: case studies and comparison with Terra MODIS

NASA Astrophysics Data System (ADS)

Werner, Frank; Wind, Galina; Zhang, Zhibo; Platnick, Steven; Di Girolamo, Larry; Zhao, Guangyu; Amarasinghe, Nandana; Meyer, Kerry

2016-12-01

A research-level retrieval algorithm for cloud optical and microphysical properties is developed for the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) aboard the Terra satellite. It is based on the operational MODIS algorithm. This paper documents the technical details of this algorithm and evaluates the retrievals for selected marine boundary layer cloud scenes through comparisons with the operational MODIS Data Collection 6 (C6) cloud product. The newly developed, ASTER-specific cloud masking algorithm is evaluated through comparison with an independent algorithm reported in [Zhao and Di Girolamo(2006)]. To validate and evaluate the cloud optical thickness (τ) and cloud effective radius (reff) from ASTER, the high-spatial-resolution ASTER observations are first aggregated to the same 1000 m resolution as MODIS. Subsequently, τaA and reff, aA retrieved from the aggregated ASTER radiances are compared with the collocated MODIS retrievals. For overcast pixels, the two data sets agree very well with Pearson's product-moment correlation coefficients of R > 0.970. However, for partially cloudy pixels there are significant differences between reff, aA and the MODIS results which can exceed 10 µm. Moreover, it is shown that the numerous delicate cloud structures in the example marine boundary layer scenes, resolved by the high-resolution ASTER retrievals, are smoothed by the MODIS observations. The overall good agreement between the research-level ASTER results and the operational MODIS C6 products proves the feasibility of MODIS-like retrievals from ASTER reflectance measurements and provides the basis for future studies concerning the scale dependency of satellite observations and three-dimensional radiative effects.

Pressure and heating-rate distributions on a corrugated surface in a supersonic turbulent boundary layer

NASA Technical Reports Server (NTRS)

Sawyer, J. W.

1977-01-01

Drag and heating rates on wavy surfaces typical of current corrugated plate designs for thermal protection systems were determined experimentally. Pressure-distribution, heating-rate, and oil-flow tests were conducted in the Langley Unitary Plan wind tunnel at Mach numbers of 2.4 and 4.5 with the corrugated surface exposed to both thick and thin turbulent boundary layers. Tests were conducted with the corrugations at cross-flow angles from 0 deg to 90 deg to the flow. Results show that for cross-flow angles of 30 deg or less, the pressure drag coefficients are less than the local flat-plate skin-friction coefficients and are not significantly affected by Mach number, Reynolds number, or boundary-layer thickness over the ranges investigated. For cross-flow angles greater than 30 deg, the drag coefficients increase significantly with cross-flow angle and moderately with Reynolds number. Increasing the Mach number causes a significant reduction in the pressure drag. The average and peak heating penalties due to the corrugated surface are small for cross-flow angles of 10 deg or less but are significantly higher for the larger cross-flow angles.

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.

Chemical-Specific Representation of Air-Soil Exchange and Soil Penetration in Regional Multimedia Models

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

McKone, T.E.; Bennett, D.H.

2002-08-01

In multimedia mass-balance models, the soil compartment is an important sink as well as a conduit for transfers to vegetation and shallow groundwater. Here a novel approach for constructing soil transport algorithms for multimedia fate models is developed and evaluated. The resulting algorithms account for diffusion in gas and liquid components; advection in gas, liquid, or solid phases; and multiple transformation processes. They also provide an explicit quantification of the characteristic soil penetration depth. We construct a compartment model using three and four soil layers to replicate with high reliability the flux and mass distribution obtained from the exact analyticalmore » solution describing the transient dispersion, advection, and transformation of chemicals in soil with fixed properties and boundary conditions. Unlike the analytical solution, which requires fixed boundary conditions, the soil compartment algorithms can be dynamically linked to other compartments (air, vegetation, ground water, surface water) in multimedia fate models. We demonstrate and evaluate the performance of the algorithms in a model with applications to benzene, benzo(a)pyrene, MTBE, TCDD, and tritium.« less

Comparison of various contact algorithms for poroelastic tissues.

PubMed

Galbusera, Fabio; Bashkuev, Maxim; Wilke, Hans-Joachim; Shirazi-Adl, Aboulfazl; Schmidt, Hendrik

2014-01-01

Capabilities of the commercial finite element package ABAQUS in simulating frictionless contact between two saturated porous structures were evaluated and compared with those of an open source code, FEBio. In ABAQUS, both the default contact implementation and another algorithm based on an iterative approach requiring script programming were considered. Test simulations included a patch test of two cylindrical slabs in a gapless contact and confined compression conditions; a confined compression test of a porous cylindrical slab with a spherical porous indenter; and finally two unconfined compression tests of soft tissues mimicking diarthrodial joints. The patch test showed almost identical results for all algorithms. On the contrary, the confined and unconfined compression tests demonstrated large differences related to distinct physical and boundary conditions considered in each of the three contact algorithms investigated in this study. In general, contact with non-uniform gaps between fluid-filled porous structures could be effectively simulated with either ABAQUS or FEBio. The user should be aware of the parameter definitions, assumptions and limitations in each case, and take into consideration the physics and boundary conditions of the problem of interest when searching for the most appropriate model.

Improving graph-based OCT segmentation for severe pathology in retinitis pigmentosa patients

NASA Astrophysics Data System (ADS)

Lang, Andrew; Carass, Aaron; Bittner, Ava K.; Ying, Howard S.; Prince, Jerry L.

2017-03-01

Three dimensional segmentation of macular optical coherence tomography (OCT) data of subjects with retinitis pigmentosa (RP) is a challenging problem due to the disappearance of the photoreceptor layers, which causes algorithms developed for segmentation of healthy data to perform poorly on RP patients. In this work, we present enhancements to a previously developed graph-based OCT segmentation pipeline to enable processing of RP data. The algorithm segments eight retinal layers in RP data by relaxing constraints on the thickness and smoothness of each layer learned from healthy data. Following from prior work, a random forest classifier is first trained on the RP data to estimate boundary probabilities, which are used by a graph search algorithm to find the optimal set of nine surfaces that fit the data. Due to the intensity disparity between normal layers of healthy controls and layers in various stages of degeneration in RP patients, an additional intensity normalization step is introduced. Leave-one-out validation on data acquired from nine subjects showed an average overall boundary error of 4.22 μm as compared to 6.02 μm using the original algorithm.

New robust algorithm for tracking cells in videos of Drosophila morphogenesis based on finding an ideal path in segmented spatio-temporal cellular structures.

PubMed

Bellaïche, Yohanns; Bosveld, Floris; Graner, François; Mikula, Karol; Remesíková, Mariana; Smísek, Michal

2011-01-01

In this paper, we present a novel algorithm for tracking cells in time lapse confocal microscopy movie of a Drosophila epithelial tissue during pupal morphogenesis. We consider a 2D + time video as a 3D static image, where frames are stacked atop each other, and using a spatio-temporal segmentation algorithm we obtain information about spatio-temporal 3D tubes representing evolutions of cells. The main idea for tracking is the usage of two distance functions--first one from the cells in the initial frame and second one from segmented boundaries. We track the cells backwards in time. The first distance function attracts the subsequently constructed cell trajectories to the cells in the initial frame and the second one forces them to be close to centerlines of the segmented tubular structures. This makes our tracking algorithm robust against noise and missing spatio-temporal boundaries. This approach can be generalized to a 3D + time video analysis, where spatio-temporal tubes are 4D objects.

An interaction algorithm for prediction of mean and fluctuating velocities in two-dimensional aerodynamic wake flows

NASA Technical Reports Server (NTRS)

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

1980-01-01

A theoretical analysis is presented yielding sets of partial differential equations for determination of turbulent aerodynamic flowfields in the vicinity of an airfoil trailing edge. A four phase interaction algorithm is derived to complete the analysis. Following input, the first computational phase is an elementary viscous corrected two dimensional potential flow solution yielding an estimate of the inviscid-flow induced pressure distribution. Phase C involves solution of the turbulent two dimensional boundary layer equations over the trailing edge, with transition to a two dimensional parabolic Navier-Stokes equation system describing the near-wake merging of the upper and lower surface boundary layers. An iteration provides refinement of the potential flow induced pressure coupling to the viscous flow solutions. The final phase is a complete two dimensional Navier-Stokes analysis of the wake flow in the vicinity of a blunt-bases airfoil. A finite element numerical algorithm is presented which is applicable to solution of all partial differential equation sets of inviscid-viscous aerodynamic interaction algorithm. Numerical results are discussed.

An experimental study of the wall-pressure fluctuations beneath low Reynolds number turbulent boundary layers.

PubMed

Van Blitterswyk, Jared; Rocha, Joana

2017-02-01

A more complete understanding of the physical relationships, between wall-pressure and turbulence, is required for modeling flow-induced noise and developing noise reduction strategies. In this study, the wall-pressure fluctuations, induced by low Reynolds number turbulent boundary layers, are experimentally studied using a high-resolution microphone array. Statistical characteristics obtained using traditional cross-correlation and cross-spectra analyses are complimented with wall-pressure-velocity cross-spectra and wavelet cross-correlations. Wall-pressure-velocity correlations revealed that turbulent activity in the buffer layer contributes at least 40% of the energy to the wall-pressure spectrum at all measured frequencies. As Reynolds number increases, the low-frequency energy shifts from the buffer layer to the logarithmic layer, as expected for regions of uniform streamwise momentum formed by hairpin packets. Conditional cross-spectra suggests that the majority of broadband wall-pressure energy is concentrated within the packets, with the pressure signatures of individual hairpin vortices estimated to decay on average within traveling ten displacement thicknesses, and the packet signature is retained for up to seven boundary layer thicknesses on average.

Influence of bulk turbulence and entrance boundary layer thickness on the curved duct flow field

NASA Technical Reports Server (NTRS)

Crawford, R. A.

1988-01-01

The influence of bulk turbulence and boundary layer thickness on the secondary flow development in a square, 90 degree turning duct was investigated. A three-dimensional laser velocimetry system was utilized to measure the mean and fluctuating components of velocity at six cross-planes in the duct. The results from this investigation, with entrance boundary layer thickness of 20 percent, were compared with the thin boundary layer results documented in NASA CR-174811. The axial velocity profiles, cross-flow velocities, and turbulence intensities were compared and evaluated with regard to the influence of bulk turbulence intensity and boundary layer thickness, and the influence was significant. The results of this investigation expand the 90 degree curved duct experimental data base to higher turbulence levels and thicker entrance boundary layers. The experimental results provide a challenging benchmark data base for computational fluid dynamics code development and validation. The variation of inlet bulk turbulence intensity provides additional information to aid in turbulence model evaluation.

Estimation of coefficients and boundary parameters in hyperbolic systems

NASA Technical Reports Server (NTRS)

Banks, H. T.; Murphy, K. A.

1984-01-01

Semi-discrete Galerkin approximation schemes are considered in connection with inverse problems for the estimation of spatially varying coefficients and boundary condition parameters in second order hyperbolic systems typical of those arising in 1-D surface seismic problems. Spline based algorithms are proposed for which theoretical convergence results along with a representative sample of numerical findings are given.

Planetary boundaries for a blue planet.

PubMed

Nash, Kirsty L; Cvitanovic, Christopher; Fulton, Elizabeth A; Halpern, Benjamin S; Milner-Gulland, E J; Watson, Reg A; Blanchard, Julia L

2017-11-01

Concepts underpinning the planetary boundaries framework are being incorporated into multilateral discussions on sustainability, influencing international environmental policy development. Research underlying the boundaries has primarily focused on terrestrial systems, despite the fundamental role of marine biomes for Earth system function and societal wellbeing, seriously hindering the efficacy of the boundary approach. We explore boundaries from a marine perspective. For each boundary, we show how improved integration of marine systems influences our understanding of the risk of crossing these limits. Better integration of marine systems is essential if planetary boundaries are to inform Earth system governance.

Inter-method Performance Study of Tumor Volumetry Assessment on Computed Tomography Test-retest Data

PubMed Central

Buckler, Andrew J.; Danagoulian, Jovanna; Johnson, Kjell; Peskin, Adele; Gavrielides, Marios A.; Petrick, Nicholas; Obuchowski, Nancy A.; Beaumont, Hubert; Hadjiiski, Lubomir; Jarecha, Rudresh; Kuhnigk, Jan-Martin; Mantri, Ninad; McNitt-Gray, Michael; Moltz, Jan Hendrik; Nyiri, Gergely; Peterson, Sam; Tervé, Pierre; Tietjen, Christian; von Lavante, Etienne; Ma, Xiaonan; Pierre, Samantha St.; Athelogou, Maria

2015-01-01

Rationale and objectives Tumor volume change has potential as a biomarker for diagnosis, therapy planning, and treatment response. Precision was evaluated and compared among semi-automated lung tumor volume measurement algorithms from clinical thoracic CT datasets. The results inform approaches and testing requirements for establishing conformance with the Quantitative Imaging Biomarker Alliance (QIBA) CT Volumetry Profile. Materials and Methods Industry and academic groups participated in a challenge study. Intra-algorithm repeatability and inter-algorithm reproducibility were estimated. Relative magnitudes of various sources of variability were estimated using a linear mixed effects model. Segmentation boundaries were compared to provide a basis on which to optimize algorithm performance for developers. Results Intra-algorithm repeatability ranged from 13% (best performing) to 100% (least performing), with most algorithms demonstrating improved repeatability as the tumor size increased. Inter-algorithm reproducibility determined in three partitions and found to be 58% for the four best performing groups, 70% for the set of groups meeting repeatability requirements, and 84% when all groups but the least performer were included. The best performing partition performed markedly better on tumors with equivalent diameters above 40 mm. Larger tumors benefitted by human editing but smaller tumors did not. One-fifth to one-half of the total variability came from sources independent of the algorithms. Segmentation boundaries differed substantially, not just in overall volume but in detail. Conclusions Nine of the twelve participating algorithms pass precision requirements similar to what is indicated in the QIBA Profile, with the caveat that the current study was not designed to explicitly evaluate algorithm Profile conformance. Change in tumor volume can be measured with confidence to within ±14% using any of these nine algorithms on tumor sizes above 10 mm. No partition of the algorithms were able to meet the QIBA requirements for interchangeability down to 10 mm, though the partition comprised of the best performing algorithms did meet this requirement above a tumor size of approximately 40 mm. PMID:26376841

Cross-flow vortex structure and transition measurements using multi-element hot films

NASA Technical Reports Server (NTRS)

Agarwal, Naval K.; Mangalam, Siva M.; Maddalon, Dal V.; Collier, Fayette S., Jr.

1991-01-01

An experiment on a 45-degree swept wing was conducted to study three-dimensional boundary-layer characteristics using surface-mounted, micro-thin, multi-element hot-film sensors. Cross-flow vortex structure and boundary-layer transition were measured from the simultaneously acquired signals of the hot films. Spanwise variation of the root-mean-square (RMS) hot-film signal show a local minima and maxima. The distance between two minima corresponds to the stationary cross-flow vortex wavelength and agrees with naphthalene flow-visualization results. The chordwise and spanwise variation of amplified traveling (nonstationary) cross-flow disturbance characteristics were measured as Reynolds number was varied. The frequency of the most amplified cross-flow disturbances agrees with linear stability theory.

The liquid fuel jet in subsonic crossflow

NASA Technical Reports Server (NTRS)

Nguyen, T. T.; Karagozian, A. R.

1990-01-01

An analytical/numerical model is described which predicts the behavior of nonreacting and reacting liquid jets injected transversely into subsonic cross flow. The compressible flowfield about the elliptical jet cross section is solved at various locations along the jet trajectory by analytical means for free-stream local Mach number perpendicular to jet cross section smaller than 0.3 and by numerical means for free-stream local Mach number perpendicular to jet cross section in the range 0.3-1.0. External and internal boundary layers along the jet cross section are solved by integral and numerical methods, and the mass losses due to boundary layer shedding, evaporation, and combustion are calculated and incorporated into the trajectory calculation. Comparison of predicted trajectories is made with limited experimental observations.

A single spacecraft method to study the spatial profiles inside the magnetopause

NASA Astrophysics Data System (ADS)

Dorville, Nicolas; Belmont, Gerard; Rezeau, Laurence; Aunai, Nicolas; Retino, Alessandro

2013-04-01

Previous magnetopause observations have revealed that the tangential magnetic field often rotates over C-shaped hodograms during the boundary crossing. Using observations of magnetopause crossings by the ESA Cluster mission and a simulation developed at LPP by Nicolas Aunai, we developed a single spacecraft method using the temporal information on the magnetic field in such crossings, complemented by the ion data. We can so obtain a 1D spatial parameter to characterize the depth in the layer and study the structure of the magnetopause as a function of this parameter. This allows using one single spacecraft magnetic data, completed by ion data at large temporal scales, to study the spatial structure of the boundary, and access scales that the particle temporal measurements of the four spacecraft do not permit. To obtain the normal direction and position, we first initialize our computations thanks to the standard MVABC method. Then we use the magnetic field data in the current layer, and suppose it is 1D, rotating in the tangential plane along an ellipse, with an angle variation essentially linear in space, with small sinusoidal perturbations. Making the assumption that the normal velocity of ions is dominated by the motion of the boundary and that the internal structure of the magnetopause is stationary over the duration of a crossing, we can compute the best normal direction and parameters of the model with CIS velocity and FGM magnetic field data, and so derive the spatial position of the spacecraft in the boundary. This method, which has been tested on the simulation data, could be applied successfully on several magnetopause crossings observed by Cluster. It directly gives a thickness and a normal direction, and permits to establish spatial profiles of all the physical quantities inside the boundary. It can be used to better understand the internal structure of the boundary, its physical properties and behavior regarding the flux conservation equations. The obtained results are compared with the results of other methods.

Grid adaption based on modified anisotropic diffusion equations formulated in the parametic domain

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

Hagmeijer, R.

1994-11-01

A new grid-adaption algorithm for problems in computational fluid dynamics is presented. The basic equations are derived from a variational problem formulated in the parametric domain of the mapping that defines the existing grid. Modification of the basic equations provides desirable properties in boundary layers. The resulting modified anisotropic diffusion equations are solved for the computational coordinates as functions of the parametric coordinates and these functions are numerically inverted. Numerical examples show that the algorithm is robust, that shocks and boundary layers are well-resolved on the adapted grid, and that the flow solution becomes a globally smooth function of themore » computational coordinates.« less

Phi-s correlation and dynamic time warping - Two methods for tracking ice floes in SAR images

NASA Technical Reports Server (NTRS)

Mcconnell, Ross; Kober, Wolfgang; Kwok, Ronald; Curlander, John C.; Pang, Shirley S.

1991-01-01

The authors present two algorithms for performing shape matching on ice floe boundaries in SAR (synthetic aperture radar) images. These algorithms quickly produce a set of ice motion and rotation vectors that can be used to guide a pixel value correlator. The algorithms match a shape descriptor known as the Phi-s curve. The first algorithm uses normalized correlation to match the Phi-s curves, while the second uses dynamic programming to compute an elastic match that better accommodates ice floe deformation. Some empirical data on the performance of the algorithms on Seasat SAR images are presented.

Algorithms for Zonal Methods and Development of Three Dimensional Mesh Generation Procedures.

DTIC Science & Technology

1984-02-01

a r-re complete set of equations is used, but their effect is imposed by means of a right hand side forcing function, not by means of a zonal boundary...modifications of flow-simulation algorithms The explicit finite-difference code of Magnus and are discussed. Computational tests in two dimensions...used to simplify the task of grid generation without an adverse achieve computational efficiency. More recently, effect on flow-field algorithms and

A new image enhancement algorithm with applications to forestry stand mapping

NASA Technical Reports Server (NTRS)

Kan, E. P. F. (Principal Investigator); Lo, J. K.

1975-01-01

The author has identified the following significant results. Results show that the new algorithm produced cleaner classification maps in which holes of small predesignated sizes were eliminated and significant boundary information was preserved. These cleaner post-processed maps better resemble true life timber stand maps and are thus more usable products than the pre-post-processing ones: Compared to an accepted neighbor-checking post-processing technique, the new algorithm is more appropriate for timber stand mapping.

Impact and management of dual relationships in metropolitan, regional and rural mental health practice.

PubMed

Endacott, Ruth; Wood, Anita; Judd, Fiona; Hulbert, Carol; Thomas, Ben; Grigg, Margaret

2006-01-01

To explore the extent and impact of professional boundary crossings in metropolitan, regional and rural mental health practice in Victoria and identify strategies mental health clinicians use to manage dual relationships. Nine geographically located focus groups consisting of mental health clinicians: four focus groups in rural settings; three in a regional city and two in a metropolitan mental health service. A total of 52 participants were interviewed. Data revealed that professional boundaries were frequently breached in regional and rural settings and on occasions these breaches had a significantly negative impact. Factors influencing the impact were: longevity of the clinician's relationship with the community, expectations of the community, exposure to community 'gossip' and size of the community. Participants reported greater stress when the boundary crossing affected their partner and/or children. Clinicians used a range of proactive and reactive strategies, such as private telephone number, avoidance of social community activities, when faced with a potential boundary crossing. The feasibility of reactive strategies depended on the service configuration: availability of an alternative case manager, requirement for either patient or clinician to travel. The greater challenges faced by rural and regional clinicians were validated by metropolitan participants with rural experience and rural participants with metropolitan experience. No single strategy is used or appropriate for managing dual relationships in rural settings. Employers and professional bodies should provide clearer guidance for clinicians both in the management of dual relationships and the distinction between boundary crossings and boundary violation. Clinicians are clearly seeking to represent and protect the patients' interests; consideration should be given by consumer groups to steps that can be taken by patients to reciprocate.

The suppression effect of a periodic surface with semicircular grooves on the high power microwave long pill-box window multipactor phenomenon

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

Zhang, Xue, E-mail: zhangxue.iecas@yahoo.com; Wang, Yong; Fan, Junjie

2014-09-15

To improve the transmitting power in an S-band klystron, a long pill-box window that has a disk with grooves with a semicircular cross section is theoretically investigated and simulated. A Monte-Carlo algorithm is used to track the secondary electron trajectories and analyze the multipactor scenario in the long pill-box window and on the grooved surface. Extending the height of the long-box window can decrease the normal electric field on the surface of the window disk, but the single surface multipactor still exists. It is confirmed that the window disk with periodic semicircular grooves can explicitly suppress the multipactor and predominantlymore » depresses the local field enhancement and the bottom continuous multipactor. The difference between semicircular and sharp boundary grooves is clarified numerically and analytically.« less

RETRACTED: Theoretical study of electronic properties and isotope effects in the UV absorption spectrum of disulfur

NASA Astrophysics Data System (ADS)

Sarka, Karolis; Danielache, Sebastian O.; Kondorskiy, Alexey; Nanbu, Shinkoh

2017-05-01

This article has been retracted: please see Elsevier Policy on Article Withdrawal (http://www.elsevier.com/locate/withdrawalpolicy) This article has been retracted at the request of the Authors because of a large amount of errors caused by incorrect interpretation of the potential energy curve boundaries by the data processing functions in their close-coupling algorithm, producing incorrect wavefunctions for the continuum region in the absorption spectrum. The spectrum calculated using the incorrect wavefunctions introduced periodic fluctuation in the absorption cross-section seen in the original article, which results in erroneous isotopic fractionation values. The updated spectra calculated after fixing the issues features a smooth continuum band, removing all false artifacts from isotopic effect analysis, producing significantly different results from the ones in this original article. The authors will submit the corrected data in a new article.

Adiabatic Quantum Search in Open Systems.

PubMed

Wild, Dominik S; Gopalakrishnan, Sarang; Knap, Michael; Yao, Norman Y; Lukin, Mikhail D

2016-10-07

Adiabatic quantum algorithms represent a promising approach to universal quantum computation. In isolated systems, a key limitation to such algorithms is the presence of avoided level crossings, where gaps become extremely small. In open quantum systems, the fundamental robustness of adiabatic algorithms remains unresolved. Here, we study the dynamics near an avoided level crossing associated with the adiabatic quantum search algorithm, when the system is coupled to a generic environment. At zero temperature, we find that the algorithm remains scalable provided the noise spectral density of the environment decays sufficiently fast at low frequencies. By contrast, higher order scattering processes render the algorithm inefficient at any finite temperature regardless of the spectral density, implying that no quantum speedup can be achieved. Extensions and implications for other adiabatic quantum algorithms will be discussed.

Accurate and robust brain image alignment using boundary-based registration.

PubMed

Greve, Douglas N; Fischl, Bruce

2009-10-15

The fine spatial scales of the structures in the human brain represent an enormous challenge to the successful integration of information from different images for both within- and between-subject analysis. While many algorithms to register image pairs from the same subject exist, visual inspection shows that their accuracy and robustness to be suspect, particularly when there are strong intensity gradients and/or only part of the brain is imaged. This paper introduces a new algorithm called Boundary-Based Registration, or BBR. The novelty of BBR is that it treats the two images very differently. The reference image must be of sufficient resolution and quality to extract surfaces that separate tissue types. The input image is then aligned to the reference by maximizing the intensity gradient across tissue boundaries. Several lower quality images can be aligned through their alignment with the reference. Visual inspection and fMRI results show that BBR is more accurate than correlation ratio or normalized mutual information and is considerably more robust to even strong intensity inhomogeneities. BBR also excels at aligning partial-brain images to whole-brain images, a domain in which existing registration algorithms frequently fail. Even in the limit of registering a single slice, we show the BBR results to be robust and accurate.

Reconstruction of in-plane strain maps using hybrid dense sensor network composed of sensing skin

NASA Astrophysics Data System (ADS)

Downey, Austin; Laflamme, Simon; Ubertini, Filippo

2016-12-01

The authors have recently developed a soft-elastomeric capacitive (SEC)-based thin film sensor for monitoring strain on mesosurfaces. Arranged in a network configuration, the sensing system is analogous to a biological skin, where local strain can be monitored over a global area. Under plane stress conditions, the sensor output contains the additive measurement of the two principal strain components over the monitored surface. In applications where the evaluation of strain maps is useful, in structural health monitoring for instance, such signal must be decomposed into linear strain components along orthogonal directions. Previous work has led to an algorithm that enabled such decomposition by leveraging a dense sensor network configuration with the addition of assumed boundary conditions. Here, we significantly improve the algorithm’s accuracy by leveraging mature off-the-shelf solutions to create a hybrid dense sensor network (HDSN) to improve on the boundary condition assumptions. The system’s boundary conditions are enforced using unidirectional RSGs and assumed virtual sensors. Results from an extensive experimental investigation demonstrate the good performance of the proposed algorithm and its robustness with respect to sensors’ layout. Overall, the proposed algorithm is seen to effectively leverage the advantages of a hybrid dense network for application of the thin film sensor to reconstruct surface strain fields over large surfaces.

Improving a maximum horizontal gradient algorithm to determine geological body boundaries and fault systems based on gravity data

NASA Astrophysics Data System (ADS)

Van Kha, Tran; Van Vuong, Hoang; Thanh, Do Duc; Hung, Duong Quoc; Anh, Le Duc

2018-05-01

The maximum horizontal gradient method was first proposed by Blakely and Simpson (1986) for determining the boundaries between geological bodies with different densities. The method involves the comparison of a center point with its eight nearest neighbors in four directions within each 3 × 3 calculation grid. The horizontal location and magnitude of the maximum values are found by interpolating a second-order polynomial through the trio of points provided that the magnitude of the middle point is greater than its two nearest neighbors in one direction. In theoretical models of multiple sources, however, the above condition does not allow the maximum horizontal locations to be fully located, and it could be difficult to correlate the edges of complicated sources. In this paper, the authors propose an additional condition to identify more maximum horizontal locations within the calculation grid. This additional condition will improve the method algorithm for interpreting the boundaries of magnetic and/or gravity sources. The improved algorithm was tested on gravity models and applied to gravity data for the Phu Khanh basin on the continental shelf of the East Vietnam Sea. The results show that the additional locations of the maximum horizontal gradient could be helpful for connecting the edges of complicated source bodies.

CrossLink: a novel method for cross-condition classification of cancer subtypes.

PubMed

Ma, Chifeng; Sastry, Konduru S; Flore, Mario; Gehani, Salah; Al-Bozom, Issam; Feng, Yusheng; Serpedin, Erchin; Chouchane, Lotfi; Chen, Yidong; Huang, Yufei

2016-08-22

We considered the prediction of cancer classes (e.g. subtypes) using patient gene expression profiles that contain both systematic and condition-specific biases when compared with the training reference dataset. The conventional normalization-based approaches cannot guarantee that the gene signatures in the reference and prediction datasets always have the same distribution for all different conditions as the class-specific gene signatures change with the condition. Therefore, the trained classifier would work well under one condition but not under another. To address the problem of current normalization approaches, we propose a novel algorithm called CrossLink (CL). CL recognizes that there is no universal, condition-independent normalization mapping of signatures. In contrast, it exploits the fact that the signature is unique to its associated class under any condition and thus employs an unsupervised clustering algorithm to discover this unique signature. We assessed the performance of CL for cross-condition predictions of PAM50 subtypes of breast cancer by using a simulated dataset modeled after TCGA BRCA tumor samples with a cross-validation scheme, and datasets with known and unknown PAM50 classification. CL achieved prediction accuracy >73 %, highest among other methods we evaluated. We also applied the algorithm to a set of breast cancer tumors derived from Arabic population to assign a PAM50 classification to each tumor based on their gene expression profiles. A novel algorithm CrossLink for cross-condition prediction of cancer classes was proposed. In all test datasets, CL showed robust and consistent improvement in prediction performance over other state-of-the-art normalization and classification algorithms.

A novel fast phase correlation algorithm for peak wavelength detection of Fiber Bragg Grating sensors.

PubMed

Lamberti, A; Vanlanduit, S; De Pauw, B; Berghmans, F

2014-03-24

Fiber Bragg Gratings (FBGs) can be used as sensors for strain, temperature and pressure measurements. For this purpose, the ability to determine the Bragg peak wavelength with adequate wavelength resolution and accuracy is essential. However, conventional peak detection techniques, such as the maximum detection algorithm, can yield inaccurate and imprecise results, especially when the Signal to Noise Ratio (SNR) and the wavelength resolution are poor. Other techniques, such as the cross-correlation demodulation algorithm are more precise and accurate but require a considerable higher computational effort. To overcome these problems, we developed a novel fast phase correlation (FPC) peak detection algorithm, which computes the wavelength shift in the reflected spectrum of a FBG sensor. This paper analyzes the performance of the FPC algorithm for different values of the SNR and wavelength resolution. Using simulations and experiments, we compared the FPC with the maximum detection and cross-correlation algorithms. The FPC method demonstrated a detection precision and accuracy comparable with those of cross-correlation demodulation and considerably higher than those obtained with the maximum detection technique. Additionally, FPC showed to be about 50 times faster than the cross-correlation. It is therefore a promising tool for future implementation in real-time systems or in embedded hardware intended for FBG sensor interrogation.

THE CONSEQUENCES OF CROSSING BARRIERS AND BOUNDARIES

EPA Science Inventory

This is a brief, general ecological theory presentation which explains concepts of physically defining habitational zones, ecological barriers, ecological boundaries and vehicles, plus biologically defining pathogens, hosts, and vectors.

Efficient Simultaneous Reconstruction of Time-Varying Images and Electrode Contact Impedances in Electrical Impedance Tomography.

PubMed

Boverman, Gregory; Isaacson, David; Newell, Jonathan C; Saulnier, Gary J; Kao, Tzu-Jen; Amm, Bruce C; Wang, Xin; Davenport, David M; Chong, David H; Sahni, Rakesh; Ashe, Jeffrey M

2017-04-01

In electrical impedance tomography (EIT), we apply patterns of currents on a set of electrodes at the external boundary of an object, measure the resulting potentials at the electrodes, and, given the aggregate dataset, reconstruct the complex conductivity and permittivity within the object. It is possible to maximize sensitivity to internal conductivity changes by simultaneously applying currents and measuring potentials on all electrodes but this approach also maximizes sensitivity to changes in impedance at the interface. We have, therefore, developed algorithms to assess contact impedance changes at the interface as well as to efficiently and simultaneously reconstruct internal conductivity/permittivity changes within the body. We use simple linear algebraic manipulations, the generalized singular value decomposition, and a dual-mesh finite-element-based framework to reconstruct images in real time. We are also able to efficiently compute the linearized reconstruction for a wide range of regularization parameters and to compute both the generalized cross-validation parameter as well as the L-curve, objective approaches to determining the optimal regularization parameter, in a similarly efficient manner. Results are shown using data from a normal subject and from a clinical intensive care unit patient, both acquired with the GE GENESIS prototype EIT system, demonstrating significantly reduced boundary artifacts due to electrode drift and motion artifact.

Modification of Classical SPM for Slightly Rough Surface Scattering with Low Grazing Angle Incidence

NASA Astrophysics Data System (ADS)

Guo, Li-Xin; Wei, Guo-Hui; Kim, Cheyoung; Wu, Zhen-Sen

2005-11-01

Based on the impedance/admittance rough boundaries, the reflection coefficients and the scattering cross section with low grazing angle incidence are obtained for both VV and HH polarizations. The error of the classical perturbation method at grazing angle is overcome for the vertical polarization at a rough Neumann boundary of infinite extent. The derivation of the formulae and the numerical results show that the backscattering cross section depends on the grazing angle to the fourth power for both Neumann and Dirichlet boundary conditions with low grazing angle incidence. Our results can reduce to that of the classical small perturbation method by neglecting the Neumann and Dirichlet boundary conditions. The project supported by National Natural Science Foundation of China under Grant No. 60101001 and the National Defense Foundation of China

Towards real-time flood forecasting in hydraulics: merits of in situ discharge and water level data assimilation for the modeling of the Marne catchment in France

NASA Astrophysics Data System (ADS)

Ricci, S. M.; Habert, J.; Le Pape, E.; Piacentini, A.; Jonville, G.; Thual, O.; Zaoui, F.

2011-12-01

The present study describes the assimilation of river flow and water level observations and the resulting improvement in flood forecasting. The Kalman Filter algorithm was built on top of the one-dimensional hydraulic model, MASCARET, [1] which describes the Saint-Venant equations. The assimilation algorithm folds in two steps: the first one was based on the assumption that the upstream flow can be adjusted using a three-parameter correction; the second one consisted of directly correcting the hydraulic state. This procedure was previously applied on the Adour Maritime Catchment using water level observations [2]. On average, it was shown that the data assimilation procedure enables an improvement of 80% in the simulated water level over the reanalysis period, 60 % in the forecast water level at a one-hour lead time, and 25% at a twelve-hour lead time. The procedure was then applied on the Marne Catchment, which includes karstic tributaries, located East of the Paris basin, characterized by long flooding periods and strong sensitivity to local precipitations. The objective was to geographically extend and improve the existing model used by the flood forecasting service located in Chalons-en-Champagne. A hydrological study first enabled the specification of boundary conditions (upstream flow or lateral inflow), then the hydraulic model was calibrated using in situ discharge data (adjustment of Strickler coefficients or cross sectional geometry). The assimilation of water level data enabled the reduction of the uncertainty in the hydrological boundary conditions and led to significant improvement of the simulated water level in re-analysis and forecast modes. Still, because of errors in the Strickler coefficients or cross section geometry, the improvement of the simulated water level sometimes resulted in a degradation of discharge values. This problem was overcome by controlling the correction of the hydrological boundary conditions by directly assimilating discharge observations rather than water level observations. As this approach leads to a satisfying simulation of flood events in the Marne catchment in re-analysis and forecast mode, ongoing work aims at controlling Strickler coefficients through data assimilation procedures in order to simultaneously improve the water level and discharge state. [1] N. Goutal, F. Maurel: A finite volume solver for 1D shallow water equations applied to an actual river, Int. J. Numer. Meth. Fluids, 38(2), 1--19, 2002. [2] S. Ricci, A. Piacentini, O. Thual, E. Le Pape, G. Jonville, 2011: Correction of upstream flow and hydraulic state with data assimilation on the context of flood forecasting. Submitted to Hydrol. Earth Syst. Sci, In review.

Investigation on wide-band scattering of a 2-D target above 1-D randomly rough surface by FDTD method.

PubMed

Li, Juan; Guo, Li-Xin; Jiao, Yong-Chang; Li, Ke

2011-01-17

Finite-difference time-domain (FDTD) algorithm with a pulse wave excitation is used to investigate the wide-band composite scattering from a two-dimensional(2-D) infinitely long target with arbitrary cross section located above a one-dimensional(1-D) randomly rough surface. The FDTD calculation is performed with a pulse wave incidence, and the 2-D representative time-domain scattered field in the far zone is obtained directly by extrapolating the currently calculated data on the output boundary. Then the 2-D wide-band scattering result is acquired by transforming the representative time-domain field to the frequency domain with a Fourier transform. Taking the composite scattering of an infinitely long cylinder above rough surface as an example, the wide-band response in the far zone by FDTD with the pulsed excitation is computed and it shows a good agreement with the numerical result by FDTD with the sinusoidal illumination. Finally, the normalized radar cross section (NRCS) from a 2-D target above 1-D rough surface versus the incident frequency, and the representative scattered fields in the far zone versus the time are analyzed in detail.

Absorbing Boundary Conditions For Optical Pulses In Dispersive, Nonlinear Materials

NASA Technical Reports Server (NTRS)

Goorjian, Peter M.; Kwak, Dochan (Technical Monitor)

1995-01-01

This paper will present results in computational nonlinear optics. An algorithm will be described that provides absorbing boundary conditions for optical pulses in dispersive, nonlinear materials. A new numerical absorber at the boundaries has been developed that is responsive to the spectral content of the pulse. Also, results will be shown of calculations of 2-D electromagnetic nonlinear waves computed by directly integrating in time the nonlinear vector Maxwell's equations. The results will include simulations of "light bullet" like pulses. Here diffraction and dispersion will be counteracted by nonlinear effects. Comparisons will be shown of calculations that use the standard boundary conditions and the new ones.

Automatic detection of artifacts in converted S3D video

NASA Astrophysics Data System (ADS)

Bokov, Alexander; Vatolin, Dmitriy; Zachesov, Anton; Belous, Alexander; Erofeev, Mikhail

2014-03-01

In this paper we present algorithms for automatically detecting issues specific to converted S3D content. When a depth-image-based rendering approach produces a stereoscopic image, the quality of the result depends on both the depth maps and the warping algorithms. The most common problem with converted S3D video is edge-sharpness mismatch. This artifact may appear owing to depth-map blurriness at semitransparent edges: after warping, the object boundary becomes sharper in one view and blurrier in the other, yielding binocular rivalry. To detect this problem we estimate the disparity map, extract boundaries with noticeable differences, and analyze edge-sharpness correspondence between views. We pay additional attention to cases involving a complex background and large occlusions. Another problem is detection of scenes that lack depth volume: we present algorithms for detecting at scenes and scenes with at foreground objects. To identify these problems we analyze the features of the RGB image as well as uniform areas in the depth map. Testing of our algorithms involved examining 10 Blu-ray 3D releases with converted S3D content, including Clash of the Titans, The Avengers, and The Chronicles of Narnia: The Voyage of the Dawn Treader. The algorithms we present enable improved automatic quality assessment during the production stage.

Optic cup segmentation: type-II fuzzy thresholding approach and blood vessel extraction

PubMed Central

Almazroa, Ahmed; Alodhayb, Sami; Raahemifar, Kaamran; Lakshminarayanan, Vasudevan

2017-01-01

We introduce here a new technique for segmenting optic cup using two-dimensional fundus images. Cup segmentation is the most challenging part of image processing of the optic nerve head due to the complexity of its structure. Using the blood vessels to segment the cup is important. Here, we report on blood vessel extraction using first a top-hat transform and Otsu’s segmentation function to detect the curves in the blood vessels (kinks) which indicate the cup boundary. This was followed by an interval type-II fuzzy entropy procedure. Finally, the Hough transform was applied to approximate the cup boundary. The algorithm was evaluated on 550 fundus images from a large dataset, which contained three different sets of images, where the cup was manually marked by six ophthalmologists. On one side, the accuracy of the algorithm was tested on the three image sets independently. The final cup detection accuracy in terms of area and centroid was calculated to be 78.2% of 441 images. Finally, we compared the algorithm performance with manual markings done by the six ophthalmologists. The agreement was determined between the ophthalmologists as well as the algorithm. The best agreement was between ophthalmologists one, two and five in 398 of 550 images, while the algorithm agreed with them in 356 images. PMID:28515636

Optic cup segmentation: type-II fuzzy thresholding approach and blood vessel extraction.

PubMed

Almazroa, Ahmed; Alodhayb, Sami; Raahemifar, Kaamran; Lakshminarayanan, Vasudevan

2017-01-01

We introduce here a new technique for segmenting optic cup using two-dimensional fundus images. Cup segmentation is the most challenging part of image processing of the optic nerve head due to the complexity of its structure. Using the blood vessels to segment the cup is important. Here, we report on blood vessel extraction using first a top-hat transform and Otsu's segmentation function to detect the curves in the blood vessels (kinks) which indicate the cup boundary. This was followed by an interval type-II fuzzy entropy procedure. Finally, the Hough transform was applied to approximate the cup boundary. The algorithm was evaluated on 550 fundus images from a large dataset, which contained three different sets of images, where the cup was manually marked by six ophthalmologists. On one side, the accuracy of the algorithm was tested on the three image sets independently. The final cup detection accuracy in terms of area and centroid was calculated to be 78.2% of 441 images. Finally, we compared the algorithm performance with manual markings done by the six ophthalmologists. The agreement was determined between the ophthalmologists as well as the algorithm. The best agreement was between ophthalmologists one, two and five in 398 of 550 images, while the algorithm agreed with them in 356 images.

Quantum search algorithms on a regular lattice

NASA Astrophysics Data System (ADS)

Hein, Birgit; Tanner, Gregor

2010-07-01

Quantum algorithms for searching for one or more marked items on a d-dimensional lattice provide an extension of Grover’s search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

Extreme values and the level-crossing problem: An application to the Feller process

NASA Astrophysics Data System (ADS)

Masoliver, Jaume

2014-04-01

We review the question of the extreme values attained by a random process. We relate it to level crossings to one boundary (first-passage problems) as well as to two boundaries (escape problems). The extremes studied are the maximum, the minimum, the maximum absolute value, and the range or span. We specialize in diffusion processes and present detailed results for the Wiener and Feller processes.

Flood boundaries and water-surface profile for the computed 100-year flood, Swift Creek at Afton, Wyoming, 1986

USGS Publications Warehouse

Rankl, James G.; Wallace, Joe C.

1989-01-01

Flood flows on Swift Creek near Afton, Wyoming, were analyzed. Peak discharge with an average recurrence interval of 100 years was computed and used to determine the flood boundaries and water surface profile in the study reach. The study was done in cooperation with Lincoln County and the Town of Afton to determine the extent of flooding in the Town of Afton from a 100-year flood on Swift Creek. The reach of Swift Creek considered in the analysis extends upstream from the culvert at Allred County Road No. 12-135 to the US Geological Survey streamflow-gaging station located in the Bridger National Forest , a distance of 3.2 miles. Boundaries of the 100-year flood are delineated on a map using the computed elevation of the flood at each cross section, survey data, and a 1983 aerial photograph. The computed water surface elevation for the 100-year flood was plotted at each cross section, then the lateral extent of the flood was transferred to the flood map. Boundaries between cross sections were sketched using information taken from the aerial photograph. Areas that are inundated, but not part of the active flow, are designated on the cross sections. (Lantz-PTT)

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

Hewett, D.W.; Yu-Jiuan Chen

The authors describe how they hold onto orthogonal mesh discretization when dealing with curved boundaries. Special difference operators were constructed to approximate numerical zones split by the domain boundary; the operators are particularly simple for this rectangular mesh. The authors demonstrated that this simple numerical approach, termed Dynamic Alternating Direction Implicit, turned out to be considerably more efficient than more complex grid-adaptive algorithms that were tried previously.

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.

A fast forward algorithm for real-time geosteering of azimuthal gamma-ray logging.

PubMed

Qin, Zhen; Pan, Heping; Wang, Zhonghao; Wang, Bintao; Huang, Ke; Liu, Shaohua; Li, Gang; Amara Konaté, Ahmed; Fang, Sinan

2017-05-01

Geosteering is an effective method to increase the reservoir drilling rate in horizontal wells. Based on the features of an azimuthal gamma-ray logging tool and strata spatial location, a fast forward calculation method of azimuthal gamma-ray logging is deduced by using the natural gamma ray distribution equation in formation. The response characteristics of azimuthal gamma-ray logging while drilling in the layered formation models with different thickness and position are simulated and summarized by using the method. The result indicates that the method calculates quickly, and when the tool nears a boundary, the method can be used to identify the boundary and determine the distance from the logging tool to the boundary in time. Additionally, the formation parameters of the algorithm in the field can be determined after a simple method is proposed based on the information of an offset well. Therefore, the forward method can be used for geosteering in the field. A field example validates that the forward method can be used to determine the distance from the azimuthal gamma-ray logging tool to the boundary for geosteering in real-time. Copyright © 2017 Elsevier Ltd. All rights reserved.

Tracking boundary movement and exterior shape modelling in lung EIT imaging.

PubMed

Biguri, A; Grychtol, B; Adler, A; Soleimani, M

2015-06-01

Electrical impedance tomography (EIT) has shown significant promise for lung imaging. One key challenge for EIT in this application is the movement of electrodes during breathing, which introduces artefacts in reconstructed images. Various approaches have been proposed to compensate for electrode movement, but no comparison of these approaches is available. This paper analyses boundary model mismatch and electrode movement in lung EIT. The aim is to evaluate the extent to which various algorithms tolerate movement, and to determine if a patient specific model is required for EIT lung imaging. Movement data are simulated from a CT-based model, and image analysis is performed using quantitative figures of merit. The electrode movement is modelled based on expected values of chest movement and an extended Jacobian method is proposed to make use of exterior boundary tracking. Results show that a dynamical boundary tracking is the most robust method against any movement, but is computationally more expensive. Simultaneous electrode movement and conductivity reconstruction algorithms show increased robustness compared to only conductivity reconstruction. The results of this comparative study can help develop a better understanding of the impact of shape model mismatch and electrode movement in lung EIT.

Estimation of Blood Flow Rates in Large Microvascular Networks

PubMed Central

Fry, Brendan C.; Lee, Jack; Smith, Nicolas P.; Secomb, Timothy W.

2012-01-01

Objective Recent methods for imaging microvascular structures provide geometrical data on networks containing thousands of segments. Prediction of functional properties, such as solute transport, requires information on blood flow rates also, but experimental measurement of many individual flows is difficult. Here, a method is presented for estimating flow rates in a microvascular network based on incomplete information on the flows in the boundary segments that feed and drain the network. Methods With incomplete boundary data, the equations governing blood flow form an underdetermined linear system. An algorithm was developed that uses independent information about the distribution of wall shear stresses and pressures in microvessels to resolve this indeterminacy, by minimizing the deviation of pressures and wall shear stresses from target values. Results The algorithm was tested using previously obtained experimental flow data from four microvascular networks in the rat mesentery. With two or three prescribed boundary conditions, predicted flows showed relatively small errors in most segments and fewer than 10% incorrect flow directions on average. Conclusions The proposed method can be used to estimate flow rates in microvascular networks, based on incomplete boundary data and provides a basis for deducing functional properties of microvessel networks. PMID:22506980

Imaging with cross-hole seismoelectric tomography

USGS Publications Warehouse

Araji, A.H.; Revil, A.; Jardani, A.; Minsley, Burke J.; Karaoulis, M.

2012-01-01

We propose a cross-hole imaging approach based on seismoelectric conversions (SC) associated with the transmission of seismic waves from seismic sources located in a borehole to receivers (electrodes) located in a second borehole. The seismoelectric (seismic-to-electric) problem is solved using Biot theory coupled with a generalized Ohm's law with an electrokinetic streaming current contribution. The components of the displacement of the solid phase, the fluid pressure, and the electrical potential are solved using a finite element approach with Perfect Match Layer (PML) boundary conditions for the seismic waves and boundary conditions mimicking an infinite material for the electrostatic problem. We develop an inversion algorithm using the electrical disturbances recorded in the second borehole to localize the position of the heterogeneities responsible for the SC. Because of the ill-posed nature of the inverse problem (inherent to all potential-field problems), regularization is used to constrain the solution at each time in the SC-time window comprised between the time of the seismic shot and the time of the first arrival of the seismic waves in the second borehole. All the inverted volumetric current source densities are aggregated together to produce an image of the position of the heterogeneities between the two boreholes. Two simple synthetic case studies are presented to test this concept. The first case study corresponds to a vertical discontinuity between two homogeneous sub-domains. The second case study corresponds to a poroelastic inclusion (partially saturated by oil) embedded into an homogenous poroelastic formation. In both cases, the position of the heterogeneity is recovered using only the electrical disturbances associated with the SC. That said, a joint inversion of the seismic and seismoelectric data could improve these results.

Seismic waveform sensitivity to global boundary topography

NASA Astrophysics Data System (ADS)

Colombi, Andrea; Nissen-Meyer, Tarje; Boschi, Lapo; Giardini, Domenico

2012-09-01

We investigate the implications of lateral variations in the topography of global seismic discontinuities, in the framework of high-resolution forward modelling and seismic imaging. We run 3-D wave-propagation simulations accurate at periods of 10 s and longer, with Earth models including core-mantle boundary topography anomalies of ˜1000 km spatial wavelength and up to 10 km height. We obtain very different waveform signatures for PcP (reflected) and Pdiff (diffracted) phases, supporting the theoretical expectation that the latter are sensitive primarily to large-scale structure, whereas the former only to small scale, where large and small are relative to the frequency. PcP at 10 s seems to be well suited to map such a small-scale perturbation, whereas Pdiff at the same frequency carries faint signatures that do not allow any tomographic reconstruction. Only at higher frequency, the signature becomes stronger. We present a new algorithm to compute sensitivity kernels relating seismic traveltimes (measured by cross-correlation of observed and theoretical seismograms) to the topography of seismic discontinuities at any depth in the Earth using full 3-D wave propagation. Calculation of accurate finite-frequency sensitivity kernels is notoriously expensive, but we reduce computational costs drastically by limiting ourselves to spherically symmetric reference models, and exploiting the axial symmetry of the resulting propagating wavefield that collapses to a 2-D numerical domain. We compute and analyse a suite of kernels for upper and lower mantle discontinuities that can be used for finite-frequency waveform inversion. The PcP and Pdiff sensitivity footprints are in good agreement with the result obtained cross-correlating perturbed and unperturbed seismogram, validating our approach against full 3-D modelling to invert for such structures.

Benchmarking protein classification algorithms via supervised cross-validation.

PubMed

Kertész-Farkas, Attila; Dhir, Somdutta; Sonego, Paolo; Pacurar, Mircea; Netoteia, Sergiu; Nijveen, Harm; Kuzniar, Arnold; Leunissen, Jack A M; Kocsor, András; Pongor, Sándor

2008-04-24

Development and testing of protein classification algorithms are hampered by the fact that the protein universe is characterized by groups vastly different in the number of members, in average protein size, similarity within group, etc. Datasets based on traditional cross-validation (k-fold, leave-one-out, etc.) may not give reliable estimates on how an algorithm will generalize to novel, distantly related subtypes of the known protein classes. Supervised cross-validation, i.e., selection of test and train sets according to the known subtypes within a database has been successfully used earlier in conjunction with the SCOP database. Our goal was to extend this principle to other databases and to design standardized benchmark datasets for protein classification. Hierarchical classification trees of protein categories provide a simple and general framework for designing supervised cross-validation strategies for protein classification. Benchmark datasets can be designed at various levels of the concept hierarchy using a simple graph-theoretic distance. A combination of supervised and random sampling was selected to construct reduced size model datasets, suitable for algorithm comparison. Over 3000 new classification tasks were added to our recently established protein classification benchmark collection that currently includes protein sequence (including protein domains and entire proteins), protein structure and reading frame DNA sequence data. We carried out an extensive evaluation based on various machine-learning algorithms such as nearest neighbor, support vector machines, artificial neural networks, random forests and logistic regression, used in conjunction with comparison algorithms, BLAST, Smith-Waterman, Needleman-Wunsch, as well as 3D comparison methods DALI and PRIDE. The resulting datasets provide lower, and in our opinion more realistic estimates of the classifier performance than do random cross-validation schemes. A combination of supervised and random sampling was used to construct model datasets, suitable for algorithm comparison.

Mass detection with digitized screening mammograms by using Gabor features

NASA Astrophysics Data System (ADS)

Zheng, Yufeng; Agyepong, Kwabena

2007-03-01

Breast cancer is the leading cancer among American women. The current lifetime risk of developing breast cancer is 13.4% (one in seven). Mammography is the most effective technology presently available for breast cancer screening. With digital mammograms computer-aided detection (CAD) has proven to be a useful tool for radiologists. In this paper, we focus on mass detection that is a common category of breast cancers relative to calcification and architecture distortion. We propose a new mass detection algorithm utilizing Gabor filters, termed as "Gabor Mass Detection" (GMD). There are three steps in the GMD algorithm, (1) preprocessing, (2) generating alarms and (3) classification (reducing false alarms). Down-sampling, quantization, denoising and enhancement are done in the preprocessing step. Then a total of 30 Gabor filtered images (along 6 bands by 5 orientations) are produced. Alarm segments are generated by thresholding four Gabor images of full orientations (Stage-I classification) with image-dependent thresholds computed via histogram analysis. Next a set of edge histogram descriptors (EHD) are extracted from 24 Gabor images (6 by 4) that will be used for Stage-II classification. After clustering EHD features with fuzzy C-means clustering method, a k-nearest neighbor classifier is used to reduce the number of false alarms. We initially analyzed 431 digitized mammograms (159 normal images vs. 272 cancerous images, from the DDSM project, University of South Florida) with the proposed GMD algorithm. And a ten-fold cross validation was used for testing the GMD algorithm upon the available data. The GMD performance is as follows: sensitivity (true positive rate) = 0.88 at false positives per image (FPI) = 1.25, and the area under the ROC curve = 0.83. The overall performance of the GMD algorithm is satisfactory and the accuracy of locating masses (highlighting the boundaries of suspicious areas) is relatively high. Furthermore, the GMD algorithm can successfully detect early-stage (with small values of Assessment & low Subtlety) malignant masses. In addition, Gabor filtered images are used in both stages of classifications, which greatly simplifies the GMD algorithm.

Adaptive Grid Refinement for Atmospheric Boundary Layer Simulations

NASA Astrophysics Data System (ADS)

van Hooft, Antoon; van Heerwaarden, Chiel; Popinet, Stephane; van der linden, Steven; de Roode, Stephan; van de Wiel, Bas

2017-04-01

We validate and benchmark an adaptive mesh refinement (AMR) algorithm for numerical simulations of the atmospheric boundary layer (ABL). The AMR technique aims to distribute the computational resources efficiently over a domain by refining and coarsening the numerical grid locally and in time. This can be beneficial for studying cases in which length scales vary significantly in time and space. We present the results for a case describing the growth and decay of a convective boundary layer. The AMR results are benchmarked against two runs using a fixed, fine meshed grid. First, with the same numerical formulation as the AMR-code and second, with a code dedicated to ABL studies. Compared to the fixed and isotropic grid runs, the AMR algorithm can coarsen and refine the grid such that accurate results are obtained whilst using only a fraction of the grid cells. Performance wise, the AMR run was cheaper than the fixed and isotropic grid run with similar numerical formulations. However, for this specific case, the dedicated code outperformed both aforementioned runs.

A fast multigrid-based electromagnetic eigensolver for curved metal boundaries on the Yee mesh

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

Bauer, Carl A., E-mail: carl.bauer@colorado.edu; Werner, Gregory R.; Cary, John R.

For embedded boundary electromagnetics using the Dey–Mittra (Dey and Mittra, 1997) [1] algorithm, a special grad–div matrix constructed in this work allows use of multigrid methods for efficient inversion of Maxwell’s curl–curl matrix. Efficient curl–curl inversions are demonstrated within a shift-and-invert Krylov-subspace eigensolver (open-sourced at ([ofortt]https://github.com/bauerca/maxwell[cfortt])) on the spherical cavity and the 9-cell TESLA superconducting accelerator cavity. The accuracy of the Dey–Mittra algorithm is also examined: frequencies converge with second-order error, and surface fields are found to converge with nearly second-order error. In agreement with previous work (Nieter et al., 2009) [2], neglecting some boundary-cut cell faces (as is requiredmore » in the time domain for numerical stability) reduces frequency convergence to first-order and surface-field convergence to zeroth-order (i.e. surface fields do not converge). Additionally and importantly, neglecting faces can reduce accuracy by an order of magnitude at low resolutions.« less

A Model for Predicting Grain Boundary Cracking in Polycrystalline Viscoplastic Materials Including Scale Effects

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

Allen, D.H.; Helms, K.L.E.; Hurtado, L.D.

1999-04-06

A model is developed herein for predicting the mechanical response of inelastic crystalline solids. Particular emphasis is given to the development of microstructural damage along grain boundaries, and the interaction of this damage with intragranular inelasticity caused by dislocation dissipation mechanisms. The model is developed within the concepts of continuum mechanics, with special emphasis on the development of internal boundaries in the continuum by utilizing a cohesive zone model based on fracture mechanics. In addition, the crystalline grains are assumed to be characterized by nonlinear viscoplastic mechanical material behavior in order to account for dislocation generation and migration. Due tomore » the nonlinearities introduced by the crack growth and viscoplastic constitution, a numerical algorithm is utilized to solve representative problems. Implementation of the model to a finite element computational algorithm is therefore briefly described. Finally, sample calculations are presented for a polycrystalline titanium alloy with particular focus on effects of scale on the predicted response.« less

Universal single level implicit algorithm for gasdynamics

NASA Technical Reports Server (NTRS)

Lombard, C. K.; Venkatapthy, E.

1984-01-01

A single level effectively explicit implicit algorithm for gasdynamics is presented. The method meets all the requirements for unconditionally stable global iteration over flows with mixed supersonic and supersonic zones including blunt body flow and boundary layer flows with strong interaction and streamwise separation. For hyperbolic (supersonic flow) regions the method is automatically equivalent to contemporary space marching methods. For elliptic (subsonic flow) regions, rapid convergence is facilitated by alternating direction solution sweeps which bring both sets of eigenvectors and the influence of both boundaries of a coordinate line equally into play. Point by point updating of the data with local iteration on the solution procedure at each spatial step as the sweeps progress not only renders the method single level in storage but, also, improves nonlinear accuracy to accelerate convergence by an order of magnitude over related two level linearized implicit methods. The method derives robust stability from the combination of an eigenvector split upwind difference method (CSCM) with diagonally dominant ADI(DDADI) approximate factorization and computed characteristic boundary approximations.

Using complexity science and negotiation theory to resolve boundary-crossing water issues

NASA Astrophysics Data System (ADS)

Islam, Shafiqul; Susskind, Lawrence

2018-07-01

Many water governance and management issues are complex. The complexity of these issues is related to crossing of multiple boundaries: political, social and jurisdictional, as well as physical, ecological and biogeochemical. Resolution of these issues usually requires interactions of many parties with conflicting values and interests operating across multiple boundaries and scales to make decisions. The interdependence and feedback among interacting variables, processes, actors and institutions are hard to model and difficult to forecast. Thus, decision-making related to complex water problems needs be contingent and adaptive. This paper draws on a number of ideas from complexity science and negotiation theory that may make it easier to cope with the complexities and difficulties of managing boundary crossing water disputes. It begins with the Water Diplomacy Framework that was developed and tested over the past several years. Then, it uses three key ideas from complexity science (interdependence and interconnectedness; uncertainty and feedback; emergence and adaptation) and three from negotiation theory (stakeholder identification and engagement; joint fact finding; and value creation through option generation) to show how application of these ideas can help enhance effectiveness of water management.

Boundary reflection matrices for nonsimply laced affine Toda field theories

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

Kim, J.D.

The boundary reflection matrices for nonsimply laced affine Toda field theories defined on a half line with the Neumann boundary condition are investigated. The boundary reflection matrices for some pairs of the models are evaluated up to one loop order by perturbation theory. Then the exact boundary reflection matrices which are consistent with the one loop result are found under the assumption of {open_quote}{open_quote}duality{close_quote}{close_quote} and tested against algebraic consistency such as the boundary bootstrap equation and boundary crossing-unitarity relation. {copyright} {ital 1996 The American Physical Society.}

An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information

PubMed Central

2010-01-01

Background Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout algorithms, the spring embedder algorithm is widely used not only for pathway drawing but also for circuit placement and www visualization and so on because of the harmonized appearance of its results. For pathway drawing, location information is essential for its comprehension. However, complex shapes need to be taken into account when torus-shaped location information such as nuclear inner membrane, nuclear outer membrane, and plasma membrane is considered. Unfortunately, the spring embedder algorithm cannot easily handle such information. In addition, crossings between edges and nodes are usually not considered explicitly. Results We proposed a new grid-layout algorithm based on the spring embedder algorithm that can handle location information and provide layouts with harmonized appearance. In grid-layout algorithms, the mapping of nodes to grid points that minimizes a cost function is searched. By imposing positional constraints on grid points, location information including complex shapes can be easily considered. Our layout algorithm includes the spring embedder cost as a component of the cost function. We further extend the layout algorithm to enable dynamic update of the positions and sizes of compartments at each step. Conclusions The new spring embedder-based grid-layout algorithm and a spring embedder algorithm are applied to three biological pathways; endothelial cell model, Fas-induced apoptosis model, and C. elegans cell fate simulation model. From the positional constraints, all the results of our algorithm satisfy location information, and hence, more comprehensible layouts are obtained as compared to the spring embedder algorithm. From the comparison of the number of crossings, the results of the grid-layout-based algorithm tend to contain more crossings than those of the spring embedder algorithm due to the positional constraints. For a fair comparison, we also apply our proposed method without positional constraints. This comparison shows that these results contain less crossings than those of the spring embedder algorithm. We also compared layouts of the proposed algorithm with and without compartment update and verified that latter can reach better local optima. PMID:20565884

Analysis of the Command and Control Segment (CCS) attitude estimation algorithm

NASA Technical Reports Server (NTRS)

Stockwell, Catherine

1993-01-01

This paper categorizes the qualitative behavior of the Command and Control Segment (CCS) differential correction algorithm as applied to attitude estimation using simultaneous spin axis sun angle and Earth cord length measurements. The categories of interest are the domains of convergence, divergence, and their boundaries. Three series of plots are discussed that show the dependence of the estimation algorithm on the vehicle radius, the sun/Earth angle, and the spacecraft attitude. Common qualitative dynamics to all three series are tabulated and discussed. Out-of-limits conditions for the estimation algorithm are identified and discussed.

Cell-veto Monte Carlo algorithm for long-range systems.

PubMed

Kapfer, Sebastian C; Krauth, Werner

2016-09-01

We present a rigorous efficient event-chain Monte Carlo algorithm for long-range interacting particle systems. Using a cell-veto scheme within the factorized Metropolis algorithm, we compute each single-particle move with a fixed number of operations. For slowly decaying potentials such as Coulomb interactions, screening line charges allow us to take into account periodic boundary conditions. We discuss the performance of the cell-veto Monte Carlo algorithm for general inverse-power-law potentials, and illustrate how it provides a new outlook on one of the prominent bottlenecks in large-scale atomistic Monte Carlo simulations.

An algorithmic framework for multiobjective optimization.

PubMed

Ganesan, T; Elamvazuthi, I; Shaari, Ku Zilati Ku; Vasant, P

2013-01-01

Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems. Nevertheless, many challenges still arise especially when dealing with problems with multiple objectives (especially in cases more than two). In addition, problems with extensive computational overhead emerge when dealing with hybrid algorithms. This paper discusses these issues by proposing an alternative framework that utilizes algorithmic concepts related to the problem structure for generating efficient and effective algorithms. This paper proposes a framework to generate new high-performance algorithms with minimal computational overhead for MO optimization.

An Algorithmic Framework for Multiobjective Optimization

PubMed Central

Ganesan, T.; Elamvazuthi, I.; Shaari, Ku Zilati Ku; Vasant, P.

2013-01-01

Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems. Nevertheless, many challenges still arise especially when dealing with problems with multiple objectives (especially in cases more than two). In addition, problems with extensive computational overhead emerge when dealing with hybrid algorithms. This paper discusses these issues by proposing an alternative framework that utilizes algorithmic concepts related to the problem structure for generating efficient and effective algorithms. This paper proposes a framework to generate new high-performance algorithms with minimal computational overhead for MO optimization. PMID:24470795

A conservative implicit finite difference algorithm for the unsteady transonic full potential equation

NASA Technical Reports Server (NTRS)

Steger, J. L.; Caradonna, F. X.

1980-01-01

An implicit finite difference procedure is developed to solve the unsteady full potential equation in conservation law form. Computational efficiency is maintained by use of approximate factorization techniques. The numerical algorithm is first order in time and second order in space. A circulation model and difference equations are developed for lifting airfoils in unsteady flow; however, thin airfoil body boundary conditions have been used with stretching functions to simplify the development of the numerical algorithm.

Efficient characterisation of large deviations using population dynamics

NASA Astrophysics Data System (ADS)

Brewer, Tobias; Clark, Stephen R.; Bradford, Russell; Jack, Robert L.

2018-05-01

We consider population dynamics as implemented by the cloning algorithm for analysis of large deviations of time-averaged quantities. We use the simple symmetric exclusion process with periodic boundary conditions as a prototypical example and investigate the convergence of the results with respect to the algorithmic parameters, focussing on the dynamical phase transition between homogeneous and inhomogeneous states, where convergence is relatively difficult to achieve. We discuss how the performance of the algorithm can be optimised, and how it can be efficiently exploited on parallel computing platforms.

A return mapping algorithm for isotropic and anisotropic plasticity models using a line search method

DOE PAGES

Scherzinger, William M.

2016-05-01

The numerical integration of constitutive models in computational solid mechanics codes allows for the solution of boundary value problems involving complex material behavior. Metal plasticity models, in particular, have been instrumental in the development of these codes. Here, most plasticity models implemented in computational codes use an isotropic von Mises yield surface. The von Mises, of J 2, yield surface has a simple predictor-corrector algorithm - the radial return algorithm - to integrate the model.

Numerical simulation of steady supersonic flow. [spatial marching

NASA Technical Reports Server (NTRS)

Schiff, L. B.; Steger, J. L.

1981-01-01

A noniterative, implicit, space-marching, finite-difference algorithm was developed for the steady thin-layer Navier-Stokes equations in conservation-law form. The numerical algorithm is applicable to steady supersonic viscous flow over bodies of arbitrary shape. In addition, the same code can be used to compute supersonic inviscid flow or three-dimensional boundary layers. Computed results from two-dimensional and three-dimensional versions of the numerical algorithm are in good agreement with those obtained from more costly time-marching techniques.

Implicit treatment of diffusion terms in lower-upper algorithms

NASA Technical Reports Server (NTRS)

Shih, T. I.-P.; Steinthorsson, E.; Chyu, W. J.

1993-01-01

A method is presented which allows diffusion terms to be treated implicitly in the lower-upper (LU) algorithm (which is a commonly used method for solving 'compressible' Euler and Navier-Stokes equations) so that the algorithm's good stability properties will not be impaired. The new method generalizes the concept of LU factorization from that associated with the sign of eigenvalues to that associated with backward- and forward-difference operators without regard to eigenvalues. The method is verified in a turbulent boundary layer study.

Statistical investigation of avalanches of three-dimensional small-world networks and their boundary and bulk cross-sections

NASA Astrophysics Data System (ADS)

Najafi, M. N.; Dashti-Naserabadi, H.

2018-03-01

In many situations we are interested in the propagation of energy in some portions of a three-dimensional system with dilute long-range links. In this paper, a sandpile model is defined on the three-dimensional small-world network with real dissipative boundaries and the energy propagation is studied in three dimensions as well as the two-dimensional cross-sections. Two types of cross-sections are defined in the system, one in the bulk and another in the system boundary. The motivation of this is to make clear how the statistics of the avalanches in the bulk cross-section tend to the statistics of the dissipative avalanches, defined in the boundaries as the concentration of long-range links (α ) increases. This trend is numerically shown to be a power law in a manner described in the paper. Two regimes of α are considered in this work. For sufficiently small α s the dominant behavior of the system is just like that of the regular BTW, whereas for the intermediate values the behavior is nontrivial with some exponents that are reported in the paper. It is shown that the spatial extent up to which the statistics is similar to the regular BTW model scales with α just like the dissipative BTW model with the dissipation factor (mass in the corresponding ghost model) m2˜α for the three-dimensional system as well as its two-dimensional cross-sections.

Kalman/Map filtering-aided fast normalized cross correlation-based Wi-Fi fingerprinting location sensing.

PubMed

Sun, Yongliang; Xu, Yubin; Li, Cheng; Ma, Lin

2013-11-13

A Kalman/map filtering (KMF)-aided fast normalized cross correlation (FNCC)-based Wi-Fi fingerprinting location sensing system is proposed in this paper. Compared with conventional neighbor selection algorithms that calculate localization results with received signal strength (RSS) mean samples, the proposed FNCC algorithm makes use of all the on-line RSS samples and reference point RSS variations to achieve higher fingerprinting accuracy. The FNCC computes efficiently while maintaining the same accuracy as the basic normalized cross correlation. Additionally, a KMF is also proposed to process fingerprinting localization results. It employs a new map matching algorithm to nonlinearize the linear location prediction process of Kalman filtering (KF) that takes advantage of spatial proximities of consecutive localization results. With a calibration model integrated into an indoor map, the map matching algorithm corrects unreasonable prediction locations of the KF according to the building interior structure. Thus, more accurate prediction locations are obtained. Using these locations, the KMF considerably improves fingerprinting algorithm performance. Experimental results demonstrate that the FNCC algorithm with reduced computational complexity outperforms other neighbor selection algorithms and the KMF effectively improves location sensing accuracy by using indoor map information and spatial proximities of consecutive localization results.

Kalman/Map Filtering-Aided Fast Normalized Cross Correlation-Based Wi-Fi Fingerprinting Location Sensing

PubMed Central

Sun, Yongliang; Xu, Yubin; Li, Cheng; Ma, Lin

2013-01-01

A Kalman/map filtering (KMF)-aided fast normalized cross correlation (FNCC)-based Wi-Fi fingerprinting location sensing system is proposed in this paper. Compared with conventional neighbor selection algorithms that calculate localization results with received signal strength (RSS) mean samples, the proposed FNCC algorithm makes use of all the on-line RSS samples and reference point RSS variations to achieve higher fingerprinting accuracy. The FNCC computes efficiently while maintaining the same accuracy as the basic normalized cross correlation. Additionally, a KMF is also proposed to process fingerprinting localization results. It employs a new map matching algorithm to nonlinearize the linear location prediction process of Kalman filtering (KF) that takes advantage of spatial proximities of consecutive localization results. With a calibration model integrated into an indoor map, the map matching algorithm corrects unreasonable prediction locations of the KF according to the building interior structure. Thus, more accurate prediction locations are obtained. Using these locations, the KMF considerably improves fingerprinting algorithm performance. Experimental results demonstrate that the FNCC algorithm with reduced computational complexity outperforms other neighbor selection algorithms and the KMF effectively improves location sensing accuracy by using indoor map information and spatial proximities of consecutive localization results. PMID:24233027

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.

Preliminary study of the interactions caused by crossing shock waves and a turbulent boundary layer

NASA Technical Reports Server (NTRS)

Ketchum, A. C.; Bogdonoff, S. M.; Fernando, E. M.; Batcho, P. F.

1989-01-01

The subject research, the first phase of an extended study of the interaction of crossing shock waves with a turbulent boundary layer, has revealed the complexity of the resulting flow. Detailed surface visualization and mean wall static pressure distributions show little resemblance to the inviscid flow approximation, and the exploratory high frequency measurements show that the flow downstream of the theoretical inviscid shock crossing position has a significant unsteady characteristic. Further developments of the (unsteady) high frequency measurements are required to fully characterize the unsteadiness and the requirements to include this component in flowfield modeling.

Large deflection random response of cross-ply laminated plates with elastically restrained edges and initial imperfections

NASA Technical Reports Server (NTRS)

Prasad, C. B.; Mei, Chuh

1988-01-01

The large deflection random response of symmetrically laminated cross-ply rectangular thin plates subjected to random excitation is studied. The out-of-plane boundary conditions are such that all the edges are rigidly supported against translation, but elastically restrained against rotation. The plate is also assumed to have a small initial imperfection. The assumed membrane boundary conditions are such that all the edges are free from normal and tangential forces in the plane of the plate. Mean-square deflections and mean-square strains are determined for a three-layered cross-ply laminate.

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

Bian, Lei, E-mail: bianlei@pku.edu.cn; Pang, Gang, E-mail: 1517191281@qq.com; Tang, Shaoqiang, E-mail: maotang@pku.edu.cn

For the Schrödinger–Poisson system, we propose an ALmost EXact (ALEX) boundary condition to treat accurately the numerical boundaries. Being local in both space and time, the ALEX boundary conditions are demonstrated to be effective in suppressing spurious numerical reflections. Together with the Crank–Nicolson scheme, we simulate a resonant tunneling diode. The algorithm produces numerical results in excellent agreement with those in Mennemann et al. [1], yet at a much reduced complexity. Primary peaks in wave function profile appear as a consequence of quantum resonance, and should be considered in selecting the cut-off wave number for numerical simulations.

Crossing Boundaries in Literacy Research: Challenges and Opportunities

ERIC Educational Resources Information Center

Almasi, Janice F.

2016-01-01

The concept of boundaries, as borders that separate two entities, can be problematic in that those who "belong" within a boundary in a given social world or entity are separated from those who do not, creating binaries. The field of literacy research has had a long history of binarism in which instructional methods, epistemological…

Transformation in Interdisciplinary Research Methodology: The Importance of Shared Experiences in Landscapes of Practice

ERIC Educational Resources Information Center

Clark, Jill; Laing, Karen; Leat, David; Lofthouse, Rachel; Thomas, Ulrike; Tiplady, Lucy; Woolner, Pamela

2017-01-01

Current debates around the concept of boundary crossing stress the importance of boundary objects in bringing people together to share understandings. We argue that the boundary object is of secondary importance, and that what is important for the transformational potential of interdisciplinary understanding is opportunities for "boundary…

Rotational magneto-acousto-electric tomography (MAET): theory and experimental validation

PubMed Central

Kunyansky, L; Ingram, C P; Witte, R S

2017-01-01

We present a novel two-dimensional (2D) MAET scanner, with a rotating object of interest and two fixed pairs of electrodes. Such an acquisition scheme, with our novel reconstruction techniques, recovers the boundaries of the regions of constant conductivity uniformly well, regardless of their orientation. We also present a general image reconstruction algorithm for the 2D MAET in a circular chamber with point-like electrodes immersed into the saline surrounding the object. An alternative linearized reconstruction procedure is developed, suitable for recovering the material interfaces (boundaries) when a non-ideal piezoelectric transducer is used for acoustic excitation. The work of the scanner and the linearized reconstruction algorithm is demonstrated using several phantoms made of high-contrast materials and a biological sample. PMID:28323633

Dislocation Content Measured Via 3D HR-EBSD Near a Grain Boundary in an AlCu Oligocrystal

NASA Technical Reports Server (NTRS)

Ruggles, Timothy; Hochhalter, Jacob; Homer, Eric

2016-01-01

Interactions between dislocations and grain boundaries are poorly understood and crucial to mesoscale plasticity modeling. Much of our understanding of dislocation-grain boundary interaction comes from atomistic simulations and TEM studies, both of which are extremely limited in scale. High angular resolution EBSD-based continuum dislocation microscopy provides a way of measuring dislocation activity at length scales and accuracies relevant to crystal plasticity, but it is limited as a two-dimensional technique, meaning the character of the grain boundary and the complete dislocation activity is difficult to recover. However, the commercialization of plasma FIB dual-beam microscopes have made 3D EBSD studies all the more feasible. The objective of this work is to apply high angular resolution cross correlation EBSD to a 3D EBSD data set collected by serial sectioning in a FIB to characterize dislocation interaction with a grain boundary. Three dimensional high angular resolution cross correlation EBSD analysis was applied to an AlCu oligocrystal to measure dislocation densities around a grain boundary. Distortion derivatives associated with the plasma FIB serial sectioning were higher than expected, possibly due to geometric uncertainty between layers. Future work will focus on mitigating the geometric uncertainty and examining more regions of interest along the grain boundary to glean information on dislocation-grain boundary interaction.

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.

Computation of multi-dimensional viscous supersonic flow

NASA Technical Reports Server (NTRS)

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

1986-01-01

A method has been developed for two- and three-dimensional computations of viscous supersonic jet flows interacting with an external flow. 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 associated with supersonic jet flow is presented and compared with other calculations for axisymmetric cases. Demonstration calculations indicate that the computational technique has great promise as a tool for calculating a wide range of supersonic flow problems including jet flow. Finally, a User's Manual is presented for the computer code used to perform the calculations.

Fast preconditioned multigrid solution of the Euler and Navier-Stokes equations for steady, compressible flows

NASA Astrophysics Data System (ADS)

Caughey, David A.; Jameson, Antony

2003-10-01

New versions of implicit algorithms are developed for the efficient solution of the Euler and Navier-Stokes equations of compressible flow. The methods are based on a preconditioned, lower-upper (LU) implementation of a non-linear, symmetric Gauss-Seidel (SGS) algorithm for use as a smoothing algorithm in a multigrid method. Previously, this method had been implemented for flows in quasi-one-dimensional ducts and for two-dimensional flows past airfoils on boundary-conforming O-type grids for a variety of symmetric limited positive (SLIP) spatial approximations, including the scalar dissipation and convective upwind split pressure (CUSP) schemes. Here results are presented for both inviscid and viscous (laminar) flows past airfoils on boundary-conforming C-type grids. The method is significantly faster than earlier explicit or implicit methods for inviscid problems, allowing solution of these problems to the level of truncation error in three to five multigrid cycles. Viscous solutions still require as many as twenty multigrid cycles.

Nonlinear stability of non-stationary cross-flow vortices in compressible boundary layers

NASA Technical Reports Server (NTRS)

Gajjar, J. S. B.

1995-01-01

The nonlinear evolution of long wavelength non-stationary cross-flow vortices in a compressible boundary layer is investigated and the work extends that of Gajjar (1994) to flows involving multiple critical layers. The basic flow profile considered in this paper is that appropriate for a fully three-dimensional boundary layer with O(1) Mach number and with wall heating or cooling. The governing equations for the evolution of the cross-flow vortex are obtained and some special cases are discussed. One special case includes linear theory where exact analytic expressions for the growth rate of the vortices are obtained. Another special case is a generalization of the Bassom & Gajjar (1988) results for neutral waves to compressible flows. The viscous correction to the growth rate is derived and it is shown how the unsteady nonlinear critical layer structure merges with that for a Haberman type of viscous critical layer.

Progress on a generalized coordinates tensor product finite element 3DPNS algorithm for subsonic

NASA Technical Reports Server (NTRS)

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

1983-01-01

A generalized coordinates form of the penalty finite element algorithm for the 3-dimensional parabolic Navier-Stokes equations for turbulent subsonic flows was derived. This algorithm formulation requires only three distinct hypermatrices and is applicable using any boundary fitted coordinate transformation procedure. The tensor matrix product approximation to the Jacobian of the Newton linear algebra matrix statement was also derived. Tne Newton algorithm was restructured to replace large sparse matrix solution procedures with grid sweeping using alpha-block tridiagonal matrices, where alpha equals the number of dependent variables. Numerical experiments were conducted and the resultant data gives guidance on potentially preferred tensor product constructions for the penalty finite element 3DPNS algorithm.

Trajectory optimization of spacecraft high-thrust orbit transfer using a modified evolutionary algorithm

NASA Astrophysics Data System (ADS)

Shirazi, Abolfazl

2016-10-01

This article introduces a new method to optimize finite-burn orbital manoeuvres based on a modified evolutionary algorithm. Optimization is carried out based on conversion of the orbital manoeuvre into a parameter optimization problem by assigning inverse tangential functions to the changes in direction angles of the thrust vector. The problem is analysed using boundary delimitation in a common optimization algorithm. A method is introduced to achieve acceptable values for optimization variables using nonlinear simulation, which results in an enlarged convergence domain. The presented algorithm benefits from high optimality and fast convergence time. A numerical example of a three-dimensional optimal orbital transfer is presented and the accuracy of the proposed algorithm is shown.

Physical education "in all sorts of corners": student activists transgressing formal physical education curricular boundaries.

PubMed

Enright, Eimear; O'Sullivan, Mary

2012-06-01

The data for this paper were generated during a 3-year; participatory action research project, with 41 female coresearchers and activists ages 15-19 years old, within and beyond the walls of a secondary school. The two questions we sought to answer were (a) what happens when we engage with students to challenge formal physical education curricular boundaries and connect with students' physical culture; and (b) what are the benefits and the challenges associated with engaging in this sort of practical activism? The findings suggest that a boundary-crossing approach to physical education can facilitate students in finding their own meanings in physical education and physical activity. Supporting boundary-crossing practices is, however; a time- and thought-intensive pedagogical design, which will be challenging for many physical education teachers.

A high speed implementation of the random decrement algorithm

NASA Technical Reports Server (NTRS)

Kiraly, L. J.

1982-01-01

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Fault Identification by Unsupervised Learning Algorithm

NASA Astrophysics Data System (ADS)

Nandan, S.; Mannu, U.

2012-12-01

Contemporary fault identification techniques predominantly rely on the surface expression of the fault. This biased observation is inadequate to yield detailed fault structures in areas with surface cover like cities deserts vegetation etc and the changes in fault patterns with depth. Furthermore it is difficult to estimate faults structure which do not generate any surface rupture. Many disastrous events have been attributed to these blind faults. Faults and earthquakes are very closely related as earthquakes occur on faults and faults grow by accumulation of coseismic rupture. For a better seismic risk evaluation it is imperative to recognize and map these faults. We implement a novel approach to identify seismically active fault planes from three dimensional hypocenter distribution by making use of unsupervised learning algorithms. We employ K-means clustering algorithm and Expectation Maximization (EM) algorithm modified to identify planar structures in spatial distribution of hypocenter after filtering out isolated events. We examine difference in the faults reconstructed by deterministic assignment in K- means and probabilistic assignment in EM algorithm. The method is conceptually identical to methodologies developed by Ouillion et al (2008, 2010) and has been extensively tested on synthetic data. We determined the sensitivity of the methodology to uncertainties in hypocenter location, density of clustering and cross cutting fault structures. The method has been applied to datasets from two contrasting regions. While Kumaon Himalaya is a convergent plate boundary, Koyna-Warna lies in middle of the Indian Plate but has a history of triggered seismicity. The reconstructed faults were validated by examining the fault orientation of mapped faults and the focal mechanism of these events determined through waveform inversion. The reconstructed faults could be used to solve the fault plane ambiguity in focal mechanism determination and constrain the fault orientations for finite source inversions. The faults produced by the method exhibited good correlation with the fault planes obtained by focal mechanism solutions and previously mapped faults.

Variational algorithms for nonlinear smoothing applications

NASA Technical Reports Server (NTRS)

Bach, R. E., Jr.

1977-01-01

A variational approach is presented for solving a nonlinear, fixed-interval smoothing problem with application to offline processing of noisy data for trajectory reconstruction and parameter estimation. The nonlinear problem is solved as a sequence of linear two-point boundary value problems. Second-order convergence properties are demonstrated. Algorithms for both continuous and discrete versions of the problem are given, and example solutions are provided.

The finite body triangulation: algorithms, subgraphs, homogeneity estimation and application.

PubMed

Carson, Cantwell G; Levine, Jonathan S

2016-09-01

The concept of a finite body Dirichlet tessellation has been extended to that of a finite body Delaunay 'triangulation' to provide a more meaningful description of the spatial distribution of nonspherical secondary phase bodies in 2- and 3-dimensional images. A finite body triangulation (FBT) consists of a network of minimum edge-to-edge distances between adjacent objects in a microstructure. From this is also obtained the characteristic object chords formed by the intersection of the object boundary with the finite body tessellation. These two sets of distances form the basis of a parsimonious homogeneity estimation. The characteristics of the spatial distribution are then evaluated with respect to the distances between objects and the distances within them. Quantitative analysis shows that more physically representative distributions can be obtained by selecting subgraphs, such as the relative neighbourhood graph and the minimum spanning tree, from the finite body tessellation. To demonstrate their potential, we apply these methods to 3-dimensional X-ray computed tomographic images of foamed cement and their 2-dimensional cross sections. The Python computer code used to estimate the FBT is made available. Other applications for the algorithm - such as porous media transport and crack-tip propagation - are also discussed. © 2016 The Authors Journal of Microscopy © 2016 Royal Microscopical Society.

A Comparison of PETSC Library and HPF Implementations of an Archetypal PDE Computation

NASA Technical Reports Server (NTRS)

Hayder, M. Ehtesham; Keyes, David E.; Mehrotra, Piyush

1997-01-01

Two paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation a nonlinear, structured-grid partial differential equation boundary value problem using the same algorithm on the same hardware. Both paradigms, parallel libraries represented by Argonne's PETSC, and parallel languages represented by the Portland Group's HPF, are found to be easy to use for this problem class, and both are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under either paradigm includes specification of the data partitioning (corresponding to a geometrically simple decomposition of the domain of the PDE). Programming in SPAM style for the PETSC library requires writing the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global- to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm, introducing concurrency through subdomain blocking (an effort similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Correctness and scalability are cross-validated on up to 32 nodes of an IBM SP2.

Weighted divergence correction scheme and its fast implementation

NASA Astrophysics Data System (ADS)

Wang, ChengYue; Gao, Qi; Wei, RunJie; Li, Tian; Wang, JinJun

2017-05-01

Forcing the experimental volumetric velocity fields to satisfy mass conversation principles has been proved beneficial for improving the quality of measured data. A number of correction methods including the divergence correction scheme (DCS) have been proposed to remove divergence errors from measurement velocity fields. For tomographic particle image velocimetry (TPIV) data, the measurement uncertainty for the velocity component along the light thickness direction is typically much larger than for the other two components. Such biased measurement errors would weaken the performance of traditional correction methods. The paper proposes a variant for the existing DCS by adding weighting coefficients to the three velocity components, named as the weighting DCS (WDCS). The generalized cross validation (GCV) method is employed to choose the suitable weighting coefficients. A fast algorithm for DCS or WDCS is developed, making the correction process significantly low-cost to implement. WDCS has strong advantages when correcting velocity components with biased noise levels. Numerical tests validate the accuracy and efficiency of the fast algorithm, the effectiveness of GCV method, and the advantages of WDCS. Lastly, DCS and WDCS are employed to process experimental velocity fields from the TPIV measurement of a turbulent boundary layer. This shows that WDCS achieves a better performance than DCS in improving some flow statistics.

Some experiences with the viscous-inviscid interaction approach

NASA Technical Reports Server (NTRS)

Vandalsem, W. R.; Steger, J. L.; Rao, K. V.

1987-01-01

Methods for simulating compressible viscous flow using the viscid-inviscid interaction approach are described. The formulations presented range from the more familiar full-potential/boundary-layer interaction schemes to a method for coupling Euler/Navier-Stokes and boundary-layer algorithms. An effort is made to describe the advantages and disadvantages of each formulation. Sample results are presented which illustrate the applicability of the methods.

Local Competition-Based Superpixel Segmentation Algorithm in Remote Sensing

PubMed Central

Liu, Jiayin; Tang, Zhenmin; Cui, Ying; Wu, Guoxing

2017-01-01

Remote sensing technologies have been widely applied in urban environments’ monitoring, synthesis and modeling. Incorporating spatial information in perceptually coherent regions, superpixel-based approaches can effectively eliminate the “salt and pepper” phenomenon which is common in pixel-wise approaches. Compared with fixed-size windows, superpixels have adaptive sizes and shapes for different spatial structures. Moreover, superpixel-based algorithms can significantly improve computational efficiency owing to the greatly reduced number of image primitives. Hence, the superpixel algorithm, as a preprocessing technique, is more and more popularly used in remote sensing and many other fields. In this paper, we propose a superpixel segmentation algorithm called Superpixel Segmentation with Local Competition (SSLC), which utilizes a local competition mechanism to construct energy terms and label pixels. The local competition mechanism leads to energy terms locality and relativity, and thus, the proposed algorithm is less sensitive to the diversity of image content and scene layout. Consequently, SSLC could achieve consistent performance in different image regions. In addition, the Probability Density Function (PDF), which is estimated by Kernel Density Estimation (KDE) with the Gaussian kernel, is introduced to describe the color distribution of superpixels as a more sophisticated and accurate measure. To reduce computational complexity, a boundary optimization framework is introduced to only handle boundary pixels instead of the whole image. We conduct experiments to benchmark the proposed algorithm with the other state-of-the-art ones on the Berkeley Segmentation Dataset (BSD) and remote sensing images. Results demonstrate that the SSLC algorithm yields the best overall performance, while the computation time-efficiency is still competitive. PMID:28604641

Local Competition-Based Superpixel Segmentation Algorithm in Remote Sensing.

PubMed

Liu, Jiayin; Tang, Zhenmin; Cui, Ying; Wu, Guoxing

2017-06-12

Remote sensing technologies have been widely applied in urban environments' monitoring, synthesis and modeling. Incorporating spatial information in perceptually coherent regions, superpixel-based approaches can effectively eliminate the "salt and pepper" phenomenon which is common in pixel-wise approaches. Compared with fixed-size windows, superpixels have adaptive sizes and shapes for different spatial structures. Moreover, superpixel-based algorithms can significantly improve computational efficiency owing to the greatly reduced number of image primitives. Hence, the superpixel algorithm, as a preprocessing technique, is more and more popularly used in remote sensing and many other fields. In this paper, we propose a superpixel segmentation algorithm called Superpixel Segmentation with Local Competition (SSLC), which utilizes a local competition mechanism to construct energy terms and label pixels. The local competition mechanism leads to energy terms locality and relativity, and thus, the proposed algorithm is less sensitive to the diversity of image content and scene layout. Consequently, SSLC could achieve consistent performance in different image regions. In addition, the Probability Density Function (PDF), which is estimated by Kernel Density Estimation (KDE) with the Gaussian kernel, is introduced to describe the color distribution of superpixels as a more sophisticated and accurate measure. To reduce computational complexity, a boundary optimization framework is introduced to only handle boundary pixels instead of the whole image. We conduct experiments to benchmark the proposed algorithm with the other state-of-the-art ones on the Berkeley Segmentation Dataset (BSD) and remote sensing images. Results demonstrate that the SSLC algorithm yields the best overall performance, while the computation time-efficiency is still competitive.

Integrated Multiscale Modeling of Molecular Computing Devices

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

Gregory Beylkin

2012-03-23

Significant advances were made on all objectives of the research program. We have developed fast multiresolution methods for performing electronic structure calculations with emphasis on constructing efficient representations of functions and operators. We extended our approach to problems of scattering in solids, i.e. constructing fast algorithms for computing above the Fermi energy level. Part of the work was done in collaboration with Robert Harrison and George Fann at ORNL. Specific results (in part supported by this grant) are listed here and are described in greater detail. (1) We have implemented a fast algorithm to apply the Green's function for themore » free space (oscillatory) Helmholtz kernel. The algorithm maintains its speed and accuracy when the kernel is applied to functions with singularities. (2) We have developed a fast algorithm for applying periodic and quasi-periodic, oscillatory Green's functions and those with boundary conditions on simple domains. Importantly, the algorithm maintains its speed and accuracy when applied to functions with singularities. (3) We have developed a fast algorithm for obtaining and applying multiresolution representations of periodic and quasi-periodic Green's functions and Green's functions with boundary conditions on simple domains. (4) We have implemented modifications to improve the speed of adaptive multiresolution algorithms for applying operators which are represented via a Gaussian expansion. (5) We have constructed new nearly optimal quadratures for the sphere that are invariant under the icosahedral rotation group. (6) We obtained new results on approximation of functions by exponential sums and/or rational functions, one of the key methods that allows us to construct separated representations for Green's functions. (7) We developed a new fast and accurate reduction algorithm for obtaining optimal approximation of functions by exponential sums and/or their rational representations.« less

Spectral algorithms for multiple scale localized eigenfunctions in infinitely long, slightly bent quantum waveguides

NASA Astrophysics Data System (ADS)

Boyd, John P.; Amore, Paolo; Fernández, Francisco M.

2018-03-01

A "bent waveguide" in the sense used here is a small perturbation of a two-dimensional rectangular strip which is infinitely long in the down-channel direction and has a finite, constant width in the cross-channel coordinate. The goal is to calculate the smallest ("ground state") eigenvalue of the stationary Schrödinger equation which here is a two-dimensional Helmholtz equation, ψxx +ψyy + Eψ = 0 where E is the eigenvalue and homogeneous Dirichlet boundary conditions are imposed on the walls of the waveguide. Perturbation theory gives a good description when the "bending strength" parameter ɛ is small as described in our previous article (Amore et al., 2017) and other works cited therein. However, such series are asymptotic, and it is often impractical to calculate more than a handful of terms. It is therefore useful to develop numerical methods for the perturbed strip to cover intermediate ɛ where the perturbation series may be inaccurate and also to check the pertubation expansion when ɛ is small. The perturbation-induced change-in-eigenvalue, δ ≡ E(ɛ) - E(0) , is O(ɛ2) . We show that the computation becomes very challenging as ɛ → 0 because (i) the ground state eigenfunction varies on both O(1) and O(1 / ɛ) length scales and (ii) high accuracy is needed to compute several correct digits in δ, which is itself small compared to the eigenvalue E. The multiple length scales are not geographically separate, but rather are inextricably commingled in the neighborhood of the boundary deformation. We show that coordinate mapping and immersed boundary strategies both reduce the computational domain to the uniform strip, allowing application of pseudospectral methods on tensor product grids with tensor product basis functions. We compared different basis sets; Chebyshev polynomials are best in the cross-channel direction. However, sine functions generate rather accurate analytical approximations with just a single basis function. In the down-channel coordinate, X ∈ [ - ∞ , ∞ ] , Fourier domain truncation using the change of coordinate X = sinh(Lt) is considerably more efficient than rational Chebyshev functions TBn(X ; L) . All the spectral methods, however, yielded the required accuracy on a desktop computer.

Inverse Thermal Analysis of Alloy 690 Laser and Hybrid Laser-GMA Welds Using Solidification-Boundary Constraints

NASA Astrophysics Data System (ADS)

Lambrakos, S. G.

2017-08-01

An inverse thermal analysis of Alloy 690 laser and hybrid laser-GMA welds is presented that uses numerical-analytical basis functions and boundary constraints based on measured solidification cross sections. In particular, the inverse analysis procedure uses three-dimensional constraint conditions such that two-dimensional projections of calculated solidification boundaries are constrained to map within experimentally measured solidification cross sections. Temperature histories calculated by this analysis are input data for computational procedures that predict solid-state phase transformations and mechanical response. These temperature histories can be used for inverse thermal analysis of welds corresponding to other welding processes whose process conditions are within similar regimes.

Overcoming a Dirty Category: Cross-Cultural Experience in the American Classroom.

ERIC Educational Resources Information Center

Kim, Kyong L.

According to Edmund Leach (1976), boundaries are dirty. Yet power resides in the boundaries. As foreign-born instructors, the authors fall into a dirty category because they exist in cultural boundaries. This paper recognizes the American style of communication studies as a dirty category. This paper suggests that the authors' role be redefined in…

Update on Development of Mesh Generation Algorithms in MeshKit

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

Jain, Rajeev; Vanderzee, Evan; Mahadevan, Vijay

2015-09-30

MeshKit uses a graph-based design for coding all its meshing algorithms, which includes the Reactor Geometry (and mesh) Generation (RGG) algorithms. This report highlights the developmental updates of all the algorithms, results and future work. Parallel versions of algorithms, documentation and performance results are reported. RGG GUI design was updated to incorporate new features requested by the users; boundary layer generation and parallel RGG support were added to the GUI. Key contributions to the release, upgrade and maintenance of other SIGMA1 libraries (CGM and MOAB) were made. Several fundamental meshing algorithms for creating a robust parallel meshing pipeline in MeshKitmore » are under development. Results and current status of automated, open-source and high quality nuclear reactor assembly mesh generation algorithms such as trimesher, quadmesher, interval matching and multi-sweeper are reported.« less

General ultrafast pulse measurement using the cross-correlation single-shot sonogram technique.

PubMed

Reid, Derryck T; Garduno-Mejia, Jesus

2004-03-15

The cross-correlation single-shot sonogram technique offers exact pulse measurement and real-time pulse monitoring via an intuitive time-frequency trace whose shape and orientation directly indicate the spectral chirp of an ultrashort laser pulse. We demonstrate an algorithm that solves a fundamental limitation of the cross-correlation sonogram method, namely, that the time-gating operation is implemented using a replica of the measured pulse rather than the ideal delta-function-like pulse. Using a modified principal-components generalized projections algorithm, we experimentally show accurate pulse retrieval of an asymmetric double pulse, a case that is prone to systematic error when one is using the original sonogram retrieval algorithm.

CrossSim

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

Plimpton, Steven J.; Agarwal, Sapan; Schiek, Richard

2016-09-02

CrossSim is a simulator for modeling neural-inspired machine learning algorithms on analog hardware, such as resistive memory crossbars. It includes noise models for reading and updating the resistances, which can be based on idealized equations or experimental data. It can also introduce noise and finite precision effects when converting values from digital to analog and vice versa. All of these effects can be turned on or off as an algorithm processes a data set and attempts to learn its salient attributes so that it can be categorized in the machine learning training/classification context. CrossSim thus allows the robustness, accuracy, andmore » energy usage of a machine learning algorithm to be tested on simulated hardware.« less

Calculation of the angular radiance distribution for a coupled atmosphere and canopy

NASA Technical Reports Server (NTRS)

Liang, Shunlin; Strahler, Alan H.

1993-01-01

The radiative transfer equations for a coupled atmosphere and canopy are solved numerically by an improved Gauss-Seidel iteration algorithm. The radiation field is decomposed into three components: unscattered sunlight, single scattering, and multiple scattering radiance for which the corresponding equations and boundary conditions are set up and their analytical or iterational solutions are explicitly derived. The classic Gauss-Seidel algorithm has been widely applied in atmospheric research. This is its first application for calculating the multiple scattering radiance of a coupled atmosphere and canopy. This algorithm enables us to obtain the internal radiation field as well as radiances at boundaries. Any form of bidirectional reflectance distribution function (BRDF) as a boundary condition can be easily incorporated into the iteration procedure. The hotspot effect of the canopy is accommodated by means of the modification of the extinction coefficients of upward single scattering radiation and unscattered sunlight using the formulation of Nilson and Kuusk. To reduce the computation for the case of large optical thickness, an improved iteration formula is derived to speed convergence. The upwelling radiances have been evaluated for different atmospheric conditions, leaf area index (LAI), leaf angle distribution (LAD), leaf size and so on. The formulation presented in this paper is also well suited to analyze the relative magnitude of multiple scattering radiance and single scattering radiance in both the visible and near infrared regions.

A combined finite element-boundary element formulation for solution of two-dimensional problems via CGFFT

NASA Technical Reports Server (NTRS)

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

1990-01-01

A method for the computation of electromagnetic scattering from arbitrary two-dimensional bodies is presented. The method combines the finite element and boundary element methods leading to a system for solution via the conjugate gradient Fast Fourier Transform (FFT) algorithm. Two forms of boundaries aimed at reducing the storage requirement of the boundary integral are investigated. It is shown that the boundary integral becomes convolutional when a circular enclosure is chosen, resulting in reduced storage requirement when the system is solved via the conjugate gradient FFT method. The same holds for the ogival enclosure, except that some of the boundary integrals are not convolutional and must be carefully treated to maintain O(N) memory requirement. Results for several circular and ogival structures are presented and shown to be in excellent agreement with those obtained by traditional methods.

A Unified Mathematical Approach to Image Analysis.

DTIC Science & Technology

1987-08-31

describes four instances of the paradigm in detail. Directions for ongoing and future research are also indicated. Keywords: Image processing; Algorithms; Segmentation; Boundary detection; tomography; Global image analysis .

Adaptive Cross-correlation Algorithm and Experiment of Extended Scene Shack-Hartmann Wavefront Sensing

NASA Technical Reports Server (NTRS)

Sidick, Erkin; Morgan, Rhonda M.; Green, Joseph J.; Ohara, Catherine M.; Redding, David C.

2007-01-01

We have developed a new, adaptive cross-correlation (ACC) algorithm to estimate with high accuracy the shift as large as several pixels in two extended-scene images captured by a Shack-Hartmann wavefront sensor (SH-WFS). It determines the positions of all of the extended-scene image cells relative to a reference cell using an FFT-based iterative image shifting algorithm. It works with both point-source spot images as well as extended scene images. We have also set up a testbed for extended0scene SH-WFS, and tested the ACC algorithm with the measured data of both point-source and extended-scene images. In this paper we describe our algorithm and present out experimental results.

Research on fully distributed optical fiber sensing security system localization algorithm

NASA Astrophysics Data System (ADS)

Wu, Xu; Hou, Jiacheng; Liu, Kun; Liu, Tiegen

2013-12-01

A new fully distributed optical fiber sensing and location technology based on the Mach-Zehnder interferometers is studied. In this security system, a new climbing point locating algorithm based on short-time average zero-crossing rate is presented. By calculating the zero-crossing rates of the multiple grouped data separately, it not only utilizes the advantages of the frequency analysis method to determine the most effective data group more accurately, but also meets the requirement of the real-time monitoring system. Supplemented with short-term energy calculation group signal, the most effective data group can be quickly picked out. Finally, the accurate location of the climbing point can be effectively achieved through the cross-correlation localization algorithm. The experimental results show that the proposed algorithm can realize the accurate location of the climbing point and meanwhile the outside interference noise of the non-climbing behavior can be effectively filtered out.

Comparison of Methods for Determining Boundary Layer Edge Conditions for Transition Correlations

NASA Technical Reports Server (NTRS)

Liechty, Derek S.; Berry, Scott A.; Hollis, Brian R.; Horvath, Thomas J.

2003-01-01

Data previously obtained for the X-33 in the NASA Langley Research Center 20-Inch Mach 6 Air Tunnel have been reanalyzed to compare methods for determining boundary layer edge conditions for use in transition correlations. The experimental results were previously obtained utilizing the phosphor thermography technique to monitor the status of the boundary layer downstream of discrete roughness elements via global heat transfer images of the X-33 windward surface. A boundary layer transition correlation was previously developed for this data set using boundary layer edge conditions calculated using an inviscid/integral boundary layer approach. An algorithm was written in the present study to extract boundary layer edge quantities from higher fidelity viscous computational fluid dynamic solutions to develop transition correlations that account for viscous effects on vehicles of arbitrary complexity. The boundary layer transition correlation developed for the X-33 from the viscous solutions are compared to the previous boundary layer transition correlations. It is shown that the boundary layer edge conditions calculated using an inviscid/integral boundary layer approach are significantly different than those extracted from viscous computational fluid dynamic solutions. The present results demonstrate the differences obtained in correlating transition data using different computational methods.

Three-Dimensional Navier-Stokes Simulations with Two-Equation Turbulence Models of Intersecting Shock-Waves/Turbulent Boundary Layer at Mach 8.3

NASA Technical Reports Server (NTRS)

Bardina, J. E.; Coakley, T. J.

1994-01-01

An investigation of the numerical simulation with two-equation turbulence models of a three-dimensional hypersonic intersecting (SWTBL) shock-wave/turbulent boundary layer interaction flow is presented. The flows are solved with an efficient implicit upwind flux-difference split Reynolds-averaged Navier-Stokes code. Numerical results are compared with experimental data for a flow at Mach 8.28 and Reynolds number 5.3x10(exp 6) with crossing shock-waves and expansion fans generated by two lateral 15 fins located on top of a cold-wall plate. This experiment belongs to the hypersonic database for modeling validation. Simulations show the development of two primary counter-rotating cross-flow vortices and secondary turbulent structures under the main vortices and in each corner singularity inside the turbulent boundary layer. A significant loss of total pressure is produced by the complex interaction between the main vortices and the uplifted jet stream of the boundary layer. The overall agreement between computational and experimental data is generally good. The turbulence modeling corrections show improvements in the predictions of surface heat transfer distribution and an increase in the strength of the cross-flow vortices. Accurate predictions of the outflow flowfield is found to require accurate modeling of the laminar/turbulent boundary layers on the fin walls.

Prediction of the Stress-Strain Behavior of Open-Cell Aluminum Foam under Compressive Loading and the Effects of Various RVE Boundary Conditions

NASA Astrophysics Data System (ADS)

Hamidi Ghaleh Jigh, Behrang; Farsi, Mohammad Ali; Hosseini Toudeshky, Hossein

2018-05-01

The prediction of the mechanical behavior of metallic foams with realistic microstructure and the effects of various boundary conditions on the mechanical behavior is an important and challenging issue in modeling representative volume elements (RVEs). A numerical investigation is conducted to determine the effects of various boundary conditions and cell wall cross sections on the compressive mechanical properties of aluminum foam, including the stiffness, plateau stress and onset strain of densification. The open-cell AA6101-T6 aluminum foam Duocel is used in the analyses in this study. Geometrical characteristics including the cell size, foam relative density, and cross-sectional shape and thickness of the cell walls are extracted from images of the foam. Then, the obtained foam microstructure is analyzed as a 2D model. The ligaments are modeled as shear deformable beams with elastic-plastic material behavior. To prevent interpenetration of the nodes and walls inside the cells with large deformations, self-contact-type frictionless interaction is stipulated between the internal surfaces. Sensitivity analyses are performed using several boundary conditions and cells wall cross-sectional shapes. The predicted results from the finite element analyses are compared with the experimental results. Finally, the most appropriate boundary conditions, leading to more consistent results with the experimental data, are introduced.

Prediction of the Stress-Strain Behavior of Open-Cell Aluminum Foam under Compressive Loading and the Effects of Various RVE Boundary Conditions

NASA Astrophysics Data System (ADS)

Hamidi Ghaleh Jigh, Behrang; Farsi, Mohammad Ali; Hosseini Toudeshky, Hossein

2018-04-01

The prediction of the mechanical behavior of metallic foams with realistic microstructure and the effects of various boundary conditions on the mechanical behavior is an important and challenging issue in modeling representative volume elements (RVEs). A numerical investigation is conducted to determine the effects of various boundary conditions and cell wall cross sections on the compressive mechanical properties of aluminum foam, including the stiffness, plateau stress and onset strain of densification. The open-cell AA6101-T6 aluminum foam Duocel is used in the analyses in this study. Geometrical characteristics including the cell size, foam relative density, and cross-sectional shape and thickness of the cell walls are extracted from images of the foam. Then, the obtained foam microstructure is analyzed as a 2D model. The ligaments are modeled as shear deformable beams with elastic-plastic material behavior. To prevent interpenetration of the nodes and walls inside the cells with large deformations, self-contact-type frictionless interaction is stipulated between the internal surfaces. Sensitivity analyses are performed using several boundary conditions and cells wall cross-sectional shapes. The predicted results from the finite element analyses are compared with the experimental results. Finally, the most appropriate boundary conditions, leading to more consistent results with the experimental data, are introduced.

Crossing boundaries in a collaborative modeling workspace

USGS Publications Warehouse

Morisette, Jeffrey T.; Cravens, Amanda; Miller, Brian W.; Talbert, Marian; Talbert, Colin; Jarnevich, Catherine S.; Fink, Michelle; Decker, Karin; Odell, Eric

2017-01-01

There is substantial literature on the importance of bridging across disciplinary and science–management boundaries. One of the ways commonly suggested to cross boundaries is for participants from both sides of the boundary to jointly produce information (i.e., knowledge co-production). But simply providing tools or bringing people together in the same room is not sufficient. Here we present a case study documenting the mechanisms by which managers and scientists collaborated to incorporate climate change projections into Colorado’s State Wildlife Action Plan. A critical component of the project was the use of a collaborative modeling and visualization workspace: the U.S. Geological Survey’s Resource for Advanced Modeling (RAM). Using video analysis and pre/post surveys from this case study, we examine how the RAM facilitated cognitive and social processes that co-produced a more salient and credible end product. This case provides practical suggestions to scientists and practitioners who want to implement actionable science.

Playing the role of a ‘boundary organisation’: getting smarter with networking

PubMed Central

2011-01-01

Background This paper discusses the practices of organisations that cross the boundary between research and politics, to promote evidence-based policies and programmes. Methods It uses the experience of a network of organisations in Africa to describe the methodology, challenges and successes of efforts to promote utilisation of research on the inter-connections between HIV/AIDS, food security and nutrition in South Africa. It emphasises that crossing the boundary between science and politics can be done systematically and is inevitable for any attempt that seeks influence policy making. Results The paper reveals the complexity of the research-policy making interface and identifies key lessons for the practice of networking and engaging policy and decision-makers. Conclusion The concept of boundary organisation is a helpful means to understand the methodological underpinnings of efforts to get research into policy and practice and to understand the ‘messy’ process of doing so. PMID:21679378

Playing the role of a 'boundary organisation': getting smarter with networking.

PubMed

Drimie, Scott; Quinlan, Tim

2011-06-16

This paper discusses the practices of organisations that cross the boundary between research and politics, to promote evidence-based policies and programmes. It uses the experience of a network of organisations in Africa to describe the methodology, challenges and successes of efforts to promote utilisation of research on the inter-connections between HIV/AIDS, food security and nutrition in South Africa. It emphasises that crossing the boundary between science and politics can be done systematically and is inevitable for any attempt that seeks influence policy making. The paper reveals the complexity of the research-policy making interface and identifies key lessons for the practice of networking and engaging policy and decision-makers. The concept of boundary organisation is a helpful means to understand the methodological underpinnings of efforts to get research into policy and practice and to understand the 'messy' process of doing so.

Conflict in the Currents: The Cross-boundary Consequences of Larval Dispersal

NASA Astrophysics Data System (ADS)

Rising, J. A.; Ramesh, N.; Dookie, D.

2016-02-01

As commercial fish populations decline in many regions, the increasing demand for ocean resources can create conflicts along international boundaries. Because fish stock ranges do not respect political boundaries, neighboring countries can impact each other through the management of the stocks within their exclusive economic zones. By combining spawning and larvae information from the FishBase database with current velocities from ocean reanalyses using a particle tracking scheme, we construct a measure of the cross-boundary diffusion of fish larvae for 40 major exploited species. These flows represent important connections both for fish populations and for fisheries and the people who depend on them, but these connections rely on fisheries management in the 'source' countries. We then use socioeconomic data on the national importance of these fish to identify hotspots for potential conflict. Finally, we consider how ranges will shift under climate change, and the social impacts of these shifts.

Gaia Data Release 1. Cross-match with external catalogues. Algorithm and results

NASA Astrophysics Data System (ADS)

Marrese, P. M.; Marinoni, S.; Fabrizio, M.; Giuffrida, G.

2017-11-01

Context. Although the Gaia catalogue on its own will be a very powerful tool, it is the combination of this highly accurate archive with other archives that will truly open up amazing possibilities for astronomical research. The advanced interoperation of archives is based on cross-matching, leaving the user with the feeling of working with one single data archive. The data retrieval should work not only across data archives, but also across wavelength domains. The first step for seamless data access is the computation of the cross-match between Gaia and external surveys. Aims: The matching of astronomical catalogues is a complex and challenging problem both scientifically and technologically (especially when matching large surveys like Gaia). We describe the cross-match algorithm used to pre-compute the match of Gaia Data Release 1 (DR1) with a selected list of large publicly available optical and IR surveys. Methods: The overall principles of the adopted cross-match algorithm are outlined. Details are given on the developed algorithm, including the methods used to account for position errors, proper motions, and environment; to define the neighbours; and to define the figure of merit used to select the most probable counterpart. Results: Statistics on the results are also given. The results of the cross-match are part of the official Gaia DR1 catalogue.

On the Solution of Elliptic Partial Differential Equations on Regions with Corners

DTIC Science & Technology

2015-07-09

In this report we investigate the solution of boundary value problems on polygonal domains for elliptic partial differential equations . We observe...that when the problems are formulated as the boundary integral equations of classical potential theory, the solutions are representable by series of...efficient numerical algorithms. The results are illustrated by a number of numerical examples. On the solution of elliptic partial differential equations on

Evaluation of two methods for using MR information in PET reconstruction

NASA Astrophysics Data System (ADS)

Caldeira, L.; Scheins, J.; Almeida, P.; Herzog, H.

2013-02-01

Using magnetic resonance (MR) information in maximum a posteriori (MAP) algorithms for positron emission tomography (PET) image reconstruction has been investigated in the last years. Recently, three methods to introduce this information have been evaluated and the Bowsher prior was considered the best. Its main advantage is that it does not require image segmentation. Another method that has been widely used for incorporating MR information is using boundaries obtained by segmentation. This method has also shown improvements in image quality. In this paper, two methods for incorporating MR information in PET reconstruction are compared. After a Bayes parameter optimization, the reconstructed images were compared using the mean squared error (MSE) and the coefficient of variation (CV). MSE values are 3% lower in Bowsher than using boundaries. CV values are 10% lower in Bowsher than using boundaries. Both methods performed better than using no prior, that is, maximum likelihood expectation maximization (MLEM) or MAP without anatomic information in terms of MSE and CV. Concluding, incorporating MR information using the Bowsher prior gives better results in terms of MSE and CV than boundaries. MAP algorithms showed again to be effective in noise reduction and convergence, specially when MR information is incorporated. The robustness of the priors in respect to noise and inhomogeneities in the MR image has however still to be performed.

Precise determination of anthropometric dimensions by means of image processing methods for estimating human body segment parameter values.

PubMed

Baca, A

1996-04-01

A method has been developed for the precise determination of anthropometric dimensions from the video images of four different body configurations. High precision is achieved by incorporating techniques for finding the location of object boundaries with sub-pixel accuracy, the implementation of calibration algorithms, and by taking into account the varying distances of the body segments from the recording camera. The system allows automatic segment boundary identification from the video image, if the boundaries are marked on the subject by black ribbons. In connection with the mathematical finite-mass-element segment model of Hatze, body segment parameters (volumes, masses, the three principal moments of inertia, the three local coordinates of the segmental mass centers etc.) can be computed by using the anthropometric data determined videometrically as input data. Compared to other, recently published video-based systems for the estimation of the inertial properties of body segments, the present algorithms reduce errors originating from optical distortions, inaccurate edge-detection procedures, and user-specified upper and lower segment boundaries or threshold levels for the edge-detection. The video-based estimation of human body segment parameters is especially useful in situations where ease of application and rapid availability of comparatively precise parameter values are of importance.

Streamline integration as a method for two-dimensional elliptic grid generation

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

Wiesenberger, M., E-mail: Matthias.Wiesenberger@uibk.ac.at; Held, M.; Einkemmer, L.

We propose a new numerical algorithm to construct a structured numerical elliptic grid of a doubly connected domain. Our method is applicable to domains with boundaries defined by two contour lines of a two-dimensional function. Furthermore, we can adapt any analytically given boundary aligned structured grid, which specifically includes polar and Cartesian grids. The resulting coordinate lines are orthogonal to the boundary. Grid points as well as the elements of the Jacobian matrix can be computed efficiently and up to machine precision. In the simplest case we construct conformal grids, yet with the help of weight functions and monitor metricsmore » we can control the distribution of cells across the domain. Our algorithm is parallelizable and easy to implement with elementary numerical methods. We assess the quality of grids by considering both the distribution of cell sizes and the accuracy of the solution to elliptic problems. Among the tested grids these key properties are best fulfilled by the grid constructed with the monitor metric approach. - Graphical abstract: - Highlights: • Construct structured, elliptic numerical grids with elementary numerical methods. • Align coordinate lines with or make them orthogonal to the domain boundary. • Compute grid points and metric elements up to machine precision. • Control cell distribution by adaption functions or monitor metrics.« less

Exact solution of corner-modified banded block-Toeplitz eigensystems

NASA Astrophysics Data System (ADS)

Cobanera, Emilio; Alase, Abhijeet; Ortiz, Gerardo; Viola, Lorenza

2017-05-01

Motivated by the challenge of seeking a rigorous foundation for the bulk-boundary correspondence for free fermions, we introduce an algorithm for determining exactly the spectrum and a generalized-eigenvector basis of a class of banded block quasi-Toeplitz matrices that we call corner-modified. Corner modifications of otherwise arbitrary banded block-Toeplitz matrices capture the effect of boundary conditions and the associated breakdown of translational invariance. Our algorithm leverages the interplay between a non-standard, projector-based method of kernel determination (physically, a bulk-boundary separation) and families of linear representations of the algebra of matrix Laurent polynomials. Thanks to the fact that these representations act on infinite-dimensional carrier spaces in which translation symmetry is restored, it becomes possible to determine the eigensystem of an auxiliary projected block-Laurent matrix. This results in an analytic eigenvector Ansatz, independent of the system size, which we prove is guaranteed to contain the full solution of the original finite-dimensional problem. The actual solution is then obtained by imposing compatibility with a boundary matrix, whose shape is also independent of system size. As an application, we show analytically that eigenvectors of short-ranged fermionic tight-binding models may display power-law corrections to exponential behavior, and demonstrate the phenomenon for the paradigmatic Majorana chain of Kitaev.

Magnetic resonance electrical impedance tomography (MREIT): simulation study of J-substitution algorithm.

PubMed

Kwon, Ohin; Woo, Eung Je; Yoon, Jeong-Rock; Seo, Jin Keun

2002-02-01

We developed a new image reconstruction algorithm for magnetic resonance electrical impedance tomography (MREIT). MREIT is a new EIT imaging technique integrated into magnetic resonance imaging (MRI) system. Based on the assumption that internal current density distribution is obtained using magnetic resonance imaging (MRI) technique, the new image reconstruction algorithm called J-substitution algorithm produces cross-sectional static images of resistivity (or conductivity) distributions. Computer simulations show that the spatial resolution of resistivity image is comparable to that of MRI. MREIT provides accurate high-resolution cross-sectional resistivity images making resistivity values of various human tissues available for many biomedical applications.