Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs

PubMed Central

Jiang, Peng; Li, Deshi; Sun, Tao

2017-01-01

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region. PMID:28925960

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs.

PubMed

Wang, Xiaoliang; Jiang, Peng; Li, Deshi; Sun, Tao

2017-09-19

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region.

Active surface model improvement by energy function optimization for 3D segmentation.

PubMed

Azimifar, Zohreh; Mohaddesi, Mahsa

2015-04-01

This paper proposes an optimized and efficient active surface model by improving the energy functions, searching method, neighborhood definition and resampling criterion. Extracting an accurate surface of the desired object from a number of 3D images using active surface and deformable models plays an important role in computer vision especially medical image processing. Different powerful segmentation algorithms have been suggested to address the limitations associated with the model initialization, poor convergence to surface concavities and slow convergence rate. This paper proposes a method to improve one of the strongest and recent segmentation algorithms, namely the Decoupled Active Surface (DAS) method. We consider a gradient of wavelet edge extracted image and local phase coherence as external energy to extract more information from images and we use curvature integral as internal energy to focus on high curvature region extraction. Similarly, we use resampling of points and a line search for point selection to improve the accuracy of the algorithm. We further employ an estimation of the desired object as an initialization for the active surface model. A number of tests and experiments have been done and the results show the improvements with regards to the extracted surface accuracy and computational time of the presented algorithm compared with the best and recent active surface models. Copyright © 2015 Elsevier Ltd. All rights reserved.

Cortical surface registration using spherical thin-plate spline with sulcal lines and mean curvature as features.

PubMed

Park, Hyunjin; Park, Jun-Sung; Seong, Joon-Kyung; Na, Duk L; Lee, Jong-Min

2012-04-30

Analysis of cortical patterns requires accurate cortical surface registration. Many researchers map the cortical surface onto a unit sphere and perform registration of two images defined on the unit sphere. Here we have developed a novel registration framework for the cortical surface based on spherical thin-plate splines. Small-scale composition of spherical thin-plate splines was used as the geometric interpolant to avoid folding in the geometric transform. Using an automatic algorithm based on anisotropic skeletons, we extracted seven sulcal lines, which we then incorporated as landmark information. Mean curvature was chosen as an additional feature for matching between spherical maps. We employed a two-term cost function to encourage matching of both sulcal lines and the mean curvature between the spherical maps. Application of our registration framework to fifty pairwise registrations of T1-weighted MRI scans resulted in improved registration accuracy, which was computed from sulcal lines. Our registration approach was tested as an additional procedure to improve an existing surface registration algorithm. Our registration framework maintained an accurate registration over the sulcal lines while significantly increasing the cross-correlation of mean curvature between the spherical maps being registered. Copyright © 2012 Elsevier B.V. All rights reserved.

Gaussian curvature analysis allows for automatic block placement in multi-block hexahedral meshing.

PubMed

Ramme, Austin J; Shivanna, Kiran H; Magnotta, Vincent A; Grosland, Nicole M

2011-10-01

Musculoskeletal finite element analysis (FEA) has been essential to research in orthopaedic biomechanics. The generation of a volumetric mesh is often the most challenging step in a FEA. Hexahedral meshing tools that are based on a multi-block approach rely on the manual placement of building blocks for their mesh generation scheme. We hypothesise that Gaussian curvature analysis could be used to automatically develop a building block structure for multi-block hexahedral mesh generation. The Automated Building Block Algorithm incorporates principles from differential geometry, combinatorics, statistical analysis and computer science to automatically generate a building block structure to represent a given surface without prior information. We have applied this algorithm to 29 bones of varying geometries and successfully generated a usable mesh in all cases. This work represents a significant advancement in automating the definition of building blocks.

Three-dimensional contour edge detection algorithm

NASA Astrophysics Data System (ADS)

Wang, Yizhou; Ong, Sim Heng; Kassim, Ashraf A.; Foong, Kelvin W. C.

2000-06-01

This paper presents a novel algorithm for automatically extracting 3D contour edges, which are points of maximum surface curvature in a surface range image. The 3D image data are represented as a surface polygon mesh. The algorithm transforms the range data, obtained by scanning a dental plaster cast, into a 2D gray scale image by linearly converting the z-value of each vertex to a gray value. The Canny operator is applied to the median-filtered image to obtain the edge pixels and their orientations. A vertex in the 3D object corresponding to the detected edge pixel and its neighbors in the direction of the edge gradient are further analyzed with respect to their n-curvatures to extract the real 3D contour edges. This algorithm provides a fast method of reducing and sorting the unwieldy data inherent in the surface mesh representation. It employs powerful 2D algorithms to extract features from the transformed 3D models and refers to the 3D model for further analysis of selected data. This approach substantially reduces the computational burden without losing accuracy. It is also easily extended to detect 3D landmarks and other geometrical features, thus making it applicable to a wide range of applications.

Three-dimensional near-field MIMO array imaging using range migration techniques.

PubMed

Zhuge, Xiaodong; Yarovoy, Alexander G

2012-06-01

This paper presents a 3-D near-field imaging algorithm that is formulated for 2-D wideband multiple-input-multiple-output (MIMO) imaging array topology. The proposed MIMO range migration technique performs the image reconstruction procedure in the frequency-wavenumber domain. The algorithm is able to completely compensate the curvature of the wavefront in the near-field through a specifically defined interpolation process and provides extremely high computational efficiency by the application of the fast Fourier transform. The implementation aspects of the algorithm and the sampling criteria of a MIMO aperture are discussed. The image reconstruction performance and computational efficiency of the algorithm are demonstrated both with numerical simulations and measurements using 2-D MIMO arrays. Real-time 3-D near-field imaging can be achieved with a real-aperture array by applying the proposed MIMO range migration techniques.

A curvature-based weighted fuzzy c-means algorithm for point clouds de-noising

NASA Astrophysics Data System (ADS)

Cui, Xin; Li, Shipeng; Yan, Xiutian; He, Xinhua

2018-04-01

In order to remove the noise of three-dimensional scattered point cloud and smooth the data without damnify the sharp geometric feature simultaneity, a novel algorithm is proposed in this paper. The feature-preserving weight is added to fuzzy c-means algorithm which invented a curvature weighted fuzzy c-means clustering algorithm. Firstly, the large-scale outliers are removed by the statistics of r radius neighboring points. Then, the algorithm estimates the curvature of the point cloud data by using conicoid parabolic fitting method and calculates the curvature feature value. Finally, the proposed clustering algorithm is adapted to calculate the weighted cluster centers. The cluster centers are regarded as the new points. The experimental results show that this approach is efficient to different scale and intensities of noise in point cloud with a high precision, and perform a feature-preserving nature at the same time. Also it is robust enough to different noise model.

Geometrizing adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Rezakhani, Ali; Kuo, Wan-Jung; Hamma, Alioscia; Lidar, Daniel; Zanardi, Paolo

2010-03-01

A time-optimal approach to adiabatic quantum computation (AQC) is formulated. The corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. We demonstrate this geometrization through some examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance. The underlying connection with quantum phase transitions is also explored.

a Voxel-Based Filtering Algorithm for Mobile LIDAR Data

NASA Astrophysics Data System (ADS)

Qin, H.; Guan, G.; Yu, Y.; Zhong, L.

2018-04-01

This paper presents a stepwise voxel-based filtering algorithm for mobile LiDAR data. In the first step, to improve computational efficiency, mobile LiDAR points, in xy-plane, are first partitioned into a set of two-dimensional (2-D) blocks with a given block size, in each of which all laser points are further organized into an octree partition structure with a set of three-dimensional (3-D) voxels. Then, a voxel-based upward growing processing is performed to roughly separate terrain from non-terrain points with global and local terrain thresholds. In the second step, the extracted terrain points are refined by computing voxel curvatures. This voxel-based filtering algorithm is comprehensively discussed in the analyses of parameter sensitivity and overall performance. An experimental study performed on multiple point cloud samples, collected by different commercial mobile LiDAR systems, showed that the proposed algorithm provides a promising solution to terrain point extraction from mobile point clouds.

North Alabama Lightning Mapping Array (LMA): VHF Source Retrieval Algorithm and Error Analyses

NASA Technical Reports Server (NTRS)

Koshak, W. J.; Solakiewicz, R. J.; Blakeslee, R. J.; Goodman, S. J.; Christian, H. J.; Hall, J.; Bailey, J.; Krider, E. P.; Bateman, M. G.; Boccippio, D.

2003-01-01

Two approaches are used to characterize how accurately the North Alabama Lightning Mapping Array (LMA) is able to locate lightning VHF sources in space and in time. The first method uses a Monte Carlo computer simulation to estimate source retrieval errors. The simulation applies a VHF source retrieval algorithm that was recently developed at the NASA Marshall Space Flight Center (MSFC) and that is similar, but not identical to, the standard New Mexico Tech retrieval algorithm. The second method uses a purely theoretical technique (i.e., chi-squared Curvature Matrix Theory) to estimate retrieval errors. Both methods assume that the LMA system has an overall rms timing error of 50 ns, but all other possible errors (e.g., multiple sources per retrieval attempt) are neglected. The detailed spatial distributions of retrieval errors are provided. Given that the two methods are completely independent of one another, it is shown that they provide remarkably similar results. However, for many source locations, the Curvature Matrix Theory produces larger altitude error estimates than the (more realistic) Monte Carlo simulation.

RES: Regularized Stochastic BFGS Algorithm

NASA Astrophysics Data System (ADS)

Mokhtari, Aryan; Ribeiro, Alejandro

2014-12-01

RES, a regularized stochastic version of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method is proposed to solve convex optimization problems with stochastic objectives. The use of stochastic gradient descent algorithms is widespread, but the number of iterations required to approximate optimal arguments can be prohibitive in high dimensional problems. Application of second order methods, on the other hand, is impracticable because computation of objective function Hessian inverses incurs excessive computational cost. BFGS modifies gradient descent by introducing a Hessian approximation matrix computed from finite gradient differences. RES utilizes stochastic gradients in lieu of deterministic gradients for both, the determination of descent directions and the approximation of the objective function's curvature. Since stochastic gradients can be computed at manageable computational cost RES is realizable and retains the convergence rate advantages of its deterministic counterparts. Convergence results show that lower and upper bounds on the Hessian egeinvalues of the sample functions are sufficient to guarantee convergence to optimal arguments. Numerical experiments showcase reductions in convergence time relative to stochastic gradient descent algorithms and non-regularized stochastic versions of BFGS. An application of RES to the implementation of support vector machines is developed.

Computation of Laminar and Turbulent Flow in 90-Degree Square-Duct and Pipe Bends Using the Navier-Stokes Equations

DTIC Science & Technology

1982-04-01

R.M. and Warming, R.F.: An Implicit Finite - Difference Algorithm for Hyperbolic Systems in Conservation Law Form. Journal of Computational Physics...Quincy Street C-40) Arlington, VA 22217 D 82 05-.10 I0, S4CURITY CLASSIFICATION OF THIS ’E(Wha, Doae Entotwed) Slength scale. Six different flow cases...forces upstream have produced a non-zero velocity gradient normal to the plane of curvature. Fluid with above (/below) average nioiiiei.tuili migrates

Multiscale registration algorithm for alignment of meshes

NASA Astrophysics Data System (ADS)

Vadde, Srikanth; Kamarthi, Sagar V.; Gupta, Surendra M.

2004-03-01

Taking a multi-resolution approach, this research work proposes an effective algorithm for aligning a pair of scans obtained by scanning an object's surface from two adjacent views. This algorithm first encases each scan in the pair with an array of cubes of equal and fixed size. For each scan in the pair a surrogate scan is created by the centroids of the cubes that encase the scan. The Gaussian curvatures of points across the surrogate scan pair are compared to find the surrogate corresponding points. If the difference between the Gaussian curvatures of any two points on the surrogate scan pair is less than a predetermined threshold, then those two points are accepted as a pair of surrogate corresponding points. The rotation and translation values between the surrogate scan pair are determined by using a set of surrogate corresponding points. Using the same rotation and translation values the original scan pairs are aligned. The resulting registration (or alignment) error is computed to check the accuracy of the scan alignment. When the registration error becomes acceptably small, the algorithm is terminated. Otherwise the above process is continued with cubes of smaller and smaller sizes until the algorithm is terminated. However at each finer resolution the search space for finding the surrogate corresponding points is restricted to the regions in the neighborhood of the surrogate points that were at found at the preceding coarser level. The surrogate corresponding points, as the resolution becomes finer and finer, converge to the true corresponding points on the original scans. This approach offers three main benefits: it improves the chances of finding the true corresponding points on the scans, minimize the adverse effects of noise in the scans, and reduce the computational load for finding the corresponding points.

A novel curvature-controllable steerable needle for percutaneous intervention.

PubMed

Bui, Van Khuyen; Park, Sukho; Park, Jong-Oh; Ko, Seong Young

2016-08-01

Over the last few decades, flexible steerable robotic needles for percutaneous intervention have been the subject of significant interest. However, there still remain issues related to (a) steering the needle's direction with less damage to surrounding tissues and (b) increasing the needle's maximum curvature for better controllability. One widely used approach is to control the fixed-angled bevel-tip needle using a "duty-cycle" algorithm. While this algorithm has shown its applicability, it can potentially damage surrounding tissue, which has prevented the widespread adoption of this technology. This situation has motivated the development of a new steerable flexible needle that can change its curvature without axial rotation, while at the same time producing a larger curvature. In this article, we propose a novel curvature-controllable steerable needle. The proposed robotic needle consists of two parts: a cannula and a stylet with a bevel-tip. The curvature of the needle's path is controlled by a control offset, defined by the offset between the bevel-tip and the cannula. As a result, the necessity of rotating the whole needle's body is decreased. The duty-cycle algorithm is utilized to a limited degree to obtain a larger radius of curvature, which is similar to a straight path. The first prototype of 0.46 mm (outer diameter) was fabricated and tested with both in vitro gelatin phantom and ex vivo cow liver tissue. The maximum curvatures measured 0.008 mm(-1) in 6 wt% gelatin phantom, 0.0139 mm(-1) in 10 wt% gelatin phantom, and 0.0038 mm(-1) in cow liver. The experimental results show a linear relationship between the curvature and the control offset, which can be utilized for future implementation of this control algorithm. © IMechE 2016.

Surface Curvatures Computation from Equidistance Contours

NASA Astrophysics Data System (ADS)

Tanaka, Hiromi T.; Kling, Olivier; Lee, Daniel T. L.

1990-03-01

The subject of our research is on the 3D shape representation problem for a special class of range image, one where the natural mode of the acquired range data is in the form of equidistance contours, as exemplified by a moire interferometry range system. In this paper we present a novel surface curvature computation scheme that directly computes the surface curvatures (the principal curvatures, Gaussian curvature and mean curvature) from the equidistance contours without any explicit computations or implicit estimates of partial derivatives. We show how the special nature of the equidistance contours, specifically, the dense information of the surface curves in the 2D contour plane, turns into an advantage for the computation of the surface curvatures. The approach is based on using simple geometric construction to obtain the normal sections and the normal curvatures. This method is general and can be extended to any dense range image data. We show in details how this computation is formulated and give an analysis on the error bounds of the computation steps showing that the method is stable. Computation results on real equidistance range contours are also shown.

Automated measurement of human body shape and curvature using computer vision

NASA Astrophysics Data System (ADS)

Pearson, Jeremy D.; Hobson, Clifford A.; Dangerfield, Peter H.

1993-06-01

A system to measure the surface shape of the human body has been constructed. The system uses a fringe pattern generated by projection of multi-stripe structured light. The optical methodology used is fully described and the algorithms used to process acquired digital images are outlined. The system has been applied to the measurement of the shape of the human back in scoliosis.

Automatic human body modeling for vision-based motion capture system using B-spline parameterization of the silhouette

NASA Astrophysics Data System (ADS)

Jaume-i-Capó, Antoni; Varona, Javier; González-Hidalgo, Manuel; Mas, Ramon; Perales, Francisco J.

2012-02-01

Human motion capture has a wide variety of applications, and in vision-based motion capture systems a major issue is the human body model and its initialization. We present a computer vision algorithm for building a human body model skeleton in an automatic way. The algorithm is based on the analysis of the human shape. We decompose the body into its main parts by computing the curvature of a B-spline parameterization of the human contour. This algorithm has been applied in a context where the user is standing in front of a camera stereo pair. The process is completed after the user assumes a predefined initial posture so as to identify the main joints and construct the human model. Using this model, the initialization problem of a vision-based markerless motion capture system of the human body is solved.

Quantum Adiabatic Brachistochrone

NASA Astrophysics Data System (ADS)

Rezakhani, A. T.; Kuo, W.-J.; Hamma, A.; Lidar, D. A.; Zanardi, P.

2009-08-01

We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. This geometrization of AQC is demonstrated through two examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance.

Quantum adiabatic brachistochrone.

PubMed

Rezakhani, A T; Kuo, W-J; Hamma, A; Lidar, D A; Zanardi, P

2009-08-21

We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. This geometrization of AQC is demonstrated through two examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance.

The elastic ratio: introducing curvature into ratio-based image segmentation.

PubMed

Schoenemann, Thomas; Masnou, Simon; Cremers, Daniel

2011-09-01

We present the first ratio-based image segmentation method that allows imposing curvature regularity of the region boundary. Our approach is a generalization of the ratio framework pioneered by Jermyn and Ishikawa so as to allow penalty functions that take into account the local curvature of the curve. The key idea is to cast the segmentation problem as one of finding cyclic paths of minimal ratio in a graph where each graph node represents a line segment. Among ratios whose discrete counterparts can be globally minimized with our approach, we focus in particular on the elastic ratio [Formula: see text] that depends, given an image I, on the oriented boundary C of the segmented region candidate. Minimizing this ratio amounts to finding a curve, neither small nor too curvy, through which the brightness flux is maximal. We prove the existence of minimizers for this criterion among continuous curves with mild regularity assumptions. We also prove that the discrete minimizers provided by our graph-based algorithm converge, as the resolution increases, to continuous minimizers. In contrast to most existing segmentation methods with computable and meaningful, i.e., nondegenerate, global optima, the proposed approach is fully unsupervised in the sense that it does not require any kind of user input such as seed nodes. Numerical experiments demonstrate that curvature regularity allows substantial improvement of the quality of segmentations. Furthermore, our results allow drawing conclusions about global optima of a parameterization-independent version of the snakes functional: the proposed algorithm allows determining parameter values where the functional has a meaningful solution and simultaneously provides the corresponding global solution.

Curvature correction of retinal OCTs using graph-based geometry detection

NASA Astrophysics Data System (ADS)

Kafieh, Raheleh; Rabbani, Hossein; Abramoff, Michael D.; Sonka, Milan

2013-05-01

In this paper, we present a new algorithm as an enhancement and preprocessing step for acquired optical coherence tomography (OCT) images of the retina. The proposed method is composed of two steps, first of which is a denoising algorithm with wavelet diffusion based on a circular symmetric Laplacian model, and the second part can be described in terms of graph-based geometry detection and curvature correction according to the hyper-reflective complex layer in the retina. The proposed denoising algorithm showed an improvement of contrast-to-noise ratio from 0.89 to 1.49 and an increase of signal-to-noise ratio (OCT image SNR) from 18.27 to 30.43 dB. By applying the proposed method for estimation of the interpolated curve using a full automatic method, the mean ± SD unsigned border positioning error was calculated for normal and abnormal cases. The error values of 2.19 ± 1.25 and 8.53 ± 3.76 µm were detected for 200 randomly selected slices without pathological curvature and 50 randomly selected slices with pathological curvature, respectively. The important aspect of this algorithm is its ability in detection of curvature in strongly pathological images that surpasses previously introduced methods; the method is also fast, compared to the relatively low speed of similar methods.

Auction dynamics: A volume constrained MBO scheme

NASA Astrophysics Data System (ADS)

Jacobs, Matt; Merkurjev, Ekaterina; Esedoǧlu, Selim

2018-02-01

We show how auction algorithms, originally developed for the assignment problem, can be utilized in Merriman, Bence, and Osher's threshold dynamics scheme to simulate multi-phase motion by mean curvature in the presence of equality and inequality volume constraints on the individual phases. The resulting algorithms are highly efficient and robust, and can be used in simulations ranging from minimal partition problems in Euclidean space to semi-supervised machine learning via clustering on graphs. In the case of the latter application, numerous experimental results on benchmark machine learning datasets show that our approach exceeds the performance of current state-of-the-art methods, while requiring a fraction of the computation time.

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

Chiang, Nai-Yuan; Zavala, Victor M.

We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection viamore » symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.« less

A method of 3D object recognition and localization in a cloud of points

NASA Astrophysics Data System (ADS)

Bielicki, Jerzy; Sitnik, Robert

2013-12-01

The proposed method given in this article is prepared for analysis of data in the form of cloud of points directly from 3D measurements. It is designed for use in the end-user applications that can directly be integrated with 3D scanning software. The method utilizes locally calculated feature vectors (FVs) in point cloud data. Recognition is based on comparison of the analyzed scene with reference object library. A global descriptor in the form of a set of spatially distributed FVs is created for each reference model. During the detection process, correlation of subsets of reference FVs with FVs calculated in the scene is computed. Features utilized in the algorithm are based on parameters, which qualitatively estimate mean and Gaussian curvatures. Replacement of differentiation with averaging in the curvatures estimation makes the algorithm more resistant to discontinuities and poor quality of the input data. Utilization of the FV subsets allows to detect partially occluded and cluttered objects in the scene, while additional spatial information maintains false positive rate at a reasonably low level.

Improved computer-aided detection of small polyps in CT colonography using interpolation for curvature estimationa

PubMed Central

Liu, Jiamin; Kabadi, Suraj; Van Uitert, Robert; Petrick, Nicholas; Deriche, Rachid; Summers, Ronald M.

2011-01-01

Purpose: Surface curvatures are important geometric features for the computer-aided analysis and detection of polyps in CT colonography (CTC). However, the general kernel approach for curvature computation can yield erroneous results for small polyps and for polyps that lie on haustral folds. Those erroneous curvatures will reduce the performance of polyp detection. This paper presents an analysis of interpolation’s effect on curvature estimation for thin structures and its application on computer-aided detection of small polyps in CTC. Methods: The authors demonstrated that a simple technique, image interpolation, can improve the accuracy of curvature estimation for thin structures and thus significantly improve the sensitivity of small polyp detection in CTC. Results: Our experiments showed that the merits of interpolating included more accurate curvature values for simulated data, and isolation of polyps near folds for clinical data. After testing on a large clinical data set, it was observed that sensitivities with linear, quadratic B-spline and cubic B-spline interpolations significantly improved the sensitivity for small polyp detection. Conclusions: The image interpolation can improve the accuracy of curvature estimation for thin structures and thus improve the computer-aided detection of small polyps in CTC. PMID:21859029

Conformally Invariant Powers of the Laplacian, Q-Curvature, and Tractor Calculus

NASA Astrophysics Data System (ADS)

Gover, A. Rod; Peterson, Lawrence J.

We describe an elementary algorithm for expressing, as explicit formulae in tractor calculus, the conformally invariant GJMS operators due to C.R. Graham et alia. These differential operators have leading part a power of the Laplacian. Conformal tractor calculus is the natural induced bundle calculus associated to the conformal Cartan connection. Applications discussed include standard formulae for these operators in terms of the Levi-Civita connection and its curvature and a direct definition and formula for T. Branson's so-called Q-curvature (which integrates to a global conformal invariant) as well as generalisations of the operators and the Q-curvature. Among examples, the operators of order 4, 6 and 8 and the related Q-curvatures are treated explicitly. The algorithm exploits the ambient metric construction of Fefferman and Graham and includes a procedure for converting the ambient curvature and its covariant derivatives into tractor calculus expressions. This is partly based on [12], where the relationship of the normal standard tractor bundle to the ambient construction is described.

Geometrical characterization of fluorescently labelled surfaces from noisy 3D microscopy data.

PubMed

Shelton, Elijah; Serwane, Friedhelm; Campàs, Otger

2018-03-01

Modern fluorescence microscopy enables fast 3D imaging of biological and inert systems alike. In many studies, it is important to detect the surface of objects and quantitatively characterize its local geometry, including its mean curvature. We present a fully automated algorithm to determine the location and curvatures of an object from 3D fluorescence images, such as those obtained using confocal or light-sheet microscopy. The algorithm aims at reconstructing surface labelled objects with spherical topology and mild deformations from the spherical geometry with high accuracy, rather than reconstructing arbitrarily deformed objects with lower fidelity. Using both synthetic data with known geometrical characteristics and experimental data of spherical objects, we characterize the algorithm's accuracy over the range of conditions and parameters typically encountered in 3D fluorescence imaging. We show that the algorithm can detect the location of the surface and obtain a map of local mean curvatures with relative errors typically below 2% and 20%, respectively, even in the presence of substantial levels of noise. Finally, we apply this algorithm to analyse the shape and curvature map of fluorescently labelled oil droplets embedded within multicellular aggregates and deformed by cellular forces. © 2017 The Authors Journal of Microscopy © 2017 Royal Microscopical Society.

Computational segmentation of collagen fibers from second-harmonic generation images of breast cancer

NASA Astrophysics Data System (ADS)

Bredfeldt, Jeremy S.; Liu, Yuming; Pehlke, Carolyn A.; Conklin, Matthew W.; Szulczewski, Joseph M.; Inman, David R.; Keely, Patricia J.; Nowak, Robert D.; Mackie, Thomas R.; Eliceiri, Kevin W.

2014-01-01

Second-harmonic generation (SHG) imaging can help reveal interactions between collagen fibers and cancer cells. Quantitative analysis of SHG images of collagen fibers is challenged by the heterogeneity of collagen structures and low signal-to-noise ratio often found while imaging collagen in tissue. The role of collagen in breast cancer progression can be assessed post acquisition via enhanced computation. To facilitate this, we have implemented and evaluated four algorithms for extracting fiber information, such as number, length, and curvature, from a variety of SHG images of collagen in breast tissue. The image-processing algorithms included a Gaussian filter, SPIRAL-TV filter, Tubeness filter, and curvelet-denoising filter. Fibers are then extracted using an automated tracking algorithm called fiber extraction (FIRE). We evaluated the algorithm performance by comparing length, angle and position of the automatically extracted fibers with those of manually extracted fibers in twenty-five SHG images of breast cancer. We found that the curvelet-denoising filter followed by FIRE, a process we call CT-FIRE, outperforms the other algorithms under investigation. CT-FIRE was then successfully applied to track collagen fiber shape changes over time in an in vivo mouse model for breast cancer.

Local curvature analysis for classifying breast tumors: Preliminary analysis in dedicated breast CT

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

Lee, Juhun, E-mail: leej15@upmc.edu; Nishikawa, Robert M.; Reiser, Ingrid

2015-09-15

Purpose: The purpose of this study is to measure the effectiveness of local curvature measures as novel image features for classifying breast tumors. Methods: A total of 119 breast lesions from 104 noncontrast dedicated breast computed tomography images of women were used in this study. Volumetric segmentation was done using a seed-based segmentation algorithm and then a triangulated surface was extracted from the resulting segmentation. Total, mean, and Gaussian curvatures were then computed. Normalized curvatures were used as classification features. In addition, traditional image features were also extracted and a forward feature selection scheme was used to select the optimalmore » feature set. Logistic regression was used as a classifier and leave-one-out cross-validation was utilized to evaluate the classification performances of the features. The area under the receiver operating characteristic curve (AUC, area under curve) was used as a figure of merit. Results: Among curvature measures, the normalized total curvature (C{sub T}) showed the best classification performance (AUC of 0.74), while the others showed no classification power individually. Five traditional image features (two shape, two margin, and one texture descriptors) were selected via the feature selection scheme and its resulting classifier achieved an AUC of 0.83. Among those five features, the radial gradient index (RGI), which is a margin descriptor, showed the best classification performance (AUC of 0.73). A classifier combining RGI and C{sub T} yielded an AUC of 0.81, which showed similar performance (i.e., no statistically significant difference) to the classifier with the above five traditional image features. Additional comparisons in AUC values between classifiers using different combinations of traditional image features and C{sub T} were conducted. The results showed that C{sub T} was able to replace the other four image features for the classification task. Conclusions: The normalized curvature measure contains useful information in classifying breast tumors. Using this, one can reduce the number of features in a classifier, which may result in more robust classifiers for different datasets.« less

Curvature of blended rolled edge reflectors at the shadow boundary contour

NASA Technical Reports Server (NTRS)

Ellingson, S. W.

1988-01-01

A technique is advanced for computing the radius of curvature of blended rolled edge reflector surfaces at the shadow boundary, in the plane perpendicular to the shadow boundary contour. This curvature must be known in order to compute the spurious endpoint contributions in the physical optics (PO) solution for the scattering from reflectors with rolled edges. The technique is applicable to reflectors with radially-defined rim-shapes and rolled edge terminations. The radius of curvature for several basic reflector systems is computed, and it is shown that this curvature can vary greatly along the shadow boundary contour. Finally, the total PO field in the target zone of a sample compact range system is computed and corrected using the shadow boundary radius of curvature, obtained using the technique. It is shown that the fields obtained are a better approximation to the true scattered fields.

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

NASA Technical Reports Server (NTRS)

Kenwright, David; Lane, David

1995-01-01

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

A Numerical Study of the Effects of Curvature and Convergence on Dilution Jet Mixing

NASA Technical Reports Server (NTRS)

Holdeman, J. D.; Reynolds, R.; White, C.

1987-01-01

An analytical program was conducted to assemble and assess a three-dimensional turbulent viscous flow computer code capable of analyzing the flow field in the transition liners of small gas turbine engines. This code is of the TEACH type with hybrid numerics, and uses the power law and SIMPLER algorithms, an orthogonal curvilinear coordinate system, and an algebraic Reynolds stress turbulence model. The assessments performed in this study, consistent with results in the literature, showed that in its present form this code is capable of predicting trends and qualitative results. The assembled code was used to perform a numerical experiment to investigate the effects of curvature and convergence in the transition liner on the mixing of single and opposed rows of cool dilution jets injected into a hot mainstream flow.

A numerical study of the effects of curvature and convergence on dilution jet mixing

NASA Technical Reports Server (NTRS)

Holdeman, J. D.; Reynolds, R.; White, C.

1987-01-01

An analytical program was conducted to assemble and assess a three-dimensional turbulent viscous flow computer code capable of analyzing the flow field in the transition liners of small gas turbine engines. This code is of the TEACH type with hybrid numerics, and uses the power law and SIMPLER algorithms, an orthogonal curvilinear coordinate system, and an algebraic Reynolds stress turbulence model. The assessments performed in this study, consistent with results in the literature, showed that in its present form this code is capable of predicting trends and qualitative results. The assembled code was used to perform a numerical experiment to investigate the effects of curvature and convergence in the transition liner on the mixing of single and opposed rows of cool dilution jets injected into a hot mainstream flow.

An improved non-uniformity correction algorithm and its GPU parallel implementation

NASA Astrophysics Data System (ADS)

Cheng, Kuanhong; Zhou, Huixin; Qin, Hanlin; Zhao, Dong; Qian, Kun; Rong, Shenghui

2018-05-01

The performance of SLP-THP based non-uniformity correction algorithm is seriously affected by the result of SLP filter, which always leads to image blurring and ghosting artifacts. To address this problem, an improved SLP-THP based non-uniformity correction method with curvature constraint was proposed. Here we put forward a new way to estimate spatial low frequency component. First, the details and contours of input image were obtained respectively by minimizing local Gaussian curvature and mean curvature of image surface. Then, the guided filter was utilized to combine these two parts together to get the estimate of spatial low frequency component. Finally, we brought this SLP component into SLP-THP method to achieve non-uniformity correction. The performance of proposed algorithm was verified by several real and simulated infrared image sequences. The experimental results indicated that the proposed algorithm can reduce the non-uniformity without detail losing. After that, a GPU based parallel implementation that runs 150 times faster than CPU was presented, which showed the proposed algorithm has great potential for real time application.

The Relationship Between Surface Curvature and Abdominal Aortic Aneurysm Wall Stress.

PubMed

de Galarreta, Sergio Ruiz; Cazón, Aitor; Antón, Raúl; Finol, Ender A

2017-08-01

The maximum diameter (MD) criterion is the most important factor when predicting risk of rupture of abdominal aortic aneurysms (AAAs). An elevated wall stress has also been linked to a high risk of aneurysm rupture, yet is an uncommon clinical practice to compute AAA wall stress. The purpose of this study is to assess whether other characteristics of the AAA geometry are statistically correlated with wall stress. Using in-house segmentation and meshing algorithms, 30 patient-specific AAA models were generated for finite element analysis (FEA). These models were subsequently used to estimate wall stress and maximum diameter and to evaluate the spatial distributions of wall thickness, cross-sectional diameter, mean curvature, and Gaussian curvature. Data analysis consisted of statistical correlations of the aforementioned geometry metrics with wall stress for the 30 AAA inner and outer wall surfaces. In addition, a linear regression analysis was performed with all the AAA wall surfaces to quantify the relationship of the geometric indices with wall stress. These analyses indicated that while all the geometry metrics have statistically significant correlations with wall stress, the local mean curvature (LMC) exhibits the highest average Pearson's correlation coefficient for both inner and outer wall surfaces. The linear regression analysis revealed coefficients of determination for the outer and inner wall surfaces of 0.712 and 0.516, respectively, with LMC having the largest effect on the linear regression equation with wall stress. This work underscores the importance of evaluating AAA mean wall curvature as a potential surrogate for wall stress.

Blindness to Curvature and Blindness to Illusory Curvature.

PubMed

Bertamini, Marco; Kitaoka, Akiyoshi

2018-01-01

We compare two versions of two known phenomena, the Curvature blindness and the Kite mesh illusions, to highlight how similar manipulations lead to blindness to curvature and blindness to illusory curvature, respectively. The critical factor is a change in luminance polarity; this factor interferes with the computation of curvature along the contour, for both real and illusory curvature.

Graph cuts for curvature based image denoising.

PubMed

Bae, Egil; Shi, Juan; Tai, Xue-Cheng

2011-05-01

Minimization of total variation (TV) is a well-known method for image denoising. Recently, the relationship between TV minimization problems and binary MRF models has been much explored. This has resulted in some very efficient combinatorial optimization algorithms for the TV minimization problem in the discrete setting via graph cuts. To overcome limitations, such as staircasing effects, of the relatively simple TV model, variational models based upon higher order derivatives have been proposed. The Euler's elastica model is one such higher order model of central importance, which minimizes the curvature of all level lines in the image. Traditional numerical methods for minimizing the energy in such higher order models are complicated and computationally complex. In this paper, we will present an efficient minimization algorithm based upon graph cuts for minimizing the energy in the Euler's elastica model, by simplifying the problem to that of solving a sequence of easy graph representable problems. This sequence has connections to the gradient flow of the energy function, and converges to a minimum point. The numerical experiments show that our new approach is more effective in maintaining smooth visual results while preserving sharp features better than TV models.

Computationally efficient real-time interpolation algorithm for non-uniform sampled biosignals

PubMed Central

Eftekhar, Amir; Kindt, Wilko; Constandinou, Timothy G.

2016-01-01

This Letter presents a novel, computationally efficient interpolation method that has been optimised for use in electrocardiogram baseline drift removal. In the authors’ previous Letter three isoelectric baseline points per heartbeat are detected, and here utilised as interpolation points. As an extension from linear interpolation, their algorithm segments the interpolation interval and utilises different piecewise linear equations. Thus, the algorithm produces a linear curvature that is computationally efficient while interpolating non-uniform samples. The proposed algorithm is tested using sinusoids with different fundamental frequencies from 0.05 to 0.7 Hz and also validated with real baseline wander data acquired from the Massachusetts Institute of Technology University and Boston's Beth Israel Hospital (MIT-BIH) Noise Stress Database. The synthetic data results show an root mean square (RMS) error of 0.9 μV (mean), 0.63 μV (median) and 0.6 μV (standard deviation) per heartbeat on a 1 mVp–p 0.1 Hz sinusoid. On real data, they obtain an RMS error of 10.9 μV (mean), 8.5 μV (median) and 9.0 μV (standard deviation) per heartbeat. Cubic spline interpolation and linear interpolation on the other hand shows 10.7 μV, 11.6 μV (mean), 7.8 μV, 8.9 μV (median) and 9.8 μV, 9.3 μV (standard deviation) per heartbeat. PMID:27382478

Computationally efficient real-time interpolation algorithm for non-uniform sampled biosignals.

PubMed

Guven, Onur; Eftekhar, Amir; Kindt, Wilko; Constandinou, Timothy G

2016-06-01

This Letter presents a novel, computationally efficient interpolation method that has been optimised for use in electrocardiogram baseline drift removal. In the authors' previous Letter three isoelectric baseline points per heartbeat are detected, and here utilised as interpolation points. As an extension from linear interpolation, their algorithm segments the interpolation interval and utilises different piecewise linear equations. Thus, the algorithm produces a linear curvature that is computationally efficient while interpolating non-uniform samples. The proposed algorithm is tested using sinusoids with different fundamental frequencies from 0.05 to 0.7 Hz and also validated with real baseline wander data acquired from the Massachusetts Institute of Technology University and Boston's Beth Israel Hospital (MIT-BIH) Noise Stress Database. The synthetic data results show an root mean square (RMS) error of 0.9 μV (mean), 0.63 μV (median) and 0.6 μV (standard deviation) per heartbeat on a 1 mVp-p 0.1 Hz sinusoid. On real data, they obtain an RMS error of 10.9 μV (mean), 8.5 μV (median) and 9.0 μV (standard deviation) per heartbeat. Cubic spline interpolation and linear interpolation on the other hand shows 10.7 μV, 11.6 μV (mean), 7.8 μV, 8.9 μV (median) and 9.8 μV, 9.3 μV (standard deviation) per heartbeat.

Efficient seeding and defragmentation of curvature streamlines for colonic polyp detection

NASA Astrophysics Data System (ADS)

Zhao, Lingxiao; Botha, Charl P.; Truyen, Roel; Vos, Frans M.; Post, Frits H.

2008-03-01

Many computer aided diagnosis (CAD) schemes have been developed for colon cancer detection using Virtual Colonoscopy (VC). In earlier work, we developed an automatic polyp detection method integrating flow visualization techniques, that forms part of the CAD functionality of an existing Virtual Colonoscopy pipeline. Curvature streamlines were used to characterize polyp surface shape. Features derived from curvature streamlines correlated highly with true polyp detections. During testing with a large number of patient data sets, we found that the correlation between streamline features and true polyps could be affected by noise and our streamline generation technique. The seeding and spacing constraints and CT noise could lead to streamline fragmentation, which reduced the discriminating power of our streamline features. In this paper, we present two major improvements of our curvature streamline generation. First, we adapted our streamline seeding strategy to the local surface properties and made the streamline generation faster. It generates a significantly smaller number of seeds but still results in a comparable and suitable streamline distribution. Second, based on our observation that longer streamlines are better surface shape descriptors, we improved our streamline tracing algorithm to produce longer streamlines. Our improved techniques are more effcient and also guide the streamline geometry to correspond better to colonic surface shape. These two adaptations support a robust and high correlation between our streamline features and true positive detections and lead to better polyp detection results.

Plant Growth Biophysics: the Basis for Growth Asymmetry Induced by Gravity

NASA Technical Reports Server (NTRS)

Cosgrove, D.

1985-01-01

The identification and quantification of the physical properties altered by gravity when plant stems grow upward was studied. Growth of the stem in vertical and horizontal positions was recorded by time lapse photography. A computer program that uses a cubic spline fitting algorithm was used to calculate the growth rate and curvature of the stem as a function of time. Plant stems were tested to ascertain whether cell osmotic pressure was altered by gravity. A technique for measuring the yielding properties of the cell wall was developed.

Analysis of electrodes' placement and deformation in deep brain stimulation from medical images

NASA Astrophysics Data System (ADS)

Mehri, Maroua; Lalys, Florent; Maumet, Camille; Haegelen, Claire; Jannin, Pierre

2012-02-01

Deep brain stimulation (DBS) is used to reduce the motor symptoms such as rigidity or bradykinesia, in patients with Parkinson's disease (PD). The Subthalamic Nucleus (STN) has emerged as prime target of DBS in idiopathic PD. However, DBS surgery is a difficult procedure requiring the exact positioning of electrodes in the pre-operative selected targets. This positioning is usually planned using patients' pre-operative images, along with digital atlases, assuming that electrode's trajectory is linear. However, it has been demonstrated that anatomical brain deformations induce electrode's deformations resulting in errors in the intra-operative targeting stage. In order to meet the need of a higher degree of placement accuracy and to help constructing a computer-aided-placement tool, we studied the electrodes' deformation in regards to patients' clinical data (i.e., sex, mean PD duration and brain atrophy index). Firstly, we presented an automatic algorithm for the segmentation of electrode's axis from post-operative CT images, which aims to localize the electrodes' stimulated contacts. To assess our method, we applied our algorithm on 25 patients who had undergone bilateral STNDBS. We found a placement error of 0.91+/-0.38 mm. Then, from the segmented axis, we quantitatively analyzed the electrodes' curvature and correlated it with patients' clinical data. We found a positive significant correlation between mean curvature index of the electrode and brain atrophy index for male patients and between mean curvature index of the electrode and mean PD duration for female patients. These results help understanding DBS electrode' deformations and would help ensuring better anticipation of electrodes' placement.

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

Slattery, Stuart R.

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothnessmore » and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.« less

Comparative analysis of two discretizations of Ricci curvature for complex networks.

PubMed

Samal, Areejit; Sreejith, R P; Gu, Jiao; Liu, Shiping; Saucan, Emil; Jost, Jürgen

2018-06-05

We have performed an empirical comparison of two distinct notions of discrete Ricci curvature for graphs or networks, namely, the Forman-Ricci curvature and Ollivier-Ricci curvature. Importantly, these two discretizations of the Ricci curvature were developed based on different properties of the classical smooth notion, and thus, the two notions shed light on different aspects of network structure and behavior. Nevertheless, our extensive computational analysis in a wide range of both model and real-world networks shows that the two discretizations of Ricci curvature are highly correlated in many networks. Moreover, we show that if one considers the augmented Forman-Ricci curvature which also accounts for the two-dimensional simplicial complexes arising in graphs, the observed correlation between the two discretizations is even higher, especially, in real networks. Besides the potential theoretical implications of these observations, the close relationship between the two discretizations has practical implications whereby Forman-Ricci curvature can be employed in place of Ollivier-Ricci curvature for faster computation in larger real-world networks whenever coarse analysis suffices.

Stable and unstable roots of ion temperature gradient driven mode using curvature modified plasma dispersion functions

NASA Astrophysics Data System (ADS)

Gültekin, Ö.; Gürcan, Ö. D.

2018-02-01

Basic, local kinetic theory of ion temperature gradient driven (ITG) mode, with adiabatic electrons is reconsidered. Standard unstable, purely oscillating as well as damped solutions of the local dispersion relation are obtained using a bracketing technique that uses the argument principle. This method requires computing the plasma dielectric function and its derivatives, which are implemented here using modified plasma dispersion functions with curvature and their derivatives, and allows bracketing/following the zeros of the plasma dielectric function which corresponds to different roots of the ITG dispersion relation. We provide an open source implementation of the derivatives of modified plasma dispersion functions with curvature, which are used in this formulation. Studying the local ITG dispersion, we find that near the threshold of instability the unstable branch is rather asymmetric with oscillating solutions towards lower wave numbers (i.e. drift waves), and damped solutions toward higher wave numbers. This suggests a process akin to inverse cascade by coupling to the oscillating branch towards lower wave numbers may play a role in the nonlinear evolution of the ITG, near the instability threshold. Also, using the algorithm, the linear wave diffusion is estimated for the marginally stable ITG mode.

Robust feature detection and local classification for surfaces based on moment analysis.

PubMed

Clarenz, Ulrich; Rumpf, Martin; Telea, Alexandru

2004-01-01

The stable local classification of discrete surfaces with respect to features such as edges and corners or concave and convex regions, respectively, is as quite difficult as well as indispensable for many surface processing applications. Usually, the feature detection is done via a local curvature analysis. If concerned with large triangular and irregular grids, e.g., generated via a marching cube algorithm, the detectors are tedious to treat and a robust classification is hard to achieve. Here, a local classification method on surfaces is presented which avoids the evaluation of discretized curvature quantities. Moreover, it provides an indicator for smoothness of a given discrete surface and comes together with a built-in multiscale. The proposed classification tool is based on local zero and first moments on the discrete surface. The corresponding integral quantities are stable to compute and they give less noisy results compared to discrete curvature quantities. The stencil width for the integration of the moments turns out to be the scale parameter. Prospective surface processing applications are the segmentation on surfaces, surface comparison, and matching and surface modeling. Here, a method for feature preserving fairing of surfaces is discussed to underline the applicability of the presented approach.

CALCLENS: Weak lensing simulations for large-area sky surveys and second-order effects in cosmic shear power spectra

NASA Astrophysics Data System (ADS)

Becker, Matthew Rand

I present a new algorithm, CALCLENS, for efficiently computing weak gravitational lensing shear signals from large N-body light cone simulations over a curved sky. This new algorithm properly accounts for the sky curvature and boundary conditions, is able to produce redshift- dependent shear signals including corrections to the Born approximation by using multiple- plane ray tracing, and properly computes the lensed images of source galaxies in the light cone. The key feature of this algorithm is a new, computationally efficient Poisson solver for the sphere that combines spherical harmonic transform and multigrid methods. As a result, large areas of sky (~10,000 square degrees) can be ray traced efficiently at high-resolution using only a few hundred cores. Using this new algorithm and curved-sky calculations that only use a slower but more accurate spherical harmonic transform Poisson solver, I study the convergence, shear E-mode, shear B-mode and rotation mode power spectra. Employing full-sky E/B-mode decompositions, I confirm that the numerically computed shear B-mode and rotation mode power spectra are equal at high accuracy ( ≲ 1%) as expected from perturbation theory up to second order. Coupled with realistic galaxy populations placed in large N-body light cone simulations, this new algorithm is ideally suited for the construction of synthetic weak lensing shear catalogs to be used to test for systematic effects in data analysis procedures for upcoming large-area sky surveys. The implementation presented in this work, written in C and employing widely available software libraries to maintain portability, is publicly available at http://code.google.com/p/calclens.

CALCLENS: weak lensing simulations for large-area sky surveys and second-order effects in cosmic shear power spectra

NASA Astrophysics Data System (ADS)

Becker, Matthew R.

2013-10-01

I present a new algorithm, Curved-sky grAvitational Lensing for Cosmological Light conE simulatioNS (CALCLENS), for efficiently computing weak gravitational lensing shear signals from large N-body light cone simulations over a curved sky. This new algorithm properly accounts for the sky curvature and boundary conditions, is able to produce redshift-dependent shear signals including corrections to the Born approximation by using multiple-plane ray tracing and properly computes the lensed images of source galaxies in the light cone. The key feature of this algorithm is a new, computationally efficient Poisson solver for the sphere that combines spherical harmonic transform and multigrid methods. As a result, large areas of sky (˜10 000 square degrees) can be ray traced efficiently at high resolution using only a few hundred cores. Using this new algorithm and curved-sky calculations that only use a slower but more accurate spherical harmonic transform Poisson solver, I study the convergence, shear E-mode, shear B-mode and rotation mode power spectra. Employing full-sky E/B-mode decompositions, I confirm that the numerically computed shear B-mode and rotation mode power spectra are equal at high accuracy (≲1 per cent) as expected from perturbation theory up to second order. Coupled with realistic galaxy populations placed in large N-body light cone simulations, this new algorithm is ideally suited for the construction of synthetic weak lensing shear catalogues to be used to test for systematic effects in data analysis procedures for upcoming large-area sky surveys. The implementation presented in this work, written in C and employing widely available software libraries to maintain portability, is publicly available at http://code.google.com/p/calclens.

Combining point context and dynamic time warping for online gesture recognition

NASA Astrophysics Data System (ADS)

Mao, Xia; Li, Chen

2017-05-01

Previous gesture recognition methods usually focused on recognizing gestures after the entire gesture sequences were obtained. However, in many practical applications, a system has to identify gestures before they end to give instant feedback. We present an online gesture recognition approach that can realize early recognition of unfinished gestures with low latency. First, a curvature buffer-based point context (CBPC) descriptor is proposed to extract the shape feature of a gesture trajectory. The CBPC descriptor is a complete descriptor with a simple computation, and thus has its superiority in online scenarios. Then, we introduce an online windowed dynamic time warping algorithm to realize online matching between the ongoing gesture and the template gestures. In the algorithm, computational complexity is effectively decreased by adding a sliding window to the accumulative distance matrix. Lastly, the experiments are conducted on the Australian sign language data set and the Kinect hand gesture (KHG) data set. Results show that the proposed method outperforms other state-of-the-art methods especially when gesture information is incomplete.

Berry connection in atom-molecule systems

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

Cui Fucheng; Wu Biao; International Center for Quantum Materials, Peking University, 100871 Beijing

2011-08-15

In the mean-field theory of atom-molecule systems, where bosonic atoms combine to form molecules, there is no usual U(1) symmetry, presenting an apparent hurdle for defining the Berry phase and Berry curvature for these systems. We define a Berry connection for this system, with which the Berry phase and Berry curvature can be naturally computed. We use a three-level atom-molecule system to illustrate our results. In particular, we have computed the mean-field Berry curvature of this system analytically, and compared it to the Berry curvature computed with the second-quantized model of the same system. An excellent agreement is found, indicatingmore » the validity of our definition.« less

Lung partitioning for x-ray CAD applications

NASA Astrophysics Data System (ADS)

Annangi, Pavan; Raja, Anand

2011-03-01

Partitioning the inside region of lung into homogeneous regions becomes a crucial step in any computer-aided diagnosis applications based on chest X-ray. The ribs, air pockets and clavicle occupy major space inside the lung as seen in the chest x-ray PA image. Segmenting the ribs and clavicle to partition the lung into homogeneous regions forms a crucial step in any CAD application to better classify abnormalities. In this paper we present two separate algorithms to segment ribs and the clavicle bone in a completely automated way. The posterior ribs are segmented based on Phase congruency features and the clavicle is segmented using Mean curvature features followed by Radon transform. Both the algorithms work on the premise that the presentation of each of these anatomical structures inside the left and right lung has a specific orientation range within which they are confined to. The search space for both the algorithms is limited to the region inside the lung, which is obtained by an automated lung segmentation algorithm that was previously developed in our group. Both the algorithms were tested on 100 images of normal and patients affected with Pneumoconiosis.

Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism

DOE PAGES

Slattery, Stuart R.

2015-12-02

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothnessmore » and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.« less

Range data description based on multiple characteristics

NASA Technical Reports Server (NTRS)

Al-Hujazi, Ezzet; Sood, Arun

1988-01-01

An algorithm for describing range images based on Mean curvature (H) and Gaussian curvature (K) is presented. Range images are unique in that they directly approximate the physical surfaces of a real world 3-D scene. The curvature parameters are derived from the fundamental theorems of differential geometry and provides visible invariant pixel labels that can be used to characterize the scene. The sign of H and K can be used to classify each pixel into one of eight possible surface types. Due to the sensitivity of these parameters to noise the resulting HK-sing map does not directly identify surfaces in the range images and must be further processed. A region growing algorithm based on modeling the scene points with a Markov Random Field (MRF) of variable neighborhood size and edge models is suggested. This approach allows the integration of information from multiple characteristics in an efficient way. The performance of the proposed algorithm on a number of synthetic and real range images is discussed.

Efficiently computing exact geodesic loops within finite steps.

PubMed

Xin, Shi-Qing; He, Ying; Fu, Chi-Wing

2012-06-01

Closed geodesics, or geodesic loops, are crucial to the study of differential topology and differential geometry. Although the existence and properties of closed geodesics on smooth surfaces have been widely studied in mathematics community, relatively little progress has been made on how to compute them on polygonal surfaces. Most existing algorithms simply consider the mesh as a graph and so the resultant loops are restricted only on mesh edges, which are far from the actual geodesics. This paper is the first to prove the existence and uniqueness of geodesic loop restricted on a closed face sequence; it contributes also with an efficient algorithm to iteratively evolve an initial closed path on a given mesh into an exact geodesic loop within finite steps. Our proposed algorithm takes only an O(k) space complexity and an O(mk) time complexity (experimentally), where m is the number of vertices in the region bounded by the initial loop and the resultant geodesic loop, and k is the average number of edges in the edge sequences that the evolving loop passes through. In contrast to the existing geodesic curvature flow methods which compute an approximate geodesic loop within a predefined threshold, our method is exact and can apply directly to triangular meshes without needing to solve any differential equation with a numerical solver; it can run at interactive speed, e.g., in the order of milliseconds, for a mesh with around 50K vertices, and hence, significantly outperforms existing algorithms. Actually, our algorithm could run at interactive speed even for larger meshes. Besides the complexity of the input mesh, the geometric shape could also affect the number of evolving steps, i.e., the performance. We motivate our algorithm with an interactive shape segmentation example shown later in the paper.

On three dimensional object recognition and pose-determination: An abstraction based approach. Ph.D. Thesis - Michigan Univ. Final Report

NASA Technical Reports Server (NTRS)

Quek, Kok How Francis

1990-01-01

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

The 1-loop effective potential for the Standard Model in curved spacetime

NASA Astrophysics Data System (ADS)

Markkanen, Tommi; Nurmi, Sami; Rajantie, Arttu; Stopyra, Stephen

2018-06-01

The renormalisation group improved Standard Model effective potential in an arbitrary curved spacetime is computed to one loop order in perturbation theory. The loop corrections are computed in the ultraviolet limit, which makes them independent of the choice of the vacuum state and allows the derivation of the complete set of β-functions. The potential depends on the spacetime curvature through the direct non-minimal Higgs-curvature coupling, curvature contributions to the loop diagrams, and through the curvature dependence of the renormalisation scale. Together, these lead to significant curvature dependence, which needs to be taken into account in cosmological applications, which is demonstrated with the example of vacuum stability in de Sitter space.

Instability Mechanisms of Thermally-Driven Interfacial Flows in Liquid-Encapsulated Crystal Growth

NASA Technical Reports Server (NTRS)

Haj-Hariri, Hossein; Borhan, Ali

1997-01-01

During the past year, a great deal of effort was focused on the enhancement and refinement of the computational tools developed as part of our previous NASA grant. In particular, the interface mollification algorithm developed earlier was extended to incorporate the effects of surface-rheological properties in order to allow the study of thermocapillary flows in the presence of surface contamination. These tools will be used in the computational component of the proposed research in the remaining years of this grant. A detailed description of the progress made in this area is provided elsewhere. Briefly, the method developed allows for the convection and diffusion of bulk-insoluble surfactants on a moving and deforming interface. The novelty of the method is its grid independence: there is no need for front tracking, surface reconstruction, body-fitted grid generation, or metric evaluations; these are all very expensive computational tasks in three dimensions. For small local radii of curvature there is a need for local grid adaption so that the smearing thickness remains a small fraction of the radius of curvature. A special Neumann boundary condition was devised and applied so that the calculated surfactant concentration has no variations normal to the interface, and it is hence truly a surface-defined quantity. The discretized governing equations are solved subsequently using a time-split integration scheme which updates the concentration and the shape successively. Results demonstrate excellent agreement between the computed and exact solutions.

A variational approach to multi-phase motion of gas, liquid and solid based on the level set method

NASA Astrophysics Data System (ADS)

Yokoi, Kensuke

2009-07-01

We propose a simple and robust numerical algorithm to deal with multi-phase motion of gas, liquid and solid based on the level set method [S. Osher, J.A. Sethian, Front propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulation, J. Comput. Phys. 79 (1988) 12; M. Sussman, P. Smereka, S. Osher, A level set approach for capturing solution to incompressible two-phase flow, J. Comput. Phys. 114 (1994) 146; J.A. Sethian, Level Set Methods and Fast Marching Methods, Cambridge University Press, 1999; S. Osher, R. Fedkiw, Level Set Methods and Dynamics Implicit Surface, Applied Mathematical Sciences, vol. 153, Springer, 2003]. In Eulerian framework, to simulate interaction between a moving solid object and an interfacial flow, we need to define at least two functions (level set functions) to distinguish three materials. In such simulations, in general two functions overlap and/or disagree due to numerical errors such as numerical diffusion. In this paper, we resolved the problem using the idea of the active contour model [M. Kass, A. Witkin, D. Terzopoulos, Snakes: active contour models, International Journal of Computer Vision 1 (1988) 321; V. Caselles, R. Kimmel, G. Sapiro, Geodesic active contours, International Journal of Computer Vision 22 (1997) 61; G. Sapiro, Geometric Partial Differential Equations and Image Analysis, Cambridge University Press, 2001; R. Kimmel, Numerical Geometry of Images: Theory, Algorithms, and Applications, Springer-Verlag, 2003] introduced in the field of image processing.

Continuum Gyrokinetic Simulations of Turbulence in a Helical Model SOL with NSTX-type parameters

NASA Astrophysics Data System (ADS)

Hammett, G. W.; Shi, E. L.; Hakim, A.; Stoltzfus-Dueck, T.

2017-10-01

We have developed the Gkeyll code to carry out 3D2V full- F gyrokinetic simulations of electrostatic plasma turbulence in open-field-line geometries, using special versions of discontinuous-Galerkin algorithms to help with the computational challenges of the edge region. (Higher-order algorithms can also be helpful for exascale computing as they reduce the ratio of communications to computations.) Our first simulations with straight field lines were done for LAPD-type cases. Here we extend this to a helical model of an SOL plasma and show results for NSTX-type parameters. These simulations include the basic elements of a scrape-off layer: bad-curvature/interchange drive of instabilities, narrow sources to model plasma leaking from the core, and parallel losses with model sheath boundary conditions (our model allows currents to flow in and out of the walls). The formation of blobs is observed. By reducing the strength of the poloidal magnetic field, the heat flux at the divertor plate is observed to broaden. Supported by the Max-Planck/Princeton Center for Plasma Physics, the SciDAC Center for the Study of Plasma Microturbulence, and DOE Contract DE-AC02-09CH11466.

Characterization of a conical null-screen corneal topographer

NASA Astrophysics Data System (ADS)

Osorio-Infante, Arturo I.; Campos-García, Manuel; Cossio-Guerrero, Cesar

2017-06-01

In this work, we perform the characterization of a conical null-screen corneal topographer. For this, we design a custom null-screens for testing a reference spherical surfaces with a radius of curvature of 7.8 mm. We also test a 1/2-inch (12.7 mm) diameter stainless steel sphere and an aspherical surface with a radius of curvature of 7.77 mm. We designed some different target distributions with the same target size to evaluate the shape of the reference surfaces. The shape of each surface was recovered by fitting the experimental data to a custom shape using the least square methods with an iterative algorithm. The target distributions were modified to improve the accuracy of the measurements. We selected a distribution and evaluate the accuracy of the algorithms to measure spherical surfaces with a radius of curvature from 6 mm to 8.2 mm by simulating the reflected pattern. We also simulate the reflected patter by changing the position of the surface along the optical axis and then we measure the resulting radius of curvature.

Sensing Membrane Stresses by Protein Insertions

PubMed Central

Campelo, Felix; Kozlov, Michael M.

2014-01-01

Protein domains shallowly inserting into the membrane matrix are ubiquitous in peripheral membrane proteins involved in various processes of intracellular membrane shaping and remodeling. It has been suggested that these domains sense membrane curvature through their preferable binding to strongly curved membranes, the binding mechanism being mediated by lipid packing defects. Here we make an alternative statement that shallow protein insertions are universal sensors of the intra-membrane stresses existing in the region of the insertion embedding rather than sensors of the curvature per se. We substantiate this proposal computationally by considering different independent ways of the membrane stress generation among which some include changes of the membrane curvature whereas others do not alter the membrane shape. Our computations show that the membrane-binding coefficient of shallow protein insertions is determined by the resultant stress independently of the way this stress has been produced. By contrast, consideration of the correlation between the insertion binding and the membrane curvature demonstrates that the binding coefficient either increases or decreases with curvature depending on the factors leading to the curvature generation. To validate our computational model, we treat quantitatively the experimental results on membrane binding by ALPS1 and ALPS2 motifs of ArfGAP1. PMID:24722359

Sub-Pixel Extraction of Laser Stripe Center Using an Improved Gray-Gravity Method †

PubMed Central

Li, Yuehua; Zhou, Jingbo; Huang, Fengshan; Liu, Lijian

2017-01-01

Laser stripe center extraction is a key step for the profile measurement of line structured light sensors (LSLS). To accurately obtain the center coordinates at sub-pixel level, an improved gray-gravity method (IGGM) was proposed. Firstly, the center points of the stripe were computed using the gray-gravity method (GGM) for all columns of the image. By fitting these points using the moving least squares algorithm, the tangential vector, the normal vector and the radius of curvature can be robustly obtained. One rectangular region could be defined around each of the center points. Its two sides that are parallel to the tangential vector could alter their lengths according to the radius of the curvature. After that, the coordinate for each center point was recalculated within the rectangular region and in the direction of the normal vector. The center uncertainty was also analyzed based on the Monte Carlo method. The obtained experimental results indicate that the IGGM is suitable for both the smooth stripes and the ones with sharp corners. The high accuracy center points can be obtained at a relatively low computation cost. The measured results of the stairs and the screw surface further demonstrate the effectiveness of the method. PMID:28394288

Distributed Sensing and Shape Control of Piezoelectric Bimorph Mirrors

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

Redmond, James M.; Barney, Patrick S.; Henson, Tammy D.

1999-07-28

As part of a collaborative effort between Sandia National Laboratories and the University of Kentucky to develop a deployable mirror for remote sensing applications, research in shape sensing and control algorithms that leverage the distributed nature of electron gun excitation for piezoelectric bimorph mirrors is summarized. A coarse shape sensing technique is developed that uses reflected light rays from the sample surface to provide discrete slope measurements. Estimates of surface profiles are obtained with a cubic spline curve fitting algorithm. Experiments on a PZT bimorph illustrate appropriate deformation trends as a function of excitation voltage. A parallel effort to effectmore » desired shape changes through electron gun excitation is also summarized. A one dimensional model-based algorithm is developed to correct profile errors in bimorph beams. A more useful two dimensional algorithm is also developed that relies on measured voltage-curvature sensitivities to provide corrective excitation profiles for the top and bottom surfaces of bimorph plates. The two algorithms are illustrated using finite element models of PZT bimorph structures subjected to arbitrary disturbances. Corrective excitation profiles that yield desired parabolic forms are computed, and are shown to provide the necessary corrective action.« less

Method and apparatus for shape and end position determination using an optical fiber

NASA Technical Reports Server (NTRS)

Moore, Jason P. (Inventor)

2010-01-01

A method of determining the shape of an unbound optical fiber includes collecting strain data along a length of the fiber, calculating curvature and bending direction data of the fiber using the strain data, curve-fitting the curvature and bending direction data to derive curvature and bending direction functions, calculating a torsion function using the bending direction function, and determining the 3D shape from the curvature, bending direction, and torsion functions. An apparatus for determining the 3D shape of the fiber includes a fiber optic cable unbound with respect to a protective sleeve, strain sensors positioned along the cable, and a controller in communication with the sensors. The controller has an algorithm for determining a 3D shape and end position of the fiber by calculating a set of curvature and bending direction data, deriving curvature, bending, and torsion functions, and solving Frenet-Serret equations using these functions.

Numerical solution of the Hele-Shaw equations

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

Whitaker, N.

1987-04-01

An algorithm is presented for approximating the motion of the interface between two immiscible fluids in a Hele-Shaw cell. The interface is represented by a set of volume fractions. We use the Simple Line Interface Calculation method along with the method of fractional steps to transport the interface. The equation of continuity leads to a Poisson equation for the pressure. The Poisson equation is discretized. Near the interface where the velocity field is discontinuous, the discretization is based on a weak formulation of the continuity equation. Interpolation is used on each side of the interface to increase the accuracy ofmore » the algorithm. The weak formulation as well as the interpolation are based on the computed volume fractions. This treatment of the interface is new. The discretized equations are solved by a modified conjugate gradient method. Surface tension is included and the curvature is computed through the use of osculating circles. For perturbations of small amplitude, a surprisingly good agreement is found between the numerical results and linearized perturbation theory. Numerical results are presented for the finite amplitude growth of unstable fingers. 62 refs., 13 figs.« less

Importance of curvature evaluation scale for predictive simulations of dynamic gas-liquid interfaces

NASA Astrophysics Data System (ADS)

Owkes, Mark; Cauble, Eric; Senecal, Jacob; Currie, Robert A.

2018-07-01

The effect of the scale used to compute the interfacial curvature on the prediction of dynamic gas-liquid interfaces is investigated. A new interface curvature calculation methodology referred to herein as the Adjustable Curvature Evaluation Scale (ACES) is proposed. ACES leverages a weighted least squares regression to fit a polynomial through points computed on the volume-of-fluid representation of the gas-liquid interface. The interface curvature is evaluated from this polynomial. Varying the least squares weight with distance from the location where the curvature is being computed, adjusts the scale the curvature is evaluated on. ACES is verified using canonical static test cases and compared against second- and fourth-order height function methods. Simulations of dynamic interfaces, including a standing wave and oscillating droplet, are performed to assess the impact of the curvature evaluation scale for predicting interface motions. ACES and the height function methods are combined with two different unsplit geometric volume-of-fluid (VoF) schemes that define the interface on meshes with different levels of refinement. We find that the results depend significantly on curvature evaluation scale. Particularly, the ACES scheme with a properly chosen weight function is accurate, but fails when the scale is too small or large. Surprisingly, the second-order height function method is more accurate than the fourth-order variant for the dynamic tests even though the fourth-order method performs better for static interfaces. Comparing the curvature evaluation scale of the second- and fourth-order height function methods, we find the second-order method is closer to the optimum scale identified with ACES. This result suggests that the curvature scale is driving the accuracy of the dynamics. This work highlights the importance of studying numerical methods with realistic (dynamic) test cases and that the interactions of the various discretizations is as important as the accuracy of one part of the discretization.

Quantitative three-dimensional analysis of root canal curvature in maxillary first molars using micro-computed tomography.

PubMed

Lee, Jong-Ki; Ha, Byung-Hyun; Choi, Jeong-Ho; Heo, Seok-Mo; Perinpanayagam, Hiran

2006-10-01

In endodontic therapy, access and instrumentation are strongly affected by root canal curvature. However, the few studies that have actually measured curvature are mostly from two-dimensional radiographs. The purpose of this study was to measure the three-dimensional (3D) canal curvature in maxillary first molars using micro-computed tomography (microCT) and mathematical modeling. Extracted maxillary first molars (46) were scanned by microCT (502 image slices/tooth, 1024 X 1024 pixels, voxel size of 19.5 x 19.5 x 39.0 microm) and their canals reconstructed by 3D modeling software. The intersection of major and minor axes in the canal space of each image slice were connected to create an imaginary central axis for each canal. The radius of curvature of the tangential circle was measured and inverted as a measure of curvature using custom-made mathematical modeling software. Root canal curvature was greatest in the apical third and least in the middle third for all canals. The greatest curvatures were in the mesiobuccal (MB) canal (0.76 +/- 0.48 mm(-1)) with abrupt curves, and the least curvatures were in the palatal (P) canal (0.38 +/- 0.34 mm(-1)) with a gradual curve. This study has measured the 3D curvature of root canals in maxillary first molars and reinforced the value of microCT with mathematical modeling.

LOCAL ORTHOGONAL CUTTING METHOD FOR COMPUTING MEDIAL CURVES AND ITS BIOMEDICAL APPLICATIONS

PubMed Central

Einstein, Daniel R.; Dyedov, Vladimir

2010-01-01

Medial curves have a wide range of applications in geometric modeling and analysis (such as shape matching) and biomedical engineering (such as morphometry and computer assisted surgery). The computation of medial curves poses significant challenges, both in terms of theoretical analysis and practical efficiency and reliability. In this paper, we propose a definition and analysis of medial curves and also describe an efficient and robust method called local orthogonal cutting (LOC) for computing medial curves. Our approach is based on three key concepts: a local orthogonal decomposition of objects into substructures, a differential geometry concept called the interior center of curvature (ICC), and integrated stability and consistency tests. These concepts lend themselves to robust numerical techniques and result in an algorithm that is efficient and noise resistant. We illustrate the effectiveness and robustness of our approach with some highly complex, large-scale, noisy biomedical geometries derived from medical images, including lung airways and blood vessels. We also present comparisons of our method with some existing methods. PMID:20628546

3D skin surface reconstruction from a single image by merging global curvature and local texture using the guided filtering for 3D haptic palpation.

PubMed

Lee, K; Kim, M; Kim, K

2018-05-11

Skin surface evaluation has been studied using various imaging techniques. However, all these studies had limited impact because they were performed using visual exam only. To improve on this scenario with haptic feedback, we propose 3D reconstruction of the skin surface using a single image. Unlike extant 3D skin surface reconstruction algorithms, we utilize the local texture and global curvature regions, combining the results for reconstruction. The first entails the reconstruction of global curvature, achieved by bilateral filtering that removes noise on the surface while maintaining the edge (ie, furrow) to obtain the overall curvature. The second entails the reconstruction of local texture, representing the fine wrinkles of the skin, using an advanced form of bilateral filtering. The final image is then composed by merging the two reconstructed images. We tested the curvature reconstruction part by comparing the resulting curvatures with measured values from real phantom objects while local texture reconstruction was verified by measuring skin surface roughness. Then, we showed the reconstructed result of our proposed algorithm via the reconstruction of various real skin surfaces. The experimental results demonstrate that our approach is a promising technology to reconstruct an accurate skin surface with a single skin image. We proposed 3D skin surface reconstruction using only a single camera. We highlighted the utility of global curvature, which has not been considered important in the past. Thus, we proposed a new method for 3D reconstruction that can be used for 3D haptic palpation, dividing the concepts of local and global regions. © 2018 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

Theory of gearing

NASA Technical Reports Server (NTRS)

Litvin, Faydor L.

1989-01-01

Basic mathematical problems on the theory of gearing are covered in this book, such as the necessary and sufficient conditions of envelope existence, relations between principal curvatures and directions for surfaces of mating gears. Also included are singularities of surfaces accompanied by undercutting the process of generation, the phenomena of envelope of lines of contact, and the principles for generation of conjugate surfaces. Special attention is given to the algorithms for computer aided simulation of meshing and tooth contact. This edition was complemented with the results of research recently performed by the author and his doctoral students. The book contains sample problems and also problems for the reader to solve.

Heterotic reduction of Courant algebroid connections and Einstein-Hilbert actions

NASA Astrophysics Data System (ADS)

Jurčo, Branislav; Vysoký, Jan

2016-08-01

We discuss Levi-Civita connections on Courant algebroids. We define an appropriate generalization of the curvature tensor and compute the corresponding scalar curvatures in the exact and heterotic case, leading to generalized (bosonic) Einstein-Hilbert type of actions known from supergravity. In particular, we carefully analyze the process of the reduction for the generalized metric, connection, curvature tensor and the scalar curvature.

Curvature computation in volume-of-fluid method based on point-cloud sampling

NASA Astrophysics Data System (ADS)

Kassar, Bruno B. M.; Carneiro, João N. E.; Nieckele, Angela O.

2018-01-01

This work proposes a novel approach to compute interface curvature in multiphase flow simulation based on Volume of Fluid (VOF) method. It is well documented in the literature that curvature and normal vector computation in VOF may lack accuracy mainly due to abrupt changes in the volume fraction field across the interfaces. This may cause deterioration on the interface tension forces estimates, often resulting in inaccurate results for interface tension dominated flows. Many techniques have been presented over the last years in order to enhance accuracy in normal vectors and curvature estimates including height functions, parabolic fitting of the volume fraction, reconstructing distance functions, coupling Level Set method with VOF, convolving the volume fraction field with smoothing kernels among others. We propose a novel technique based on a representation of the interface by a cloud of points. The curvatures and the interface normal vectors are computed geometrically at each point of the cloud and projected onto the Eulerian grid in a Front-Tracking manner. Results are compared to benchmark data and significant reduction on spurious currents as well as improvement in the pressure jump are observed. The method was developed in the open source suite OpenFOAM® extending its standard VOF implementation, the interFoam solver.

Investigation of flow-induced numerical instability in a mixed semi-implicit, implicit leapfrog time discretization

NASA Astrophysics Data System (ADS)

King, Jacob; Kruger, Scott

2017-10-01

Flow can impact the stability and nonlinear evolution of range of instabilities (e.g. RWMs, NTMs, sawteeth, locked modes, PBMs, and high-k turbulence) and thus robust numerical algorithms for simulations with flow are essential. Recent simulations of DIII-D QH-mode [King et al., Phys. Plasmas and Nucl. Fus. 2017] with flow have been restricted to smaller time-step sizes than corresponding computations without flow. These computations use a mixed semi-implicit, implicit leapfrog time discretization as implemented in the NIMROD code [Sovinec et al., JCP 2004]. While prior analysis has shown that this algorithm is unconditionally stable with respect to the effect of large flows on the MHD waves in slab geometry [Sovinec et al., JCP 2010], our present Von Neumann stability analysis shows that a flow-induced numerical instability may arise when ad-hoc cylindrical curvature is included. Computations with the NIMROD code in cylindrical geometry with rigid rotation and without free-energy drive from current or pressure gradients qualitatively confirm this analysis. We explore potential methods to circumvent this flow-induced numerical instability such as using a semi-Lagrangian formulation instead of time-centered implicit advection and/or modification to the semi-implicit operator. This work is supported by the DOE Office of Science (Office of Fusion Energy Sciences).

Extraction of diffuse correlation spectroscopy flow index by integration of Nth-order linear model with Monte Carlo simulation

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

Shang, Yu; Lin, Yu; Yu, Guoqiang, E-mail: guoqiang.yu@uky.edu

2014-05-12

Conventional semi-infinite solution for extracting blood flow index (BFI) from diffuse correlation spectroscopy (DCS) measurements may cause errors in estimation of BFI (αD{sub B}) in tissues with small volume and large curvature. We proposed an algorithm integrating Nth-order linear model of autocorrelation function with the Monte Carlo simulation of photon migrations in tissue for the extraction of αD{sub B}. The volume and geometry of the measured tissue were incorporated in the Monte Carlo simulation, which overcome the semi-infinite restrictions. The algorithm was tested using computer simulations on four tissue models with varied volumes/geometries and applied on an in vivo strokemore » model of mouse. Computer simulations shows that the high-order (N ≥ 5) linear algorithm was more accurate in extracting αD{sub B} (errors < ±2%) from the noise-free DCS data than the semi-infinite solution (errors: −5.3% to −18.0%) for different tissue models. Although adding random noises to DCS data resulted in αD{sub B} variations, the mean values of errors in extracting αD{sub B} were similar to those reconstructed from the noise-free DCS data. In addition, the errors in extracting the relative changes of αD{sub B} using both linear algorithm and semi-infinite solution were fairly small (errors < ±2.0%) and did not rely on the tissue volume/geometry. The experimental results from the in vivo stroke mice agreed with those in simulations, demonstrating the robustness of the linear algorithm. DCS with the high-order linear algorithm shows the potential for the inter-subject comparison and longitudinal monitoring of absolute BFI in a variety of tissues/organs with different volumes/geometries.« less

From voxel to curvature

NASA Astrophysics Data System (ADS)

Monga, Olivier; Ayache, Nicholas; Sander, Peter T.

1991-09-01

Modern medical image techniques, such as magnetic resonance image (MRI) or x-ray computed tomography provide three dimensional images of internal structures of the body, usually by means of a stack of tomographic images. The first stage in the automatic analysis of such data is 3-D edge detection1,2 which provides points corresponding to the boundaries of the surfaces forming the 3-D structure. The next stage is to characterize the local geometry of these surfaces in order to extract points or lines on which registration and/or tracking procedures can rely.3,4,5,6 This paper presents a pipeline of processes which define a hierarchical description of the second order differential characteristics of the surfaces. The focus is on the theoretical coherence of these levels of representation. Using uncertainty, a link is established between the edge detection and the local surface approximation by addressing the uncertainties inherent to edge detection in 2-D or 3-D images; and how to incorporate these uncertainties into the computation of local geometric models. In particular, calculate the uncertainty of edge location, direction, and magnitude for the 3-D Deriche operator is calculated.1,2 Statistical results are then used as a solid theoretical foundation on which to base subsequent computations, such as the determination of local surface curvature using local geometric models for surface segmentation. From the local fitting, for each edge point the mean and Gaussian curvature, principal curvatures and directions, curvature singularities, lines of curvature singularities, and covariance matrices defining the uncertainties are calculated. Experimental results for real data using two 3-D scanner images of the same organ taken at different positions demonstrate the stability of the mean and Gaussian curvatures. Experimental results for real data showing the determination of local curvature extremes of surfaces extracted from MR images are presented.

Implementing quantum Ricci curvature

NASA Astrophysics Data System (ADS)

Klitgaard, N.; Loll, R.

2018-05-01

Quantum Ricci curvature has been introduced recently as a new, geometric observable characterizing the curvature properties of metric spaces, without the need for a smooth structure. Besides coordinate invariance, its key features are scalability, computability, and robustness. We demonstrate that these properties continue to hold in the context of nonperturbative quantum gravity, by evaluating the quantum Ricci curvature numerically in two-dimensional Euclidean quantum gravity, defined in terms of dynamical triangulations. Despite the well-known, highly nonclassical properties of the underlying quantum geometry, its Ricci curvature can be matched well to that of a five-dimensional round sphere.

Scalar curvature in conformal geometry of Connes-Landi noncommutative manifolds

NASA Astrophysics Data System (ADS)

Liu, Yang

2017-11-01

We first propose a conformal geometry for Connes-Landi noncommutative manifolds and study the associated scalar curvature. The new scalar curvature contains its Riemannian counterpart as the commutative limit. Similar to the results on noncommutative two tori, the quantum part of the curvature consists of actions of the modular derivation through two local curvature functions. Explicit expressions for those functions are obtained for all even dimensions (greater than two). In dimension four, the one variable function shows striking similarity to the analytic functions of the characteristic classes appeared in the Atiyah-Singer local index formula, namely, it is roughly a product of the j-function (which defines the A ˆ -class of a manifold) and an exponential function (which defines the Chern character of a bundle). By performing two different computations for the variation of the Einstein-Hilbert action, we obtain deep internal relations between two local curvature functions. Straightforward verification for those relations gives a strong conceptual confirmation for the whole computational machinery we have developed so far, especially the Mathematica code hidden behind the paper.

Opto-numerical procedures supporting dynamic lower limbs monitoring and their medical diagnosis

NASA Astrophysics Data System (ADS)

Witkowski, Marcin; Kujawińska, Malgorzata; Rapp, Walter; Sitnik, Robert

2006-01-01

New optical full-field shape measurement systems allow transient shape capture at rates between 15 and 30 Hz. These frequency rates are enough to monitor controlled movements used e.g. for medical examination purposes. In this paper we present a set of algorithms which may be applied for processing of data gathered by fringe projection method implemented for lower limbs shape measurement. The purpose of presented algorithms is to locate anatomical structures based on the limb shape and its deformation in time. The algorithms are based on local surface curvature calculation and analysis of curvature maps changes during the measurement sequence. One of anatomical structure of high medical interest that is possible to scan and analyze, is patella. Tracking of patella position and orientation under dynamic conditions may lead to detect pathological patella movements and help in knee joint disease diagnosis. Therefore the usefulness of the algorithms developed was proven at examples of patella localization and monitoring.

Mindboggling morphometry of human brains

PubMed Central

Bao, Forrest S.; Giard, Joachim; Stavsky, Eliezer; Lee, Noah; Rossa, Brian; Reuter, Martin; Chaibub Neto, Elias

2017-01-01

Mindboggle (http://mindboggle.info) is an open source brain morphometry platform that takes in preprocessed T1-weighted MRI data and outputs volume, surface, and tabular data containing label, feature, and shape information for further analysis. In this article, we document the software and demonstrate its use in studies of shape variation in healthy and diseased humans. The number of different shape measures and the size of the populations make this the largest and most detailed shape analysis of human brains ever conducted. Brain image morphometry shows great potential for providing much-needed biological markers for diagnosing, tracking, and predicting progression of mental health disorders. Very few software algorithms provide more than measures of volume and cortical thickness, while more subtle shape measures may provide more sensitive and specific biomarkers. Mindboggle computes a variety of (primarily surface-based) shapes: area, volume, thickness, curvature, depth, Laplace-Beltrami spectra, Zernike moments, etc. We evaluate Mindboggle’s algorithms using the largest set of manually labeled, publicly available brain images in the world and compare them against state-of-the-art algorithms where they exist. All data, code, and results of these evaluations are publicly available. PMID:28231282

Cone-beam computed tomography analysis of curved root canals after mechanical preparation with three nickel-titanium rotary instruments

PubMed Central

Elsherief, Samia M.; Zayet, Mohamed K.; Hamouda, Ibrahim M.

2013-01-01

Cone beam computed tomography is a 3-dimensional high resolution imaging method. The purpose of this study was to compare the effects of 3 different NiTi rotary instruments used to prepare curved root canals on the final shape of the curved canals and total amount of root canal transportation by using cone-beam computed tomography. A total of 81 mesial root canals from 42 extracted human mandibular molars, with a curvature ranging from 15 to 45 degrees, were selected. Canals were randomly divided into 3 groups of 27 each. After preparation with Protaper, Revo-S and Hero Shaper, the amount of transportation and centering ability that occurred were assessed by using cone beam computed tomography. Utilizing pre- and post-instrumentation radiographs, straightening of the canal curvatures was determined with a computer image analysis program. Canals were metrically assessed for changes (surface area, changes in curvature and transportation) during canal preparation by using software SimPlant; instrument failures were also recorded. Mean total widths and outer and inner width measurements were determined on each central canal path and differences were statistically analyzed. The results showed that all instruments maintained the original canal curvature well with no significant differences between the different files (P = 0.226). During preparation there was failure of only one file (the protaper group). In conclusion, under the conditions of this study, all instruments maintained the original canal curvature well and were safe to use. Areas of uninstrumented root canal wall were left in all regions using the various systems. PMID:23885273

Multiscale corner detection and classification using local properties and semantic patterns

NASA Astrophysics Data System (ADS)

Gallo, Giovanni; Giuoco, Alessandro L.

2002-05-01

A new technique to detect, localize and classify corners in digital closed curves is proposed. The technique is based on correct estimation of support regions for each point. We compute multiscale curvature to detect and to localize corners. As a further step, with the aid of some local features, it's possible to classify corners into seven distinct types. Classification is performed using a set of rules, which describe corners according to preset semantic patterns. Compared with existing techniques, the proposed approach inscribes itself into the family of algorithms that try to explain the curve, instead of simple labeling. Moreover, our technique works in manner similar to what is believed are typical mechanisms of human perception.

Localization of the transverse processes in ultrasound for spinal curvature measurement

NASA Astrophysics Data System (ADS)

Kamali, Shahrokh; Ungi, Tamas; Lasso, Andras; Yan, Christina; Lougheed, Matthew; Fichtinger, Gabor

2017-03-01

PURPOSE: In scoliosis monitoring, tracked ultrasound has been explored as a safer imaging alternative to traditional radiography. The use of ultrasound in spinal curvature measurement requires identification of vertebral landmarks such as transverse processes, but as bones have reduced visibility in ultrasound imaging, skeletal landmarks are typically segmented manually, which is an exceedingly laborious and long process. We propose an automatic algorithm to segment and localize the surface of bony areas in the transverse process for scoliosis in ultrasound. METHODS: The algorithm uses cascade of filters to remove low intensity pixels, smooth the image and detect bony edges. By applying first differentiation, candidate bony areas are classified. The average intensity under each area has a correlation with the possibility of a shadow, and areas with strong shadow are kept for bone segmentation. The segmented images are used to reconstruct a 3-D volume to represent the whole spinal structure around the transverse processes. RESULTS: A comparison between the manual ground truth segmentation and the automatic algorithm in 50 images showed 0.17 mm average difference. The time to process all 1,938 images was about 37 Sec. (0.0191 Sec. / Image), including reading the original sequence file. CONCLUSION: Initial experiments showed the algorithm to be sufficiently accurate and fast for segmentation transverse processes in ultrasound for spinal curvature measurement. An extensive evaluation of the method is currently underway on images from a larger patient cohort and using multiple observers in producing ground truth segmentation.

Determination of important topographic factors for landslide mapping analysis using MLP network.

PubMed

Alkhasawneh, Mutasem Sh; Ngah, Umi Kalthum; Tay, Lea Tien; Mat Isa, Nor Ashidi; Al-batah, Mohammad Subhi

2013-01-01

Landslide is one of the natural disasters that occur in Malaysia. Topographic factors such as elevation, slope angle, slope aspect, general curvature, plan curvature, and profile curvature are considered as the main causes of landslides. In order to determine the dominant topographic factors in landslide mapping analysis, a study was conducted and presented in this paper. There are three main stages involved in this study. The first stage is the extraction of extra topographic factors. Previous landslide studies had identified mainly six topographic factors. Seven new additional factors have been proposed in this study. They are longitude curvature, tangential curvature, cross section curvature, surface area, diagonal line length, surface roughness, and rugosity. The second stage is the specification of the weight of each factor using two methods. The methods are multilayer perceptron (MLP) network classification accuracy and Zhou's algorithm. At the third stage, the factors with higher weights were used to improve the MLP performance. Out of the thirteen factors, eight factors were considered as important factors, which are surface area, longitude curvature, diagonal length, slope angle, elevation, slope aspect, rugosity, and profile curvature. The classification accuracy of multilayer perceptron neural network has increased by 3% after the elimination of five less important factors.

Determination of Important Topographic Factors for Landslide Mapping Analysis Using MLP Network

PubMed Central

Alkhasawneh, Mutasem Sh.; Ngah, Umi Kalthum; Mat Isa, Nor Ashidi; Al-batah, Mohammad Subhi

2013-01-01

Landslide is one of the natural disasters that occur in Malaysia. Topographic factors such as elevation, slope angle, slope aspect, general curvature, plan curvature, and profile curvature are considered as the main causes of landslides. In order to determine the dominant topographic factors in landslide mapping analysis, a study was conducted and presented in this paper. There are three main stages involved in this study. The first stage is the extraction of extra topographic factors. Previous landslide studies had identified mainly six topographic factors. Seven new additional factors have been proposed in this study. They are longitude curvature, tangential curvature, cross section curvature, surface area, diagonal line length, surface roughness, and rugosity. The second stage is the specification of the weight of each factor using two methods. The methods are multilayer perceptron (MLP) network classification accuracy and Zhou's algorithm. At the third stage, the factors with higher weights were used to improve the MLP performance. Out of the thirteen factors, eight factors were considered as important factors, which are surface area, longitude curvature, diagonal length, slope angle, elevation, slope aspect, rugosity, and profile curvature. The classification accuracy of multilayer perceptron neural network has increased by 3% after the elimination of five less important factors. PMID:24453846

A finite element method to compute three-dimensional equilibrium configurations of fluid membranes: Optimal parameterization, variational formulation and applications

NASA Astrophysics Data System (ADS)

Rangarajan, Ramsharan; Gao, Huajian

2015-09-01

We introduce a finite element method to compute equilibrium configurations of fluid membranes, identified as stationary points of a curvature-dependent bending energy functional under certain geometric constraints. The reparameterization symmetries in the problem pose a challenge in designing parametric finite element methods, and existing methods commonly resort to Lagrange multipliers or penalty parameters. In contrast, we exploit these symmetries by representing solution surfaces as normal offsets of given reference surfaces and entirely bypass the need for artificial constraints. We then resort to a Galerkin finite element method to compute discrete C1 approximations of the normal offset coordinate. The variational framework presented is suitable for computing deformations of three-dimensional membranes subject to a broad range of external interactions. We provide a systematic algorithm for computing large deformations, wherein solutions at subsequent load steps are identified as perturbations of previously computed ones. We discuss the numerical implementation of the method in detail and demonstrate its optimal convergence properties using examples. We discuss applications of the method to studying adhesive interactions of fluid membranes with rigid substrates and to investigate the influence of membrane tension in tether formation.

Local Orthogonal Cutting Method for Computing Medial Curves and Its Biomedical Applications

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

Jiao, Xiangmin; Einstein, Daniel R.; Dyedov, Volodymyr

2010-03-24

Medial curves have a wide range of applications in geometric modeling and analysis (such as shape matching) and biomedical engineering (such as morphometry and computer assisted surgery). The computation of medial curves poses significant challenges, both in terms of theoretical analysis and practical efficiency and reliability. In this paper, we propose a definition and analysis of medial curves and also describe an efficient and robust method for computing medial curves. Our approach is based on three key concepts: a local orthogonal decomposition of objects into substructures, a differential geometry concept called the interior center of curvature (ICC), and integrated stabilitymore » and consistency tests. These concepts lend themselves to robust numerical techniques including eigenvalue analysis, weighted least squares approximations, and numerical minimization, resulting in an algorithm that is efficient and noise resistant. We illustrate the effectiveness and robustness of our approach with some highly complex, large-scale, noisy biomedical geometries derived from medical images, including lung airways and blood vessels. We also present comparisons of our method with some existing methods.« less

Multiscale computational models in physical systems biology of intracellular trafficking.

PubMed

Tourdot, Richard W; Bradley, Ryan P; Ramakrishnan, Natesan; Radhakrishnan, Ravi

2014-10-01

In intracellular trafficking, a definitive understanding of the interplay between protein binding and membrane morphology remains incomplete. The authors describe a computational approach by integrating coarse-grained molecular dynamics (CGMD) simulations with continuum Monte Carlo (CM) simulations of the membrane to study protein-membrane interactions and the ensuing membrane curvature. They relate the curvature field strength discerned from the molecular level to its effect at the cellular length-scale. They perform thermodynamic integration on the CM model to describe the free energy landscape of vesiculation in clathrin-mediated endocytosis. The method presented here delineates membrane morphologies and maps out the free energy changes associated with membrane remodeling due to varying coat sizes, coat curvature strengths, membrane bending rigidities, and tensions; furthermore several constraints on mechanisms underlying clathrin-mediated endocytosis have also been identified, Their CGMD simulations have revealed the importance of PIP2 for stable binding of proteins essential for curvature induction in the bilayer and have provided a molecular basis for the positive curvature induction by the epsin N-terminal homology (EIMTH) domain. Calculation of the free energy landscape for vesicle budding has identified the critical size and curvature strength of a clathrin coat required for nucleation and stabilisation of a mature vesicle.

Analysis of growth patterns during gravitropic curvature in roots of Zea mays by use of a computer-based video digitizer

NASA Technical Reports Server (NTRS)

Nelson, A. J.; Evans, M. L.

1986-01-01

A computer-based video digitizer system is described which allows automated tracking of markers placed on a plant surface. The system uses customized software to calculate relative growth rates at selected positions along the plant surface and to determine rates of gravitropic curvature based on the changing pattern of distribution of the surface markers. The system was used to study the time course of gravitropic curvature and changes in relative growth rate along the upper and lower surface of horizontally-oriented roots of maize (Zea mays L.). The growing region of the root was found to extend from about 1 mm behind the tip to approximately 6 mm behind the tip. In vertically-oriented roots the relative growth rate was maximal at about 2.5 mm behind the tip and declined smoothly on either side of the maximum. Curvature was initiated approximately 30 min after horizontal orientation with maximal (50 degrees) curvature being attained in 3 h. Analysis of surface extension patterns during the response indicated that curvature results from a reduction in growth rate along both the upper and lower surfaces with stronger reduction along the lower surface.

User manual for Streamtube Curvature Analysis: Analytical method for predicting the pressure distribution about a nacelle at transonic speeds, appendix

NASA Technical Reports Server (NTRS)

Keith, J. S.; Ferguson, D. R.; Heck, P. H.

1973-01-01

The computer program listing of Streamtube Curvature Analysis is presented. The listing includes explanatory statements and titles so that the program flow is readily discernable. The computer program listing is in CDC FORTRAN 2.3 source language form, except for three subroutines, GETIX, GETRLX, and SAVIX, which are in COMPOSE 1.1 language.

How to measure cortical folding from MR images: a step-by-step tutorial to compute local gyrification index.

PubMed

Schaer, Marie; Cuadra, Meritxell Bach; Schmansky, Nick; Fischl, Bruce; Thiran, Jean-Philippe; Eliez, Stephan

2012-01-02

Cortical folding (gyrification) is determined during the first months of life, so that adverse events occurring during this period leave traces that will be identifiable at any age. As recently reviewed by Mangin and colleagues(2), several methods exist to quantify different characteristics of gyrification. For instance, sulcal morphometry can be used to measure shape descriptors such as the depth, length or indices of inter-hemispheric asymmetry(3). These geometrical properties have the advantage of being easy to interpret. However, sulcal morphometry tightly relies on the accurate identification of a given set of sulci and hence provides a fragmented description of gyrification. A more fine-grained quantification of gyrification can be achieved with curvature-based measurements, where smoothed absolute mean curvature is typically computed at thousands of points over the cortical surface(4). The curvature is however not straightforward to comprehend, as it remains unclear if there is any direct relationship between the curvedness and a biologically meaningful correlate such as cortical volume or surface. To address the diverse issues raised by the measurement of cortical folding, we previously developed an algorithm to quantify local gyrification with an exquisite spatial resolution and of simple interpretation. Our method is inspired of the Gyrification Index(5), a method originally used in comparative neuroanatomy to evaluate the cortical folding differences across species. In our implementation, which we name local Gyrification Index (lGI(1)), we measure the amount of cortex buried within the sulcal folds as compared with the amount of visible cortex in circular regions of interest. Given that the cortex grows primarily through radial expansion(6), our method was specifically designed to identify early defects of cortical development. In this article, we detail the computation of local Gyrification Index, which is now freely distributed as a part of the FreeSurfer Software (http://surfer.nmr.mgh.harvard.edu/, Martinos Center for Biomedical Imaging, Massachusetts General Hospital). FreeSurfer provides a set of automated reconstruction tools of the brain's cortical surface from structural MRI data. The cortical surface extracted in the native space of the images with sub-millimeter accuracy is then further used for the creation of an outer surface, which will serve as a basis for the lGI calculation. A circular region of interest is then delineated on the outer surface, and its corresponding region of interest on the cortical surface is identified using a matching algorithm as described in our validation study(1). This process is repeatedly iterated with largely overlapping regions of interest, resulting in cortical maps of gyrification for subsequent statistical comparisons (Fig. 1). Of note, another measurement of local gyrification with a similar inspiration was proposed by Toro and colleagues(7), where the folding index at each point is computed as the ratio of the cortical area contained in a sphere divided by the area of a disc with the same radius. The two implementations differ in that the one by Toro et al. is based on Euclidian distances and thus considers discontinuous patches of cortical area, whereas ours uses a strict geodesic algorithm and include only the continuous patch of cortical area opening at the brain surface in a circular region of interest.

Self-similar slip distributions on irregular shaped faults

NASA Astrophysics Data System (ADS)

Herrero, A.; Murphy, S.

2018-06-01

We propose a strategy to place a self-similar slip distribution on a complex fault surface that is represented by an unstructured mesh. This is possible by applying a strategy based on the composite source model where a hierarchical set of asperities, each with its own slip function which is dependent on the distance from the asperity centre. Central to this technique is the efficient, accurate computation of distance between two points on the fault surface. This is known as the geodetic distance problem. We propose a method to compute the distance across complex non-planar surfaces based on a corollary of the Huygens' principle. The difference between this method compared to others sample-based algorithms which precede it is the use of a curved front at a local level to calculate the distance. This technique produces a highly accurate computation of the distance as the curvature of the front is linked to the distance from the source. Our local scheme is based on a sequence of two trilaterations, producing a robust algorithm which is highly precise. We test the strategy on a planar surface in order to assess its ability to keep the self-similarity properties of a slip distribution. We also present a synthetic self-similar slip distribution on a real slab topography for a M8.5 event. This method for computing distance may be extended to the estimation of first arrival times in both complex 3D surfaces or 3D volumes.

3D Clumped Cell Segmentation Using Curvature Based Seeded Watershed.

PubMed

Atta-Fosu, Thomas; Guo, Weihong; Jeter, Dana; Mizutani, Claudia M; Stopczynski, Nathan; Sousa-Neves, Rui

2016-12-01

Image segmentation is an important process that separates objects from the background and also from each other. Applied to cells, the results can be used for cell counting which is very important in medical diagnosis and treatment, and biological research that is often used by scientists and medical practitioners. Segmenting 3D confocal microscopy images containing cells of different shapes and sizes is still challenging as the nuclei are closely packed. The watershed transform provides an efficient tool in segmenting such nuclei provided a reasonable set of markers can be found in the image. In the presence of low-contrast variation or excessive noise in the given image, the watershed transform leads to over-segmentation (a single object is overly split into multiple objects). The traditional watershed uses the local minima of the input image and will characteristically find multiple minima in one object unless they are specified (marker-controlled watershed). An alternative to using the local minima is by a supervised technique called seeded watershed, which supplies single seeds to replace the minima for the objects. Consequently, the accuracy of a seeded watershed algorithm relies on the accuracy of the predefined seeds. In this paper, we present a segmentation approach based on the geometric morphological properties of the 'landscape' using curvatures. The curvatures are computed as the eigenvalues of the Shape matrix, producing accurate seeds that also inherit the original shape of their respective cells. We compare with some popular approaches and show the advantage of the proposed method.

Linear stability of three-dimensional boundary layers - Effects of curvature and non-parallelism

NASA Technical Reports Server (NTRS)

Malik, M. R.; Balakumar, P.

1993-01-01

In this paper we study the effect of in-plane (wavefront) curvature on the stability of three-dimensional boundary layers. It is found that this effect is stabilizing or destabilizing depending upon the sign of the crossflow velocity profile. We also investigate the effects of surface curvature and nonparallelism on crossflow instability. Computations performed for an infinite-swept cylinder show that while convex curvature stabilizes the three-dimensional boundary layer, nonparallelism is, in general, destabilizing and the net effect of the two depends upon meanflow and disturbance parameters. It is also found that concave surface curvature further destabilizes the crossflow instability.

Optimizing computer-aided colonic polyp detection for CT colonography by evolving the Pareto front1

PubMed Central

Li, Jiang; Huang, Adam; Yao, Jack; Liu, Jiamin; Van Uitert, Robert L.; Petrick, Nicholas; Summers, Ronald M.

2009-01-01

A multiobjective genetic algorithm is designed to optimize a computer-aided detection (CAD) system for identifying colonic polyps. Colonic polyps appear as elliptical protrusions on the inner surface of the colon. Curvature-based features for colonic polyp detection have proved to be successful in several CT colonography (CTC) CAD systems. Our CTC CAD program uses a sequential classifier to form initial polyp detections on the colon surface. The classifier utilizes a set of thresholds on curvature-based features to cluster suspicious colon surface regions into polyp candidates. The thresholds were previously chosen experimentally by using feature histograms. The chosen thresholds were effective for detecting polyps sized 10 mm or larger in diameter. However, many medium-sized polyps, 6–9 mm in diameter, were missed in the initial detection procedure. In this paper, the task of finding optimal thresholds as a multiobjective optimization problem was formulated, and a genetic algorithm to solve it was utilized by evolving the Pareto front of the Pareto optimal set. The new CTC CAD system was tested on 792 patients. The sensitivities of the optimized system improved significantly, from 61.68% to 74.71% with an increase of 13.03% (95% CI [6.57%, 19.5%], p=7.78×10−5) for the size category of 6–9 mm polyps, from 65.02% to 77.4% with an increase of 12.38% (95% CI [6.23%, 18.53%], p=7.95×10−5) for polyps 6 mm or larger, and from 82.2% to 90.58% with an increase of 8.38% (95%CI [0.75%, 16%], p=0.03) for polyps 8 mm or larger at comparable false positive rates. The sensitivities of the optimized system are nearly equivalent to those of expert radiologists. PMID:19235388

Studies of the effects of curvature on dilution jet mixing

NASA Technical Reports Server (NTRS)

Holdeman, James D.; Srinivasan, Ram; Reynolds, Robert S.; White, Craig D.

1992-01-01

An analytical program was conducted using both three-dimensional numerical and empirical models to investigate the effects of transition liner curvature on the mixing of jets injected into a confined crossflow. The numerical code is of the TEACH type with hybrid numerics; it uses the power-law and SIMPLER algorithms, an orthogonal curvilinear coordinate system, and an algebraic Reynolds stress turbulence model. From the results of the numerical calculations, an existing empirical model for the temperature field downstream of single and multiple rows of jets injected into a straight rectangular duct was extended to model the effects of curvature. Temperature distributions, calculated with both the numerical and empirical models, are presented to show the effects of radius of curvature and inner and outer wall injection for single and opposed rows of cool dilution jets injected into a hot mainstream flow.

Information Fusion and Control in Hierarchical Systems

DTIC Science & Technology

2013-05-01

structures of statistical manifolds are elucidated by computing the canonical Levi - Civita affine con- nection as well as Riemannian and scalar curvatures...with a Riemannian metric and a family of affine connections, including, but not exclusively, the canonical Levi - Civita affine connection [45]. By...canonical Levi - Civita affine connection as well as Riemannian and scalar curvatures. The relationship between the Ricci curvature tensor field and the

Error Analyses of the North Alabama Lightning Mapping Array (LMA)

NASA Technical Reports Server (NTRS)

Koshak, W. J.; Solokiewicz, R. J.; Blakeslee, R. J.; Goodman, S. J.; Christian, H. J.; Hall, J. M.; Bailey, J. C.; Krider, E. P.; Bateman, M. G.; Boccippio, D. J.

2003-01-01

Two approaches are used to characterize how accurately the North Alabama Lightning Mapping Array (LMA) is able to locate lightning VHF sources in space and in time. The first method uses a Monte Carlo computer simulation to estimate source retrieval errors. The simulation applies a VHF source retrieval algorithm that was recently developed at the NASA-MSFC and that is similar, but not identical to, the standard New Mexico Tech retrieval algorithm. The second method uses a purely theoretical technique (i.e., chi-squared Curvature Matrix theory) to estimate retrieval errors. Both methods assume that the LMA system has an overall rms timing error of 50ns, but all other possible errors (e.g., multiple sources per retrieval attempt) are neglected. The detailed spatial distributions of retrieval errors are provided. Given that the two methods are completely independent of one another, it is shown that they provide remarkably similar results, except that the chi-squared theory produces larger altitude error estimates than the (more realistic) Monte Carlo simulation.

BLAYER User Guide

NASA Technical Reports Server (NTRS)

Saunders, David A.; Prabhu, Dinesh K.

2018-01-01

A software utility employed for post-processing computational fluid dynamics solutions about atmospheric entry vehicles is described as a supplement to the documentation within the source code. This BLAYER application and its ancillary utilities are in the public domain at https://sourceforge.net/projects/cfdutilities/. BLAYER was developed at NASA Ames Research Center in support of the DPLR (Data Parallel Line Relaxation) flow solver. Its underlying algorithm has since been incorporated by others into the LAURA and US3D flow solvers at NASA Langley Research Center and the University of Minnesota respectively. The essence of the algorithm is to locate the boundary layer edge by seeking the peak curvature in a total enthalpy profile. Turning that insight into a practical tool suited to a wide range of possible profiles has led to a hybrid two-stage method. The traditional method-location of (say) 99.5% of free-stream total enthalpy-remains an option, though it may be less robust. Details are provided and multiple examples are presented.

Markstein Numbers of Negatively-Stretched Premixed Flames: Microgravity Measurements and Computations

NASA Technical Reports Server (NTRS)

Ibarreta, Alfonso F.; Driscoll, James F.; Feikema, Douglas A.; Salzman, Jack (Technical Monitor)

2001-01-01

The effect of flame stretch, composed of strain and curvature, plays a major role in the propagation of turbulent premixed flames. Although all forms of stretch (positive and negative) are present in turbulent conditions, little research has been focused on the stretch due to curvature. The present study quantifies the Markstein number (which characterizes the sensitivity of the flame propagation speed to the imposed stretch rate) for an inwardly-propagating flame (IPF). This flame is of interest because it is negatively stretched, and is subjected to curvature effects alone, without the competing effects of strain. In an extension of our previous work, microgravity experiments were run using a vortex-flame interaction to create a pocket of reactants surrounded by an IPF. Computations using the RUN-1DL code of Rogg were also performed in order to explain the measurements. It was found that the Markstein number of an inwardly-propagating flame, for both the microgravity experiment and the computations, is significantly larger than that of an outwardly-propagating flame. Further insight was gained by running the computations for the simplified (hypothetical) cases of one step chemistry, unity Lewis number, and negligible heat release. Results provide additional evidence that the Markstein numbers associated with strain and curvature have different values.

Ultrasoft Electronics for Hyperelastic Strain, Pressure, and Direct Curvature Sensing

NASA Astrophysics Data System (ADS)

Majidi, Carmel; Kramer, Rebecca; Wood, Robert

2011-03-01

Progress in soft robotics, wearable computing, and programmable matter demands a new class of ultrasoft electronics for tactile control, contact detection, and deformation mapping. This next generation of sensors will remain electrically functional under extreme deformation without influencing the natural mechanics of the host system. Ultrasoft strain and pressure sensing has previously been demonstrated with elastomer sheets (eg. PDMS, silicone rubber) embedded with microchannels of conductive liquid (mercury, eGaIn). Building on these efforts, we introduce a novel method for direct curvature sensing that registers the location and intensity of surface curvature. An elastomer sheet is embedded with micropatterned cavities and microchannels of conductive liquid. Bending the elastomer or placing it on a curved surface leads to a change in channel cross-section and a corresponding change in its electrical resistance. In contrast to conventional methods of curvature sensing, this approach does not depend on semi-rigid components or differential strain measurement. Direct curvature sensing completes the portfolio of sensing elements required to completely map hyperelastic deformation for future soft robotics and computing. NSF MRSEC DMR-0820484.

Directable weathering of concave rock using curvature estimation.

PubMed

Jones, Michael D; Farley, McKay; Butler, Joseph; Beardall, Matthew

2010-01-01

We address the problem of directable weathering of exposed concave rock for use in computer-generated animation or games. Previous weathering models that admit concave surfaces are computationally inefficient and difficult to control. In nature, the spheroidal and cavernous weathering rates depend on the surface curvature. Spheroidal weathering is fastest in areas with large positive mean curvature and cavernous weathering is fastest in areas with large negative mean curvature. We simulate both processes using an approximation of mean curvature on a voxel grid. Both weathering rates are also influenced by rock durability. The user controls rock durability by editing a durability graph before and during weathering simulation. Simulations of rockfall and colluvium deposition further improve realism. The profile of the final weathered rock matches the shape of the durability graph up to the effects of weathering and colluvium deposition. We demonstrate the top-down directability and visual plausibility of the resulting model through a series of screenshots and rendered images. The results include the weathering of a cube into a sphere and of a sheltered inside corner into a cavern as predicted by the underlying geomorphological models.

Sensory prediction on a whiskered robot: a tactile analogy to “optical flow”

PubMed Central

Schroeder, Christopher L.; Hartmann, Mitra J. Z.

2012-01-01

When an animal moves an array of sensors (e.g., the hand, the eye) through the environment, spatial and temporal gradients of sensory data are related by the velocity of the moving sensory array. In vision, the relationship between spatial and temporal brightness gradients is quantified in the “optical flow” equation. In the present work, we suggest an analog to optical flow for the rodent vibrissal (whisker) array, in which the perceptual intensity that “flows” over the array is bending moment. Changes in bending moment are directly related to radial object distance, defined as the distance between the base of a whisker and the point of contact with the object. Using both simulations and a 1×5 array (row) of artificial whiskers, we demonstrate that local object curvature can be estimated based on differences in radial distance across the array. We then develop two algorithms, both based on tactile flow, to predict the future contact points that will be obtained as the whisker array translates along the object. The translation of the robotic whisker array represents the rat's head velocity. The first algorithm uses a calculation of the local object slope, while the second uses a calculation of the local object curvature. Both algorithms successfully predict future contact points for simple surfaces. The algorithm based on curvature was found to more accurately predict future contact points as surfaces became more irregular. We quantify the inter-related effects of whisker spacing and the object's spatial frequencies, and examine the issues that arise in the presence of real-world noise, friction, and slip. PMID:23097641

Sensory prediction on a whiskered robot: a tactile analogy to "optical flow".

PubMed

Schroeder, Christopher L; Hartmann, Mitra J Z

2012-01-01

When an animal moves an array of sensors (e.g., the hand, the eye) through the environment, spatial and temporal gradients of sensory data are related by the velocity of the moving sensory array. In vision, the relationship between spatial and temporal brightness gradients is quantified in the "optical flow" equation. In the present work, we suggest an analog to optical flow for the rodent vibrissal (whisker) array, in which the perceptual intensity that "flows" over the array is bending moment. Changes in bending moment are directly related to radial object distance, defined as the distance between the base of a whisker and the point of contact with the object. Using both simulations and a 1×5 array (row) of artificial whiskers, we demonstrate that local object curvature can be estimated based on differences in radial distance across the array. We then develop two algorithms, both based on tactile flow, to predict the future contact points that will be obtained as the whisker array translates along the object. The translation of the robotic whisker array represents the rat's head velocity. The first algorithm uses a calculation of the local object slope, while the second uses a calculation of the local object curvature. Both algorithms successfully predict future contact points for simple surfaces. The algorithm based on curvature was found to more accurately predict future contact points as surfaces became more irregular. We quantify the inter-related effects of whisker spacing and the object's spatial frequencies, and examine the issues that arise in the presence of real-world noise, friction, and slip.

Stretching a Curved Surface in a Viscous Fluid

NASA Astrophysics Data System (ADS)

Sajid, M.; N., Ali; T., Javed; Z., Abbas

2010-02-01

This work is concerned with the viscous flow due to a curved stretching sheet. The similarity solution of the problem is obtained numerically by a shooting method using the Runge-Kutta algorithm. The physical quantities of interest like the fluid velocity and skin friction coefficient are obtained and discussed under the influence of dimensionless curvature. It is evident from the results that dimensionless curvature causes an increase in boundary layer thickness and a decrease in the skin friction coefficient.

Compensation of Gaussian curvature in developable cones is local

NASA Astrophysics Data System (ADS)

Wang, Jin W.; Witten, Thomas A.

2009-10-01

We use the angular deficit scheme [V. Borrelli, F. Cazals, and J.-M. Morvan, Comput. Aided Geom. Des. 20, 319 (2003)] to determine the distribution of Gaussian curvature in developable cones (d-cones) [E. Cerda, S. Chaieb, F. Melo, and L. Mahadevan, Nature (London) 401, 46 (1999)] numerically. These d-cones are formed by pushing a thin elastic sheet into a circular container. Negative Gaussian curvatures are identified at the rim where the sheet touches the container. Around the rim there are two narrow bands with positive Gaussian curvatures. The integral of the (negative) Gaussian curvature near the rim is almost completely compensated by that of the two adjacent bands. This suggests that the Gauss-Bonnet theorem which constrains the integral of Gaussian curvature globally does not explain the spontaneous curvature cancellation phenomenon [T. Liang and T. A. Witten, Phys. Rev. E 73, 046604 (2006)]. The locality of the compensation seems to increase for decreasing d-cone thickness. The angular deficit scheme also provides a way to confirm the curvature cancellation phenomenon.

BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

PubMed

Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

2013-02-01

Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of streamline tractography algorithms or the assumption of a noise distribution. Moreover, the BootGraph can be applied to common DTI data sets without further modifications and shows a high repeatability. Thus, it is very well suited for longitudinal studies and meta-studies based on DTI. Copyright © 2012 Elsevier Inc. All rights reserved.

Extraction of Features from High-resolution 3D LiDaR Point-cloud Data

NASA Astrophysics Data System (ADS)

Keller, P.; Kreylos, O.; Hamann, B.; Kellogg, L. H.; Cowgill, E. S.; Yikilmaz, M. B.; Hering-Bertram, M.; Hagen, H.

2008-12-01

Airborne and tripod-based LiDaR scans are capable of producing new insight into geologic features by providing high-quality 3D measurements of the landscape. High-resolution LiDaR is a promising method for studying slip on faults, erosion, and other landscape-altering processes. LiDaR scans can produce up to several billion individual point returns associated with the reflection of a laser from natural and engineered surfaces; these point clouds are typically used to derive a high-resolution digital elevation model (DEM). Currently, there exist only few methods that can support the analysis of the data at full resolution and in the natural 3D perspective in which it was collected by working directly with the points. We are developing new algorithms for extracting features from LiDaR scans, and present method for determining the local curvature of a LiDaR data set, working directly with the individual point returns of a scan. Computing the curvature enables us to rapidly and automatically identify key features such as ridge-lines, stream beds, and edges of terraces. We fit polynomial surface patches via a moving least squares (MLS) approach to local point neighborhoods, determining curvature values for each point. The size of the local point neighborhood is defined by a user. Since both terrestrial and airborne LiDaR scans suffer from high noise, we apply additional pre- and post-processing smoothing steps to eliminate unwanted features. LiDaR data also captures objects like buildings and trees complicating greatly the task of extracting reliable curvature values. Hence, we use a stochastic approach to determine whether a point can be reliably used to estimate curvature or not. Additionally, we have developed a graph-based approach to establish connectivities among points that correspond to regions of high curvature. The result is an explicit description of ridge-lines, for example. We have applied our method to the raw point cloud data collected as part of the GeoEarthScope B-4 project on a section of the San Andreas Fault (Segment SA09). This section provides an excellent test site for our method as it exposes the fault clearly, contains few extraneous structures, and exhibits multiple dry stream-beds that have been off-set by motion on the fault.

Isolating Curvature Effects in Computing Wall-Bounded Turbulent Flows

NASA Technical Reports Server (NTRS)

Rumsey, Christopher L.; Gatski, Thomas B.

2001-01-01

The flow over the zero-pressure-gradient So-Mellor convex curved wall is simulated using the Navier-Stokes equations. An inviscid effective outer wall shape, undocumented in the experiment, is obtained by using an adjoint optimization method with the desired pressure distribution on the inner wall as the cost function. Using this wall shape with a Navier-Stokes method, the abilities of various turbulence models to simulate the effects of curvature without the complicating factor of streamwise pressure gradient can be evaluated. The one-equation Spalart-Allmaras turbulence model overpredicts eddy viscosity, and its boundary layer profiles are too full. A curvature-corrected version of this model improves results, which are sensitive to the choice of a particular constant. An explicit algebraic stress model does a reasonable job predicting this flow field. However, results can be slightly improved by modifying the assumption on anisotropy equilibrium in the model's derivation. The resulting curvature-corrected explicit algebraic stress model possesses no heuristic functions or additional constants. It lowers slightly the computed skin friction coefficient and the turbulent stress levels for this case (in better agreement with experiment), but the effect on computed velocity profiles is very small.

Curvature-undulation coupling as a basis for curvature sensing and generation in bilayer membranes.

PubMed

Bradley, Ryan P; Radhakrishnan, Ravi

2016-08-30

We present coarse-grained molecular dynamics simulations of the epsin N-terminal homology domain interacting with a lipid bilayer and demonstrate a rigorous theoretical formalism and analysis method for computing the induced curvature field in varying concentrations of the protein in the dilute limit. Our theory is based on the description of the height-height undulation spectrum in the presence of a curvature field. We formulated an objective function to compare the acquired undulation spectrum from the simulations to that of the theory. We recover the curvature field parameters by minimizing the objective function even in the limit where the protein-induced membrane curvature is of the same order as the amplitude due to thermal undulations. The coupling between curvature and undulations leads to significant predictions: (i) Under dilute conditions, the proteins can sense a site of spontaneous curvature at distances much larger than their size; (ii) as the density of proteins increases the coupling focuses and stabilizes the curvature field to the site of the proteins; and (iii) the mapping of the protein localization and the induction of a stable curvature is a cooperative process that can be described through a Hill function.

A critical analysis of the surgical outcomes for the treatment of Peyronie’s disease

PubMed Central

Mandava, Sree H.; Trost, Landon W.; Hellstrom, Wayne J.G.

2013-01-01

Peyronie’s disease (PD) is a relatively common condition, which can impair sexual function and result in emotional and psychological distress. Despite an abundance of minimally invasive treatments, few have confirmed efficacy for improving penile curvature and function. Surgical therapies include many different techniques and are reserved for patients with stable disease of ⩾12 months’ duration. We searched PubMed for all articles from 1990 to the present relating to the surgical management of PD. Preference was given to recent articles, larger series, and those comparing various techniques and/or materials. Outcomes were subsequently analysed and organised by surgical technique and the graft material used. Available surgical techniques include plication/corporoplasty procedures, incision and grafting (I&G), and placing a penile prosthesis with or without adjunctive procedures. Although several surgical algorithms have been reported, in general, plication/corporoplasty procedures are reserved for patients with adequate erectile function, simple curvatures of <60°, and with no deformities (hour-glass, hinge). I&G are reserved for complex curvatures of >60° and those with deformities. Penile prostheses are indicated for combined erectile dysfunction and PD. Overall outcomes show high rates of improved curvature and patient satisfaction, with mildly decreased erectile function with both plication and the I&G procedure (I&G >plication) and decreases in penile length (plication >I&G). Surgical management of PD remains an excellent treatment option for patients with penile curvature precluding or impairing sexual activity. Surgical algorithms are available to assist treating clinicians in appropriately stratifying surgical candidates. Additional research is needed to identify optimal surgical techniques and materials based on patient and disease characteristics. PMID:26558094

Swirling Flow Computation at the Trailing Edge of Radial-Axial Hydraulic Turbines

NASA Astrophysics Data System (ADS)

Susan-Resiga, Romeo; Muntean, Sebastian; Popescu, Constantin

2016-11-01

Modern hydraulic turbines require optimized runners within a range of operating points with respect to minimum weighted average draft tube losses and/or flow instabilities. Tractable optimization methodologies must include realistic estimations of the swirling flow exiting the runner and further ingested by the draft tube, prior to runner design. The paper presents a new mathematical model and the associated numerical algorithm for computing the swirling flow at the trailing edge of Francis turbine runner, operated at arbitrary discharge. The general turbomachinery throughflow theory is particularized for an arbitrary hub-to-shroud line in the meridian half-plane and the resulting boundary value problem is solved with the finite element method. The results obtained with the present model are validated against full 3D runner flow computations within a range of discharge value. The mathematical model incorporates the full information for the relative flow direction, as well as the curvatures of the hub-to-shroud line and meridian streamlines, respectively. It is shown that the flow direction can be frozen within a range of operating points in the neighborhood of the best efficiency regime.

Foam morphology, frustration and topological defects in a Negatively curved Hele-Shaw geometry

NASA Astrophysics Data System (ADS)

Mughal, Adil; Schroeder-Turk, Gerd; Evans, Myfanwy

2014-03-01

We present preliminary simulations of foams and single bubbles confined in a narrow gap between parallel surfaces. Unlike previous work, in which the bounding surfaces are flat (the so called Hele-Shaw geometry), we consider surfaces with non-vanishing Gaussian curvature. We demonstrate that the curvature of the bounding surfaces induce a geometric frustration in the preferred order of the foam. This frustration can be relieved by the introduction of topological defects (disclinations, dislocations and complex scar arrangements). We give a detailed analysis of these defects for foams confined in curved Hele-Shaw cells and compare our results with exotic honeycombs, built by bees on surfaces of varying Gaussian curvature. Our simulations, while encompassing surfaces of constant Gaussian curvature (such as the sphere and the cylinder), focus on surfaces with negative Gaussian curvature and in particular triply periodic minimal surfaces (such as the Schwarz P-surface and the Schoen's Gyroid surface). We use the results from a sphere-packing algorithm to generate a Voronoi partition that forms the basis of a Surface Evolver simulation, which yields a realistic foam morphology.

Autonomous subpixel satellite track end point determination for space-based images.

PubMed

Simms, Lance M

2011-08-01

An algorithm for determining satellite track end points with subpixel resolution in spaced-based images is presented. The algorithm allows for significant curvature in the imaged track due to rotation of the spacecraft capturing the image. The motivation behind the subpixel end point determination is first presented, followed by a description of the methodology used. Results from running the algorithm on real ground-based and simulated spaced-based images are shown to highlight its effectiveness.

Estimation of surface curvature from full-field shape data using principal component analysis

NASA Astrophysics Data System (ADS)

Sharma, Sameer; Vinuchakravarthy, S.; Subramanian, S. J.

2017-01-01

Three-dimensional digital image correlation (3D-DIC) is a popular image-based experimental technique for estimating surface shape, displacements and strains of deforming objects. In this technique, a calibrated stereo rig is used to obtain and stereo-match pairs of images of the object of interest from which the shapes of the imaged surface are then computed using the calibration parameters of the rig. Displacements are obtained by performing an additional temporal correlation of the shapes obtained at various stages of deformation and strains by smoothing and numerically differentiating the displacement data. Since strains are of primary importance in solid mechanics, significant efforts have been put into computation of strains from the measured displacement fields; however, much less attention has been paid to date to computation of curvature from the measured 3D surfaces. In this work, we address this gap by proposing a new method of computing curvature from full-field shape measurements using principal component analysis (PCA) along the lines of a similar work recently proposed to measure strains (Grama and Subramanian 2014 Exp. Mech. 54 913-33). PCA is a multivariate analysis tool that is widely used to reveal relationships between a large number of variables, reduce dimensionality and achieve significant denoising. This technique is applied here to identify dominant principal components in the shape fields measured by 3D-DIC and these principal components are then differentiated systematically to obtain the first and second fundamental forms used in the curvature calculation. The proposed method is first verified using synthetically generated noisy surfaces and then validated experimentally on some real world objects with known ground-truth curvatures.

Bearing optimization for SSME HPOTP application

NASA Technical Reports Server (NTRS)

Armstrong, Elizabeth S.; Coe, Harold H.

1988-01-01

The space shuttle main engine (SSME) high-pressure oxygen turbopumps (HPOTP) have not experienced the service life required of them. To improve the life of the existing turbopump bearings, modifications to the bearings that could be retrofitted into the present bearing cavity are being investigated. Several bearing parameters were optimized using the computer program SHABERTH, which performs a thermomechanical simulation of a load support system. The computer analysis showed that improved bearing performance is feasible if low friction coefficients can be attained. Bearing geometries were optimized considering heat generation, equilibrium temperatures, and relative life. Two sets of curvatures were selected from the optimization: an inner-raceway curvature of 0.54, an outer-raceway curvature of 0.52, and an inner-raceway curvature of 0.55, an outer-raceway curvature of 0.53. A contact angle of 16 deg was also selected. Thermal gradients through the bearings were found to be lower with liquid lubrication than with solid film lubrication. As the coolant flowrate through the bearing increased, the ball temperature decreased but at a continuously decreasing rate. The optimum flowrate was approximately 4 kg/s. The analytical modeling used to determine these feasible modifications to improve bearing performance is described.

The influence of artery wall curvature on the anatomical assessment of stenosis severity derived from fractional flow reserve: a computational fluid dynamics study.

PubMed

Govindaraju, Kalimuthu; Viswanathan, Girish N; Badruddin, Irfan Anjum; Kamangar, Sarfaraz; Salman Ahmed, N J; Al-Rashed, Abdullah A A A

2016-11-01

This study aims to investigate the influence of artery wall curvature on the anatomical assessment of stenosis severity and to identify a region of misinterpretation in the assessment of per cent area stenosis (AS) for functionally significant stenosis using fractional flow reserve (FFR) as standard. Five artery models of different per cent AS severity (70, 75, 80, 85 and 90%) were considered. For each per cent AS severity, the angle of curvature of the arterial wall varied from straight to an increasingly curved model (0°, 30°, 60°, 90° and 120°). Computational fluid dynamics was performed under transient physiologic hyperemic flow conditions to investigate the influence of artery wall curvature on the pressure drop and the FFR. The findings in this study may be useful in in vitro anatomical assessment of functionally significant stenosis. The FFR decreased with increasing stenosis severity for a given curvature of the artery wall. Moreover, a significant decrease in FFR was found between straight and curved models discussed for a given severity condition. These findings indicate that the curvature effect was included in the FFR assessment in contrast to minimum lumen area (MLA) or per cent AS assessment. The MLA or per cent AS assessment may lead to underestimation of stenosis severity. From this numerical study, an uncertainty region could be evaluated using the clinical FFR cutoff value of 0.8. This value was observed at 81.98 and 79.10% AS for arteries with curvature angles of 0° and 120° respectively. In conclusion, the curvature of the artery should not be neglected in in vitro anatomical assessment.

The compensation of Gaussian curvature in developable cones is local

NASA Astrophysics Data System (ADS)

Wang, Jin; Witten, Thomas

2009-03-01

We use the angular deficit scheme[1] to determine numerically the distribution of Gaussian curvature in developable cones(d-cones)[2] formed by forcing a flat elastic sheet into a circular container so that the sheet buckles. This provides a new way to confirm the vanishing of mean-curvature[3] at the rim where the sheet touches the container. This angular deficit scheme also allows us to explore the potential role of the Gauss-Bonnet theorem in explaining the mean-curvature vanishing phenomenon. The theorem's global constraint on curvature resembles the global conditions observed to be relevant for vanishing mean curvature. However, our result suggests that the Gauss-Bonnet theorem does not explain the vanishing of mean-curvature. [1] V. Borrelli, F. Cazals, and J.-M. Morvan, Computer Aided Geometric Design 20, 319 (2003). [2] E. Cerda, S. Chaieb, F. Melo, and L. Mahadevan, Nature 401, 46 (1999). [3] T. Liang and T. A. Witten, Phys. Rev. E 73, 046604 (2006).

Dynamic Speed Adaptation for Path Tracking Based on Curvature Information and Speed Limits.

PubMed

Gámez Serna, Citlalli; Ruichek, Yassine

2017-06-14

A critical concern of autonomous vehicles is safety. Different approaches have tried to enhance driving safety to reduce the number of fatal crashes and severe injuries. As an example, Intelligent Speed Adaptation (ISA) systems warn the driver when the vehicle exceeds the recommended speed limit. However, these systems only take into account fixed speed limits without considering factors like road geometry. In this paper, we consider road curvature with speed limits to automatically adjust vehicle's speed with the ideal one through our proposed Dynamic Speed Adaptation (DSA) method. Furthermore, 'curve analysis extraction' and 'speed limits database creation' are also part of our contribution. An algorithm that analyzes GPS information off-line identifies high curvature segments and estimates the speed for each curve. The speed limit database contains information about the different speed limit zones for each traveled path. Our DSA senses speed limits and curves of the road using GPS information and ensures smooth speed transitions between current and ideal speeds. Through experimental simulations with different control algorithms on real and simulated datasets, we prove that our method is able to significantly reduce lateral errors on sharp curves, to respect speed limits and consequently increase safety and comfort for the passenger.

Event and Apparent Horizon Finders for 3 + 1 Numerical Relativity.

PubMed

Thornburg, Jonathan

2007-01-01

Event and apparent horizons are key diagnostics for the presence and properties of black holes. In this article I review numerical algorithms and codes for finding event and apparent horizons in numerically-computed spacetimes, focusing on calculations done using the 3 + 1 ADM formalism. The event horizon of an asymptotically-flat spacetime is the boundary between those events from which a future-pointing null geodesic can reach future null infinity and those events from which no such geodesic exists. The event horizon is a (continuous) null surface in spacetime. The event horizon is defined nonlocally in time : it is a global property of the entire spacetime and must be found in a separate post-processing phase after all (or at least the nonstationary part) of spacetime has been numerically computed. There are three basic algorithms for finding event horizons, based on integrating null geodesics forwards in time, integrating null geodesics backwards in time, and integrating null surfaces backwards in time. The last of these is generally the most efficient and accurate. In contrast to an event horizon, an apparent horizon is defined locally in time in a spacelike slice and depends only on data in that slice, so it can be (and usually is) found during the numerical computation of a spacetime. A marginally outer trapped surface (MOTS) in a slice is a smooth closed 2-surface whose future-pointing outgoing null geodesics have zero expansion Θ. An apparent horizon is then defined as a MOTS not contained in any other MOTS. The MOTS condition is a nonlinear elliptic partial differential equation (PDE) for the surface shape, containing the ADM 3-metric, its spatial derivatives, and the extrinsic curvature as coefficients. Most "apparent horizon" finders actually find MOTSs. There are a large number of apparent horizon finding algorithms, with differing trade-offs between speed, robustness, accuracy, and ease of programming. In axisymmetry, shooting algorithms work well and are fairly easy to program. In slices with no continuous symmetries, spectral integral-iteration algorithms and elliptic-PDE algorithms are fast and accurate, but require good initial guesses to converge. In many cases, Schnetter's "pretracking" algorithm can greatly improve an elliptic-PDE algorithm's robustness. Flow algorithms are generally quite slow but can be very robust in their convergence. Minimization methods are slow and relatively inaccurate in the context of a finite differencing simulation, but in a spectral code they can be relatively faster and more robust.

Automated quasi-3D spine curvature quantification and classification

NASA Astrophysics Data System (ADS)

Khilari, Rupal; Puchin, Juris; Okada, Kazunori

2018-02-01

Scoliosis is a highly prevalent spine deformity that has traditionally been diagnosed through measurement of the Cobb angle on radiographs. More recent technology such as the commercial EOS imaging system, although more accurate, also require manual intervention for selecting the extremes of the vertebrae forming the Cobb angle. This results in a high degree of inter and intra observer error in determining the extent of spine deformity. Our primary focus is to eliminate the need for manual intervention by robustly quantifying the curvature of the spine in three dimensions, making it consistent across multiple observers. Given the vertebrae centroids, the proposed Vertebrae Sequence Angle (VSA) estimation and segmentation algorithm finds the largest angle between consecutive pairs of centroids within multiple inflection points on the curve. To exploit existing clinical diagnostic standards, the algorithm uses a quasi-3-dimensional approach considering the curvature in the coronal and sagittal projection planes of the spine. Experiments were performed with manuallyannotated ground-truth classification of publicly available, centroid-annotated CT spine datasets. This was compared with the results obtained from manual Cobb and Centroid angle estimation methods. Using the VSA, we then automatically classify the occurrence and the severity of spine curvature based on Lenke's classification for idiopathic scoliosis. We observe that the results appear promising with a scoliotic angle lying within +/- 9° of the Cobb and Centroid angle, and vertebrae positions differing by at the most one position. Our system also resulted in perfect classification of scoliotic from healthy spines with our dataset with six cases.

Curvature–undulation coupling as a basis for curvature sensing and generation in bilayer membranes

PubMed Central

Bradley, Ryan P.; Radhakrishnan, Ravi

2016-01-01

We present coarse-grained molecular dynamics simulations of the epsin N-terminal homology domain interacting with a lipid bilayer and demonstrate a rigorous theoretical formalism and analysis method for computing the induced curvature field in varying concentrations of the protein in the dilute limit. Our theory is based on the description of the height–height undulation spectrum in the presence of a curvature field. We formulated an objective function to compare the acquired undulation spectrum from the simulations to that of the theory. We recover the curvature field parameters by minimizing the objective function even in the limit where the protein-induced membrane curvature is of the same order as the amplitude due to thermal undulations. The coupling between curvature and undulations leads to significant predictions: (i) Under dilute conditions, the proteins can sense a site of spontaneous curvature at distances much larger than their size; (ii) as the density of proteins increases the coupling focuses and stabilizes the curvature field to the site of the proteins; and (iii) the mapping of the protein localization and the induction of a stable curvature is a cooperative process that can be described through a Hill function. PMID:27531962

Acetabular rim and surface segmentation for hip surgery planning and dysplasia evaluation

NASA Astrophysics Data System (ADS)

Tan, Sovira; Yao, Jianhua; Yao, Lawrence; Summers, Ronald M.; Ward, Michael M.

2008-03-01

Knowledge of the acetabular rim and surface can be invaluable for hip surgery planning and dysplasia evaluation. The acetabular rim can also be used as a landmark for registration purposes. At the present time acetabular features are mostly extracted manually at great cost of time and human labor. Using a recent level set algorithm that can evolve on the surface of a 3D object represented by a triangular mesh we automatically extracted rims and surfaces of acetabulae. The level set is guided by curvature features on the mesh. It can segment portions of a surface that are bounded by a line of extremal curvature (ridgeline or crestline). The rim of the acetabulum is such an extremal curvature line. Our material consists of eight hemi-pelvis surfaces. The algorithm is initiated by putting a small circle (level set seed) at the center of the acetabular surface. Because this surface distinctively has the form of a cup we were able to use the Shape Index feature to automatically extract an approximate center. The circle then expands and deforms so as to take the shape of the acetabular rim. The results were visually inspected. Only minor errors were detected. The algorithm also proved to be robust. Seed placement was satisfactory for the eight hemi-pelvis surfaces without changing any parameters. For the level set evolution we were able to use a single set of parameters for seven out of eight surfaces.

Dynamics of spherical metallic particles in cylinder electrostatic separators/purifiers.

PubMed

Lu, Hong-Zhou; Li, Jia; Guo, Jie; Xu, Zhen-Ming

2008-08-15

This paper presents a theoretical analysis of the dynamics of spherical metallic particles in electrostatic separators/purifiers (ESPs). The particle equations of motion are numerically solved in two dimensions using a computational algorithm. The ESPs consist of a pair of conductor cylinder electrodes. The upper cylinder is energized by HVdc, while the lower one is grounded and fixed horizontally on a revolvable axis. Some phenomena and aspects of separation process are explained and depicted including lifting off, impact, "motion collapse" and "sudden bouncing". The results reveal that the several phenomena depend on initial position, radius and density of the particle, curvature of the cylinder electrodes, distance between the electrodes and amplitude of the applied voltage. Optimization of the parameters is presented in order to get better separation/purification processes.

Automated classification and quantitative analysis of arterial and venous vessels in fundus images

NASA Astrophysics Data System (ADS)

Alam, Minhaj; Son, Taeyoon; Toslak, Devrim; Lim, Jennifer I.; Yao, Xincheng

2018-02-01

It is known that retinopathies may affect arteries and veins differently. Therefore, reliable differentiation of arteries and veins is essential for computer-aided analysis of fundus images. The purpose of this study is to validate one automated method for robust classification of arteries and veins (A-V) in digital fundus images. We combine optical density ratio (ODR) analysis and blood vessel tracking algorithm to classify arteries and veins. A matched filtering method is used to enhance retinal blood vessels. Bottom hat filtering and global thresholding are used to segment the vessel and skeleton individual blood vessels. The vessel tracking algorithm is used to locate the optic disk and to identify source nodes of blood vessels in optic disk area. Each node can be identified as vein or artery using ODR information. Using the source nodes as starting point, the whole vessel trace is then tracked and classified as vein or artery using vessel curvature and angle information. 50 color fundus images from diabetic retinopathy patients were used to test the algorithm. Sensitivity, specificity, and accuracy metrics were measured to assess the validity of the proposed classification method compared to ground truths created by two independent observers. The algorithm demonstrated 97.52% accuracy in identifying blood vessels as vein or artery. A quantitative analysis upon A-V classification showed that average A-V ratio of width for NPDR subjects with hypertension decreased significantly (43.13%).

Evaluating the performance of the two-phase flow solver interFoam

NASA Astrophysics Data System (ADS)

Deshpande, Suraj S.; Anumolu, Lakshman; Trujillo, Mario F.

2012-01-01

The performance of the open source multiphase flow solver, interFoam, is evaluated in this work. The solver is based on a modified volume of fluid (VoF) approach, which incorporates an interfacial compression flux term to mitigate the effects of numerical smearing of the interface. It forms a part of the C + + libraries and utilities of OpenFOAM and is gaining popularity in the multiphase flow research community. However, to the best of our knowledge, the evaluation of this solver is confined to the validation tests of specific interest to the users of the code and the extent of its applicability to a wide range of multiphase flow situations remains to be explored. In this work, we have performed a thorough investigation of the solver performance using a variety of verification and validation test cases, which include (i) verification tests for pure advection (kinematics), (ii) dynamics in the high Weber number limit and (iii) dynamics of surface tension-dominated flows. With respect to (i), the kinematics tests show that the performance of interFoam is generally comparable with the recent algebraic VoF algorithms; however, it is noticeably worse than the geometric reconstruction schemes. For (ii), the simulations of inertia-dominated flows with large density ratios {\\sim }\\mathscr {O}(10^3) yielded excellent agreement with analytical and experimental results. In regime (iii), where surface tension is important, consistency of pressure-surface tension formulation and accuracy of curvature are important, as established by Francois et al (2006 J. Comput. Phys. 213 141-73). Several verification tests were performed along these lines and the main findings are: (a) the algorithm of interFoam ensures a consistent formulation of pressure and surface tension; (b) the curvatures computed by the solver converge to a value slightly (10%) different from the analytical value and a scope for improvement exists in this respect. To reduce the disruptive effects of spurious currents, we followed the analysis of Galusinski and Vigneaux (2008 J. Comput. Phys. 227 6140-64) and arrived at the following criterion for stable capillary simulations for interFoam: \\Delta t\\leqslant \\max (10\\tau _\\mu , 0.1\\tau _\\rho) where \\tau _\\mu =\\mu \\Delta x/\\sigma ,~ {and}~\\tau _\\rho =\\sqrt {\\rho \\Delta x^3/\\sigma } . Finally, some capillary flows relevant to atomization were simulated, resulting in good agreement with the results from the literature.

A multi-damages identification method for cantilever beam based on mode shape curvatures and Kriging surrogate model

NASA Astrophysics Data System (ADS)

Xie, Fengle; Jiang, Zhansi; Jiang, Hui

2018-05-01

This paper presents a multi-damages identification method for Cantilever Beam. First, the damage location is identified by using the mode shape curvatures. Second, samples of varying damage severities at the damage location and their corresponding natural frequencies are used to construct the initial Kriging surrogate model. Then a particle swarm optimization (PSO) algorithm is employed to identify the damage severities based on Kriging surrogate model. The simulation study of a double-damaged cantilever beam demonstrated that the proposed method is effective.

Ultra-short beam expander with segmented curvature control: the emergence of a semi-lens

DOE PAGES

Abbaslou, Siamak; Gatdula, Robert; Lu, Ming; ...

2017-01-01

We introduce direct curvature control in designing a segmented beam expander, and explore novel design possibilities for ultra-compact beam expanders. Assisted by the particle swarm optimization algorithm, we search for an optimal curvature-controlled multi-segment taper that maintains width continuity. Counterintuitively, the optimization yields a structure with abrupt width discontinuity and width compression features. Through spatial phase and parameterized analysis, a semi-lens feature is revealed that helps to flatten the wavefront at the output end for higher coupling efficiency. Such functionality cannot be achieved by normal tapers in a short distance. The structure is fabricated and characterized experimentally. By a figuremore » of merit that accounts for expansion ratio, length, and efficiency, this structure outperforms an adiabatic taper by 9 times.« less

Visualization of a Numerical Simulation of GW 150914

NASA Astrophysics Data System (ADS)

Rosato, Nicole; Healy, James; Lousto, Carlos

2017-01-01

We present an analysis of a simulation displaying apparent horizon curvature and radiation emitted from a binary black hole system modeling GW-150914 during merger. The simulation follows the system from seven orbits prior to merger to the resultant Kerr black hole. Horizon curvature was calculated using a mean curvature flow algorithm. Radiation data was visualized via the Ψ4 component of the Weyl scalars, which were determined using a numerical quasi-Kinnersley method. We also present a comparative study of the differences in quasi-Kinnersley and PsiKadelia tetrads to construct Ψ4. The analysis is displayed on a movie generated from these numerical results, and was done using VisIt software from Lawrence Livermore National Laboratory. This simulation and analysis gives more insight into the merger of the system GW 150914.

Automated Coronal Loop Identification Using Digital Image Processing Techniques

NASA Technical Reports Server (NTRS)

Lee, Jong K.; Gary, G. Allen; Newman, Timothy S.

2003-01-01

The results of a master thesis project on a study of computer algorithms for automatic identification of optical-thin, 3-dimensional solar coronal loop centers from extreme ultraviolet and X-ray 2-dimensional images will be presented. These center splines are proxies of associated magnetic field lines. The project is pattern recognition problems in which there are no unique shapes or edges and in which photon and detector noise heavily influence the images. The study explores extraction techniques using: (1) linear feature recognition of local patterns (related to the inertia-tensor concept), (2) parametric space via the Hough transform, and (3) topological adaptive contours (snakes) that constrains curvature and continuity as possible candidates for digital loop detection schemes. We have developed synthesized images for the coronal loops to test the various loop identification algorithms. Since the topology of these solar features is dominated by the magnetic field structure, a first-order magnetic field approximation using multiple dipoles provides a priori information in the identification process. Results from both synthesized and solar images will be presented.

Thermodynamics and computation during collective motion near criticality

NASA Astrophysics Data System (ADS)

Crosato, Emanuele; Spinney, Richard E.; Nigmatullin, Ramil; Lizier, Joseph T.; Prokopenko, Mikhail

2018-01-01

We study self-organization of collective motion as a thermodynamic phenomenon in the context of the first law of thermodynamics. It is expected that the coherent ordered motion typically self-organises in the presence of changes in the (generalized) internal energy and of (generalized) work done on, or extracted from, the system. We aim to explicitly quantify changes in these two quantities in a system of simulated self-propelled particles and contrast them with changes in the system's configuration entropy. In doing so, we adapt a thermodynamic formulation of the curvatures of the internal energy and the work, with respect to two parameters that control the particles' alignment. This allows us to systematically investigate the behavior of the system by varying the two control parameters to drive the system across a kinetic phase transition. Our results identify critical regimes and show that during the phase transition, where the configuration entropy of the system decreases, the rates of change of the work and of the internal energy also decrease, while their curvatures diverge. Importantly, the reduction of entropy achieved through expenditure of work is shown to peak at criticality. We relate this both to a thermodynamic efficiency and the significance of the increased order with respect to a computational path. Additionally, this study provides an information-geometric interpretation of the curvature of the internal energy as the difference between two curvatures: the curvature of the free entropy, captured by the Fisher information, and the curvature of the configuration entropy.

High-performance computer aided detection system for polyp detection in CT colonography with fluid and fecal tagging

NASA Astrophysics Data System (ADS)

Liu, Jiamin; Wang, Shijun; Kabadi, Suraj; Summers, Ronald M.

2009-02-01

CT colonography (CTC) is a feasible and minimally invasive method for the detection of colorectal polyps and cancer screening. Computer-aided detection (CAD) of polyps has improved consistency and sensitivity of virtual colonoscopy interpretation and reduced interpretation burden. A CAD system typically consists of four stages: (1) image preprocessing including colon segmentation; (2) initial detection generation; (3) feature selection; and (4) detection classification. In our experience, three existing problems limit the performance of our current CAD system. First, highdensity orally administered contrast agents in fecal-tagging CTC have scatter effects on neighboring tissues. The scattering manifests itself as an artificial elevation in the observed CT attenuation values of the neighboring tissues. This pseudo-enhancement phenomenon presents a problem for the application of computer-aided polyp detection, especially when polyps are submerged in the contrast agents. Second, general kernel approach for surface curvature computation in the second stage of our CAD system could yield erroneous results for thin structures such as small (6-9 mm) polyps and for touching structures such as polyps that lie on haustral folds. Those erroneous curvatures will reduce the sensitivity of polyp detection. The third problem is that more than 150 features are selected from each polyp candidate in the third stage of our CAD system. These high dimensional features make it difficult to learn a good decision boundary for detection classification and reduce the accuracy of predictions. Therefore, an improved CAD system for polyp detection in CTC data is proposed by introducing three new techniques. First, a scale-based scatter correction algorithm is applied to reduce pseudo-enhancement effects in the image pre-processing stage. Second, a cubic spline interpolation method is utilized to accurately estimate curvatures for initial detection generation. Third, a new dimensionality reduction classifier, diffusion map and local linear embedding (DMLLE), is developed for classification and false positives (FP) reduction. Performance of the improved CAD system is evaluated and compared with our existing CAD system (without applying those techniques) using CT scans of 1186 patients. These scans are divided into a training set and a test set. The sensitivity of the improved CAD system increased 18% on training data at a rate of 5 FPs per patient and 15% on test data at a rate of 5 FPs per patient. Our results indicated that the improved CAD system achieved significantly better performance on medium-sized colonic adenomas with higher sensitivity and lower FP rate in CTC.

Generalization of the swelling method to measure the intrinsic curvature of lipids

NASA Astrophysics Data System (ADS)

Barragán Vidal, I. A.; Müller, M.

2017-12-01

Via computer simulation of a coarse-grained model of two-component lipid bilayers, we compare two methods of measuring the intrinsic curvatures of the constituting monolayers. The first one is a generalization of the swelling method that, in addition to the assumption that the spontaneous curvature linearly depends on the composition of the lipid mixture, incorporates contributions from its elastic energy. The second method measures the effective curvature-composition coupling between the apposing leaflets of bilayer structures (planar bilayers or cylindrical tethers) to extract the spontaneous curvature. Our findings demonstrate that both methods yield consistent results. However, we highlight that the two-leaflet structure inherent to the latter method has the advantage of allowing measurements for mixed lipid systems up to their critical point of demixing as well as in the regime of high concentration (of either species).

Defining the free-energy landscape of curvature-inducing proteins on membrane bilayers

PubMed Central

Tourdot, Richard W.; Ramakrishnan, N.; Radhakrishnan, Ravi

2015-01-01

Curvature-sensing and curvature-remodeling proteins, such as Amphiphysin, Epsin, and Exo70, are known to reshape cell membranes, and this remodeling event is essential for key biophysical processes such as tubulation, exocytosis, and endocytosis. Curvature-inducing proteins can act as curvature sensors; they aggregate to membrane regions matching their intrinsic curvature; as well as induce curvature in cell membranes to stabilize emergent high curvature, nonspherical, structures such as tubules, discs, and caveolae. A definitive understanding of the interplay between protein recruitment and migration, the evolution of membrane curvature, and membrane morphological transitions is emerging but remains incomplete. Here, within a continuum framework and using the machinery of Monte Carlo simulations, we introduce and compare three free-energy methods to delineate the free-energy landscape of curvature-inducing proteins on bilayer membranes. We demonstrate the utility of the Widom test particle (or field) insertion methodology in computing the excess chemical potentials associated with curvature-inducing proteins on the membrane—in particular, we use this method to track the onset of morphological transitions in the membrane at elevated protein densities. We validate this approach by comparing the results from the Widom method with those of thermodynamic integration and Bennett acceptance ratio methods. Furthermore, the predictions from the Widom method have been tested against analytical calculations of the excess chemical potential at infinite dilution. Our results are useful in precisely quantifying the free-energy landscape, and also in determining the phase boundaries associated with curvature-induction, curvature-sensing, and morphological transitions. This approach can be extended to studies exploring the role of thermal fluctuations and other external (control) variables, such as membrane excess area, in shaping curvature-mediated interactions on bilayer membranes. PMID:25215768

Defining the free-energy landscape of curvature-inducing proteins on membrane bilayers.

PubMed

Tourdot, Richard W; Ramakrishnan, N; Radhakrishnan, Ravi

2014-08-01

Curvature-sensing and curvature-remodeling proteins, such as Amphiphysin, Epsin, and Exo70, are known to reshape cell membranes, and this remodeling event is essential for key biophysical processes such as tubulation, exocytosis, and endocytosis. Curvature-inducing proteins can act as curvature sensors; they aggregate to membrane regions matching their intrinsic curvature; as well as induce curvature in cell membranes to stabilize emergent high curvature, nonspherical, structures such as tubules, discs, and caveolae. A definitive understanding of the interplay between protein recruitment and migration, the evolution of membrane curvature, and membrane morphological transitions is emerging but remains incomplete. Here, within a continuum framework and using the machinery of Monte Carlo simulations, we introduce and compare three free-energy methods to delineate the free-energy landscape of curvature-inducing proteins on bilayer membranes. We demonstrate the utility of the Widom test particle (or field) insertion methodology in computing the excess chemical potentials associated with curvature-inducing proteins on the membrane-in particular, we use this method to track the onset of morphological transitions in the membrane at elevated protein densities. We validate this approach by comparing the results from the Widom method with those of thermodynamic integration and Bennett acceptance ratio methods. Furthermore, the predictions from the Widom method have been tested against analytical calculations of the excess chemical potential at infinite dilution. Our results are useful in precisely quantifying the free-energy landscape, and also in determining the phase boundaries associated with curvature-induction, curvature-sensing, and morphological transitions. This approach can be extended to studies exploring the role of thermal fluctuations and other external (control) variables, such as membrane excess area, in shaping curvature-mediated interactions on bilayer membranes.

Improving the FLORIS wind plant model for compatibility with gradient-based optimization

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

Thomas, Jared J.; Gebraad, Pieter MO; Ning, Andrew

The FLORIS (FLOw Redirection and Induction in Steady-state) model, a parametric wind turbine wake model that predicts steady-state wake characteristics based on wind turbine position and yaw angle, was developed for optimization of control settings and turbine locations. This article provides details on changes made to the FLORIS model to make the model more suitable for gradient-based optimization. Changes to the FLORIS model were made to remove discontinuities and add curvature to regions of non-physical zero gradient. Exact gradients for the FLORIS model were obtained using algorithmic differentiation. A set of three case studies demonstrate that using exact gradients withmore » gradient-based optimization reduces the number of function calls by several orders of magnitude. The case studies also show that adding curvature improves convergence behavior, allowing gradient-based optimization algorithms used with the FLORIS model to more reliably find better solutions to wind farm optimization problems.« less

Volume Based Curvature Attributes Illuminate Stress Effects in Contiguous Fault Blocks, Central Basin Platform, West Texas

NASA Astrophysics Data System (ADS)

Blumentritt, C. H.; Marfurt, K. J.

2005-05-01

We compute curvatures for 3-D seismic volumes covering 200+ mi2 of the Central Basin Platform in West Texas and find that these attributes illumination lineations not seen on other displays of the seismic data. We analyze the preferred orientations of these lineations defined by well imaged faults and fault zones and find that the patterns vary according to the nature of the faults bounding the blocks, mostly strike-slip, high angle reverse, or oblique slip. We perform the analysis in the pre-Mississippian section which is decoupled from the overburden by a Permian age unconformity. Our technique differs from that of previous workers in that we compute curvatures on each sample of a seismic volume using a moving subvolume rather than along surfaces interpreted from the data. In this way, we minimize high frequency variations in the results that arise from picking errors in the interpretation or noise in the data. We are able to extract and display values of curvature along time or depth slices, along horizon slices, and along poorly imaged horizons.

Turbulent flow in a 180 deg bend: Modeling and computations

NASA Technical Reports Server (NTRS)

Kaul, Upender K.

1989-01-01

A low Reynolds number k-epsilon turbulence model was presented which yields accurate predictions of the kinetic energy near the wall. The model is validated with the experimental channel flow data of Kreplin and Eckelmann. The predictions are also compared with earlier results from direct simulation of turbulent channel flow. The model is especially useful for internal flows where the inflow boundary condition of epsilon is not easily prescribed. The model partly derives from some observations based on earlier direct simulation results of near-wall turbulence. The low Reynolds number turbulence model together with an existing curvature correction appropriate to spinning cylinder flows was used to simulate the flow in a U-bend with the same radius of curvature as the Space Shuttle Main Engine (SSME) Turn-Around Duct (TAD). The present computations indicate a space varying curvature correction parameter as opposed to a constant parameter as used in the spinning cylinder flows. Comparison with limited available experimental data is made. The comparison is favorable, but detailed experimental data is needed to further improve the curvature model.

Quantifying the quality of hand movement in stroke patients through three-dimensional curvature.

PubMed

Osu, Rieko; Ota, Kazuko; Fujiwara, Toshiyuki; Otaka, Yohei; Kawato, Mitsuo; Liu, Meigen

2011-10-31

To more accurately evaluate rehabilitation outcomes in stroke patients, movement irregularities should be quantified. Previous work in stroke patients has revealed a reduction in the trajectory smoothness and segmentation of continuous movements. Clinically, the Stroke Impairment Assessment Set (SIAS) evaluates the clumsiness of arm movements using an ordinal scale based on the examiner's observations. In this study, we focused on three-dimensional curvature of hand trajectory to quantify movement, and aimed to establish a novel measurement that is independent of movement duration. We compared the proposed measurement with the SIAS score and the jerk measure representing temporal smoothness. Sixteen stroke patients with SIAS upper limb proximal motor function (Knee-Mouth test) scores ranging from 2 (incomplete performance) to 4 (mild clumsiness) were recruited. Nine healthy participant with a SIAS score of 5 (normal) also participated. Participants were asked to grasp a plastic glass and repetitively move it from the lap to the mouth and back at a conformable speed for 30 s, during which the hand movement was measured using OPTOTRAK. The position data was numerically differentiated and the three-dimensional curvature was computed. To compare against a previously proposed measure, the mean squared jerk normalized by its minimum value was computed. Age-matched healthy participants were instructed to move the glass at three different movement speeds. There was an inverse relationship between the curvature of the movement trajectory and the patient's SIAS score. The median of the -log of curvature (MedianLC) correlated well with the SIAS score, upper extremity subsection of Fugl-Meyer Assessment, and the jerk measure in the paretic arm. When the healthy participants moved slowly, the increase in the jerk measure was comparable to the paretic movements with a SIAS score of 2 to 4, while the MedianLC was distinguishable from paretic movements. Measurement based on curvature was able to quantify movement irregularities and matched well with the examiner's observations. The results suggest that the quality of paretic movements is well characterized using spatial smoothness represented by curvature. The smaller computational costs associated with this measurement suggest that this method has potential clinical utility. © 2011 Osu et al; licensee BioMed Central Ltd.

Quantifying the quality of hand movement in stroke patients through three-dimensional curvature

PubMed Central

2011-01-01

Background To more accurately evaluate rehabilitation outcomes in stroke patients, movement irregularities should be quantified. Previous work in stroke patients has revealed a reduction in the trajectory smoothness and segmentation of continuous movements. Clinically, the Stroke Impairment Assessment Set (SIAS) evaluates the clumsiness of arm movements using an ordinal scale based on the examiner's observations. In this study, we focused on three-dimensional curvature of hand trajectory to quantify movement, and aimed to establish a novel measurement that is independent of movement duration. We compared the proposed measurement with the SIAS score and the jerk measure representing temporal smoothness. Methods Sixteen stroke patients with SIAS upper limb proximal motor function (Knee-Mouth test) scores ranging from 2 (incomplete performance) to 4 (mild clumsiness) were recruited. Nine healthy participant with a SIAS score of 5 (normal) also participated. Participants were asked to grasp a plastic glass and repetitively move it from the lap to the mouth and back at a conformable speed for 30 s, during which the hand movement was measured using OPTOTRAK. The position data was numerically differentiated and the three-dimensional curvature was computed. To compare against a previously proposed measure, the mean squared jerk normalized by its minimum value was computed. Age-matched healthy participants were instructed to move the glass at three different movement speeds. Results There was an inverse relationship between the curvature of the movement trajectory and the patient's SIAS score. The median of the -log of curvature (MedianLC) correlated well with the SIAS score, upper extremity subsection of Fugl-Meyer Assessment, and the jerk measure in the paretic arm. When the healthy participants moved slowly, the increase in the jerk measure was comparable to the paretic movements with a SIAS score of 2 to 4, while the MedianLC was distinguishable from paretic movements. Conclusions Measurement based on curvature was able to quantify movement irregularities and matched well with the examiner's observations. The results suggest that the quality of paretic movements is well characterized using spatial smoothness represented by curvature. The smaller computational costs associated with this measurement suggest that this method has potential clinical utility. PMID:22040326

Differential Geometry Applied To Least-Square Error Surface Approximations

NASA Astrophysics Data System (ADS)

Bolle, Ruud M.; Sabbah, Daniel

1987-08-01

This paper focuses on extraction of the parameters of individual surfaces from noisy depth maps. The basis for this are least-square error polynomial approximations to the range data and the curvature properties that can be computed from these approximations. The curvature properties are derived using the invariants of the Weingarten Map evaluated at the origin of local coordinate systems centered at the range points. The Weingarten Map is a well-known concept in differential geometry; a brief treatment of the differential geometry pertinent to surface curvature is given. We use the curvature properties for extracting certain surface parameters from the curvature properties of the approximations. Then we show that curvature properties alone are not enough to obtain all the parameters of the surfaces; higher order properties (information about change of curvature) are needed to obtain full parametric descriptions. This surface parameter estimation problem arises in the design of a vision system to recognize 3D objects whose surfaces are composed of planar patches and patches of quadrics of revolution. (Quadrics of revolution are quadrics that are surfaces of revolution.) A significant portion of man-made objects can be modeled using these surfaces. The actual process of recognition and parameter extraction is framed as a set of stacked parameter space transforms. The transforms are "stacked" in the sense that any one transform computes only a partial geometric description that forms the input to the next transform. Those who are interested in the organization and control of the recognition and parameter recognition process are referred to [Sabbah86], this paper briefly touches upon the organization, but concentrates mainly on geometrical aspects of the parameter extraction.

Learning maximum entropy models from finite-size data sets: A fast data-driven algorithm allows sampling from the posterior distribution.

PubMed

Ferrari, Ulisse

2016-08-01

Maximum entropy models provide the least constrained probability distributions that reproduce statistical properties of experimental datasets. In this work we characterize the learning dynamics that maximizes the log-likelihood in the case of large but finite datasets. We first show how the steepest descent dynamics is not optimal as it is slowed down by the inhomogeneous curvature of the model parameters' space. We then provide a way for rectifying this space which relies only on dataset properties and does not require large computational efforts. We conclude by solving the long-time limit of the parameters' dynamics including the randomness generated by the systematic use of Gibbs sampling. In this stochastic framework, rather than converging to a fixed point, the dynamics reaches a stationary distribution, which for the rectified dynamics reproduces the posterior distribution of the parameters. We sum up all these insights in a "rectified" data-driven algorithm that is fast and by sampling from the parameters' posterior avoids both under- and overfitting along all the directions of the parameters' space. Through the learning of pairwise Ising models from the recording of a large population of retina neurons, we show how our algorithm outperforms the steepest descent method.

Topologically preserving straightening of spinal cord MRI.

PubMed

De Leener, Benjamin; Mangeat, Gabriel; Dupont, Sara; Martin, Allan R; Callot, Virginie; Stikov, Nikola; Fehlings, Michael G; Cohen-Adad, Julien

2017-10-01

To propose a robust and accurate method for straightening magnetic resonance (MR) images of the spinal cord, based on spinal cord segmentation, that preserves spinal cord topology and that works for any MRI contrast, in a context of spinal cord template-based analysis. The spinal cord curvature was computed using an iterative Non-Uniform Rational B-Spline (NURBS) approximation. Forward and inverse deformation fields for straightening were computed by solving analytically the straightening equations for each image voxel. Computational speed-up was accomplished by solving all voxel equation systems as one single system. Straightening accuracy (mean and maximum distance from straight line), computational time, and robustness to spinal cord length was evaluated using the proposed and the standard straightening method (label-based spline deformation) on 3T T 2 - and T 1 -weighted images from 57 healthy subjects and 33 patients with spinal cord compression due to degenerative cervical myelopathy (DCM). The proposed algorithm was more accurate, more robust, and faster than the standard method (mean distance = 0.80 vs. 0.83 mm, maximum distance = 1.49 vs. 1.78 mm, time = 71 vs. 174 sec for the healthy population and mean distance = 0.65 vs. 0.68 mm, maximum distance = 1.28 vs. 1.55 mm, time = 32 vs. 60 sec for the DCM population). A novel image straightening method that enables template-based analysis of quantitative spinal cord MRI data is introduced. This algorithm works for any MRI contrast and was validated on healthy and patient populations. The presented method is implemented in the Spinal Cord Toolbox, an open-source software for processing spinal cord MRI data. 1 Technical Efficacy: Stage 1 J. Magn. Reson. Imaging 2017;46:1209-1219. © 2017 International Society for Magnetic Resonance in Medicine.

Surface smoothing and template partitioning for cranial implant CAD

NASA Astrophysics Data System (ADS)

Min, Kyoung-june; Dean, David

2005-04-01

Employing patient-specific prefabricated implants can be an effective treatment for large cranial defects (i.e., > 25 cm2). We have previously demonstrated the use of Computer Aided Design (CAD) software that starts with the patient"s 3D head CT-scan. A template is accurately matched to the pre-detected skull defect margin. For unilateral cranial defects the template is derived from a left-to-right mirrored skull image. However, two problems arise: (1) slice edge artifacts generated during isosurface polygonalization are inherited by the final implant; and (2) partitioning (i.e., cookie-cutting) the implant surface from the mirrored skull image usually results in curvature discontinuities across the interface between the patient"s defect and the implant. To solve these problems, we introduce a novel space curve-to-surface partitioning algorithm following a ray-casting surface re-sampling and smoothing procedure. Specifically, the ray-cast re-sampling is followed by bilinear interpolation and low-pass filtering. The resulting surface has a highly regular grid-like topological structure of quadrilaterally arranged triangles. Then, we replace the regions to be partitioned with predefined sets of triangular elements thereby cutting the template surface to accurately fit the defect margin at high resolution and without surface curvature discontinuities. Comparisons of the CAD implants for five patients against the manually generated implant that the patient actually received show an average implant-patient gap of 0.45mm for the former and 2.96mm for the latter. Also, average maximum normalized curvature of interfacing surfaces was found to be smoother, 0.043, for the former than the latter, 0.097. This indicates that the CAD implants would provide a significantly better fit.

Dynamic Speed Adaptation for Path Tracking Based on Curvature Information and Speed Limits †

PubMed Central

Gámez Serna, Citlalli; Ruichek, Yassine

2017-01-01

A critical concern of autonomous vehicles is safety. Different approaches have tried to enhance driving safety to reduce the number of fatal crashes and severe injuries. As an example, Intelligent Speed Adaptation (ISA) systems warn the driver when the vehicle exceeds the recommended speed limit. However, these systems only take into account fixed speed limits without considering factors like road geometry. In this paper, we consider road curvature with speed limits to automatically adjust vehicle’s speed with the ideal one through our proposed Dynamic Speed Adaptation (DSA) method. Furthermore, ‘curve analysis extraction’ and ‘speed limits database creation’ are also part of our contribution. An algorithm that analyzes GPS information off-line identifies high curvature segments and estimates the speed for each curve. The speed limit database contains information about the different speed limit zones for each traveled path. Our DSA senses speed limits and curves of the road using GPS information and ensures smooth speed transitions between current and ideal speeds. Through experimental simulations with different control algorithms on real and simulated datasets, we prove that our method is able to significantly reduce lateral errors on sharp curves, to respect speed limits and consequently increase safety and comfort for the passenger. PMID:28613251

Welding deviation detection algorithm based on extremum of molten pool image contour

NASA Astrophysics Data System (ADS)

Zou, Yong; Jiang, Lipei; Li, Yunhua; Xue, Long; Huang, Junfen; Huang, Jiqiang

2016-01-01

The welding deviation detection is the basis of robotic tracking welding, but the on-line real-time measurement of welding deviation is still not well solved by the existing methods. There is plenty of information in the gas metal arc welding(GMAW) molten pool images that is very important for the control of welding seam tracking. The physical meaning for the curvature extremum of molten pool contour is revealed by researching the molten pool images, that is, the deviation information points of welding wire center and the molten tip center are the maxima and the local maxima of the contour curvature, and the horizontal welding deviation is the position difference of these two extremum points. A new method of weld deviation detection is presented, including the process of preprocessing molten pool images, extracting and segmenting the contours, obtaining the contour extremum points, and calculating the welding deviation, etc. Extracting the contours is the premise, segmenting the contour lines is the foundation, and obtaining the contour extremum points is the key. The contour images can be extracted with the method of discrete dyadic wavelet transform, which is divided into two sub contours including welding wire and molten tip separately. The curvature value of each point of the two sub contour lines is calculated based on the approximate curvature formula of multi-points for plane curve, and the two points of the curvature extremum are the characteristics needed for the welding deviation calculation. The results of the tests and analyses show that the maximum error of the obtained on-line welding deviation is 2 pixels(0.16 mm), and the algorithm is stable enough to meet the requirements of the pipeline in real-time control at a speed of less than 500 mm/min. The method can be applied to the on-line automatic welding deviation detection.

A steep peripheral ring in irregular cornea topography, real or an instrument error?

PubMed

Galindo-Ferreiro, Alicia; Galvez-Ruiz, Alberto; Schellini, Silvana A; Galindo-Alonso, Julio

2016-01-01

To demonstrate that the steep peripheral ring (red zone) on corneal topography after myopic laser in situ keratomileusis (LASIK) could possibly due to instrument error and not always to a real increase in corneal curvature. A spherical model for the corneal surface and modifying topography software was used to analyze the cause of an error due to instrument design. This study involved modification of the software of a commercially available topographer. A small modification of the topography image results in a red zone on the corneal topography color map. Corneal modeling indicates that the red zone could be an artifact due to an instrument-induced error. The steep curvature changes after LASIK, signified by the red zone, could be also an error due to the plotting algorithms of the corneal topographer, besides a steep curvature change.

Higher Curvature Gravity from Entanglement in Conformal Field Theories.

PubMed

Haehl, Felix M; Hijano, Eliot; Parrikar, Onkar; Rabideau, Charles

2018-05-18

By generalizing different recent works to the context of higher curvature gravity, we provide a unifying framework for three related results: (i) If an asymptotically anti-de Sitter (AdS) spacetime computes the entanglement entropies of ball-shaped regions in a conformal field theory using a generalized Ryu-Takayanagi formula up to second order in state deformations around the vacuum, then the spacetime satisfies the correct gravitational equations of motion up to second order around the AdS background. (ii) The holographic dual of entanglement entropy in higher curvature theories of gravity is given by the Wald entropy plus a particular correction term involving extrinsic curvatures. (iii) Conformal field theory relative entropy is dual to gravitational canonical energy (also in higher curvature theories of gravity). Especially for the second point, our novel derivation of this previously known statement does not involve the Euclidean replica trick.

Higher Curvature Gravity from Entanglement in Conformal Field Theories

NASA Astrophysics Data System (ADS)

Haehl, Felix M.; Hijano, Eliot; Parrikar, Onkar; Rabideau, Charles

2018-05-01

By generalizing different recent works to the context of higher curvature gravity, we provide a unifying framework for three related results: (i) If an asymptotically anti-de Sitter (AdS) spacetime computes the entanglement entropies of ball-shaped regions in a conformal field theory using a generalized Ryu-Takayanagi formula up to second order in state deformations around the vacuum, then the spacetime satisfies the correct gravitational equations of motion up to second order around the AdS background. (ii) The holographic dual of entanglement entropy in higher curvature theories of gravity is given by the Wald entropy plus a particular correction term involving extrinsic curvatures. (iii) Conformal field theory relative entropy is dual to gravitational canonical energy (also in higher curvature theories of gravity). Especially for the second point, our novel derivation of this previously known statement does not involve the Euclidean replica trick.

Computation of breast ptosis from 3D surface scans of the female torso

PubMed Central

Li, Danni; Cheong, Audrey; Reece, Gregory P.; Crosby, Melissa A.; Fingeret, Michelle C.; Merchant, Fatima A.

2016-01-01

Stereophotography is now finding a niche in clinical breast surgery, and several methods for quantitatively measuring breast morphology from 3D surface images have been developed. Breast ptosis (sagging of the breast), which refers to the extent by which the nipple is lower than the inframammary fold (the contour along which the inferior part of the breast attaches to the chest wall), is an important morphological parameter that is frequently used for assessing the outcome of breast surgery. This study presents a novel algorithm that utilizes three-dimensional (3D) features such as surface curvature and orientation for the assessment of breast ptosis from 3D scans of the female torso. The performance of the computational approach proposed was compared against the consensus of manual ptosis ratings by nine plastic surgeons, and that of current 2D photogrammetric methods. Compared to the 2D methods, the average accuracy for 3D features was ~13% higher, with an increase in precision, recall, and F-score of 37%, 29%, and 33%, respectively. The computational approach proposed provides an improved and unbiased objective method for rating ptosis when compared to qualitative visualization by observers, and distance based 2D photogrammetry approaches. PMID:27643463

a Super Voxel-Based Riemannian Graph for Multi Scale Segmentation of LIDAR Point Clouds

NASA Astrophysics Data System (ADS)

Li, Minglei

2018-04-01

Automatically segmenting LiDAR points into respective independent partitions has become a topic of great importance in photogrammetry, remote sensing and computer vision. In this paper, we cast the problem of point cloud segmentation as a graph optimization problem by constructing a Riemannian graph. The scale space of the observed scene is explored by an octree-based over-segmentation with different depths. The over-segmentation produces many super voxels which restrict the structure of the scene and will be used as nodes of the graph. The Kruskal coordinates are used to compute edge weights that are proportional to the geodesic distance between nodes. Then we compute the edge-weight matrix in which the elements reflect the sectional curvatures associated with the geodesic paths between super voxel nodes on the scene surface. The final segmentation results are generated by clustering similar super voxels and cutting off the weak edges in the graph. The performance of this method was evaluated on LiDAR point clouds for both indoor and outdoor scenes. Additionally, extensive comparisons to state of the art techniques show that our algorithm outperforms on many metrics.

Spiral-bevel geometry and gear train precision

NASA Technical Reports Server (NTRS)

Litvin, F. L.; Coy, J. J.

1983-01-01

A new aproach to the solution of determination of surface principal curvatures and directions is proposed. Direct relationships between the principal curvatures and directions of the tool surface and those of the principal curvatures and directions of generated gear surface are obtained. The principal curvatures and directions of geartooth surface are obtained without using the complicated equations of these surfaces. A general theory of the train kinematical errors exerted by manufacturing and assembly errors is discussed. Two methods for the determination of the train kinematical errors can be worked out: (1) with aid of a computer, and (2) with a approximate method. Results from noise and vibration measurement conducted on a helicopter transmission are used to illustrate the principals contained in the theory of kinematic errors.

Warpage Measurement of Thin Wafers by Reflectometry

NASA Astrophysics Data System (ADS)

Ng, Chi Seng; Asundi, Anand Krishna

To cope with advances in the electronic and portable devices, electronic packaging industries have employed thinner and larger wafers to produce thinner packages/ electronic devices. As the thickness of the wafer decrease (below 250um), there is an increased tendency for it to warp. Large stresses are induced during manufacturing processes, particularly during backside metal deposition. The wafers bend due to these stresses. Warpage results from the residual stress will affect subsequent manufacturing processes. For example, warpage due to this residual stresses lead to crack dies during singulation process which will severely reorient the residual stress distributions, thus, weakening the mechanical and electrical properties of the singulated die. It is impossible to completely prevent the residual stress induced on thin wafers during the manufacturing processes. Monitoring of curvature/flatness is thus necessary to ensure reliability of device and its uses. A simple whole-field curvature measurement system using a novel computer aided phase shift reflection grating method has been developed and this project aims to take it to the next step for residual stress and full field surface shape measurement. The system was developed from our earlier works on Computer Aided Moiré Methods and Novel Techniques in Reflection Moiré, Experimental Mechanics (1994) in which novel structured light approach was shown for surface slope and curvature measurement. This method uses similar technology but coupled with a novel phase shift system to accurately measure slope and curvature. In this study, slope of the surface were obtain using the versatility of computer aided reflection grating method to manipulate and generate gratings in two orthogonal directions. The curvature and stress can be evaluated by performing a single order differentiation on slope data.

Simulation of the excitation of quasi-plane wake waves in a plasma by a resonant sequence of laser pulses with a variable envelope

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

Kalinnikova, E. I.; Levchenko, V. D.

2008-04-15

Results are presented from full-scale numerical simulations of the excitation of wake waves by a sequence of weakly relativistic laser pulses in a subcritical plasma. Computations were carried out with a 2D3V version of the SUR-CA code that is based on the local-recursive nonlocal-asynchronous algorithm of the particle-in-cell method. The parameters of a train of laser pulses were chosen to correspond to the resonant excitation of the wake field. The curvature of the envelope of the pulses was chosen to depend on the number of the pulse in the train. Numerical simulations showed that there are plane waves during themore » first period of the plasma wave behind the pulse train.« less

Real-time analysis keratometer

NASA Technical Reports Server (NTRS)

Adachi, Iwao P. (Inventor); Adachi, Yoshifumi (Inventor); Frazer, Robert E. (Inventor)

1987-01-01

A computer assisted keratometer in which a fiducial line pattern reticle illuminated by CW or pulsed laser light is projected on a corneal surface through lenses, a prismoidal beamsplitter quarterwave plate, and objective optics. The reticle surface is curved as a conjugate of an ideal corneal curvature. The fiducial image reflected from the cornea undergoes a polarization shift through the quarterwave plate and beamsplitter whereby the projected and reflected beams are separated and directed orthogonally. The reflected beam fiducial pattern forms a moire pattern with a replica of the first recticle. This moire pattern contains transverse aberration due to differences in curvature between the cornea and the ideal corneal curvature. The moire pattern is analyzed in real time by computer which displays either the CW moire pattern or a pulsed mode analysis of the transverse aberration of the cornea under observation, in real time. With the eye focused on a plurality of fixation points in succession, a survey of the entire corneal topography is made and a contour map or three dimensional plot of the cornea can be made as a computer readout in addition to corneal radius and refractive power analysis.

Sobolev metrics on diffeomorphism groups and the derived geometry of spaces of submanifolds

NASA Astrophysics Data System (ADS)

Micheli, Mario; Michor, Peter W.; Mumford, David

2013-06-01

Given a finite-dimensional manifold N, the group \\operatorname{Diff}_{ S}(N) of diffeomorphisms diffeomorphism of N which decrease suitably rapidly to the identity, acts on the manifold B(M,N) of submanifolds of N of diffeomorphism-type M, where M is a compact manifold with \\operatorname{dim} M<\\operatorname{dim} N. Given the right-invariant weak Riemannian metric on \\operatorname{Diff}_{ S}(N) induced by a quite general operator L\\colon \\mathfrak{X}_{ S}(N)\\to \\Gamma(T^*N\\otimes\\operatorname{vol}(N)), we consider the induced weak Riemannian metric on B(M,N) and compute its geodesics and sectional curvature. To do this, we derive a covariant formula for the curvature in finite and infinite dimensions, we show how it makes O'Neill's formula very transparent, and we finally use it to compute the sectional curvature on B(M,N).

Free-energy analysis of spin models on hyperbolic lattice geometries.

PubMed

Serina, Marcel; Genzor, Jozef; Lee, Yoju; Gendiar, Andrej

2016-04-01

We investigate relations between spatial properties of the free energy and the radius of Gaussian curvature of the underlying curved lattice geometries. For this purpose we derive recurrence relations for the analysis of the free energy normalized per lattice site of various multistate spin models in the thermal equilibrium on distinct non-Euclidean surface lattices of the infinite sizes. Whereas the free energy is calculated numerically by means of the corner transfer matrix renormalization group algorithm, the radius of curvature has an analytic expression. Two tasks are considered in this work. First, we search for such a lattice geometry, which minimizes the free energy per site. We conjecture that the only Euclidean flat geometry results in the minimal free energy per site regardless of the spin model. Second, the relations among the free energy, the radius of curvature, and the phase transition temperatures are analyzed. We found out that both the free energy and the phase transition temperature inherit the structure of the lattice geometry and asymptotically approach the profile of the Gaussian radius of curvature. This achievement opens new perspectives in the AdS-CFT correspondence theories.

Constant curvature black holes in Einstein AdS gravity: Euclidean action and thermodynamics

NASA Astrophysics Data System (ADS)

Guilleminot, Pablo; Olea, Rodrigo; Petrov, Alexander N.

2018-03-01

We compute the Euclidean action for constant curvature black holes (CCBHs), as an attempt to associate thermodynamic quantities to these solutions of Einstein anti-de Sitter (AdS) gravity. CCBHs are gravitational configurations obtained by identifications along isometries of a D -dimensional globally AdS space, such that the Riemann tensor remains constant. Here, these solutions are interpreted as extended objects, which contain a (D -2 )-dimensional de-Sitter brane as a subspace. Nevertheless, the computation of the free energy for these solutions shows that they do not obey standard thermodynamic relations.

Computational fluid dynamics modeling of laminar, transitional, and turbulent flows with sensitivity to streamline curvature and rotational effects

NASA Astrophysics Data System (ADS)

Chitta, Varun

Modeling of complex flows involving the combined effects of flow transition and streamline curvature using two advanced turbulence models, one in the Reynolds-averaged Navier-Stokes (RANS) category and the other in the hybrid RANS-Large eddy simulation (LES) category is considered in this research effort. In the first part of the research, a new scalar eddy-viscosity model (EVM) is proposed, designed to exhibit physically correct responses to flow transition, streamline curvature, and system rotation effects. The four equation model developed herein is a curvature-sensitized version of a commercially available three-equation transition-sensitive model. The physical effects of rotation and curvature (RC) enter the model through the added transport equation, analogous to a transverse turbulent velocity scale. The eddy-viscosity has been redefined such that the proposed model is constrained to reduce to the original transition-sensitive model definition in nonrotating flows or in regions with negligible RC effects. In the second part of the research, the developed four-equation model is combined with a LES technique using a new hybrid modeling framework, dynamic hybrid RANS-LES. The new framework is highly generalized, allowing coupling of any desired LES model with any given RANS model and addresses several deficiencies inherent in most current hybrid models. In the present research effort, the DHRL model comprises of the proposed four-equation model for RANS component and the MILES scheme for LES component. Both the models were implemented into a commercial computational fluid dynamics (CFD) solver and tested on a number of engineering and generic flow problems. Results from both the RANS and hybrid models show successful resolution of the combined effects of transition and curvature with reasonable engineering accuracy, and for only a small increase in computational cost. In addition, results from the hybrid model indicate significant levels of turbulent fluctuations in the flowfield, improved accuracy compared to RANS models predictions, and are obtained at a significant reduction of computational cost compared to full LES models. The results suggest that the advanced turbulence modeling techniques presented in this research effort have potential as practical tools for solving low/high Re flows over blunt/curved bodies for the prediction of transition and RC effects.

Registration algorithm of point clouds based on multiscale normal features

NASA Astrophysics Data System (ADS)

Lu, Jun; Peng, Zhongtao; Su, Hang; Xia, GuiHua

2015-01-01

The point cloud registration technology for obtaining a three-dimensional digital model is widely applied in many areas. To improve the accuracy and speed of point cloud registration, a registration method based on multiscale normal vectors is proposed. The proposed registration method mainly includes three parts: the selection of key points, the calculation of feature descriptors, and the determining and optimization of correspondences. First, key points are selected from the point cloud based on the changes of magnitude of multiscale curvatures obtained by using principal components analysis. Then the feature descriptor of each key point is proposed, which consists of 21 elements based on multiscale normal vectors and curvatures. The correspondences in a pair of two point clouds are determined according to the descriptor's similarity of key points in the source point cloud and target point cloud. Correspondences are optimized by using a random sampling consistency algorithm and clustering technology. Finally, singular value decomposition is applied to optimized correspondences so that the rigid transformation matrix between two point clouds is obtained. Experimental results show that the proposed point cloud registration algorithm has a faster calculation speed, higher registration accuracy, and better antinoise performance.

Prediction of the Critical Curvature for LX-17 with the Time of Arrival Data from DNS

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

Yao, Jin; Fried, Laurence E.; Moss, William C.

2017-01-10

We extract the detonation shock front velocity, curvature and acceleration from time of arrival data measured at grid points from direct numerical simulations of a 50mm rate-stick lit by a disk-source, with the ignition and growth reaction model and a JWL equation of state calibrated for LX-17. We compute the quasi-steady (D, κ) relation based on the extracted properties and predicted the critical curvatures of LX-17. We also proposed an explicit formula that contains the failure turning point, obtained from optimization for the (D, κ) relation of LX-17.

The Effective Dynamics of the Volume Preserving Mean Curvature Flow

NASA Astrophysics Data System (ADS)

Chenn, Ilias; Fournodavlos, G.; Sigal, I. M.

2018-04-01

We consider the dynamics of small closed submanifolds (`bubbles') under the volume preserving mean curvature flow. We construct a map from (n+1 )-dimensional Euclidean space into a given (n+1 )-dimensional Riemannian manifold which characterizes the existence, stability and dynamics of constant mean curvature submanifolds. This is done in terms of a reduced area function on the Euclidean space, which is given constructively and can be computed perturbatively. This allows us to derive adiabatic and effective dynamics of the bubbles. The results can be mapped by rescaling to the dynamics of fixed size bubbles in almost Euclidean Riemannian manifolds.

A noncommutative catenoid

NASA Astrophysics Data System (ADS)

Arnlind, Joakim; Holm, Christoffer

2018-01-01

A noncommutative algebra corresponding to the classical catenoid is introduced together with a differential calculus of derivations. We prove that there exists a unique metric and torsion-free connection that is compatible with the complex structure, and the curvature is explicitly calculated. A noncommutative analogue of the fact that the catenoid is a minimal surface is studied by constructing a Laplace operator from the connection and showing that the embedding coordinates are harmonic. Furthermore, an integral is defined and the total curvature is computed. Finally, classes of left and right modules are introduced together with constant curvature connections, and bimodule compatibility conditions are discussed in detail.

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.

Image smoothing and enhancement via min/max curvature flow

NASA Astrophysics Data System (ADS)

Malladi, Ravikanth; Sethian, James A.

1996-03-01

We present a class of PDE-based algorithms suitable for a wide range of image processing applications. The techniques are applicable to both salt-and-pepper gray-scale noise and full- image continuous noise present in black and white images, gray-scale images, texture images and color images. At the core, the techniques rely on a level set formulation of evolving curves and surfaces and the viscosity in profile evolution. Essentially, the method consists of moving the isointensity contours in an image under curvature dependent speed laws to achieve enhancement. Compared to existing techniques, our approach has several distinct advantages. First, it contains only one enhancement parameter, which in most cases is automatically chosen. Second, the scheme automatically stops smoothing at some optimal point; continued application of the scheme produces no further change. Third, the method is one of the fastest possible schemes based on a curvature-controlled approach.

Holographic RG flows on curved manifolds and quantum phase transitions

NASA Astrophysics Data System (ADS)

Ghosh, J. K.; Kiritsis, E.; Nitti, F.; Witkowski, L. T.

2018-05-01

Holographic RG flows dual to QFTs on maximally symmetric curved manifolds (dS d , AdS d , and S d ) are considered in the framework of Einstein-dilaton gravity in d + 1 dimensions. A general dilaton potential is used and the flows are driven by a scalar relevant operator. The general properties of such flows are analyzed and the UV and IR asymptotics computed. New RG flows can appear at finite curvature which do not have a zero curvature counterpart. The so-called `bouncing' flows, where the β-function has a branch cut at which it changes sign, are found to persist at finite curvature. Novel quantum first-order phase transitions are found, triggered by a variation in the d-dimensional curvature in theories allowing multiple ground states.

On the curvature effect of thin membranes

NASA Astrophysics Data System (ADS)

Wang, Duo; Jiao, Xiangmin; Conley, Rebecca; Glimm, James

2013-01-01

We investigate the curvature effect of a thin, curved elastic interface that separates two subdomains and exerts a pressure due to a curvature effect. This pressure, which we refer to as interface pressure, is similar to the surface tension in fluid mechanics. It is important in some applications, such as the canopy of parachutes, biological membranes of cells, balloons, airbags, etc., as it partially balances a pressure jump between the two sides of an interface. In this paper, we show that the interface pressure is equal to the trace of the matrix product of the curvature tensor and the Cauchy stress tensor in the tangent plane. We derive the theory for interfaces in both 2-D and 3-D, and present numerical discretizations for computing the quality over triangulated surfaces.

Shape sensing for torsionally compliant concentric-tube robots

NASA Astrophysics Data System (ADS)

Xu, Ran; Yurkewich, Aaron; Patel, Rajni V.

2016-03-01

Concentric-tube robots (CTR) consist of a series of pre-curved flexible tubes that make up the robot structure and provide the high dexterity required for performing surgical tasks in constrained environments. This special design introduces new challenges in shape sensing as large twisting is experienced by the torsionally compliant structure. In the literature, fiber Bragg grating (FBG) sensors are attached to needle-sized continuum robots for curvature sensing, but they are limited to obtaining bending curvatures since a straight sensor layout is utilized. For a CTR, in addition to bending curvatures, the torsion along the robots shaft should be determined to calculate the shape and pose of the robot accurately. To solve this problem, in our earlier work, we proposed embedding FBG sensors in a helical pattern into the tube wall. The strain readings are converted to bending curvatures and torsion by a strain-curvature model. In this paper, a modified strain-curvature model is proposed that can be used in conjunction with standard shape reconstruction algorithms for shape and pose calculation. This sensing technology is evaluated for its accuracy and resolution using three FBG sensors with 1 mm sensing segments that are bonded into the helical grooves of a pre-curved Nitinol tube. The results show that this sensorized robot can obtain accurate measurements: resolutions of 0.02 rad/m with a 100 Hz sampling rate. Further, the repeatability of the obtained measurements during loading and unloading conditions are presented and analyzed.

Mesoscale computational studies of membrane bilayer remodeling by curvature-inducing proteins

PubMed Central

Ramakrishnan, N.; Sunil Kumar, P. B.; Radhakrishnan, Ravi

2014-01-01

Biological membranes constitute boundaries of cells and cell organelles. These membranes are soft fluid interfaces whose thermodynamic states are dictated by bending moduli, induced curvature fields, and thermal fluctuations. Recently, there has been a flood of experimental evidence highlighting active roles for these structures in many cellular processes ranging from trafficking of cargo to cell motility. It is believed that the local membrane curvature, which is continuously altered due to its interactions with myriad proteins and other macromolecules attached to its surface, holds the key to the emergent functionality in these cellular processes. Mechanisms at the atomic scale are dictated by protein-lipid interaction strength, lipid composition, lipid distribution in the vicinity of the protein, shape and amino acid composition of the protein, and its amino acid contents. The specificity of molecular interactions together with the cooperativity of multiple proteins induce and stabilize complex membrane shapes at the mesoscale. These shapes span a wide spectrum ranging from the spherical plasma membrane to the complex cisternae of the Golgi apparatus. Mapping the relation between the protein-induced deformations at the molecular scale and the resulting mesoscale morphologies is key to bridging cellular experiments across the various length scales. In this review, we focus on the theoretical and computational methods used to understand the phenomenology underlying protein-driven membrane remodeling. Interactions at the molecular scale can be computationally probed by all atom and coarse grained molecular dynamics (MD, CGMD), as well as dissipative particle dynamics (DPD) simulations, which we only describe in passing. We choose to focus on several continuum approaches extending the Canham - Helfrich elastic energy model for membranes to include the effect of curvature-inducing proteins and explore the conformational phase space of such systems. In this description, the protein is expressed in the form of a spontaneous curvature field. The approaches include field theoretical methods limited to the small deformation regime, triangulated surfaces and particle-based computational models to investigate the large-deformation regimes observed in the natural state of many biological membranes. Applications of these methods to understand the properties of biological membranes in homogeneous and inhomogeneous environments of proteins, whose underlying curvature fields are either isotropic or anisotropic, are discussed. The diversity in the curvature fields elicits a rich variety of morphological states, including tubes, discs, branched tubes, and caveola. Mapping the thermodynamic stability of these states as a function of tuning parameters such as concentration and strength of curvature induction of the proteins is discussed. The relative stabilities of these self-organized shapes are examined through free-energy calculations. The suite of methods discussed here can be tailored to applications in specific cellular settings such as endocytosis during cargo trafficking and tubulation of filopodial structures in migrating cells, which makes these methods a powerful complement to experimental studies. PMID:25484487

Mesoscale computational studies of membrane bilayer remodeling by curvature-inducing proteins.

PubMed

Ramakrishnan, N; Sunil Kumar, P B; Radhakrishnan, Ravi

2014-10-01

Biological membranes constitute boundaries of cells and cell organelles. These membranes are soft fluid interfaces whose thermodynamic states are dictated by bending moduli, induced curvature fields, and thermal fluctuations. Recently, there has been a flood of experimental evidence highlighting active roles for these structures in many cellular processes ranging from trafficking of cargo to cell motility. It is believed that the local membrane curvature, which is continuously altered due to its interactions with myriad proteins and other macromolecules attached to its surface, holds the key to the emergent functionality in these cellular processes. Mechanisms at the atomic scale are dictated by protein-lipid interaction strength, lipid composition, lipid distribution in the vicinity of the protein, shape and amino acid composition of the protein, and its amino acid contents. The specificity of molecular interactions together with the cooperativity of multiple proteins induce and stabilize complex membrane shapes at the mesoscale. These shapes span a wide spectrum ranging from the spherical plasma membrane to the complex cisternae of the Golgi apparatus. Mapping the relation between the protein-induced deformations at the molecular scale and the resulting mesoscale morphologies is key to bridging cellular experiments across the various length scales. In this review, we focus on the theoretical and computational methods used to understand the phenomenology underlying protein-driven membrane remodeling. Interactions at the molecular scale can be computationally probed by all atom and coarse grained molecular dynamics (MD, CGMD), as well as dissipative particle dynamics (DPD) simulations, which we only describe in passing. We choose to focus on several continuum approaches extending the Canham - Helfrich elastic energy model for membranes to include the effect of curvature-inducing proteins and explore the conformational phase space of such systems. In this description, the protein is expressed in the form of a spontaneous curvature field. The approaches include field theoretical methods limited to the small deformation regime, triangulated surfaces and particle-based computational models to investigate the large-deformation regimes observed in the natural state of many biological membranes. Applications of these methods to understand the properties of biological membranes in homogeneous and inhomogeneous environments of proteins, whose underlying curvature fields are either isotropic or anisotropic, are discussed. The diversity in the curvature fields elicits a rich variety of morphological states, including tubes, discs, branched tubes, and caveola. Mapping the thermodynamic stability of these states as a function of tuning parameters such as concentration and strength of curvature induction of the proteins is discussed. The relative stabilities of these self-organized shapes are examined through free-energy calculations. The suite of methods discussed here can be tailored to applications in specific cellular settings such as endocytosis during cargo trafficking and tubulation of filopodial structures in migrating cells, which makes these methods a powerful complement to experimental studies.

Mesoscale computational studies of membrane bilayer remodeling by curvature-inducing proteins

NASA Astrophysics Data System (ADS)

Ramakrishnan, N.; Sunil Kumar, P. B.; Radhakrishnan, Ravi

2014-10-01

Biological membranes constitute boundaries of cells and cell organelles. These membranes are soft fluid interfaces whose thermodynamic states are dictated by bending moduli, induced curvature fields, and thermal fluctuations. Recently, there has been a flood of experimental evidence highlighting active roles for these structures in many cellular processes ranging from trafficking of cargo to cell motility. It is believed that the local membrane curvature, which is continuously altered due to its interactions with myriad proteins and other macromolecules attached to its surface, holds the key to the emergent functionality in these cellular processes. Mechanisms at the atomic scale are dictated by protein-lipid interaction strength, lipid composition, lipid distribution in the vicinity of the protein, shape and amino acid composition of the protein, and its amino acid contents. The specificity of molecular interactions together with the cooperativity of multiple proteins induce and stabilize complex membrane shapes at the mesoscale. These shapes span a wide spectrum ranging from the spherical plasma membrane to the complex cisternae of the Golgi apparatus. Mapping the relation between the protein-induced deformations at the molecular scale and the resulting mesoscale morphologies is key to bridging cellular experiments across various length scales. In this review, we focus on the theoretical and computational methods used to understand the phenomenology underlying protein-driven membrane remodeling. Interactions at the molecular scale can be computationally probed by all atom and coarse grained molecular dynamics (MD, CGMD), as well as dissipative particle dynamics (DPD) simulations, which we only describe in passing. We choose to focus on several continuum approaches extending the Canham-Helfrich elastic energy model for membranes to include the effect of curvature-inducing proteins and explore the conformational phase space of such systems. In this description, the protein is expressed in the form of a spontaneous curvature field. The approaches include field theoretical methods limited to the small deformation regime, triangulated surfaces and particle-based computational models to investigate the large-deformation regimes observed in the natural state of many biological membranes. Applications of these methods to understand the properties of biological membranes in homogeneous and inhomogeneous environments of proteins, whose underlying curvature fields are either isotropic or anisotropic, are discussed. The diversity in the curvature fields elicits a rich variety of morphological states, including tubes, discs, branched tubes, and caveola. Mapping the thermodynamic stability of these states as a function of tuning parameters such as concentration and strength of curvature induction of the proteins is discussed. The relative stabilities of these self-organized shapes are examined through free-energy calculations. The suite of methods discussed here can be tailored to applications in specific cellular settings such as endocytosis during cargo trafficking and tubulation of filopodial structures in migrating cells, which makes these methods a powerful complement to experimental studies.

Three-dimensional lung tumor segmentation from x-ray computed tomography using sparse field active models.

PubMed

Awad, Joseph; Owrangi, Amir; Villemaire, Lauren; O'Riordan, Elaine; Parraga, Grace; Fenster, Aaron

2012-02-01

Manual segmentation of lung tumors is observer dependent and time-consuming but an important component of radiology and radiation oncology workflow. The objective of this study was to generate an automated lung tumor measurement tool for segmentation of pulmonary metastatic tumors from x-ray computed tomography (CT) images to improve reproducibility and decrease the time required to segment tumor boundaries. The authors developed an automated lung tumor segmentation algorithm for volumetric image analysis of chest CT images using shape constrained Otsu multithresholding (SCOMT) and sparse field active surface (SFAS) algorithms. The observer was required to select the tumor center and the SCOMT algorithm subsequently created an initial surface that was deformed using level set SFAS to minimize the total energy consisting of mean separation, edge, partial volume, rolling, distribution, background, shape, volume, smoothness, and curvature energies. The proposed segmentation algorithm was compared to manual segmentation whereby 21 tumors were evaluated using one-dimensional (1D) response evaluation criteria in solid tumors (RECIST), two-dimensional (2D) World Health Organization (WHO), and 3D volume measurements. Linear regression goodness-of-fit measures (r(2) = 0.63, p < 0.0001; r(2) = 0.87, p < 0.0001; and r(2) = 0.96, p < 0.0001), and Pearson correlation coefficients (r = 0.79, p < 0.0001; r = 0.93, p < 0.0001; and r = 0.98, p < 0.0001) for 1D, 2D, and 3D measurements, respectively, showed significant correlations between manual and algorithm results. Intra-observer intraclass correlation coefficients (ICC) demonstrated high reproducibility for algorithm (0.989-0.995, 0.996-0.997, and 0.999-0.999) and manual measurements (0.975-0.993, 0.985-0.993, and 0.980-0.992) for 1D, 2D, and 3D measurements, respectively. The intra-observer coefficient of variation (CV%) was low for algorithm (3.09%-4.67%, 4.85%-5.84%, and 5.65%-5.88%) and manual observers (4.20%-6.61%, 8.14%-9.57%, and 14.57%-21.61%) for 1D, 2D, and 3D measurements, respectively. The authors developed an automated segmentation algorithm requiring only that the operator select the tumor to measure pulmonary metastatic tumors in 1D, 2D, and 3D. Algorithm and manual measurements were significantly correlated. Since the algorithm segmentation involves selection of a single seed point, it resulted in reduced intra-observer variability and decreased time, for making the measurements.

Radiomic texture-curvature (RTC) features for precision medicine of patients with rheumatoid arthritis-associated interstitial lung disease

NASA Astrophysics Data System (ADS)

Watari, Chinatsu; Matsuhiro, Mikio; Näppi, Janne J.; Nasirudin, Radin A.; Hironaka, Toru; Kawata, Yoshiki; Niki, Noboru; Yoshida, Hiroyuki

2018-03-01

We investigated the effect of radiomic texture-curvature (RTC) features of lung CT images in the prediction of the overall survival of patients with rheumatoid arthritis-associated interstitial lung disease (RA-ILD). We retrospectively collected 70 RA-ILD patients who underwent thin-section lung CT and serial pulmonary function tests. After the extraction of the lung region, we computed hyper-curvature features that included the principal curvatures, curvedness, bright/dark sheets, cylinders, blobs, and curvature scales for the bronchi and the aerated lungs. We also computed gray-level co-occurrence matrix (GLCM) texture features on the segmented lungs. An elastic-net penalty method was used to select and combine these features with a Cox proportional hazards model for predicting the survival of the patient. Evaluation was performed by use of concordance index (C-index) as a measure of prediction performance. The C-index values of the texture features, hyper-curvature features, and the combination thereof (RTC features) in predicting patient survival was estimated by use of bootstrapping with 2,000 replications, and they were compared with an established clinical prognostic biomarker known as the gender, age, and physiology (GAP) index by means of two-sided t-test. Bootstrap evaluation yielded the following C-index values for the clinical and radiomic features: (a) GAP index: 78.3%; (b) GLCM texture features: 79.6%; (c) hypercurvature features: 80.8%; and (d) RTC features: 86.8%. The RTC features significantly outperformed any of the other predictors (P < 0.001). The Kaplan-Meier survival curves of patients stratified to low- and high-risk groups based on the RTC features showed statistically significant (P < 0.0001) difference. Thus, the RTC features can provide an effective imaging biomarker for predicting the overall survival of patients with RA-ILD.

Micro-Computed Tomography Evaluation of ProTaper Next and BioRace Shaping Outcomes in Maxillary First Molar Curved Canals.

PubMed

Pasqualini, Damiano; Alovisi, Mario; Cemenasco, Andrea; Mancini, Lucia; Paolino, Davide Salvatore; Bianchi, Caterina Chiara; Roggia, Andrea; Scotti, Nicola; Berutti, Elio

2015-10-01

The aim of this micro-computed tomography study was to describe the shaping properties of ProGlider/ProTaper Next (PG/PTN) and ScoutRace/BioRace (SR/BR) nickel-titanium rotary systems. Thirty maxillary first permanent molars were selected. Mesiobuccal canals were randomly assigned (n = 15) to PG/PTN or SR/BR groups. Irrigation was performed with 5% NaOCl and 10% EDTA. Specimens were scanned (voxel size, 9.1 μm) for matching volumes and surface areas and post-treatment analyses. Root canal centering ability, canal geometry enlargement, and thickness of dentinal wall at inner curvature were assessed at apical level and point of maximum curvature. Results were analyzed with 4 one-way analyses of variance. Canal centering ability was superior in PG/PTN (P = .006 at apical level, P = .025 at point of maximum curvature). PG/PTN demonstrated a more conservative increase of canal areas (P = .027 at apical level, P = .038 at point of maximum curvature). Centrifugal increase in canal diameters did not significantly differ between groups (P = .65 at apical level, P = .61 at point of maximum curvature). Inner dentinal wall thickness was less reduced with PG/PTN compared with SR/BR, with no statistical differences (P = .23 at point of maximum curvature, P = .89 at apical level). PG/PTN shaping taper ranged between 6% and 7%. Neither system produced significant shaping errors in curved canals. PG/PTN system showed better preservation of canal anatomy. PTN offset section did not influence final preparation taper. Copyright © 2015 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

Determinants of Curvature-Sensing Behavior for MARCKS-Fragment Peptides.

PubMed

de Jesus, Armando J; White, Ormacinda R; Flynn, Aaron D; Yin, Hang

2016-05-10

It is increasingly recognized that membrane curvature plays an important role in various cellular activities such as signaling and trafficking, as well as key issues involving health and disease development. Thus, curvature-sensing peptides are essential to the study and detection of highly curved bilayer structures. The effector domain of myristoylated alanine-rich C-kinase substrate (MARCKS-ED) has been demonstrated to have curvature-sensing ability. Research of the MARCKS-ED has further revealed that its Lys and Phe residues play an essential role in how MARCKS-ED detects and binds to curved bilayers. MARCKS-ED has the added property of being a lower-molecular-weight curvature sensor, which offers advantages in production. With that in mind, this work investigates peptide-sequence-related factors that influence curvature sensing and explores whether peptide fragments of even shorter length can function as curvature sensors. Using both experimental and computational methods, we studied the curvature-sensing capabilities of seven fragments of MARCKS-ED. Two of the longer fragments were designed from approximately the two halves of the full-length peptide whereas the five shorter fragments were taken from the central stretch of MARCKS-ED. Fully atomistic molecular dynamics simulations show that the fragments that remain bound to the bilayer exhibit interactions with the bilayer similar to that of the full-length MARCKS-ED peptide. Fluorescence enhancement and anisotropy assays, meanwhile, reveal that five of the MARCKS fragments possess the ability to sense membrane curvature. Based on the sequences of the curvature-sensing fragments, it appears that the ability to sense curvature involves a balance between the numbers of positively charged residues and hydrophobic anchoring residues. Together, these findings help crystallize our understanding of the molecular mechanisms underpinning the curvature-sensing behaviors of peptides, which will prove useful in the design of future curvature sensors. Copyright © 2016 Biophysical Society. Published by Elsevier Inc. All rights reserved.

3D matching techniques using OCT fingerprint point clouds

NASA Astrophysics Data System (ADS)

Gutierrez da Costa, Henrique S.; Silva, Luciano; Bellon, Olga R. P.; Bowden, Audrey K.; Czovny, Raphael K.

2017-02-01

Optical Coherence Tomography (OCT) makes viable acquisition of 3D fingerprints from both dermis and epidermis skin layers and their interfaces, exposing features that can be explored to improve biometric identification such as the curvatures and distinctive 3D regions. Scanned images from eleven volunteers allowed the construction of the first OCT 3D fingerprint database, to our knowledge, containing epidermal and dermal fingerprints. 3D dermal fingerprints can be used to overcome cases of Failure to Enroll (FTE) due to poor ridge image quality and skin alterations, cases that affect 2D matching performance. We evaluate three matching techniques, including the well-established Iterative Closest Points algorithm (ICP), Surface Interpenetration Measure (SIM) and the well-known KH Curvature Maps, all assessed using a 3D OCT fingerprint database, the first one for this purpose. Two of these techniques are based on registration techniques and one on curvatures. These were evaluated, compared and the fusion of matching scores assessed. We applied a sequence of steps to extract regions of interest named (ROI) minutiae clouds, representing small regions around distinctive minutia, usually located at ridges/valleys endings or bifurcations. The obtained ROI is acquired from the epidermis and dermis-epidermis interface by OCT imaging. A comparative analysis of identification accuracy was explored using different scenarios and the obtained results shows improvements for biometric identification. A comparison against 2D fingerprint matching algorithms is also presented to assess the improvements.

Graph Curvature for Differentiating Cancer Networks

PubMed Central

Sandhu, Romeil; Georgiou, Tryphon; Reznik, Ed; Zhu, Liangjia; Kolesov, Ivan; Senbabaoglu, Yasin; Tannenbaum, Allen

2015-01-01

Cellular interactions can be modeled as complex dynamical systems represented by weighted graphs. The functionality of such networks, including measures of robustness, reliability, performance, and efficiency, are intrinsically tied to the topology and geometry of the underlying graph. Utilizing recently proposed geometric notions of curvature on weighted graphs, we investigate the features of gene co-expression networks derived from large-scale genomic studies of cancer. We find that the curvature of these networks reliably distinguishes between cancer and normal samples, with cancer networks exhibiting higher curvature than their normal counterparts. We establish a quantitative relationship between our findings and prior investigations of network entropy. Furthermore, we demonstrate how our approach yields additional, non-trivial pair-wise (i.e. gene-gene) interactions which may be disrupted in cancer samples. The mathematical formulation of our approach yields an exact solution to calculating pair-wise changes in curvature which was computationally infeasible using prior methods. As such, our findings lay the foundation for an analytical approach to studying complex biological networks. PMID:26169480

Three dimensional ray tracing Jovian magnetosphere in the low frequency range

NASA Technical Reports Server (NTRS)

Menietti, J. D.

1982-01-01

Ray tracing of the Jovian magnetosphere in the low frequency range (1+40 MHz) has resulted in a new understanding of the source mechanism for Io dependent decametric radiation (DAM). Our three dimensional ray tracing computer code has provided model DAM arcs at 10 deg. intervals of Io longitude source positions for the full 360 deg of Jovian system III longitude. In addition, particularly interesting arcs were singled out for detailed study and modelling. Dependent decametric radiation arcs are categorized according to curvature--the higher curvature arcs are apparently due to wave stimulation at a nonconstant wave normal angle, psi. The psi(f) relationship has a signature that is common to most of the higher curvature arcs. The low curvature arcs, on the other hand, are adequately modelled with a constant wave normal angle of close to 90 deg. These results imply that for higher curvature arcs observed for from Jupiter (to diminish spacecraft motion effects) the electrons providing the gyroemission are relativistically beamed.

Lung fissure detection in CT images using global minimal paths

NASA Astrophysics Data System (ADS)

Appia, Vikram; Patil, Uday; Das, Bipul

2010-03-01

Pulmonary fissures separate human lungs into five distinct regions called lobes. Detection of fissure is essential for localization of the lobar distribution of lung diseases, surgical planning and follow-up. Treatment planning also requires calculation of the lobe volume. This volume estimation mandates accurate segmentation of the fissures. Presence of other structures (like vessels) near the fissure, along with its high variational probability in terms of position, shape etc. makes the lobe segmentation a challenging task. Also, false incomplete fissures and occurrence of diseases add to the complications of fissure detection. In this paper, we propose a semi-automated fissure segmentation algorithm using a minimal path approach on CT images. An energy function is defined such that the path integral over the fissure is the global minimum. Based on a few user defined points on a single slice of the CT image, the proposed algorithm minimizes a 2D energy function on the sagital slice computed using (a) intensity (b) distance of the vasculature, (c) curvature in 2D, (d) continuity in 3D. The fissure is the infimum energy path between a representative point on the fissure and nearest lung boundary point in this energy domain. The algorithm has been tested on 10 CT volume datasets acquired from GE scanners at multiple clinical sites. The datasets span through different pathological conditions and varying imaging artifacts.

OpenRBC: Redefining the Frontier of Red Blood Cell Simulations at Protein Resolution

NASA Astrophysics Data System (ADS)

Tang, Yu-Hang; Lu, Lu; Li, He; Grinberg, Leopold; Sachdeva, Vipin; Evangelinos, Constantinos; Karniadakis, George

We present a from-scratch development of OpenRBC, a coarse-grained molecular dynamics code, which is capable of performing an unprecedented in silico experiment - simulating an entire mammal red blood cell lipid bilayer and cytoskeleton modeled by 4 million mesoscopic particles - on a single shared memory node. To achieve this, we invented an adaptive spatial searching algorithm to accelerate the computation of short-range pairwise interactions in an extremely sparse 3D space. The algorithm is based on a Voronoi partitioning of the point cloud of coarse-grained particles, and is continuously updated over the course of the simulation. The algorithm enables the construction of a lattice-free cell list, i.e. the key spatial searching data structure in our code, in O (N) time and space space with cells whose position and shape adapts automatically to the local density and curvature. The code implements NUMA/NUCA-aware OpenMP parallelization and achieves perfect scaling with up to hundreds of hardware threads. The code outperforms a legacy solver by more than 8 times in time-to-solution and more than 20 times in problem size, thus providing a new venue for probing the cytomechanics of red blood cells. This work was supported by the Department of Energy (DOE) Collaboratory on Mathematics for Mesoscopic Model- ing of Materials (CM4). YHT acknowledges partial financial support from an IBM Ph.D. Scholarship Award.

Learning Maximal Entropy Models from finite size datasets: a fast Data-Driven algorithm allows to sample from the posterior distribution

NASA Astrophysics Data System (ADS)

Ferrari, Ulisse

A maximal entropy model provides the least constrained probability distribution that reproduces experimental averages of an observables set. In this work we characterize the learning dynamics that maximizes the log-likelihood in the case of large but finite datasets. We first show how the steepest descent dynamics is not optimal as it is slowed down by the inhomogeneous curvature of the model parameters space. We then provide a way for rectifying this space which relies only on dataset properties and does not require large computational efforts. We conclude by solving the long-time limit of the parameters dynamics including the randomness generated by the systematic use of Gibbs sampling. In this stochastic framework, rather than converging to a fixed point, the dynamics reaches a stationary distribution, which for the rectified dynamics reproduces the posterior distribution of the parameters. We sum up all these insights in a ``rectified'' Data-Driven algorithm that is fast and by sampling from the parameters posterior avoids both under- and over-fitting along all the directions of the parameters space. Through the learning of pairwise Ising models from the recording of a large population of retina neurons, we show how our algorithm outperforms the steepest descent method. This research was supported by a Grant from the Human Brain Project (HBP CLAP).

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

McNamara, B.

Tandem and stellarator equilibria at high ..beta.. have proved hard to compute and the relaxation methods of Bauer et al., Chodura and Schluter, Hirshman, Strauss, and Pearlstein et al. have been slow to converge. This paper reports an extension of the low-..beta.. analytic method of Pearlstein, Kaiser, and Newcomb to arbitrary ..beta.. for tandem mirrors which converges in 10 to 20 iterations. Extensions of the method to stellarator equilibria are proposed and are very close to the analytic method of Johnson and Greene - the stellarator expansion. Most of the results of all these calculations can be adequately described bymore » low-..beta.. approximations since the MHD stability limits occur at low ..beta... The tandem mirror, having weak curvature and a long central cell, allows finite Larmor radius effects to eliminate most ballooning modes and offers the possibility of really high average ..beta... This is the interest in developing such three-dimensional numerical algorithms.« less

Joint detection of anatomical points on surface meshes and color images for visual registration of 3D dental models

NASA Astrophysics Data System (ADS)

Destrez, Raphaël.; Albouy-Kissi, Benjamin; Treuillet, Sylvie; Lucas, Yves

2015-04-01

Computer aided planning for orthodontic treatment requires knowing occlusion of separately scanned dental casts. A visual guided registration is conducted starting by extracting corresponding features in both photographs and 3D scans. To achieve this, dental neck and occlusion surface are firstly extracted by image segmentation and 3D curvature analysis. Then, an iterative registration process is conducted during which feature positions are refined, guided by previously found anatomic edges. The occlusal edge image detection is improved by an original algorithm which follows Canny's poorly detected edges using a priori knowledge of tooth shapes. Finally, the influence of feature extraction and position optimization is evaluated in terms of the quality of the induced registration. Best combination of feature detection and optimization leads to a positioning average error of 1.10 mm and 2.03°.

The sponge-like topology of large-scale structure in the universe

NASA Technical Reports Server (NTRS)

Gott, J. R., III; Dickinson, M.; Melott, A. L.

1986-01-01

The relative connectedness of the high- and low-density regions in the universe is studied using a median density contour which divides space into two equal volumes. The CfA data are found to show a sponge-like topology where the highand low-density regions are both interlocking and equivalent. The boundary surface between the two regions has a general negative curvature, and is characterized by a large number of holes. In the initial conditions the connectedness of the two regions must be identical because a change of sign in the random quantum fluctuations would reverse their roles. It is noted that in the cold dark matter and neutrino scenarios the hole sizes are typically of the order of the smoothing diameter or the damping length, whichever is larger. The sponge-like topology is consistent with the universe having a frothy appearance without being divided neatly into cells. A computer algorithm for measuring topology is discussed.

On the validation of a code and a turbulence model appropriate to circulation control airfoils

NASA Technical Reports Server (NTRS)

Viegas, J. R.; Rubesin, M. W.; Maccormack, R. W.

1988-01-01

A computer code for calculating flow about a circulation control airfoil within a wind tunnel test section has been developed. This code is being validated for eventual use as an aid to design such airfoils. The concept of code validation being used is explained. The initial stages of the process have been accomplished. The present code has been applied to a low-subsonic, 2-D flow about a circulation control airfoil for which extensive data exist. Two basic turbulence models and variants thereof have been successfully introduced into the algorithm, the Baldwin-Lomax algebraic and the Jones-Launder two-equation models of turbulence. The variants include adding a history of the jet development for the algebraic model and adding streamwise curvature effects for both models. Numerical difficulties and difficulties in the validation process are discussed. Turbulence model and code improvements to proceed with the validation process are also discussed.

Computation of turbulent boundary layers on curved surfaces, 1 June 1975 - 31 January 1976

NASA Technical Reports Server (NTRS)

Wilcox, D. C.; Chambers, T. L.

1976-01-01

An accurate method was developed for predicting effects of streamline curvature and coordinate system rotation on turbulent boundary layers. A new two-equation model of turbulence was developed which serves as the basis of the study. In developing the new model, physical reasoning is combined with singular perturbation methods to develop a rational, physically-based set of equations which are, on the one hand, as accurate as mixing-length theory for equilibrium boundary layers and, on the other hand, suitable for computing effects of curvature and rotation. The equations are solved numerically for several boundary layer flows over plane and curved surfaces. For incompressible boundary layers, results of the computations are generally within 10% of corresponding experimental data. Somewhat larger discrepancies are noted for compressible applications.

Data Retrieval Algorithms for Validating the Optical Transient Detector and the Lightning Imaging Sensor

NASA Technical Reports Server (NTRS)

Koshak, W. J.; Blakeslee, R. J.; Bailey, J. C.

2000-01-01

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions. Solutions for the plane (i.e., no earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated datasets, and the relative influence of bearing and arrival time data an the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA:s Optical Transient Detector and Lightning Imaging Sensor. A quadratic planar solution that is useful when only three arrival time measurements are available is also introduced. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in sc)iirce location, Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated datasets, and the results are generally better than those obtained from the three-station linear planar method when bearing errors are about 2 deg.

CHLOROPHYLL A DISTRIBUTION IN NARRAGANSETT BAY, RI: USING A SPECTRAL CURVATURE ALGORITHM

EPA Science Inventory

Chlorophyll a, a primary indicator of eutrophication in estuarine waters, varies enough in time and space to create spatial problems when monitored by satellite, and temporal problems when measured with in situ field programs. Using aircraft to sense ocean color of local waters, ...

Aspects and applications of patched grid calculations

NASA Technical Reports Server (NTRS)

Walters, R. W.; Switzer, G. F.; Thomas, J. L.

1986-01-01

Patched grid calculations within the framework of an implicit, flux-vector split upwind/relaxation algorithm for the Euler equations are presented. The effect of a metric-discontinuous interface on the convergence rate of the algorithm is discussed along with the spatial accuracy of the solution and the effect of curvature along an interface. Results are presented and discussed for the free-stream problem, shock reflection problem, supersonic inlet with a 5 degree ramp, aerodynamically choked inlet, and three-dimensional analytic forebody.

Micro computed tomography evaluation of the Self-adjusting file and ProTaper Universal system on curved mandibular molars.

PubMed

Serefoglu, Burcu; Piskin, Beyser

2017-09-26

The aim of this investigation was to compare the cleaning and shaping efficiency of Self-adjusting file and Protaper, and to assess the correlation between root canal curvature and working time in mandibular molars using micro-computed tomography. Twenty extracted mandibular molars instrumented with Protaper and Self-adjusting file and the total working time was measured in mesial canals. The changes in canal volume, surface area and structure model index, transportation, uninstrumented area and the correlation between working-time and the curvature were analyzed. Although no statistically significant difference was observed between two systems in distal canals (p>0.05), a significantly higher amount of removed dentin volume and lower uninstrumented area were provided by Protaper in mesial canals (p<0.0001). A correlation between working-time and the canal-curvature was also observed in mesial canals for both groups (SAFr 2 =0.792, p<0.0004, PTUr 2 =0.9098, p<0.0001).

Geometric and electrostatic modeling using molecular rigidity functions

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

Mu, Lin; Xia, Kelin; Wei, Guowei

Geometric and electrostatic modeling is an essential component in computational biophysics and molecular biology. Commonly used geometric representations admit geometric singularities such as cusps, tips and self-intersecting facets that lead to computational instabilities in the molecular modeling. Our present work explores the use of flexibility and rigidity index (FRI), which has a proved superiority in protein B-factor prediction, for biomolecular geometric representation and associated electrostatic analysis. FRI rigidity surfaces are free of geometric singularities. We propose a rigidity based Poisson–Boltzmann equation for biomolecular electrostatic analysis. These approaches to surface and electrostatic modeling are validated by a set of 21 proteins.more » Our results are compared with those of established methods. Finally, being smooth and analytically differentiable, FRI rigidity functions offer excellent curvature analysis, which characterizes concave and convex regions on protein surfaces. Polarized curvatures constructed by using the product of minimum curvature and electrostatic potential is shown to predict potential protein–ligand binding sites.« less

Geometric and electrostatic modeling using molecular rigidity functions

DOE PAGES

Mu, Lin; Xia, Kelin; Wei, Guowei

2017-03-01

Geometric and electrostatic modeling is an essential component in computational biophysics and molecular biology. Commonly used geometric representations admit geometric singularities such as cusps, tips and self-intersecting facets that lead to computational instabilities in the molecular modeling. Our present work explores the use of flexibility and rigidity index (FRI), which has a proved superiority in protein B-factor prediction, for biomolecular geometric representation and associated electrostatic analysis. FRI rigidity surfaces are free of geometric singularities. We propose a rigidity based Poisson–Boltzmann equation for biomolecular electrostatic analysis. These approaches to surface and electrostatic modeling are validated by a set of 21 proteins.more » Our results are compared with those of established methods. Finally, being smooth and analytically differentiable, FRI rigidity functions offer excellent curvature analysis, which characterizes concave and convex regions on protein surfaces. Polarized curvatures constructed by using the product of minimum curvature and electrostatic potential is shown to predict potential protein–ligand binding sites.« less

Aortic Curvature Instead of Angulation Allows Improved Estimation of the True Aorto-iliac Trajectory.

PubMed

Schuurmann, R C L; Kuster, L; Slump, C H; Vahl, A; van den Heuvel, D A F; Ouriel, K; de Vries, J-P P M

2016-02-01

Supra- and infrarenal aortic neck angulation have been associated with complications after endovascular aortic aneurysm repair. However, a uniform angulation measurement method is lacking and the concept of angulation suggests a triangular oversimplification of the aortic anatomy. (Semi-)automated calculation of curvature along the center luminal line describes the actual trajectory of the aorta. This study proposes a methodology for calculating aortic (neck) curvature and suggests an additional method based on available tools in current workstations: curvature by digital calipers (CDC). Proprietary custom software was developed for automatic calculation of the severity and location of the largest supra- and infrarenal curvature over the center luminal line. Twenty-four patients with severe supra- or infrarenal angulations (≥45°) and 11 patients with small to moderate angulations (<45°) were included. Both CDC and angulation were measured by two independent observers on the pre- and postoperative computed tomographic angiography scans. The relationships between actual curvature and CDC and angulation were visualized and tested with Pearson's correlation coefficient. The CDC was also fully automatically calculated with proprietary custom software. The difference between manual and automatic determination of CDC was tested with a paired Student t test. A p-value was considered significant when two-tailed α < .05. The correlation between actual curvature and manual CDC is strong (.586-.962) and even stronger for automatic CDC (.865-.961). The correlation between actual curvature and angulation is much lower (.410-.737). Flow direction angulation values overestimate CDC measurements by 60%, with larger variance. No significant difference was found in automatically calculated CDC values and manually measured CDC values. Curvature calculation of the aortic neck improves determination of the true aortic trajectory. Automatic calculation of the actual curvature is preferable, but measurement or calculation of the curvature by digital calipers is a valid alternative if actual curvature is not at hand. Copyright © 2015 European Society for Vascular Surgery. Published by Elsevier Ltd. All rights reserved.

Dependence of surface tension on curvature obtained from a diffuse-interface approach

NASA Astrophysics Data System (ADS)

Badillo, Arnoldo; Lafferty, Nathan; Matar, Omar K.

2017-11-01

From a sharp-interface viewpoint, the surface tension force is f = σκδ (x -xi) n , where σ is the surface tension, κ the local interface curvature, δ the delta function, and n the unit normal vector. The numerical implementation of this force on discrete domains poses challenges that arise from the calculation of the curvature. The continuous surface tension force model, proposed by Brackbill et al. (1992), is an alternative, used commonly in two-phase computational models. In this model, δ is replaced by the gradient of a phase indicator field, whose integral across a diffuse-interface equals unity. An alternative to the Brackbill model are Phase-Field models, which do not require an explicit calculation of the curvature. However, and just as in Brackbill's approach, there are numerical errors that depend on the thickness of the diffuse interface, the grid spacing, and the curvature. We use differential geometry to calculate the leading errors in this force when obtained from a diffuse-interface approach, and outline possible routes to eliminate them. Our results also provide a simple geometrical explanation to the dependence of surface tension on curvature, and to the problem of line tension.

Respiratory function monitoring using a real-time three-dimensional fiber-optic shaping sensing scheme based upon fiber Bragg gratings

NASA Astrophysics Data System (ADS)

Allsop, Thomas; Bhamber, Ranjeet; Lloyd, Glynn; Miller, Martin R.; Dixon, Andrew; Webb, David; Ania Castañón, Juan Diego; Bennion, Ian

2012-11-01

An array of in-line curvature sensors on a garment is used to monitor the thoracic and abdominal movements of a human during respiration. The results are used to obtain volumetric changes of the human torso in agreement with a spirometer used simultaneously at the mouth. The array of 40 in-line fiber Bragg gratings is used to produce 20 curvature sensors at different locations, each sensor consisting of two fiber Bragg gratings. The 20 curvature sensors and adjoining fiber are encapsulated into a low-temperature-cured synthetic silicone. The sensors are wavelength interrogated by a commercially available system from Moog Insensys, and the wavelength changes are calibrated to recover curvature. A three-dimensional algorithm is used to generate shape changes during respiration that allow the measurement of absolute volume changes at various sections of the torso. It is shown that the sensing scheme yields a volumetric error of 6%. Comparing the volume data obtained from the spirometer with the volume estimated with the synchronous data from the shape-sensing array yielded a correlation value 0.86 with a Pearson's correlation coefficient p<0.01.

A new algorithm for primary hypospadias repair based on tip urethroplasty.

PubMed

Sozubir, Selami; Snodgrass, Warren

2003-08-01

Decision making in hypospadias repair potentially can be simplified by tubularized incised plate (TIP) urethroplasty. The authors report management and outcomes in a consecutive series of primary hypospadias repairs in which the intent was to perform TIP. Records of 106 consecutive boys undergoing hypospadias repair by 1 surgeon were reviewed. Position of the meatus, degree and management of curvature, technical details of the urethroplasty, and postoperative complications were recorded. Curvature was noted in 24 (23%) of patients, but could be corrected with preservation of the urethral plate in all but 3. In another boy, the incised plate was thought "unhealthy" for tubularization. The remaining 102 underwent TIP, of whom, 75 had distal and 27 had proximal hypospadias. Complications, primarily fistulas, occurred in 14 (13%) of these patients. The other 4 boys underwent staged repairs that utilized TIP for the glanular urethra at the second operation. The authors found decision making was no longer determined by meatal location as in the past, but by severity of curvature and appearance of the incised urethral plate. Because severe curvature requiring plate transection or an "unhealthy" incised plate are uncommonly encountered, TIP repair can be performed for most hypospadias operations.

Femoral curvature variability in modern humans using three-dimensional quadric surface fitting.

PubMed

Chapman, Tara; Sholukha, Victor; Semal, Patrick; Louryan, Stéphane; Rooze, Marcel; Van Sint Jan, Serge

2015-12-01

This study analysed femoral curvature in a population from Belgium in conjunction with other morphological characteristics by the use of three-dimensional (3D) quadric surfaces (QS) modelled from the bone surface. 3D models were created from computed tomography data of 75 femoral modern human bones. Anatomical landmarks (ALs) were palpated in specific bony areas of the femur (shaft, condyles, neck and head). QS were then created from the surface vertices which enclose these ALs. The diaphyseal shaft was divided into five QS shapes to analyse curvature in different parts of the shaft. Femoral bending differs in different parts of the diaphyseal shaft. The greatest degree of curvature was found in the distal shaft (mean 4.5° range 0.2°-10°) followed by the proximal (mean 4.4° range 1.5°-10.2°), proximal intermediate (mean 3.7° range 0.9°-7.9°) and distal intermediate (mean 1.8° range 0.2°-5.6°) shaft sections. The proximal and distal angles were significantly more bowed than the intermediate proximal and the intermediate distal angle. There was no significant difference between the proximal and distal angle. No significant correlations were found between morphological characteristics and femoral curvature. An extremely large variability of femoral curvature with several bones displaying very high or low degrees of femoral curvature was also found. 3D QS fitting enables the creation of accurate models which can discriminate between different patterns in similar curvatures and demonstrates there is a clear difference between curvature in different parts of the shaft.

3-D shape estimation of DNA molecules from stereo cryo-electron micro-graphs using a projection-steerable snake.

PubMed

Jacob, Mathews; Blu, Thierry; Vaillant, Cedric; Maddocks, John H; Unser, Michael

2006-01-01

We introduce a three-dimensional (3-D) parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We estimate the shape by matching the projections of a 3-D global shape model with the micrographs; we choose the global model as a 3-D filament with a B-spline skeleton and a specified radial profile. The active contour algorithm iteratively updates the B-spline coefficients, which requires us to evaluate the projections and match them with the micrographs at every iteration. Since the evaluation of the projections of the global model is computationally expensive, we propose a fast algorithm based on locally approximating it by elongated blob-like templates. We introduce the concept of projection-steerability and derive a projection-steerable elongated template. Since the two-dimensional projections of such a blob at any 3-D orientation can be expressed as a linear combination of a few basis functions, matching the projections of such a 3-D template involves evaluating a weighted sum of inner products between the basis functions and the micrographs. The weights are simple functions of the 3-D orientation and the inner-products are evaluated efficiently by separable filtering. We choose an internal energy term that penalizes the average curvature magnitude. Since the exact length of the DNA molecule is known a priori, we introduce a constraint energy term that forces the curve to have this specified length. The sum of these energies along with the image energy derived from the matching process is minimized using the conjugate gradients algorithm. We validate the algorithm using real, as well as simulated, data and show that it performs well.

Neural net classification of liver ultrasonogram for quantitative evaluation of diffuse liver disease

NASA Astrophysics Data System (ADS)

Lee, Dong Hyuk; Kim, JongHyo; Kim, Hee C.; Lee, Yong W.; Min, Byong Goo

1997-04-01

There have been a number of studies on the quantitative evaluation of diffuse liver disease by using texture analysis technique. However, the previous studies have been focused on the classification between only normal and abnormal pattern based on textural properties, resulting in lack of clinically useful information about the progressive status of liver disease. Considering our collaborative research experience with clinical experts, we judged that not only texture information but also several shape properties are necessary in order to successfully classify between various states of disease with liver ultrasonogram. Nine image parameters were selected experimentally. One of these was texture parameter and others were shape parameters measured as length, area and curvature. We have developed a neural-net algorithm that classifies liver ultrasonogram into 9 categories of liver disease: 3 main category and 3 sub-steps for each. Nine parameters were collected semi- automatically from the user by using graphical user interface tool, and then processed to give a grade for each parameter. Classifying algorithm consists of two steps. At the first step, each parameter was graded into pre-defined levels using neural network. in the next step, neural network classifier determined disease status using graded nine parameters. We implemented a PC based computer-assist diagnosis workstation and installed it in radiology department of Seoul National University Hospital. Using this workstation we collected 662 cases during 6 months. Some of these were used for training and others were used for evaluating accuracy of the developed algorithm. As a conclusion, a liver ultrasonogram classifying algorithm was developed using both texture and shape parameters and neural network classifier. Preliminary results indicate that the proposed algorithm is useful for evaluation of diffuse liver disease.

Normal-Mode Analysis of Circular DNA at the Base-Pair Level. 2. Large-Scale Configurational Transformation of a Naturally Curved Molecule.

PubMed

Matsumoto, Atsushi; Tobias, Irwin; Olson, Wilma K

2005-01-01

Fine structural and energetic details embedded in the DNA base sequence, such as intrinsic curvature, are important to the packaging and processing of the genetic material. Here we investigate the internal dynamics of a 200 bp closed circular molecule with natural curvature using a newly developed normal-mode treatment of DNA in terms of neighboring base-pair "step" parameters. The intrinsic curvature of the DNA is described by a 10 bp repeating pattern of bending distortions at successive base-pair steps. We vary the degree of intrinsic curvature and the superhelical stress on the molecule and consider the normal-mode fluctuations of both the circle and the stable figure-8 configuration under conditions where the energies of the two states are similar. To extract the properties due solely to curvature, we ignore other important features of the double helix, such as the extensibility of the chain, the anisotropy of local bending, and the coupling of step parameters. We compare the computed normal modes of the curved DNA model with the corresponding dynamical features of a covalently closed duplex of the same chain length constructed from naturally straight DNA and with the theoretically predicted dynamical properties of a naturally circular, inextensible elastic rod, i.e., an O-ring. The cyclic molecules with intrinsic curvature are found to be more deformable under superhelical stress than rings formed from naturally straight DNA. As superhelical stress is accumulated in the DNA, the frequency, i.e., energy, of the dominant bending mode decreases in value, and if the imposed stress is sufficiently large, a global configurational rearrangement of the circle to the figure-8 form takes place. We combine energy minimization with normal-mode calculations of the two states to decipher the configurational pathway between the two states. We also describe and make use of a general analytical treatment of the thermal fluctuations of an elastic rod to characterize the motions of the minicircle as a whole from knowledge of the full set of normal modes. The remarkable agreement between computed and theoretically predicted values of the average deviation and dispersion of the writhe of the circular configuration adds to the reliability in the computational approach. Application of the new formalism to the computed modes of the figure-8 provides insights into macromolecular motions which are beyond the scope of current theoretical treatments.

Computation of breast ptosis from 3D surface scans of the female torso.

PubMed

Li, Danni; Cheong, Audrey; Reece, Gregory P; Crosby, Melissa A; Fingeret, Michelle C; Merchant, Fatima A

2016-11-01

Stereophotography is now finding a niche in clinical breast surgery, and several methods for quantitatively measuring breast morphology from 3D surface images have been developed. Breast ptosis (sagging of the breast), which refers to the extent by which the nipple is lower than the inframammary fold (the contour along which the inferior part of the breast attaches to the chest wall), is an important morphological parameter that is frequently used for assessing the outcome of breast surgery. This study presents a novel algorithm that utilizes three-dimensional (3D) features such as surface curvature and orientation for the assessment of breast ptosis from 3D scans of the female torso. The performance of the computational approach proposed was compared against the consensus of manual ptosis ratings by nine plastic surgeons, and that of current 2D photogrammetric methods. Compared to the 2D methods, the average accuracy for 3D features was ~13% higher, with an increase in precision, recall, and F-score of 37%, 29%, and 33%, respectively. The computational approach proposed provides an improved and unbiased objective method for rating ptosis when compared to qualitative visualization by observers, and distance based 2D photogrammetry approaches. Copyright © 2016 Elsevier Ltd. All rights reserved.

Incorporating scale into digital terrain analysis

NASA Astrophysics Data System (ADS)

Dragut, L. D.; Eisank, C.; Strasser, T.

2009-04-01

Digital Elevation Models (DEMs) and their derived terrain attributes are commonly used in soil-landscape modeling. Process-based terrain attributes meaningful to the soil properties of interest are sought to be produced through digital terrain analysis. Typically, the standard 3 X 3 window-based algorithms are used for this purpose, thus tying the scale of resulting layers to the spatial resolution of the available DEM. But this is likely to induce mismatches between scale domains of terrain information and soil properties of interest, which further propagate biases in soil-landscape modeling. We have started developing a procedure to incorporate scale into digital terrain analysis for terrain-based environmental modeling (Drăguţ et al., in press). The workflow was exemplified on crop yield data. Terrain information was generalized into successive scale levels with focal statistics on increasing neighborhood size. The degree of association between each terrain derivative and crop yield values was established iteratively for all scale levels through correlation analysis. The first peak of correlation indicated the scale level to be further retained. While in a standard 3 X 3 window-based analysis mean curvature was one of the poorest correlated terrain attribute, after generalization it turned into the best correlated variable. To illustrate the importance of scale, we compared the regression results of unfiltered and filtered mean curvature vs. crop yield. The comparison shows an improvement of R squared from a value of 0.01 when the curvature was not filtered, to 0.16 when the curvature was filtered within 55 X 55 m neighborhood size. This indicates the optimum size of curvature information (scale) that influences soil fertility. We further used these results in an object-based image analysis environment to create terrain objects containing aggregated values of both terrain derivatives and crop yield. Hence, we introduce terrain segmentation as an alternative method for generating scale levels in terrain-based environmental modeling. Based on segments, R squared improved up to a value of 0.47. Before integrating the procedure described above into a software application, thorough comparison between the results of different generalization techniques, on different datasets and terrain conditions is necessary. This is the subject of our ongoing research as part of the SCALA project (Scales and Hierarchies in Landform Classification). References: Drăguţ, L., Schauppenlehner, T., Muhar, A., Strobl, J. and Blaschke, T., in press. Optimization of scale and parametrization for terrain segmentation: an application to soil-landscape modeling, Computers & Geosciences.

Discrete curvatures combined with machine learning for automated extraction of impact craters on 3D topographic meshes

NASA Astrophysics Data System (ADS)

Christoff, Nicole; Jorda, Laurent; Viseur, Sophie; Bouley, Sylvain; Manolova, Agata; Mari, Jean-Luc

2017-04-01

One of the challenges of Planetary Science is to estimate as accurately as possible the age of the geological units that crop out on the different space objects in the Solar system. This dating relies on the counting of the impact craters that cover the given outcrop surface. Using this technique, a chronology of the geological events can be determined and their formation and evolution processes can be understood. Over the last decade, several missions to asteroids and planets, such as Dawn to Vesta and Ceres, Messenger to Mercury, Mars Orbiter and Mars Express, produced a huge amount of images, from which equally huge DEMs have been generated. Planned missions, such as BepiColombo, will produce an even larger set of images. This rapidly growing amount of visible images and DEMs makes it more and more fastidious to manually identify craters. Acquisition data will become bigger and this will then require more accurate planetary surface analysis. Because of the importance of the problem, many Crater Detection Algorithm (CDA) were developed and applied onto either image data (2D) or DEM (2D1/5), and rarely onto full 3D data such as 3D topographic meshes. We propose a new approach, based on the detection of crater rim, which form a characteristic round shape. The proposed approach contains two main steps: 1) each vertex is labelled with the values of the mean curvature and minimal curvatures; 2) this curvature map is injected into a Neural Network (NN) to automatically process the region of interest. As a NN approach, it requires a training set of manually detected craters to estimate the optimal weights of the NN. Once trained, the NN can be applied onto the regions of interest for automatically extracting all the craters. As a result, it was observed that detecting forms using a two-dimensional map based on the computation of discrete differential estimators on the 3D mesh is more efficient than using a simple elevation map. This approach significantly reduces the number of false negative detections compared to previous approaches based on 2.5D data processing. The proposed method was validated on a Mars dataset, including a numerical topography acquired by the Mars Orbiter Laser Altimeter (MOLA) instrument and combined with Barlow et al. (2000) crater database. Keywords: geometric modeling, mesh processing, neural network, discrete curvatures, crater detection, planetary science.

CURVATURE-DRIVEN MOLECULAR FLOW ON MEMBRANE SURFACE*

PubMed Central

MIKUCKI, MICHAEL; ZHOU, Y. C.

2017-01-01

This work presents a mathematical model for the localization of multiple species of diffusion molecules on membrane surfaces. Morphological change of bilayer membrane in vivo is generally modulated by proteins. Most of these modulations are associated with the localization of related proteins in the crowded lipid environments. We start with the energetic description of the distributions of molecules on curved membrane surface, and define the spontaneous curvature of bilayer membrane as a function of the molecule concentrations on membrane surfaces. A drift-diffusion equation governs the gradient flow of the surface molecule concentrations. We recast the energetic formulation and the related governing equations by using an Eulerian phase field description to define membrane morphology. Computational simulations with the proposed mathematical model and related numerical techniques predict (i) the molecular localization on static membrane surfaces at locations with preferred mean curvatures, and (ii) the generation of preferred mean curvature which in turn drives the molecular localization. PMID:29056778

Computer simulation of flagellar movement VIII: coordination of dynein by local curvature control can generate helical bending waves.

PubMed

Brokaw, Charles J

2002-10-01

Computer simulations have been carried out with a model flagellum that can bend in three dimensions. A pattern of dynein activation in which regions of dynein activity propagate along each doublet, with a phase shift of approximately 1/9 wavelength between adjacent doublets, will produce a helical bending wave. This pattern can be termed "doublet metachronism." The simulations show that doublet metachronism can arise spontaneously in a model axoneme in which activation of dyneins is controlled locally by the curvature of each outer doublet microtubule. In this model, dyneins operate both as sensors of curvature and as motors. Doublet metachronism and the chirality of the resulting helical bending pattern are regulated by the angular difference between the direction of the moment and sliding produced by dyneins on a doublet and the direction of the controlling curvature for that doublet. A flagellum that is generating a helical bending wave experiences twisting moments when it moves against external viscous resistance. At high viscosities, helical bending will be significantly modified by twist unless the twist resistance is greater than previously estimated. Spontaneous doublet metachronism must be modified or overridden in order for a flagellum to generate the planar bending waves that are required for efficient propulsion of spermatozoa. Planar bending can be achieved with the three-dimensional flagellar model by appropriate specification of the direction of the controlling curvature for each doublet. However, experimental observations indicate that this "hard-wired" solution is not appropriate for real flagella. Copyright 2002 Wiley-Liss, Inc.

Identification of Apical and Cervical Curvature Radius of Human Molars.

PubMed

Estrela, Carlos; Bueno, Mike R; Barletta, Fernando B; Guedes, Orlando A; Porto, Olavo C; Estrela, Cyntia R A; Pécora, Jesus Djalma

2015-01-01

To determine the frequency of apical and cervical curvatures in human molars using the radius method and cone-beam computed tomography (CBCT) images. Four hundred images of mandibular and maxillary first and second molars were selected from a database of CBCT exams. The radius of curvature of curved root canals was measured using a circumcenter based on three mathematical points. Radii were classified according to the following scores: 0 - straight line; 1 - large radius (r > 8 mm, mild curvature); 2 - intermediate radius (r > 4 and r < 8 mm, moderate curvature); and 3 - small radius (r ≤ 4 mm, severe curvature). The frequency of curved root canals was analyzed according to root canal, root thirds, and coronal and sagittal planes, and assessed using the chi-square test (significance at α = 0.05). Of the 1,200 evaluated root canals, 92.75% presented curved root canals in the apical third and 73.25% in the cervical third on coronal plane images; sagittal plane analysis yielded 89.75% of curved canals in the apical third and 77% in the cervical third. Root canals with a large radius were significantly more frequent when compared with the other categories, regardless of root third or plane. Most root canals of maxillary and mandibular first and second molars showed some degree of curvature in the apical and cervical thirds, regardless of the analyzed plane (coronal or sagittal).

Generations of orthogonal surface coordinates

NASA Technical Reports Server (NTRS)

Blottner, F. G.; Moreno, J. B.

1980-01-01

Two generation methods were developed for three dimensional flows where the computational domain normal to the surface is small. With this restriction the coordinate system requires orthogonality only at the body surface. The first method uses the orthogonal condition in finite-difference form to determine the surface coordinates with the metric coefficients and curvature of the coordinate lines calculated numerically. The second method obtains analytical expressions for the metric coefficients and for the curvature of the coordinate lines.

Bubbly vertex dynamics: A dynamical and geometrical model for epithelial tissues with curved cell shapes

NASA Astrophysics Data System (ADS)

Ishimoto, Yukitaka; Morishita, Yoshihiro

2014-11-01

In order to describe two-dimensionally packed cells in epithelial tissues both mathematically and physically, there have been developed several sorts of geometrical models, such as the vertex model, the finite element model, the cell-centered model, and the cellular Potts model. So far, in any case, pressures have not neatly been dealt with and the curvatures of the cell boundaries have been even omitted through their approximations. We focus on these quantities and formulate them in the vertex model. Thus, a model with the curvatures is constructed, and its algorithm for simulation is provided. The possible extensions and applications of this model are also discussed.

Fractional charge and inter-Landau-level states at points of singular curvature.

PubMed

Biswas, Rudro R; Son, Dam Thanh

2016-08-02

The quest for universal properties of topological phases is fundamentally important because these signatures are robust to variations in system-specific details. Aspects of the response of quantum Hall states to smooth spatial curvature are well-studied, but challenging to observe experimentally. Here we go beyond this prevailing paradigm and obtain general results for the response of quantum Hall states to points of singular curvature in real space; such points may be readily experimentally actualized. We find, using continuum analytical methods, that the point of curvature binds an excess fractional charge and sequences of quantum states split away, energetically, from the degenerate bulk Landau levels. Importantly, these inter-Landau-level states are bound to the topological singularity and have energies that are universal functions of bulk parameters and the curvature. Our exact diagonalization of lattice tight-binding models on closed manifolds demonstrates that these results continue to hold even when lattice effects are significant. An important technological implication of these results is that these inter-Landau-level states, being both energetically and spatially isolated quantum states, are promising candidates for constructing qubits for quantum computation.

Molecular Modeling of Lipid Membrane Curvature Induction by a Peptide: More than Simply Shape

PubMed Central

Sodt, Alexander J.; Pastor, Richard W.

2014-01-01

Molecular dynamics simulations of an amphipathic helix embedded in a lipid bilayer indicate that it will induce substantial positive curvature (e.g., a tube of diameter 20 nm at 16% surface coverage). The induction is twice that of a continuum model prediction that only considers the shape of the inclusion. The discrepancy is explained in terms of the additional presence of specific interactions described only by the molecular model. The conclusion that molecular shape alone is insufficient to quantitatively model curvature is supported by contrasting molecular and continuum models of lipids with large and small headgroups (choline and ethanolamine, respectively), and of the removal of a lipid tail (modeling a lyso-lipid). For the molecular model, curvature propensity is analyzed by computing the derivative of the free energy with respect to bending. The continuum model predicts that the inclusion will soften the bilayer near the headgroup region, an effect that may weaken curvature induction. The all-atom predictions are consistent with experimental observations of the degree of tubulation by amphipathic helices and variation of the free energy of binding to liposomes. PMID:24806928

Observer variation in the assessment of root canal curvature.

PubMed

Faraj, S; Boutsioukis, C

2017-02-01

To evaluate the inter- and intra-observer agreement between training/trained endodontists regarding the ex vivo classification of root canal curvature into three categories and its measurement using three quantitative methods. Periapical radiographs of seven extracted human posterior teeth with varying degrees of curvature were exposed ex vivo. Twenty training/trained endodontists were asked to classify the root canal curvature into three categories (<10°, 10-30°, >30°), to measure the curvature using three quantitative methods (Schneider, Weine, Pruett) and to draw angles of 10° or 30°, as a control experiment. The procedure was repeated after six weeks. Inter- and intra-observer agreement was evaluated by the intraclass correlation coefficient and weighted kappa. The inter-observer agreement on the visual classification of root canal curvature was substantial (ICC = 0.65, P < 0.018), but a trend towards underestimation of the angle was evident. Participants modified their classifications both within and between the two sessions. Median angles drawn as a control experiment were not significantly different from the target values (P > 0.10), but the results of individual participants varied. When quantitative methods were used, the inter- and intra-observer agreement on the angle measurements was considerably better (ICC = 0.76-0.82, P < 0.001) than on the radius measurements (ICC = 0.16-0.19, P > 0.895). Visual estimation of root canal curvature was not reliable. The use of computer-based quantitative methods is recommended. The measurement of radius of curvature was more subjective than angle measurement. Endodontic Associations need to provide specific guidelines on how to estimate root canal curvature in case difficulty assessment forms. © 2015 International Endodontic Journal. Published by John Wiley & Sons Ltd.

Curvature effect on hemodynamic conditions at the inner bend of the carotid siphon and its relation to aneurysm formation.

PubMed

Lauric, Alexandra; Hippelheuser, James; Safain, Mina G; Malek, Adel M

2014-09-22

Although high-impact hemodynamic forces are thought to lead to cerebral aneurysmal change, little is known about the aneurysm formation on the inner aspect of vascular bends such as the internal carotid artery (ICA) siphon where wall shear stress (WSS) is expected to be low. This study evaluates the effect of vessel curvature and hemodynamics on aneurysm formation along the inner carotid siphon. Catheter 3D-rotational angiographic volumes of 35 ICA (10 aneurysms, 25 controls) were evaluated in 3D for radius of curvature and peak curvature of the siphon bend, followed by univariate statistical analysis. Computational fluid dynamic (CFD) simulations were performed on patient-derived models after aneurysm removal and on synthetic variants of increasing curvature. Peak focal siphon curvature was significantly higher in aneurysm bearing ICAs (0.36 ± 0.045 vs. 0.30 ± 0.048 mm(-1), p=0.003), with no difference in global radius of curvature (p=0.36). In CFD simulations, increasing parametric curvature tightness (from 5 to 3mm radius) resulted in dramatic increase of WSS and WSS gradient magnitude (WSSG) on the inner wall of the bend. In patient-derived data, the location of aneurysms coincided with regions of low WSS (<4 Pa) flanked by high WSS and WSSG peaks. WSS peaks correlated with the aneurysm neck. In contrast, control siphon bends displayed low, almost constant, WSS and WSSG profiles with little spatial variation. High bend curvature induces dynamically fluctuating high proximal WSS and WSSG followed by regions of flow stasis and recirculation, leading to local conditions known to induce destructive vessel wall remodeling and aneurysmal initiation. Copyright © 2014 Elsevier Ltd. All rights reserved.

Transonic Investigation of Two-Dimensional Nozzles Designed for Supersonic Cruise

NASA Technical Reports Server (NTRS)

Capone, Francis J.; Deere, Karen A.

2015-01-01

An experimental and computational investigation has been conducted to determine the off-design uninstalled drag characteristics of a two-dimensional convergent-divergent nozzle designed for a supersonic cruise civil transport. The overall objectives were to: (1) determine the effects of nozzle external flap curvature and sidewall boattail variations on boattail drag; (2) develop an experimental data base for 2D nozzles with long divergent flaps and small boattail angles and (3) provide data for correlating computational fluid dynamic predictions of nozzle boattail drag. The experimental investigation was conducted in the Langley 16-Foot Transonic Tunnel at Mach numbers from 0.80 to 1.20 at nozzle pressure ratios up to 9. Three-dimensional simulations of nozzle performance were obtained with the computational fluid dynamics code PAB3D using turbulence closure and nonlinear Reynolds stress modeling. The results of this investigation indicate that excellent correlation between experimental and predicted results was obtained for the nozzle with a moderate amount of boattail curvature. The nozzle with an external flap having a sharp shoulder (no curvature) had the lowest nozzle pressure drag. At a Mach number of 1.2, sidewall pressure drag doubled as sidewall boattail angle was increased from 4deg to 8deg. Reducing the height of the sidewall caused large decreases in both the sidewall and flap pressure drags. Summary

Multiscale methods for gore curvature calculations from FSI modeling of spacecraft parachutes

NASA Astrophysics Data System (ADS)

Takizawa, Kenji; Tezduyar, Tayfun E.; Kolesar, Ryan; Boswell, Cody; Kanai, Taro; Montel, Kenneth

2014-12-01

There are now some sophisticated and powerful methods for computer modeling of parachutes. These methods are capable of addressing some of the most formidable computational challenges encountered in parachute modeling, including fluid-structure interaction (FSI) between the parachute and air flow, design complexities such as those seen in spacecraft parachutes, and operational complexities such as use in clusters and disreefing. One should be able to extract from a reliable full-scale parachute modeling any data or analysis needed. In some cases, however, the parachute engineers may want to perform quickly an extended or repetitive analysis with methods based on simplified models. Some of the data needed by a simplified model can very effectively be extracted from a full-scale computer modeling that serves as a pilot. A good example of such data is the circumferential curvature of a parachute gore, where a gore is the slice of the parachute canopy between two radial reinforcement cables running from the parachute vent to the skirt. We present the multiscale methods we devised for gore curvature calculation from FSI modeling of spacecraft parachutes. The methods include those based on the multiscale sequentially-coupled FSI technique and using NURBS meshes. We show how the methods work for the fully-open and two reefed stages of the Orion spacecraft main and drogue parachutes.

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.

L-split marker for augmented reality in aircraft assembly

NASA Astrophysics Data System (ADS)

Han, Pengfei; Zhao, Gang

2016-04-01

In order to improve the performance of conventional square markers widely used by marker-based augmented reality systems in aircraft assembly environments, an L-split marker is proposed. Every marker consists of four separate L-shaped parts and each of them contains partial information about the marker. Geometric features of the L-shape, which are more discriminate than the symmetrical square shape adopted by conventional markers, are used to detect proposed markers from the camera images effectively. The marker is split into four separate parts in order to improve the robustness to occlusion and curvature to some extent. The registration process can be successfully completed as long as three parts are detected (up to about 80% of the area could be occluded). Moreover, when we attach the marker on nonplanar surfaces, the curvature status of the marker can be roughly analyzed with every part's normal direction, which can be obtained since their six corners have been explicitly determined in the previous detection process. And based on the marker design, new detection and recognition algorithms are proposed and detailed. The experimental results show that the marker and the algorithms are effective.

Curvature constraints from large scale structure

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

Dio, Enea Di; Montanari, Francesco; Raccanelli, Alvise

We modified the CLASS code in order to include relativistic galaxy number counts in spatially curved geometries; we present the formalism and study the effect of relativistic corrections on spatial curvature. The new version of the code is now publicly available. Using a Fisher matrix analysis, we investigate how measurements of the spatial curvature parameter Ω {sub K} with future galaxy surveys are affected by relativistic effects, which influence observations of the large scale galaxy distribution. These effects include contributions from cosmic magnification, Doppler terms and terms involving the gravitational potential. As an application, we consider angle and redshift dependentmore » power spectra, which are especially well suited for model independent cosmological constraints. We compute our results for a representative deep, wide and spectroscopic survey, and our results show the impact of relativistic corrections on spatial curvature parameter estimation. We show that constraints on the curvature parameter may be strongly biased if, in particular, cosmic magnification is not included in the analysis. Other relativistic effects turn out to be subdominant in the studied configuration. We analyze how the shift in the estimated best-fit value for the curvature and other cosmological parameters depends on the magnification bias parameter, and find that significant biases are to be expected if this term is not properly considered in the analysis.« less

Curvature methods of damage detection using digital image correlation

NASA Astrophysics Data System (ADS)

Helfrick, Mark N.; Niezrecki, Christopher; Avitabile, Peter

2009-03-01

Analytical models have shown that local damage in a structure can be detected by studying changes in the curvature of the structure's displaced shape while under an applied load. In order for damage to be detected, located, and quantified using curvature methods, a spatially dense set of measurement points is required on the structure of interest and the change in curvature must be measurable. Experimental testing done to validate the theory is often plagued by sparse data sets and experimental noise. Furthermore, the type of load, the location and severity of the damage, and the mechanical properties (material and geometry) of the structure have a significant effect on how much the curvature will change. Within this paper, three-dimensional (3D) Digital Image Correlation (DIC) as one possible method for detecting damage through curvature methods is investigated. 3D DIC is a non-contacting full-field measurement technique which uses a stereo pair of digital cameras to capture surface shape. This approach allows for an extremely dense data set across the entire visible surface of an object. A test is performed to validate the approach on an aluminum cantilever beam. A dynamic load is applied to the beam which allows for measurements to be made of the beam's response at each of its first three resonant frequencies, corresponding to the first three bending modes of the structure. DIC measurements are used with damage detection algorithms to predict damage location with varying levels of damage inflicted in the form of a crack with a prescribed depth. The testing demonstrated that this technique will likely only work with structures where a large displaced shape is easily achieved and in cases where the damage is relatively severe. Practical applications and limitations of the technique are discussed.

Spline-Based Smoothing of Airfoil Curvatures

NASA Technical Reports Server (NTRS)

Li, W.; Krist, S.

2008-01-01

Constrained fitting for airfoil curvature smoothing (CFACS) is a splinebased method of interpolating airfoil surface coordinates (and, concomitantly, airfoil thicknesses) between specified discrete design points so as to obtain smoothing of surface-curvature profiles in addition to basic smoothing of surfaces. CFACS was developed in recognition of the fact that the performance of a transonic airfoil is directly related to both the curvature profile and the smoothness of the airfoil surface. Older methods of interpolation of airfoil surfaces involve various compromises between smoothing of surfaces and exact fitting of surfaces to specified discrete design points. While some of the older methods take curvature profiles into account, they nevertheless sometimes yield unfavorable results, including curvature oscillations near end points and substantial deviations from desired leading-edge shapes. In CFACS as in most of the older methods, one seeks a compromise between smoothing and exact fitting. Unlike in the older methods, the airfoil surface is modified as little as possible from its original specified form and, instead, is smoothed in such a way that the curvature profile becomes a smooth fit of the curvature profile of the original airfoil specification. CFACS involves a combination of rigorous mathematical modeling and knowledge-based heuristics. Rigorous mathematical formulation provides assurance of removal of undesirable curvature oscillations with minimum modification of the airfoil geometry. Knowledge-based heuristics bridge the gap between theory and designers best practices. In CFACS, one of the measures of the deviation of an airfoil surface from smoothness is the sum of squares of the jumps in the third derivatives of a cubicspline interpolation of the airfoil data. This measure is incorporated into a formulation for minimizing an overall deviation- from-smoothness measure of the airfoil data within a specified fitting error tolerance. CFACS has been extensively tested on a number of supercritical airfoil data sets generated by inverse design and optimization computer programs. All of the smoothing results show that CFACS is able to generate unbiased smooth fits of curvature profiles, trading small modifications of geometry for increasing curvature smoothness by eliminating curvature oscillations and bumps (see figure).

Deformation of Surface Nanobubbles Induced by Substrate Hydrophobicity.

PubMed

Wei, Jiachen; Zhang, Xianren; Song, Fan

2016-12-13

Recent experimental measurements have shown that there exists a population of nanobubbles with different curvature radii, whereas both computer simulations and theoretical analysis indicated that the curvature radii of different nanobubbles should be the same at a given supersaturation. To resolve such inconsistency, we perform molecular dynamics simulations on surface nanobubbles that are stabilized by heterogeneous substrates either in the geometrical heterogeneity model (GHM) or in the chemical heterogeneity model (CHM) and propose that the inconsistency could be ascribed to the substrate-induced nanobubble deformation. We find that, as expected from theory and computer simulation, for either the GHM or the CHM, there exists a universal upper limit of contact angle for the nanobubbles, which is determined by the degree of supersaturation alone. By analyzing the evolution of the shape of nanobubbles as a function of substrate hydrophobicity that is controlled here by the liquid-solid interaction, two different origins of nanobubble deformation are identified. For substrates in the GHM, where the contact line is pinned by surface roughness, variation in the liquid-solid interaction changes only the location of the contact line and the measured contact angle, without causing a change in the nanobubble curvature. For substrates in the CHM, however, the liquid-solid interaction exerted by the bottom substrate can deform the vapor-liquid interface, resulting in variations in both the curvature of the vapor-liquid interface and the contact angle.

Automatic approach to deriving fuzzy slope positions

NASA Astrophysics Data System (ADS)

Zhu, Liang-Jun; Zhu, A.-Xing; Qin, Cheng-Zhi; Liu, Jun-Zhi

2018-03-01

Fuzzy characterization of slope positions is important for geographic modeling. Most of the existing fuzzy classification-based methods for fuzzy characterization require extensive user intervention in data preparation and parameter setting, which is tedious and time-consuming. This paper presents an automatic approach to overcoming these limitations in the prototype-based inference method for deriving fuzzy membership value (or similarity) to slope positions. The key contribution is a procedure for finding the typical locations and setting the fuzzy inference parameters for each slope position type. Instead of being determined totally by users in the prototype-based inference method, in the proposed approach the typical locations and fuzzy inference parameters for each slope position type are automatically determined by a rule set based on prior domain knowledge and the frequency distributions of topographic attributes. Furthermore, the preparation of topographic attributes (e.g., slope gradient, curvature, and relative position index) is automated, so the proposed automatic approach has only one necessary input, i.e., the gridded digital elevation model of the study area. All compute-intensive algorithms in the proposed approach were speeded up by parallel computing. Two study cases were provided to demonstrate that this approach can properly, conveniently and quickly derive the fuzzy slope positions.

Modifications to the streamtube curvature program. Volume 1: Program modifications and user's manual. [user manuals (computer programs) for transonic flow of nacelles and intake systems of turbofan engines

NASA Technical Reports Server (NTRS)

Ferguson, D. R.; Keith, J. S.

1975-01-01

The improvements which have been incorporated in the Streamtube Curvature Program to enhance both its computational and diagnostic capabilities are described. Detailed descriptions are given of the revisions incorporated to more reliably handle the jet stream-external flow interaction at trailing edges. Also presented are the augmented boundary layer procedures and a variety of other program changes relating to program diagnostics and extended solution capabilities. An updated User's Manual, that includes information on the computer program operation, usage, and logical structure, is presented. User documentation includes an outline of the general logical flow of the program and detailed instructions for program usage and operation. From the standpoint of the programmer, the overlay structure is described. The input data, output formats, and diagnostic printouts are covered in detail and illustrated with three typical test cases.

Multi-Scale Surface Descriptors

PubMed Central

Cipriano, Gregory; Phillips, George N.; Gleicher, Michael

2010-01-01

Local shape descriptors compactly characterize regions of a surface, and have been applied to tasks in visualization, shape matching, and analysis. Classically, curvature has be used as a shape descriptor; however, this differential property characterizes only an infinitesimal neighborhood. In this paper, we provide shape descriptors for surface meshes designed to be multi-scale, that is, capable of characterizing regions of varying size. These descriptors capture statistically the shape of a neighborhood around a central point by fitting a quadratic surface. They therefore mimic differential curvature, are efficient to compute, and encode anisotropy. We show how simple variants of mesh operations can be used to compute the descriptors without resorting to expensive parameterizations, and additionally provide a statistical approximation for reduced computational cost. We show how these descriptors apply to a number of uses in visualization, analysis, and matching of surfaces, particularly to tasks in protein surface analysis. PMID:19834190

An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features.

PubMed

He, Ying; Liang, Bin; Yang, Jun; Li, Shunzhi; He, Jin

2017-08-11

The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accurate registration of 3D point cloud data. The algorithm requires a proper initial value and the approximate registration of two point clouds to prevent the algorithm from falling into local extremes, but in the actual point cloud matching process, it is difficult to ensure compliance with this requirement. In this paper, we proposed the ICP algorithm based on point cloud features (GF-ICP). This method uses the geometrical features of the point cloud to be registered, such as curvature, surface normal and point cloud density, to search for the correspondence relationships between two point clouds and introduces the geometric features into the error function to realize the accurate registration of two point clouds. The experimental results showed that the algorithm can improve the convergence speed and the interval of convergence without setting a proper initial value.

An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features

PubMed Central

Liang, Bin; Yang, Jun; Li, Shunzhi; He, Jin

2017-01-01

The Iterative Closest Points (ICP) algorithm is the mainstream algorithm used in the process of accurate registration of 3D point cloud data. The algorithm requires a proper initial value and the approximate registration of two point clouds to prevent the algorithm from falling into local extremes, but in the actual point cloud matching process, it is difficult to ensure compliance with this requirement. In this paper, we proposed the ICP algorithm based on point cloud features (GF-ICP). This method uses the geometrical features of the point cloud to be registered, such as curvature, surface normal and point cloud density, to search for the correspondence relationships between two point clouds and introduces the geometric features into the error function to realize the accurate registration of two point clouds. The experimental results showed that the algorithm can improve the convergence speed and the interval of convergence without setting a proper initial value. PMID:28800096

Application of a free-energy-landscape approach to study tension-dependent bilayer tubulation mediated by curvature-inducing proteins.

PubMed

Tourdot, Richard W; Ramakrishnan, N; Baumgart, Tobias; Radhakrishnan, Ravi

2015-10-01

We investigate the phenomenon of protein-induced tubulation of lipid bilayer membranes within a continuum framework using Monte Carlo simulations coupled with the Widom insertion technique to compute excess chemical potentials. Tubular morphologies are spontaneously formed when the density and the curvature-field strength of the membrane-bound proteins exceed their respective thresholds and this transition is marked by a sharp drop in the excess chemical potential. We find that the planar to tubular transition can be described by a micellar model and that the corresponding free-energy barrier increases with an increase in the curvature-field strength (i.e., of protein-membrane interactions) and also with an increase in membrane tension.

ALDF Data Retrieval Algorithms for Validating the Optical Transient Detector (OTD) and the Lightning Imaging Sensor (LIS)

NASA Technical Reports Server (NTRS)

Koshak, W. J.; Blakeslee, R. J.; Bailey, J. C.

1997-01-01

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from in Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions and solutions for the plane (i.e.. no Earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated data sets and the relative influence of bearing and arrival time data on the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA's Optical Transient Detector (OTD) and Lightning Imaging System (LIS). We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated data sets and the results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 degrees.

A fast algorithm for forward-modeling of gravitational fields in spherical coordinates with 3D Gauss-Legendre quadrature

NASA Astrophysics Data System (ADS)

Zhao, G.; Liu, J.; Chen, B.; Guo, R.; Chen, L.

2017-12-01

Forward modeling of gravitational fields at large-scale requires to consider the curvature of the Earth and to evaluate the Newton's volume integral in spherical coordinates. To acquire fast and accurate gravitational effects for subsurface structures, subsurface mass distribution is usually discretized into small spherical prisms (called tesseroids). The gravity fields of tesseroids are generally calculated numerically. One of the commonly used numerical methods is the 3D Gauss-Legendre quadrature (GLQ). However, the traditional GLQ integration suffers from low computational efficiency and relatively poor accuracy when the observation surface is close to the source region. We developed a fast and high accuracy 3D GLQ integration based on the equivalence of kernel matrix, adaptive discretization and parallelization using OpenMP. The equivalence of kernel matrix strategy increases efficiency and reduces memory consumption by calculating and storing the same matrix elements in each kernel matrix just one time. In this method, the adaptive discretization strategy is used to improve the accuracy. The numerical investigations show that the executing time of the proposed method is reduced by two orders of magnitude compared with the traditional method that without these optimized strategies. High accuracy results can also be guaranteed no matter how close the computation points to the source region. In addition, the algorithm dramatically reduces the memory requirement by N times compared with the traditional method, where N is the number of discretization of the source region in the longitudinal direction. It makes the large-scale gravity forward modeling and inversion with a fine discretization possible.

A path planning method for robot end effector motion using the curvature theory of the ruled surfaces

NASA Astrophysics Data System (ADS)

Güler, Fatma; Kasap, Emin

Using the curvature theory for the ruled surfaces a technique for robot trajectory planning is presented. This technique ensures the calculation of robot’s next path. The positional variation of the Tool Center Point (TCP), linear velocity, angular velocity are required in the work area of the robot. In some circumstances, it may not be physically achievable and a re-computation of the robot trajectory might be necessary. This technique is suitable for re-computation of the robot trajectory. We obtain different robot trajectories which change depending on the darboux angle function and define trajectory ruled surface family with a common trajectory curve with the rotation trihedron. Also, the motion of robot end effector is illustrated with examples.

Prediction of Protein-Protein Interaction Sites by Random Forest Algorithm with mRMR and IFS

PubMed Central

Li, Bi-Qing; Feng, Kai-Yan; Chen, Lei; Huang, Tao; Cai, Yu-Dong

2012-01-01

Prediction of protein-protein interaction (PPI) sites is one of the most challenging problems in computational biology. Although great progress has been made by employing various machine learning approaches with numerous characteristic features, the problem is still far from being solved. In this study, we developed a novel predictor based on Random Forest (RF) algorithm with the Minimum Redundancy Maximal Relevance (mRMR) method followed by incremental feature selection (IFS). We incorporated features of physicochemical/biochemical properties, sequence conservation, residual disorder, secondary structure and solvent accessibility. We also included five 3D structural features to predict protein-protein interaction sites and achieved an overall accuracy of 0.672997 and MCC of 0.347977. Feature analysis showed that 3D structural features such as Depth Index (DPX) and surface curvature (SC) contributed most to the prediction of protein-protein interaction sites. It was also shown via site-specific feature analysis that the features of individual residues from PPI sites contribute most to the determination of protein-protein interaction sites. It is anticipated that our prediction method will become a useful tool for identifying PPI sites, and that the feature analysis described in this paper will provide useful insights into the mechanisms of interaction. PMID:22937126

Highly accurate fast lung CT registration

NASA Astrophysics Data System (ADS)

Rühaak, Jan; Heldmann, Stefan; Kipshagen, Till; Fischer, Bernd

2013-03-01

Lung registration in thoracic CT scans has received much attention in the medical imaging community. Possible applications range from follow-up analysis, motion correction for radiation therapy, monitoring of air flow and pulmonary function to lung elasticity analysis. In a clinical environment, runtime is always a critical issue, ruling out quite a few excellent registration approaches. In this paper, a highly efficient variational lung registration method based on minimizing the normalized gradient fields distance measure with curvature regularization is presented. The method ensures diffeomorphic deformations by an additional volume regularization. Supplemental user knowledge, like a segmentation of the lungs, may be incorporated as well. The accuracy of our method was evaluated on 40 test cases from clinical routine. In the EMPIRE10 lung registration challenge, our scheme ranks third, with respect to various validation criteria, out of 28 algorithms with an average landmark distance of 0.72 mm. The average runtime is about 1:50 min on a standard PC, making it by far the fastest approach of the top-ranking algorithms. Additionally, the ten publicly available DIR-Lab inhale-exhale scan pairs were registered to subvoxel accuracy at computation times of only 20 seconds. Our method thus combines very attractive runtimes with state-of-the-art accuracy in a unique way.

A complete system for 3D reconstruction of roots for phenotypic analysis.

PubMed

Kumar, Pankaj; Cai, Jinhai; Miklavcic, Stanley J

2015-01-01

Here we present a complete system for 3D reconstruction of roots grown in a transparent gel medium or washed and suspended in water. The system is capable of being fully automated as it is self calibrating. The system starts with detection of root tips in root images from an image sequence generated by a turntable motion. Root tips are detected using the statistics of Zernike moments on image patches centred on high curvature points on root boundary and Bayes classification rule. The detected root tips are tracked in the image sequence using a multi-target tracking algorithm. Conics are fitted to the root tip trajectories using a novel ellipse fitting algorithm which weighs the data points by its eccentricity. The conics projected from the circular trajectory have a complex conjugate intersection which are image of the circular points. Circular points constraint the image of the absolute conics which are directly related to the internal parameters of the camera. The pose of the camera is computed from the image of the rotation axis and the horizon. The silhouettes of the roots and camera parameters are used to reconstruction the 3D voxel model of the roots. We show the results of real 3D reconstruction of roots which are detailed and realistic for phenotypic analysis.

Computer-based video digitizer analysis of surface extension in maize roots: kinetics of growth rate changes during gravitropism

NASA Technical Reports Server (NTRS)

Ishikawa, H.; Hasenstein, K. H.; Evans, M. L.

1991-01-01

We used a video digitizer system to measure surface extension and curvature in gravistimulated primary roots of maize (Zea mays L.). Downward curvature began about 25 +/- 7 min after gravistimulation and resulted from a combination of enhanced growth along the upper surface and reduced growth along the lower surface relative to growth in vertically oriented controls. The roots curved at a rate of 1.4 +/- 0.5 degrees min-1 but the pattern of curvature varied somewhat. In about 35% of the samples the roots curved steadily downward and the rate of curvature slowed as the root neared 90 degrees. A final angle of about 90 degrees was reached 110 +/- 35 min after the start of gravistimulation. In about 65% of the samples there was a period of backward curvature (partial reversal of curvature) during the response. In some cases (about 15% of those showing a period of reverse bending) this period of backward curvature occurred before the root reached 90 degrees. Following transient backward curvature, downward curvature resumed and the root approached a final angle of about 90 degrees. In about 65% of the roots showing a period of reverse curvature, the roots curved steadily past the vertical, reaching maximum curvature about 205 +/- 65 min after gravistimulation. The direction of curvature then reversed back toward the vertical. After one or two oscillations about the vertical the roots obtained a vertical orientation and the distribution of growth within the root tip became the same as that prior to gravistimulation. The period of transient backward curvature coincided with and was evidently caused by enhancement of growth along the concave and inhibition of growth along the convex side of the curve, a pattern opposite to that prevailing in the earlier stages of downward curvature. There were periods during the gravitropic response when the normally unimodal growth-rate distribution within the elongation zone became bimodal with two peaks of rapid elongation separated by a region of reduced elongation rate. This occurred at different times on the convex and concave sides of the graviresponding root. During the period of steady downward curvature the elongation zone along the convex side extended farther toward the tip than in the vertical control. During the period of reduced rate of curvature, the zone of elongation extended farther toward the tip along the concave side of the root. The data show that the gravitropic response pattern varies with time and involves changes in localized elongation rates as well as changes in the length and position of the elongation zone. Models of root gravitropic curvature based on simple unimodal inhibition of growth along the lower side cannot account for these complex growth patterns.

Time and Temperature Stability of Silver-Coated Ceramics for Hydrogen Maser Resonant Cavities

DTIC Science & Technology

1988-12-01

observations. EXPERIMENTAL TECHNIQUE Samples of Cervit C-101 (Owens-Illinois Corp.), Zerodur (Schott Glass Corp.) and ULE (Corning Glass Works) were...created using a He-Ne laser interferometerl41. The fringe patterns were photographed, manually digitized, and analyzed by a computer that fits a series...Material ES l~ (101°~/m2) Zerodur 9.1 0.24 Cervit C101 9.2 ULE 6.8 RESULTS SAMPLE CURVATURE Fig. 1 shows the curvature, as expressed by the

Preheating and entropy perturbations in axion monodromy inflation

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

McDonough, Evan; Moghaddam, Hossein Bazrafshan; Brandenberger, Robert H.

2016-05-04

We study the preheating of gauge fields in a simple axion monodromy model and compute the induced entropy perturbations and their effect on the curvature fluctuations. We find that the correction to the spectrum of curvature perturbations has a blue spectrum with index n{sub s}=5/2. Hence, these induced modes are harmless for the observed structure of the universe. Since the spectrum is blue, there is the danger of overproduction of primordial black holes. However, we show that the observational constraints are easily satisfied.

Slope and curvature of the hadronic vacuum polarization at vanishing virtuality from lattice QCD

NASA Astrophysics Data System (ADS)

Borsanyi, Sz.; Fodor, Z.; Kawanai, T.; Krieg, S.; Lellouch, L.; Malak, R.; Miura, K.; Szabo, K. K.; Torrero, C.; Toth, B. C.

2017-10-01

We compute the slope and curvature, at vanishing four-momentum transfer squared, of the leading order hadronic vacuum polarization function, using lattice quantum chromodynamics. Calculations are performed with 2 +1 +1 flavors of staggered fermions directly at the physical values of the quark masses and in volumes of linear extent larger than 6 fm. The continuum limit is carried out using six different lattice spacings. All connected and disconnected contributions are calculated, up to and including those of the charm.

3D landmarking in multiexpression face analysis: a preliminary study on eyebrows and mouth.

PubMed

Vezzetti, Enrico; Marcolin, Federica

2014-08-01

The application of three-dimensional (3D) facial analysis and landmarking algorithms in the field of maxillofacial surgery and other medical applications, such as diagnosis of diseases by facial anomalies and dysmorphism, has gained a lot of attention. In a previous work, we used a geometric approach to automatically extract some 3D facial key points, called landmarks, working in the differential geometry domain, through the coefficients of fundamental forms, principal curvatures, mean and Gaussian curvatures, derivatives, shape and curvedness indexes, and tangent map. In this article we describe the extension of our previous landmarking algorithm, which is now able to extract eyebrows and mouth landmarks using both old and new meshes. The algorithm has been tested on our face database and on the public Bosphorus 3D database. We chose to work on the mouth and eyebrows as a separate study because of the role that these parts play in facial expressions. In fact, since the mouth is the part of the face that moves the most and affects mainly facial expressions, extracting mouth landmarks from various facial poses means that the newly developed algorithm is pose-independent. This journal requires that authors assign a level of evidence to each submission to which Evidence-Based Medicine rankings are applicable. This excludes Review Articles, Book Reviews, and manuscripts that concern Basic Science, Animal Studies, Cadaver Studies, and Experimental Studies. For a full description of these Evidence-Based Medicine ratings, please refer to the Table of Contents or the online Instructions to Authors http://www.springer.com/00266 .

A multiscale curvature algorithm for classifying discrete return LiDAR in forested environments

Treesearch

Jeffrey S. Evans; Andrew T. Hudak

2007-01-01

One prerequisite to the use of light detection and ranging (LiDAR) across disciplines is differentiating ground from nonground returns. The objective was to automatically and objectively classify points within unclassified LiDAR point clouds, with few model parameters and minimal postprocessing. Presented is an automated method for classifying LiDAR returns as ground...

Apparatus and method for laser beam diagnosis

DOEpatents

Salmon, Jr., Joseph T.

1991-01-01

An apparatus and method is disclosed for accurate, real time monitoring of the wavefront curvature of a coherent laser beam. Knowing the curvature, it can be quickly determined whether the laser beam is collimated, or focusing (converging), or de-focusing (diverging). The apparatus includes a lateral interferometer for forming an interference pattern of the laser beam to be diagnosed. The interference pattern is imaged to a spatial light modulator (SLM), whose output is a coherent laser beam having an image of the interference pattern impressed on it. The SLM output is focused to obtain the far-field diffraction pattern. A video camera, such as CCD, monitors the far-field diffraction pattern, and provides an electrical output indicative of the shape of the far-field pattern. Specifically, the far-field pattern comprises a central lobe and side lobes, whose relative positions are indicative of the radius of curvature of the beam. The video camera's electrical output may be provided to a computer which analyzes the data to determine the wavefront curvature of the laser beam.

Apparatus and method for laser beam diagnosis

DOEpatents

Salmon, J.T. Jr.

1991-08-27

An apparatus and method are disclosed for accurate, real time monitoring of the wavefront curvature of a coherent laser beam. Knowing the curvature, it can be quickly determined whether the laser beam is collimated, or focusing (converging), or de-focusing (diverging). The apparatus includes a lateral interferometer for forming an interference pattern of the laser beam to be diagnosed. The interference pattern is imaged to a spatial light modulator (SLM), whose output is a coherent laser beam having an image of the interference pattern impressed on it. The SLM output is focused to obtain the far-field diffraction pattern. A video camera, such as CCD, monitors the far-field diffraction pattern, and provides an electrical output indicative of the shape of the far-field pattern. Specifically, the far-field pattern comprises a central lobe and side lobes, whose relative positions are indicative of the radius of curvature of the beam. The video camera's electrical output may be provided to a computer which analyzes the data to determine the wavefront curvature of the laser beam. 11 figures.

Improvements to Level Set, Immersed Boundary methods for Interface Tracking

NASA Astrophysics Data System (ADS)

Vogl, Chris; Leveque, Randy

2014-11-01

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

Effect of leading-edge geometry on boundary-layer receptivity to freestream sound

NASA Technical Reports Server (NTRS)

Lin, Nay; Reed, Helen L.; Saric, W. S.

1991-01-01

The receptivity to freestream sound of the laminar boundary layer over a semi-infinite flat plate with an elliptic leading edge is simulated numerically. The incompressible flow past the flat plate is computed by solving the full Navier-Stokes equations in general curvilinear coordinates. A finite-difference method which is second-order accurate in space and time is used. Spatial and temporal developments of the Tollmien-Schlichting wave in the boundary layer, due to small-amplitude time-harmonic oscillations of the freestream velocity that closely simulate a sound wave travelling parallel to the plate, are observed. The effect of leading-edge curvature is studied by varying the aspect ratio of the ellipse. The boundary layer over the flat plate with a sharper leading edge is found to be less receptive. The relative contribution of the discontinuity in curvature at the ellipse-flat-plate juncture to receptivity is investigated by smoothing the juncture with a polynomial. Continuous curvature leads to less receptivity. A new geometry of the leading edge, a modified super ellipse, which provides continuous curvature at the juncture with the flat plate, is used to study the effect of continuous curvature and inherent pressure gradient on receptivity.

Higgs Inflation in f(Φ, r) Theory

NASA Astrophysics Data System (ADS)

Chakravarty, Girish Kumar; Mohanty, Subhendra; Singh, Naveen K.

2014-02-01

We generalize the scalar-curvature coupling model ξΦ2R of Higgs inflation to ξΦaRb to study inflation. We compute the amplitude and spectral index of curvature perturbations generated during inflation and fix the parameters of the model by comparing these with the Planck + WP data. We find that if the scalar self-coupling λ is in the range 10-5-0.1, parameter a in the range 2.3-3.6 and b in the range 0.77-0.22 at the Planck scale, one can have a viable inflation model even for ξ ≃ 1. The tensor to scalar ratio r in this model is small and our model with scalar-curvature couplings is not ruled out by observational limits on r unlike the pure (λ )/(4) Φ 4 theory. By requiring the curvature coupling parameter to be of order unity, we have evaded the problem of unitarity violation in scalar-graviton scatterings which plague the ξΦ2R Higgs inflation models. We conclude that the Higgs field may still be a good candidate for being the inflaton in the early universe if one considers higher-dimensional curvature coupling.

Strength determination of brittle materials as curved monolithic structures.

PubMed

Hooi, P; Addison, O; Fleming, G J P

2014-04-01

The dental literature is replete with "crunch the crown" monotonic load-to-failure studies of all-ceramic materials despite fracture behavior being dominated by the indenter contact surface. Load-to-failure data provide no information on stress patterns, and comparisons among studies are impossible owing to variable testing protocols. We investigated the influence of nonplanar geometries on the maximum principal stress of curved discs tested in biaxial flexure in the absence of analytical solutions. Radii of curvature analogous to elements of complex dental geometries and a finite element analysis method were integrated with experimental testing as a surrogate solution to calculate the maximum principal stress at failure. We employed soda-lime glass discs, a planar control (group P, n = 20), with curvature applied to the remaining discs by slump forming to different radii of curvature (30, 20, 15, and 10 mm; groups R30-R10). The mean deflection (group P) and radii of curvature obtained on slumping (groups R30-R10) were determined by profilometry before and after annealing and surface treatment protocols. Finite element analysis used the biaxial flexure load-to-failure data to determine the maximum principal stress at failure. Mean maximum principal stresses and load to failure were analyzed with one-way analyses of variance and post hoc Tukey tests (α = 0.05). The measured radii of curvature differed significantly among groups, and the radii of curvature were not influenced by annealing. Significant increases in the mean load to failure were observed as the radius of curvature was reduced. The maximum principal stress did not demonstrate sensitivity to radius of curvature. The findings highlight the sensitivity of failure load to specimen shape. The data also support the synergistic use of bespoke computational analysis with conventional mechanical testing and highlight a solution to complications with complex specimen geometries.

On the Shape of the Common Carotid Artery, with Implications for Blood Velocity Profiles

PubMed Central

Manbachi, Amir; Hoi, Yiemeng; Wasserman, Bruce A.; Lakatta, Edward G.; Steinman, David A

2012-01-01

Clinical and engineering studies typically assume that the common carotid artery (CCA) is straight enough to assume fully developed flow, yet recent studies have demonstrated the presence of skewed velocity profiles. Towards elucidating the influence of mild vascular curvatures on blood flow patterns and atherosclerosis, the present study aimed to characterize the three-dimensional shape of the human CCA. The left and right carotid arteries of 28 participants (62±13 years) in the VALIDATE (Vascular Aging – The Link that Bridges Age to Atherosclerosis) study were digitally segmented from 3D contrast-enhanced magnetic resonance angiograms, from the aortic arch to the carotid bifurcation. Each CCA was divided into nominal cervical and thoracic segments, for which curvatures were estimated by least squares fitting of the respective centerlines to planar arcs. The cervical CCA had mean radius of curvature of 127 mm, corresponding to a mean lumen:curvature radius ratio of 1:50. The thoracic CCA was significantly more curved at 1:16, with the plane of curvature tilted by a mean angle of 25 degrees and rotated close to 90 degrees with respect to that of the cervical CCA. The left CCA was significantly longer and slightly more curved than the right CCA, and there was a weak but significant increase in CCA curvature with age. Computational fluid dynamic (CFD) simulations carried out for idealized CCA geometries derived from these and other measured geometric parameters demonstrated that mild cervical curvature is sufficient to prevent flow from fully developing, independent of the degree of thoracic curvature. These findings reinforce the idea that fully-developed flow may be the exception rather than the rule for the CCA, and perhaps other nominally long and straight vessels. PMID:22031538

Lost in Virtual Reality: Pathfinding Algorithms Detect Rock Fractures and Contacts in Point Clouds

NASA Astrophysics Data System (ADS)

Thiele, S.; Grose, L.; Micklethwaite, S.

2016-12-01

UAV-based photogrammetric and LiDAR techniques provide high resolution 3D point clouds and ortho-rectified photomontages that can capture surface geology in outstanding detail over wide areas. Automated and semi-automated methods are vital to extract full value from these data in practical time periods, though the nuances of geological structures and materials (natural variability in colour and geometry, soft and hard linkage, shadows and multiscale properties) make this a challenging task. We present a novel method for computer assisted trace detection in dense point clouds, using a lowest cost path solver to "follow" fracture traces and lithological contacts between user defined end points. This is achieved by defining a local neighbourhood network where each point in the cloud is linked to its neighbours, and then using a least-cost path algorithm to search this network and estimate the trace of the fracture or contact. A variety of different algorithms can then be applied to calculate the best fit plane, produce a fracture network, or map properties such as roughness, curvature and fracture intensity. Our prototype of this method (Fig. 1) suggests the technique is feasible and remarkably good at following traces under non-optimal conditions such as variable-shadow, partial occlusion and complex fracturing. Furthermore, if a fracture is initially mapped incorrectly, the user can easily provide further guidance by defining intermediate waypoints. Future development will include optimization of the algorithm to perform well on large point clouds and modifications that permit the detection of features such as step-overs. We also plan on implementing this approach in an interactive graphical user environment.

Thermodynamic free energy methods to investigate shape transitions in bilayer membranes.

PubMed

Ramakrishnan, N; Tourdot, Richard W; Radhakrishnan, Ravi

2016-06-01

The conformational free energy landscape of a system is a fundamental thermodynamic quantity of importance particularly in the study of soft matter and biological systems, in which the entropic contributions play a dominant role. While computational methods to delineate the free energy landscape are routinely used to analyze the relative stability of conformational states, to determine phase boundaries, and to compute ligand-receptor binding energies its use in problems involving the cell membrane is limited. Here, we present an overview of four different free energy methods to study morphological transitions in bilayer membranes, induced either by the action of curvature remodeling proteins or due to the application of external forces. Using a triangulated surface as a model for the cell membrane and using the framework of dynamical triangulation Monte Carlo, we have focused on the methods of Widom insertion, thermodynamic integration, Bennett acceptance scheme, and umbrella sampling and weighted histogram analysis. We have demonstrated how these methods can be employed in a variety of problems involving the cell membrane. Specifically, we have shown that the chemical potential, computed using Widom insertion, and the relative free energies, computed using thermodynamic integration and Bennett acceptance method, are excellent measures to study the transition from curvature sensing to curvature inducing behavior of membrane associated proteins. The umbrella sampling and WHAM analysis has been used to study the thermodynamics of tether formation in cell membranes and the quantitative predictions of the computational model are in excellent agreement with experimental measurements. Furthermore, we also present a method based on WHAM and thermodynamic integration to handle problems related to end-point-catastrophe that are common in most free energy methods.

Distinguishing between evidence and its explanations in the steering of atomic clocks

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

Myers, John M., E-mail: myers@seas.harvard.edu; Hadi Madjid, F., E-mail: gmadjid@aol.com

2014-11-15

Quantum theory reflects within itself a separation of evidence from explanations. This separation leads to a known proof that: (1) no wave function can be determined uniquely by evidence, and (2) any chosen wave function requires a guess reaching beyond logic to things unforeseeable. Chosen wave functions are encoded into computer-mediated feedback essential to atomic clocks, including clocks that step computers through their phases of computation and clocks in space vehicles that supply evidence of signal propagation explained by hypotheses of spacetimes with metric tensor fields. The propagation of logical symbols from one computer to another requires a shared rhythm—likemore » a bucket brigade. Here we show how hypothesized metric tensors, dependent on guesswork, take part in the logical synchronization by which clocks are steered in rate and position toward aiming points that satisfy phase constraints, thereby linking the physics of signal propagation with the sharing of logical symbols among computers. Recognizing the dependence of the phasing of symbol arrivals on guesses about signal propagation transports logical synchronization from the engineering of digital communications to a discipline essential to physics. Within this discipline we begin to explore questions invisible under any concept of time that fails to acknowledge unforeseeable events. In particular, variation of spacetime curvature is shown to limit the bit rate of logical communication. - Highlights: • Atomic clocks are steered in frequency toward an aiming point. • The aiming point depends on a chosen wave function. • No evidence alone can determine the wave function. • The unknowability of the wave function has implications for spacetime curvature. • Variability in spacetime curvature limits the bit rate of communications.« less

Behavior of Tip-Steerable Needles in ex vivo and in vivo Tissue

PubMed Central

Majewicz, Ann; Marra, Steven P.; van Vledder, Mark G.; Lin, MingDe; Choti, Michael A.; Song, Danny Y.; Okamura, Allison M.

2012-01-01

Robotic needle steering is a promising technique to improve the effectiveness of needle-based clinical procedures, such as biopsies and ablation, by computer-controlled, curved insertions of needles within solid organs. In this paper, we explore the capabilities, challenges, and clinical relevance of asymmetric-tip needle steering though experiments in ex vivo and in vivo tissue. We evaluate the repeatability of needle insertion in inhomogeneous biological tissue and compare ex vivo and in vivo needle curvature and insertion forces. Steerable needles curved more in kidney than in liver and prostate, likely due to differences in tissue properties. Pre-bent needles produced higher insertion forces in liver and more curvature in vivo than ex vivo. When compared to straight stainless steel needles, steerable needles did not cause a measurable increase in tissue damage and did not exert more force during insertion. The minimum radius of curvature achieved by pre-bent needles was 5.23 cm in ex vivo tissue, and 10.4 cm in in vivo tissue. The curvatures achieved by bevel tip needles were negligible for in vivo tissue. The minimum radius of curvature for bevel tip needles in ex vivo tissue was 16.4 cm; however, about half of the bevel tip needles had negligible curvatures. We also demonstrate a potential clinical application of needle steering by targeting and ablating overlapping regions of cadaveric canine liver. PMID:22711767

Influence of implant rod curvature on sagittal correction of scoliosis deformity.

PubMed

Salmingo, Remel Alingalan; Tadano, Shigeru; Abe, Yuichiro; Ito, Manabu

2014-08-01

Deformation of in vivo-implanted rods could alter the scoliosis sagittal correction. To our knowledge, no previous authors have investigated the influence of implanted-rod deformation on the sagittal deformity correction during scoliosis surgery. To analyze the changes of the implant rod's angle of curvature during surgery and establish its influence on sagittal correction of scoliosis deformity. A retrospective analysis of the preoperative and postoperative implant rod geometry and angle of curvature was conducted. Twenty adolescent idiopathic scoliosis patients underwent surgery. Average age at the time of operation was 14 years. The preoperative and postoperative implant rod angle of curvature expressed in degrees was obtained for each patient. Two implant rods were attached to the concave and convex side of the spinal deformity. The preoperative implant rod geometry was measured before surgical implantation. The postoperative implant rod geometry after surgery was measured by computed tomography. The implant rod angle of curvature at the sagittal plane was obtained from the implant rod geometry. The angle of curvature between the implant rod extreme ends was measured before implantation and after surgery. The sagittal curvature between the corresponding spinal levels of healthy adolescents obtained by previous studies was compared with the implant rod angle of curvature to evaluate the sagittal curve correction. The difference between the postoperative implant rod angle of curvature and normal spine sagittal curvature of the corresponding instrumented level was used to evaluate over or under correction of the sagittal deformity. The implant rods at the concave side of deformity of all patients were significantly deformed after surgery. The average degree of rod deformation Δθ at the concave and convex sides was 15.8° and 1.6°, respectively. The average preoperative and postoperative implant rod angle of curvature at the concave side was 33.6° and 17.8°, respectively. The average preoperative and postoperative implant rod angle of curvature at the convex side was 25.5° and 23.9°, respectively. A significant relationship was found between the degree of rod deformation and preoperative implant rod angle of curvature (r=0.60, p<.005). The implant rods at the convex side of all patients did not have significant deformation. The results indicate that the postoperative sagittal outcome could be predicted from the initial rod shape. Changes in implant rod angle of curvature may lead to over- or undercorrection of the sagittal curve. Rod deformation at the concave side suggests that corrective forces acting on that side are greater than the convex side. Copyright © 2014 Elsevier Inc. All rights reserved.

PANTHER. Trajectory Analysis

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

Rintoul, Mark Daniel; Wilson, Andrew T.; Valicka, Christopher G.

We want to organize a body of trajectories in order to identify, search for, classify and predict behavior among objects such as aircraft and ships. Existing compari- son functions such as the Fr'echet distance are computationally expensive and yield counterintuitive results in some cases. We propose an approach using feature vectors whose components represent succinctly the salient information in trajectories. These features incorporate basic information such as total distance traveled and distance be- tween start/stop points as well as geometric features related to the properties of the convex hull, trajectory curvature and general distance geometry. Additionally, these features can generallymore » be mapped easily to behaviors of interest to humans that are searching large databases. Most of these geometric features are invariant under rigid transformation. We demonstrate the use of different subsets of these features to iden- tify trajectories similar to an exemplar, cluster a database of several hundred thousand trajectories, predict destination and apply unsupervised machine learning algorithms.« less

A terracing operator for physical property mapping with potential field data

USGS Publications Warehouse

Cordell, L.; McCafferty, A.E.

1989-01-01

The terracing operator works iteratively on gravity or magnetic data, using the sense of the measured field's local curvature, to produce a field comprised of uniform domains separated by abrupt domain boundaries. The result is crudely proportional to a physical-property function defined in one (profile case) or two (map case) horizontal dimensions. This result can be extended to a physical-property model if its behavior in the third (vertical) dimension is defined, either arbitrarily or on the basis of the local geologic situation. The terracing algorithm is computationally fast and appropriate to use with very large digital data sets. The terracing operator was applied separately to aeromagnetic and gravity data from a 136km x 123km area in eastern Kansas. Results provide a reasonable good physical representation of both the gravity and the aeromagnetic data. Superposition of the results from the two data sets shows many areas of agreement that can be referenced to geologic features within the buried Precambrian crystalline basement. -from Authors

Quantitative phase-field lattice-Boltzmann study of lamellar eutectic growth under natural convection

NASA Astrophysics Data System (ADS)

Zhang, A.; Guo, Z.; Xiong, S.-M.

2018-05-01

The influence of natural convection on lamellar eutectic growth was determined by a comprehensive phase-field lattice-Boltzmann study for Al-Cu and CB r4-C2C l6 eutectic alloys. The mass differences resulting from concentration differences led to the fluid flow and a robust parallel and adaptive mesh refinement algorithm was employed to improve the computational efficiency. By means of carefully designed "numerical experiments", the eutectic growth under natural convection was explored and a simple analytical model was proposed to predict the adjustment of the lamellar spacing. Furthermore, by alternating the solute expansion coefficient, initial lamellar spacing, and undercooling, the microstructure evolution was presented and compared with the classical eutectic growth theory. Results showed that both interfacial solute distribution and average curvature were affected by the natural convection, the effect of which could be further quantified by adding a constant into the growth rule proposed by Jackson and Hunt [Jackson and Hunt, Trans. Metall. Soc. AIME 236, 1129 (1966)].

Virtual suturing simulation based on commodity physics engine for medical learning.

PubMed

Choi, Kup-Sze; Chan, Sze-Ho; Pang, Wai-Man

2012-06-01

Development of virtual-reality medical applications is usually a complicated and labour intensive task. This paper explores the feasibility of using commodity physics engine to develop a suturing simulator prototype for manual skills training in the fields of nursing and medicine, so as to enjoy the benefits of rapid development and hardware-accelerated computation. In the prototype, spring-connected boxes of finite dimension are used to simulate soft tissues, whereas needle and thread are modelled with chained segments. Spherical joints are used to simulate suture's flexibility and to facilitate thread cutting. An algorithm is developed to simulate needle insertion and thread advancement through the tissue. Two-handed manipulations and force feedback are enabled with two haptic devices. Experiments on the closure of a wound show that the prototype is able to simulate suturing procedures at interactive rates. The simulator is also used to study a curvature-adaptive suture modelling technique. Issues and limitations of the proposed approach and future development are discussed.

A new gravitational N-body simulation algorithm for investigation of cosmological chaotic advection

NASA Astrophysics Data System (ADS)

Stalder, Diego H.; Rosa, Reinaldo R.; da Silva Junior, José R.; Clua, Esteban; Ruiz, Renata S. R.; Velho, Haroldo F. Campos; Ramos, Fernando M.; Araújo, Amarísio Da S.; Conrado, Vitor G.

2012-10-01

Recently alternative approaches in cosmology seeks to explain the nature of dark matter as a direct result of the non-linear spacetime curvature due to different types of deformation potentials. In this context, a key test for this hypothesis is to examine the effects of deformation on the evolution of large scales structures. An important requirement for the fine analysis of this pure gravitational signature (without dark matter elements) is to characterize the position of a galaxy during its trajectory to the gravitational collapse of super clusters at low redshifts. In this context, each element in an gravitational N-body simulation behaves as a tracer of collapse governed by the process known as chaotic advection (or lagrangian turbulence). In order to develop a detailed study of this new approach we develop the COsmic LAgrangian TUrbulence Simulator (COLATUS) to perform gravitational N-body simulations based on Compute Unified Device Architecture (CUDA) for graphics processing units (GPUs). In this paper we report the first robust results obtained from COLATUS.

Evaluation and mitigation of potential errors in radiochromic film dosimetry due to film curvature at scanning.

PubMed

Palmer, Antony L; Bradley, David A; Nisbet, Andrew

2015-03-08

This work considers a previously overlooked uncertainty present in film dosimetry which results from moderate curvature of films during the scanning process. Small film samples are particularly susceptible to film curling which may be undetected or deemed insignificant. In this study, we consider test cases with controlled induced curvature of film and with film raised horizontally above the scanner plate. We also evaluate the difference in scans of a film irradiated with a typical brachytherapy dose distribution with the film naturally curved and with the film held flat on the scanner. Typical naturally occurring curvature of film at scanning, giving rise to a maximum height 1 to 2 mm above the scan plane, may introduce dose errors of 1% to 4%, and considerably reduce gamma evaluation passing rates when comparing film-measured doses with treatment planning system-calculated dose distributions, a common application of film dosimetry in radiotherapy. The use of a triple-channel dosimetry algorithm appeared to mitigate the error due to film curvature compared to conventional single-channel film dosimetry. The change in pixel value and calibrated reported dose with film curling or height above the scanner plate may be due to variations in illumination characteristics, optical disturbances, or a Callier-type effect. There is a clear requirement for physically flat films at scanning to avoid the introduction of a substantial error source in film dosimetry. Particularly for small film samples, a compression glass plate above the film is recommended to ensure flat-film scanning. This effect has been overlooked to date in the literature.

Multi-scale curvature for automated identification of glaciated mountain landscapes

NASA Astrophysics Data System (ADS)

Prasicek, Günther; Otto, Jan-Christoph; Montgomery, David; Schrott, Lothar

2014-05-01

Automated morphometric interpretation of digital terrain data based on impartial rule sets holds substantial promise for large dataset processing and objective landscape classification. However, the geomorphological realm presents tremendous complexity in the translation of qualitative descriptions into geomorphometric semantics. Here, the simple, conventional distinction of V-shaped fluvial and U-shaped glacial valleys is analyzed quantitatively using the relation of multi-scale curvature and drainage area. Glacial and fluvial erosion shapes mountain landscapes in a long-recognized and characteristic way. Valleys incised by fluvial processes typically have V-shaped cross-sections with uniform and moderately steep slopes, whereas glacial valleys tend to have U-shaped profiles and topographic gradients steepening with distance from valley floor. On a DEM, thalweg cells are determined by a drainage area cutoff and multiple moving window sizes are used to derive per-cell curvature over a variety of scales ranging from the vicinity of the flow path at the valley bottom to catchment sections fully including valley sides. The relation of the curvatures calculated for the user-defined minimum scale and the automatically detected maximum scale is presented as a novel morphometric variable termed Difference of Minimum Curvature (DMC). DMC thresholds determined from typical glacial and fluvial sample catchments are employed to identify quadrats of glaciated and non-glaciated mountain landscapes and the distinctions are validated by field-based geological and geomorphological maps. A first test of the novel algorithm at three study sites in the western United States and a subsequent application to Europe and western Asia demonstrate the transferability of the approach.

Effect of crack curvature on stress intensity factors for ASTM standard compact tension specimens

NASA Technical Reports Server (NTRS)

Alam, J.; Mendelson, A.

1983-01-01

The stress intensity factors (SIF) are calculated using the method of lines for the compact tension specimen in tensile and shear loading for curved crack fronts. For the purely elastic case, it was found that as the crack front curvature increases, the SIF value at the center of the specimen decreases while increasing at the surface. For the higher values of crack front curvatures, the maximum value of the SIF occurs at an interior point located adjacent to the surface. A thickness average SIF was computed for parabolically applied shear loading. These results were used to assess the requirements of ASTM standards E399-71 and E399-81 on the shape of crack fronts. The SIF is assumed to reflect the average stress environment near the crack edge.

A Varifold Approach to Surface Approximation

NASA Astrophysics Data System (ADS)

Buet, Blanche; Leonardi, Gian Paolo; Masnou, Simon

2017-11-01

We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we introduce the notion of approximate mean curvature and show various convergence results that hold, in particular, for sequences of discrete varifolds associated with point clouds or pixel/voxel-type discretizations of d-surfaces in the Euclidean n-space, without restrictions on dimension and codimension. The variational nature of the approach also allows us to consider surfaces with singularities, and in that case the approximate mean curvature is consistent with the generalized mean curvature of the limit surface. A series of numerical tests are provided in order to illustrate the effectiveness and generality of the method.

Wavefront sensor-driven variable-geometry pupil for ground-based aperture synthesis imaging

NASA Astrophysics Data System (ADS)

Tyler, David W.

2000-07-01

I describe a variable-geometry pupil (VGP) to increase image resolution for ground-based near-IR and optical imaging. In this scheme, a curvature-type wavefront sensor provides an estimate of the wavefront curvature to the controller of a high-resolution spatial light modulator (SLM) or micro- electromechanical (MEM) mirror, positioned at an image of the telescope pupil. This optical element, the VGP, passes or reflects the incident beam only where the wavefront phase is sufficiently smooth, viz., where the curvature is sufficiently low. Using a computer simulation, I show the VGP can sharpen and smooth the long-exposure PSF and increase the OTF SNR for tilt-only and low-order AO systems, allowing higher resolution and more stable deconvolution with dimmer AO guidestars.

Thermal effects and sudden decay approximation in the curvaton scenario

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

Kitajima, Naoya; Takesako, Tomohiro; Yokoyama, Shuichiro

2014-10-01

We study the impact of a temperature-dependent curvaton decay rate on the primordial curvature perturbation generated in the curvaton scenario. Using the familiar sudden decay approximation, we obtain an analytical expression for the curvature perturbation after the decay of the curvaton. We then investigate numerically the evolution of the background and of the perturbations during the decay. We first show that the instantaneous transfer coefficient, related to the curvaton energy fraction at the decay, can be extended into a more general parameter, which depends on the net transfer of the curvaton energy into radiation energy or, equivalently, on the totalmore » entropy ratio after the complete curvaton decay. We then compute the curvature perturbation and compare this result with the sudden decay approximation prediction.« less

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

NASA Technical Reports Server (NTRS)

Barth, Timothy J.; Sethian, James A.

2006-01-01

Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.

Aortic Curvature Is a Predictor of Late Type Ia Endoleak and Migration After Endovascular Aneurysm Repair.

PubMed

Schuurmann, Richte C L; van Noort, Kim; Overeem, Simon P; Ouriel, Kenneth; Jordan, William D; Muhs, Bart E; 't Mannetje, Yannick; Reijnen, Michel; Fioole, Bram; Ünlü, Çağdaş; Brummel, Peter; de Vries, Jean-Paul P M

2017-06-01

To evaluate the association between aortic curvature and other preoperative anatomical characteristics and late (>1 year) type Ia endoleak and endograft migration in endovascular aneurysm repair (EVAR) patients. Eight high-volume EVAR centers contributed 116 EVAR patients (mean age 81±7 years; 103 men) to the study: 36 patients (mean age 82±7 years; 31 men) with endograft migration and/or type Ia endoleak diagnosed >1 year after the initial EVAR and 80 controls without early or late complications. Aortic curvature was calculated from the preoperative computed tomography scan as the maximum and average curvature over 5 predefined aortic segments: the entire infrarenal aortic neck, aneurysm sac, and the suprarenal, juxtarenal, and infrarenal aorta. Other morphological characteristics included neck length, neck diameter, mural neck calcification and thrombus, suprarenal and infrarenal angulation, and largest aneurysm sac diameter. Independent risk factors were identified using backward stepwise logistic regression. Relevant cutoff values for each of the variables in the final regression model were determined with the receiver operator characteristic curve. Logistic regression identified maximum curvature over the length of the aneurysm sac (>47 m -1 ; p=0.023), largest aneurysm sac diameter (>56 mm; p=0.028), and mural neck thrombus (>11° circumference; p<0.001) as independent predictors of late migration and type Ia endoleak. Aortic curvature is a predictor for late type Ia endoleak and endograft migration after EVAR. These findings suggest that aortic curvature is a better parameter than angulation to predict post-EVAR failure and should be included as a hostile neck parameter.

Impact of alterations in target vessel curvature on branch durability after endovascular repair of thoracoabdominal aortic aneurysms.

PubMed

Sylvan, Joshua; Brier, Corey; Wolski, Katherine; Yanof, Jeffrey; Goel, Vikash; Kuramochi, Yuki; Eagleton, Matthew J

2016-03-01

The aim of this study was to evaluate curvature and its effect on the durability of visceral and renal branches in patients undergoing endovascular repair of thoracoabdominal aortic aneurysms (TAAAs) with fenestrated/branched endovascular aneurysm repair (F/B-EVAR). Quantitative branch vessel curvature assessment on branches arising from reinforced fenestrations was performed for 168 patients undergoing F/B-EVAR for type II and type III TAAAs. Preoperative and postoperative centerline coordinates were obtained using iNtuition (TeraRecon, Foster City, Calif) and exported into MATLAB (The MathWorks, Inc, Natick, Mass) based on thin-slice computed tomography imaging. Spline interpolation was applied to the centerline coordinates and resampled at 100 equally spaced points, and curvature calculations (κ, mm(-1)) were applied. Global and maximal curvatures for each of the target vessels were measured and categorized by severity. Categories for curvature were 0 to 0.05 mm(-1) (low), 0.05 to 0.1 mm(-1) (medium), 0.1 to 0.15 mm(-1) (high), and >0.15 mm(-1) (extreme) for global curvature and 0 to 0.2 mm(-1), 0.2 to 0.4 mm(-1), 0.4 to 0.6 mm(-1), and >0.6 mm(-1), respectively, for maximum curvature. Curvature variances were assessed for an association with vessel patency and need for reintervention. There were 558 vessels that underwent analysis based on repairs involving 650 vessels, whereby 92 vessels were excluded as they were treated with an external helical branch (58 celiac arteries and 34 superior mesenteric arteries). There was a significant difference found before and after F/B-EVAR for the global celiac artery curvature (median difference, -0.01; P < .001), global left renal artery curvature (median, -0.01; P = .014), maximum left renal artery curvature (median, 0.05; P < .001), and maximum right renal artery curvature (median, 0.03; P = .009). Maximum artery curvature was found to have shifted distally in all vessels postoperatively; 37 adverse events (AEs) were observed in 30 patients (6 branched occlusions and 31 reinterventions [24 type III endoleaks, 5 vessel stenoses, and 2 vessel occlusions]). The majority of AEs (>70%) occurred within the range of low to medium curvature. Univariate analysis found gender to be a dependent variable associated with high (maximum) preoperative curvature (odds ratio, 0.395; P = .02). The use of self-expanding stents (vs balloon-expandable stents alone) in vessels with high preoperative curvature (>0.6 mm(-1)) was significant in the right renal artery (P = .044). This study did not show a significant relationship between the severity of artery curvature or changes in curvature and AEs found for visceral or renal branches after F/B-EVAR for extensive TAAA. Surprisingly, the majority of AEs occurred in low- and medium-curved vessels. This study is limited in that it does not take into account other factors that may affect AEs, like motion, which would be valuable in future studies. Copyright © 2016 Society for Vascular Surgery. Published by Elsevier Inc. All rights reserved.

SU-E-T-219: Comprehensive Validation of the Electron Monte Carlo Dose Calculation Algorithm in RayStation Treatment Planning System for An Elekta Linear Accelerator with AgilityTM Treatment Head

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

Wang, Yi; Park, Yang-Kyun; Doppke, Karen P.

2015-06-15

Purpose: This study evaluated the performance of the electron Monte Carlo dose calculation algorithm in RayStation v4.0 for an Elekta machine with Agility™ treatment head. Methods: The machine has five electron energies (6–8 MeV) and five applicators (6×6 to 25×25 cm {sup 2}). The dose (cGy/MU at d{sub max}), depth dose and profiles were measured in water using an electron diode at 100 cm SSD for nine square fields ≥2×2 cm{sup 2} and four complex fields at normal incidence, and a 14×14 cm{sup 2} field at 15° and 30° incidence. The dose was also measured for three square fields ≥4×4more » cm{sup 2} at 98, 105 and 110 cm SSD. Using selected energies, the EBT3 radiochromic film was used for dose measurements in slab-shaped inhomogeneous phantoms and a breast phantom with surface curvature. The measured and calculated doses were analyzed using a gamma criterion of 3%/3 mm. Results: The calculated and measured doses varied by <3% for 116 of the 120 points, and <5% for the 4×4 cm{sup 2} field at 110 cm SSD at 9–18 MeV. The gamma analysis comparing the 105 pairs of in-water isodoses passed by >98.1%. The planar doses measured from films placed at 0.5 cm below a lung/tissue layer (12 MeV) and 1.0 cm below a bone/air layer (15 MeV) showed excellent agreement with calculations, with gamma passing by 99.9% and 98.5%, respectively. At the breast-tissue interface, the gamma passing rate is >98.8% at 12–18 MeV. The film results directly validated the accuracy of MU calculation and spatial dose distribution in presence of tissue inhomogeneity and surface curvature - situations challenging for simpler pencil-beam algorithms. Conclusion: The electron Monte Carlo algorithm in RayStation v4.0 is fully validated for clinical use for the Elekta Agility™ machine. The comprehensive validation included small fields, complex fields, oblique beams, extended distance, tissue inhomogeneity and surface curvature.« less

Inverse design of an isotropic suspended Kirchhoff rod: theoretical and numerical results on the uniqueness of the natural shape.

PubMed

Bertails-Descoubes, Florence; Derouet-Jourdan, Alexandre; Romero, Victor; Lazarus, Arnaud

2018-04-01

Solving the equations for Kirchhoff elastic rods has been widely explored for decades in mathematics, physics and computer science, with significant applications in the modelling of thin flexible structures such as DNA, hair or climbing plants. As demonstrated in previous experimental and theoretical studies, the natural curvature plays an important role in the equilibrium shape of a Kirchhoff rod, even in the simple case where the rod is isotropic and suspended under gravity. In this paper, we investigate the reverse problem: can we characterize the natural curvature of a suspended isotropic rod, given an equilibrium curve? We prove that although there exists an infinite number of natural curvatures that are compatible with the prescribed equilibrium, they are all equivalent in the sense that they correspond to a unique natural shape for the rod. This natural shape can be computed efficiently by solving in sequence three linear initial value problems, starting from any framing of the input curve. We provide several numerical experiments to illustrate this uniqueness result, and finally discuss its potential impact on non-invasive parameter estimation and inverse design of thin elastic rods.

An improved method for estimating capillary pressure from 3D microtomography images and its application to the study of disconnected nonwetting phase

NASA Astrophysics Data System (ADS)

Li, Tianyi; Schlüter, Steffen; Dragila, Maria Ines; Wildenschild, Dorthe

2018-04-01

We present an improved method for estimating interfacial curvatures from x-ray computed microtomography (CMT) data that significantly advances the potential for this tool to unravel the mechanisms and phenomena associated with multi-phase fluid motion in porous media. CMT data, used to analyze the spatial distribution and capillary pressure-saturation (Pc-S) relationships of liquid phases, requires accurate estimates of interfacial curvature. Our improved method for curvature estimation combines selective interface modification and distance weighting approaches. It was verified against synthetic (analytical computer-generated) and real image data sets, demonstrating a vast improvement over previous methods. Using this new tool on a previously published data set (multiphase flow) yielded important new insights regarding the pressure state of the disconnected nonwetting phase during drainage and imbibition. The trapped and disconnected non-wetting phase delimits its own hysteretic Pc-S curve that inhabits the space within the main hysteretic Pc-S loop of the connected wetting phase. Data suggests that the pressure of the disconnected, non-wetting phase is strongly modified by the pore geometry rather than solely by the bulk liquid phase that surrounds it.

Inverse design of an isotropic suspended Kirchhoff rod: theoretical and numerical results on the uniqueness of the natural shape

NASA Astrophysics Data System (ADS)

Bertails-Descoubes, Florence; Derouet-Jourdan, Alexandre; Romero, Victor; Lazarus, Arnaud

2018-04-01

Solving the equations for Kirchhoff elastic rods has been widely explored for decades in mathematics, physics and computer science, with significant applications in the modelling of thin flexible structures such as DNA, hair or climbing plants. As demonstrated in previous experimental and theoretical studies, the natural curvature plays an important role in the equilibrium shape of a Kirchhoff rod, even in the simple case where the rod is isotropic and suspended under gravity. In this paper, we investigate the reverse problem: can we characterize the natural curvature of a suspended isotropic rod, given an equilibrium curve? We prove that although there exists an infinite number of natural curvatures that are compatible with the prescribed equilibrium, they are all equivalent in the sense that they correspond to a unique natural shape for the rod. This natural shape can be computed efficiently by solving in sequence three linear initial value problems, starting from any framing of the input curve. We provide several numerical experiments to illustrate this uniqueness result, and finally discuss its potential impact on non-invasive parameter estimation and inverse design of thin elastic rods.

Assessment of quantitative cortical biomarkers in the developing brain of preterm infants

NASA Astrophysics Data System (ADS)

Moeskops, Pim; Benders, Manon J. N. L.; Pearlman, Paul C.; Kersbergen, Karina J.; Leemans, Alexander; Viergever, Max A.; Išgum, Ivana

2013-02-01

The cerebral cortex rapidly develops its folding during the second and third trimester of pregnancy. In preterm birth, this growth might be disrupted and influence neurodevelopment. The aim of this work is to extract quantitative biomarkers describing the cortex and evaluate them on a set of preterm infants without brain pathology. For this study, a set of 19 preterm - but otherwise healthy - infants scanned coronally with 3T MRI at the postmenstrual age of 30 weeks were selected. In ten patients (test set), the gray and white matter were manually annotated by an expert on the T2-weighted scans. Manual segmentations were used to extract cortical volume, surface area, thickness, and curvature using voxel-based methods. To compute these biomarkers per region in every patient, a template brain image has been generated by iterative registration and averaging of the scans of the remaining nine patients. This template has been manually divided in eight regions, and is transformed to every test image using elastic registration. In the results, gray and white matter volumes and cortical surface area appear symmetric between hemispheres, but small regional differences are visible. Cortical thickness seems slightly higher in the right parietal lobe than in other regions. The parietal lobes exhibit a higher global curvature, indicating more complex folding compared to other regions. The proposed approach can potentially - together with an automatic segmentation algorithm - be applied as a tool to assist in early diagnosis of abnormalities and prediction of the development of the cognitive abilities of these children.

SUN: A fully automated interferometric test bench aimed at measuring photolithographic grade lenses with a sub nanometer accuracy

NASA Astrophysics Data System (ADS)

Bourgois, R.; Hamy, A. L.; Pourcelot, P.

2017-10-01

SUN is a test bench developed by Safran Reosc to measure spherical or aspherical surface errors of litho-grade lenses with sub-nanometer accuracy. SUN provides full aperture high resolution interferometric measurements. Measurements are performed at the center of curvature using high precision transmission sphere (TS), and Computer Generated Holograms (CGH) for aspheres, in order to light the surface at normal incidence. SUN can measure lenses with diameter up to 350mm and a radius of curvature varying from 60 to 3000 mm.

Large-deflection-theory Analysis of the Effect of Web Initial Curvature on the Ultimate Strength of Steel Plate Girder

NASA Astrophysics Data System (ADS)

Kala, Jiří; Kala, Zdeněk

2011-09-01

The objective of the paper is to analyze the influence of initial imperfections on the behaviour of thin-walled girders welded of slender plate elements. In parallel with experiments, one of the ultimate load tests was computer modelled. In so doing, the girder was modelled, using the geometrically and materially non-linear variant of the shell finite element method, by the ANSYS program. The shape changing during loading process is often accompanying with sudden "snap-through" i. e. rapid curvature change.

Computational Analysis of the G-III Laminar Flow Glove

NASA Technical Reports Server (NTRS)

Malik, Mujeeb R.; Liao, Wei; Lee-Rausch, Elizabeth M.; Li, Fei; Choudhari, Meelan M.; Chang, Chau-Lyan

2011-01-01

Under NASA's Environmentally Responsible Aviation Project, flight experiments are planned with the primary objective of demonstrating the Discrete Roughness Elements (DRE) technology for passive laminar flow control at chord Reynolds numbers relevant to transport aircraft. In this paper, we present a preliminary computational assessment of the Gulfstream-III (G-III) aircraft wing-glove designed to attain natural laminar flow for the leading-edge sweep angle of 34.6deg. Analysis for a flight Mach number of 0.75 shows that it should be possible to achieve natural laminar flow for twice the transition Reynolds number ever achieved at this sweep angle. However, the wing-glove needs to be redesigned to effectively demonstrate passive laminar flow control using DREs. As a by-product of the computational assessment, effect of surface curvature on stationary crossflow disturbances is found to be strongly stabilizing for the current design, and it is suggested that convex surface curvature could be used as a control parameter for natural laminar flow design, provided transition occurs via stationary crossflow disturbances.

Groundwater potential mapping using C5.0, random forest, and multivariate adaptive regression spline models in GIS.

PubMed

Golkarian, Ali; Naghibi, Seyed Amir; Kalantar, Bahareh; Pradhan, Biswajeet

2018-02-17

Ever increasing demand for water resources for different purposes makes it essential to have better understanding and knowledge about water resources. As known, groundwater resources are one of the main water resources especially in countries with arid climatic condition. Thus, this study seeks to provide groundwater potential maps (GPMs) employing new algorithms. Accordingly, this study aims to validate the performance of C5.0, random forest (RF), and multivariate adaptive regression splines (MARS) algorithms for generating GPMs in the eastern part of Mashhad Plain, Iran. For this purpose, a dataset was produced consisting of spring locations as indicator and groundwater-conditioning factors (GCFs) as input. In this research, 13 GCFs were selected including altitude, slope aspect, slope angle, plan curvature, profile curvature, topographic wetness index (TWI), slope length, distance from rivers and faults, rivers and faults density, land use, and lithology. The mentioned dataset was divided into two classes of training and validation with 70 and 30% of the springs, respectively. Then, C5.0, RF, and MARS algorithms were employed using R statistical software, and the final values were transformed into GPMs. Finally, two evaluation criteria including Kappa and area under receiver operating characteristics curve (AUC-ROC) were calculated. According to the findings of this research, MARS had the best performance with AUC-ROC of 84.2%, followed by RF and C5.0 algorithms with AUC-ROC values of 79.7 and 77.3%, respectively. The results indicated that AUC-ROC values for the employed models are more than 70% which shows their acceptable performance. As a conclusion, the produced methodology could be used in other geographical areas. GPMs could be used by water resource managers and related organizations to accelerate and facilitate water resource exploitation.

Pentacam Scheimpflug quantitative imaging of the crystalline lens and intraocular lens.

PubMed

Rosales, Patricia; Marcos, Susana

2009-05-01

To implement geometrical and optical distortion correction methods for anterior segment Scheimpflug images obtained with a commercially available system (Pentacam, Oculus Optikgeräte GmbH). Ray tracing algorithms were implemented to obtain corrected ocular surface geometry from the original images captured by the Pentacam's CCD camera. As details of the optical layout were not fully provided by the manufacturer, an iterative procedure (based on imaging of calibrated spheres) was developed to estimate the camera lens specifications. The correction procedure was tested on Scheimpflug images of a physical water cell model eye (with polymethylmethacrylate cornea and a commercial IOL of known dimensions) and of a normal human eye previously measured with a corrected optical and geometrical distortion Scheimpflug camera (Topcon SL-45 [Topcon Medical Systems Inc] from the Vrije University, Amsterdam, Holland). Uncorrected Scheimpflug images show flatter surfaces and thinner lenses than in reality. The application of geometrical and optical distortion correction algorithms improves the accuracy of the estimated anterior lens radii of curvature by 30% to 40% and of the estimated posterior lens by 50% to 100%. The average error in the retrieved radii was 0.37 and 0.46 mm for the anterior and posterior lens radii of curvature, respectively, and 0.048 mm for lens thickness. The Pentacam Scheimpflug system can be used to obtain quantitative information on the geometry of the crystalline lens, provided that geometrical and optical distortion correction algorithms are applied, within the accuracy of state-of-the art phakometry and biometry. The techniques could improve with exact knowledge of the technical specifications of the instrument, improved edge detection algorithms, consideration of aspheric and non-rotationally symmetrical surfaces, and introduction of a crystalline gradient index.

Fourier analysis algorithm for the posterior corneal keratometric data: clinical usefulness in keratoconus.

PubMed

Sideroudi, Haris; Labiris, Georgios; Georgantzoglou, Kimon; Ntonti, Panagiota; Siganos, Charalambos; Kozobolis, Vassilios

2017-07-01

To develop an algorithm for the Fourier analysis of posterior corneal videokeratographic data and to evaluate the derived parameters in the diagnosis of Subclinical Keratoconus (SKC) and Keratoconus (KC). This was a cross-sectional, observational study that took place in the Eye Institute of Thrace, Democritus University, Greece. Eighty eyes formed the KC group, 55 eyes formed the SKC group while 50 normal eyes populated the control group. A self-developed algorithm in visual basic for Microsoft Excel performed a Fourier series harmonic analysis for the posterior corneal sagittal curvature data. The algorithm decomposed the obtained curvatures into a spherical component, regular astigmatism, asymmetry and higher order irregularities for averaged central 4 mm and for each individual ring separately (1, 2, 3 and 4 mm). The obtained values were evaluated for their diagnostic capacity using receiver operating curves (ROC). Logistic regression was attempted for the identification of a combined diagnostic model. Significant differences were detected in regular astigmatism, asymmetry and higher order irregularities among groups. For the SKC group, the parameters with high diagnostic ability (AUC > 90%) were the higher order irregularities, the asymmetry and the regular astigmatism, mainly in the corneal periphery. Higher predictive accuracy was identified using diagnostic models that combined the asymmetry, regular astigmatism and higher order irregularities in averaged 3and 4 mm area (AUC: 98.4%, Sensitivity: 91.7% and Specificity:100%). Fourier decomposition of posterior Keratometric data provides parameters with high accuracy in differentiating SKC from normal corneas and should be included in the prompt diagnosis of KC. © 2017 The Authors Ophthalmic & Physiological Optics © 2017 The College of Optometrists.

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

Garcia de Andrade, L. C.

Vishik's anti-dynamo theorem is applied to a nonstretched twisted magnetic flux tube in Riemannian space. Marginal or slow dynamos along curved (folded), torsioned (twisted), and nonstretching flux tubes plasma flows are obtained. Riemannian curvature of the twisted magnetic flux tube is computed in terms of the Frenet curvature in the thin tube limit. It is shown that, for nonstretched filaments, fast dynamo action in the diffusive case cannot be obtained, in agreement with Vishik's argument that fast dynamos cannot be obtained in nonstretched flows. Instead of a fast dynamo, a nonuniform stretching slow dynamo is obtained. An example is given,more » which generalizes plasma dynamo laminar flows, recently presented by Wang et al. [Phys Plasmas 9, 1491 (2002)], in the case of low magnetic Reynolds number Re{sub m}{>=}210. Curved and twisting Riemannian heliotrons, where nondynamo modes are found even when stretching is present, shows that the simple presence of stretching is not enough for the existence of dynamo action. In this paper, folding plays the role of Riemannian curvature and can be used to cancel magnetic fields, not enhancing the dynamo action. Nondynamo modes are found for certain values of torsion, or Frenet curvature (folding) in the spirit of the anti-dynamo theorem. It is also shown that curvature and stretching are fundamental for the existence of fast dynamos in plasmas.« less

Computation and modeling of aero-thermal fields in turbine cascades and strongly curved ducts

NASA Technical Reports Server (NTRS)

Luo, J.; Lakshminarayana, B.

1994-01-01

Advanced turbulence models are crucial for accurate prediction of rocket engine flows, due to existence of very large extra strain rates, such as strong streamline curvature. Numerical simulation of the turbulent flow in a strongly curved turn-around duct (TAD) has been carried out with a Reynolds stress model (RSM), an algebraic Reynolds stress model (ARSM) and a kappa-epsilon model. the RSM model and the ARSM model are found to capture the turbulence damping due to the convex curvature, but underpredict the turbulence enhancement caused by the concave curvature. To capture the concave curvature effects, it is necessary to modify the epsilon-equation. The modification of episilon-equation suggested by Launder, et.al, provides the correct trend, but over-corrects the curvature effects. A comparative study of two modes of transition in gas turbine, the by-pass transition and the separation-induced transition, has been carried out with several low-Reynolds-number (LRN) kappa-epsilon models. Effects of blade surface pressure gradient, freestream turbulence and Reynolds number on the blade boundary layer development, and particularly the inception of transition are examined in detail. The present study indicates that the turbine blade transition, in the presence of high freestream turbulence, is predicted well with LRN kappa-epsilon models employed.

Principles for designing proteins with cavities formed by curved β sheets

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

Marcos, Enrique; Basanta, Benjamin; Chidyausiku, Tamuka M.

Active sites and ligand-binding cavities in native proteins are often formed by curved β sheets, and the ability to control β-sheet curvature would allow design of binding proteins with cavities customized to specific ligands. Toward this end, we investigated the mechanisms controlling β-sheet curvature by studying the geometry of β sheets in naturally occurring protein structures and folding simulations. The principles emerging from this analysis were used to design, de novo, a series of proteins with curved β sheets topped with α helices. Nuclear magnetic resonance and crystal structures of the designs closely match the computational models, showing that β-sheetmore » curvature can be controlled with atomic-level accuracy. Our approach enables the design of proteins with cavities and provides a route to custom design ligand-binding and catalytic sites.« less

Dark Energy from Discrete Spacetime

PubMed Central

Trout, Aaron D.

2013-01-01

Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT) model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies. PMID:24312502

A kinematically driven anisotropic viscoelastic constitutive model applied to tires

NASA Technical Reports Server (NTRS)

Johnson, Arthur R.; Tanner, John A.; Mason, Angela J.

1995-01-01

Aircraft tires are composite structures manufactured with viscoelastic materials such as carbon black filled rubber and nylon cords. When loaded they experience large deflections and moderately large strains. Detailed structural models of tires require the use of either nonlinear shell or nonlinear three dimensional solid finite elements. Computational predictions of the dynamic response of tires must consider the composite viscoelastic material behavior in a realistic fashion. We describe a modification to a nonlinear anisotropic shell finite element so it can be used to model viscoelastic stresses during general deformations. The model is developed by introducing internal variables of the type used to model elastic strain energy. The internal variables are strains, curvatures, and transverse shear angles which are in a one-to-one correspondence with the generalized coordinates used to model the elastic strain energy for nonlinear response. A difference-relaxation equation is used to relate changes in the observable strain field to changes in the internal strain field. The internal stress state is introduced into the equilibrium equations by converting it to nodal loads associated with the element's displacement degrees of freedom. In this form the tangent matrix in the Newton-Raphson solution algorithm is not modified from its form for the nonlinear statics problem. Only the gradient vector is modified and the modification is not computationally costly. The existing finite element model for the Space Shuttle nose gear tire is used to provide examples of the algorithm. In the first example, the tire's rim is displaced at a constant rate up to a fixed value. In the second example, the tire's rim is enforced to follow a saw tooth load and unload curve to generate hysteresis loops.

A kinematically driven anisotropic viscoelastic constitutive model applied to tires

NASA Astrophysics Data System (ADS)

Johnson, Arthur R.; Tanner, John A.; Mason, Angela J.

1995-08-01

Aircraft tires are composite structures manufactured with viscoelastic materials such as carbon black filled rubber and nylon cords. When loaded they experience large deflections and moderately large strains. Detailed structural models of tires require the use of either nonlinear shell or nonlinear three dimensional solid finite elements. Computational predictions of the dynamic response of tires must consider the composite viscoelastic material behavior in a realistic fashion. We describe a modification to a nonlinear anisotropic shell finite element so it can be used to model viscoelastic stresses during general deformations. The model is developed by introducing internal variables of the type used to model elastic strain energy. The internal variables are strains, curvatures, and transverse shear angles which are in a one-to-one correspondence with the generalized coordinates used to model the elastic strain energy for nonlinear response. A difference-relaxation equation is used to relate changes in the observable strain field to changes in the internal strain field. The internal stress state is introduced into the equilibrium equations by converting it to nodal loads associated with the element's displacement degrees of freedom. In this form the tangent matrix in the Newton-Raphson solution algorithm is not modified from its form for the nonlinear statics problem. Only the gradient vector is modified and the modification is not computationally costly. The existing finite element model for the Space Shuttle nose gear tire is used to provide examples of the algorithm. In the first example, the tire's rim is displaced at a constant rate up to a fixed value. In the second example, the tire's rim is enforced to follow a saw tooth load and unload curve to generate hysteresis loops.

Computer simulation of flagellar movement. VI. Simple curvature-controlled models are incompletely specified.

PubMed

Brokaw, C J

1985-10-01

Computer simulation is used to examine a simple flagellar model that will initiate and propagate bending waves in the absence of viscous resistances. The model contains only an elastic bending resistance and an active sliding mechanism that generates reduced active shear moment with increasing sliding velocity. Oscillation results from a distributed control mechanism that reverses the direction of operation of the active sliding mechanism when the curvature reaches critical magnitudes in either direction. Bend propagation by curvature-controlled flagellar models therefore does not require interaction with the viscous resistance of an external fluid. An analytical examination of moment balance during bend propagation by this model yields a solution curve giving values of frequency and wavelength that satisfy the moment balance equation and give uniform bend propagation, suggesting that the model is underdetermined. At 0 viscosity, the boundary condition of 0 shear rate at the basal end of the flagellum during the development of new bends selects the particular solution that is obtained by computer simulations. Therefore, the details of the pattern of bend initiation at the basal end of a flagellum can be of major significance in determining the properties of propagated bending waves in the distal portion of a flagellum. At high values of external viscosity, the model oscillates at frequencies and wavelengths that give approximately integral numbers of waves on the flagellum. These operating points are selected because they facilitate the balance of bending moments at the ends of the model, where the external viscous moment approaches 0. These mode preferences can be overridden by forcing the model to operate at a predetermined frequency. The strong mode preferences shown by curvature-controlled flagellar models, in contrast to the weak or absent mode preferences shown by real flagella, therefore do not demonstrate the inapplicability of the moment-balance approach to real flagella. Instead, they indicate a need to specify additional properties of real flagella that are responsible for selecting particular operating points.

Mining Input Data for Multivariate Probabilistic Modeling of Rainfall-Induced Landslide Hazard in the Lake ATITLÁN Watershed in Guatemala

NASA Astrophysics Data System (ADS)

Cobin, P. F.; Oommen, T.; Gierke, J. S.

2013-12-01

The Lake Atitlán watershed is home to approximately 200,000 people and is located in the western highlands of Guatemala. Steep slopes, highly susceptible to landslides during the rainy season, characterize the region. Typically these landslides occur during high-intensity precipitation events. Hurricane Stan hit Guatemala in October 2005; the resulting flooding and landslides devastated the region. Locations of landslide and non-landslide points were obtained from field observations and orthophotos taken following Hurricane Stan. Different datasets of landslide and non-landslide points across the watershed were used to compare model success at a small scale and regional scale. This study used data from multiple attributes: geology, geomorphology, distance to faults and streams, land use, slope, aspect, curvature, plan curvature, profile curvature and topographic wetness index. The open source software Weka was used for the data mining. Several attribute selection methods were applied to the data to predetermine the potential landslide causative influence. Different multivariate algorithms were then evaluated for their ability to predict landslide occurrence. The following statistical parameters were used to evaluate model accuracy: precision, recall, F measure and area under the receiver operating characteristic (ROC) curve. The attribute combinations of the most successful models were compared to the attribute evaluator results. The algorithm BayesNet yielded the most accurate model and was used to build a probability map of landslide initiation points for the regions selected in the watershed. The ultimate aim of this study is to share the methodology and results with municipal contacts from the author's time as a U.S. Peace Corps volunteer, to facilitate more effective future landslide hazard planning and mitigation.

The inviscid axisymmetric stability of the supersonic flow along a circular cylinder

NASA Technical Reports Server (NTRS)

Duck, Peter W.

1990-01-01

The supersonic flow past a thin straight circular cylinder is investigated. The associated boundary-layer flow (i.e. the velocity and temperature field) is computed; the asymptotic, far downstream solution is obtained, and compared with the full numerical results. The inviscid, linear, axisymmetric (temporal) stability of this boundary layer is also studied. A so-called 'doubly generalized' inflexion condition is derived, which is a condition for the existence of so-called 'subsonic' neutral modes. The eigenvalue problem (for the complex wavespeed) is computed for two free-stream Mach numbers (2.8 and 3.8), and this reveals that curvature has a profound effect on the stability of the flow. The first unstable inviscid mode is seen to disappear rapidly as curvature is introduced, while the second (and generally the most important) mode suffers a substantially reduced amplification rate.

The inviscid axisymmetric stability of the supersonic flow along a circular cylinder

NASA Technical Reports Server (NTRS)

Duck, Peter W.

1989-01-01

The supersonic flow past a thin straight circular cylinder is investigated. The associated boundary layer flow (i.e., the velocity and temperature field) is computed; the asymptotic, far downstream solution is obtained, and compared with the full numerical results. The inviscid, linear, axisymmetric (temporal) stability of this boundary layer is also studied. A so called doubly generalized inflexion condition is derived, which is a condition for the existence of so called subsonic neutral modes. The eigenvalue problem (for the complex wavespeed) is computed for two freestream Mach numbers (2.8 and 3.8), and this reveals that curvature has a profound effect on the stability of the flow. The first unstable inviscid mode is seen to rapidly disappear as curvature is introduced, while the second (and generally the most important) mode suffers a substantially reduced amplification rate.

Computer Detection of Low Contrast Targets.

DTIC Science & Technology

1982-06-18

computed from the Hessian and the gradient and is given by the formula W) = - U Hf( IVf (M), Vf()) IVfj 3 Because of the amount of noise present in these...IT (nz + 1 + Zn cost ) 1/2 and this integral is a maximum for n=1 and decreases as n increases, exactly what a good measure of curvature should do

Holographic corrections to the Veneziano amplitude

NASA Astrophysics Data System (ADS)

Armoni, Adi; Ireson, Edwin

2017-08-01

We propose a holographic computation of the 2 → 2 meson scattering in a curved string background, dual to a QCD-like theory. We recover the Veneziano amplitude and compute a perturbative correction due to the background curvature. The result implies a small deviation from a linear trajectory, which is a requirement of the UV regime of QCD.

Evaluation and mitigation of potential errors in radiochromic film dosimetry due to film curvature at scanning

PubMed Central

Bradley, David A.; Nisbet, Andrew

2015-01-01

This work considers a previously overlooked uncertainty present in film dosimetry which results from moderate curvature of films during the scanning process. Small film samples are particularly susceptible to film curling which may be undetected or deemed insignificant. In this study, we consider test cases with controlled induced curvature of film and with film raised horizontally above the scanner plate. We also evaluate the difference in scans of a film irradiated with a typical brachytherapy dose distribution with the film naturally curved and with the film held flat on the scanner. Typical naturally occurring curvature of film at scanning, giving rise to a maximum height 1 to 2 mm above the scan plane, may introduce dose errors of 1% to 4%, and considerably reduce gamma evaluation passing rates when comparing film‐measured doses with treatment planning system‐calculated dose distributions, a common application of film dosimetry in radiotherapy. The use of a triple‐channel dosimetry algorithm appeared to mitigate the error due to film curvature compared to conventional single‐channel film dosimetry. The change in pixel value and calibrated reported dose with film curling or height above the scanner plate may be due to variations in illumination characteristics, optical disturbances, or a Callier‐type effect. There is a clear requirement for physically flat films at scanning to avoid the introduction of a substantial error source in film dosimetry. Particularly for small film samples, a compression glass plate above the film is recommended to ensure flat‐film scanning. This effect has been overlooked to date in the literature. PACS numbers: 87.55.Qr, 87.56.bg, 87.55.km PMID:26103181

Mechanism of Membrane Curvature Sensing by Amphipathic Helix Containing Proteins

PubMed Central

Cui, Haosheng; Lyman, Edward; Voth, Gregory A.

2011-01-01

There are several examples of membrane-associated protein domains that target curved membranes. This behavior is believed to have functional significance in a number of essential pathways, such as clathrin-mediated endocytosis, which involve dramatic membrane remodeling and require the recruitment of various cofactors at different stages of the process. This work is motivated in part by recent experiments that demonstrated that the amphipathic N-terminal helix of endophilin (H0) targets curved membranes by binding to hydrophobic lipid bilayer packing defects which increase in number with increasing membrane curvature. Here we use state-of-the-art atomistic simulation to explore the packing defect structure of curved membranes, and the effect of this structure on the folding of H0. We find that not only are packing defects increased in number with increasing membrane curvature, but also that their size distribution depends nontrivially on the curvature, falling off exponentially with a decay constant that depends on the curvature, and crucially that even on highly curved membranes defects large enough to accommodate the hydrophobic face of H0 are never observed. We furthermore find that a percolation model for the defects explains the defect size distribution, which implies that larger defects are formed by coalescence of noninteracting smaller defects. We also use the recently developed metadynamics algorithm to study in detail the effect of such defects on H0 folding. It is found that the comparatively larger defects found on a convex membrane promote H0 folding by several kcal/mol, while the smaller defects found on flat and concave membrane surfaces inhibit folding by kinetically trapping the peptide. Together, these observations suggest H0 folding is a cooperative process in which the folding peptide changes the defect structure relative to an unperturbed membrane. PMID:21354400

Computed micro-tomographic evaluation of glide path with nickel-titanium rotary PathFile in maxillary first molars curved canals.

PubMed

Pasqualini, Damiano; Bianchi, Caterina Chiara; Paolino, Davide Salvatore; Mancini, Lucia; Cemenasco, Andrea; Cantatore, Giuseppe; Castellucci, Arnaldo; Berutti, Elio

2012-03-01

X-ray computed micro-tomography scanning allows high-resolution 3-dimensional imaging of small objects. In this study, micro-CT scanning was used to compare the ability of manual and mechanical glide path to maintain the original root canal anatomy. Eight extracted upper first permanent molars were scanned at the TOMOLAB station at ELETTRA Synchrotron Light Laboratory in Trieste, Italy, with a microfocus cone-beam geometry system. A total of 2,400 projections on 360° have been acquired at 100 kV and 80 μA, with a focal spot size of 8 μm. Buccal root canals of each specimen (n = 16) were randomly assigned to PathFile (P) or stainless-steel K-file (K) to perform glide path at the full working length. Specimens were then microscanned at the apical level (A) and at the point of the maximum curvature level (C) for post-treatment analyses. Curvatures of root canals were classified as moderate (≤35°) or severe (≥40°). The ratio of diameter ratios (RDRs) and the ratio of cross-sectional areas (RAs) were assessed. For each level of analysis (A and C), 2 balanced 2-way factorial analyses of variance (P < .05) were performed to evaluate the significance of the instrument factor and of canal curvature factor as well as the interactions of the factors both with RDRs and RAs. Specimens in the K group had a mean curvature of 35.4° ± 11.5°; those in the P group had a curvature of 38° ± 9.9°. The instrument factor (P and K) was extremely significant (P < .001) for both the RDR and RA parameters, regardless of the point of analysis. Micro-CT scanning confirmed that NiTi rotary PathFile instruments preserve the original canal anatomy and cause less canal aberrations. Copyright © 2012 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

Efficient 3D geometric and Zernike moments computation from unstructured surface meshes.

PubMed

Pozo, José María; Villa-Uriol, Maria-Cruz; Frangi, Alejandro F

2011-03-01

This paper introduces and evaluates a fast exact algorithm and a series of faster approximate algorithms for the computation of 3D geometric moments from an unstructured surface mesh of triangles. Being based on the object surface reduces the computational complexity of these algorithms with respect to volumetric grid-based algorithms. In contrast, it can only be applied for the computation of geometric moments of homogeneous objects. This advantage and restriction is shared with other proposed algorithms based on the object boundary. The proposed exact algorithm reduces the computational complexity for computing geometric moments up to order N with respect to previously proposed exact algorithms, from N(9) to N(6). The approximate series algorithm appears as a power series on the rate between triangle size and object size, which can be truncated at any desired degree. The higher the number and quality of the triangles, the better the approximation. This approximate algorithm reduces the computational complexity to N(3). In addition, the paper introduces a fast algorithm for the computation of 3D Zernike moments from the computed geometric moments, with a computational complexity N(4), while the previously proposed algorithm is of order N(6). The error introduced by the proposed approximate algorithms is evaluated in different shapes and the cost-benefit ratio in terms of error, and computational time is analyzed for different moment orders.

Mechanical loading, damping, and load-driven bone formation in mouse tibiae.

PubMed

Dodge, Todd; Wanis, Mina; Ayoub, Ramez; Zhao, Liming; Watts, Nelson B; Bhattacharya, Amit; Akkus, Ozan; Robling, Alexander; Yokota, Hiroki

2012-10-01

Mechanical loads play a pivotal role in the growth and maintenance of bone and joints. Although loading can activate anabolic genes and induce bone remodeling, damping is essential for preventing traumatic bone injury and fracture. In this study we investigated the damping capacity of bone, joint tissue, muscle, and skin using a mouse hindlimb model of enhanced loading in conjunction with finite element modeling to model bone curvature. Our hypothesis was that loads were primarily absorbed by the joints and muscle tissue, but that bone also contributed to damping through its compression and natural bending. To test this hypothesis, fresh mouse distal lower limb segments were cyclically loaded in axial compression in sequential bouts, with each subsequent bout having less surrounding tissue. A finite element model was generated to model effects of bone curvature in silico. Two damping-related parameters (phase shift angle and energy loss) were determined from the output of the loading experiments. Interestingly, the experimental results revealed that the knee joint contributed to the largest portion of the damping capacity of the limb, and bone itself accounted for approximately 38% of the total phase shift angle. Computational results showed that normal bone curvature enhanced the damping capacity of the bone by approximately 40%, and the damping effect grew at an accelerated pace as curvature was increased. Although structural curvature reduces critical loads for buckling in beam theory, evolution apparently favors maintaining curvature in the tibia. Histomorphometric analysis of the tibia revealed that in response to axial loading, bone formation was significantly enhanced in the regions that were predicted to receive a curvature-induced bending moment. These results suggest that in addition to bone's compressive damping capacity, surrounding tissues, as well as naturally-occurring bone curvature, also contribute to mechanical damping, which may ultimately affect bone remodeling and bone quality. Copyright © 2012 Elsevier Inc. All rights reserved.

Hybrid geometric-random template-placement algorithm for gravitational wave searches from compact binary coalescences

NASA Astrophysics Data System (ADS)

Roy, Soumen; Sengupta, Anand S.; Thakor, Nilay

2017-05-01

Astrophysical compact binary systems consisting of neutron stars and black holes are an important class of gravitational wave (GW) sources for advanced LIGO detectors. Accurate theoretical waveform models from the inspiral, merger, and ringdown phases of such systems are used to filter detector data under the template-based matched-filtering paradigm. An efficient grid over the parameter space at a fixed minimal match has a direct impact on the overall time taken by these searches. We present a new hybrid geometric-random template placement algorithm for signals described by parameters of two masses and one spin magnitude. Such template banks could potentially be used in GW searches from binary neutron stars and neutron star-black hole systems. The template placement is robust and is able to automatically accommodate curvature and boundary effects with no fine-tuning. We also compare these banks against vanilla stochastic template banks and show that while both are equally efficient in the fitting-factor sense, the bank sizes are ˜25 % larger in the stochastic method. Further, we show that the generation of the proposed hybrid banks can be sped up by nearly an order of magnitude over the stochastic bank. Generic issues related to optimal implementation are discussed in detail. These improvements are expected to directly reduce the computational cost of gravitational wave searches.

Partial compensation interferometry measurement system for parameter errors of conicoid surface

NASA Astrophysics Data System (ADS)

Hao, Qun; Li, Tengfei; Hu, Yao; Wang, Shaopu; Ning, Yan; Chen, Zhuo

2018-06-01

Surface parameters, such as vertex radius of curvature and conic constant, are used to describe the shape of an aspheric surface. Surface parameter errors (SPEs) are deviations affecting the optical characteristics of an aspheric surface. Precise measurement of SPEs is critical in the evaluation of optical surfaces. In this paper, a partial compensation interferometry measurement system for SPE of a conicoid surface is proposed based on the theory of slope asphericity and the best compensation distance. The system is developed to measure the SPE-caused best compensation distance change and SPE-caused surface shape change and then calculate the SPEs with the iteration algorithm for accuracy improvement. Experimental results indicate that the average relative measurement accuracy of the proposed system could be better than 0.02% for the vertex radius of curvature error and 2% for the conic constant error.

Insights into the Cell Shape Dynamics of Migrating Dictyostelium discoideum

NASA Astrophysics Data System (ADS)

Driscoll, Meghan; Homan, Tess; McCann, Colin; Parent, Carole; Fourkas, John; Losert, Wolfgang

2010-03-01

Dynamic cell shape is a highly visible manifestation of the interaction between the internal biochemical state of a cell and its external environment. We analyzed the dynamic cell shape of migrating cells using the model system Dictyostelium discoideum. Applying a snake algorithm to experimental movies, we extracted cell boundaries in each frame and followed local boundary motion over long time intervals. Using a local motion measure that corresponds to protrusive/retractive activity, we found that protrusions are intermittent and zig-zag, whereas retractions are more sustained and straight. Correlations of this local motion measure reveal that protrusions appear more localized than retractions. Using a local shape measure, curvature, we also found that small peaks in boundary curvature tend to originate at the front of cells and propagate backwards. We will review the possible cytoskeletal origin of these mechanical waves.

Theory and algorithms to compute Helfrich bending forces: a review.

PubMed

Guckenberger, Achim; Gekle, Stephan

2017-05-24

Cell membranes are vital to shield a cell's interior from the environment. At the same time they determine to a large extent the cell's mechanical resistance to external forces. In recent years there has been considerable interest in the accurate computational modeling of such membranes, driven mainly by the amazing variety of shapes that red blood cells and model systems such as vesicles can assume in external flows. Given that the typical height of a membrane is only a few nanometers while the surface of the cell extends over many micrometers, physical modeling approaches mostly consider the interface as a two-dimensional elastic continuum. Here we review recent modeling efforts focusing on one of the computationally most intricate components, namely the membrane's bending resistance. We start with a short background on the most widely used bending model due to Helfrich. While the Helfrich bending energy by itself is an extremely simple model equation, the computation of the resulting forces is far from trivial. At the heart of these difficulties lies the fact that the forces involve second order derivatives of the local surface curvature which by itself is the second derivative of the membrane geometry. We systematically derive and compare the different routes to obtain bending forces from the Helfrich energy, namely the variational approach and the thin-shell theory. While both routes lead to mathematically identical expressions, so-called linear bending models are shown to reproduce only the leading order term while higher orders differ. The main part of the review contains a description of various computational strategies which we classify into three categories: the force, the strong and the weak formulation. We finally give some examples for the application of these strategies in actual simulations.

Infrared dim-small target tracking via singular value decomposition and improved Kernelized correlation filter

NASA Astrophysics Data System (ADS)

Qian, Kun; Zhou, Huixin; Rong, Shenghui; Wang, Bingjian; Cheng, Kuanhong

2017-05-01

Infrared small target tracking plays an important role in applications including military reconnaissance, early warning and terminal guidance. In this paper, an effective algorithm based on the Singular Value Decomposition (SVD) and the improved Kernelized Correlation Filter (KCF) is presented for infrared small target tracking. Firstly, the super performance of the SVD-based algorithm is that it takes advantage of the target's global information and obtains a background estimation of an infrared image. A dim target is enhanced by subtracting the corresponding estimated background with update from the original image. Secondly, the KCF algorithm is combined with Gaussian Curvature Filter (GCF) to eliminate the excursion problem. The GCF technology is adopted to preserve the edge and eliminate the noise of the base sample in the KCF algorithm, helping to calculate the classifier parameter for a small target. At last, the target position is estimated with a response map, which is obtained via the kernelized classifier. Experimental results demonstrate that the presented algorithm performs favorably in terms of efficiency and accuracy, compared with several state-of-the-art algorithms.

Application of the Lienard-Wiechert solution to a lightning return stroke model

NASA Technical Reports Server (NTRS)

Meneghini, R.

1983-01-01

The electric and magnetic fields associated with the lightning return stroke are expressed as a convolution of the current waveform shape and the fields generated by a moving charge of amplitude one (i.e., the Lienard-Wiechert solution for a unit charge). The representation can be used to compute the fields produced by a current waveform of non-uniform velocity that propagates along a filament of arbitrary, but finite, curvature. To study numerically the effects of linear charge acceleration and channel curvature two simple channel models are used: the linear and the hyperbolic.

Application of the Lienard-Wiechert solution to a lightning return stroke model

NASA Technical Reports Server (NTRS)

Meneghini, R.

1984-01-01

The electric and magnetic fields associated with the lightning return stroke are expressed as a convolution of the current waveform shape and the fields generated by a moving charge of amplitude one (i.e., the Lienard-Wiechert solution for a unit charge). The representation can be used to compute the fields produced by a current waveform of non-uniform velocity that propagates along a filament of arbitrary, but finite, curvature. To study numerically the effects of linear charge acceleration and channel curvature two simple channel models are used: the linear and the hyperbolic.

Cartan invariants and event horizon detection

NASA Astrophysics Data System (ADS)

Brooks, D.; Chavy-Waddy, P. C.; Coley, A. A.; Forget, A.; Gregoris, D.; MacCallum, M. A. H.; McNutt, D. D.

2018-04-01

We show that it is possible to locate the event horizon of a black hole (in arbitrary dimensions) by the zeros of certain Cartan invariants. This approach accounts for the recent results on the detection of stationary horizons using scalar polynomial curvature invariants, and improves upon them since the proposed method is computationally less expensive. As an application, we produce Cartan invariants that locate the event horizons for various exact four-dimensional and five-dimensional stationary, asymptotically flat (or (anti) de Sitter), black hole solutions and compare the Cartan invariants with the corresponding scalar curvature invariants that detect the event horizon.

Computation of Symmetric Discrete Cosine Transform Using Bakhvalov's Algorithm

NASA Technical Reports Server (NTRS)

Aburdene, Maurice F.; Strojny, Brian C.; Dorband, John E.

2005-01-01

A number of algorithms for recursive computation of the discrete cosine transform (DCT) have been developed recently. This paper presents a new method for computing the discrete cosine transform and its inverse using Bakhvalov's algorithm, a method developed for evaluation of a polynomial at a point. In this paper, we will focus on both the application of the algorithm to the computation of the DCT-I and its complexity. In addition, Bakhvalov s algorithm is compared with Clenshaw s algorithm for the computation of the DCT.

Central charge from adiabatic transport of cusp singularities in the quantum Hall effect

NASA Astrophysics Data System (ADS)

Can, Tankut

2017-04-01

We study quantum Hall (QH) states on a punctured Riemann sphere. We compute the Berry curvature under adiabatic motion in the moduli space in the large N limit. The Berry curvature is shown to be finite in the large N limit and controlled by the conformal dimension of the cusp singularity, a local property of the mean density. Utilizing exact sum rules obtained from a Ward identity, we show that for the Laughlin wave function, the dimension of a cusp singularity is given by the central charge, a robust geometric response coefficient in the QHE. Thus, adiabatic transport of curvature singularities can be used to determine the central charge of QH states. We also consider the effects of threaded fluxes and spin-deformed wave functions. Finally, we give a closed expression for all moments of the mean density in the integer QH state on a punctured disk.

Dark energy from discrete spacetime.

PubMed

Trout, Aaron D

2013-01-01

Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT) model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, [Formula: see text] in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies.

Geometry Dynamics of α-Helices in Different Class I Major Histocompatibility Complexes

PubMed Central

Karch, Rudolf; Schreiner, Wolfgang

2015-01-01

MHC α-helices form the antigen-binding cleft and are of particular interest for immunological reactions. To monitor these helices in molecular dynamics simulations, we applied a parsimonious fragment-fitting method to trace the axes of the α-helices. Each resulting axis was fitted by polynomials in a least-squares sense and the curvature integral was computed. To find the appropriate polynomial degree, the method was tested on two artificially modelled helices, one performing a bending movement and another a hinge movement. We found that second-order polynomials retrieve predefined parameters of helical motion with minimal relative error. From MD simulations we selected those parts of α-helices that were stable and also close to the TCR/MHC interface. We monitored the curvature integral, generated a ruled surface between the two MHC α-helices, and computed interhelical area and surface torsion, as they changed over time. We found that MHC α-helices undergo rapid but small changes in conformation. The curvature integral of helices proved to be a sensitive measure, which was closely related to changes in shape over time as confirmed by RMSD analysis. We speculate that small changes in the conformation of individual MHC α-helices are part of the intrinsic dynamics induced by engagement with the TCR. PMID:26649324

Statistical Mechanics Provides Novel Insights into Microtubule Stability and Mechanism of Shrinkage

PubMed Central

Jain, Ishutesh; Inamdar, Mandar M.; Padinhateeri, Ranjith

2015-01-01

Microtubules are nano-machines that grow and shrink stochastically, making use of the coupling between chemical kinetics and mechanics of its constituent protofilaments (PFs). We investigate the stability and shrinkage of microtubules taking into account inter-protofilament interactions and bending interactions of intrinsically curved PFs. Computing the free energy as a function of PF tip position, we show that the competition between curvature energy, inter-PF interaction energy and entropy leads to a rich landscape with a series of minima that repeat over a length-scale determined by the intrinsic curvature. Computing Langevin dynamics of the tip through the landscape and accounting for depolymerization, we calculate the average unzippering and shrinkage velocities of GDP protofilaments and compare them with the experimentally known results. Our analysis predicts that the strength of the inter-PF interaction (Ems) has to be comparable to the strength of the curvature energy (Emb) such that Ems−Emb≈1kBT, and questions the prevalent notion that unzippering results from the domination of bending energy of curved GDP PFs. Our work demonstrates how the shape of the free energy landscape is crucial in explaining the mechanism of MT shrinkage where the unzippered PFs will fluctuate in a set of partially peeled off states and subunit dissociation will reduce the length. PMID:25692909

Modelisation geometrique par NURBS pour le design aerodynamique des ailes d'avion

NASA Astrophysics Data System (ADS)

Bentamy, Anas

The constant evolution of the computer science gives rise to many research areas especially in computer aided design. This study is part, of the advancement of the numerical methods in engineering computer aided design, specifically in aerospace science. The geometric modeling based on NURBS has been applied successfully to generate a parametric wing surface for aerodynamic design while satisfying manufacturing constraints. The goal of providing a smooth geometry described with few parameters has been achieved. In that case, a wing design including ruled surfaces at the leading edge slat and at the flap, and, curved central surfaces with intrinsic geometric property coming from conic curves, necessitates 130 control points and 15 geometric design variables. The 3D character of the wing need to be analyzed by techniques of investigation of surfaces in order to judge conveniently the visual aspect and detect any sign inversion in both directions of parametrization u and nu. Color mapping of the Gaussian curvature appears to be a very effective tools in visualization. The automation of the construction has been attained using an heuristic optimization algorithm, simulated annealing. The relative high speed of convergence to the solutions confirms its practical interest in engineering problems nowadays. The robustness of the geometric model has been tested successfully with an academic inverse design problem. The results obtained allow to foresee multiple possible applications from an extension to a complete geometric description of an airplane to the interaction with others disciplines belonging to a preliminary aeronautical design process.

Using field inversion to quantify functional errors in turbulence closures

NASA Astrophysics Data System (ADS)

Singh, Anand Pratap; Duraisamy, Karthik

2016-04-01

A data-informed approach is presented with the objective of quantifying errors and uncertainties in the functional forms of turbulence closure models. The approach creates modeling information from higher-fidelity simulations and experimental data. Specifically, a Bayesian formalism is adopted to infer discrepancies in the source terms of transport equations. A key enabling idea is the transformation of the functional inversion procedure (which is inherently infinite-dimensional) into a finite-dimensional problem in which the distribution of the unknown function is estimated at discrete mesh locations in the computational domain. This allows for the use of an efficient adjoint-driven inversion procedure. The output of the inversion is a full-field of discrepancy that provides hitherto inaccessible modeling information. The utility of the approach is demonstrated by applying it to a number of problems including channel flow, shock-boundary layer interactions, and flows with curvature and separation. In all these cases, the posterior model correlates well with the data. Furthermore, it is shown that even if limited data (such as surface pressures) are used, the accuracy of the inferred solution is improved over the entire computational domain. The results suggest that, by directly addressing the connection between physical data and model discrepancies, the field inversion approach materially enhances the value of computational and experimental data for model improvement. The resulting information can be used by the modeler as a guiding tool to design more accurate model forms, or serve as input to machine learning algorithms to directly replace deficient modeling terms.

An efficient parallel termination detection algorithm

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

Baker, A. H.; Crivelli, S.; Jessup, E. R.

2004-05-27

Information local to any one processor is insufficient to monitor the overall progress of most distributed computations. Typically, a second distributed computation for detecting termination of the main computation is necessary. In order to be a useful computational tool, the termination detection routine must operate concurrently with the main computation, adding minimal overhead, and it must promptly and correctly detect termination when it occurs. In this paper, we present a new algorithm for detecting the termination of a parallel computation on distributed-memory MIMD computers that satisfies all of those criteria. A variety of termination detection algorithms have been devised. Ofmore » these, the algorithm presented by Sinha, Kale, and Ramkumar (henceforth, the SKR algorithm) is unique in its ability to adapt to the load conditions of the system on which it runs, thereby minimizing the impact of termination detection on performance. Because their algorithm also detects termination quickly, we consider it to be the most efficient practical algorithm presently available. The termination detection algorithm presented here was developed for use in the PMESC programming library for distributed-memory MIMD computers. Like the SKR algorithm, our algorithm adapts to system loads and imposes little overhead. Also like the SKR algorithm, ours is tree-based, and it does not depend on any assumptions about the physical interconnection topology of the processors or the specifics of the distributed computation. In addition, our algorithm is easier to implement and requires only half as many tree traverses as does the SKR algorithm. This paper is organized as follows. In section 2, we define our computational model. In section 3, we review the SKR algorithm. We introduce our new algorithm in section 4, and prove its correctness in section 5. We discuss its efficiency and present experimental results in section 6.« less

The transport along membrane nanotubes driven by the spontaneous curvature of membrane components.

PubMed

Kabaso, Doron; Bobrovska, Nataliya; Góźdź, Wojciech; Gongadze, Ekaterina; Kralj-Iglič, Veronika; Zorec, Robert; Iglič, Aleš

2012-10-01

Intercellular membrane nanotubes (ICNs) serve as a very specific transport system between neighboring cells. The underlying mechanisms responsible for the transport of membrane components and vesicular dilations along the ICNs are not clearly understood. The present study investigated the spatial distribution of anisotropic membrane components of tubular shapes and isotropic membrane components of spherical shapes. Experimental results revealed the preferential distribution of CTB (cholera toxin B)-GM1 complexes mainly on the spherical cell membrane, and cholesterol-sphingomyelin at the membrane leading edge and ICNs. In agreement with previous studies, we here propose that the spatial distribution of CTB-GM1 complexes and cholesterol-sphingomyelin rafts were due to their isotropic and anisotropic shapes, respectively. To elucidate the relationship between a membrane component shape and its spatial distribution, a two-component computational model was constructed. The minimization of the membrane bending (free) energy revealed the enrichment of the anisotropic component along the ICN and the isotropic component in the parent cell membrane, which was due to the curvature mismatch between the ICN curvature and the spontaneous curvature of the isotropic component. The equations of motion, derived from the differentiation of the membrane free energy, revealed a curvature-dependent flux of the isotropic component and a curvature-dependent force exerted on a vesicular dilation along the ICN. Finally, the effects of possible changes in the orientational ordering of the anisotropic component attendant to the transport of the vesicular dilation were discussed with connection to the propagation of electrical and chemical signals. Copyright © 2012 Elsevier B.V. All rights reserved.

QPSO-Based Adaptive DNA Computing Algorithm

PubMed Central

Karakose, Mehmet; Cigdem, Ugur

2013-01-01

DNA (deoxyribonucleic acid) computing that is a new computation model based on DNA molecules for information storage has been increasingly used for optimization and data analysis in recent years. However, DNA computing algorithm has some limitations in terms of convergence speed, adaptability, and effectiveness. In this paper, a new approach for improvement of DNA computing is proposed. This new approach aims to perform DNA computing algorithm with adaptive parameters towards the desired goal using quantum-behaved particle swarm optimization (QPSO). Some contributions provided by the proposed QPSO based on adaptive DNA computing algorithm are as follows: (1) parameters of population size, crossover rate, maximum number of operations, enzyme and virus mutation rate, and fitness function of DNA computing algorithm are simultaneously tuned for adaptive process, (2) adaptive algorithm is performed using QPSO algorithm for goal-driven progress, faster operation, and flexibility in data, and (3) numerical realization of DNA computing algorithm with proposed approach is implemented in system identification. Two experiments with different systems were carried out to evaluate the performance of the proposed approach with comparative results. Experimental results obtained with Matlab and FPGA demonstrate ability to provide effective optimization, considerable convergence speed, and high accuracy according to DNA computing algorithm. PMID:23935409

Quantitative evaluation for small surface damage based on iterative difference and triangulation of 3D point cloud

NASA Astrophysics Data System (ADS)

Zhang, Yuyan; Guo, Quanli; Wang, Zhenchun; Yang, Degong

2018-03-01

This paper proposes a non-contact, non-destructive evaluation method for the surface damage of high-speed sliding electrical contact rails. The proposed method establishes a model of damage identification and calculation. A laser scanning system is built to obtain the 3D point cloud data of the rail surface. In order to extract the damage region of the rail surface, the 3D point cloud data are processed using iterative difference, nearest neighbours search and a data registration algorithm. The curvature of the point cloud data in the damage region is mapped to RGB color information, which can directly reflect the change trend of the curvature of the point cloud data in the damage region. The extracted damage region is divided into three prism elements by a method of triangulation. The volume and mass of a single element are calculated by the method of geometric segmentation. Finally, the total volume and mass of the damage region are obtained by the principle of superposition. The proposed method is applied to several typical injuries and the results are discussed. The experimental results show that the algorithm can identify damage shapes and calculate damage mass with milligram precision, which are useful for evaluating the damage in a further research stage.

Recent numerical and algorithmic advances within the volume tracking framework for modeling interfacial flows

DOE PAGES

François, Marianne M.

2015-05-28

A review of recent advances made in numerical methods and algorithms within the volume tracking framework is presented. The volume tracking method, also known as the volume-of-fluid method has become an established numerical approach to model and simulate interfacial flows. Its advantage is its strict mass conservation. However, because the interface is not explicitly tracked but captured via the material volume fraction on a fixed mesh, accurate estimation of the interface position, its geometric properties and modeling of interfacial physics in the volume tracking framework remain difficult. Several improvements have been made over the last decade to address these challenges.more » In this study, the multimaterial interface reconstruction method via power diagram, curvature estimation via heights and mean values and the balanced-force algorithm for surface tension are highlighted.« less

A level set method for determining critical curvatures for drainage and imbibition.

PubMed

Prodanović, Masa; Bryant, Steven L

2006-12-15

An accurate description of the mechanics of pore level displacement of immiscible fluids could significantly improve the predictions from pore network models of capillary pressure-saturation curves, interfacial areas and relative permeability in real porous media. If we assume quasi-static displacement, at constant pressure and surface tension, pore scale interfaces are modeled as constant mean curvature surfaces, which are not easy to calculate. Moreover, the extremely irregular geometry of natural porous media makes it difficult to evaluate surface curvature values and corresponding geometric configurations of two fluids. Finally, accounting for the topological changes of the interface, such as splitting or merging, is nontrivial. We apply the level set method for tracking and propagating interfaces in order to robustly handle topological changes and to obtain geometrically correct interfaces. We describe a simple but robust model for determining critical curvatures for throat drainage and pore imbibition. The model is set up for quasi-static displacements but it nevertheless captures both reversible and irreversible behavior (Haines jump, pore body imbibition). The pore scale grain boundary conditions are extracted from model porous media and from imaged geometries in real rocks. The method gives quantitative agreement with measurements and with other theories and computational approaches.

The AOLI low-order non-linear curvature wavefront sensor: laboratory and on-sky results

NASA Astrophysics Data System (ADS)

Crass, Jonathan; King, David; MacKay, Craig

2014-08-01

Many adaptive optics (AO) systems in use today require the use of bright reference objects to determine the effects of atmospheric distortions. Typically these systems use Shack-Hartmann Wavefront sensors (SHWFS) to distribute incoming light from a reference object between a large number of sub-apertures. Guyon et al. evaluated the sensitivity of several different wavefront sensing techniques and proposed the non-linear Curvature Wavefront Sensor (nlCWFS) offering improved sensitivity across a range of orders of distortion. On large ground-based telescopes this can provide nearly 100% sky coverage using natural guide stars. We present work being undertaken on the nlCWFS development for the Adaptive Optics Lucky Imager (AOLI) project. The wavefront sensor is being developed as part of a low-order adaptive optics system for use in a dedicated instrument providing an AO corrected beam to a Lucky Imaging based science detector. The nlCWFS provides a total of four reference images on two photon-counting EMCCDs for use in the wavefront reconstruction process. We present results from both laboratory work using a calibration system and the first on-sky data obtained with the nlCWFS at the 4.2 metre William Herschel Telescope, La Palma. In addition, we describe the updated optical design of the wavefront sensor, strategies for minimising intrinsic effects and methods to maximise sensitivity using photon-counting detectors. We discuss on-going work to develop the high speed reconstruction algorithm required for the nlCWFS technique. This includes strategies to implement the technique on graphics processing units (GPUs) and to minimise computing overheads to obtain a prior for a rapid convergence of the wavefront reconstruction. Finally we evaluate the sensitivity of the wavefront sensor based upon both data and low-photon count strategies.

Study of Unsteady Flows with Concave Wall Effect

NASA Technical Reports Server (NTRS)

Wang, Chi R.

2003-01-01

This paper presents computational fluid dynamic studies of the inlet turbulence and wall curvature effects on the flow steadiness at near wall surface locations in boundary layer flows. The time-stepping RANS numerical solver of the NASA Glenn-HT RANS code and a one-equation turbulence model, with a uniform inlet turbulence modeling level of the order of 10 percent of molecular viscosity, were used to perform the numerical computations. The approach was first calibrated for its predictabilities of friction factor, velocity, and temperature at near surface locations within a transitional boundary layer over concave wall. The approach was then used to predict the velocity and friction factor variations in a boundary layer recovering from concave curvature. As time iteration proceeded in the computations, the computed friction factors converged to their values from existing experiments. The computed friction factors, velocity, and static temperatures at near wall surface locations oscillated periodically in terms of time iteration steps and physical locations along the span-wise direction. At the upstream stations, the relationship among the normal and tangential velocities showed vortices effects on the velocity variations. Coherent vortices effect on the velocity components broke down at downstream stations. The computations also predicted the vortices effects on the velocity variations within a boundary layer flow developed along a concave wall surface with a downstream recovery flat wall surface. It was concluded that the computational approach might have the potential to analyze the flow steadiness in a turbine blade flow.

Application of Multifunctional Doppler LIDAR for Noncontact Track Speed, Distance, and Curvature Assessment

NASA Astrophysics Data System (ADS)

Munoz, Joshua

The primary focus of this research is evaluation of feasibility, applicability, and accuracy of Doppler Light Detection And Ranging (LIDAR) sensors as non-contact means for measuring track speed, distance traveled, and curvature. Speed histories, currently measured with a rotary, wheelmounted encoder, serve a number of useful purposes, one significant use involving derailment investigations. Distance calculation provides a spatial reference system for operators to locate track sections of interest. Railroad curves, using an IMU to measure curvature, are monitored to maintain track infrastructure within regulations. Speed measured with high accuracy leads to highfidelity distance and curvature data through utilization of processor clock rate and left-and rightrail speed differentials during curve navigation, respectively. Wheel-mounted encoders, or tachometers, provide a relatively low-resolution speed profile, exhibit increased noise with increasing speed, and are subject to the inertial behavior of the rail car which affects output data. The IMU used to measure curvature is dependent on acceleration and yaw rate sensitivity and experiences difficulty in low-speed conditions. Preliminary system tests onboard a "Hy-Rail" utility vehicle capable of traveling on rail show speed capture is possible using the rails as the reference moving target and furthermore, obtaining speed profiles from both rails allows for the calculation of speed differentials in curves to estimate degrees curvature. Ground truth distance calibration and curve measurement were also carried out. Distance calibration involved placement of spatial landmarks detected by a sensor to synchronize distance measurements as a pre-processing procedure. Curvature ground truth measurements provided a reference system to confirm measurement results and observe alignment variation throughout a curve. Primary testing occurred onboard a track geometry rail car, measuring rail speed over substantial mileage in various weather conditions, providing highaccuracy data to further calculate distance and curvature along the test routes. Tests results indicate the LIDAR system measures speed at higher accuracy than the encoder, absent of noise influenced by increasing speed. Distance calculation is also high in accuracy, results showing high correlation with encoder and ground truth data. Finally, curvature calculation using speed data is shown to have good correlation with IMU measurements and a resolution capable of revealing localized track alignments. Further investigations involve a curve measurement algorithm and speed calibration method independent from external reference systems, namely encoder and ground truth data. The speed calibration results show a high correlation with speed data from the track geometry vehicle. It is recommended that the study be extended to provide assessment of the LIDAR's sensitivity to car body motion in order to better isolate the embedded behavior in the speed and curvature profiles. Furthermore, in the interest of progressing the system toward a commercially viable unit, methods for self-calibration and pre-processing to allow for fully independent operation is highly encouraged.

Evaluation of algorithms for point cloud surface reconstruction through the analysis of shape parameters

NASA Astrophysics Data System (ADS)

Cao, Lu; Verbeek, Fons J.

2012-03-01

In computer graphics and visualization, reconstruction of a 3D surface from a point cloud is an important research area. As the surface contains information that can be measured, i.e. expressed in features, the application of surface reconstruction can be potentially important for application in bio-imaging. Opportunities in this application area are the motivation for this study. In the past decade, a number of algorithms for surface reconstruction have been proposed. Generally speaking, these methods can be separated into two categories: i.e., explicit representation and implicit approximation. Most of the aforementioned methods are firmly based in theory; however, so far, no analytical evaluation between these methods has been presented. The straightforward way of evaluation has been by convincing through visual inspection. Through evaluation we search for a method that can precisely preserve the surface characteristics and that is robust in the presence of noise. The outcome will be used to improve reliability in surface reconstruction of biological models. We, therefore, use an analytical approach by selecting features as surface descriptors and measure these features in varying conditions. We selected surface distance, surface area and surface curvature as three major features to compare quality of the surface created by the different algorithms. Our starting point has been ground truth values obtained from analytical shapes such as the sphere and the ellipsoid. In this paper we present four classical surface reconstruction methods from the two categories mentioned above, i.e. the Power Crust, the Robust Cocone, the Fourier-based method and the Poisson reconstruction method. The results obtained from our experiments indicate that Poisson reconstruction method performs the best in the presence of noise.

A 3D Kinematic Measurement of Knee Prosthesis Using X-ray Projection Images

NASA Astrophysics Data System (ADS)

Hirokawa, Shunji; Ariyoshi, Shogo; Hossain, Mohammad Abrar

We have developed a technique for estimating 3D motion of knee prosthesis from its 2D perspective projections. As Fourier descriptors were used for compact representation of library templates and contours extracted from the prosthetic X-ray images, the entire silhouette contour of each prosthetic component was required. This caused such a problem as our algorithm did not function when the silhouettes of tibio and femoral components overlapped with each other. Here we planned a novel method to overcome it; which was processed in two steps. First, the missing part of silhouette contour due to overlap was interpolated using a free-formed curvature such as Bezier. Then the first step position/orientation estimation was performed. In the next step, a clipping window was set in the projective coordinate so as to separate the overlapped silhouette drawn using the first step estimates. After that the localized library whose templates were clipped in shape was prepared and the second step estimation was performed. Computer model simulation demonstrated sufficient accuracies of position/orientation estimation even for overlapped silhouettes; equivalent to those without overlap.

The geometry of discombinations and its applications to semi-inverse problems in anelasticity

PubMed Central

Yavari, Arash; Goriely, Alain

2014-01-01

The geometrical formulation of continuum mechanics provides us with a powerful approach to understand and solve problems in anelasticity where an elastic deformation is combined with a non-elastic component arising from defects, thermal stresses, growth effects or other effects leading to residual stresses. The central idea is to assume that the material manifold, prescribing the reference configuration for a body, has an intrinsic, non-Euclidean, geometrical structure. Residual stresses then naturally arise when this configuration is mapped into Euclidean space. Here, we consider the problem of discombinations (a new term that we introduce in this paper), that is, a combined distribution of fields of dislocations, disclinations and point defects. Given a discombination, we compute the geometrical characteristics of the material manifold (curvature, torsion, non-metricity), its Cartan's moving frames and structural equations. This identification provides a powerful algorithm to solve semi-inverse problems with non-elastic components. As an example, we calculate the residual stress field of a cylindrically symmetric distribution of discombinations in an infinite circular cylindrical bar made of an incompressible hyperelastic isotropic elastic solid. PMID:25197257

Decentralized Quasi-Newton Methods

NASA Astrophysics Data System (ADS)

Eisen, Mark; Mokhtari, Aryan; Ribeiro, Alejandro

2017-05-01

We introduce the decentralized Broyden-Fletcher-Goldfarb-Shanno (D-BFGS) method as a variation of the BFGS quasi-Newton method for solving decentralized optimization problems. The D-BFGS method is of interest in problems that are not well conditioned, making first order decentralized methods ineffective, and in which second order information is not readily available, making second order decentralized methods impossible. D-BFGS is a fully distributed algorithm in which nodes approximate curvature information of themselves and their neighbors through the satisfaction of a secant condition. We additionally provide a formulation of the algorithm in asynchronous settings. Convergence of D-BFGS is established formally in both the synchronous and asynchronous settings and strong performance advantages relative to first order methods are shown numerically.

CUTEX: CUrvature Thresholding EXtractor

NASA Astrophysics Data System (ADS)

Molinari, S.; Schisano, E.; Faustini, F.; Pestalozzi, M.; di Giorgio, A. M.; Liu, S.

2017-08-01

CuTEx analyzes images in the infrared bands and extracts sources from complex backgrounds, particularly star-forming regions that offer the challenges of crowding, having a highly spatially variable background, and having no-psf profiles such as protostars in their accreting phase. The code is composed of two main algorithms, the first an algorithm for source detection, and the second for flux extraction. The code is originally written in IDL language and it was exported in the license free GDL language. CuTEx could be used in other bands or in scientific cases different from the native case. This software is also available as an on-line tool from the Multi-Mission Interactive Archive web pages dedicated to the Herschel Observatory.

Programming curvature using origami tessellations

NASA Astrophysics Data System (ADS)

Dudte, Levi H.; Vouga, Etienne; Tachi, Tomohiro; Mahadevan, L.

2016-05-01

Origami describes rules for creating folded structures from patterns on a flat sheet, but does not prescribe how patterns can be designed to fit target shapes. Here, starting from the simplest periodic origami pattern that yields one-degree-of-freedom collapsible structures--we show that scale-independent elementary geometric constructions and constrained optimization algorithms can be used to determine spatially modulated patterns that yield approximations to given surfaces of constant or varying curvature. Paper models confirm the feasibility of our calculations. We also assess the difficulty of realizing these geometric structures by quantifying the energetic barrier that separates the metastable flat and folded states. Moreover, we characterize the trade-off between the accuracy to which the pattern conforms to the target surface, and the effort associated with creating finer folds. Our approach enables the tailoring of origami patterns to drape complex surfaces independent of absolute scale, as well as the quantification of the energetic and material cost of doing so.

Edge Pushing is Equivalent to Vertex Elimination for Computing Hessians

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

Wang, Mu; Pothen, Alex; Hovland, Paul

We prove the equivalence of two different Hessian evaluation algorithms in AD. The first is the Edge Pushing algorithm of Gower and Mello, which may be viewed as a second order Reverse mode algorithm for computing the Hessian. In earlier work, we have derived the Edge Pushing algorithm by exploiting a Reverse mode invariant based on the concept of live variables in compiler theory. The second algorithm is based on eliminating vertices in a computational graph of the gradient, in which intermediate variables are successively eliminated from the graph, and the weights of the edges are updated suitably. We provemore » that if the vertices are eliminated in a reverse topological order while preserving symmetry in the computational graph of the gradient, then the Vertex Elimination algorithm and the Edge Pushing algorithm perform identical computations. In this sense, the two algorithms are equivalent. This insight that unifies two seemingly disparate approaches to Hessian computations could lead to improved algorithms and implementations for computing Hessians. Read More: http://epubs.siam.org/doi/10.1137/1.9781611974690.ch11« less

Application of genetic algorithms to focal mechanism determination

NASA Astrophysics Data System (ADS)

Kobayashi, Reiji; Nakanishi, Ichiro

1994-04-01

Genetic algorithms are a new class of methods for global optimization. They resemble Monte Carlo techniques, but search for solutions more efficiently than uniform Monte Carlo sampling. In the field of geophysics, genetic algorithms have recently been used to solve some non-linear inverse problems (e.g., earthquake location, waveform inversion, migration velocity estimation). We present an application of genetic algorithms to focal mechanism determination from first-motion polarities of P-waves and apply our method to two recent large events, the Kushiro-oki earthquake of January 15, 1993 and the SW Hokkaido (Japan Sea) earthquake of July 12, 1993. Initial solution and curvature information of the objective function that gradient methods need are not required in our approach. Moreover globally optimal solutions can be efficiently obtained. Calculation of polarities based on double-couple models is the most time-consuming part of the source mechanism determination. The amount of calculations required by the method designed in this study is much less than that of previous grid search methods.

Algorithmic Mechanism Design of Evolutionary Computation.

PubMed

Pei, Yan

2015-01-01

We consider algorithmic design, enhancement, and improvement of evolutionary computation as a mechanism design problem. All individuals or several groups of individuals can be considered as self-interested agents. The individuals in evolutionary computation can manipulate parameter settings and operations by satisfying their own preferences, which are defined by an evolutionary computation algorithm designer, rather than by following a fixed algorithm rule. Evolutionary computation algorithm designers or self-adaptive methods should construct proper rules and mechanisms for all agents (individuals) to conduct their evolution behaviour correctly in order to definitely achieve the desired and preset objective(s). As a case study, we propose a formal framework on parameter setting, strategy selection, and algorithmic design of evolutionary computation by considering the Nash strategy equilibrium of a mechanism design in the search process. The evaluation results present the efficiency of the framework. This primary principle can be implemented in any evolutionary computation algorithm that needs to consider strategy selection issues in its optimization process. The final objective of our work is to solve evolutionary computation design as an algorithmic mechanism design problem and establish its fundamental aspect by taking this perspective. This paper is the first step towards achieving this objective by implementing a strategy equilibrium solution (such as Nash equilibrium) in evolutionary computation algorithm.

Algorithmic Mechanism Design of Evolutionary Computation

PubMed Central

2015-01-01

We consider algorithmic design, enhancement, and improvement of evolutionary computation as a mechanism design problem. All individuals or several groups of individuals can be considered as self-interested agents. The individuals in evolutionary computation can manipulate parameter settings and operations by satisfying their own preferences, which are defined by an evolutionary computation algorithm designer, rather than by following a fixed algorithm rule. Evolutionary computation algorithm designers or self-adaptive methods should construct proper rules and mechanisms for all agents (individuals) to conduct their evolution behaviour correctly in order to definitely achieve the desired and preset objective(s). As a case study, we propose a formal framework on parameter setting, strategy selection, and algorithmic design of evolutionary computation by considering the Nash strategy equilibrium of a mechanism design in the search process. The evaluation results present the efficiency of the framework. This primary principle can be implemented in any evolutionary computation algorithm that needs to consider strategy selection issues in its optimization process. The final objective of our work is to solve evolutionary computation design as an algorithmic mechanism design problem and establish its fundamental aspect by taking this perspective. This paper is the first step towards achieving this objective by implementing a strategy equilibrium solution (such as Nash equilibrium) in evolutionary computation algorithm. PMID:26257777

Curvature sensor for ocular wavefront measurement.

PubMed

Díaz-Doutón, Fernando; Pujol, Jaume; Arjona, Montserrat; Luque, Sergio O

2006-08-01

We describe a new wavefront sensor for ocular aberration determination, based on the curvature sensing principle, which adapts the classical system used in astronomy for the living eye's measurements. The actual experimental setup is presented and designed following a process guided by computer simulations to adjust the design parameters for optimal performance. We present results for artificial and real young eyes, compared with the Hartmann-Shack estimations. Both methods show a similar performance for these cases. This system will allow for the measurement of higher order aberrations than the currently used wavefront sensors in situations in which they are supposed to be significant, such as postsurgery eyes.

A simple test for spacetime symmetry

NASA Astrophysics Data System (ADS)

Houri, Tsuyoshi; Yasui, Yukinori

2015-03-01

This paper presents a simple method for investigating spacetime symmetry for a given metric. The method makes use of the curvature conditions that are obtained from the Killing equations. We use the solutions of the curvature conditions to compute an upper bound on the number of Killing vector fields, as well as Killing-Yano (KY) tensors and closed conformal KY tensors. We also use them in the integration of the Killing equations. By means of the method, we thoroughly investigate KY symmetry of type D vacuum solutions such as the Kerr metric in four dimensions. The method is also applied to a large variety of physical metrics in four and five dimensions.

No Association between Cortical Gyrification or Intrinsic Curvature and Attention-deficit/Hyperactivity Disorder in Adolescents and Young Adults.

PubMed

Forde, Natalie J; Ronan, Lisa; Zwiers, Marcel P; Alexander-Bloch, Aaron F; Faraone, Stephen V; Oosterlaan, Jaap; Heslenfeld, Dirk J; Hartman, Catharina A; Buitelaar, Jan K; Hoekstra, Pieter J

2017-01-01

Magnetic resonance imaging (MRI) studies have highlighted subcortical, cortical, and structural connectivity abnormalities associated with attention-deficit/hyperactivity disorder (ADHD). Gyrification investigations of the cortex have been inconsistent and largely negative, potentially due to a lack of sensitivity of the previously used morphological parameters. The innovative approach of applying intrinsic curvature analysis, which is predictive of gyrification pattern, to the cortical surface applied herein allowed us greater sensitivity to determine whether the structural connectivity abnormalities thus far identified at a centimeter scale also occur at a millimeter scale within the cortical surface. This could help identify neurodevelopmental processes that contribute to ADHD. Structural MRI datasets from the NeuroIMAGE project were used [ n = 306 ADHD, n = 164 controls, and n = 148 healthy siblings of individuals with ADHD (age in years, mean(sd); 17.2 (3.4), 16.8 (3.2), and 17.7 (3.8), respectively)]. Reconstructions of the cortical surfaces were computed with FreeSurfer. Intrinsic curvature (taken as a marker of millimeter-scale surface connectivity) and local gyrification index were calculated for each point on the surface (vertex) with Caret and FreeSurfer, respectively. Intrinsic curvature skew and mean local gyrification index were extracted per region; frontal, parietal, temporal, occipital, cingulate, and insula. A generalized additive model was used to compare the trajectory of these measures between groups over age, with sex, scanner site, total surface area of hemisphere, and familiality accounted for. After correcting for sex, scanner site, and total surface area no group differences were found in the developmental trajectory of intrinsic curvature or local gyrification index. Despite the increased sensitivity of intrinsic curvature, compared to gyrification measures, to subtle morphological abnormalities of the cortical surface we found no milimeter-scale connectivity abnormalities associated with ADHD.

Nonlinear dynamics and chaotic motions in feedback-controlled two- and three-degree-of-freedom robots

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

Ravishankar, A.S. Ghosal, A.

1999-01-01

The dynamics of a feedback-controlled rigid robot is most commonly described by a set of nonlinear ordinary differential equations. In this paper, the authors analyze these equations, representing the feedback-controlled motion of two- and three-degrees-of-freedom rigid robots with revolute (R) and prismatic (P) joints in the absence of compliance, friction, and potential energy, for the possibility of chaotic motions. The authors first study the unforced or inertial motions of the robots, and show that when the Gaussian or Riemannian curvature of the configuration space of a robot is negative, the robot equations can exhibit chaos. If the curvature is zeromore » or positive, then the robot equations cannot exhibit chaos. The authors show that among the two-degrees-of-freedom robots, the PP and the PR robot have zero Gaussian curvature while the RP and RR robots have negative Gaussian curvatures. For the three-degrees-of-freedom robots, they analyze the two well-known RRP and RRR configurations of the Stanford arm and the PUMA manipulator, respectively, and derive the conditions for negative curvature and possible chaotic motions. The criteria of negative curvature cannot be used for the forced or feedback-controlled motions. For the forced motion, the authors resort to the well-known numerical techniques and compute chaos maps, Poincare maps, and bifurcation diagrams. Numerical results are presented for the two-degrees-of-freedom RP and RR robots, and the authors show that these robot equations can exhibit chaos for low controller gains and for large underestimated models. From the bifurcation diagrams, the route to chaos appears to be through period doubling.« less

A review on quantum search algorithms

NASA Astrophysics Data System (ADS)

Giri, Pulak Ranjan; Korepin, Vladimir E.

2017-12-01

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

A discriminatory function for prediction of protein-DNA interactions based on alpha shape modeling.

PubMed

Zhou, Weiqiang; Yan, Hong

2010-10-15

Protein-DNA interaction has significant importance in many biological processes. However, the underlying principle of the molecular recognition process is still largely unknown. As more high-resolution 3D structures of protein-DNA complex are becoming available, the surface characteristics of the complex become an important research topic. In our work, we apply an alpha shape model to represent the surface structure of the protein-DNA complex and developed an interface-atom curvature-dependent conditional probability discriminatory function for the prediction of protein-DNA interaction. The interface-atom curvature-dependent formalism captures atomic interaction details better than the atomic distance-based method. The proposed method provides good performance in discriminating the native structures from the docking decoy sets, and outperforms the distance-dependent formalism in terms of the z-score. Computer experiment results show that the curvature-dependent formalism with the optimal parameters can achieve a native z-score of -8.17 in discriminating the native structure from the highest surface-complementarity scored decoy set and a native z-score of -7.38 in discriminating the native structure from the lowest RMSD decoy set. The interface-atom curvature-dependent formalism can also be used to predict apo version of DNA-binding proteins. These results suggest that the interface-atom curvature-dependent formalism has a good prediction capability for protein-DNA interactions. The code and data sets are available for download on http://www.hy8.com/bioinformatics.htm kenandzhou@hotmail.com.

Comparison of preparation of curved root canals with Hyflex CM and Revo-S rotary nickel-titanium instruments.

PubMed

Bürklein, S; Börjes, L; Schäfer, E

2014-05-01

To compare the shaping ability of three different nickel-titanium rotary instruments during the preparation of curved root canals in extracted teeth. A total of 60 root canals with curvatures ranging between 25° and 35° were divided into three groups of 20 canals. Based on radiographs taken prior to instrumentation, the groups were balanced with respect to the angle and the radius of canal curvature. Canals were prepared to a final apical size of 35 using Mtwo, Hyflex CM, and Revo-S. Using pre- and post-instrumentation radiographs, straightening of the canal curvatures was determined with a computer image analysis program. Preparation time, changes of working length and instrument failures were also recorded. These data were analysed statistically using anova and Student-Newman-Keuls test. During preparation, no file fractured. Mtwo and Hyflex CM maintained the original canal curvature significantly better than Revo-S (P < 0.05). Instrumentation with Mtwo and Hyflex CM was significantly faster than with Revo-S and resulted in less loss of working length (P < 0.05), whilst no significant differences were obtained between Mtwo and Hyflex CM (P > 0.05). Under the conditions of this study, Mtwo and Hyflex CM respected the original canal curvature well and were safe to use. The use of Revo-S instruments required more time to prepare the curved canals and resulted in more pronounced canal straightening compared with Mtwo and Hyflex CM. © 2013 International Endodontic Journal. Published by John Wiley & Sons Ltd.

Acoustic field of a pulsating cylinder in a rarefied gas: Thermoviscous and curvature effects

NASA Astrophysics Data System (ADS)

Ben Ami, Y.; Manela, A.

2017-09-01

We study the acoustic field of a circular cylinder immersed in a rarefied gas and subject to harmonic small-amplitude normal-to-wall displacement and heat-flux excitations. The problem is analyzed in the entire range of gas rarefaction rates and excitation frequencies, considering both single cylinder and coaxial cylinders setups. Numerical calculations are carried out via the direct simulation Monte Carlo method, applying a noniterative algorithm to impose the boundary heat-flux condition. Analytical predictions are obtained in the limits of ballistic- and continuum-flow conditions. Comparing with a reference inviscid continuum solution, the results illustrate the specific impacts of gas rarefaction and boundary curvature on the acoustic source efficiency. Inspecting the far-field properties of the generated disturbance, the continuum-limit solution exhibits an exponential decay of the signal with the distance from the source, reflecting thermoviscous effects, and accompanied by an inverse square-root decay, characteristic of the inviscid problem. Stronger attenuation is observed in the ballistic limit, where boundary curvature results in "geometric reduction" of the molecular layer affected by the source, and the signal vanishes at a distance of few acoustic wavelengths from the cylinder. The combined effects of mechanical and thermal excitations are studied to seek for optimal conditions to monitor the vibroacoustic signal. The impact of boundary curvature becomes significant in the ballistic-flow regime, where the optimal heat-flux amplitude required for sound reduction decreases with the distance from the source and is essentially a function of the acoustic-wavelength-scaled distance only.

Theoretical computation of internal co- and post-seismic deformation fields caused by great earthquakes in a spherically stratified viscoelastic earth

NASA Astrophysics Data System (ADS)

Takagi, Y.; Okubo, S.

2016-12-01

Internal co- and post-seismic deformation fields such as strain and stress changes have been modelled in order to study their effects on the subsequent earthquake and/or volcanic activity around the epicentre. When modelling strain or stress changes caused by great earthquakes (M>9.0), we should use a realistic earth model including earth's curvature and stratification; according to Toda et al.'s (2011) result, the stress changes caused by the 2011 Tohoku-oki earthquake (Mw=9.0) exceed 0.1 bar (0.01 MPa) even at the epicentral distance over 400 km. Although many works have been carried out to compute co- and post-seismic surface deformation fields using a spherically stratified viscoelastic earth (e.g. Piersanti et al. 1995; Pollitz 1996, 1997; Tanaka et al. 2006), less attention has been paid to `internal' deformation fields. Tanaka et al. (2006) succeeded in computing post-seismic surface displacements in a continuously stratified compressible viscoelastic earth by evaluating the inverse Laplace integration numerically. To our regret, however, their method cannot calculate internal deformation because they use Okubo's (1993) reciprocity theorem. We found that Okubo's (1993) reciprocity theorem can be extended to computation of internal deformation fields. In this presentation, we show a method of computing internal co- and post-seismic deformation fields and discuss the effects of earth's curvature and stratification on them.

Characterization and Reduction of Cardiac- and Respiratory-Induced Noise as a Function of the Sampling Rate (TR) in fMRI

PubMed Central

Cordes, Dietmar; Nandy, Rajesh R.; Schafer, Scott; Wager, Tor D.

2014-01-01

It has recently been shown that both high-frequency and low-frequency cardiac and respiratory noise sources exist throughout the entire brain and can cause significant signal changes in fMRI data. It is also known that the brainstem, basal forebrain and spinal cord area are problematic for fMRI because of the magnitude of cardiac-induced pulsations at these locations. In this study, the physiological noise contributions in the lower brain areas (covering the brainstem and adjacent regions) are investigated and a novel method is presented for computing both low-frequency and high-frequency physiological regressors accurately for each subject. In particular, using a novel optimization algorithm that penalizes curvature (i.e. the second derivative) of the physiological hemodynamic response functions, the cardiac -and respiratory-related response functions are computed. The physiological noise variance is determined for each voxel and the frequency-aliasing property of the high-frequency cardiac waveform as a function of the repetition time (TR) is investigated. It is shown that for the brainstem and other brain areas associated with large pulsations of the cardiac rate, the temporal SNR associated with the low-frequency range of the BOLD response has maxima at subject-specific TRs. At these values, the high-frequency aliased cardiac rate can be eliminated by digital filtering without affecting the BOLD-related signal. PMID:24355483

Computer implemented empirical mode decomposition method apparatus, and article of manufacture utilizing curvature extrema

NASA Technical Reports Server (NTRS)

Shen, Zheng (Inventor); Huang, Norden Eh (Inventor)

2003-01-01

A computer implemented physical signal analysis method is includes two essential steps and the associated presentation techniques of the results. All the steps exist only in a computer: there are no analytic expressions resulting from the method. The first step is a computer implemented Empirical Mode Decomposition to extract a collection of Intrinsic Mode Functions (IMF) from nonlinear, nonstationary physical signals based on local extrema and curvature extrema. The decomposition is based on the direct extraction of the energy associated with various intrinsic time scales in the physical signal. Expressed in the IMF's, they have well-behaved Hilbert Transforms from which instantaneous frequencies can be calculated. The second step is the Hilbert Transform. The final result is the Hilbert Spectrum. Thus, the invention can localize any event on the time as well as the frequency axis. The decomposition can also be viewed as an expansion of the data in terms of the IMF's. Then, these IMF's, based on and derived from the data, can serve as the basis of that expansion. The local energy and the instantaneous frequency derived from the IMF's through the Hilbert transform give a full energy-frequency-time distribution of the data which is designated as the Hilbert Spectrum.

Columnar aerosol properties over oceans by combining surface and aircraft measurements: sensitivity analysis.

PubMed

Zhang, T; Gordon, H R

1997-04-20

We report a sensitivity analysis for the algorithm presented by Gordon and Zhang [Appl. Opt. 34, 5552 (1995)] for inverting the radiance exiting the top and bottom of the atmosphere to yield the aerosol-scattering phase function [P(?)] and single-scattering albedo (omega(0)). The study of the algorithm's sensitivity to radiometric calibration errors, mean-zero instrument noise, sea-surface roughness, the curvature of the Earth's atmosphere, the polarization of the light field, and incorrect assumptions regarding the vertical structure of the atmosphere, indicates that the retrieved omega(0) has excellent stability even for very large values (~2) of the aerosol optical thickness; however, the error in the retrieved P(?) strongly depends on the measurement error and on the assumptions made in the retrieval algorithm. The retrieved phase functions in the blue are usually poor compared with those in the near infrared.

Morphological analysis of dendrites and spines by hybridization of ridge detection with twin support vector machine.

PubMed

Wang, Shuihua; Chen, Mengmeng; Li, Yang; Shao, Ying; Zhang, Yudong; Du, Sidan; Wu, Jane

2016-01-01

Dendritic spines are described as neuronal protrusions. The morphology of dendritic spines and dendrites has a strong relationship to its function, as well as playing an important role in understanding brain function. Quantitative analysis of dendrites and dendritic spines is essential to an understanding of the formation and function of the nervous system. However, highly efficient tools for the quantitative analysis of dendrites and dendritic spines are currently undeveloped. In this paper we propose a novel three-step cascaded algorithm-RTSVM- which is composed of ridge detection as the curvature structure identifier for backbone extraction, boundary location based on differences in density, the Hu moment as features and Twin Support Vector Machine (TSVM) classifiers for spine classification. Our data demonstrates that this newly developed algorithm has performed better than other available techniques used to detect accuracy and false alarm rates. This algorithm will be used effectively in neuroscience research.

Magnetic resonance spectra and statistical geometry

USDA-ARS?s Scientific Manuscript database

Methods of statistical geometry are introduced which allow one to estimate, on the basis of computable criteria, the conditions under which maximally informative data may be collected. We note the important role of constraints that introduce curvature into parameter space and discuss the appropriate...

Curvature-Based Environment Description for Robot Navigation Using Laser Range Sensors

PubMed Central

Vázquez-Martín, Ricardo; Núñez, Pedro; Bandera, Antonio; Sandoval, Francisco

2009-01-01

This work proposes a new feature detection and description approach for mobile robot navigation using 2D laser range sensors. The whole process consists of two main modules: a sensor data segmentation module and a feature detection and characterization module. The segmentation module is divided in two consecutive stages: First, the segmentation stage divides the laser scan into clusters of consecutive range readings using a distance-based criterion. Then, the second stage estimates the curvature function associated to each cluster and uses it to split it into a set of straight-line and curve segments. The curvature is calculated using a triangle-area representation where, contrary to previous approaches, the triangle side lengths at each range reading are adapted to the local variations of the laser scan, removing noise without missing relevant points. This representation remains unchanged in translation or rotation, and it is also robust against noise. Thus, it is able to provide the same segmentation results although the scene will be perceived from different viewpoints. Therefore, segmentation results are used to characterize the environment using line and curve segments, real and virtual corners and edges. Real scan data collected from different environments by using different platforms are used in the experiments in order to evaluate the proposed environment description algorithm. PMID:22461732

Fluid-Structure Interaction Modeling of the Reefed Stages of the Orion Spacecraft Main Parachutes

NASA Astrophysics Data System (ADS)

Boswell, Cody W.

Spacecraft parachutes are typically used in multiple stages, starting with a "reefed" stage where a cable along the parachute skirt constrains the diameter to be less than the diameter in the subsequent stage. After a certain period of time during the descent, the cable is cut and the parachute "disreefs" (i.e. expands) to the next stage. Computing the parachute shape at the reefed stage and fluid-structure interaction (FSI) modeling during the disreefing involve computational challenges beyond those we have in FSI modeling of fully-open spacecraft parachutes. These additional challenges are created by the increased geometric complexities and by the rapid changes in the parachute geometry. The computational challenges are further increased because of the added geometric porosity of the latest design, where the "windows" created by the removal of panels and the wider gaps created by the removal of sails compound the geometric and flow complexity. Orion spacecraft main parachutes will have three stages, with computation of the Stage 1 shape and FSI modeling of disreefing from Stage 1 to Stage 2 being the most challenging. We present the special modeling techniques we devised to address the computational challenges and the results from the computations carried out. We also present the methods we devised to calculate for a parachute gore the radius of curvature in the circumferential direction. The curvature values are intended for quick and simple engineering analysis in estimating the structural stresses.

3D shape decomposition and comparison for gallbladder modeling

NASA Astrophysics Data System (ADS)

Huang, Weimin; Zhou, Jiayin; Liu, Jiang; Zhang, Jing; Yang, Tao; Su, Yi; Law, Gim Han; Chui, Chee Kong; Chang, Stephen

2011-03-01

This paper presents an approach to gallbladder shape comparison by using 3D shape modeling and decomposition. The gallbladder models can be used for shape anomaly analysis and model comparison and selection in image guided robotic surgical training, especially for laparoscopic cholecystectomy simulation. The 3D shape of a gallbladder is first represented as a surface model, reconstructed from the contours segmented in CT data by a scheme of propagation based voxel learning and classification. To better extract the shape feature, the surface mesh is further down-sampled by a decimation filter and smoothed by a Taubin algorithm, followed by applying an advancing front algorithm to further enhance the regularity of the mesh. Multi-scale curvatures are then computed on the regularized mesh for the robust saliency landmark localization on the surface. The shape decomposition is proposed based on the saliency landmarks and the concavity, measured by the distance from the surface point to the convex hull. With a given tolerance the 3D shape can be decomposed and represented as 3D ellipsoids, which reveal the shape topology and anomaly of a gallbladder. The features based on the decomposed shape model are proposed for gallbladder shape comparison, which can be used for new model selection. We have collected 19 sets of abdominal CT scan data with gallbladders, some shown in normal shape and some in abnormal shapes. The experiments have shown that the decomposed shapes reveal important topology features.

Expressions for optical scalars and deflection angle at second order in terms of curvature scalars

NASA Astrophysics Data System (ADS)

Crisnejo, Gabriel; Gallo, Emanuel

2018-04-01

We present formal expressions for the optical scalars in terms of the curvature scalars in the weak gravitational lensing regime at second order in perturbations of a flat background without mentioning the extension of the lens or their shape. Also, by considering the thin lens approximation for static and axially symmetric configurations we obtain an expression for the second-order deflection angle which generalizes our previous result presented by Gallo and Moreschi [Phys. Rev. D 83, 083007 (2011)., 10.1103/PhysRevD.83.083007]. As applications of these formulas we compute the optical scalars for some known family of metrics, and we recover expressions for the deflection angle. In contrast to other works in the subject, our formalism allows a straightforward identification of how the different components of the curvature tensor contribute to the optical scalars and deflection angle. We also discuss in what sense the Schwarzschild solution can be thought as a true thin lens at second order.

Generation and detection of pure valley current by electrically induced Berry curvature in bilayer graphene

NASA Astrophysics Data System (ADS)

Shimazaki, Y.; Yamamoto, M.; Borzenets, I. V.; Watanabe, K.; Taniguchi, T.; Tarucha, S.

2015-12-01

The field of `Valleytronics’ has recently been attracting growing interest as a promising concept for the next generation electronics, because non-dissipative pure valley currents with no accompanying net charge flow can be manipulated for computational use, akin to pure spin currents. Valley is a quantum number defined in an electronic system whose energy bands contain energetically degenerate but non-equivalent local minima (conduction band) or maxima (valence band) due to a certain crystal structure. Specifically, spatial inversion symmetry broken two-dimensional honeycomb lattice systems exhibiting Berry curvature is a subset of possible systems that enable optical, magnetic and electrical control of the valley degree of freedom. Here we use dual-gated bilayer graphene to electrically induce and control broken inversion symmetry (or Berry curvature) as well as the carrier density for generating and detecting the pure valley current. In the insulating regime, at zero-magnetic field, we observe a large nonlocal resistance that scales cubically with the local resistivity, which is evidence of pure valley current.

QCE: A Simulator for Quantum Computer Hardware

NASA Astrophysics Data System (ADS)

Michielsen, Kristel; de Raedt, Hans

2003-09-01

The Quantum Computer Emulator (QCE) described in this paper consists of a simulator of a generic, general purpose quantum computer and a graphical user interface. The latter is used to control the simulator, to define the hardware of the quantum computer and to debug and execute quantum algorithms. QCE runs in a Windows 98/NT/2000/ME/XP environment. It can be used to validate designs of physically realizable quantum processors and as an interactive educational tool to learn about quantum computers and quantum algorithms. A detailed exposition is given of the implementation of the CNOT and the Toffoli gate, the quantum Fourier transform, Grover's database search algorithm, an order finding algorithm, Shor's algorithm, a three-input adder and a number partitioning algorithm. We also review the results of simulations of an NMR-like quantum computer.

Subgrid or Reynolds stress-modeling for three-dimensional turbulence computations

NASA Technical Reports Server (NTRS)

Rubesin, M. W.

1975-01-01

A review is given of recent advances in two distinct computational methods for evaluating turbulence fields, namely, statistical Reynolds stress modeling and turbulence simulation, where large eddies are followed in time. It is shown that evaluation of the mean Reynolds stresses, rather than use of a scalar eddy viscosity, permits an explanation of streamline curvature effects found in several experiments. Turbulence simulation, with a new volume averaging technique and third-order accurate finite-difference computing is shown to predict the decay of isotropic turbulence in incompressible flow with rather modest computer storage requirements, even at Reynolds numbers of aerodynamic interest.

Wave computation on the Poincaré dodecahedral space

NASA Astrophysics Data System (ADS)

Bachelot-Motet, Agnès

2013-12-01

We compute the waves propagating on a compact 3-manifold of constant positive curvature with a non-trivial topology: the Poincaré dodecahedral space that is a plausible model of multi-connected universe. We transform the Cauchy problem to a mixed problem posed on a fundamental domain determined by the quaternionic calculus. We adopt a variational approach using a space of finite elements that is invariant under the action of the binary icosahedral group. The computation of the transient waves is validated with their spectral analysis by computing a lot of eigenvalues of the Laplace-Beltrami operator.

Rational use of cognitive resources: levels of analysis between the computational and the algorithmic.

PubMed

Griffiths, Thomas L; Lieder, Falk; Goodman, Noah D

2015-04-01

Marr's levels of analysis-computational, algorithmic, and implementation-have served cognitive science well over the last 30 years. But the recent increase in the popularity of the computational level raises a new challenge: How do we begin to relate models at different levels of analysis? We propose that it is possible to define levels of analysis that lie between the computational and the algorithmic, providing a way to build a bridge between computational- and algorithmic-level models. The key idea is to push the notion of rationality, often used in defining computational-level models, deeper toward the algorithmic level. We offer a simple recipe for reverse-engineering the mind's cognitive strategies by deriving optimal algorithms for a series of increasingly more realistic abstract computational architectures, which we call "resource-rational analysis." Copyright © 2015 Cognitive Science Society, Inc.

A class of parallel algorithms for computation of the manipulator inertia matrix

NASA Technical Reports Server (NTRS)

Fijany, Amir; Bejczy, Antal K.

1989-01-01

Parallel and parallel/pipeline algorithms for computation of the manipulator inertia matrix are presented. An algorithm based on composite rigid-body spatial inertia method, which provides better features for parallelization, is used for the computation of the inertia matrix. Two parallel algorithms are developed which achieve the time lower bound in computation. Also described is the mapping of these algorithms with topological variation on a two-dimensional processor array, with nearest-neighbor connection, and with cardinality variation on a linear processor array. An efficient parallel/pipeline algorithm for the linear array was also developed, but at significantly higher efficiency.

Analysis of carotid lumen surface morphology using three-dimensional ultrasound imaging

NASA Astrophysics Data System (ADS)

Chiu, Bernard; Beletsky, Vadim; Spence, J. David; Parraga, Grace; Fenster, Aaron

2009-03-01

Carotid plaque surface irregularity and ulcerations play an important role in the risk of ischemic stroke. Ulcerated or fissured plaque, characterized by irregular surface morphology, exposes thrombogenic materials to the bloodstream, possibly leading to life- or brain-threatening thrombosis and embolization. Therefore, the quantification of plaque surface irregularity is important to identify high-risk plaques that would likely lead to vascular events. Although a number of studies have characterized plaque surface irregularity using subjective classification schemes with two or more categories, only a few have quantified surface irregularity using an objective and continuous quantity, such as Gaussian or mean curvature. In this work, our goal was to use both Gaussian and mean curvatures for identifying ulcers from 3D carotid ultrasound (US) images of human subjects. Before performing experiments using patient data, we verified the numerical accuracy of the surface curvature computation method using discrete spheres and tori with different sampling intervals. We also showed that three ulcers of the vascular phantom with 2 mm, 3 mm and 4 mm diameters were associated with high Gaussian and mean curvatures, and thus, were easily detected. Finally, we demonstrated the application of the proposed method for detecting ulcers on luminal surfaces, which were segmented from the 3D US images acquired for two human subjects.

Pore geometry as a control on rock strength

NASA Astrophysics Data System (ADS)

Bubeck, A.; Walker, R. J.; Healy, D.; Dobbs, M.; Holwell, D. A.

2017-01-01

The strength of rocks in the subsurface is critically important across the geosciences, with implications for fluid flow, mineralisation, seismicity, and the deep biosphere. Most studies of porous rock strength consider the scalar quantity of porosity, in which strength shows a broadly inverse relationship with total porosity, but pore shape is not explicitly defined. Here we use a combination of uniaxial compressive strength measurements of isotropic and anisotropic porous lava samples, and numerical modelling to consider the influence of pore shape on rock strength. Micro computed tomography (CT) shows that pores range from sub-spherical to elongate and flat ellipsoids. Samples that contain flat pores are weaker if compression is applied parallel to the short axis (i.e. across the minimum curvature), compared to compression applied parallel to the long axis (i.e. across the maximum curvature). Numerical models for elliptical pores show that compression applied across the minimum curvature results in relatively broad amplification of stress, compared to compression applied across the maximum curvature. Certain pore shapes may be relatively stable and remain open in the upper crust under a given remote stress field, while others are inherently weak. Quantifying the shape, orientations, and statistical distributions of pores is therefore a critical step in strength testing of rocks.

Permittivity and temperature effects on rectification performance of self-switching diodes with different geometrical structures using two-dimensional device simulator

NASA Astrophysics Data System (ADS)

Zakaria, N. F.; Kasjoo, S. R.; Zailan, Z.; Isa, M. M.; Taking, S.; Arshad, M. K. M.

2017-12-01

Characterization on an InGaAs-based self-switching diode (SSD) using technology computer aided design (TCAD) aimed for optimizing the electrical rectification performance of the device is reported. The rectifying performance is mainly contributed by a parameter known as the curvature coefficient which is derived from the current-voltage (I-V) behavior of the device. As such, the curvature coefficient of SSD was analyzed in this work, not only by varying the device's geometrical structure, but also by implementing different dielectric relative permittivity of the device's trenches, ranging from 1.0 to 10. Furthermore, the simulations were performed under temperature range of 300-600 K. The results showed that increased temperature degraded the SSD's rectifying performance due to increased reverse current which can deteriorate the nonlinearity of the device's I-V characteristic. Moreover, an improved curvature coefficient can be achieved using silicon dioxide (∼3.9) as the SSD trenches. The cut-off frequency of SSD with zero-bias curvature coefficient of ∼30 V-1 attained in this work was approximately 80 GHz, operating at unbiased condition. The results obtained can assist the design of SSD to efficiently operate as rectifiers at microwave and terahertz frequencies.

Measurement of three-dimensional normal vectors, principal curvatures, and wall thickness of the heart using cine-MRI

NASA Astrophysics Data System (ADS)

Coghlan, Leslie; Singleton, H. R.; Dell'Italia, L. J.; Linderholm, C. E.; Pohost, G. M.

1995-05-01

We have developed a method for measuring the detailed in vivo three dimensional geometry of the left and right ventricles using cine-magnetic resonance imaging. From data in the form of digitized short axis outlines, the normal vectors, principal curvatures and directions, and wall thickness were computed. The method was evaluated on simulated ellipsoids and on human MRI data. Measurements of normal vectors and of wall thickness were very accurate in simulated data and appeared appropriate in patient data. On simulated data, measurements of the principal curvature k1 (corresponding approximately to the short axis direction of the left ventricle) and of principal directions were quite accurate, but measurements of the other principal curvature (k2) were less accurate. The reasons behind this are considered. We expect improvements in the accuracy with thinner slices and improved representation of the surface data. Gradient echo images were acquired from 8 dogs with a 1.5T system (Philips Gyroscan) at baseline and four months after closed chest experimentally produced mitral regurgitation (MR). The product (k1 + k2) X wall thickness averaged over all slices at end-diastole was significantly lower after surgery (n equals 8, p < 0.005). These geometry changes were consistent with the expected increase in wall stress after MR.

DIFFEOMORPHIC SURFACE FLOWS: A NOVEL METHOD OF SURFACE EVOLUTION*

PubMed Central

Zhang, Sirong; Younes, Laurent; Zweck, John; Ratnanather, J. Tilak

2009-01-01

We describe a new class of surface flows, diffeomorphic surface flows, induced by restricting diffeomorphic flows of the ambient Euclidean space to a surface. Different from classical surface PDE flows such as mean curvature flow, diffeomorphic surface flows are solutions of integro-differential equations in a group of diffeomorphisms. They have the potential advantage of being both topology-invariant and singularity free, which can be useful in computational anatomy and computer graphics. We first derive the Euler–Lagrange equation of the elastic energy for general diffeomorphic surface flows, which can be regarded as a smoothed version of the corresponding classical surface flows. Then we focus on diffeomorphic mean curvature flow. We prove the short-time existence and uniqueness of the flow, and study the long-time existence of the flow for surfaces of revolution. We present numerical experiments on synthetic and cortical surfaces from neuroimaging studies in schizophrenia and auditory disorders. Finally we discuss unresolved issues and potential applications. PMID:20016768

STC-SAB program users manual for the turbulent boundary layer and turbulent separation prediction methods employed in the NASA Langley streamtube curvature computer program

NASA Technical Reports Server (NTRS)

Ferguson, D. R.

1972-01-01

The streamtube curvature program (STC) has been developed to predict the inviscid flow field and the pressure distribution about nacelles at transonic speeds. The effects of boundary layer are to displace the inviscid flow and effectively change the body shape. Thus, the body shape must be corrected by the displacement thickness in order to calculate the correct pressure distribution. This report describes the coupling of the Stratford and Beavers boundary layer solution with the inviscid STC analysis so that all nacelle pressure forces, friction drag, and incipient separation may be predicted. The usage of the coupled STC-SAB computer program is outlined and the program input and output are defined. Included in this manual are descriptions of the principal boundary layer tables and other revisions to the STC program. The use of the viscous option is controlled by the engineer during program input definition.

Network Community Detection based on the Physarum-inspired Computational Framework.

PubMed

Gao, Chao; Liang, Mingxin; Li, Xianghua; Zhang, Zili; Wang, Zhen; Zhou, Zhili

2016-12-13

Community detection is a crucial and essential problem in the structure analytics of complex networks, which can help us understand and predict the characteristics and functions of complex networks. Many methods, ranging from the optimization-based algorithms to the heuristic-based algorithms, have been proposed for solving such a problem. Due to the inherent complexity of identifying network structure, how to design an effective algorithm with a higher accuracy and a lower computational cost still remains an open problem. Inspired by the computational capability and positive feedback mechanism in the wake of foraging process of Physarum, which is a large amoeba-like cell consisting of a dendritic network of tube-like pseudopodia, a general Physarum-based computational framework for community detection is proposed in this paper. Based on the proposed framework, the inter-community edges can be identified from the intra-community edges in a network and the positive feedback of solving process in an algorithm can be further enhanced, which are used to improve the efficiency of original optimization-based and heuristic-based community detection algorithms, respectively. Some typical algorithms (e.g., genetic algorithm, ant colony optimization algorithm, and Markov clustering algorithm) and real-world datasets have been used to estimate the efficiency of our proposed computational framework. Experiments show that the algorithms optimized by Physarum-inspired computational framework perform better than the original ones, in terms of accuracy and computational cost. Moreover, a computational complexity analysis verifies the scalability of our framework.

A highly efficient multi-core algorithm for clustering extremely large datasets

PubMed Central

2010-01-01

Background In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput technologies. This demand is likely to increase. Standard algorithms for analyzing data, such as cluster algorithms, need to be parallelized for fast processing. Unfortunately, most approaches for parallelizing algorithms largely rely on network communication protocols connecting and requiring multiple computers. One answer to this problem is to utilize the intrinsic capabilities in current multi-core hardware to distribute the tasks among the different cores of one computer. Results We introduce a multi-core parallelization of the k-means and k-modes cluster algorithms based on the design principles of transactional memory for clustering gene expression microarray type data and categorial SNP data. Our new shared memory parallel algorithms show to be highly efficient. We demonstrate their computational power and show their utility in cluster stability and sensitivity analysis employing repeated runs with slightly changed parameters. Computation speed of our Java based algorithm was increased by a factor of 10 for large data sets while preserving computational accuracy compared to single-core implementations and a recently published network based parallelization. Conclusions Most desktop computers and even notebooks provide at least dual-core processors. Our multi-core algorithms show that using modern algorithmic concepts, parallelization makes it possible to perform even such laborious tasks as cluster sensitivity and cluster number estimation on the laboratory computer. PMID:20370922

Age-related changes in thoracic skeletal geometry of elderly females.

PubMed

Holcombe, Sven A; Wang, Stewart C; Grotberg, James B

2017-05-29

Both females and the elderly have been identified as vulnerable populations with increased injury and mortality risk in multiple crash scenarios. Particularly in frontal impacts, older females show higher risk to the chest and thorax than their younger or male counterparts. Thoracic geometry plays a role in this increase, and this study aims to quantify key parts of that geometry in a way that can directly inform human body models that incorporate the concept of person age. Computed tomography scans from 2 female subject groups aged 20-35 and 65-99 were selected from the International Center for Automotive Medicine scan database representing young and old female populations. A model of thoracic skeletal anatomy was built for each subject from independent parametric models of the spine, ribs, and sternum, along with further parametric models of those components' spatial relationships. Parameter values between the 2 groups are directly compared, and average parameter values within each group are used to generate statistically average skeletal geometry for young and old females. In addition to the anatomic measures explicitly used in the parameterization scheme, key measures of rib cage depth and spine curvature are taken from both the underlying subject pool and from the resultant representative geometries. Statistically significant differences were seen between the young and old groups' spine and rib anatomic components, with no significant differences in local sternal geometry found. Vertebral segments in older females had higher angles relative to their inferior neighbors, providing a quantification of the kyphotic curvature known to be associated with age. Ribs in older females had greater end-to-end span, greater aspect ratio, and reduced out-of-plane deviation, producing an elongated and overall flatter curvature that leads to distal rib ends extending further anteriorly in older individuals. Combined differences in spine curvature and rib geometry led to an 18-mm difference in anterior placement of the sternum between young and old subjects. This study provides new geometric data regarding the variability in anthropometry of adult females with age and has utility in advancing the veracity of current human body models. A simplified scaffold representation of underlying 3-dimensional bones within the thorax is presented, and the reported young and old female parameter sets can be used to characterize the anatomic differences expected with age and to both validate and drive morphing algorithms for aged human body models. The modular approach taken allows model parameters to hold inherent and intuitive meaning, offering advantages over more generalized methods such as principal component analysis. Geometry can be assessed on a component level or a whole thorax level, and the parametric representation of thorax shape allows direct comparisons between the current study and other individuals or human body models.

Computationally efficient algorithm for high sampling-frequency operation of active noise control

NASA Astrophysics Data System (ADS)

Rout, Nirmal Kumar; Das, Debi Prasad; Panda, Ganapati

2015-05-01

In high sampling-frequency operation of active noise control (ANC) system the length of the secondary path estimate and the ANC filter are very long. This increases the computational complexity of the conventional filtered-x least mean square (FXLMS) algorithm. To reduce the computational complexity of long order ANC system using FXLMS algorithm, frequency domain block ANC algorithms have been proposed in past. These full block frequency domain ANC algorithms are associated with some disadvantages such as large block delay, quantization error due to computation of large size transforms and implementation difficulties in existing low-end DSP hardware. To overcome these shortcomings, the partitioned block ANC algorithm is newly proposed where the long length filters in ANC are divided into a number of equal partitions and suitably assembled to perform the FXLMS algorithm in the frequency domain. The complexity of this proposed frequency domain partitioned block FXLMS (FPBFXLMS) algorithm is quite reduced compared to the conventional FXLMS algorithm. It is further reduced by merging one fast Fourier transform (FFT)-inverse fast Fourier transform (IFFT) combination to derive the reduced structure FPBFXLMS (RFPBFXLMS) algorithm. Computational complexity analysis for different orders of filter and partition size are presented. Systematic computer simulations are carried out for both the proposed partitioned block ANC algorithms to show its accuracy compared to the time domain FXLMS algorithm.

On the origin of the cation templated self-assembly of uranyl-peroxide nanoclusters.

PubMed

Miró, Pere; Pierrefixe, Simon; Gicquel, Mickaël; Gil, Adrià; Bo, Carles

2010-12-22

Uranyl-peroxide nanoclusters display different topologies based on square, pentagonal and hexagonal building blocks. Computed complexation energies of different cations (Li(+), Na(+), K(+), Rb(+), and Cs(+)) with [UO(2)(O(2))(H(2)O)](n) (n = 4, 5, and 6) macrocycles suggest a strong cation templating effect. The inherent bent structure of a U-O(2)-U model dimer is demonstrated and justified through the analysis of its electronic structure, as well as of the inherent curvature of the four-, five-, and six-uranyl macrocyles. The curvature is enhaced by cation coordination, which is suggested to be the driving force for the self-assembly of the nanocapsules.

A Parallel Compact Multi-Dimensional Numerical Algorithm with Aeroacoustics Applications

NASA Technical Reports Server (NTRS)

Povitsky, Alex; Morris, Philip J.

1999-01-01

In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs (Partial Differential Equations) in a space-time domain. For this numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta temporal update. The most efficient direct method to compute spatial derivatives on a serial computer is a version of Gaussian elimination for narrow linear banded systems known as the Thomas algorithm. In a straightforward pipelined implementation of the Thomas algorithm processors are idle due to the forward and backward recurrences of the Thomas algorithm. To utilize processors during this time, we propose to use them for either non-local data independent computations, solving lines in the next spatial direction, or local data-dependent computations by the Runge-Kutta method. To achieve this goal, control of processor communication and computations by a static schedule is adopted. Thus, our parallel code is driven by a communication and computation schedule instead of the usual "creative, programming" approach. The obtained parallelization speed-up of the novel algorithm is about twice as much as that for the standard pipelined algorithm and close to that for the explicit DRP algorithm.

A parallel Jacobson-Oksman optimization algorithm. [parallel processing (computers)

NASA Technical Reports Server (NTRS)

Straeter, T. A.; Markos, A. T.

1975-01-01

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Algorithmic complexity of quantum capacity

NASA Astrophysics Data System (ADS)

Oskouei, Samad Khabbazi; Mancini, Stefano

2018-04-01

We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.

Efficient conjugate gradient algorithms for computation of the manipulator forward dynamics

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheid, Robert E.

1989-01-01

The applicability of conjugate gradient algorithms for computation of the manipulator forward dynamics is investigated. The redundancies in the previously proposed conjugate gradient algorithm are analyzed. A new version is developed which, by avoiding these redundancies, achieves a significantly greater efficiency. A preconditioned conjugate gradient algorithm is also presented. A diagonal matrix whose elements are the diagonal elements of the inertia matrix is proposed as the preconditioner. In order to increase the computational efficiency, an algorithm is developed which exploits the synergism between the computation of the diagonal elements of the inertia matrix and that required by the conjugate gradient algorithm.

Combined Effects of Flow Diverting Strategies and Parent Artery Curvature on Aneurysmal Hemodynamics: A CFD Study

PubMed Central

Yu, Ying; Lv, Nan; Wang, Shengzhang; Karmonik, Christof; Liu, Jian-Min; Huang, Qinghai

2015-01-01

Purpose Flow diverters (FD) are increasingly being considered for treating large or giant wide-neck aneurysms. Clinical outcome is highly variable and depends on the type of aneurysm, the flow diverting device and treatment strategies. The objective of this study was to analyze the effect of different flow diverting strategies together with parent artery curvature variations on altering intra-aneurysmal hemodynamics. Methods Four ideal intracranial aneurysm models with different parent artery curvature were constructed. Computational fluid dynamics (CFD) simulations of the hemodynamics before and after applying five types of flow diverting strategies (single FD, single FD with 5% and 10% packing density of coils, two FDs with 25% and 50% overlapping rate) were performed. Changes in pressure, wall shear stress (WSS), relative residence time (RRT), inflow velocity and inflow volume rate were calculated and compared. Results Each flow diverting strategy resulted in enhancement of RRT and reduction of normalized mean WSS, inflow volume rate and inflow velocity in various levels. Among them, 50% overlapped FD induced most effective hemodynamic changes in RRT and inflow volume rate. The mean pressure only slightly decreased after treatment. Regardless of the kind of implantation of FD, the mean pressure, inflow volume rate and inflow velocity increased and the RRT decreased as the curvature of the parent artery increased. Conclusions Of all flow diverting strategies, overlapping FDs induced most favorable hemodynamic changes. Hemodynamics alterations post treatment were substantially influenced by parent artery curvature. Our results indicate the need of an individualized flow diverting strategy that is tailored for a specific aneurysm. PMID:26398847

Emerging spatial curvature can resolve the tension between high-redshift CMB and low-redshift distance ladder measurements of the Hubble constant

NASA Astrophysics Data System (ADS)

Bolejko, Krzysztof

2018-05-01

The measurements of the Hubble constant reveal a tension between high-redshift (CMB) and low-redshift (distance ladder) constraints. So far neither observational systematics nor new physics has been successfully implemented to explain away this tension. This paper presents a new solution to the Hubble constant problem. The solution is based on the Simsilun simulation (relativistic simulation of the large scale structure of the Universe) with the ray-tracing algorithm implemented. The initial conditions for the Simsilun simulation were set up as perturbations around the Λ CDM model. However, unlike in the standard cosmological model (i.e., Λ CDM model +perturbations ), within the Simsilun simulation relativistic and nonlinear evolution of cosmic structures lead to the phenomenon of emerging spatial curvature, where the mean spatial curvature evolves from the spatial flatness of the early Universe towards the slightly curved present-day Universe. Consequently, the present-day expansion rate is slightly faster compared to the spatially flat Λ CDM model. The results of the ray-tracing analysis show that the Universe which starts with initial conditions consistent with the Planck constraints should have the Hubble constant H0=72.5 ±2.1 km s-1 Mpc-1 . When the Simsilun simulation was rerun with no inhomogeneities imposed, the Hubble constant inferred within such a homogeneous simulation was H0=68.1 ±2.0 km s-1 Mpc-1 . Thus, the inclusion of nonlinear relativistic evolution that leads to the emergence of the spatial curvature can explain why the low-redshift measurements favor higher values compared to the high-redshift constraints and alleviate the tension between the CMB and distance ladder measurements of the Hubble constant.

Geometrical modified nesbit corporoplasty to correct different types of penile curvature: description of the surgical procedure based on geometrical principles and long-term results.

PubMed

Vicini, P; Di Nicola, S; Antonini, G; De Berardinis, E; Gentile, V; De Marco, F

2016-11-01

We present the use of a modified corporoplasty, based on geometrical principles, to determine the exact site for the incision in the tunica or plaque and the exact amount of albuginea for overlaying to correct with extreme precision the different types of congenital or acquired penile curvature due to Peyronie's disease. To describe our experience with a new surgical procedure for the enhancement of penile curvature avoiding any overcorrection or undercorrection. Between March 2004 and April 2013, a total of 74 patients underwent the geometrical modified corporoplasty. All patients had congenital curvature until 90° or acquired stable penile curvature 'less' than 60°, that made sexual intercourse very difficult or impossible, normal erectile function, absence of hourglass or hinge effect. Preoperative testing included a physical examination, 3 photographs (frontal, dorsal and lateral) of penis during erection, a 10 mcg PGE1-induced erection and Doppler ultrasound, administration of the International Index of Erectile Function (IIEF-15) questionnaire. A follow-up with postoperative evaluation at 12 weeks, 12 and 24 months, included the same preoperative testing. Satisfaction rates were better assessed with the use of validated questionnaire such as the International Erectile Dysfunction Inventory of the Treatment Satisfaction (EDITS). Statistical analysis with Student's t-test was performed using commercially available, personal computer software. A total of 25 patients had congenital penile curvature with a mean deviation of 46.8° (range 40-90), another 49 patients had Peyronie's disease with a mean deviation of 58.4 (range 45-60). No major complications were reported. Postoperative correction of the curvature was achieved in all patients (100%). Neither undercorrection nor overcorrection were recorded. No significant relapse (curvature>15°) occurred in our patients. Shortening of the penis was reported by 74% but did not influence the high overall satisfaction of 92% (patients completely satisfied with their sexual life). The erectile function was analyzed in both groups, Student's t-test showed a significant improvement in erectile function, preoperative average IIEF-15 scores were 17.43±4.67, whereas postoperatively it was 22.57±4.83 (P=0.001). This geometrical modified Nesbit corporoplasty is a valid therapy which allows penile straightening. The geometric principles make the technique reproducible in multicentre studies.

Thermodynamic cost of computation, algorithmic complexity and the information metric

NASA Technical Reports Server (NTRS)

Zurek, W. H.

1989-01-01

Algorithmic complexity is discussed as a computational counterpart to the second law of thermodynamics. It is shown that algorithmic complexity, which is a measure of randomness, sets limits on the thermodynamic cost of computations and casts a new light on the limitations of Maxwell's demon. Algorithmic complexity can also be used to define distance between binary strings.

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

NASA Technical Reports Server (NTRS)

Povitsky, A.

1998-01-01

In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.

Quantification of motion of the thoracic aorta after ascending aortic repair of type-A dissection.

PubMed

Suh, Ga-Young; Fleischmann, Dominik; Beygui, Ramin E; Cheng, Christopher P

2017-05-01

To quantify cardiac and respiratory deformations of the thoracic aorta after ascending aortic graft repair. Eight patients were scanned with cardiac-resolved computed tomography angiography during inspiratory/expiratory breath-holds. Aortic centerlines and lumen were extracted to compute the arclength, curvature, angulation, and cross-section shape. From systole to diastole, the angle of graft [Formula: see text] arch increased by 2.4[Formula: see text] ± 1.8[Formula: see text] (P < 0.01) and the angle of arch [Formula: see text] descending aorta decreased by 2.4[Formula: see text] ± 2.6[Formula: see text] (P < 0.05), while the effective diameter of the proximal arch decreased by 2.4 ± 1.9% (P < 0.01), a greater change than those of the graft or distal arch (P < 0.05). From inspiration to expiration, the angle of graft [Formula: see text] arch increased by 2.8[Formula: see text] ± 2.6[Formula: see text] (P < 0.02) with the peak curvature increase (P < 0.05). Shorter graft length was correlated with greater cardiac-induced graft [Formula: see text] arch angulation, and longer graft length was correlated with greater respiratory-induced arch [Formula: see text] descending aorta angulation (R [Formula: see text] 0.50). The thoracic aorta changed curvature and angulation with cardiac and respiratory influences, driven by aortic root and arch motion. The thoracic aortic geometry and deformation are correlated with the ascending aortic graft length.

Predictions from star formation in the multiverse

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

Bousso, Raphael; Leichenauer, Stefan

2010-03-15

We compute trivariate probability distributions in the landscape, scanning simultaneously over the cosmological constant, the primordial density contrast, and spatial curvature. We consider two different measures for regulating the divergences of eternal inflation, and three different models for observers. In one model, observers are assumed to arise in proportion to the entropy produced by stars; in the others, they arise at a fixed time (5 or 10x10{sup 9} years) after star formation. The star formation rate, which underlies all our observer models, depends sensitively on the three scanning parameters. We employ a recently developed model of star formation in themore » multiverse, a considerable refinement over previous treatments of the astrophysical and cosmological properties of different pocket universes. For each combination of observer model and measure, we display all single and bivariate probability distributions, both with the remaining parameter(s) held fixed and marginalized. Our results depend only weakly on the observer model but more strongly on the measure. Using the causal diamond measure, the observed parameter values (or bounds) lie within the central 2{sigma} of nearly all probability distributions we compute, and always within 3{sigma}. This success is encouraging and rather nontrivial, considering the large size and dimension of the parameter space. The causal patch measure gives similar results as long as curvature is negligible. If curvature dominates, the causal patch leads to a novel runaway: it prefers a negative value of the cosmological constant, with the smallest magnitude available in the landscape.« less

Numerical computations of the dynamics of fluidic membranes and vesicles

NASA Astrophysics Data System (ADS)

Barrett, John W.; Garcke, Harald; Nürnberg, Robert

2015-11-01

Vesicles and many biological membranes are made of two monolayers of lipid molecules and form closed lipid bilayers. The dynamical behavior of vesicles is very complex and a variety of forms and shapes appear. Lipid bilayers can be considered as a surface fluid and hence the governing equations for the evolution include the surface (Navier-)Stokes equations, which in particular take the membrane viscosity into account. The evolution is driven by forces stemming from the curvature elasticity of the membrane. In addition, the surface fluid equations are coupled to bulk (Navier-)Stokes equations. We introduce a parametric finite-element method to solve this complex free boundary problem and present the first three-dimensional numerical computations based on the full (Navier-)Stokes system for several different scenarios. For example, the effects of the membrane viscosity, spontaneous curvature, and area difference elasticity (ADE) are studied. In particular, it turns out, that even in the case of no viscosity contrast between the bulk fluids, the tank treading to tumbling transition can be obtained by increasing the membrane viscosity. Besides the classical tank treading and tumbling motions, another mode (called the transition mode in this paper, but originally called the vacillating-breathing mode and subsequently also called trembling, transition, and swinging mode) separating these classical modes appears and is studied by us numerically. We also study how features of equilibrium shapes in the ADE and spontaneous curvature models, like budding behavior or starfish forms, behave in a shear flow.

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.

Parallel algorithms for computation of the manipulator inertia matrix

NASA Technical Reports Server (NTRS)

Amin-Javaheri, Masoud; Orin, David E.

1989-01-01

The development of an O(log2N) parallel algorithm for the manipulator inertia matrix is presented. It is based on the most efficient serial algorithm which uses the composite rigid body method. Recursive doubling is used to reformulate the linear recurrence equations which are required to compute the diagonal elements of the matrix. It results in O(log2N) levels of computation. Computation of the off-diagonal elements involves N linear recurrences of varying-size and a new method, which avoids redundant computation of position and orientation transforms for the manipulator, is developed. The O(log2N) algorithm is presented in both equation and graphic forms which clearly show the parallelism inherent in the algorithm.

Root Gravitropism: Quantification, Challenges, and Solutions.

PubMed

Muller, Lukas; Bennett, Malcolm J; French, Andy; Wells, Darren M; Swarup, Ranjan

2018-01-01

Better understanding of root traits such as root angle and root gravitropism will be crucial for development of crops with improved resource use efficiency. This chapter describes a high-throughput, automated image analysis method to trace Arabidopsis (Arabidopsis thaliana) seedling roots grown on agar plates. The method combines a "particle-filtering algorithm with a graph-based method" to trace the center line of a root and can be adopted for the analysis of several root parameters such as length, curvature, and stimulus from original root traces.

Shor's factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers

NASA Astrophysics Data System (ADS)

Gerjuoy, Edward

2005-06-01

The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (conventional) computers. In 1994 Peter Shor showed that for sufficiently large N, a quantum computer could perform the factoring with much less computational effort. This paper endeavors to explain, in a fashion comprehensible to the nonexpert, the RSA encryption protocol; the various quantum computer manipulations constituting the Shor algorithm; how the Shor algorithm performs the factoring; and the precise sense in which a quantum computer employing Shor's algorithm can be said to accomplish the factoring of very large numbers with less computational effort than a classical computer. It is made apparent that factoring N generally requires many successive runs of the algorithm. Our analysis reveals that the probability of achieving a successful factorization on a single run is about twice as large as commonly quoted in the literature.

Simulation of Stress-Strain State of Shovel Rotary Support Kingpin

NASA Astrophysics Data System (ADS)

Khoreshok, A. A.; Buyankin, P. V.; Vorobiev, A. V.; Dronov, A. A.

2016-04-01

The article presents the sequence of computational simulation of stress-strain state of shovel’s rotary support. Computation results are analyzed, the kingpin is specified as the most loaded element, maximum stress zones are identified. Kingpin design modification such as enhancement of fillet curvature radius to 25 mm and displacement of eyebolt holes on the diameter of 165 mm are proposed, thus diminishing impact of stress concentrators and improving reliability of the rotary support.

Algorithm-Based Fault Tolerance Integrated with Replication

NASA Technical Reports Server (NTRS)

Some, Raphael; Rennels, David

2008-01-01

In a proposed approach to programming and utilization of commercial off-the-shelf computing equipment, a combination of algorithm-based fault tolerance (ABFT) and replication would be utilized to obtain high degrees of fault tolerance without incurring excessive costs. The basic idea of the proposed approach is to integrate ABFT with replication such that the algorithmic portions of computations would be protected by ABFT, and the logical portions by replication. ABFT is an extremely efficient, inexpensive, high-coverage technique for detecting and mitigating faults in computer systems used for algorithmic computations, but does not protect against errors in logical operations surrounding algorithms.

Impedance computed tomography using an adaptive smoothing coefficient algorithm.

PubMed

Suzuki, A; Uchiyama, A

2001-01-01

In impedance computed tomography, a fixed coefficient regularization algorithm has been frequently used to improve the ill-conditioning problem of the Newton-Raphson algorithm. However, a lot of experimental data and a long period of computation time are needed to determine a good smoothing coefficient because a good smoothing coefficient has to be manually chosen from a number of coefficients and is a constant for each iteration calculation. Thus, sometimes the fixed coefficient regularization algorithm distorts the information or fails to obtain any effect. In this paper, a new adaptive smoothing coefficient algorithm is proposed. This algorithm automatically calculates the smoothing coefficient from the eigenvalue of the ill-conditioned matrix. Therefore, the effective images can be obtained within a short computation time. Also the smoothing coefficient is automatically adjusted by the information related to the real resistivity distribution and the data collection method. In our impedance system, we have reconstructed the resistivity distributions of two phantoms using this algorithm. As a result, this algorithm only needs one-fifth the computation time compared to the fixed coefficient regularization algorithm. When compared to the fixed coefficient regularization algorithm, it shows that the image is obtained more rapidly and applicable in real-time monitoring of the blood vessel.

Multifocus image fusion scheme based on the multiscale curvature in nonsubsampled contourlet transform domain

NASA Astrophysics Data System (ADS)

Li, Xiaosong; Li, Huafeng; Yu, Zhengtao; Kong, Yingchun

2015-07-01

An efficient multifocus image fusion scheme in nonsubsampled contourlet transform (NSCT) domain is proposed. Based on the property of optical imaging and the theory of defocused image, we present a selection principle for lowpass frequency coefficients and also investigate the connection between a low-frequency image and the defocused image. Generally, the NSCT algorithm decomposes detail image information indwells in different scales and different directions in the bandpass subband coefficient. In order to correctly pick out the prefused bandpass directional coefficients, we introduce multiscale curvature, which not only inherits the advantages of windows with different sizes, but also correctly recognizes the focused pixels from source images, and then develop a new fusion scheme of the bandpass subband coefficients. The fused image can be obtained by inverse NSCT with the different fused coefficients. Several multifocus image fusion methods are compared with the proposed scheme. The experimental results clearly indicate the validity and superiority of the proposed scheme in terms of both the visual qualities and the quantitative evaluation.

QCCM Center for Quantum Algorithms

DTIC Science & Technology

2008-10-17

algorithms (e.g., quantum walks and adiabatic computing ), as well as theoretical advances relating algorithms to physical implementations (e.g...Park, NC 27709-2211 15. SUBJECT TERMS Quantum algorithms, quantum computing , fault-tolerant error correction Richard Cleve MITACS East Academic...0511200 Algebraic results on quantum automata A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, D. Thrien Theory of Computing Systems 39(2006

Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range.

PubMed

He, Chenlong; Feng, Zuren; Ren, Zhigang

2018-02-03

For Wireless Sensor Networks (WSNs), the Voronoi partition of a region is a challenging problem owing to the limited sensing ability of each sensor and the distributed organization of the network. In this paper, an algorithm is proposed for each sensor having a limited sensing range to compute its limited Voronoi cell autonomously, so that the limited Voronoi partition of the entire WSN is generated in a distributed manner. Inspired by Graham's Scan (GS) algorithm used to compute the convex hull of a point set, the limited Voronoi cell of each sensor is obtained by sequentially scanning two consecutive bisectors between the sensor and its neighbors. The proposed algorithm called the Boundary Scan (BS) algorithm has a lower computational complexity than the existing Range-Constrained Voronoi Cell (RCVC) algorithm and reaches the lower bound of the computational complexity of the algorithms used to solve the problem of this kind. Moreover, it also improves the time efficiency of a key step in the Adjust-Sensing-Radius (ASR) algorithm used to compute the exact Voronoi cell. Extensive numerical simulations are performed to demonstrate the correctness and effectiveness of the BS algorithm. The distributed realization of the BS combined with a localization algorithm in WSNs is used to justify the WSN nature of the proposed algorithm.

Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range

PubMed Central

Feng, Zuren; Ren, Zhigang

2018-01-01

For Wireless Sensor Networks (WSNs), the Voronoi partition of a region is a challenging problem owing to the limited sensing ability of each sensor and the distributed organization of the network. In this paper, an algorithm is proposed for each sensor having a limited sensing range to compute its limited Voronoi cell autonomously, so that the limited Voronoi partition of the entire WSN is generated in a distributed manner. Inspired by Graham’s Scan (GS) algorithm used to compute the convex hull of a point set, the limited Voronoi cell of each sensor is obtained by sequentially scanning two consecutive bisectors between the sensor and its neighbors. The proposed algorithm called the Boundary Scan (BS) algorithm has a lower computational complexity than the existing Range-Constrained Voronoi Cell (RCVC) algorithm and reaches the lower bound of the computational complexity of the algorithms used to solve the problem of this kind. Moreover, it also improves the time efficiency of a key step in the Adjust-Sensing-Radius (ASR) algorithm used to compute the exact Voronoi cell. Extensive numerical simulations are performed to demonstrate the correctness and effectiveness of the BS algorithm. The distributed realization of the BS combined with a localization algorithm in WSNs is used to justify the WSN nature of the proposed algorithm. PMID:29401649

Development and application of unified algorithms for problems in computational science

NASA Technical Reports Server (NTRS)

Shankar, Vijaya; Chakravarthy, Sukumar

1987-01-01

A framework is presented for developing computationally unified numerical algorithms for solving nonlinear equations that arise in modeling various problems in mathematical physics. The concept of computational unification is an attempt to encompass efficient solution procedures for computing various nonlinear phenomena that may occur in a given problem. For example, in Computational Fluid Dynamics (CFD), a unified algorithm will be one that allows for solutions to subsonic (elliptic), transonic (mixed elliptic-hyperbolic), and supersonic (hyperbolic) flows for both steady and unsteady problems. The objectives are: development of superior unified algorithms emphasizing accuracy and efficiency aspects; development of codes based on selected algorithms leading to validation; application of mature codes to realistic problems; and extension/application of CFD-based algorithms to problems in other areas of mathematical physics. The ultimate objective is to achieve integration of multidisciplinary technologies to enhance synergism in the design process through computational simulation. Specific unified algorithms for a hierarchy of gas dynamics equations and their applications to two other areas: electromagnetic scattering, and laser-materials interaction accounting for melting.

Navier-Stokes analysis and experimental data comparison of compressible flow within ducts

NASA Technical Reports Server (NTRS)

Harloff, G. J.; Reichert, B. A.; Sirbaugh, J. R.; Wellborn, S. R.

1992-01-01

Many aircraft employ ducts with centerline curvature or changing cross-sectional shape to join the engine with inlet and exhaust components. S-ducts convey air to the engine compressor from the intake and often decelerate the flow to achieve an acceptable Mach number at the engine compressor by increasing the cross-sectional area downstream. Circular-to-rectangular transition ducts are used on aircraft with rectangular exhaust nozzles to connect the engine and nozzle. To achieve maximum engine performance, the ducts should minimize flow total pressure loss and total pressure distortion at the duct exit. Changes in the curvature of the duct centerline or the duct cross-sectional shape give rise to streamline curvature which causes cross stream pressure gradients. Secondary flows can be caused by deflection of the transverse vorticity component of the boundary layer. This vortex tilting results in counter-rotating vortices. Additionally, the adverse streamwise pressure gradient caused by increasing cross-sectional area can lead to flow separation. Vortex pairs have been observed in the exit planes of both duct types. These vortices are due to secondary flows induced by pressure gradients resulting from streamline curvature. Regions of low total pressure are produced when the vortices convect boundary layer fluid into the main flow. The purpose of the present study is to predict the measured flow field in a diffusing S-duct and a circular-to-rectangular transition duct with a full Navier-Stokes computer program, PARC3D, and to compare the numerical predictions with new detailed experimental measurements. The work was undertaken to extend previous studies and to provide additional CFD validation data needed to help model flows with strong secondary flow and boundary layer separation. The S-duct computation extends the study of Smith et al, and Harloff et al, which concluded that the computation might be improved by using a finer grid and more advanced turbulence models. The present study compares results for both the Baldwin-Lomas and k-epsilon turbulence models and is conducted with a refined grid. For the transition duct, two inlet conditions were considered, the first with straight flow and the second with swirling flow. The first case permits examination of the effects of the geometric transition on the flow field, while the second case includes the rotational flow effect characteristic of a gas turbine engine.

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

NASA Technical Reports Server (NTRS)

Lee, C. S. G.; Chen, C. L.

1989-01-01

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Design of composite scaffolds and three-dimensional shape analysis for tissue-engineered ear

PubMed Central

Cervantes, Thomas M.; Bassett, Erik K.; Tseng, Alan; Kimura, Anya; Roscioli, Nick; Randolph, Mark A.; Vacanti, Joseph P.; Hadlock, Theresa A.; Gupta, Rajiv; Pomerantseva, Irina; Sundback, Cathryn A.

2013-01-01

Engineered cartilage is a promising option for auricular reconstruction. We have previously demonstrated that a titanium wire framework within a composite collagen ear-shaped scaffold helped to maintain the gross dimensions of the engineered ear after implantation, resisting the deformation forces encountered during neocartilage maturation and wound healing. The ear geometry was redesigned to achieve a more accurate aesthetic result when implanted subcutaneously in a nude rat model. A non-invasive method was developed to assess size and shape changes of the engineered ear in three dimensions. Computer models of the titanium framework were obtained from CT scans before and after implantation. Several parameters were measured including the overall length, width and depth, the minimum intrahelical distance and overall curvature values for each beam section within the framework. Local curvature values were measured to gain understanding of the bending forces experienced by the framework structure in situ. Length and width changed by less than 2%, whereas the depth decreased by approximately 8% and the minimum intrahelical distance changed by approximately 12%. Overall curvature changes identified regions most susceptible to deformation. Eighty-nine per cent of local curvature measurements experienced a bending moment less than 50 µN-m owing to deformation forces during implantation. These quantitative shape analysis results have identified opportunities to improve shape fidelity of engineered ear constructs. PMID:23904585

Skeletal development of hallucal tarsometatarsal joint curvature and angulation in extant apes and modern humans.

PubMed

Gill, Corey M; Bredella, Miriam A; DeSilva, Jeremy M

2015-11-01

The medial cuneiform, namely the curvature and angulation of its distal facet with metatarsal 1, is crucial as a stabilizer in bipedal locomotion and an axis upon which the great toe medially deviates during arboreal locomotion in extant apes. Previous work has shown that facet curvature and angulation in adult dry-bone specimens can distinguish African apes from Homo, and can even distinguish among species of Gorilla. This study provides the first ontogenetic assessment of medial cuneiform curvature and angulation in juvenile (n = 68) and adult specimens (n = 102) using computed tomography in humans and extant ape specimens, including Pongo. Our data find that modern human juveniles initially have a convex and slightly medially oriented osseous surface of the developing medial cuneiform distal facet that flattens and becomes more distally oriented with age. The same pattern (though of a different magnitude) occurs developmentally in the chimpanzee medial cuneiform, but not in Gorilla or Pongo, whose medial cuneiform facet angulation remains unchanged ontogenetically. These data suggest that the medial cuneiform ossifies in a distinguishable pattern between Pongo, Gorilla, Pan, and Homo, which may in part be due to subtle differences in the loading environment at the hallucal tarsometatarsal joint-a finding that has important implications for interpreting fossil medial cuneiforms. Copyright © 2015 Elsevier Ltd. All rights reserved.

Design of composite scaffolds and three-dimensional shape analysis for tissue-engineered ear.

PubMed

Cervantes, Thomas M; Bassett, Erik K; Tseng, Alan; Kimura, Anya; Roscioli, Nick; Randolph, Mark A; Vacanti, Joseph P; Hadlock, Theresa A; Gupta, Rajiv; Pomerantseva, Irina; Sundback, Cathryn A

2013-10-06

Engineered cartilage is a promising option for auricular reconstruction. We have previously demonstrated that a titanium wire framework within a composite collagen ear-shaped scaffold helped to maintain the gross dimensions of the engineered ear after implantation, resisting the deformation forces encountered during neocartilage maturation and wound healing. The ear geometry was redesigned to achieve a more accurate aesthetic result when implanted subcutaneously in a nude rat model. A non-invasive method was developed to assess size and shape changes of the engineered ear in three dimensions. Computer models of the titanium framework were obtained from CT scans before and after implantation. Several parameters were measured including the overall length, width and depth, the minimum intrahelical distance and overall curvature values for each beam section within the framework. Local curvature values were measured to gain understanding of the bending forces experienced by the framework structure in situ. Length and width changed by less than 2%, whereas the depth decreased by approximately 8% and the minimum intrahelical distance changed by approximately 12%. Overall curvature changes identified regions most susceptible to deformation. Eighty-nine per cent of local curvature measurements experienced a bending moment less than 50 µN-m owing to deformation forces during implantation. These quantitative shape analysis results have identified opportunities to improve shape fidelity of engineered ear constructs.

Low-power low-voltage superior-order curvature corrected voltage reference

NASA Astrophysics Data System (ADS)

Popa, Cosmin

2010-06-01

A complementary metal oxide semiconductor (CMOS) voltage reference with a logarithmic curvature-correction will be presented. The first-order compensation is realised using an original offset voltage follower (OVF) block as a proportional to absolute temperature (PTAT) voltage generator, with the advantages of reducing the silicon area and of increasing accuracy by replacing matched resistors with matched transistors. The new logarithmic curvature-correction technique will be implemented using an asymmetric differential amplifier (ADA) block for compensating the logarithmic temperature dependent term from the first-order compensated voltage reference. In order to increase the circuit accuracy, an original temperature-dependent current generator will be designed for computing the exact type of the implemented curvature-correction. The relatively small complexity of the current squarer allows an important increasing of the circuit accuracy that could be achieved by increasing the current generator complexity. As a result of operating most of the MOS transistors in weak inversion, the original proposed voltage reference could be valuable for low-power applications. The circuit is implemented in 0.35 μm CMOS technology and consumes only 60μA for t = 25°C, being supplied at the minimal supply voltage V DD = 1.75V. The temperature coefficient of the reference voltage is 8.7 ppm/°C, while the line sensitivity is 0.75 mV/V for a supply voltage between 1.75 V and 7 V.

Modeling of stress-induced curvature in surface-micromachined devices

NASA Astrophysics Data System (ADS)

Cowan, William D.; Bright, Victor M.; Elvin, Alex A.; Koester, David A.

1997-09-01

This paper compares measured to modeled stress-induced curvature of simple piston micromirrors. Two similar flexure-beam micromirror designs were fabricate using the 11th DARPA-supported multi-user MEMS processes (MUMPs) run. The test devices vary only in the MUMPs layers used for fabrication. In one case the mirror plate is the 1.5 micrometers thick Poly2 layer. The other mirror design employs stacked Poly1 and Poly2 layers for a total thickness of 3.5 micrometers . Both mirror structures are covered with the standard MUMPs metallization of approximately 200 angstrom of chromium and 0.5 micrometers of gold. Curvature of these devices was measured to within +/- 5 nm with a computer controlled microscope laser interferometer system. As intended, the increased thickness of the stacked polysilicon layers reduces the mirror curvature by a factor of 4. The two micromirror designs were modeled using IntelliCAD, a commercial CAD system for MEMS. The basis of analysis was the finite element method. Simulated results using MUMPs 11 film parameters showed qualitative agreement with measured data, but obvious quantitative differences. Subsequent remeasurement of the metal stress and use of the new value significantly improved model agreement with the measured data. The paper explores the effect of several film parameters on the modeled structures. Implications for MEMS film metrology, and test structures are considered.

Tools for Analyzing Computing Resource Management Strategies and Algorithms for SDR Clouds

NASA Astrophysics Data System (ADS)

Marojevic, Vuk; Gomez-Miguelez, Ismael; Gelonch, Antoni

2012-09-01

Software defined radio (SDR) clouds centralize the computing resources of base stations. The computing resource pool is shared between radio operators and dynamically loads and unloads digital signal processing chains for providing wireless communications services on demand. Each new user session request particularly requires the allocation of computing resources for executing the corresponding SDR transceivers. The huge amount of computing resources of SDR cloud data centers and the numerous session requests at certain hours of a day require an efficient computing resource management. We propose a hierarchical approach, where the data center is divided in clusters that are managed in a distributed way. This paper presents a set of computing resource management tools for analyzing computing resource management strategies and algorithms for SDR clouds. We use the tools for evaluating a different strategies and algorithms. The results show that more sophisticated algorithms can achieve higher resource occupations and that a tradeoff exists between cluster size and algorithm complexity.

A cross-disciplinary introduction to quantum annealing-based algorithms

NASA Astrophysics Data System (ADS)

Venegas-Andraca, Salvador E.; Cruz-Santos, William; McGeoch, Catherine; Lanzagorta, Marco

2018-04-01

A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics and computer science; hence this article presents a concise introduction to basic concepts from both fields that are used in annealing-based quantum computation, an alternative to the more familiar quantum gate model. We introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems. We introduce the structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems. An overview of the quantum annealing systems manufactured by D-Wave Systems is also presented.

A method of camera calibration with adaptive thresholding

NASA Astrophysics Data System (ADS)

Gao, Lei; Yan, Shu-hua; Wang, Guo-chao; Zhou, Chun-lei

2009-07-01

In order to calculate the parameters of the camera correctly, we must figure out the accurate coordinates of the certain points in the image plane. Corners are the important features in the 2D images. Generally speaking, they are the points that have high curvature and lie in the junction of different brightness regions of images. So corners detection has already widely used in many fields. In this paper we use the pinhole camera model and SUSAN corner detection algorithm to calibrate the camera. When using the SUSAN corner detection algorithm, we propose an approach to retrieve the gray difference threshold, adaptively. That makes it possible to pick up the right chessboard inner comers in all kinds of gray contrast. The experiment result based on this method was proved to be feasible.

Evolutionary Optimization of Centrifugal Nozzles for Organic Vapours

NASA Astrophysics Data System (ADS)

Persico, Giacomo

2017-03-01

This paper discusses the shape-optimization of non-conventional centrifugal turbine nozzles for Organic Rankine Cycle applications. The optimal aerodynamic design is supported by the use of a non-intrusive, gradient-free technique specifically developed for shape optimization of turbomachinery profiles. The method is constructed as a combination of a geometrical parametrization technique based on B-Splines, a high-fidelity and experimentally validated Computational Fluid Dynamic solver, and a surrogate-based evolutionary algorithm. The non-ideal gas behaviour featuring the flow of organic fluids in the cascades of interest is introduced via a look-up-table approach, which is rigorously applied throughout the whole optimization process. Two transonic centrifugal nozzles are considered, featuring very different loading and radial extension. The use of a systematic and automatic design method to such a non-conventional configuration highlights the character of centrifugal cascades; the blades require a specific and non-trivial definition of the shape, especially in the rear part, to avoid the onset of shock waves. It is shown that the optimization acts in similar way for the two cascades, identifying an optimal curvature of the blade that both provides a relevant increase of cascade performance and a reduction of downstream gradients.

An efficient mass-preserving interface-correction level set/ghost fluid method for droplet suspensions under depletion forces

NASA Astrophysics Data System (ADS)

Ge, Zhouyang; Loiseau, Jean-Christophe; Tammisola, Outi; Brandt, Luca

2018-01-01

Aiming for the simulation of colloidal droplets in microfluidic devices, we present here a numerical method for two-fluid systems subject to surface tension and depletion forces among the suspended droplets. The algorithm is based on an efficient solver for the incompressible two-phase Navier-Stokes equations, and uses a mass-conserving level set method to capture the fluid interface. The four novel ingredients proposed here are, firstly, an interface-correction level set (ICLS) method; global mass conservation is achieved by performing an additional advection near the interface, with a correction velocity obtained by locally solving an algebraic equation, which is easy to implement in both 2D and 3D. Secondly, we report a second-order accurate geometric estimation of the curvature at the interface and, thirdly, the combination of the ghost fluid method with the fast pressure-correction approach enabling an accurate and fast computation even for large density contrasts. Finally, we derive a hydrodynamic model for the interaction forces induced by depletion of surfactant micelles and combine it with a multiple level set approach to study short-range interactions among droplets in the presence of attracting forces.

Boattail juncture shaping for spin-stabilized rounds in supersonic flight

NASA Astrophysics Data System (ADS)

Jiajan, W.; Chue, R. S. M.; Nguyen, T.; Yu, S. C. M.

2015-03-01

In this paper, the effects of boattail junction shaping on aerodynamic drag and stability of supersonic spin-stabilized rounds are investigated using computational fluid dynamics. For a generic round body comprising of a secant-ogive nose, a cylindrical body and a conical boattail, the shaping technique was achieved by adding a convex surface of varying degrees of radius of curvature to the junction between the cylindrical body and the boattail. It was shown through numerical simulations that this shaping technique can provide a reduction in aerodynamic drag of up to 5.4 % without destabilizing the round bodies when the radius of curvature is less than 8.8 times the diameter of the cylindrical body. The more gradual change of the flow characteristics, e.g., the pressure over the convex surface, was identified as the main reason for the drag reduction. A unique aspect of the current work is that stability is treated as an integral part of the performance assessment. It was also found that the dynamic instability encountered at large radii of curvature is due to the Magnus effects.

Dark matter admixed strange quark stars in the Starobinsky model

NASA Astrophysics Data System (ADS)

Lopes, Ilídio; Panotopoulos, Grigoris

2018-01-01

We compute the mass-to-radius profiles for dark matter admixed strange quark stars in the Starobinsky model of modified gravity. For quark matter, we assume the MIT bag model, while self-interacting dark matter inside the star is modeled as a Bose-Einstein condensate with a polytropic equation of state. We numerically integrate the structure equations in the Einstein frame, adopting the two-fluid formalism, and we treat the curvature correction term nonperturbatively. The effects on the properties of the stars of the amount of dark matter as well as the higher curvature term are investigated. We find that strange quark stars (in agreement with current observational constraints) with the highest masses are equally affected by dark matter and modified gravity.

Complex strain fields

NASA Astrophysics Data System (ADS)

Bradshaw, P.

Computational techniques for accounting for extra strain rates, abnormal distributions of delta-U/delta-y, fluctuating strain rates, and the effects of body forces in modeling shear flows are discussed. Consideration is given to simple shears where the extra strain rate does not affect turbulence, thin shear layers, moderately thin shear layers, and strongly distorted flows. Attention is given to formulations based on the exact transport equations for Reynolds stress as derived from the time-averaged Navier-Stokes equations. Extra strain rates arise from curvature, lateral divergence, and bulk compression, with Coriolis forces accounting for the first, intensification of the spanwise vorticity for the second, and compression or dilation of the shear layer producing the third. The curvature forces, e.g., buoyancy and Coriolis forces, are responsible for hurricanes and tornadoes.

Massively parallel algorithms for real-time wavefront control of a dense adaptive optics system

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

Fijany, A.; Milman, M.; Redding, D.

1994-12-31

In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. The authors have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although, this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. They develop a novel algorithm,more » designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, this algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures. The authors also discuss two massively parallel, algorithmically specialized, architectures for low-cost and optimal implementation of the Fast Invariant Imbedding algorithm.« less

GeoBuilder: a geometric algorithm visualization and debugging system for 2D and 3D geometric computing.

PubMed

Wei, Jyh-Da; Tsai, Ming-Hung; Lee, Gen-Cher; Huang, Jeng-Hung; Lee, Der-Tsai

2009-01-01

Algorithm visualization is a unique research topic that integrates engineering skills such as computer graphics, system programming, database management, computer networks, etc., to facilitate algorithmic researchers in testing their ideas, demonstrating new findings, and teaching algorithm design in the classroom. Within the broad applications of algorithm visualization, there still remain performance issues that deserve further research, e.g., system portability, collaboration capability, and animation effect in 3D environments. Using modern technologies of Java programming, we develop an algorithm visualization and debugging system, dubbed GeoBuilder, for geometric computing. The GeoBuilder system features Java's promising portability, engagement of collaboration in algorithm development, and automatic camera positioning for tracking 3D geometric objects. In this paper, we describe the design of the GeoBuilder system and demonstrate its applications.

Exact parallel algorithms for some members of the traveling salesman problem family

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

Pekny, J.F.

1989-01-01

The traveling salesman problem and its many generalizations comprise one of the best known combinatorial optimization problem families. Most members of the family are NP-complete problems so that exact algorithms require an unpredictable and sometimes large computational effort. Parallel computers offer hope for providing the power required to meet these demands. A major barrier to applying parallel computers is the lack of parallel algorithms. The contributions presented in this thesis center around new exact parallel algorithms for the asymmetric traveling salesman problem (ATSP), prize collecting traveling salesman problem (PCTSP), and resource constrained traveling salesman problem (RCTSP). The RCTSP is amore » particularly difficult member of the family since finding a feasible solution is an NP-complete problem. An exact sequential algorithm is also presented for the directed hamiltonian cycle problem (DHCP). The DHCP algorithm is superior to current heuristic approaches and represents the first exact method applicable to large graphs. Computational results presented for each of the algorithms demonstrates the effectiveness of combining efficient algorithms with parallel computing methods. Performance statistics are reported for randomly generated ATSPs with 7,500 cities, PCTSPs with 200 cities, RCTSPs with 200 cities, DHCPs with 3,500 vertices, and assignment problems of size 10,000. Sequential results were collected on a Sun 4/260 engineering workstation, while parallel results were collected using a 14 and 100 processor BBN Butterfly Plus computer. The computational results represent the largest instances ever solved to optimality on any type of computer.« less

Symbolic Computation of Strongly Connected Components Using Saturation

NASA Technical Reports Server (NTRS)

Zhao, Yang; Ciardo, Gianfranco

2010-01-01

Finding strongly connected components (SCCs) in the state-space of discrete-state models is a critical task in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs constitutes a formidable challenge. This paper is concerned with computing the sets of states in SCCs or terminal SCCs of asynchronous systems. Because of its advantages in many applications, we employ saturation on two previously proposed approaches: the Xie-Beerel algorithm and transitive closure. First, saturation speeds up state-space exploration when computing each SCC in the Xie-Beerel algorithm. Then, our main contribution is a novel algorithm to compute the transitive closure using saturation. Experimental results indicate that our improved algorithms achieve a clear speedup over previous algorithms in some cases. With the help of the new transitive closure computation algorithm, up to 10(exp 150) SCCs can be explored within a few seconds.

A High Performance Cloud-Based Protein-Ligand Docking Prediction Algorithm

PubMed Central

Chen, Jui-Le; Yang, Chu-Sing

2013-01-01

The potential of predicting druggability for a particular disease by integrating biological and computer science technologies has witnessed success in recent years. Although the computer science technologies can be used to reduce the costs of the pharmaceutical research, the computation time of the structure-based protein-ligand docking prediction is still unsatisfied until now. Hence, in this paper, a novel docking prediction algorithm, named fast cloud-based protein-ligand docking prediction algorithm (FCPLDPA), is presented to accelerate the docking prediction algorithm. The proposed algorithm works by leveraging two high-performance operators: (1) the novel migration (information exchange) operator is designed specially for cloud-based environments to reduce the computation time; (2) the efficient operator is aimed at filtering out the worst search directions. Our simulation results illustrate that the proposed method outperforms the other docking algorithms compared in this paper in terms of both the computation time and the quality of the end result. PMID:23762864

Global stability analysis of axisymmetric boundary layer over a circular cylinder

NASA Astrophysics Data System (ADS)

Bhoraniya, Ramesh; Vinod, Narayanan

2018-05-01

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

Signature detection and matching for document image retrieval.

PubMed

Zhu, Guangyu; Zheng, Yefeng; Doermann, David; Jaeger, Stefan

2009-11-01

As one of the most pervasive methods of individual identification and document authentication, signatures present convincing evidence and provide an important form of indexing for effective document image processing and retrieval in a broad range of applications. However, detection and segmentation of free-form objects such as signatures from clustered background is currently an open document analysis problem. In this paper, we focus on two fundamental problems in signature-based document image retrieval. First, we propose a novel multiscale approach to jointly detecting and segmenting signatures from document images. Rather than focusing on local features that typically have large variations, our approach captures the structural saliency using a signature production model and computes the dynamic curvature of 2D contour fragments over multiple scales. This detection framework is general and computationally tractable. Second, we treat the problem of signature retrieval in the unconstrained setting of translation, scale, and rotation invariant nonrigid shape matching. We propose two novel measures of shape dissimilarity based on anisotropic scaling and registration residual error and present a supervised learning framework for combining complementary shape information from different dissimilarity metrics using LDA. We quantitatively study state-of-the-art shape representations, shape matching algorithms, measures of dissimilarity, and the use of multiple instances as query in document image retrieval. We further demonstrate our matching techniques in offline signature verification. Extensive experiments using large real-world collections of English and Arabic machine-printed and handwritten documents demonstrate the excellent performance of our approaches.

Geometry of the scalar sector

DOE PAGES

Alonso, Rodrigo; Jenkins, Elizabeth E.; Manohar, Aneesh V.

2016-08-17

The S-matrix of a quantum field theory is unchanged by field redefinitions, and so it only depends on geometric quantities such as the curvature of field space. Whether the Higgs multiplet transforms linearly or non-linearly under electroweak symmetry is a subtle question since one can make a coordinate change to convert a field that transforms linearly into one that transforms non-linearly. Renormalizability of the Standard Model (SM) does not depend on the choice of scalar fields or whether the scalar fields transform linearly or non-linearly under the gauge group, but only on the geometric requirement that the scalar field manifoldmore » M is flat. Standard Model Effective Field Theory (SMEFT) and Higgs Effective Field Theory (HEFT) have curved M, since they parametrize deviations from the flat SM case. We show that the HEFT Lagrangian can be written in SMEFT form if and only ifMhas a SU(2) L U(1) Y invariant fixed point. Experimental observables in HEFT depend on local geometric invariants of M such as sectional curvatures, which are of order 1/Λ 2 , where Λ is the EFT scale. We give explicit expressions for these quantities in terms of the structure constants for a general G → H symmetry breaking pattern. The one-loop radiative correction in HEFT is determined using a covariant expansion which preserves manifest invariance of M under coordinate redefinitions. The formula for the radiative correction is simple when written in terms of the curvature of M and the gauge curvature field strengths. We also extend the CCWZ formalism to non-compact groups, and generalize the HEFT curvature computation to the case of multiple singlet scalar fields.« less

Automated segmentation of knee and ankle regions of rats from CT images to quantify bone mineral density for monitoring treatments of rheumatoid arthritis

NASA Astrophysics Data System (ADS)

Cruz, Francisco; Sevilla, Raquel; Zhu, Joe; Vanko, Amy; Lee, Jung Hoon; Dogdas, Belma; Zhang, Weisheng

2014-03-01

Bone mineral density (BMD) obtained from a CT image is an imaging biomarker used pre-clinically for characterizing the Rheumatoid arthritis (RA) phenotype. We use this biomarker in animal studies for evaluating disease progression and for testing various compounds. In the current setting, BMD measurements are obtained manually by selecting the regions of interest from three-dimensional (3-D) CT images of rat legs, which results in a laborious and low-throughput process. Combining image processing techniques, such as intensity thresholding and skeletonization, with mathematical techniques in curve fitting and curvature calculations, we developed an algorithm for quick, consistent, and automatic detection of joints in large CT data sets. The implemented algorithm has reduced analysis time for a study with 200 CT images from 10 days to 3 days and has improved the robust detection of the obtained regions of interest compared with manual segmentation. This algorithm has been used successfully in over 40 studies.

MultiNest: Efficient and Robust Bayesian Inference

NASA Astrophysics Data System (ADS)

Feroz, F.; Hobson, M. P.; Bridges, M.

2011-09-01

We present further development and the first public release of our multimodal nested sampling algorithm, called MultiNest. This Bayesian inference tool calculates the evidence, with an associated error estimate, and produces posterior samples from distributions that may contain multiple modes and pronounced (curving) degeneracies in high dimensions. The developments presented here lead to further substantial improvements in sampling efficiency and robustness, as compared to the original algorithm presented in Feroz & Hobson (2008), which itself significantly outperformed existing MCMC techniques in a wide range of astrophysical inference problems. The accuracy and economy of the MultiNest algorithm is demonstrated by application to two toy problems and to a cosmological inference problem focusing on the extension of the vanilla LambdaCDM model to include spatial curvature and a varying equation of state for dark energy. The MultiNest software is fully parallelized using MPI and includes an interface to CosmoMC. It will also be released as part of the SuperBayeS package, for the analysis of supersymmetric theories of particle physics, at this http URL.

Wavespace-Based Coherent Deconvolution

NASA Technical Reports Server (NTRS)

Bahr, Christopher J.; Cattafesta, Louis N., III

2012-01-01

Array deconvolution is commonly used in aeroacoustic analysis to remove the influence of a microphone array's point spread function from a conventional beamforming map. Unfortunately, the majority of deconvolution algorithms assume that the acoustic sources in a measurement are incoherent, which can be problematic for some aeroacoustic phenomena with coherent, spatially-distributed characteristics. While several algorithms have been proposed to handle coherent sources, some are computationally intractable for many problems while others require restrictive assumptions about the source field. Newer generalized inverse techniques hold promise, but are still under investigation for general use. An alternate coherent deconvolution method is proposed based on a wavespace transformation of the array data. Wavespace analysis offers advantages over curved-wave array processing, such as providing an explicit shift-invariance in the convolution of the array sampling function with the acoustic wave field. However, usage of the wavespace transformation assumes the acoustic wave field is accurately approximated as a superposition of plane wave fields, regardless of true wavefront curvature. The wavespace technique leverages Fourier transforms to quickly evaluate a shift-invariant convolution. The method is derived for and applied to ideal incoherent and coherent plane wave fields to demonstrate its ability to determine magnitude and relative phase of multiple coherent sources. Multi-scale processing is explored as a means of accelerating solution convergence. A case with a spherical wave front is evaluated. Finally, a trailing edge noise experiment case is considered. Results show the method successfully deconvolves incoherent, partially-coherent, and coherent plane wave fields to a degree necessary for quantitative evaluation. Curved wave front cases warrant further investigation. A potential extension to nearfield beamforming is proposed.

Energy-Aware Computation Offloading of IoT Sensors in Cloudlet-Based Mobile Edge Computing.

PubMed

Ma, Xiao; Lin, Chuang; Zhang, Han; Liu, Jianwei

2018-06-15

Mobile edge computing is proposed as a promising computing paradigm to relieve the excessive burden of data centers and mobile networks, which is induced by the rapid growth of Internet of Things (IoT). This work introduces the cloud-assisted multi-cloudlet framework to provision scalable services in cloudlet-based mobile edge computing. Due to the constrained computation resources of cloudlets and limited communication resources of wireless access points (APs), IoT sensors with identical computation offloading decisions interact with each other. To optimize the processing delay and energy consumption of computation tasks, theoretic analysis of the computation offloading decision problem of IoT sensors is presented in this paper. In more detail, the computation offloading decision problem of IoT sensors is formulated as a computation offloading game and the condition of Nash equilibrium is derived by introducing the tool of a potential game. By exploiting the finite improvement property of the game, the Computation Offloading Decision (COD) algorithm is designed to provide decentralized computation offloading strategies for IoT sensors. Simulation results demonstrate that the COD algorithm can significantly reduce the system cost compared with the random-selection algorithm and the cloud-first algorithm. Furthermore, the COD algorithm can scale well with increasing IoT sensors.

Parallel Algorithms for Least Squares and Related Computations.

DTIC Science & Technology

1991-03-22

for dense computations in linear algebra . The work has recently been published in a general reference book on parallel algorithms by SIAM. AFO SR...written his Ph.D. dissertation with the principal investigator. (See publication 6.) • Parallel Algorithms for Dense Linear Algebra Computations. Our...and describe and to put into perspective a selection of the more important parallel algorithms for numerical linear algebra . We give a major new

CUDA Optimization Strategies for Compute- and Memory-Bound Neuroimaging Algorithms

PubMed Central

Lee, Daren; Dinov, Ivo; Dong, Bin; Gutman, Boris; Yanovsky, Igor; Toga, Arthur W.

2011-01-01

As neuroimaging algorithms and technology continue to grow faster than CPU performance in complexity and image resolution, data-parallel computing methods will be increasingly important. The high performance, data-parallel architecture of modern graphical processing units (GPUs) can reduce computational times by orders of magnitude. However, its massively threaded architecture introduces challenges when GPU resources are exceeded. This paper presents optimization strategies for compute- and memory-bound algorithms for the CUDA architecture. For compute-bound algorithms, the registers are reduced through variable reuse via shared memory and the data throughput is increased through heavier thread workloads and maximizing the thread configuration for a single thread block per multiprocessor. For memory-bound algorithms, fitting the data into the fast but limited GPU resources is achieved through reorganizing the data into self-contained structures and employing a multi-pass approach. Memory latencies are reduced by selecting memory resources whose cache performance are optimized for the algorithm's access patterns. We demonstrate the strategies on two computationally expensive algorithms and achieve optimized GPU implementations that perform up to 6× faster than unoptimized ones. Compared to CPU implementations, we achieve peak GPU speedups of 129× for the 3D unbiased nonlinear image registration technique and 93× for the non-local means surface denoising algorithm. PMID:21159404

CUDA optimization strategies for compute- and memory-bound neuroimaging algorithms.

PubMed

Lee, Daren; Dinov, Ivo; Dong, Bin; Gutman, Boris; Yanovsky, Igor; Toga, Arthur W

2012-06-01

As neuroimaging algorithms and technology continue to grow faster than CPU performance in complexity and image resolution, data-parallel computing methods will be increasingly important. The high performance, data-parallel architecture of modern graphical processing units (GPUs) can reduce computational times by orders of magnitude. However, its massively threaded architecture introduces challenges when GPU resources are exceeded. This paper presents optimization strategies for compute- and memory-bound algorithms for the CUDA architecture. For compute-bound algorithms, the registers are reduced through variable reuse via shared memory and the data throughput is increased through heavier thread workloads and maximizing the thread configuration for a single thread block per multiprocessor. For memory-bound algorithms, fitting the data into the fast but limited GPU resources is achieved through reorganizing the data into self-contained structures and employing a multi-pass approach. Memory latencies are reduced by selecting memory resources whose cache performance are optimized for the algorithm's access patterns. We demonstrate the strategies on two computationally expensive algorithms and achieve optimized GPU implementations that perform up to 6× faster than unoptimized ones. Compared to CPU implementations, we achieve peak GPU speedups of 129× for the 3D unbiased nonlinear image registration technique and 93× for the non-local means surface denoising algorithm. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

Conjugate Gradient Algorithms For Manipulator Simulation

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheid, Robert E.

1991-01-01

Report discusses applicability of conjugate-gradient algorithms to computation of forward dynamics of robotic manipulators. Rapid computation of forward dynamics essential to teleoperation and other advanced robotic applications. Part of continuing effort to find algorithms meeting requirements for increased computational efficiency and speed. Method used for iterative solution of systems of linear equations.

Interactive visualization of Earth and Space Science computations

NASA Technical Reports Server (NTRS)

Hibbard, William L.; Paul, Brian E.; Santek, David A.; Dyer, Charles R.; Battaiola, Andre L.; Voidrot-Martinez, Marie-Francoise

1994-01-01

Computers have become essential tools for scientists simulating and observing nature. Simulations are formulated as mathematical models but are implemented as computer algorithms to simulate complex events. Observations are also analyzed and understood in terms of mathematical models, but the number of these observations usually dictates that we automate analyses with computer algorithms. In spite of their essential role, computers are also barriers to scientific understanding. Unlike hand calculations, automated computations are invisible and, because of the enormous numbers of individual operations in automated computations, the relation between an algorithm's input and output is often not intuitive. This problem is illustrated by the behavior of meteorologists responsible for forecasting weather. Even in this age of computers, many meteorologists manually plot weather observations on maps, then draw isolines of temperature, pressure, and other fields by hand (special pads of maps are printed for just this purpose). Similarly, radiologists use computers to collect medical data but are notoriously reluctant to apply image-processing algorithms to that data. To these scientists with life-and-death responsibilities, computer algorithms are black boxes that increase rather than reduce risk. The barrier between scientists and their computations can be bridged by techniques that make the internal workings of algorithms visible and that allow scientists to experiment with their computations. Here we describe two interactive systems developed at the University of Wisconsin-Madison Space Science and Engineering Center (SSEC) that provide these capabilities to Earth and space scientists.

Implementation of Multispectral Image Classification on a Remote Adaptive Computer

NASA Technical Reports Server (NTRS)

Figueiredo, Marco A.; Gloster, Clay S.; Stephens, Mark; Graves, Corey A.; Nakkar, Mouna

1999-01-01

As the demand for higher performance computers for the processing of remote sensing science algorithms increases, the need to investigate new computing paradigms its justified. Field Programmable Gate Arrays enable the implementation of algorithms at the hardware gate level, leading to orders of m a,gnitude performance increase over microprocessor based systems. The automatic classification of spaceborne multispectral images is an example of a computation intensive application, that, can benefit from implementation on an FPGA - based custom computing machine (adaptive or reconfigurable computer). A probabilistic neural network is used here to classify pixels of of a multispectral LANDSAT-2 image. The implementation described utilizes Java client/server application programs to access the adaptive computer from a remote site. Results verify that a remote hardware version of the algorithm (implemented on an adaptive computer) is significantly faster than a local software version of the same algorithm implemented on a typical general - purpose computer).

Remote Sensing of Martian Terrain Hazards via Visually Salient Feature Detection

NASA Astrophysics Data System (ADS)

Al-Milli, S.; Shaukat, A.; Spiteri, C.; Gao, Y.

2014-04-01

The main objective of the FASTER remote sensing system is the detection of rocks on planetary surfaces by employing models that can efficiently characterise rocks in terms of semantic descriptions. The proposed technique abates some of the algorithmic limitations of existing methods with no training requirements, lower computational complexity and greater robustness towards visual tracking applications over long-distance planetary terrains. Visual saliency models inspired from biological systems help to identify important regions (such as rocks) in the visual scene. Surface rocks are therefore completely described in terms of their local or global conspicuity pop-out characteristics. These local and global pop-out cues are (but not limited to); colour, depth, orientation, curvature, size, luminance intensity, shape, topology etc. The currently applied methods follow a purely bottom-up strategy of visual attention for selection of conspicuous regions in the visual scene without any topdown control. Furthermore the choice of models used (tested and evaluated) are relatively fast among the state-of-the-art and have very low computational load. Quantitative evaluation of these state-ofthe- art models was carried out using benchmark datasets including the Surrey Space Centre Lab Testbed, Pangu generated images, RAL Space SEEKER and CNES Mars Yard datasets. The analysis indicates that models based on visually salient information in the frequency domain (SRA, SDSR, PQFT) are the best performing ones for detecting rocks in an extra-terrestrial setting. In particular the SRA model seems to be the most optimum of the lot especially that it requires the least computational time while keeping errors competitively low. The salient objects extracted using these models can then be merged with the Digital Elevation Models (DEMs) generated from the same navigation cameras in order to be fused to the navigation map thus giving a clear indication of the rock locations.

Postural Variables in Girls Practicing Volleyball

ERIC Educational Resources Information Center

Grabara, Malgorzata; Hadzik, Andrzej

2009-01-01

Study aim: To assess body posture of young female volleyball players in relation to their untrained mates. Material and methods: A group of 42 volleyball players and another of 43 untrained girls, all aged 13-16 years were studied with respect to their body posture indices by using computer posturography. Spinal angles and curvatures were…

The application of the mesh-free method in the numerical simulations of the higher-order continuum structures

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

Sun, Yuzhou, E-mail: yuzhousun@126.com; Chen, Gensheng; Li, Dongxia

2016-06-08

This paper attempts to study the application of mesh-free method in the numerical simulations of the higher-order continuum structures. A high-order bending beam considers the effect of the third-order derivative of deflections, and can be viewed as a one-dimensional higher-order continuum structure. The moving least-squares method is used to construct the shape function with the high-order continuum property, the curvature and the third-order derivative of deflections are directly interpolated with nodal variables and the second- and third-order derivative of the shape function, and the mesh-free computational scheme is establish for beams. The coupled stress theory is introduced to describe themore » special constitutive response of the layered rock mass in which the bending effect of thin layer is considered. The strain and the curvature are directly interpolated with the nodal variables, and the mesh-free method is established for the layered rock mass. The good computational efficiency is achieved based on the developed mesh-free method, and some key issues are discussed.« less

The experimental verification of a streamline curvature numerical analysis method applied to the flow through an axial flow fan

NASA Technical Reports Server (NTRS)

Pierzga, M. J.

1981-01-01

The experimental verification of an inviscid, incompressible through-flow analysis method is presented. The primary component of this method is an axisymmetric streamline curvature technique which is used to compute the hub-to-tip flow field of a given turbomachine. To analyze the flow field in the blade-to-blade plane of the machine, the potential flow solution of an infinite cascade of airfoils is also computed using a source model technique. To verify the accuracy of such an analysis method an extensive experimental verification investigation was conducted using an axial flow research fan. Detailed surveys of the blade-free regions of the machine along with intra-blade surveys using rotating pressure sensing probes and blade surface static pressure taps provide a one-to-one relationship between measured and predicted data. The results of this investigation indicate the ability of this inviscid analysis method to predict the design flow field of the axial flow fan test rotor to within a few percent of the measured values.

Direct numerical simulation of curved turbulent channel flow

NASA Technical Reports Server (NTRS)

Moser, R. D.; Moin, P.

1984-01-01

Low Reynolds number, mildly curved, turbulent channel flow has been simulated numerically without subgrid scale models. A new spectral numerical method developed for this problem was used, and the computations were performed with 2 million degrees of freedom. A variety of statistical and structural information has been extracted from the computed flow fields. These include mean velocity, turbulence stresses, velocity skewness, and flatness factors, space time correlations and spectra, all the terms in the Reynolds stress balance equations, and contour and vector plots of instantaneous velocity fields. The effects of curvature on this flow were determined by comparing the concave and convex sides of the channel. The observed effects are consistent with experimental observations for mild curvature. The most significant difference in the turbulence statistics between the concave and convex sides was in the Reynolds shear stress. This was accompanied by significant differences in the terms of the Reynolds shear stress balance equations. In addition, it was found that stationary Taylor-Gortler vortices were present and that they had a significant effect on the flow by contributing to the mean Reynolds shear stress, and by affecting the underlying turbulence.

Computer methods for sampling from the gamma distribution

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

Johnson, M.E.; Tadikamalla, P.R.

1978-01-01

Considerable attention has recently been directed at developing ever faster algorithms for generating gamma random variates on digital computers. This paper surveys the current state of the art including the leading algorithms of Ahrens and Dieter, Atkinson, Cheng, Fishman, Marsaglia, Tadikamalla, and Wallace. General random variate generation techniques are explained with reference to these gamma algorithms. Computer simulation experiments on IBM and CDC computers are reported.

RNA folding kinetics using Monte Carlo and Gillespie algorithms.

PubMed

Clote, Peter; Bayegan, Amir H

2018-04-01

RNA secondary structure folding kinetics is known to be important for the biological function of certain processes, such as the hok/sok system in E. coli. Although linear algebra provides an exact computational solution of secondary structure folding kinetics with respect to the Turner energy model for tiny ([Formula: see text]20 nt) RNA sequences, the folding kinetics for larger sequences can only be approximated by binning structures into macrostates in a coarse-grained model, or by repeatedly simulating secondary structure folding with either the Monte Carlo algorithm or the Gillespie algorithm. Here we investigate the relation between the Monte Carlo algorithm and the Gillespie algorithm. We prove that asymptotically, the expected time for a K-step trajectory of the Monte Carlo algorithm is equal to [Formula: see text] times that of the Gillespie algorithm, where [Formula: see text] denotes the Boltzmann expected network degree. If the network is regular (i.e. every node has the same degree), then the mean first passage time (MFPT) computed by the Monte Carlo algorithm is equal to MFPT computed by the Gillespie algorithm multiplied by [Formula: see text]; however, this is not true for non-regular networks. In particular, RNA secondary structure folding kinetics, as computed by the Monte Carlo algorithm, is not equal to the folding kinetics, as computed by the Gillespie algorithm, although the mean first passage times are roughly correlated. Simulation software for RNA secondary structure folding according to the Monte Carlo and Gillespie algorithms is publicly available, as is our software to compute the expected degree of the network of secondary structures of a given RNA sequence-see http://bioinformatics.bc.edu/clote/RNAexpNumNbors .

Zero-block mode decision algorithm for H.264/AVC.

PubMed

Lee, Yu-Ming; Lin, Yinyi

2009-03-01

In the previous paper , we proposed a zero-block intermode decision algorithm for H.264 video coding based upon the number of zero-blocks of 4 x 4 DCT coefficients between the current macroblock and the co-located macroblock. The proposed algorithm can achieve significant improvement in computation, but the computation performance is limited for high bit-rate coding. To improve computation efficiency, in this paper, we suggest an enhanced zero-block decision algorithm, which uses an early zero-block detection method to compute the number of zero-blocks instead of direct DCT and quantization (DCT/Q) calculation and incorporates two adequate decision methods into semi-stationary and nonstationary regions of a video sequence. In addition, the zero-block decision algorithm is also applied to the intramode prediction in the P frame. The enhanced zero-block decision algorithm brings out a reduction of average 27% of total encoding time compared to the zero-block decision algorithm.

Quantum rendering

NASA Astrophysics Data System (ADS)

Lanzagorta, Marco O.; Gomez, Richard B.; Uhlmann, Jeffrey K.

2003-08-01

In recent years, computer graphics has emerged as a critical component of the scientific and engineering process, and it is recognized as an important computer science research area. Computer graphics are extensively used for a variety of aerospace and defense training systems and by Hollywood's special effects companies. All these applications require the computer graphics systems to produce high quality renderings of extremely large data sets in short periods of time. Much research has been done in "classical computing" toward the development of efficient methods and techniques to reduce the rendering time required for large datasets. Quantum Computing's unique algorithmic features offer the possibility of speeding up some of the known rendering algorithms currently used in computer graphics. In this paper we discuss possible implementations of quantum rendering algorithms. In particular, we concentrate on the implementation of Grover's quantum search algorithm for Z-buffering, ray-tracing, radiosity, and scene management techniques. We also compare the theoretical performance between the classical and quantum versions of the algorithms.

A unifying framework for rigid multibody dynamics and serial and parallel computational issues

NASA Technical Reports Server (NTRS)

Fijany, Amir; Jain, Abhinandan

1989-01-01

A unifying framework for various formulations of the dynamics of open-chain rigid multibody systems is discussed. Their suitability for serial and parallel processing is assessed. The framework is based on the derivation of intrinsic, i.e., coordinate-free, equations of the algorithms which provides a suitable abstraction and permits a distinction to be made between the computational redundancy in the intrinsic and extrinsic equations. A set of spatial notation is used which allows the derivation of the various algorithms in a common setting and thus clarifies the relationships among them. The three classes of algorithms viz., O(n), O(n exp 2) and O(n exp 3) or the solution of the dynamics problem are investigated. Researchers begin with the derivation of O(n exp 3) algorithms based on the explicit computation of the mass matrix and it provides insight into the underlying basis of the O(n) algorithms. From a computational perspective, the optimal choice of a coordinate frame for the projection of the intrinsic equations is discussed and the serial computational complexity of the different algorithms is evaluated. The three classes of algorithms are also analyzed for suitability for parallel processing. It is shown that the problem belongs to the class of N C and the time and processor bounds are of O(log2/2(n)) and O(n exp 4), respectively. However, the algorithm that achieves the above bounds is not stable. Researchers show that the fastest stable parallel algorithm achieves a computational complexity of O(n) with O(n exp 4), respectively. However, the algorithm that achieves the above bounds is not stable. Researchers show that the fastest stable parallel algorithm achieves a computational complexity of O(n) with O(n exp 2) processors, and results from the parallelization of the O(n exp 3) serial algorithm.

Accuracy and speed in computing the Chebyshev collocation derivative

NASA Technical Reports Server (NTRS)

Don, Wai-Sun; Solomonoff, Alex

1991-01-01

We studied several algorithms for computing the Chebyshev spectral derivative and compare their roundoff error. For a large number of collocation points, the elements of the Chebyshev differentiation matrix, if constructed in the usual way, are not computed accurately. A subtle cause is is found to account for the poor accuracy when computing the derivative by the matrix-vector multiplication method. Methods for accurately computing the elements of the matrix are presented, and we find that if the entities of the matrix are computed accurately, the roundoff error of the matrix-vector multiplication is as small as that of the transform-recursion algorithm. Results of CPU time usage are shown for several different algorithms for computing the derivative by the Chebyshev collocation method for a wide variety of two-dimensional grid sizes on both an IBM and a Cray 2 computer. We found that which algorithm is fastest on a particular machine depends not only on the grid size, but also on small details of the computer hardware as well. For most practical grid sizes used in computation, the even-odd decomposition algorithm is found to be faster than the transform-recursion method.

Cloud computing task scheduling strategy based on improved differential evolution algorithm

NASA Astrophysics Data System (ADS)

Ge, Junwei; He, Qian; Fang, Yiqiu

2017-04-01

In order to optimize the cloud computing task scheduling scheme, an improved differential evolution algorithm for cloud computing task scheduling is proposed. Firstly, the cloud computing task scheduling model, according to the model of the fitness function, and then used improved optimization calculation of the fitness function of the evolutionary algorithm, according to the evolution of generation of dynamic selection strategy through dynamic mutation strategy to ensure the global and local search ability. The performance test experiment was carried out in the CloudSim simulation platform, the experimental results show that the improved differential evolution algorithm can reduce the cloud computing task execution time and user cost saving, good implementation of the optimal scheduling of cloud computing tasks.

Hardware Acceleration of Adaptive Neural Algorithms.

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

James, Conrad D.

As tradit ional numerical computing has faced challenges, researchers have turned towards alternative computing approaches to reduce power - per - computation metrics and improve algorithm performance. Here, we describe an approach towards non - conventional computing that strengthens the connection between machine learning and neuroscience concepts. The Hardware Acceleration of Adaptive Neural Algorithms (HAANA) project ha s develop ed neural machine learning algorithms and hardware for applications in image processing and cybersecurity. While machine learning methods are effective at extracting relevant features from many types of data, the effectiveness of these algorithms degrades when subjected to real - worldmore » conditions. Our team has generated novel neural - inspired approa ches to improve the resiliency and adaptability of machine learning algorithms. In addition, we have also designed and fabricated hardware architectures and microelectronic devices specifically tuned towards the training and inference operations of neural - inspired algorithms. Finally, our multi - scale simulation framework allows us to assess the impact of microelectronic device properties on algorithm performance.« less

A Discussion of Using a Reconfigurable Processor to Implement the Discrete Fourier Transform

NASA Technical Reports Server (NTRS)

White, Michael J.

2004-01-01

This paper presents the design and implementation of the Discrete Fourier Transform (DFT) algorithm on a reconfigurable processor system. While highly applicable to many engineering problems, the DFT is an extremely computationally intensive algorithm. Consequently, the eventual goal of this work is to enhance the execution of a floating-point precision DFT algorithm by off loading the algorithm from the computing system. This computing system, within the context of this research, is a typical high performance desktop computer with an may of field programmable gate arrays (FPGAs). FPGAs are hardware devices that are configured by software to execute an algorithm. If it is desired to change the algorithm, the software is changed to reflect the modification, then download to the FPGA, which is then itself modified. This paper will discuss methodology for developing the DFT algorithm to be implemented on the FPGA. We will discuss the algorithm, the FPGA code effort, and the results to date.

A review of classification algorithms for EEG-based brain-computer interfaces.

PubMed

Lotte, F; Congedo, M; Lécuyer, A; Lamarche, F; Arnaldi, B

2007-06-01

In this paper we review classification algorithms used to design brain-computer interface (BCI) systems based on electroencephalography (EEG). We briefly present the commonly employed algorithms and describe their critical properties. Based on the literature, we compare them in terms of performance and provide guidelines to choose the suitable classification algorithm(s) for a specific BCI.

An efficient method to compute spurious end point contributions in PO solutions. [Physical Optics

NASA Technical Reports Server (NTRS)

Gupta, Inder J.; Burnside, Walter D.; Pistorius, Carl W. I.

1987-01-01

A method is given to compute the spurious endpoint contributions in the physical optics solution for electromagnetic scattering from conducting bodies. The method is applicable to general three-dimensional structures. The only information required to use the method is the radius of curvature of the body at the shadow boundary. Thus, the method is very efficient for numerical computations. As an illustration, the method is applied to several bodies of revolution to compute the endpoint contributions for backscattering in the case of axial incidence. It is shown that in high-frequency situations, the endpoint contributions obtained using the method are equal to the true endpoint contributions.

Sorting on STAR. [CDC computer algorithm timing comparison

NASA Technical Reports Server (NTRS)

Stone, H. S.

1978-01-01

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

Microscope self-calibration based on micro laser line imaging and soft computing algorithms

NASA Astrophysics Data System (ADS)

Apolinar Muñoz Rodríguez, J.

2018-06-01

A technique to perform microscope self-calibration via micro laser line and soft computing algorithms is presented. In this technique, the microscope vision parameters are computed by means of soft computing algorithms based on laser line projection. To implement the self-calibration, a microscope vision system is constructed by means of a CCD camera and a 38 μm laser line. From this arrangement, the microscope vision parameters are represented via Bezier approximation networks, which are accomplished through the laser line position. In this procedure, a genetic algorithm determines the microscope vision parameters by means of laser line imaging. Also, the approximation networks compute the three-dimensional vision by means of the laser line position. Additionally, the soft computing algorithms re-calibrate the vision parameters when the microscope vision system is modified during the vision task. The proposed self-calibration improves accuracy of the traditional microscope calibration, which is accomplished via external references to the microscope system. The capability of the self-calibration based on soft computing algorithms is determined by means of the calibration accuracy and the micro-scale measurement error. This contribution is corroborated by an evaluation based on the accuracy of the traditional microscope calibration.

Demonstration of a small programmable quantum computer with atomic qubits.

PubMed

Debnath, S; Linke, N M; Figgatt, C; Landsman, K A; Wright, K; Monroe, C

2016-08-04

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

Demonstration of a small programmable quantum computer with atomic qubits

NASA Astrophysics Data System (ADS)

Debnath, S.; Linke, N. M.; Figgatt, C.; Landsman, K. A.; Wright, K.; Monroe, C.

2016-08-01

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

Parallel conjugate gradient algorithms for manipulator dynamic simulation

NASA Technical Reports Server (NTRS)

Fijany, Amir; Scheld, Robert E.

1989-01-01

Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).

Maxillary canine morphology: comparative and descriptive analysis from periapical radiographs and cone beam computed tomography.

PubMed

Torres, Hianne Miranda de; Arruda, Julyanna Jacinto de; Silva-Filho, João Manoel da; Faria, Danielle Lago Bruno de; Nascimento, Monikelly Carmo Chagas; Torres, Érica Miranda de

2017-01-01

The anatomical characteristics of permanent maxillary canines were evaluated through visual examination, periapical radiography, and cone beam computed tomography (CBCT), and measurements obtained from the images and directly on the teeth were compared. Fifty extracted human maxillary canines were classified according to the side of the mouth. The direction of root curvature and location of the apical foramen were also verified. Periapical radiographs and CBCTs of the specimens were obtained. The number of root canals was verified. Tooth length and the mesiodistal and buccopalatal widths of the root were measured directly on the specimens as well as on the radiographs and CBCTs. Data were analyzed by chi-square testing and analysis of variance (α = 0.05). All teeth-26 (52%) from the right side of the dental arch and 24 (48%) from the left-had only 1 main canal each. The apical foramen was located exactly in the root apex in 34 teeth (68%). Root curvature toward the distal side was observed in the apical third in 23 teeth (46%). There were no statistically significant differences between the canines' arch side and either the foramen location (P = 0.104) or the root curvature (P = 0.215). No statistically significant differences were found in measurements of tooth length (P = 0.669), mesiodistal root width (P = 0.517), or buccopalatal root width (P = 0.672) obtained from specimens and images. Both CBCTs and periapical radiographs were reliable for determining the tooth length, mesiodistal root width, and buccopalatal root width of maxillary canines and produced statistically similar measurements.

Bio-inspired algorithms applied to molecular docking simulations.

PubMed

Heberlé, G; de Azevedo, W F

2011-01-01

Nature as a source of inspiration has been shown to have a great beneficial impact on the development of new computational methodologies. In this scenario, analyses of the interactions between a protein target and a ligand can be simulated by biologically inspired algorithms (BIAs). These algorithms mimic biological systems to create new paradigms for computation, such as neural networks, evolutionary computing, and swarm intelligence. This review provides a description of the main concepts behind BIAs applied to molecular docking simulations. Special attention is devoted to evolutionary algorithms, guided-directed evolutionary algorithms, and Lamarckian genetic algorithms. Recent applications of these methodologies to protein targets identified in the Mycobacterium tuberculosis genome are described.

Mental Computation or Standard Algorithm? Children's Strategy Choices on Multi-Digit Subtractions

ERIC Educational Resources Information Center

Torbeyns, Joke; Verschaffel, Lieven

2016-01-01

This study analyzed children's use of mental computation strategies and the standard algorithm on multi-digit subtractions. Fifty-eight Flemish 4th graders of varying mathematical achievement level were individually offered subtractions that either stimulated the use of mental computation strategies or the standard algorithm in one choice and two…

The application of dynamic programming in production planning

NASA Astrophysics Data System (ADS)

Wu, Run

2017-05-01

Nowadays, with the popularity of the computers, various industries and fields are widely applying computer information technology, which brings about huge demand for a variety of application software. In order to develop software meeting various needs with most economical cost and best quality, programmers must design efficient algorithms. A superior algorithm can not only soul up one thing, but also maximize the benefits and generate the smallest overhead. As one of the common algorithms, dynamic programming algorithms are used to solving problems with some sort of optimal properties. When solving problems with a large amount of sub-problems that needs repetitive calculations, the ordinary sub-recursive method requires to consume exponential time, and dynamic programming algorithm can reduce the time complexity of the algorithm to the polynomial level, according to which we can conclude that dynamic programming algorithm is a very efficient compared to other algorithms reducing the computational complexity and enriching the computational results. In this paper, we expound the concept, basic elements, properties, core, solving steps and difficulties of the dynamic programming algorithm besides, establish the dynamic programming model of the production planning problem.

Computationally efficient multibody simulations

NASA Technical Reports Server (NTRS)

Ramakrishnan, Jayant; Kumar, Manoj

1994-01-01

Computationally efficient approaches to the solution of the dynamics of multibody systems are presented in this work. The computational efficiency is derived from both the algorithmic and implementational standpoint. Order(n) approaches provide a new formulation of the equations of motion eliminating the assembly and numerical inversion of a system mass matrix as required by conventional algorithms. Computational efficiency is also gained in the implementation phase by the symbolic processing and parallel implementation of these equations. Comparison of this algorithm with existing multibody simulation programs illustrates the increased computational efficiency.

Determination of trunk streams via using flow accumulation values

NASA Astrophysics Data System (ADS)

Farek, Vladimir

2013-04-01

There is often a problem, with schematisation of catchments and a channel networks in a broken relief like sandstone landscape (with high vertical segmentation, narrow valley lines, crags, sheer rocks, endorheic hollows etc.). Usual hydrological parameters (subcatchment areas, altitude of highest point of subcatchment, water discharge), which are mostly used for determination of trunk stream upstream the junction, are frequently not utilizable very well in this kind of relief. We found, that for small, relatively homogeneous catchments (within the meaning of land-use, geological subsurface, anthropogenic influence etc.), which are extremely shaped, the value called "flow accumulation" (FA) could be very useful. This value gives the number of cells of the Digital Elevation Model (DEM) grid, which are drained to each cell of the catchment. We can predict that the stream channel with higher values of flow accumulation represents the main stream. There are three crucial issues with this theory. At first it is necessary to find the most suitable algorithm for calculation flow accumulation in a broken relief. Various algorithms could have complications with correct flow routing (representation of divergent or convergent character of the flow), or with keeping the flow paths uninterrupted. Relief with high curvature changes (alternating concave/convex shapes, high steepness changes) causes interrupting of flow lines in many algorithms used for hydrological computing. Second - set down limits of this theory (e.g. the size and character of a surveyed catchment). Third - verify this theory in reality. We tested this theory on sandstone landscape of National park Czech Switzerland. The main data source were high-resolution LIDAR (Light Detection and Ranging) DEM snapshots of surveyed area. This data comes from TU Dresden project called Genesis (Geoinformation Networks For The Cross- Border National Park Region Saxon- Bohemian Switzerland). In order to solve these issues GIS applications (e. g. GIS GRASS and its hydrological modules like r.terraflow, r.watershed, r.flow etc.) are very useful. Key words: channel network, flow accumulation, Digital Elevation Model, LIDAR, broken relief, GIS GRASS

Registration of prone and supine CT colonography scans using correlation optimized warping and canonical correlation analysis

PubMed Central

Wang, Shijun; Yao, Jianhua; Liu, Jiamin; Petrick, Nicholas; Van Uitert, Robert L.; Periaswamy, Senthil; Summers, Ronald M.

2009-01-01

Purpose: In computed tomographic colonography (CTC), a patient will be scanned twice—Once supine and once prone—to improve the sensitivity for polyp detection. To assist radiologists in CTC reading, in this paper we propose an automated method for colon registration from supine and prone CTC scans. Methods: We propose a new colon centerline registration method for prone and supine CTC scans using correlation optimized warping (COW) and canonical correlation analysis (CCA) based on the anatomical structure of the colon. Four anatomical salient points on the colon are first automatically distinguished. Then correlation optimized warping is applied to the segments defined by the anatomical landmarks to improve the global registration based on local correlation of segments. The COW method was modified by embedding canonical correlation analysis to allow multiple features along the colon centerline to be used in our implementation. Results: We tested the COW algorithm on a CTC data set of 39 patients with 39 polyps (19 training and 20 test cases) to verify the effectiveness of the proposed COW registration method. Experimental results on the test set show that the COW method significantly reduces the average estimation error in a polyp location between supine and prone scans by 67.6%, from 46.27±52.97 to 14.98 mm±11.41 mm, compared to the normalized distance along the colon centerline algorithm (p<0.01). Conclusions: The proposed COW algorithm is more accurate for the colon centerline registration compared to the normalized distance along the colon centerline method and the dynamic time warping method. Comparison results showed that the feature combination of z-coordinate and curvature achieved lowest registration error compared to the other feature combinations used by COW. The proposed method is tolerant to centerline errors because anatomical landmarks help prevent the propagation of errors across the entire colon centerline. PMID:20095272

Registration of prone and supine CT colonography scans using correlation optimized warping and canonical correlation analysis

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

Wang Shijun; Yao Jianhua; Liu Jiamin

Purpose: In computed tomographic colonography (CTC), a patient will be scanned twice--Once supine and once prone--to improve the sensitivity for polyp detection. To assist radiologists in CTC reading, in this paper we propose an automated method for colon registration from supine and prone CTC scans. Methods: We propose a new colon centerline registration method for prone and supine CTC scans using correlation optimized warping (COW) and canonical correlation analysis (CCA) based on the anatomical structure of the colon. Four anatomical salient points on the colon are first automatically distinguished. Then correlation optimized warping is applied to the segments defined bymore » the anatomical landmarks to improve the global registration based on local correlation of segments. The COW method was modified by embedding canonical correlation analysis to allow multiple features along the colon centerline to be used in our implementation. Results: We tested the COW algorithm on a CTC data set of 39 patients with 39 polyps (19 training and 20 test cases) to verify the effectiveness of the proposed COW registration method. Experimental results on the test set show that the COW method significantly reduces the average estimation error in a polyp location between supine and prone scans by 67.6%, from 46.27{+-}52.97 to 14.98 mm{+-}11.41 mm, compared to the normalized distance along the colon centerline algorithm (p<0.01). Conclusions: The proposed COW algorithm is more accurate for the colon centerline registration compared to the normalized distance along the colon centerline method and the dynamic time warping method. Comparison results showed that the feature combination of z-coordinate and curvature achieved lowest registration error compared to the other feature combinations used by COW. The proposed method is tolerant to centerline errors because anatomical landmarks help prevent the propagation of errors across the entire colon centerline.« less

Designing a parallel evolutionary algorithm for inferring gene networks on the cloud computing environment.

PubMed

Lee, Wei-Po; Hsiao, Yu-Ting; Hwang, Wei-Che

2014-01-16

To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel computational framework, high quality solutions can be obtained within relatively short time. This integrated approach is a promising way for inferring large networks.

Designing a parallel evolutionary algorithm for inferring gene networks on the cloud computing environment

PubMed Central

2014-01-01

Background To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. Results This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Conclusions Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel computational framework, high quality solutions can be obtained within relatively short time. This integrated approach is a promising way for inferring large networks. PMID:24428926

Experimental quantum computing to solve systems of linear equations.

PubMed

Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

2013-06-07

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

A fast D.F.T. algorithm using complex integer transforms

NASA Technical Reports Server (NTRS)

Reed, I. S.; Truong, T. K.

1978-01-01

Winograd (1976) has developed a new class of algorithms which depend heavily on the computation of a cyclic convolution for computing the conventional DFT (discrete Fourier transform); this new algorithm, for a few hundred transform points, requires substantially fewer multiplications than the conventional FFT algorithm. Reed and Truong have defined a special class of finite Fourier-like transforms over GF(q squared), where q = 2 to the p power minus 1 is a Mersenne prime for p = 2, 3, 5, 7, 13, 17, 19, 31, 61. In the present paper it is shown that Winograd's algorithm can be combined with the aforementioned Fourier-like transform to yield a new algorithm for computing the DFT. A fast method for accurately computing the DFT of a sequence of complex numbers of very long transform-lengths is thus obtained.

Parallel, stochastic measurement of molecular surface area.

PubMed

Juba, Derek; Varshney, Amitabh

2008-08-01

Biochemists often wish to compute surface areas of proteins. A variety of algorithms have been developed for this task, but they are designed for traditional single-processor architectures. The current trend in computer hardware is towards increasingly parallel architectures for which these algorithms are not well suited. We describe a parallel, stochastic algorithm for molecular surface area computation that maps well to the emerging multi-core architectures. Our algorithm is also progressive, providing a rough estimate of surface area immediately and refining this estimate as time goes on. Furthermore, the algorithm generates points on the molecular surface which can be used for point-based rendering. We demonstrate a GPU implementation of our algorithm and show that it compares favorably with several existing molecular surface computation programs, giving fast estimates of the molecular surface area with good accuracy.

CCOMP: An efficient algorithm for complex roots computation of determinantal equations

NASA Astrophysics Data System (ADS)

Zouros, Grigorios P.

2018-01-01

In this paper a free Python algorithm, entitled CCOMP (Complex roots COMPutation), is developed for the efficient computation of complex roots of determinantal equations inside a prescribed complex domain. The key to the method presented is the efficient determination of the candidate points inside the domain which, in their close neighborhood, a complex root may lie. Once these points are detected, the algorithm proceeds to a two-dimensional minimization problem with respect to the minimum modulus eigenvalue of the system matrix. In the core of CCOMP exist three sub-algorithms whose tasks are the efficient estimation of the minimum modulus eigenvalues of the system matrix inside the prescribed domain, the efficient computation of candidate points which guarantee the existence of minima, and finally, the computation of minima via bound constrained minimization algorithms. Theoretical results and heuristics support the development and the performance of the algorithm, which is discussed in detail. CCOMP supports general complex matrices, and its efficiency, applicability and validity is demonstrated to a variety of microwave applications.

Cooperative combinatorial optimization: evolutionary computation case study.

PubMed

Burgin, Mark; Eberbach, Eugene

2008-01-01

This paper presents a formalization of the notion of cooperation and competition of multiple systems that work toward a common optimization goal of the population using evolutionary computation techniques. It is proved that evolutionary algorithms are more expressive than conventional recursive algorithms, such as Turing machines. Three classes of evolutionary computations are introduced and studied: bounded finite, unbounded finite, and infinite computations. Universal evolutionary algorithms are constructed. Such properties of evolutionary algorithms as completeness, optimality, and search decidability are examined. A natural extension of evolutionary Turing machine (ETM) model is proposed to properly reflect phenomena of cooperation and competition in the whole population.

A radiation scalar for numerical relativity.

PubMed

Beetle, Christopher; Burko, Lior M

2002-12-30

This Letter describes a scalar curvature invariant for general relativity with a certain, distinctive feature. While many such invariants exist, this one vanishes in regions of space-time which can be said unambiguously to contain no gravitational radiation. In more general regions which incontrovertibly support nontrivial radiation fields, it can be used to extract local, coordinate-independent information partially characterizing that radiation. While a clear, physical interpretation is possible only in such radiation zones, a simple algorithm can be given to extend the definition smoothly to generic regions of space-time.

Petascale self-consistent electromagnetic computations using scalable and accurate algorithms for complex structures

NASA Astrophysics Data System (ADS)

Cary, John R.; Abell, D.; Amundson, J.; Bruhwiler, D. L.; Busby, R.; Carlsson, J. A.; Dimitrov, D. A.; Kashdan, E.; Messmer, P.; Nieter, C.; Smithe, D. N.; Spentzouris, P.; Stoltz, P.; Trines, R. M.; Wang, H.; Werner, G. R.

2006-09-01

As the size and cost of particle accelerators escalate, high-performance computing plays an increasingly important role; optimization through accurate, detailed computermodeling increases performance and reduces costs. But consequently, computer simulations face enormous challenges. Early approximation methods, such as expansions in distance from the design orbit, were unable to supply detailed accurate results, such as in the computation of wake fields in complex cavities. Since the advent of message-passing supercomputers with thousands of processors, earlier approximations are no longer necessary, and it is now possible to compute wake fields, the effects of dampers, and self-consistent dynamics in cavities accurately. In this environment, the focus has shifted towards the development and implementation of algorithms that scale to large numbers of processors. So-called charge-conserving algorithms evolve the electromagnetic fields without the need for any global solves (which are difficult to scale up to many processors). Using cut-cell (or embedded) boundaries, these algorithms can simulate the fields in complex accelerator cavities with curved walls. New implicit algorithms, which are stable for any time-step, conserve charge as well, allowing faster simulation of structures with details small compared to the characteristic wavelength. These algorithmic and computational advances have been implemented in the VORPAL7 Framework, a flexible, object-oriented, massively parallel computational application that allows run-time assembly of algorithms and objects, thus composing an application on the fly.

A systematic investigation of computation models for predicting Adverse Drug Reactions (ADRs).

PubMed

Kuang, Qifan; Wang, MinQi; Li, Rong; Dong, YongCheng; Li, Yizhou; Li, Menglong

2014-01-01

Early and accurate identification of adverse drug reactions (ADRs) is critically important for drug development and clinical safety. Computer-aided prediction of ADRs has attracted increasing attention in recent years, and many computational models have been proposed. However, because of the lack of systematic analysis and comparison of the different computational models, there remain limitations in designing more effective algorithms and selecting more useful features. There is therefore an urgent need to review and analyze previous computation models to obtain general conclusions that can provide useful guidance to construct more effective computational models to predict ADRs. In the current study, the main work is to compare and analyze the performance of existing computational methods to predict ADRs, by implementing and evaluating additional algorithms that have been earlier used for predicting drug targets. Our results indicated that topological and intrinsic features were complementary to an extent and the Jaccard coefficient had an important and general effect on the prediction of drug-ADR associations. By comparing the structure of each algorithm, final formulas of these algorithms were all converted to linear model in form, based on this finding we propose a new algorithm called the general weighted profile method and it yielded the best overall performance among the algorithms investigated in this paper. Several meaningful conclusions and useful findings regarding the prediction of ADRs are provided for selecting optimal features and algorithms.

Modeling the dynamics of shape generation and sensing by proteins on lipid membranes

NASA Astrophysics Data System (ADS)

Walani, Nikhil; Arroyo, Marino

Lipid membranes are fluid surfaces with flexural resistance that interact with proteins to perform their function in a biological context. A set of these proteins are responsible for shaping the lipid membranes, or of sensing curvature. A large body of work has examined the curvature sensing and generation properties of these proteins. Even though such processes are fundamentally dynamical in cells and in in vitro reconstituted systems, theoretical and computational studies have largely focussed on equilibrium thermodynamics. In this work, we propose a theoretical framework based on Onsager's variational principle of irreversible thermodynamics that captures the dynamics of adsorption, diffusion, and shape generation or sensing of proteins on lipid surfaces. We acknowledge the funds from European Research Council CoG- 681434 to support this research.

Hydrodynamic coupling of particle inclusions embedded in curved lipid bilayer membranes

DOE PAGES

Sigurdsson, Jon Karl; Atzberger, Paul J.

2016-06-27

Here, we develop theory and computational methods to investigate particle inclusions embedded within curved lipid bilayer membranes. We consider the case of spherical lipid vesicles where inclusion particles are coupled through (i) intramembrane hydrodynamics, (ii) traction stresses with the external and trapped solvent fluid, and (iii) intermonolayer slip between the two leaflets of the bilayer. We investigate relative to flat membranes how the membrane curvature and topology augment hydrodynamic responses. We show how both the translational and rotational mobility of protein inclusions are effected by the membrane curvature, ratio of intramembrane viscosity to solvent viscosity, and intermonolayer slip. For generalmore » investigations of many-particle dynamics, we also discuss how our approaches can be used to treat the collective diffusion and hydrodynamic coupling within spherical bilayers.« less

Hydrodynamic coupling of particle inclusions embedded in curved lipid bilayer membranes

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

Sigurdsson, Jon Karl; Atzberger, Paul J.

Here, we develop theory and computational methods to investigate particle inclusions embedded within curved lipid bilayer membranes. We consider the case of spherical lipid vesicles where inclusion particles are coupled through (i) intramembrane hydrodynamics, (ii) traction stresses with the external and trapped solvent fluid, and (iii) intermonolayer slip between the two leaflets of the bilayer. We investigate relative to flat membranes how the membrane curvature and topology augment hydrodynamic responses. We show how both the translational and rotational mobility of protein inclusions are effected by the membrane curvature, ratio of intramembrane viscosity to solvent viscosity, and intermonolayer slip. For generalmore » investigations of many-particle dynamics, we also discuss how our approaches can be used to treat the collective diffusion and hydrodynamic coupling within spherical bilayers.« less

A curvature-corrected Kirchhoff formulation for radar sea-return from the near vertical

NASA Technical Reports Server (NTRS)

Jackson, F. C.

1974-01-01

A new theoretical treatment of the problem of electromagnetic wave scattering from a randomly rough surface is given. A high frequency correction to the Kirchhoff approximation is derived from a field integral equation for a perfectly conducting surface. The correction, which accounts for the effect of local surface curvature, is seen to be identical with an asymptotic form found by Fock (1945) for diffraction by a paraboloid. The corrected boundary values are substituted into the far field Stratton-Chu integral, and average backscattered powers are computed assuming the scattering surface is a homogeneous Gaussian process. Preliminary calculations for K(-4) ocean wave spectrum indicate a resonable modelling of polarization effects near the vertical, theta 45 deg. Correspondence with the results of small perturbation theory is shown.

The Simulation Study of Horizontal Axis Water Turbine Using Flow Simulation Solidworks Application

NASA Astrophysics Data System (ADS)

Prasetyo, H.; Budiana, EP; Tjahjana, DDDP; Hadi, S.

2018-02-01

The design of Horizontal Axis Water Turbine in pico hydro power plants involves many parameters. To simplify that, usually using computer simulation is applied. This research performs simulation process variation on turbine blade number, turbine blade curvature angle, turbine bucket angle and blocking system tilt angle. Those four variations were combined in order to obtain the best design of turbine. The study used Flow Simulation Solidworks application, and obtain data on turbine speed, pressure, force, and torque. However, this research focused on turbine torque value. The best design of turbine was obtained in the turbine with 6 blades, blade curvature angle of 65° and bucket angle of 10°, and blocking system tilt angle of 40°. In the best turbine, the produced torque value was 8.464 Nm.

Algorithm for space-time analysis of data on geomagnetic field

NASA Technical Reports Server (NTRS)

Kulanin, N. V.; Golokov, V. P. (Editor); Tyupkin, S. (Editor)

1984-01-01

The algorithm for the execution of the space-time analysis of data on geomagnetic fields is described. The primary constraints figuring in the specific realization of the algorithm on a computer stem exclusively from the limited possibilities of the computer involved. It is realized in the form of a program for the BESM-6 computer.

Generalization of the Lord-Wingersky Algorithm to Computing the Distribution of Summed Test Scores Based on Real-Number Item Scores

ERIC Educational Resources Information Center

Kim, Seonghoon

2013-01-01

With known item response theory (IRT) item parameters, Lord and Wingersky provided a recursive algorithm for computing the conditional frequency distribution of number-correct test scores, given proficiency. This article presents a generalized algorithm for computing the conditional distribution of summed test scores involving real-number item…

Fast algorithm for computing complex number-theoretic transforms

NASA Technical Reports Server (NTRS)

Reed, I. S.; Liu, K. Y.; Truong, T. K.

1977-01-01

A high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.

A Parallel Nonrigid Registration Algorithm Based on B-Spline for Medical Images.

PubMed

Du, Xiaogang; Dang, Jianwu; Wang, Yangping; Wang, Song; Lei, Tao

2016-01-01

The nonrigid registration algorithm based on B-spline Free-Form Deformation (FFD) plays a key role and is widely applied in medical image processing due to the good flexibility and robustness. However, it requires a tremendous amount of computing time to obtain more accurate registration results especially for a large amount of medical image data. To address the issue, a parallel nonrigid registration algorithm based on B-spline is proposed in this paper. First, the Logarithm Squared Difference (LSD) is considered as the similarity metric in the B-spline registration algorithm to improve registration precision. After that, we create a parallel computing strategy and lookup tables (LUTs) to reduce the complexity of the B-spline registration algorithm. As a result, the computing time of three time-consuming steps including B-splines interpolation, LSD computation, and the analytic gradient computation of LSD, is efficiently reduced, for the B-spline registration algorithm employs the Nonlinear Conjugate Gradient (NCG) optimization method. Experimental results of registration quality and execution efficiency on the large amount of medical images show that our algorithm achieves a better registration accuracy in terms of the differences between the best deformation fields and ground truth and a speedup of 17 times over the single-threaded CPU implementation due to the powerful parallel computing ability of Graphics Processing Unit (GPU).

Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation

PubMed Central

Gui, Zhipeng; Yu, Manzhu; Yang, Chaowei; Jiang, Yunfeng; Chen, Songqing; Xia, Jizhe; Huang, Qunying; Liu, Kai; Li, Zhenlong; Hassan, Mohammed Anowarul; Jin, Baoxuan

2016-01-01

Dust storm has serious disastrous impacts on environment, human health, and assets. The developments and applications of dust storm models have contributed significantly to better understand and predict the distribution, intensity and structure of dust storms. However, dust storm simulation is a data and computing intensive process. To improve the computing performance, high performance computing has been widely adopted by dividing the entire study area into multiple subdomains and allocating each subdomain on different computing nodes in a parallel fashion. Inappropriate allocation may introduce imbalanced task loads and unnecessary communications among computing nodes. Therefore, allocation is a key factor that may impact the efficiency of parallel process. An allocation algorithm is expected to consider the computing cost and communication cost for each computing node to minimize total execution time and reduce overall communication cost for the entire simulation. This research introduces three algorithms to optimize the allocation by considering the spatial and communicational constraints: 1) an Integer Linear Programming (ILP) based algorithm from combinational optimization perspective; 2) a K-Means and Kernighan-Lin combined heuristic algorithm (K&K) integrating geometric and coordinate-free methods by merging local and global partitioning; 3) an automatic seeded region growing based geometric and local partitioning algorithm (ASRG). The performance and effectiveness of the three algorithms are compared based on different factors. Further, we adopt the K&K algorithm as the demonstrated algorithm for the experiment of dust model simulation with the non-hydrostatic mesoscale model (NMM-dust) and compared the performance with the MPI default sequential allocation. The results demonstrate that K&K method significantly improves the simulation performance with better subdomain allocation. This method can also be adopted for other relevant atmospheric and numerical modeling. PMID:27044039

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

Sensitivity Analysis of Different Shapes of a Plastic Optical Fiber-Based Immunosensor for Escherichia coli: Simulation and Experimental Results.

PubMed

Rodrigues, Domingos M C; Lopes, Rafaela N; Franco, Marcos A R; Werneck, Marcelo M; Allil, Regina C S B

2017-12-19

Conventional pathogen detection methods require trained personnel, specialized laboratories and can take days to provide a result. Thus, portable biosensors with rapid detection response are vital for the current needs for in-loco quality assays. In this work the authors analyze the characteristics of an immunosensor based on the evanescent field in plastic optical fibers with macro curvature by comparing experimental with simulated results. The work studies different shapes of evanescent-wave based fiber optic sensors, adopting a computational modeling to evaluate the probes with the best sensitivity. The simulation showed that for a U-Shaped sensor, the best results can be achieved with a sensor of 980 µm diameter by 5.0 mm in curvature for refractive index sensing, whereas the meander-shaped sensor with 250 μm in diameter with radius of curvature of 1.5 mm, showed better sensitivity for either bacteria and refractive index (RI) sensing. Then, an immunosensor was developed, firstly to measure refractive index and after that, functionalized to detect Escherichia coli . Based on the results with the simulation, we conducted studies with a real sensor for RI measurements and for Escherichia coli detection aiming to establish the best diameter and curvature radius in order to obtain an optimized sensor. On comparing the experimental results with predictions made from the modelling, good agreements were obtained. The simulations performed allowed the evaluation of new geometric configurations of biosensors that can be easily constructed and that promise improved sensitivity.

Novel high-resolution computed tomography-based radiomic classifier for screen-identified pulmonary nodules in the National Lung Screening Trial.

PubMed

Peikert, Tobias; Duan, Fenghai; Rajagopalan, Srinivasan; Karwoski, Ronald A; Clay, Ryan; Robb, Richard A; Qin, Ziling; Sicks, JoRean; Bartholmai, Brian J; Maldonado, Fabien

2018-01-01

Optimization of the clinical management of screen-detected lung nodules is needed to avoid unnecessary diagnostic interventions. Herein we demonstrate the potential value of a novel radiomics-based approach for the classification of screen-detected indeterminate nodules. Independent quantitative variables assessing various radiologic nodule features such as sphericity, flatness, elongation, spiculation, lobulation and curvature were developed from the NLST dataset using 726 indeterminate nodules (all ≥ 7 mm, benign, n = 318 and malignant, n = 408). Multivariate analysis was performed using least absolute shrinkage and selection operator (LASSO) method for variable selection and regularization in order to enhance the prediction accuracy and interpretability of the multivariate model. The bootstrapping method was then applied for the internal validation and the optimism-corrected AUC was reported for the final model. Eight of the originally considered 57 quantitative radiologic features were selected by LASSO multivariate modeling. These 8 features include variables capturing Location: vertical location (Offset carina centroid z), Size: volume estimate (Minimum enclosing brick), Shape: flatness, Density: texture analysis (Score Indicative of Lesion/Lung Aggression/Abnormality (SILA) texture), and surface characteristics: surface complexity (Maximum shape index and Average shape index), and estimates of surface curvature (Average positive mean curvature and Minimum mean curvature), all with P<0.01. The optimism-corrected AUC for these 8 features is 0.939. Our novel radiomic LDCT-based approach for indeterminate screen-detected nodule characterization appears extremely promising however independent external validation is needed.

Computational complexities and storage requirements of some Riccati equation solvers

NASA Technical Reports Server (NTRS)

Utku, Senol; Garba, John A.; Ramesh, A. V.

1989-01-01

The linear optimal control problem of an nth-order time-invariant dynamic system with a quadratic performance functional is usually solved by the Hamilton-Jacobi approach. This leads to the solution of the differential matrix Riccati equation with a terminal condition. The bulk of the computation for the optimal control problem is related to the solution of this equation. There are various algorithms in the literature for solving the matrix Riccati equation. However, computational complexities and storage requirements as a function of numbers of state variables, control variables, and sensors are not available for all these algorithms. In this work, the computational complexities and storage requirements for some of these algorithms are given. These expressions show the immensity of the computational requirements of the algorithms in solving the Riccati equation for large-order systems such as the control of highly flexible space structures. The expressions are also needed to compute the speedup and efficiency of any implementation of these algorithms on concurrent machines.

Interfacing External Quantum Devices to a Universal Quantum Computer

PubMed Central

Lagana, Antonio A.; Lohe, Max A.; von Smekal, Lorenz

2011-01-01

We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer. PMID:22216276

Interfacing external quantum devices to a universal quantum computer.

PubMed

Lagana, Antonio A; Lohe, Max A; von Smekal, Lorenz

2011-01-01

We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer. © 2011 Lagana et al.

Plasmid mapping computer program.

PubMed Central

Nolan, G P; Maina, C V; Szalay, A A

1984-01-01

Three new computer algorithms are described which rapidly order the restriction fragments of a plasmid DNA which has been cleaved with two restriction endonucleases in single and double digestions. Two of the algorithms are contained within a single computer program (called MPCIRC). The Rule-Oriented algorithm, constructs all logical circular map solutions within sixty seconds (14 double-digestion fragments) when used in conjunction with the Permutation method. The program is written in Apple Pascal and runs on an Apple II Plus Microcomputer with 64K of memory. A third algorithm is described which rapidly maps double digests and uses the above two algorithms as adducts. Modifications of the algorithms for linear mapping are also presented. PMID:6320105

Computer aided flexible envelope designs

NASA Technical Reports Server (NTRS)

Resch, R. D.

1975-01-01

Computer aided design methods are presented for the design and construction of strong, lightweight structures which require complex and precise geometric definition. The first, flexible structures, is a unique system of modeling folded plate structures and space frames. It is possible to continuously vary the geometry of a space frame to produce large, clear spans with curvature. The second method deals with developable surfaces, where both folding and bending are explored with the observed constraint of available building materials, and what minimal distortion result in maximum design capability. Alternative inexpensive fabrication techniques are being developed to achieve computer defined enclosures which are extremely lightweight and mathematically highly precise.

Planetary Transmission Diagnostics

NASA Technical Reports Server (NTRS)

Lewicki, David G. (Technical Monitor); Samuel, Paul D.; Conroy, Joseph K.; Pines, Darryll J.

2004-01-01

This report presents a methodology for detecting and diagnosing gear faults in the planetary stage of a helicopter transmission. This diagnostic technique is based on the constrained adaptive lifting algorithm. The lifting scheme, developed by Wim Sweldens of Bell Labs, is a time domain, prediction-error realization of the wavelet transform that allows for greater flexibility in the construction of wavelet bases. Classic lifting analyzes a given signal using wavelets derived from a single fundamental basis function. A number of researchers have proposed techniques for adding adaptivity to the lifting scheme, allowing the transform to choose from a set of fundamental bases the basis that best fits the signal. This characteristic is desirable for gear diagnostics as it allows the technique to tailor itself to a specific transmission by selecting a set of wavelets that best represent vibration signals obtained while the gearbox is operating under healthy-state conditions. However, constraints on certain basis characteristics are necessary to enhance the detection of local wave-form changes caused by certain types of gear damage. The proposed methodology analyzes individual tooth-mesh waveforms from a healthy-state gearbox vibration signal that was generated using the vibration separation (synchronous signal-averaging) algorithm. Each waveform is separated into analysis domains using zeros of its slope and curvature. The bases selected in each analysis domain are chosen to minimize the prediction error, and constrained to have the same-sign local slope and curvature as the original signal. The resulting set of bases is used to analyze future-state vibration signals and the lifting prediction error is inspected. The constraints allow the transform to effectively adapt to global amplitude changes, yielding small prediction errors. However, local wave-form changes associated with certain types of gear damage are poorly adapted, causing a significant change in the prediction error. The constrained adaptive lifting diagnostic algorithm is validated using data collected from the University of Maryland Transmission Test Rig and the results are discussed.

Adaptive region-growing with maximum curvature strategy for tumor segmentation in 18F-FDG PET

NASA Astrophysics Data System (ADS)

Tan, Shan; Li, Laquan; Choi, Wookjin; Kang, Min Kyu; D'Souza, Warren D.; Lu, Wei

2017-07-01

Accurate tumor segmentation in PET is crucial in many oncology applications. We developed an adaptive region-growing (ARG) algorithm with a maximum curvature strategy (ARG_MC) for tumor segmentation in PET. The ARG_MC repeatedly applied a confidence connected region-growing algorithm with increasing relaxing factor f. The optimal relaxing factor (ORF) was then determined at the transition point on the f-volume curve, where the volume just grew from the tumor into the surrounding normal tissues. The ARG_MC along with five widely used algorithms were tested on a phantom with 6 spheres at different signal to background ratios and on two clinic datasets including 20 patients with esophageal cancer and 11 patients with non-Hodgkin lymphoma (NHL). The ARG_MC did not require any phantom calibration or any a priori knowledge of the tumor or PET scanner. The identified ORF varied with tumor types (mean ORF  =  9.61, 3.78 and 2.55 respectively for the phantom, esophageal cancer, and NHL datasets), and varied from one tumor to another. For the phantom, the ARG_MC ranked the second in segmentation accuracy with an average Dice similarity index (DSI) of 0.86, only slightly worse than Daisne’s adaptive thresholding method (DSI  =  0.87), which required phantom calibration. For both the esophageal cancer dataset and the NHL dataset, the ARG_MC had the highest accuracy with an average DSI of 0.87 and 0.84, respectively. The ARG_MC was robust to parameter settings and region of interest selection, and it did not depend on scanners, imaging protocols, or tumor types. Furthermore, the ARG_MC made no assumption about the tumor size or tumor uptake distribution, making it suitable for segmenting tumors with heterogeneous FDG uptake. In conclusion, the ARG_MC was accurate, robust and easy to use, it provides a highly potential tool for PET tumor segmentation in clinic.

Adaptive Region-Growing with Maximum Curvature Strategy for Tumor Segmentation in 18F-FDG PET

PubMed Central

Tan, Shan; Li, Laquan; Choi, Wookjin; Kang, Min Kyu; D’Souza, Warren D.; Lu, Wei

2017-01-01

Accurate tumor segmentation in PET is crucial in many oncology applications. We developed an adaptive region-growing (ARG) algorithm with a maximum curvature strategy (ARG_MC) for tumor segmentation in PET. The ARG_MC repeatedly applied a confidence connected region-growing (CCRG) algorithm with increasing relaxing factor f. The optimal relaxing factor (ORF) was then determined at the transition point on the f-volume curve, where the volume just grew from the tumor into the surrounding normal tissues. The ARG_MC along with five widely used algorithms were tested on a phantom with 6 spheres at different signal to background ratios and on two clinic datasets including 20 patients with esophageal cancer and 11 patients with non-Hodgkin lymphoma (NHL). The ARG_MC did not require any phantom calibration or any a priori knowledge of the tumor or PET scanner. The identified ORF varied with tumor types (mean ORF = 9.61, 3.78 and 2.55 respectively for the phantom, esophageal cancer, and NHL datasets), and varied from one tumor to another. For the phantom, the ARG_MC ranked the second in segmentation accuracy with an average Dice similarity index (DSI) of 0.86, only slightly worse than Daisne’s adaptive thresholding method (DSI=0.87), which required phantom calibration. For both the esophageal cancer dataset and the NHL dataset, the ARG_MC had the highest accuracy with an average DSI of 0.87 and 0.84, respectively. The ARG_MC was robust to parameter settings and region of interest selection, and it did not depend on scanners, imaging protocols, or tumor types. Furthermore, the ARG_MC made no assumption about the tumor size or tumor uptake distribution, making it suitable for segmenting tumors with heterogeneous FDG uptake. In conclusion, the ARG_MC was accurate, robust and easy to use, it provides a highly potential tool for PET tumor segmentation in clinic. PMID:28604372

Identification of damage in plates using full-field measurement with a continuously scanning laser Doppler vibrometer system

NASA Astrophysics Data System (ADS)

Chen, Da-Ming; Xu, Y. F.; Zhu, W. D.

2018-05-01

An effective and reliable damage identification method for plates with a continuously scanning laser Doppler vibrometer (CSLDV) system is proposed. A new constant-speed scan algorithm is proposed to create a two-dimensional (2D) scan trajectory and automatically scan a whole plate surface. Full-field measurement of the plate can be achieved by applying the algorithm to the CSLDV system. Based on the new scan algorithm, the demodulation method is extended from one dimension for beams to two dimensions for plates to obtain a full-field operating deflection shape (ODS) of the plate from velocity response measured by the CSLDV system. The full-field ODS of an associated undamaged plate is obtained by using polynomials with proper orders to fit the corresponding full-field ODS from the demodulation method. A curvature damage index (CDI) using differences between curvatures of ODSs (CODSs) associated with ODSs that are obtained by the demodulation method and the polynomial fit is proposed to identify damage. An auxiliary CDI obtained by averaging CDIs at different excitation frequencies is defined to further assist damage identification. An experiment of an aluminum plate with damage in the form of 10.5% thickness reduction in a damage area of 0.86% of the whole scan area is conducted to investigate the proposed method. Six frequencies close to natural frequencies of the plate and one randomly selected frequency are used as sinusoidal excitation frequencies. Two 2D scan trajectories, i.e., a horizontally moving 2D scan trajectory and a vertically moving 2D scan trajectory, are used to obtain ODSs, CODSs, and CDIs of the plate. The damage is successfully identified near areas with consistently high values of CDIs at different excitation frequencies along the two 2D scan trajectories; the damage area is also identified by auxiliary CDIs.