Cell boundary fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2011-04-19

An apparatus and program product determine a nodal fault along the boundary, or face, of a computing cell. Nodes on adjacent cell boundaries communicate with each other, and the communications are analyzed to determine if a node or connection is faulty.

Influence of twin boundaries on superconducting gap nodes in FeSe single crystal studied by STM/STS

NASA Astrophysics Data System (ADS)

Watashige, T.; Hanaguri, T.; Kohsaka, Y.; Iwaya, K.; Fu, Y.; Kasahara, S.; Watanabe, D.; Mizukami, Y.; Mikami, T.; Kawamoto, Y.; Kurata, S.; Shibauchi, T.; Matsuda, Y.; Böhmer, A. E.; Wolf, T.; Meingast, C.; Löhneysen, H. V.

2014-03-01

We performed scanning tunneling microscopy (STM) and spectroscopy (STS) measurements on high-quality FeSe single crystals grown by vapor transport technique to examine the superconducting-gap structure. In MBE-grown FeSe thin films, based on the V-shaped tunneling spectra, nodal superconductivity is suggested. It is interesting to investigate how the nodes are affected by various kinds of defects. We found that twin boundaries bring about drastic effects on the gap nodes. With approaching to the twin boundary, V-shaped spectra gradually change to U-shaped ones. Interestingly, in the area between the twin boundaries separated by about 30 nm, the gap node is completely lifted and there appears a finite gap over +/-0.4 meV. This unusual twin-boundary effect will give us a hint to elucidate the superconducting-gap structure.

Mesh Deformation Based on Fully Stressed Design: The Method and Two-Dimensional Examples

NASA Technical Reports Server (NTRS)

Hsu, Su-Yuen; Chang, Chau-Lyan

2007-01-01

Mesh deformation in response to redefined boundary geometry is a frequently encountered task in shape optimization and analysis of fluid-structure interaction. We propose a simple and concise method for deforming meshes defined with three-node triangular or four-node tetrahedral elements. The mesh deformation method is suitable for large boundary movement. The approach requires two consecutive linear elastic finite-element analyses of an isotropic continuum using a prescribed displacement at the mesh boundaries. The first analysis is performed with homogeneous elastic property and the second with inhomogeneous elastic property. The fully stressed design is employed with a vanishing Poisson s ratio and a proposed form of equivalent strain (modified Tresca equivalent strain) to calculate, from the strain result of the first analysis, the element-specific Young s modulus for the second analysis. The theoretical aspect of the proposed method, its convenient numerical implementation using a typical linear elastic finite-element code in conjunction with very minor extra coding for data processing, and results for examples of large deformation of two-dimensional meshes are presented in this paper. KEY WORDS: Mesh deformation, shape optimization, fluid-structure interaction, fully stressed design, finite-element analysis, linear elasticity, strain failure, equivalent strain, Tresca failure criterion

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

NASA Astrophysics Data System (ADS)

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

2011-12-01

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

MODFLOW–LGR—Documentation of ghost node local grid refinement (LGR2) for multiple areas and the boundary flow and head (BFH2) package

USGS Publications Warehouse

Mehl, Steffen W.; Hill, Mary C.

2013-01-01

This report documents the addition of ghost node Local Grid Refinement (LGR2) to MODFLOW-2005, the U.S. Geological Survey modular, transient, three-dimensional, finite-difference groundwater flow model. LGR2 provides the capability to simulate groundwater flow using multiple block-shaped higher-resolution local grids (a child model) within a coarser-grid parent model. LGR2 accomplishes this by iteratively coupling separate MODFLOW-2005 models such that heads and fluxes are balanced across the grid-refinement interface boundary. LGR2 can be used in two-and three-dimensional, steady-state and transient simulations and for simulations of confined and unconfined groundwater systems. Traditional one-way coupled telescopic mesh refinement methods can have large, often undetected, inconsistencies in heads and fluxes across the interface between two model grids. The iteratively coupled ghost-node method of LGR2 provides a more rigorous coupling in which the solution accuracy is controlled by convergence criteria defined by the user. In realistic problems, this can result in substantially more accurate solutions and require an increase in computer processing time. The rigorous coupling enables sensitivity analysis, parameter estimation, and uncertainty analysis that reflects conditions in both model grids. This report describes the method used by LGR2, evaluates accuracy and performance for two-and three-dimensional test cases, provides input instructions, and lists selected input and output files for an example problem. It also presents the Boundary Flow and Head (BFH2) Package, which allows the child and parent models to be simulated independently using the boundary conditions obtained through the iterative process of LGR2.

MODFLOW-2005, the U.S. Geological Survey modular ground-water model - documentation of shared node local grid refinement (LGR) and the boundary flow and head (BFH) package

USGS Publications Warehouse

Mehl, Steffen W.; Hill, Mary C.

2006-01-01

This report documents the addition of shared node Local Grid Refinement (LGR) to MODFLOW-2005, the U.S. Geological Survey modular, transient, three-dimensional, finite-difference ground-water flow model. LGR provides the capability to simulate ground-water flow using one block-shaped higher-resolution local grid (a child model) within a coarser-grid parent model. LGR accomplishes this by iteratively coupling two separate MODFLOW-2005 models such that heads and fluxes are balanced across the shared interfacing boundary. LGR can be used in two-and three-dimensional, steady-state and transient simulations and for simulations of confined and unconfined ground-water systems. Traditional one-way coupled telescopic mesh refinement (TMR) methods can have large, often undetected, inconsistencies in heads and fluxes across the interface between two model grids. The iteratively coupled shared-node method of LGR provides a more rigorous coupling in which the solution accuracy is controlled by convergence criteria defined by the user. In realistic problems, this can result in substantially more accurate solutions and require an increase in computer processing time. The rigorous coupling enables sensitivity analysis, parameter estimation, and uncertainty analysis that reflects conditions in both model grids. This report describes the method used by LGR, evaluates LGR accuracy and performance for two- and three-dimensional test cases, provides input instructions, and lists selected input and output files for an example problem. It also presents the Boundary Flow and Head (BFH) Package, which allows the child and parent models to be simulated independently using the boundary conditions obtained through the iterative process of LGR.

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

Frayce, D.; Khayat, R.E.; Derdouri, A.

The dual reciprocity boundary element method (DRBEM) is implemented to solve three-dimensional transient heat conduction problems in the presence of arbitrary sources, typically as these problems arise in materials processing. The DRBEM has a major advantage over conventional BEM, since it avoids the computation of volume integrals. These integrals stem from transient, nonlinear, and/or source terms. Thus there is no need to discretize the inner domain, since only a number of internal points are needed for the computation. The validity of the method is assessed upon comparison with results from benchmark problems where analytical solutions exist. There is generally goodmore » agreement. Comparison against finite element results is also favorable. Calculations are carried out in order to assess the influence of the number and location of internal nodes. The influence of the ratio of the numbers of internal to boundary nodes is also examined.« less

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

PubMed

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

2018-01-01

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

On simplified application of multidimensional Savitzky-Golay filters and differentiators

NASA Astrophysics Data System (ADS)

Shekhar, Chandra

2016-02-01

I propose a simplified approach for multidimensional Savitzky-Golay filtering, to enable its fast and easy implementation in scientific and engineering applications. The proposed method, which is derived from a generalized framework laid out by Thornley (D. J. Thornley, "Novel anisotropic multidimensional convolution filters for derivative estimation and reconstruction" in Proceedings of International Conference on Signal Processing and Communications, November 2007), first transforms any given multidimensional problem into a unique one, by transforming coordinates of the sampled data nodes to unity-spaced, uniform data nodes, and then performs filtering and calculates partial derivatives on the unity-spaced nodes. It is followed by transporting the calculated derivatives back onto the original data nodes by using the chain rule of differentiation. The burden to performing the most cumbersome task, which is to carry out the filtering and to obtain derivatives on the unity-spaced nodes, is almost eliminated by providing convolution coefficients for a number of convolution kernel sizes and polynomial orders, up to four spatial dimensions. With the availability of the convolution coefficients, the task of filtering at a data node reduces merely to multiplication of two known matrices. Simplified strategies to adequately address near-boundary data nodes and to calculate partial derivatives there are also proposed. Finally, the proposed methodologies are applied to a three-dimensional experimentally obtained data set, which shows that multidimensional Savitzky-Golay filters and differentiators perform well in both the internal and the near-boundary regions of the domain.

Practical implementation of tetrahedral mesh reconstruction in emission tomography

PubMed Central

Boutchko, R.; Sitek, A.; Gullberg, G. T.

2014-01-01

This paper presents a practical implementation of image reconstruction on tetrahedral meshes optimized for emission computed tomography with parallel beam geometry. Tetrahedral mesh built on a point cloud is a convenient image representation method, intrinsically three-dimensional and with a multi-level resolution property. Image intensities are defined at the mesh nodes and linearly interpolated inside each tetrahedron. For the given mesh geometry, the intensities can be computed directly from tomographic projections using iterative reconstruction algorithms with a system matrix calculated using an exact analytical formula. The mesh geometry is optimized for a specific patient using a two stage process. First, a noisy image is reconstructed on a finely-spaced uniform cloud. Then, the geometry of the representation is adaptively transformed through boundary-preserving node motion and elimination. Nodes are removed in constant intensity regions, merged along the boundaries, and moved in the direction of the mean local intensity gradient in order to provide higher node density in the boundary regions. Attenuation correction and detector geometric response are included in the system matrix. Once the mesh geometry is optimized, it is used to generate the final system matrix for ML-EM reconstruction of node intensities and for visualization of the reconstructed images. In dynamic PET or SPECT imaging, the system matrix generation procedure is performed using a quasi-static sinogram, generated by summing projection data from multiple time frames. This system matrix is then used to reconstruct the individual time frame projections. Performance of the new method is evaluated by reconstructing simulated projections of the NCAT phantom and the method is then applied to dynamic SPECT phantom and patient studies and to a dynamic microPET rat study. Tetrahedral mesh-based images are compared to the standard voxel-based reconstruction for both high and low signal-to-noise ratio projection datasets. The results demonstrate that the reconstructed images represented as tetrahedral meshes based on point clouds offer image quality comparable to that achievable using a standard voxel grid while allowing substantial reduction in the number of unknown intensities to be reconstructed and reducing the noise. PMID:23588373

Practical implementation of tetrahedral mesh reconstruction in emission tomography

NASA Astrophysics Data System (ADS)

Boutchko, R.; Sitek, A.; Gullberg, G. T.

2013-05-01

This paper presents a practical implementation of image reconstruction on tetrahedral meshes optimized for emission computed tomography with parallel beam geometry. Tetrahedral mesh built on a point cloud is a convenient image representation method, intrinsically three-dimensional and with a multi-level resolution property. Image intensities are defined at the mesh nodes and linearly interpolated inside each tetrahedron. For the given mesh geometry, the intensities can be computed directly from tomographic projections using iterative reconstruction algorithms with a system matrix calculated using an exact analytical formula. The mesh geometry is optimized for a specific patient using a two stage process. First, a noisy image is reconstructed on a finely-spaced uniform cloud. Then, the geometry of the representation is adaptively transformed through boundary-preserving node motion and elimination. Nodes are removed in constant intensity regions, merged along the boundaries, and moved in the direction of the mean local intensity gradient in order to provide higher node density in the boundary regions. Attenuation correction and detector geometric response are included in the system matrix. Once the mesh geometry is optimized, it is used to generate the final system matrix for ML-EM reconstruction of node intensities and for visualization of the reconstructed images. In dynamic PET or SPECT imaging, the system matrix generation procedure is performed using a quasi-static sinogram, generated by summing projection data from multiple time frames. This system matrix is then used to reconstruct the individual time frame projections. Performance of the new method is evaluated by reconstructing simulated projections of the NCAT phantom and the method is then applied to dynamic SPECT phantom and patient studies and to a dynamic microPET rat study. Tetrahedral mesh-based images are compared to the standard voxel-based reconstruction for both high and low signal-to-noise ratio projection datasets. The results demonstrate that the reconstructed images represented as tetrahedral meshes based on point clouds offer image quality comparable to that achievable using a standard voxel grid while allowing substantial reduction in the number of unknown intensities to be reconstructed and reducing the noise.

A Domain Decomposition Parallelization of the Fast Marching Method

NASA Technical Reports Server (NTRS)

Herrmann, M.

2003-01-01

In this paper, the first domain decomposition parallelization of the Fast Marching Method for level sets has been presented. Parallel speedup has been demonstrated in both the optimal and non-optimal domain decomposition case. The parallel performance of the proposed method is strongly dependent on load balancing separately the number of nodes on each side of the interface. A load imbalance of nodes on either side of the domain leads to an increase in communication and rollback operations. Furthermore, the amount of inter-domain communication can be reduced by aligning the inter-domain boundaries with the interface normal vectors. In the case of optimal load balancing and aligned inter-domain boundaries, the proposed parallel FMM algorithm is highly efficient, reaching efficiency factors of up to 0.98. Future work will focus on the extension of the proposed parallel algorithm to higher order accuracy. Also, to further enhance parallel performance, the coupling of the domain decomposition parallelization to the G(sub 0)-based parallelization will be investigated.

Tunable transmittance in anisotropic two-dimensional materials

NASA Astrophysics Data System (ADS)

Nualpijit, Phusit; Sinner, Andreas; Ziegler, Klaus

2018-06-01

A uniaxial strain applied to graphenelike materials moves the Dirac nodes along the boundary of the Brillouin zone. An extreme case is the merging of the Dirac node positions to a single degenerate spectral node, which gives rise to a new topological phase. Then isotropic Dirac nodes are replaced by a node with a linear behavior in one and a parabolic behavior in the other direction. This anisotropy influences substantially the optical properties. We propose a method to determine characteristic spectral and transport properties in black phosphorus layers, which were recently studied by several groups with angle-resolved photoemission spectroscopy, and discuss how the transmittance, the reflectance, and the optical absorption of this material can be tuned. In particular, we demonstrate that the transmittance of linearly polarized incident light varies from nearly 0% to almost 100% in the microwave and far-infrared regime.

On the inclusion of mass source terms in a single-relaxation-time lattice Boltzmann method

NASA Astrophysics Data System (ADS)

Aursjø, Olav; Jettestuen, Espen; Vinningland, Jan Ludvig; Hiorth, Aksel

2018-05-01

We present a lattice Boltzmann algorithm for incorporating a mass source in a fluid flow system. The proposed mass source/sink term, included in the lattice Boltzmann equation, maintains the Galilean invariance and the accuracy of the overall method, while introducing a mass source/sink term in the fluid dynamical equations. The method can, for instance, be used to inject or withdraw fluid from any preferred lattice node in a system. This suggests that injection and withdrawal of fluid does not have to be introduced through cumbersome, and sometimes less accurate, boundary conditions. The method also suggests that, through a chosen equation of state relating mass density to pressure, the proposed mass source term will render it possible to set a preferred pressure at any lattice node in a system. We demonstrate how this model handles injection and withdrawal of a fluid. And we show how it can be used to incorporate pressure boundaries. The accuracy of the algorithm is identified through a Chapman-Enskog expansion of the model and supported by the numerical simulations.

Lymph node segmentation by dynamic programming and active contours.

PubMed

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

2018-03-03

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

A Realistic Framework for Delay-Tolerant Network Routing in Open Terrains with Continuous Churn

NASA Astrophysics Data System (ADS)

Mahendran, Veeramani; Anirudh, Sivaraman K.; Murthy, C. Siva Ram

The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary.

Automated quadrilateral surface discretization method and apparatus usable to generate mesh in a finite element analysis system

DOEpatents

Blacker, Teddy D.

1994-01-01

An automatic quadrilateral surface discretization method and apparatus is provided for automatically discretizing a geometric region without decomposing the region. The automated quadrilateral surface discretization method and apparatus automatically generates a mesh of all quadrilateral elements which is particularly useful in finite element analysis. The generated mesh of all quadrilateral elements is boundary sensitive, orientation insensitive and has few irregular nodes on the boundary. A permanent boundary of the geometric region is input and rows are iteratively layered toward the interior of the geometric region. Also, an exterior permanent boundary and an interior permanent boundary for a geometric region may be input and the rows are iteratively layered inward from the exterior boundary in a first counter clockwise direction while the rows are iteratively layered from the interior permanent boundary toward the exterior of the region in a second clockwise direction. As a result, a high quality mesh for an arbitrary geometry may be generated with a technique that is robust and fast for complex geometric regions and extreme mesh gradations.

Comparing brain graphs in which nodes are regions of interest or independent components: A simulation study.

PubMed

Yu, Qingbao; Du, Yuhui; Chen, Jiayu; He, Hao; Sui, Jing; Pearlson, Godfrey; Calhoun, Vince D

2017-11-01

A key challenge in building a brain graph using fMRI data is how to define the nodes. Spatial brain components estimated by independent components analysis (ICA) and regions of interest (ROIs) determined by brain atlas are two popular methods to define nodes in brain graphs. It is difficult to evaluate which method is better in real fMRI data. Here we perform a simulation study and evaluate the accuracies of a few graph metrics in graphs with nodes of ICA components, ROIs, or modified ROIs in four simulation scenarios. Graph measures with ICA nodes are more accurate than graphs with ROI nodes in all cases. Graph measures with modified ROI nodes are modulated by artifacts. The correlations of graph metrics across subjects between graphs with ICA nodes and ground truth are higher than the correlations between graphs with ROI nodes and ground truth in scenarios with large overlapped spatial sources. Moreover, moving the location of ROIs would largely decrease the correlations in all scenarios. Evaluating graphs with different nodes is promising in simulated data rather than real data because different scenarios can be simulated and measures of different graphs can be compared with a known ground truth. Since ROIs defined using brain atlas may not correspond well to real functional boundaries, overall findings of this work suggest that it is more appropriate to define nodes using data-driven ICA than ROI approaches in real fMRI data. Copyright © 2017 Elsevier B.V. All rights reserved.

The effect of Reynolds number and turbulence on airfoil aerodynamics at -90 degrees incidence

NASA Technical Reports Server (NTRS)

Stremel, Paul M.

1993-01-01

A method has been developed for calculating the viscous flow about airfoils in with and without deflected flaps at -90 deg incidence. This method provides for the solution of the unsteady incompressible Navier-Stokes equations by means of an implicit technique. The solution is calculated on a body-fitted computational mesh using a staggered grid method. The vorticity is defined at the node points, and the velocity components are defined at the mesh-cell sides. The staggered-grid orientation provides for accurate representation of vorticity at the node points and the continuity equation at the mesh-cell centers. The method provides for the direct solution of the flow field and satisfies the continuity equation to machine zero at each time-step. The method is evaluated in terms of its ability to predict two-dimensional flow about an airfoil at -90 degrees incidence for varying Reynolds number and different boundary layer models. A laminar and a turbulent boundary layer models. A laminar and a turbulent boundary layer model are considered in the evaluation of the method. The variation of the average loading and surface pressure distribution due to flap deflection, Reynolds number, and laminar or turbulent flow are presented and compared with experimental results. The comparisons indicate that the calculated drag and drag reduction caused by flap deflection and the calculated average surface pressure are in excellent agreement with the measured results at a similar Reynolds number.

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

PubMed Central

Rodrigues, Joel J. P. C.

2014-01-01

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

A study of methods to predict and measure the transmission of sound through the walls of light aircraft. Integration of certain singular boundary element integrals for applications in linear acoustics

NASA Technical Reports Server (NTRS)

Zimmerle, D.; Bernhard, R. J.

1985-01-01

An alternative method for performing singular boundary element integrals for applications in linear acoustics is discussed. The method separates the integral of the characteristic solution into a singular and nonsingular part. The singular portion is integrated with a combination of analytic and numerical techniques while the nonsingular portion is integrated with standard Gaussian quadrature. The method may be generalized to many types of subparametric elements. The integrals over elements containing the root node are considered, and the characteristic solution for linear acoustic problems are examined. The method may be generalized to most characteristic solutions.

Some spectral approximation of one-dimensional fourth-order problems

NASA Technical Reports Server (NTRS)

Bernardi, Christine; Maday, Yvon

1989-01-01

Some spectral type collocation method well suited for the approximation of fourth-order systems are proposed. The model problem is the biharmonic equation, in one and two dimensions when the boundary conditions are periodic in one direction. It is proved that the standard Gauss-Lobatto nodes are not the best choice for the collocation points. Then, a new set of nodes related to some generalized Gauss type quadrature formulas is proposed. Also provided is a complete analysis of these formulas including some new issues about the asymptotic behavior of the weights and we apply these results to the analysis of the collocation method.

Accuracy-preserving source term quadrature for third-order edge-based discretization

NASA Astrophysics Data System (ADS)

Nishikawa, Hiroaki; Liu, Yi

2017-09-01

In this paper, we derive a family of source term quadrature formulas for preserving third-order accuracy of the node-centered edge-based discretization for conservation laws with source terms on arbitrary simplex grids. A three-parameter family of source term quadrature formulas is derived, and as a subset, a one-parameter family of economical formulas is identified that does not require second derivatives of the source term. Among the economical formulas, a unique formula is then derived that does not require gradients of the source term at neighbor nodes, thus leading to a significantly smaller discretization stencil for source terms. All the formulas derived in this paper do not require a boundary closure, and therefore can be directly applied at boundary nodes. Numerical results are presented to demonstrate third-order accuracy at interior and boundary nodes for one-dimensional grids and linear triangular/tetrahedral grids over straight and curved geometries.

THEORY OF SOLAR MERIDIONAL CIRCULATION AT HIGH LATITUDES

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

Dikpati, Mausumi; Gilman, Peter A., E-mail: dikpati@ucar.edu, E-mail: gilman@ucar.edu

2012-02-10

We build a hydrodynamic model for computing and understanding the Sun's large-scale high-latitude flows, including Coriolis forces, turbulent diffusion of momentum, and gyroscopic pumping. Side boundaries of the spherical 'polar cap', our computational domain, are located at latitudes {>=} 60 Degree-Sign . Implementing observed low-latitude flows as side boundary conditions, we solve the flow equations for a Cartesian analog of the polar cap. The key parameter that determines whether there are nodes in the high-latitude meridional flow is {epsilon} = 2{Omega}n{pi}H{sup 2}/{nu}, where {Omega} is the interior rotation rate, n is the radial wavenumber of the meridional flow, H ismore » the depth of the convection zone, and {nu} is the turbulent viscosity. The smaller the {epsilon} (larger turbulent viscosity), the fewer the number of nodes in high latitudes. For all latitudes within the polar cap, we find three nodes for {nu} = 10{sup 12} cm{sup 2} s{sup -1}, two for 10{sup 13}, and one or none for 10{sup 15} or higher. For {nu} near 10{sup 14} our model exhibits 'node merging': as the meridional flow speed is increased, two nodes cancel each other, leaving no nodes. On the other hand, for fixed flow speed at the boundary, as {nu} is increased the poleward-most node migrates to the pole and disappears, ultimately for high enough {nu} leaving no nodes. These results suggest that primary poleward surface meridional flow can extend from 60 Degree-Sign to the pole either by node merging or by node migration and disappearance.« less

An implicit boundary integral method for computing electric potential of macromolecules in solvent

NASA Astrophysics Data System (ADS)

Zhong, Yimin; Ren, Kui; Tsai, Richard

2018-04-01

A numerical method using implicit surface representations is proposed to solve the linearized Poisson-Boltzmann equation that arises in mathematical models for the electrostatics of molecules in solvent. The proposed method uses an implicit boundary integral formulation to derive a linear system defined on Cartesian nodes in a narrowband surrounding the closed surface that separates the molecule and the solvent. The needed implicit surface is constructed from the given atomic description of the molecules, by a sequence of standard level set algorithms. A fast multipole method is applied to accelerate the solution of the linear system. A few numerical studies involving some standard test cases are presented and compared to other existing results.

Boundary particle method for Laplace transformed time fractional diffusion equations

NASA Astrophysics Data System (ADS)

Fu, Zhuo-Jia; Chen, Wen; Yang, Hai-Tian

2013-02-01

This paper develops a novel boundary meshless approach, Laplace transformed boundary particle method (LTBPM), for numerical modeling of time fractional diffusion equations. It implements Laplace transform technique to obtain the corresponding time-independent inhomogeneous equation in Laplace space and then employs a truly boundary-only meshless boundary particle method (BPM) to solve this Laplace-transformed problem. Unlike the other boundary discretization methods, the BPM does not require any inner nodes, since the recursive composite multiple reciprocity technique (RC-MRM) is used to convert the inhomogeneous problem into the higher-order homogeneous problem. Finally, the Stehfest numerical inverse Laplace transform (NILT) is implemented to retrieve the numerical solutions of time fractional diffusion equations from the corresponding BPM solutions. In comparison with finite difference discretization, the LTBPM introduces Laplace transform and Stehfest NILT algorithm to deal with time fractional derivative term, which evades costly convolution integral calculation in time fractional derivation approximation and avoids the effect of time step on numerical accuracy and stability. Consequently, it can effectively simulate long time-history fractional diffusion systems. Error analysis and numerical experiments demonstrate that the present LTBPM is highly accurate and computationally efficient for 2D and 3D time fractional diffusion equations.

Stabilization of time domain acoustic boundary element method for the exterior problem avoiding the nonuniqueness.

PubMed

Jang, Hae-Won; Ih, Jeong-Guon

2013-03-01

The time domain boundary element method (TBEM) to calculate the exterior sound field using the Kirchhoff integral has difficulties in non-uniqueness and exponential divergence. In this work, a method to stabilize TBEM calculation for the exterior problem is suggested. The time domain CHIEF (Combined Helmholtz Integral Equation Formulation) method is newly formulated to suppress low order fictitious internal modes. This method constrains the surface Kirchhoff integral by forcing the pressures at the additional interior points to be zero when the shortest retarded time between boundary nodes and an interior point elapses. However, even after using the CHIEF method, the TBEM calculation suffers the exponential divergence due to the remaining unstable high order fictitious modes at frequencies higher than the frequency limit of the boundary element model. For complete stabilization, such troublesome modes are selectively adjusted by projecting the time response onto the eigenspace. In a test example for a transiently pulsating sphere, the final average error norm of the stabilized response compared to the analytic solution is 2.5%.

NOTE: Solving the ECG forward problem by means of a meshless finite element method

NASA Astrophysics Data System (ADS)

Li, Z. S.; Zhu, S. A.; He, Bin

2007-07-01

The conventional numerical computational techniques such as the finite element method (FEM) and the boundary element method (BEM) require laborious and time-consuming model meshing. The new meshless FEM only uses the boundary description and the node distribution and no meshing of the model is required. This paper presents the fundamentals and implementation of meshless FEM and the meshless FEM method is adapted to solve the electrocardiography (ECG) forward problem. The method is evaluated on a single-layer torso model, in which the analytical solution exists, and tested in a realistic geometry homogeneous torso model, with satisfactory results being obtained. The present results suggest that the meshless FEM may provide an alternative for ECG forward solutions.

An approach for the regularization of a power flow solution around the maximum loading point

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

Kataoka, Y.

1992-08-01

In the conventional power flow solution, the boundary conditions are directly specified by active power and reactive power at each node, so that the singular point coincided with the maximum loading point. For this reason, the computations are often disturbed by ill-condition. This paper proposes a new method for getting the wide-range regularity by giving some modifications to the conventional power flow solution method, thereby eliminating the singular point or shifting it to the region with the voltage lower than that of the maximum loading point. Then, the continuous execution of V-P curves including maximum loading point is realized. Themore » efficiency and effectiveness of the method are tested in practical 598-nodes system in comparison with the conventional method.« less

A time-domain finite element boundary integral approach for elastic wave scattering

NASA Astrophysics Data System (ADS)

Shi, F.; Lowe, M. J. S.; Skelton, E. A.; Craster, R. V.

2018-04-01

The response of complex scatterers, such as rough or branched cracks, to incident elastic waves is required in many areas of industrial importance such as those in non-destructive evaluation and related fields; we develop an approach to generate accurate and rapid simulations. To achieve this we develop, in the time domain, an implementation to efficiently couple the finite element (FE) method within a small local region, and the boundary integral (BI) globally. The FE explicit scheme is run in a local box to compute the surface displacement of the scatterer, by giving forcing signals to excitation nodes, which can lie on the scatterer itself. The required input forces on the excitation nodes are obtained with a reformulated FE equation, according to the incident displacement field. The surface displacements computed by the local FE are then projected, through time-domain BI formulae, to calculate the scattering signals with different modes. This new method yields huge improvements in the efficiency of FE simulations for scattering from complex scatterers. We present results using different shapes and boundary conditions, all simulated using this approach in both 2D and 3D, and then compare with full FE models and theoretical solutions to demonstrate the efficiency and accuracy of this numerical approach.

Three-dimensional boundary layer calculation by a characteristic method

NASA Technical Reports Server (NTRS)

Houdeville, R.

1992-01-01

A numerical method for solving the three-dimensional boundary layer equations for bodies of arbitrary shape is presented. In laminar flows, the application domain extends from incompressible to hypersonic flows with the assumption of chemical equilibrium. For turbulent boundary layers, the application domain is limited by the validity of the mixing length model used. In order to respect the hyperbolic nature of the equations reduced to first order partial derivative terms, the momentum equations are discretized along the local streamlines using of the osculator tangent plane at each node of the body fitted coordinate system. With this original approach, it is possible to overcome the use of the generalized coordinates, and therefore, it is not necessary to impose an extra hypothesis about the regularity of the mesh in which the boundary conditions are given. By doing so, it is possible to limit, and sometimes to suppress, the pre-treatment of the data coming from an inviscid calculation. Although the proposed scheme is only semi-implicit, the method remains numerically very efficient.

An Embedded Statistical Method for Coupling Molecular Dynamics and Finite Element Analyses

NASA Technical Reports Server (NTRS)

Saether, E.; Glaessgen, E.H.; Yamakov, V.

2008-01-01

The coupling of molecular dynamics (MD) simulations with finite element methods (FEM) yields computationally efficient models that link fundamental material processes at the atomistic level with continuum field responses at higher length scales. The theoretical challenge involves developing a seamless connection along an interface between two inherently different simulation frameworks. Various specialized methods have been developed to solve particular classes of problems. Many of these methods link the kinematics of individual MD atoms with FEM nodes at their common interface, necessarily requiring that the finite element mesh be refined to atomic resolution. Some of these coupling approaches also require simulations to be carried out at 0 K and restrict modeling to two-dimensional material domains due to difficulties in simulating full three-dimensional material processes. In the present work, a new approach to MD-FEM coupling is developed based on a restatement of the standard boundary value problem used to define a coupled domain. The method replaces a direct linkage of individual MD atoms and finite element (FE) nodes with a statistical averaging of atomistic displacements in local atomic volumes associated with each FE node in an interface region. The FEM and MD computational systems are effectively independent and communicate only through an iterative update of their boundary conditions. With the use of statistical averages of the atomistic quantities to couple the two computational schemes, the developed approach is referred to as an embedded statistical coupling method (ESCM). ESCM provides an enhanced coupling methodology that is inherently applicable to three-dimensional domains, avoids discretization of the continuum model to atomic scale resolution, and permits finite temperature states to be applied.

Simplified welding distortion analysis for fillet welding using composite shell elements

NASA Astrophysics Data System (ADS)

Kim, Mingyu; Kang, Minseok; Chung, Hyun

2015-09-01

This paper presents the simplified welding distortion analysis method to predict the welding deformation of both plate and stiffener in fillet welds. Currently, the methods based on equivalent thermal strain like Strain as Direct Boundary (SDB) has been widely used due to effective prediction of welding deformation. Regarding the fillet welding, however, those methods cannot represent deformation of both members at once since the temperature degree of freedom is shared at the intersection nodes in both members. In this paper, we propose new approach to simulate deformation of both members. The method can simulate fillet weld deformations by employing composite shell element and using different thermal expansion coefficients according to thickness direction with fixed temperature at intersection nodes. For verification purpose, we compare of result from experiments, 3D thermo elastic plastic analysis, SDB method and proposed method. Compared of experiments results, the proposed method can effectively predict welding deformation for fillet welds.

Implementation of perfectly matched layers in an arbitrary geometrical boundary for elastic wave modelling

NASA Astrophysics Data System (ADS)

Gao, Hongwei; Zhang, Jianfeng

2008-09-01

The perfectly matched layer (PML) absorbing boundary condition is incorporated into an irregular-grid elastic-wave modelling scheme, thus resulting in an irregular-grid PML method. We develop the irregular-grid PML method using the local coordinate system based PML splitting equations and integral formulation of the PML equations. The irregular-grid PML method is implemented under a discretization of triangular grid cells, which has the ability to absorb incident waves in arbitrary directions. This allows the PML absorbing layer to be imposed along arbitrary geometrical boundaries. As a result, the computational domain can be constructed with smaller nodes, for instance, to represent the 2-D half-space by a semi-circle rather than a rectangle. By using a smooth artificial boundary, the irregular-grid PML method can also avoid the special treatments to the corners, which lead to complex computer implementations in the conventional PML method. We implement the irregular-grid PML method in both 2-D elastic isotropic and anisotropic media. The numerical simulations of a VTI lamb's problem, wave propagation in an isotropic elastic medium with curved surface and in a TTI medium demonstrate the good behaviour of the irregular-grid PML method.

Adaptive form-finding method for form-fixed spatial network structures

NASA Astrophysics Data System (ADS)

Lan, Cheng; Tu, Xi; Xue, Junqing; Briseghella, Bruno; Zordan, Tobia

2018-02-01

An effective form-finding method for form-fixed spatial network structures is presented in this paper. The adaptive form-finding method is introduced along with the example of designing an ellipsoidal network dome with bar length variations being as small as possible. A typical spherical geodesic network is selected as an initial state, having bar lengths in a limit group number. Next, this network is transformed into the ellipsoidal shape as desired by applying compressions on bars according to the bar length variations caused by transformation. Afterwards, the dynamic relaxation method is employed to explicitly integrate the node positions by applying residual forces. During the form-finding process, the boundary condition of constraining nodes on the ellipsoid surface is innovatively considered as reactions on the normal direction of the surface at node positions, which are balanced with the components of the nodal forces in a reverse direction induced by compressions on bars. The node positions are also corrected according to the fixed-form condition in each explicit iteration step. In the serial results of time history, the optimal solution is found from a time history of states by properly choosing convergence criteria, and the presented form-finding procedure is proved to be applicable for form-fixed problems.

A New Concurrent Multiscale Methodology for Coupling Molecular Dynamics and Finite Element Analyses

NASA Technical Reports Server (NTRS)

Yamakov, Vesselin; Saether, Erik; Glaessgen, Edward H/.

2008-01-01

The coupling of molecular dynamics (MD) simulations with finite element methods (FEM) yields computationally efficient models that link fundamental material processes at the atomistic level with continuum field responses at higher length scales. The theoretical challenge involves developing a seamless connection along an interface between two inherently different simulation frameworks. Various specialized methods have been developed to solve particular classes of problems. Many of these methods link the kinematics of individual MD atoms with FEM nodes at their common interface, necessarily requiring that the finite element mesh be refined to atomic resolution. Some of these coupling approaches also require simulations to be carried out at 0 K and restrict modeling to two-dimensional material domains due to difficulties in simulating full three-dimensional material processes. In the present work, a new approach to MD-FEM coupling is developed based on a restatement of the standard boundary value problem used to define a coupled domain. The method replaces a direct linkage of individual MD atoms and finite element (FE) nodes with a statistical averaging of atomistic displacements in local atomic volumes associated with each FE node in an interface region. The FEM and MD computational systems are effectively independent and communicate only through an iterative update of their boundary conditions. With the use of statistical averages of the atomistic quantities to couple the two computational schemes, the developed approach is referred to as an embedded statistical coupling method (ESCM). ESCM provides an enhanced coupling methodology that is inherently applicable to three-dimensional domains, avoids discretization of the continuum model to atomic scale resolution, and permits finite temperature states to be applied.

Triangular node for Transmission-Line Modeling (TLM) applied to bio-heat transfer.

PubMed

Milan, Hugo F M; Gebremedhin, Kifle G

2016-12-01

Transmission-Line Modeling (TLM) is a numerical method used to solve complex and time-domain bio-heat transfer problems. In TLM, rectangles are used to discretize two-dimensional problems. The drawback in using rectangular shapes is that instead of refining only the domain of interest, a large additional domain will also be refined in the x and y axes, which results in increased computational time and memory space. In this paper, we developed a triangular node for TLM applied to bio-heat transfer that does not have the drawback associated with the rectangular nodes. The model includes heat source, blood perfusion (advection), boundary conditions and initial conditions. The boundary conditions could be adiabatic, temperature, heat flux, or convection. A matrix equation for TLM, which simplifies the solution of time-domain problems or solves steady-state problems, was also developed. The predicted results were compared against results obtained from the solution of a simplified two-dimensional problem, and they agreed within 1% for a mesh length of triangular faces of 59µm±9µm (mean±standard deviation) and a time step of 1ms. Copyright © 2016 Elsevier Ltd. All rights reserved.

Jacobi-Gauss-Lobatto collocation method for the numerical solution of 1+1 nonlinear Schrödinger equations

NASA Astrophysics Data System (ADS)

Doha, E. H.; Bhrawy, A. H.; Abdelkawy, M. A.; Van Gorder, Robert A.

2014-03-01

A Jacobi-Gauss-Lobatto collocation (J-GL-C) method, used in combination with the implicit Runge-Kutta method of fourth order, is proposed as a numerical algorithm for the approximation of solutions to nonlinear Schrödinger equations (NLSE) with initial-boundary data in 1+1 dimensions. Our procedure is implemented in two successive steps. In the first one, the J-GL-C is employed for approximating the functional dependence on the spatial variable, using (N-1) nodes of the Jacobi-Gauss-Lobatto interpolation which depends upon two general Jacobi parameters. The resulting equations together with the two-point boundary conditions induce a system of 2(N-1) first-order ordinary differential equations (ODEs) in time. In the second step, the implicit Runge-Kutta method of fourth order is applied to solve this temporal system. The proposed J-GL-C method, used in combination with the implicit Runge-Kutta method of fourth order, is employed to obtain highly accurate numerical approximations to four types of NLSE, including the attractive and repulsive NLSE and a Gross-Pitaevskii equation with space-periodic potential. The numerical results obtained by this algorithm have been compared with various exact solutions in order to demonstrate the accuracy and efficiency of the proposed method. Indeed, for relatively few nodes used, the absolute error in our numerical solutions is sufficiently small.

A Kernel-free Boundary Integral Method for Elliptic Boundary Value Problems ⋆

PubMed Central

Ying, Wenjun; Henriquez, Craig S.

2013-01-01

This paper presents a class of kernel-free boundary integral (KFBI) methods for general elliptic boundary value problems (BVPs). The boundary integral equations reformulated from the BVPs are solved iteratively with the GMRES method. During the iteration, the boundary and volume integrals involving Green's functions are approximated by structured grid-based numerical solutions, which avoids the need to know the analytical expressions of Green's functions. The KFBI method assumes that the larger regular domain, which embeds the original complex domain, can be easily partitioned into a hierarchy of structured grids so that fast elliptic solvers such as the fast Fourier transform (FFT) based Poisson/Helmholtz solvers or those based on geometric multigrid iterations are applicable. The structured grid-based solutions are obtained with standard finite difference method (FDM) or finite element method (FEM), where the right hand side of the resulting linear system is appropriately modified at irregular grid nodes to recover the formal accuracy of the underlying numerical scheme. Numerical results demonstrating the efficiency and accuracy of the KFBI methods are presented. It is observed that the number of GM-RES iterations used by the method for solving isotropic and moderately anisotropic BVPs is independent of the sizes of the grids that are employed to approximate the boundary and volume integrals. With the standard second-order FEMs and FDMs, the KFBI method shows a second-order convergence rate in accuracy for all of the tested Dirichlet/Neumann BVPs when the anisotropy of the diffusion tensor is not too strong. PMID:23519600

Optimal decentralized feedback control for a truss structure

NASA Technical Reports Server (NTRS)

Cagle, A.; Ozguner, U.

1989-01-01

One approach to the decentralized control of large flexible space structures involves the design of controllers for the substructures of large systems and their subsequent application to the entire coupled system. This approach is presently developed for the case of active vibration damping on an experimental large struss structure. The isolated boundary loading method is used to define component models by FEM; component controllers are designed using an interlocking control concept which minimizes the motion of the boundary nodes, thereby reducing the exchange of mechanical disturbances among components.

Efficiency analysis of diffusion on T-fractals in the sense of random walks.

PubMed

Peng, Junhao; Xu, Guoai

2014-04-07

Efficiently controlling the diffusion process is crucial in the study of diffusion problem in complex systems. In the sense of random walks with a single trap, mean trapping time (MTT) and mean diffusing time (MDT) are good measures of trapping efficiency and diffusion efficiency, respectively. They both vary with the location of the node. In this paper, we analyze the effects of node's location on trapping efficiency and diffusion efficiency of T-fractals measured by MTT and MDT. First, we provide methods to calculate the MTT for any target node and the MDT for any source node of T-fractals. The methods can also be used to calculate the mean first-passage time between any pair of nodes. Then, using the MTT and the MDT as the measure of trapping efficiency and diffusion efficiency, respectively, we compare the trapping efficiency and diffusion efficiency among all nodes of T-fractal and find the best (or worst) trapping sites and the best (or worst) diffusing sites. Our results show that the hub node of T-fractal is the best trapping site, but it is also the worst diffusing site; and that the three boundary nodes are the worst trapping sites, but they are also the best diffusing sites. Comparing the maximum of MTT and MDT with their minimums, we find that the maximum of MTT is almost 6 times of the minimum of MTT and the maximum of MDT is almost equal to the minimum for MDT. Thus, the location of target node has large effect on the trapping efficiency, but the location of source node almost has no effect on diffusion efficiency. We also simulate random walks on T-fractals, whose results are consistent with the derived results.

Parallel fast multipole boundary element method applied to computational homogenization

NASA Astrophysics Data System (ADS)

Ptaszny, Jacek

2018-01-01

In the present work, a fast multipole boundary element method (FMBEM) and a parallel computer code for 3D elasticity problem is developed and applied to the computational homogenization of a solid containing spherical voids. The system of equation is solved by using the GMRES iterative solver. The boundary of the body is dicretized by using the quadrilateral serendipity elements with an adaptive numerical integration. Operations related to a single GMRES iteration, performed by traversing the corresponding tree structure upwards and downwards, are parallelized by using the OpenMP standard. The assignment of tasks to threads is based on the assumption that the tree nodes at which the moment transformations are initialized can be partitioned into disjoint sets of equal or approximately equal size and assigned to the threads. The achieved speedup as a function of number of threads is examined.

Network-based landscape of research strengths of universities in Mainland China

NASA Astrophysics Data System (ADS)

Liu, Zihua; Xiao, Qin; Zhan, Qian; Gu, Changgui; Yang, Huijie

2017-07-01

A landscape of a complex system presents a quantitative measure of its global state. The profile of research strength in Mainland China is investigated in detail, by which we illustrate a complex network based framework to extract a landscape from detailed records. First, a measure analogous to the Jaccard similarity is proposed to calculate from the presided funds similarities between the top-ranked universities. The neighbor threshold method is employed to reconstruct the similarity network of the universities. Second, the network is divided into communities. In each community the node with the largest degree and the smallest average shortest path length is taken as the representative of the community, called central node. The node bridging each pair of communities is defined to be a boundary. The central nodes and boundaries cooperatively give us a picture of the research strength landscape. Third, the evolutionary behavior is monitored by the fission and fusion probability matrices, elements of which are the percentage of a community at present time that joins into every community at the next time, and the percentage of a community at next time that comes from every present community, respectively. The landscapes in three successive 4-year durations are identified. It was found that some types of universities, such as the medicine&pharmacy and the finance&economy, conserve in single communities in the more than ten years, respectively. The agriculture&forest universities tend to cluster into one community. Meanwhile the engineering type distributes in different communities and tends to mix with the comprehension type. This framework can be used straightforwardly to analyze temporal networks. It provides also a new network-based method for multivariate time series analysis.

A new range-free localisation in wireless sensor networks using support vector machine

NASA Astrophysics Data System (ADS)

Wang, Zengfeng; Zhang, Hao; Lu, Tingting; Sun, Yujuan; Liu, Xing

2018-02-01

Location information of sensor nodes is of vital importance for most applications in wireless sensor networks (WSNs). This paper proposes a new range-free localisation algorithm using support vector machine (SVM) and polar coordinate system (PCS), LSVM-PCS. In LSVM-PCS, two sets of classes are first constructed based on sensor nodes' polar coordinates. Using the boundaries of the defined classes, the operation region of WSN field is partitioned into a finite number of polar grids. Each sensor node can be localised into one of the polar grids by executing two localisation algorithms that are developed on the basis of SVM classification. The centre of the resident polar grid is then estimated as the location of the sensor node. In addition, a two-hop mass-spring optimisation (THMSO) is also proposed to further improve the localisation accuracy of LSVM-PCS. In THMSO, both neighbourhood information and non-neighbourhood information are used to refine the sensor node location. The results obtained verify that the proposed algorithm provides a significant improvement over existing localisation methods.

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

Soerensen, M.P.; Davidson, A.; Pedersen, N.F.

We use the method of cell-to-cell mapping to locate attractors, basins, and saddle nodes in the phase plane of a driven Josephson junction. The cell-mapping method is discussed in some detail, emphasizing its ability to provide a global view of the phase plane. Our computations confirm the existence of a previously reported interior crisis. In addition, we observe a boundary crisis for a small shift in one parameter. The cell-mapping method allows us to show both crises explicitly in the phase plane, at low computational cost.

Finite element techniques for the Navier-Stokes equations in the primitive variable formulation and the vorticity stream-function formulation

NASA Technical Reports Server (NTRS)

Glaisner, F.; Tezduyar, T. E.

1987-01-01

Finite element procedures for the Navier-Stokes equations in the primitive variable formulation and the vorticity stream-function formulation have been implemented. For both formulations, streamline-upwind/Petrov-Galerkin techniques are used for the discretization of the transport equations. The main problem associated with the vorticity stream-function formulation is the lack of boundary conditions for vorticity at solid surfaces. Here an implicit treatment of the vorticity at no-slip boundaries is incorporated in a predictor-multicorrector time integration scheme. For the primitive variable formulation, mixed finite-element approximations are used. A nine-node element and a four-node + bubble element have been implemented. The latter is shown to exhibit a checkerboard pressure mode and a numerical treatment for this spurious pressure mode is proposed. The two methods are compared from the points of view of simulating internal and external flows and the possibilities of extensions to three dimensions.

Investigation of Coupled model of Pore network and Continuum in shale gas

NASA Astrophysics Data System (ADS)

Cao, G.; Lin, M.

2016-12-01

Flow in shale spanning over many scales, makes the majority of conventional treatment methods disabled. For effectively simulating, a coupled model of pore-scale and continuum-scale was proposed in this paper. Based on the SEM image, we decompose organic-rich-shale into two subdomains: kerogen and inorganic matrix. In kerogen, the nanoscale pore-network is the main storage space and migration pathway so that the molecular phenomena (slip and diffusive transport) is significant. Whereas, inorganic matrix, with relatively large pores and micro fractures, the flow is approximate to Darcy. We use pore-scale network models (PNM) to represent kerogen and continuum-scale models (FVM or FEM) to represent matrix. Finite element mortars are employed to couple pore- and continuum-scale models by enforcing continuity of pressures and fluxes at shared boundary interfaces. In our method, the process in the coupled model is described by pressure square equation, and uses Dirichlet boundary conditions. We discuss several problems: the optimal element number of mortar faces, two categories boundary faces of pore network, the difference between 2D and 3D models, and the difference between continuum models FVM and FEM in mortars. We conclude that: (1) too coarse mesh in mortars will decrease the accuracy, while too fine mesh will lead to an ill-condition even singular system, the optimal element number is depended on boundary pores and nodes number. (2) pore network models are adjacent to two different mortar faces (PNM to PNM, PNM to continuum model), incidental repeated mortar nodes must be deleted. (3) 3D models can be replaced by 2D models under certain condition. (4) FVM is more convenient than FEM, for its simplicity in assigning interface nodes pressure and calculating interface fluxes. This work is supported by the Strategic Priority Research Program of the Chinese Academy of Sciences (XDB10020302), the 973 Program (2014CB239004), the Key Instrument Developing Project of the CAS (ZDYZ2012-1-08-02), the National Natural Science Foundation of China (41574129).

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

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

Reboredo, Fernando A.

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

High order Nyström method for elastodynamic scattering

NASA Astrophysics Data System (ADS)

Chen, Kun; Gurrala, Praveen; Song, Jiming; Roberts, Ron

2016-02-01

Elastic waves in solids find important applications in ultrasonic non-destructive evaluation. The scattering of elastic waves has been treated using many approaches like the finite element method, boundary element method and Kirchhoff approximation. In this work, we propose a novel accurate and efficient high order Nyström method to solve the boundary integral equations for elastodynamic scattering problems. This approach employs high order geometry description for the element, and high order interpolation for fields inside each element. Compared with the boundary element method, this approach makes the choice of the nodes for interpolation based on the Gaussian quadrature, which renders matrix elements for far field interaction free from integration, and also greatly simplifies the process for singularity and near singularity treatment. The proposed approach employs a novel efficient near singularity treatment that makes the solver able to handle extreme geometries like very thin penny-shaped crack. Numerical results are presented to validate the approach. By using the frequency domain response and performing the inverse Fourier transform, we also report the time domain response of flaw scattering.

Singular boundary method for global gravity field modelling

NASA Astrophysics Data System (ADS)

Cunderlik, Robert

2014-05-01

The singular boundary method (SBM) and method of fundamental solutions (MFS) are meshless boundary collocation techniques that use the fundamental solution of a governing partial differential equation (e.g. the Laplace equation) as their basis functions. They have been developed to avoid singular numerical integration as well as mesh generation in the traditional boundary element method (BEM). SBM have been proposed to overcome a main drawback of MFS - its controversial fictitious boundary outside the domain. The key idea of SBM is to introduce a concept of the origin intensity factors that isolate singularities of the fundamental solution and its derivatives using some appropriate regularization techniques. Consequently, the source points can be placed directly on the real boundary and coincide with the collocation nodes. In this study we deal with SBM applied for high-resolution global gravity field modelling. The first numerical experiment presents a numerical solution to the fixed gravimetric boundary value problem. The achieved results are compared with the numerical solutions obtained by MFS or the direct BEM indicating efficiency of all methods. In the second numerical experiments, SBM is used to derive the geopotential and its first derivatives from the Tzz components of the gravity disturbing tensor observed by the GOCE satellite mission. A determination of the origin intensity factors allows to evaluate the disturbing potential and gravity disturbances directly on the Earth's surface where the source points are located. To achieve high-resolution numerical solutions, the large-scale parallel computations are performed on the cluster with 1TB of the distributed memory and an iterative elimination of far zones' contributions is applied.

Adaptive triangular mesh generation

NASA Technical Reports Server (NTRS)

Erlebacher, G.; Eiseman, P. R.

1984-01-01

A general adaptive grid algorithm is developed on triangular grids. The adaptivity is provided by a combination of node addition, dynamic node connectivity and a simple node movement strategy. While the local restructuring process and the node addition mechanism take place in the physical plane, the nodes are displaced on a monitor surface, constructed from the salient features of the physical problem. An approximation to mean curvature detects changes in the direction of the monitor surface, and provides the pulling force on the nodes. Solutions to the axisymmetric Grad-Shafranov equation demonstrate the capturing, by triangles, of the plasma-vacuum interface in a free-boundary equilibrium configuration.

Spectroscopic ellipsometry data inversion using constrained splines and application to characterization of ZnO with various morphologies

NASA Astrophysics Data System (ADS)

Gilliot, Mickaël; Hadjadj, Aomar; Stchakovsky, Michel

2017-11-01

An original method of ellipsometric data inversion is proposed based on the use of constrained splines. The imaginary part of the dielectric function is represented by a series of splines, constructed with particular constraints on slopes at the node boundaries to avoid well-know oscillations of natural splines. The nodes are used as fit parameters. The real part is calculated using Kramers-Kronig relations. The inversion can be performed in successive inversion steps with increasing resolution. This method is used to characterize thin zinc oxide layers obtained by a sol-gel and spin-coating process, with a particular recipe yielding very thin layers presenting nano-porosity. Such layers have particular optical properties correlated with thickness, morphological and structural properties. The use of the constrained spline method is particularly efficient for such materials which may not be easily represented by standard dielectric function models.

Reduction of the discretization stencil of direct forcing immersed boundary methods on rectangular cells: The ghost node shifting method

NASA Astrophysics Data System (ADS)

Picot, Joris; Glockner, Stéphane

2018-07-01

We present an analytical study of discretization stencils for the Poisson problem and the incompressible Navier-Stokes problem when used with some direct forcing immersed boundary methods. This study uses, but is not limited to, second-order discretization and Ghost-Cell Finite-Difference methods. We show that the stencil size increases with the aspect ratio of rectangular cells, which is undesirable as it breaks assumptions of some linear system solvers. To circumvent this drawback, a modification of the Ghost-Cell Finite-Difference methods is proposed to reduce the size of the discretization stencil to the one observed for square cells, i.e. with an aspect ratio equal to one. Numerical results validate this proposed method in terms of accuracy and convergence, for the Poisson problem and both Dirichlet and Neumann boundary conditions. An improvement on error levels is also observed. In addition, we show that the application of the chosen Ghost-Cell Finite-Difference methods to the Navier-Stokes problem, discretized by a pressure-correction method, requires an additional interpolation step. This extra step is implemented and validated through well known test cases of the Navier-Stokes equations.

New ghost-node method for linking different models with varied grid refinement

USGS Publications Warehouse

James, S.C.; Dickinson, J.E.; Mehl, S.W.; Hill, M.C.; Leake, S.A.; Zyvoloski, G.A.; Eddebbarh, A.-A.

2006-01-01

A flexible, robust method for linking grids of locally refined ground-water flow models constructed with different numerical methods is needed to address a variety of hydrologic problems. This work outlines and tests a new ghost-node model-linking method for a refined "child" model that is contained within a larger and coarser "parent" model that is based on the iterative method of Steffen W. Mehl and Mary C. Hill (2002, Advances in Water Res., 25, p. 497-511; 2004, Advances in Water Res., 27, p. 899-912). The method is applicable to steady-state solutions for ground-water flow. Tests are presented for a homogeneous two-dimensional system that has matching grids (parent cells border an integer number of child cells) or nonmatching grids. The coupled grids are simulated by using the finite-difference and finite-element models MODFLOW and FEHM, respectively. The simulations require no alteration of the MODFLOW or FEHM models and are executed using a batch file on Windows operating systems. Results indicate that when the grids are matched spatially so that nodes and child-cell boundaries are aligned, the new coupling technique has error nearly equal to that when coupling two MODFLOW models. When the grids are nonmatching, model accuracy is slightly increased compared to that for matching-grid cases. Overall, results indicate that the ghost-node technique is a viable means to couple distinct models because the overall head and flow errors relative to the analytical solution are less than if only the regional coarse-grid model was used to simulate flow in the child model's domain.

New core-reflector boundary conditions for transient nodal reactor calculations

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

Lee, E.K.; Kim, C.H.; Joo, H.K.

1995-09-01

New core-reflector boundary conditions designed for the exclusion of the reflector region in transient nodal reactor calculations are formulated. Spatially flat frequency approximations for the temporal neutron behavior and two types of transverse leakage approximations in the reflector region are introduced to solve the transverse-integrated time-dependent one-dimensional diffusion equation and then to obtain relationships between net current and flux at the core-reflector interfaces. To examine the effectiveness of new core-reflector boundary conditions in transient nodal reactor computations, nodal expansion method (NEM) computations with and without explicit representation of the reflector are performed for Laboratorium fuer Reaktorregelung und Anlagen (LRA) boilingmore » water reactor (BWR) and Nuclear Energy Agency Committee on Reactor Physics (NEACRP) pressurized water reactor (PWR) rod ejection kinetics benchmark problems. Good agreement between two NEM computations is demonstrated in all the important transient parameters of two benchmark problems. A significant amount of CPU time saving is also demonstrated with the boundary condition model with transverse leakage (BCMTL) approximations in the reflector region. In the three-dimensional LRA BWR, the BCMTL and the explicit reflector model computations differ by {approximately}4% in transient peak power density while the BCMTL results in >40% of CPU time saving by excluding both the axial and the radial reflector regions from explicit computational nodes. In the NEACRP PWR problem, which includes six different transient cases, the largest difference is 24.4% in the transient maximum power in the one-node-per-assembly B1 transient results. This difference in the transient maximum power of the B1 case is shown to reduce to 11.7% in the four-node-per-assembly computations. As for the computing time, BCMTL is shown to reduce the CPU time >20% in all six transient cases of the NEACRP PWR.« less

Parallelization of the Flow Field Dependent Variation Scheme for Solving the Triple Shock/Boundary Layer Interaction Problem

NASA Technical Reports Server (NTRS)

Schunk, Richard Gregory; Chung, T. J.

2001-01-01

A parallelized version of the Flowfield Dependent Variation (FDV) Method is developed to analyze a problem of current research interest, the flowfield resulting from a triple shock/boundary layer interaction. Such flowfields are often encountered in the inlets of high speed air-breathing vehicles including the NASA Hyper-X research vehicle. In order to resolve the complex shock structure and to provide adequate resolution for boundary layer computations of the convective heat transfer from surfaces inside the inlet, models containing over 500,000 nodes are needed. Efficient parallelization of the computation is essential to achieving results in a timely manner. Results from a parallelization scheme, based upon multi-threading, as implemented on multiple processor supercomputers and workstations is presented.

Automatic classification of singular elements for the electrostatic analysis of microelectromechanical systems

NASA Astrophysics Data System (ADS)

Su, Y.; Ong, E. T.; Lee, K. H.

2002-05-01

The past decade has seen an accelerated growth of technology in the field of microelectromechanical systems (MEMS). The development of MEMS products has generated the need for efficient analytical and simulation methods for minimizing the requirement for actual prototyping. The boundary element method is widely used in the electrostatic analysis for MEMS devices. However, singular elements are needed to accurately capture the behavior at singular regions, such as sharp corners and edges, where standard elements fail to give an accurate result. The manual classification of boundary elements based on their singularity conditions is an immensely laborious task, especially when the boundary element model is large. This process can be automated by querying the geometric model of the MEMS device for convex edges based on geometric information of the model. The associated nodes of the boundary elements on these edges can then be retrieved. The whole process is implemented in the MSC/PATRAN platform using the Patran Command Language (the source code is available as supplementary data in the electronic version of this journal issue).

A meshless approach to thermomechanics of DC casting of aluminium billets

NASA Astrophysics Data System (ADS)

Mavrič, B.; Šarler, B.

2016-03-01

The ability to model thermomechanics in DC casting is important due to the technological challenges caused by physical phenomena such as different ingot distortions, cracking, hot tearing and residual stress. Many thermomechanical models already exist and usually take into account three contributions: elastic, thermal expansion, and viscoplastic to model the mushy zone. These models are, in a vast majority, solved by the finite element method. In the present work the elastic model that accounts for linear thermal expansion is considered. The method used for solving the model is of a novel meshless type and extends our previous meshless attempts in solving fluid mechanics problems. The solution to the problem is constructed using collocation on the overlapping subdomains, which are composed of computational nodes. Multiquadric radial basis functions, augmented by monomials, are used for the displacement interpolation. The interpolation is constructed in such a manner that it readily satisfies the boundary conditions. The discretization results in construction of a global square sparse matrix representing the system of linear equations for the displacement field. The developed method has many advantages. The system of equations can be easily constructed and efficiently solved. There is no need to perform expensive meshing of the domain and the formulation of the method is similar in two and three dimensions. Since no meshing is required, the nodes can easily be added or removed, which allows for efficient adaption of the node arrangement density. The order of convergence, estimated through an analytically solvable test, can be adjusted through the number of interpolation nodes in the subdomain, with 6 nodes being enough for the second order convergence. Simulations of axisymmetric mechanical problems, associated with low frequency electromagnetic DC casting are presented.

A Gaussian Mixture Model-based continuous Boundary Detection for 3D sensor networks.

PubMed

Chen, Jiehui; Salim, Mariam B; Matsumoto, Mitsuji

2010-01-01

This paper proposes a high precision Gaussian Mixture Model-based novel Boundary Detection 3D (BD3D) scheme with reasonable implementation cost for 3D cases by selecting a minimum number of Boundary sensor Nodes (BNs) in continuous moving objects. It shows apparent advantages in that two classes of boundary and non-boundary sensor nodes can be efficiently classified using the model selection techniques for finite mixture models; furthermore, the set of sensor readings within each sensor node's spatial neighbors is formulated using a Gaussian Mixture Model; different from DECOMO [1] and COBOM [2], we also formatted a BN Array with an additional own sensor reading to benefit selecting Event BNs (EBNs) and non-EBNs from the observations of BNs. In particular, we propose a Thick Section Model (TSM) to solve the problem of transition between 2D and 3D. It is verified by simulations that the BD3D 2D model outperforms DECOMO and COBOM in terms of average residual energy and the number of BNs selected, while the BD3D 3D model demonstrates sound performance even for sensor networks with low densities especially when the value of the sensor transmission range (r) is larger than the value of Section Thickness (d) in TSM. We have also rigorously proved its correctness for continuous geometric domains and full robustness for sensor networks over 3D terrains.

Validation of a Node-Centered Wall Function Model for the Unstructured Flow Code FUN3D

NASA Technical Reports Server (NTRS)

Carlson, Jan-Renee; Vasta, Veer N.; White, Jeffery

2015-01-01

In this paper, the implementation of two wall function models in the Reynolds averaged Navier-Stokes (RANS) computational uid dynamics (CFD) code FUN3D is described. FUN3D is a node centered method for solving the three-dimensional Navier-Stokes equations on unstructured computational grids. The first wall function model, based on the work of Knopp et al., is used in conjunction with the one-equation turbulence model of Spalart-Allmaras. The second wall function model, also based on the work of Knopp, is used in conjunction with the two-equation k-! turbulence model of Menter. The wall function models compute the wall momentum and energy flux, which are used to weakly enforce the wall velocity and pressure flux boundary conditions in the mean flow momentum and energy equations. These wall conditions are implemented in an implicit form where the contribution of the wall function model to the Jacobian are also included. The boundary conditions of the turbulence transport equations are enforced explicitly (strongly) on all solid boundaries. The use of the wall function models is demonstrated on four test cases: a at plate boundary layer, a subsonic di user, a 2D airfoil, and a 3D semi-span wing. Where possible, different near-wall viscous spacing tactics are examined. Iterative residual convergence was obtained in most cases. Solution results are compared with theoretical and experimental data for several variations of grid spacing. In general, very good comparisons with data were achieved.

Robust and general method for determining surface fluid flow boundary conditions in articular cartilage contact mechanics modeling.

PubMed

Pawaskar, Sainath Shrikant; Fisher, John; Jin, Zhongmin

2010-03-01

Contact detection in cartilage contact mechanics is an important feature of any analytical or computational modeling investigation when the biphasic nature of cartilage and the corresponding tribology are taken into account. The fluid flow boundary conditions will change based on whether the surface is in contact or not, which will affect the interstitial fluid pressurization. This in turn will increase or decrease the load sustained by the fluid phase, with a direct effect on friction, wear, and lubrication. In laboratory experiments or clinical hemiarthroplasty, when a rigid indenter or metallic prosthesis is used to apply load to the cartilage, there will not be any fluid flow normal to the surface in the contact region due to the impermeable nature of the indenter/prosthesis. In the natural joint, on the other hand, where two cartilage surfaces interact, flow will depend on the pressure difference across the interface. Furthermore, in both these cases, the fluid would flow freely in non-contacting regions. However, it should be pointed out that the contact area is generally unknown in advance in both cases and can only be determined as part of the solution. In the present finite element study, a general and robust algorithm was proposed to decide nodes in contact on the cartilage surface and, accordingly, impose the fluid flow boundary conditions. The algorithm was first tested for a rigid indenter against cartilage model. The algorithm worked well for two-dimensional four-noded and eight-noded axisymmetric element models as well as three-dimensional models. It was then extended to include two cartilages in contact. The results were in excellent agreement with the previous studies reported in the literature.

Solving the hypersingular boundary integral equation for the Burton and Miller formulation.

PubMed

Langrenne, Christophe; Garcia, Alexandre; Bonnet, Marc

2015-11-01

This paper presents an easy numerical implementation of the Burton and Miller (BM) formulation, where the hypersingular Helmholtz integral is regularized by identities from the associated Laplace equation and thus needing only the evaluation of weakly singular integrals. The Helmholtz equation and its normal derivative are combined directly with combinations at edge or corner collocation nodes not used when the surface is not smooth. The hypersingular operators arising in this process are regularized and then evaluated by an indirect procedure based on discretized versions of the Calderón identities linking the integral operators for associated Laplace problems. The method is valid for acoustic radiation and scattering problems involving arbitrarily shaped three-dimensional bodies. Unlike other approaches using direct evaluation of hypersingular integrals, collocation points still coincide with mesh nodes, as is usual when using conforming elements. Using higher-order shape functions (with the boundary element method model size kept fixed) reduces the overall numerical integration effort while increasing the solution accuracy. To reduce the condition number of the resulting BM formulation at low frequencies, a regularized version α = ik/(k(2 )+ λ) of the classical BM coupling factor α = i/k is proposed. Comparisons with the combined Helmholtz integral equation Formulation method of Schenck are made for four example configurations, two of them featuring non-smooth surfaces.

A study of hierarchical clustering of galaxies in an expanding universe

NASA Astrophysics Data System (ADS)

Porter, D. H.

The nonlinear hierarchical clustering of galaxies in an Einstein-deSitter (Omega = 1), initially white noise mass fluctuations (n = 0) model universe is investigated and shown to be in contradiction with previous results. The model is done in terms of an 11,000-body numerical simulation. The independent statics of 0.72 million particles are used to simulte the boundary conditions. A new method for integrating the Newtonian N-body gravity equations, which has controllable accuracy, incorporates a recursive center of mass reduction, and regularizes two body encounters is used to do the simulation. The coordinate system used here is well suited for the investigation of galaxy clustering, incorporating the independent positions and velocities of an arbitrary number of particles into a logarithmic hierarchy of center of mass nodes. The boundary for the simulation is created by using this hierarchy to map the independent statics of 0.72 million particles into just 4,000 particles. This method for simulating the boundary conditions also has controllable accuracy.

Methods and apparatus for capture and storage of semantic information with sub-files in a parallel computing system

DOEpatents

Faibish, Sorin; Bent, John M; Tzelnic, Percy; Grider, Gary; Torres, Aaron

2015-02-03

Techniques are provided for storing files in a parallel computing system using sub-files with semantically meaningful boundaries. A method is provided for storing at least one file generated by a distributed application in a parallel computing system. The file comprises one or more of a complete file and a plurality of sub-files. The method comprises the steps of obtaining a user specification of semantic information related to the file; providing the semantic information as a data structure description to a data formatting library write function; and storing the semantic information related to the file with one or more of the sub-files in one or more storage nodes of the parallel computing system. The semantic information provides a description of data in the file. The sub-files can be replicated based on semantically meaningful boundaries.

Discrete mathematical model of wave diffraction on pre-fractal impedance strips. TM mode case

NASA Astrophysics Data System (ADS)

Nesvit, K. V.

2013-10-01

In this paper a transverse magnetic (TM) wave diffraction problem on pre-fractal impedance strips is considered. The overall aim of this work is to develop a discrete mathematical model of the boundary integral equations (IEs) with the help of special quadrature formulas with the nodes in the zeros of Chebyshev polynomials and to perform a numerical experiments with the help of an efficient discrete singularities method (DSM).

Advancing MODFLOW Applying the Derived Vector Space Method

NASA Astrophysics Data System (ADS)

Herrera, G. S.; Herrera, I.; Lemus-García, M.; Hernandez-Garcia, G. D.

2015-12-01

The most effective domain decomposition methods (DDM) are non-overlapping DDMs. Recently a new approach, the DVS-framework, based on an innovative discretization method that uses a non-overlapping system of nodes (the derived-nodes), was introduced and developed by I. Herrera et al. [1, 2]. Using the DVS-approach a group of four algorithms, referred to as the 'DVS-algorithms', which fulfill the DDM-paradigm (i.e. the solution of global problems is obtained by resolution of local problems exclusively) has been derived. Such procedures are applicable to any boundary-value problem, or system of such equations, for which a standard discretization method is available and then software with a high degree of parallelization can be constructed. In a parallel talk, in this AGU Fall Meeting, Ismael Herrera will introduce the general DVS methodology. The application of the DVS-algorithms has been demonstrated in the solution of several boundary values problems of interest in Geophysics. Numerical examples for a single-equation, for the cases of symmetric, non-symmetric and indefinite problems were demonstrated before [1,2]. For these problems DVS-algorithms exhibited significantly improved numerical performance with respect to standard versions of DDM algorithms. In view of these results our research group is in the process of applying the DVS method to a widely used simulator for the first time, here we present the advances of the application of this method for the parallelization of MODFLOW. Efficiency results for a group of tests will be presented. References [1] I. Herrera, L.M. de la Cruz and A. Rosas-Medina. Non overlapping discretization methods for partial differential equations, Numer Meth Part D E, (2013). [2] Herrera, I., & Contreras Iván "An Innovative Tool for Effectively Applying Highly Parallelized Software To Problems of Elasticity". Geofísica Internacional, 2015 (In press)

A Statistical Approach for the Concurrent Coupling of Molecular Dynamics and Finite Element Methods

NASA Technical Reports Server (NTRS)

Saether, E.; Yamakov, V.; Glaessgen, E.

2007-01-01

Molecular dynamics (MD) methods are opening new opportunities for simulating the fundamental processes of material behavior at the atomistic level. However, increasing the size of the MD domain quickly presents intractable computational demands. A robust approach to surmount this computational limitation has been to unite continuum modeling procedures such as the finite element method (FEM) with MD analyses thereby reducing the region of atomic scale refinement. The challenging problem is to seamlessly connect the two inherently different simulation techniques at their interface. In the present work, a new approach to MD-FEM coupling is developed based on a restatement of the typical boundary value problem used to define a coupled domain. The method uses statistical averaging of the atomistic MD domain to provide displacement interface boundary conditions to the surrounding continuum FEM region, which, in return, generates interface reaction forces applied as piecewise constant traction boundary conditions to the MD domain. The two systems are computationally disconnected and communicate only through a continuous update of their boundary conditions. With the use of statistical averages of the atomistic quantities to couple the two computational schemes, the developed approach is referred to as an embedded statistical coupling method (ESCM) as opposed to a direct coupling method where interface atoms and FEM nodes are individually related. The methodology is inherently applicable to three-dimensional domains, avoids discretization of the continuum model down to atomic scales, and permits arbitrary temperatures to be applied.

Image-based model of the spectrin cytoskeleton for red blood cell simulation.

PubMed

Fai, Thomas G; Leo-Macias, Alejandra; Stokes, David L; Peskin, Charles S

2017-10-01

We simulate deformable red blood cells in the microcirculation using the immersed boundary method with a cytoskeletal model that incorporates structural details revealed by tomographic images. The elasticity of red blood cells is known to be supplied by both their lipid bilayer membranes, which resist bending and local changes in area, and their cytoskeletons, which resist in-plane shear. The cytoskeleton consists of spectrin tetramers that are tethered to the lipid bilayer by ankyrin and by actin-based junctional complexes. We model the cytoskeleton as a random geometric graph, with nodes corresponding to junctional complexes and with edges corresponding to spectrin tetramers such that the edge lengths are given by the end-to-end distances between nodes. The statistical properties of this graph are based on distributions gathered from three-dimensional tomographic images of the cytoskeleton by a segmentation algorithm. We show that the elastic response of our model cytoskeleton, in which the spectrin polymers are treated as entropic springs, is in good agreement with the experimentally measured shear modulus. By simulating red blood cells in flow with the immersed boundary method, we compare this discrete cytoskeletal model to an existing continuum model and predict the extent to which dynamic spectrin network connectivity can protect against failure in the case of a red cell subjected to an applied strain. The methods presented here could form the basis of disease- and patient-specific computational studies of hereditary diseases affecting the red cell cytoskeleton.

Image-based model of the spectrin cytoskeleton for red blood cell simulation

PubMed Central

Stokes, David L.; Peskin, Charles S.

2017-01-01

We simulate deformable red blood cells in the microcirculation using the immersed boundary method with a cytoskeletal model that incorporates structural details revealed by tomographic images. The elasticity of red blood cells is known to be supplied by both their lipid bilayer membranes, which resist bending and local changes in area, and their cytoskeletons, which resist in-plane shear. The cytoskeleton consists of spectrin tetramers that are tethered to the lipid bilayer by ankyrin and by actin-based junctional complexes. We model the cytoskeleton as a random geometric graph, with nodes corresponding to junctional complexes and with edges corresponding to spectrin tetramers such that the edge lengths are given by the end-to-end distances between nodes. The statistical properties of this graph are based on distributions gathered from three-dimensional tomographic images of the cytoskeleton by a segmentation algorithm. We show that the elastic response of our model cytoskeleton, in which the spectrin polymers are treated as entropic springs, is in good agreement with the experimentally measured shear modulus. By simulating red blood cells in flow with the immersed boundary method, we compare this discrete cytoskeletal model to an existing continuum model and predict the extent to which dynamic spectrin network connectivity can protect against failure in the case of a red cell subjected to an applied strain. The methods presented here could form the basis of disease- and patient-specific computational studies of hereditary diseases affecting the red cell cytoskeleton. PMID:28991926

Indentations and Starting Points in Traveling Sales Tour Problems: Implications for Theory

ERIC Educational Resources Information Center

MacGregor, James N.

2012-01-01

A complete, non-trivial, traveling sales tour problem contains at least one "indentation", where nodes in the interior of the point set are connected between two adjacent nodes on the boundary. Early research reported that human tours exhibited fewer such indentations than expected. A subsequent explanation proposed that this was because…

Tangle-Free Mesh Motion for Ablation Simulations

NASA Technical Reports Server (NTRS)

Droba, Justin

2016-01-01

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

Toroidal figures of equilibrium from a second-order accurate, accelerated SCF method with subgrid approach

NASA Astrophysics Data System (ADS)

Huré, J.-M.; Hersant, F.

2017-02-01

We compute the structure of a self-gravitating torus with polytropic equation of state (EOS) rotating in an imposed centrifugal potential. The Poisson solver is based on isotropic multigrid with optimal covering factor (fluid section-to-grid area ratio). We work at second order in the grid resolution for both finite difference and quadrature schemes. For soft EOS (I.e. polytropic index n ≥ 1), the underlying second order is naturally recovered for boundary values and any other integrated quantity sensitive to the mass density (mass, angular momentum, volume, virial parameter, etc.), I.e. errors vary with the number N of nodes per direction as ˜1/N2. This is, however, not observed for purely geometrical quantities (surface area, meridional section area, volume), unless a subgrid approach is considered (I.e. boundary detection). Equilibrium sequences are also much better described, especially close to critical rotation. Yet another technical effort is required for hard EOS (n < 1), due to infinite mass density gradients at the fluid surface. We fix the problem by using kernel splitting. Finally, we propose an accelerated version of the self-consistent field (SCF) algorithm based on a node-by-node pre-conditioning of the mass density at each step. The computing time is reduced by a factor of 2 typically, regardless of the polytropic index. There is a priori no obstacle to applying these results and techniques to ellipsoidal configurations and even to 3D configurations.

Proteus: a direct forcing method in the simulations of particulate flows

NASA Astrophysics Data System (ADS)

Feng, Zhi-Gang; Michaelides, Efstathios E.

2005-01-01

A new and efficient direct numerical method for the simulation of particulate flows is introduced. The method combines desired elements of the immersed boundary method, the direct forcing method and the lattice Boltzmann method. Adding a forcing term in the momentum equation enforces the no-slip condition on the boundary of a moving particle. By applying the direct forcing scheme, Proteus eliminates the need for the determination of free parameters, such as the stiffness coefficient in the penalty scheme or the two relaxation parameters in the adaptive-forcing scheme. The method presents a significant improvement over the previously introduced immersed-boundary-lattice-Boltzmann method (IB-LBM) where the forcing term was computed using a penalty method and a user-defined parameter. The method allows the enforcement of the rigid body motion of a particle in a more efficient way. Compared to the "bounce-back" scheme used in the conventional LBM, the direct-forcing method provides a smoother computational boundary for particles and is capable of achieving results at higher Reynolds number flows. By using a set of Lagrangian points to track the boundary of a particle, Proteus eliminates any need for the determination of the boundary nodes that are prescribed by the "bounce-back" scheme at every time step. It also makes computations for particles of irregular shapes simpler and more efficient. Proteus has been developed in two- as well as three-dimensions. This new method has been validated by comparing its results with those from experimental measurements for a single sphere settling in an enclosure under gravity. As a demonstration of the efficiency and capabilities of the present method, the settling of a large number (1232) of spherical particles is simulated in a narrow box under two different boundary conditions. It is found that when the no-slip boundary condition is imposed at the front and rear sides of the box the particles motion is significantly hindered. Under the periodic boundary conditions, the particles move faster. The simulations show that the sedimentation characteristics in a box with periodic boundary conditions at the two sides are very close to those found in the sedimentation of two-dimensional circular particles. In the Greek mythology Proteus is a hero, the son of Poseidon. In addition to his ability to change shapes and take different forms at will, Zeus granted him the power to make correct predictions for the future. One cannot expect better attributes from a numerical code.

Overset grid applications on distributed memory MIMD computers

NASA Technical Reports Server (NTRS)

Chawla, Kalpana; Weeratunga, Sisira

1994-01-01

Analysis of modern aerospace vehicles requires the computation of flowfields about complex three dimensional geometries composed of regions with varying spatial resolution requirements. Overset grid methods allow the use of proven structured grid flow solvers to address the twin issues of geometrical complexity and the resolution variation by decomposing the complex physical domain into a collection of overlapping subdomains. This flexibility is accompanied by the need for irregular intergrid boundary communication among the overlapping component grids. This study investigates a strategy for implementing such a static overset grid implicit flow solver on distributed memory, MIMD computers; i.e., the 128 node Intel iPSC/860 and the 208 node Intel Paragon. Performance data for two composite grid configurations characteristic of those encountered in present day aerodynamic analysis are also presented.

Atlas of the thoracic lymph nodal delineation and recommendations for lymph nodal CTV of esophageal squamous cell cancer in radiation therapy from China.

PubMed

Huang, Wei; Huang, Yong; Sun, Jujie; Liu, Xibin; Zhang, Jian; Zhou, Tao; Zhang, Baijiang; Li, Baosheng

2015-07-01

To construct an anatomical atlas of thoracic lymph node regions of esophageal cancer (EC) based on definitions from The Japan Esophageal Society (JES) and generate a consensus to delineate the nodal clinical target volume (CTVn) for elective nodal radiation (ENI) of esophageal squamous cell carcinoma (ESCC). An interdisciplinary group including two dedicated radiation oncologists, an experienced radiologist, a pathologist and two thoracic surgeons were gathered to generate a three-dimensional radiological description for the mediastinal lymph node regions of EC on axial CT scans. Then the radiological boundaries of lymph node regions were validated by a relatively large number of physicians in multiple institutions. An atlas of detailed anatomic boundaries of lymph node station No. 105-114 was defined on axial CT, along with illustrations. From the previous work, the study provided a guide of CTVn contouring for ENI of thoracic ESCC from a single center. It is feasible to use such an atlas of thoracic lymph node stations for radiotherapy planning. A phase III study based on the atlas is ongoing in China to measure quantitatively the ENI received by patients with ESCC. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Modeling growth and dissemination of lymphoma in a co-evolving lymph node: a diffuse-domain approach

NASA Astrophysics Data System (ADS)

Chuang, Yao-Li; Cristini, Vittorio; Chen, Ying; Li, Xiangrong; Frieboes, Hermann; Lowengrub, John

2013-03-01

While partial differential equation models of tumor growth have successfully described various spatiotemporal phenomena observed for in-vitro tumor spheroid experiments, one challenge towards taking these models to further study in-vivo tumors is that instead of relatively static tissue culture with regular boundary conditions, in-vivo tumors are often confined in organ tissues that co-evolve with the tumor growth. Here we adopt a recently developed diffuse-domain method to account for the co-evolving domain boundaries, adapting our previous in-vitro tumor model for the development of lymphoma encapsulated in a lymph node, which may swell or shrink due to proliferation and dissemination of lymphoma cells and treatment by chemotherapy. We use the model to study the induced spatial heterogeneity, which may arise as an emerging phenomenon in experimental observations and model analysis. Spatial heterogeneity is believed to lead to tumor infiltration patterns and reduce the efficacy of chemotherapy, leaving residuals that cause cancer relapse after the treatment. Understanding the spatiotemporal evolution of in-vivo tumors can be an essential step towards more effective strategies of curing cancer. Supported by NIH-PSOC grant 1U54CA143907-01.

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

NASA Astrophysics Data System (ADS)

Cheng, Jun; Zhang, Jun; Tian, Jinwen

2015-12-01

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

Fast Inbound Top-K Query for Random Walk with Restart.

PubMed

Zhang, Chao; Jiang, Shan; Chen, Yucheng; Sun, Yidan; Han, Jiawei

2015-09-01

Random walk with restart (RWR) is widely recognized as one of the most important node proximity measures for graphs, as it captures the holistic graph structure and is robust to noise in the graph. In this paper, we study a novel query based on the RWR measure, called the inbound top-k (Ink) query. Given a query node q and a number k , the Ink query aims at retrieving k nodes in the graph that have the largest weighted RWR scores to q . Ink queries can be highly useful for various applications such as traffic scheduling, disease treatment, and targeted advertising. Nevertheless, none of the existing RWR computation techniques can accurately and efficiently process the Ink query in large graphs. We propose two algorithms, namely Squeeze and Ripple, both of which can accurately answer the Ink query in a fast and incremental manner. To identify the top- k nodes, Squeeze iteratively performs matrix-vector multiplication and estimates the lower and upper bounds for all the nodes in the graph. Ripple employs a more aggressive strategy by only estimating the RWR scores for the nodes falling in the vicinity of q , the nodes outside the vicinity do not need to be evaluated because their RWR scores are propagated from the boundary of the vicinity and thus upper bounded. Ripple incrementally expands the vicinity until the top- k result set can be obtained. Our extensive experiments on real-life graph data sets show that Ink queries can retrieve interesting results, and the proposed algorithms are orders of magnitude faster than state-of-the-art method.

Boundary element analysis of corrosion problems for pumps and pipes

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

Miyasaka, M.; Amaya, K.; Kishimoto, K.

1995-12-31

Three-dimensional (3D) and axi-symmetric boundary element methods (BEM) were developed to quantitatively estimate cathodic protection and macro-cell corrosion. For 3D analysis, a multiple-region method (MRM) was developed in addition to a single-region method (SRM). The validity and usefulness of the BEMs were demonstrated by comparing numerical results with experimental data from galvanic corrosion systems of a cylindrical model and a seawater pipe, and from a cathodic protection system of an actual seawater pump. It was shown that a highly accurate analysis could be performed for fluid machines handling seawater with complex 3D fields (e.g. seawater pump) by taking account ofmore » flow rate and time dependencies of polarization curve. Compared to the 3D BEM, the axi-symmetric BEM permitted large reductions in numbers of elements and nodes, which greatly simplified analysis of axi-symmetric fields such as pipes. Computational accuracy and CPU time were compared between analyses using two approximation methods for polarization curves: a logarithmic-approximation method and a linear-approximation method.« less

Node Deployment with k-Connectivity in Sensor Networks for Crop Information Full Coverage Monitoring

PubMed Central

Liu, Naisen; Cao, Weixing; Zhu, Yan; Zhang, Jingchao; Pang, Fangrong; Ni, Jun

2016-01-01

Wireless sensor networks (WSNs) are suitable for the continuous monitoring of crop information in large-scale farmland. The information obtained is great for regulation of crop growth and achieving high yields in precision agriculture (PA). In order to realize full coverage and k-connectivity WSN deployment for monitoring crop growth information of farmland on a large scale and to ensure the accuracy of the monitored data, a new WSN deployment method using a genetic algorithm (GA) is here proposed. The fitness function of GA was constructed based on the following WSN deployment criteria: (1) nodes must be located in the corresponding plots; (2) WSN must have k-connectivity; (3) WSN must have no communication silos; (4) the minimum distance between node and plot boundary must be greater than a specific value to prevent each node from being affected by the farmland edge effect. The deployment experiments were performed on natural farmland and on irregular farmland divided based on spatial differences of soil nutrients. Results showed that both WSNs gave full coverage, there were no communication silos, and the minimum connectivity of nodes was equal to k. The deployment was tested for different values of k and transmission distance (d) to the node. The results showed that, when d was set to 200 m, as k increased from 2 to 4 the minimum connectivity of nodes increases and is equal to k. When k was set to 2, the average connectivity of all nodes increased in a linear manner with the increase of d from 140 m to 250 m, and the minimum connectivity does not change. PMID:27941704

Splitting nodes and linking channels: A method for assembling biocircuits from stochastic elementary units

NASA Astrophysics Data System (ADS)

Ferwerda, Cameron; Lipan, Ovidiu

2016-11-01

Akin to electric circuits, we construct biocircuits that are manipulated by cutting and assembling channels through which stochastic information flows. This diagrammatic manipulation allows us to create a method which constructs networks by joining building blocks selected so that (a) they cover only basic processes; (b) it is scalable to large networks; (c) the mean and variance-covariance from the Pauli master equation form a closed system; and (d) given the initial probability distribution, no special boundary conditions are necessary to solve the master equation. The method aims to help with both designing new synthetic signaling pathways and quantifying naturally existing regulatory networks.

Selecting boundary conditions in physiological strain analysis of the femur: Balanced loads, inertia relief method and follower load.

PubMed

Heyland, Mark; Trepczynski, Adam; Duda, Georg N; Zehn, Manfred; Schaser, Klaus-Dieter; Märdian, Sven

2015-12-01

Selection of boundary constraints may influence amount and distribution of loads. The purpose of this study is to analyze the potential of inertia relief and follower load to maintain the effects of musculoskeletal loads even under large deflections in patient specific finite element models of intact or fractured bone compared to empiric boundary constraints which have been shown to lead to physiological displacements and surface strains. The goal is to elucidate the use of boundary conditions in strain analyses of bones. Finite element models of the intact femur and a model of clinically relevant fracture stabilization by locking plate fixation were analyzed with normal walking loading conditions for different boundary conditions, specifically re-balanced loading, inertia relief and follower load. Peak principal cortex surface strains for different boundary conditions are consistent (maximum deviation 13.7%) except for inertia relief without force balancing (maximum deviation 108.4%). Influence of follower load on displacements increases with higher deflection in fracture model (from 3% to 7% for force balanced model). For load balanced models, follower load had only minor influence, though the effect increases strongly with higher deflection. Conventional constraints of fixed nodes in space should be carefully reconsidered because their type and position are challenging to justify and for their potential to introduce relevant non-physiological reaction forces. Inertia relief provides an alternative method which yields physiological strain results. Copyright © 2015 IPEM. Published by Elsevier Ltd. All rights reserved.

Calculation of steady and unsteady transonic flow using a Cartesian mesh and gridless boundary conditions with application to aeroelasticity

NASA Astrophysics Data System (ADS)

Kirshman, David

A numerical method for the solution of inviscid compressible flow using an array of embedded Cartesian meshes in conjunction with gridless surface boundary conditions is developed. The gridless boundary treatment is implemented by means of a least squares fitting of the conserved flux variables using a cloud of nodes in the vicinity of the surface geometry. The method allows for accurate treatment of the surface boundary conditions using a grid resolution an order of magnitude coarser than required of typical Cartesian approaches. Additionally, the method does not suffer from issues associated with thin body geometry or extremely fine cut cells near the body. Unlike some methods that consider a gridless (or "meshless") treatment throughout the entire domain, multi-grid acceleration can be effectively incorporated and issues associated with global conservation are alleviated. The "gridless" surface boundary condition provides for efficient and simple problem set up since definition of the body geometry is generated independently from the field mesh, and automatically incorporated into the field discretization of the domain. The applicability of the method is first demonstrated for steady flow of single and multi-element airfoil configurations. Using this method, comparisons with traditional body-fitted grid simulations reveal that steady flow solutions can be obtained accurately with minimal effort associated with grid generation. The method is then extended to unsteady flow predictions. In this application, flow field simulations for the prescribed oscillation of an airfoil indicate excellent agreement with experimental data. Furthermore, it is shown that the phase lag associated with shock oscillation is accurately predicted without the need for a deformable mesh. Lastly, the method is applied to the prediction of transonic flutter using a two-dimensional wing model, in which comparisons with moving mesh simulations yield nearly identical results. As a result, applicability of the method to transient and vibrating fluid-structure interaction problems is established in which the requirement for a deformable mesh is eliminated.

Numerical study of the shape parameter dependence of the local radial point interpolation method in linear elasticity.

PubMed

Moussaoui, Ahmed; Bouziane, Touria

2016-01-01

The method LRPIM is a Meshless method with properties of simple implementation of the essential boundary conditions and less costly than the moving least squares (MLS) methods. This method is proposed to overcome the singularity associated to polynomial basis by using radial basis functions. In this paper, we will present a study of a 2D problem of an elastic homogenous rectangular plate by using the method LRPIM. Our numerical investigations will concern the influence of different shape parameters on the domain of convergence,accuracy and using the radial basis function of the thin plate spline. It also will presents a comparison between numerical results for different materials and the convergence domain by precising maximum and minimum values as a function of distribution nodes number. The analytical solution of the deflection confirms the numerical results. The essential points in the method are: •The LRPIM is derived from the local weak form of the equilibrium equations for solving a thin elastic plate.•The convergence of the LRPIM method depends on number of parameters derived from local weak form and sub-domains.•The effect of distributions nodes number by varying nature of material and the radial basis function (TPS).

Studies of free-space optical links through simulated boundary layer and long-path turbulence

NASA Astrophysics Data System (ADS)

Wasiczko, Linda; Smolyaninov, Igor I.; Milner, Stuart D.; Davis, Christopher C.

2004-02-01

There is recent interest from the US Department of Defense in free space optical communication networks involving aircraft flying at various altitudes. The optical links between these aircraft may be as long as 100km, and involve communication between network nodes that are moving at sub-sonic speeds. An unresolved issue for links of this kind between pairs of aircraft is the effect of boundary layer turbulence near each aircraft, as well as along the atmospheric path between them. The deployment of optical wireless links in several different scenarios will be described. These include links near to the ground for which the turbulence parameter Cn2 varies along the path between transmitter (TX) and receiver (RX), high altitude links between aircraft, and ground to aircraft links. The last two of these may involve boundary layer turbulence near the aircraft node where the turbulence is localized either at the TX or at the RX. Some of the theoretical approaches to examining these situations will be described, as well as an ongoing program of research to examine these situations experimentally. Ways to mitigate the effects of node motion, and scintillation at the RX will be discussed, including the use of non-imaging concentrators at the RX.

Improving sub-grid scale accuracy of boundary features in regional finite-difference models

USGS Publications Warehouse

Panday, Sorab; Langevin, Christian D.

2012-01-01

As an alternative to grid refinement, the concept of a ghost node, which was developed for nested grid applications, has been extended towards improving sub-grid scale accuracy of flow to conduits, wells, rivers or other boundary features that interact with a finite-difference groundwater flow model. The formulation is presented for correcting the regular finite-difference groundwater flow equations for confined and unconfined cases, with or without Newton Raphson linearization of the nonlinearities, to include the Ghost Node Correction (GNC) for location displacement. The correction may be applied on the right-hand side vector for a symmetric finite-difference Picard implementation, or on the left-hand side matrix for an implicit but asymmetric implementation. The finite-difference matrix connectivity structure may be maintained for an implicit implementation by only selecting contributing nodes that are a part of the finite-difference connectivity. Proof of concept example problems are provided to demonstrate the improved accuracy that may be achieved through sub-grid scale corrections using the GNC schemes.

A topo-graph model for indistinct target boundary definition from anatomical images.

PubMed

Cui, Hui; Wang, Xiuying; Zhou, Jianlong; Gong, Guanzhong; Eberl, Stefan; Yin, Yong; Wang, Lisheng; Feng, Dagan; Fulham, Michael

2018-06-01

It can be challenging to delineate the target object in anatomical imaging when the object boundaries are difficult to discern due to the low contrast or overlapping intensity distributions from adjacent tissues. We propose a topo-graph model to address this issue. The first step is to extract a topographic representation that reflects multiple levels of topographic information in an input image. We then define two types of node connections - nesting branches (NBs) and geodesic edges (GEs). NBs connect nodes corresponding to initial topographic regions and GEs link the nodes at a detailed level. The weights for NBs are defined to measure the similarity of regional appearance, and weights for GEs are defined with geodesic and local constraints. NBs contribute to the separation of topographic regions and the GEs assist the delineation of uncertain boundaries. Final segmentation is achieved by calculating the relevance of the unlabeled nodes to the labels by the optimization of a graph-based energy function. We test our model on 47 low contrast CT studies of patients with non-small cell lung cancer (NSCLC), 10 contrast-enhanced CT liver cases and 50 breast and abdominal ultrasound images. The validation criteria are the Dice's similarity coefficient and the Hausdorff distance. Student's t-test show that our model outperformed the graph models with pixel-only, pixel and regional, neighboring and radial connections (p-values <0.05). Our findings show that the topographic representation and topo-graph model provides improved delineation and separation of objects from adjacent tissues compared to the tested models. Copyright © 2018 Elsevier B.V. All rights reserved.

Development and evaluation of a local grid refinement method for block-centered finite-difference groundwater models using shared nodes

USGS Publications Warehouse

Mehl, S.; Hill, M.C.

2002-01-01

A new method of local grid refinement for two-dimensional block-centered finite-difference meshes is presented in the context of steady-state groundwater-flow modeling. The method uses an iteration-based feedback with shared nodes to couple two separate grids. The new method is evaluated by comparison with results using a uniform fine mesh, a variably spaced mesh, and a traditional method of local grid refinement without a feedback. Results indicate: (1) The new method exhibits quadratic convergence for homogeneous systems and convergence equivalent to uniform-grid refinement for heterogeneous systems. (2) Coupling the coarse grid with the refined grid in a numerically rigorous way allowed for improvement in the coarse-grid results. (3) For heterogeneous systems, commonly used linear interpolation of heads from the large model onto the boundary of the refined model produced heads that are inconsistent with the physics of the flow field. (4) The traditional method works well in situations where the better resolution of the locally refined grid has little influence on the overall flow-system dynamics, but if this is not true, lack of a feedback mechanism produced errors in head up to 3.6% and errors in cell-to-cell flows up to 25%. ?? 2002 Elsevier Science Ltd. All rights reserved.

A finite element head and neck model as a supportive tool for deformable image registration.

PubMed

Kim, Jihun; Saitou, Kazuhiro; Matuszak, Martha M; Balter, James M

2016-07-01

A finite element (FE) head and neck model was developed as a tool to aid investigations and development of deformable image registration and patient modeling in radiation oncology. Useful aspects of a FE model for these purposes include ability to produce realistic deformations (similar to those seen in patients over the course of treatment) and a rational means of generating new configurations, e.g., via the application of force and/or displacement boundary conditions. The model was constructed based on a cone-beam computed tomography image of a head and neck cancer patient. The three-node triangular surface meshes created for the bony elements (skull, mandible, and cervical spine) and joint elements were integrated into a skeletal system and combined with the exterior surface. Nodes were additionally created inside the surface structures which were composed of the three-node triangular surface meshes, so that four-node tetrahedral FE elements were created over the whole region of the model. The bony elements were modeled as a homogeneous linear elastic material connected by intervertebral disks. The surrounding tissues were modeled as a homogeneous linear elastic material. Under force or displacement boundary conditions, FE analysis on the model calculates approximate solutions of the displacement vector field. A FE head and neck model was constructed that skull, mandible, and cervical vertebrae were mechanically connected by disks. The developed FE model is capable of generating realistic deformations that are strain-free for the bony elements and of creating new configurations of the skeletal system with the surrounding tissues reasonably deformed. The FE model can generate realistic deformations for skeletal elements. In addition, the model provides a way of evaluating the accuracy of image alignment methods by producing a ground truth deformation and correspondingly simulated images. The ability to combine force and displacement conditions provides flexibility for simulating realistic anatomic configurations.

Wireless sensor networks for heritage object deformation detection and tracking algorithm.

PubMed

Xie, Zhijun; Huang, Guangyan; Zarei, Roozbeh; He, Jing; Zhang, Yanchun; Ye, Hongwu

2014-10-31

Deformation is the direct cause of heritage object collapse. It is significant to monitor and signal the early warnings of the deformation of heritage objects. However, traditional heritage object monitoring methods only roughly monitor a simple-shaped heritage object as a whole, but cannot monitor complicated heritage objects, which may have a large number of surfaces inside and outside. Wireless sensor networks, comprising many small-sized, low-cost, low-power intelligent sensor nodes, are more useful to detect the deformation of every small part of the heritage objects. Wireless sensor networks need an effective mechanism to reduce both the communication costs and energy consumption in order to monitor the heritage objects in real time. In this paper, we provide an effective heritage object deformation detection and tracking method using wireless sensor networks (EffeHDDT). In EffeHDDT, we discover a connected core set of sensor nodes to reduce the communication cost for transmitting and collecting the data of the sensor networks. Particularly, we propose a heritage object boundary detecting and tracking mechanism. Both theoretical analysis and experimental results demonstrate that our EffeHDDT method outperforms the existing methods in terms of network traffic and the precision of the deformation detection.

Wireless Sensor Networks for Heritage Object Deformation Detection and Tracking Algorithm

PubMed Central

Xie, Zhijun; Huang, Guangyan; Zarei, Roozbeh; He, Jing; Zhang, Yanchun; Ye, Hongwu

2014-01-01

Deformation is the direct cause of heritage object collapse. It is significant to monitor and signal the early warnings of the deformation of heritage objects. However, traditional heritage object monitoring methods only roughly monitor a simple-shaped heritage object as a whole, but cannot monitor complicated heritage objects, which may have a large number of surfaces inside and outside. Wireless sensor networks, comprising many small-sized, low-cost, low-power intelligent sensor nodes, are more useful to detect the deformation of every small part of the heritage objects. Wireless sensor networks need an effective mechanism to reduce both the communication costs and energy consumption in order to monitor the heritage objects in real time. In this paper, we provide an effective heritage object deformation detection and tracking method using wireless sensor networks (EffeHDDT). In EffeHDDT, we discover a connected core set of sensor nodes to reduce the communication cost for transmitting and collecting the data of the sensor networks. Particularly, we propose a heritage object boundary detecting and tracking mechanism. Both theoretical analysis and experimental results demonstrate that our EffeHDDT method outperforms the existing methods in terms of network traffic and the precision of the deformation detection. PMID:25365458

The stability and slow dynamics of spot patterns in the 2D Brusselator model: The effect of open systems and heterogeneities

NASA Astrophysics Data System (ADS)

Tzou, J. C.; Ward, M. J.

2018-06-01

Spot patterns, whereby the activator field becomes spatially localized near certain dynamically-evolving discrete spatial locations in a bounded multi-dimensional domain, is a common occurrence for two-component reaction-diffusion (RD) systems in the singular limit of a large diffusivity ratio. In previous studies of 2-D localized spot patterns for various specific well-known RD systems, the domain boundary was assumed to be impermeable to both the activator and inhibitor, and the reaction-kinetics were assumed to be spatially uniform. As an extension of this previous theory, we use formal asymptotic methods to study the existence, stability, and slow dynamics of localized spot patterns for the singularly perturbed 2-D Brusselator RD model when the domain boundary is only partially impermeable, as modeled by an inhomogeneous Robin boundary condition, or when there is an influx of inhibitor across the domain boundary. In our analysis, we will also allow for the effect of a spatially variable bulk feed term in the reaction kinetics. By applying our extended theory to the special case of one-spot patterns and ring patterns of spots inside the unit disk, we provide a detailed analysis of the effect on spot patterns of these three different sources of heterogeneity. In particular, when there is an influx of inhibitor across the boundary of the unit disk, a ring pattern of spots can become pinned to a ring-radius closer to the domain boundary. Under a Robin condition, a quasi-equilibrium ring pattern of spots is shown to exhibit a novel saddle-node bifurcation behavior in terms of either the inhibitor diffusivity, the Robin constant, or the ambient background concentration. A spatially variable bulk feed term, with a concentrated source of "fuel" inside the domain, is shown to yield a saddle-node bifurcation structure of spot equilibria, which leads to qualitatively new spot-pinning behavior. Results from our asymptotic theory are validated from full numerical simulations of the Brusselator model.

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

NASA Astrophysics Data System (ADS)

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

2017-08-01

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

Analysis of chaotic saddles in a nonlinear vibro-impact system

NASA Astrophysics Data System (ADS)

Feng, Jinqian

2017-07-01

In this paper, a computational investigation of chaotic saddles in a nonlinear vibro-impact system is presented. For a classical Duffing vibro-impact oscillator, we employ the bisection procedure and an improved stagger-and-step method to present evidence of visual chaotic saddles on the fractal basin boundary and in the internal basin, respectively. The results show that the period saddles play an important role in the evolution of chaotic saddle. The dynamics mechanics of three types of bifurcation such as saddle-node bifurcation, chaotic saddle crisis bifurcation and interior chaotic crisis bifurcation are discussed. The results reveal that the period saddle created at saddle-node bifurcation is responsible for the switch of the internal chaotic saddle to the boundary chaotic saddle. At chaotic saddle crisis bifurcation, a large chaotic saddle can divide into two different chaotic saddle connected by a period saddle. The intersection points between stable and unstable manifolds of this period saddle supply access for chaotic orbits from one chaotic saddle to another and eventually induce the coupling of these two chaotic saddle. Interior chaotic crisis bifurcation is associated with the intersection of stable and unstable manifolds of the period saddle connecting two chaotic invariant sets. In addition, the gaps in chaotic saddle is responsible for the fractal structure.

GPU accelerated study of heat transfer and fluid flow by lattice Boltzmann method on CUDA

NASA Astrophysics Data System (ADS)

Ren, Qinlong

Lattice Boltzmann method (LBM) has been developed as a powerful numerical approach to simulate the complex fluid flow and heat transfer phenomena during the past two decades. As a mesoscale method based on the kinetic theory, LBM has several advantages compared with traditional numerical methods such as physical representation of microscopic interactions, dealing with complex geometries and highly parallel nature. Lattice Boltzmann method has been applied to solve various fluid behaviors and heat transfer process like conjugate heat transfer, magnetic and electric field, diffusion and mixing process, chemical reactions, multiphase flow, phase change process, non-isothermal flow in porous medium, microfluidics, fluid-structure interactions in biological system and so on. In addition, as a non-body-conformal grid method, the immersed boundary method (IBM) could be applied to handle the complex or moving geometries in the domain. The immersed boundary method could be coupled with lattice Boltzmann method to study the heat transfer and fluid flow problems. Heat transfer and fluid flow are solved on Euler nodes by LBM while the complex solid geometries are captured by Lagrangian nodes using immersed boundary method. Parallel computing has been a popular topic for many decades to accelerate the computational speed in engineering and scientific fields. Today, almost all the laptop and desktop have central processing units (CPUs) with multiple cores which could be used for parallel computing. However, the cost of CPUs with hundreds of cores is still high which limits its capability of high performance computing on personal computer. Graphic processing units (GPU) is originally used for the computer video cards have been emerged as the most powerful high-performance workstation in recent years. Unlike the CPUs, the cost of GPU with thousands of cores is cheap. For example, the GPU (GeForce GTX TITAN) which is used in the current work has 2688 cores and the price is only 1,000 US dollars. The release of NVIDIA's CUDA architecture which includes both hardware and programming environment in 2007 makes GPU computing attractive. Due to its highly parallel nature, lattice Boltzmann method is successfully ported into GPU with a performance benefit during the recent years. In the current work, LBM CUDA code is developed for different fluid flow and heat transfer problems. In this dissertation, lattice Boltzmann method and immersed boundary method are used to study natural convection in an enclosure with an array of conduting obstacles, double-diffusive convection in a vertical cavity with Soret and Dufour effects, PCM melting process in a latent heat thermal energy storage system with internal fins, mixed convection in a lid-driven cavity with a sinusoidal cylinder, and AC electrothermal pumping in microfluidic systems on a CUDA computational platform. It is demonstrated that LBM is an efficient method to simulate complex heat transfer problems using GPU on CUDA.

Locally refined block-centred finite-difference groundwater models: Evaluation of parameter sensitivity and the consequences for inverse modelling

USGS Publications Warehouse

Mehl, S.; Hill, M.C.

2002-01-01

Models with local grid refinement, as often required in groundwater models, pose special problems for model calibration. This work investigates the calculation of sensitivities and the performance of regression methods using two existing and one new method of grid refinement. The existing local grid refinement methods considered are: (a) a variably spaced grid in which the grid spacing becomes smaller near the area of interest and larger where such detail is not needed, and (b) telescopic mesh refinement (TMR), which uses the hydraulic heads or fluxes of a regional model to provide the boundary conditions for a locally refined model. The new method has a feedback between the regional and local grids using shared nodes, and thereby, unlike the TMR methods, balances heads and fluxes at the interfacing boundary. Results for sensitivities are compared for the three methods and the effect of the accuracy of sensitivity calculations are evaluated by comparing inverse modelling results. For the cases tested, results indicate that the inaccuracies of the sensitivities calculated using the TMR approach can cause the inverse model to converge to an incorrect solution.

Locally refined block-centered finite-difference groundwater models: Evaluation of parameter sensitivity and the consequences for inverse modelling and predictions

USGS Publications Warehouse

Mehl, S.; Hill, M.C.

2002-01-01

Models with local grid refinement, as often required in groundwater models, pose special problems for model calibration. This work investigates the calculation of sensitivities and performance of regression methods using two existing and one new method of grid refinement. The existing local grid refinement methods considered are (1) a variably spaced grid in which the grid spacing becomes smaller near the area of interest and larger where such detail is not needed and (2) telescopic mesh refinement (TMR), which uses the hydraulic heads or fluxes of a regional model to provide the boundary conditions for a locally refined model. The new method has a feedback between the regional and local grids using shared nodes, and thereby, unlike the TMR methods, balances heads and fluxes at the interfacing boundary. Results for sensitivities are compared for the three methods and the effect of the accuracy of sensitivity calculations are evaluated by comparing inverse modelling results. For the cases tested, results indicate that the inaccuracies of the sensitivities calculated using the TMR approach can cause the inverse model to converge to an incorrect solution.

Dynamics of influence on hierarchical structures

NASA Astrophysics Data System (ADS)

Fotouhi, Babak; Rabbat, Michael G.

2013-08-01

Dichotomous spin dynamics on a pyramidal hierarchical structure (the Bethe lattice) are studied. The system embodies a number of classes, where a class comprises nodes that are equidistant from the root (head node). Weighted links exist between nodes from the same and different classes. The spin (hereafter state) of the head node is fixed. We solve for the dynamics of the system for different boundary conditions. We find necessary conditions so that the classes eventually repudiate or acquiesce in the state imposed by the head node. The results indicate that to reach unanimity across the hierarchy, it suffices that the bottommost class adopts the same state as the head node. Then the rest of the hierarchy will inevitably comply. This also sheds light on the importance of mass media as a means of synchronization between the topmost and bottommost classes. Surprisingly, in the case of discord between the head node and the bottommost classes, the average state over all nodes inclines towards that of the bottommost class regardless of the link weights and intraclass configurations. Hence the role of the bottommost class is signified.

Two-point resistance of an m × n resistor network with an arbitrary boundary and its application in RLC network

NASA Astrophysics Data System (ADS)

Zhi-Zhong, Tan

2016-05-01

A rectangular m × n resistor network with an arbitrary boundary is investigated, and a general resistance formula between two nodes on an arbitrary axis is derived by the Recursion-Transform (RT) method, a problem that has never been resolved before, for the Green’s function technique and the Laplacian matrix approach are inapplicable to it. To have the exact solution of resistance is important but it is difficult to obtain under the condition of arbitrary boundary. Our result is directly expressed in a single summation and mainly composed of characteristic roots, which contain both finite and infinite cases. Further, the current distribution is given explicitly as a byproduct of the method. Our framework can be effectively applied to RLC networks. As an application to the LC network, we find that our formulation leads to the occurrence of resonances at h 1 = 1 - cos ϕ i - sin ϕ i cot n ϕ i . This somewhat curious result suggests the possibility of practical applications of our formulae to resonant circuits. Project supported by the Prophase Preparatory Project of Natural Science Foundation of Nantong University, China (Grant No. 15ZY16).

Acoustic propagation in rigid ducts with blockage

NASA Technical Reports Server (NTRS)

El-Raheb, M.; Wagner, P.

1982-01-01

Acoustic levitation has been suggested for moving nonmagnetic material in furnaces for heat processing in space experiments. Basically, acoustic standing waves under resonant conditions are excited in the cavity of the furnace while the material blockage is located at a pressure node and thus at a maximum gradient. The position of the blockage is controlled by displacing the node as a result of frequency change. The present investigation is concerned with the effect of blockage on the longitudinal and transverse resonances of a cylindrical cavity, taking into account the results of a one-dimensional and three-dimensional (3-D) analysis. Based on a Green's function surface element method, 3-D analysis is tested experimentally and proved to be accurate over a wide range of geometric parameters and boundary shapes. The shift in resonance depends on the change in pressure gradient and duct shortening caused by the blockage.

Multilayer Network Analysis of Nuclear Reactions

NASA Astrophysics Data System (ADS)

Zhu, Liang; Ma, Yu-Gang; Chen, Qu; Han, Ding-Ding

2016-08-01

The nuclear reaction network is usually studied via precise calculation of differential equation sets, and much research interest has been focused on the characteristics of nuclides, such as half-life and size limit. In this paper, however, we adopt the methods from both multilayer and reaction networks, and obtain a distinctive view by mapping all the nuclear reactions in JINA REACLIB database into a directed network with 4 layers: neutron, proton, 4He and the remainder. The layer names correspond to reaction types decided by the currency particles consumed. This combined approach reveals that, in the remainder layer, the β-stability has high correlation with node degree difference and overlapping coefficient. Moreover, when reaction rates are considered as node strength, we find that, at lower temperatures, nuclide half-life scales reciprocally with its out-strength. The connection between physical properties and topological characteristics may help to explore the boundary of the nuclide chart.

Tangle-Free Finite Element Mesh Motion for Ablation Problems

NASA Technical Reports Server (NTRS)

Droba, Justin

2016-01-01

Mesh motion is the process by which a computational domain is updated in time to reflect physical changes in the material the domain represents. Such a technique is needed in the study of the thermal response of ablative materials, which erode when strong heating is applied to the boundary. Traditionally, the thermal solver is coupled with a linear elastic or biharmonic system whose sole purpose is to update mesh node locations in response to altering boundary heating. Simple mesh motion algorithms rely on boundary surface normals. In such schemes, evolution in time will eventually cause the mesh to intersect and "tangle" with itself, causing failure. Furthermore, such schemes are greatly limited in the problems geometries on which they will be successful. This paper presents a comprehensive and sophisticated scheme that tailors the directions of motion based on context. By choosing directions for each node smartly, the inevitable tangle can be completely avoided and mesh motion on complex geometries can be modeled accurately.

Boundary Recovery For Delaunay Tetrahedral Meshes Using Local Topological Transformations

PubMed Central

Ghadyani, Hamid; Sullivan, John; Wu, Ziji

2009-01-01

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

Efficient discretization in finite difference method

NASA Astrophysics Data System (ADS)

Rozos, Evangelos; Koussis, Antonis; Koutsoyiannis, Demetris

2015-04-01

Finite difference method (FDM) is a plausible and simple method for solving partial differential equations. The standard practice is to use an orthogonal discretization to form algebraic approximate formulations of the derivatives of the unknown function and a grid, much like raster maps, to represent the properties of the function domain. For example, for the solution of the groundwater flow equation, a raster map is required for the characterization of the discretization cells (flow cell, no-flow cell, boundary cell, etc.), and two raster maps are required for the hydraulic conductivity and the storage coefficient. Unfortunately, this simple approach to describe the topology comes along with the known disadvantages of the FDM (rough representation of the geometry of the boundaries, wasted computational resources in the unavoidable expansion of the grid refinement in all cells of the same column and row, etc.). To overcome these disadvantages, Hunt has suggested an alternative approach to describe the topology, the use of an array of neighbours. This limits the need for discretization nodes only for the representation of the boundary conditions and the flow domain. Furthermore, the geometry of the boundaries is described more accurately using a vector representation. Most importantly, graded meshes can be employed, which are capable of restricting grid refinement only in the areas of interest (e.g. regions where hydraulic head varies rapidly, locations of pumping wells, etc.). In this study, we test the Hunt approach against MODFLOW, a well established finite difference model, and the Finite Volume Method with Simplified Integration (FVMSI). The results of this comparison are examined and critically discussed.

An Investigation of Starting Point Preferences in Human Performance on Traveling Salesman Problems

ERIC Educational Resources Information Center

MacGregor, James N.

2014-01-01

Previous studies have shown that people start traveling sales problem tours significantly more often from boundary than from interior nodes. There are a number of possible reasons for such a tendency: first, it may arise as a direct result of the processes involved in tour construction; second, boundary points may be perceptually more salient than…

Codimension-1 Sliding Bifurcations of a Filippov Pest Growth Model with Threshold Policy

NASA Astrophysics Data System (ADS)

Tang, Sanyi; Tang, Guangyao; Qin, Wenjie

A Filippov system is proposed to describe the stage structured nonsmooth pest growth with threshold policy control (TPC). The TPC measure is represented by the total density of both juveniles and adults being chosen as an index for decisions on when to implement chemical control strategies. The proposed Filippov system can have three pieces of sliding segments and three pseudo-equilibria, which result in rich sliding mode bifurcations and local sliding bifurcations including boundary node (boundary focus, or boundary saddle) and tangency bifurcations. As the threshold density varies the model exhibits the interesting global sliding bifurcations sequentially: touching → buckling → crossing → sliding homoclinic orbit to a pseudo-saddle → crossing → touching bifurcations. In particular, bifurcation of a homoclinic orbit to a pseudo-saddle with a figure of eight shape, to a pseudo-saddle-node or to a standard saddle-node have been observed for some parameter sets. This implies that control outcomes are sensitive to the threshold level, and hence it is crucial to choose the threshold level to initiate control strategy. One more sliding segment (or pseudo-equilibrium) is induced by the total density of a population guided switching policy, compared to only the juvenile density guided policy, implying that this control policy is more effective in terms of preventing multiple pest outbreaks or causing the density of pests to stabilize at a desired level such as an economic threshold.

Change Point Detection in Correlation Networks

NASA Astrophysics Data System (ADS)

Barnett, Ian; Onnela, Jukka-Pekka

2016-01-01

Many systems of interacting elements can be conceptualized as networks, where network nodes represent the elements and network ties represent interactions between the elements. In systems where the underlying network evolves, it is useful to determine the points in time where the network structure changes significantly as these may correspond to functional change points. We propose a method for detecting change points in correlation networks that, unlike previous change point detection methods designed for time series data, requires minimal distributional assumptions. We investigate the difficulty of change point detection near the boundaries of the time series in correlation networks and study the power of our method and competing methods through simulation. We also show the generalizable nature of the method by applying it to stock price data as well as fMRI data.

Synthesis of natural flows at selected sites in and near the Milk River basin, Montana, 1928-89

USGS Publications Warehouse

Cary, L.E.; Parrett, Charles

1995-01-01

Natural monthly streamflows were synthesized for the years 1928-89 at 2 sites in the St. Mary River Basin and 11 sites in the Milk River Basin in north- central Montana. The sites are represented as nodes in a streamflow accounting model being developed by the Bureau of Reclamation for the Milk River Basin. Recorded flows at most sites have been affected by human activities, including reservoir storage and irrigation diversions. The flows at the model nodes were corrected for the effects of these activities to obtain synthesized flows. The synthesized flows at nodes with seasonal and short-term records were extended using a statistical technique. The methods of synthesis varied, depending on upstream activities and information available. Flows at sites in the St. Mary River Basin and at the Milk River at Eastern Crossing of International Boundary pre- viously had been synthesized. The flows at mainstem sites downstream from the Milk River at Eastern Crossing were synthesized by adding synthesized natural runoff from intervening drainage areas to natural flows for Milk River at Eastern Crossing. Natural runoff from intervening drainage areas was estimated by multiplying recorded flows at selected index gaging stations on tributary streams by the ratio of the intervening drainage area to the combined drainage area of the index stations. The recorded flows for Milk River at Western Crossing of International Boundary and for Peoples Creek near Dodson, Montana, were assumed to be natural flows. The synthesized annual flows at the mouth of the Milk River compared favorably with the recorded flows near the mouth when the effects of upstream irrigation were considered.

Efficient Broadband Simulation of Fluid-Structure Coupling for Membrane-Type Acoustic Transducer Arrays Using the Multilevel Fast Multipole Algorithm.

PubMed

Shieh, Bernard; Sabra, Karim G; Degertekin, F Levent

2016-11-01

A boundary element model provides great flexibility for the simulation of membrane-type micromachined ultrasonic transducers (MUTs) in terms of membrane shape, actuating mechanism, and array layout. Acoustic crosstalk is accounted for through a mutual impedance matrix that captures the primary crosstalk mechanism of dispersive-guided modes generated at the fluid-solid interface. However, finding the solution to the fully populated boundary element matrix equation using standard techniques requires computation time and memory usage that scales by the cube and by the square of the number of nodes, respectively, limiting simulation to a small number of membranes. We implement a solver with improved speed and efficiency through the application of a multilevel fast multipole algorithm (FMA). By approximating the fields of collections of nodes using multipole expansions of the free-space Green's function, an FMA solver can enable the simulation of hundreds of thousands of nodes while incurring an approximation error that is controllable. Convergence is drastically improved using a problem-specific block-diagonal preconditioner. We demonstrate the solver's capabilities by simulating a 32-element 7-MHz 1-D capacitive MUT (CMUT) phased array with 2880 membranes. The array is simulated using 233280 nodes for a very wide frequency band up to 50 MHz. For a simulation with 15210 nodes, the FMA solver performed ten times faster and used 32 times less memory than a standard solver based on LU decomposition. We investigate the effects of mesh density and phasing on the predicted array response and find that it is necessary to use about seven nodes over the width of the membrane to observe convergence of the solution-even below the first membrane resonance frequency-due to the influence of higher order membrane modes.

Formation mechanism of fivefold deformation twins in a face-centered cubic alloy.

PubMed

Zhang, Zhenyu; Huang, Siling; Chen, Leilei; Zhu, Zhanwei; Guo, Dongming

2017-03-28

The formation mechanism considers fivefold deformation twins originating from the grain boundaries in a nanocrystalline material, resulting in that fivefold deformation twins derived from a single crystal have not been reported by molecular dynamics simulations. In this study, fivefold deformation twins are observed in a single crystal of face-centered cubic (fcc) alloy. A new formation mechanism is proposed for fivefold deformation twins in a single crystal. A partial dislocation is emitted from the incoherent twin boundaries (ITBs) with high energy, generating a stacking fault along {111} plane, and resulting in the nucleating and growing of a twin by the successive emission of partials. A node is fixed at the intersecting center of the four different slip {111} planes. With increasing stress under the indentation, ITBs come into being close to the node, leading to the emission of a partial from the node. This generates a stacking fault along a {111} plane, nucleating and growing a twin by the continuous emission of the partials. This process repeats until the formation of fivefold deformation twins.

Formation mechanism of fivefold deformation twins in a face-centered cubic alloy

NASA Astrophysics Data System (ADS)

Zhang, Zhenyu; Huang, Siling; Chen, Leilei; Zhu, Zhanwei; Guo, Dongming

2017-03-01

The formation mechanism considers fivefold deformation twins originating from the grain boundaries in a nanocrystalline material, resulting in that fivefold deformation twins derived from a single crystal have not been reported by molecular dynamics simulations. In this study, fivefold deformation twins are observed in a single crystal of face-centered cubic (fcc) alloy. A new formation mechanism is proposed for fivefold deformation twins in a single crystal. A partial dislocation is emitted from the incoherent twin boundaries (ITBs) with high energy, generating a stacking fault along {111} plane, and resulting in the nucleating and growing of a twin by the successive emission of partials. A node is fixed at the intersecting center of the four different slip {111} planes. With increasing stress under the indentation, ITBs come into being close to the node, leading to the emission of a partial from the node. This generates a stacking fault along a {111} plane, nucleating and growing a twin by the continuous emission of the partials. This process repeats until the formation of fivefold deformation twins.

Lung vessel segmentation in CT images using graph-cuts

NASA Astrophysics Data System (ADS)

Zhai, Zhiwei; Staring, Marius; Stoel, Berend C.

2016-03-01

Accurate lung vessel segmentation is an important operation for lung CT analysis. Filters that are based on analyzing the eigenvalues of the Hessian matrix are popular for pulmonary vessel enhancement. However, due to their low response at vessel bifurcations and vessel boundaries, extracting lung vessels by thresholding the vesselness is not sufficiently accurate. Some methods turn to graph-cuts for more accurate segmentation, as it incorporates neighbourhood information. In this work, we propose a new graph-cuts cost function combining appearance and shape, where CT intensity represents appearance and vesselness from a Hessian-based filter represents shape. Due to the amount of voxels in high resolution CT scans, the memory requirement and time consumption for building a graph structure is very high. In order to make the graph representation computationally tractable, those voxels that are considered clearly background are removed from the graph nodes, using a threshold on the vesselness map. The graph structure is then established based on the remaining voxel nodes, source/sink nodes and the neighbourhood relationship of the remaining voxels. Vessels are segmented by minimizing the energy cost function with the graph-cuts optimization framework. We optimized the parameters used in the graph-cuts cost function and evaluated the proposed method with two manually labeled sub-volumes. For independent evaluation, we used 20 CT scans of the VESSEL12 challenge. The evaluation results of the sub-volume data show that the proposed method produced a more accurate vessel segmentation compared to the previous methods, with F1 score 0.76 and 0.69. In the VESSEL12 data-set, our method obtained a competitive performance with an area under the ROC curve of 0.975, especially among the binary submissions.

Binary partition tree analysis based on region evolution and its application to tree simplification.

PubMed

Lu, Huihai; Woods, John C; Ghanbari, Mohammed

2007-04-01

Pyramid image representations via tree structures are recognized methods for region-based image analysis. Binary partition trees can be applied which document the merging process with small details found at the bottom levels and larger ones close to the root. Hindsight of the merging process is stored within the tree structure and provides the change histories of an image property from the leaf to the root node. In this work, the change histories are modelled by evolvement functions and their second order statistics are analyzed by using a knee function. Knee values show the reluctancy of each merge. We have systematically formulated these findings to provide a novel framework for binary partition tree analysis, where tree simplification is demonstrated. Based on an evolvement function, for each upward path in a tree, the tree node associated with the first reluctant merge is considered as a pruning candidate. The result is a simplified version providing a reduced solution space and still complying with the definition of a binary tree. The experiments show that image details are preserved whilst the number of nodes is dramatically reduced. An image filtering tool also results which preserves object boundaries and has applications for segmentation.

Unstructured Cartesian refinement with sharp interface immersed boundary method for 3D unsteady incompressible flows

NASA Astrophysics Data System (ADS)

Angelidis, Dionysios; Chawdhary, Saurabh; Sotiropoulos, Fotis

2016-11-01

A novel numerical method is developed for solving the 3D, unsteady, incompressible Navier-Stokes equations on locally refined fully unstructured Cartesian grids in domains with arbitrarily complex immersed boundaries. Owing to the utilization of the fractional step method on an unstructured Cartesian hybrid staggered/non-staggered grid layout, flux mismatch and pressure discontinuity issues are avoided and the divergence free constraint is inherently satisfied to machine zero. Auxiliary/hanging nodes are used to facilitate the discretization of the governing equations. The second-order accuracy of the solver is ensured by using multi-dimension Lagrange interpolation operators and appropriate differencing schemes at the interface of regions with different levels of refinement. The sharp interface immersed boundary method is augmented with local near-boundary refinement to handle arbitrarily complex boundaries. The discrete momentum equation is solved with the matrix free Newton-Krylov method and the Krylov-subspace method is employed to solve the Poisson equation. The second-order accuracy of the proposed method on unstructured Cartesian grids is demonstrated by solving the Poisson equation with a known analytical solution. A number of three-dimensional laminar flow simulations of increasing complexity illustrate the ability of the method to handle flows across a range of Reynolds numbers and flow regimes. Laminar steady and unsteady flows past a sphere and the oblique vortex shedding from a circular cylinder mounted between two end walls demonstrate the accuracy, the efficiency and the smooth transition of scales and coherent structures across refinement levels. Large-eddy simulation (LES) past a miniature wind turbine rotor, parameterized using the actuator line approach, indicates the ability of the fully unstructured solver to simulate complex turbulent flows. Finally, a geometry resolving LES of turbulent flow past a complete hydrokinetic turbine illustrates the potential of the method to simulate turbulent flows past geometrically complex bodies on locally refined meshes. In all the cases, the results are found to be in very good agreement with published data and savings in computational resources are achieved.

Parameter-dependent behaviour of periodic channels in a locus of boundary crisis

NASA Astrophysics Data System (ADS)

Rankin, James; Osinga, Hinke M.

2017-06-01

A boundary crisis occurs when a chaotic attractor outgrows its basin of attraction and suddenly disappears. As previously reported, the locus of a boundary crisis is organised by homo- or heteroclinic tangencies between the stable and unstable manifolds of saddle periodic orbits. In two parameters, such tangencies lead to curves, but the locus of boundary crisis along those curves exhibits gaps or channels, in which other non-chaotic attractors persist. These attractors are stable periodic orbits which themselves can undergo a cascade of period-doubling bifurcations culminating in multi-component chaotic attractors. The canonical diffeomorphic two-dimensional Hénon map exhibits such periodic channels, which are structured in a particular ordered way: each channel is bounded on one side by a saddle-node bifurcation and on the other by a period-doubling cascade to chaos; furthermore, all channels seem to have the same orientation, with the saddle-node bifurcation always on the same side. We investigate the locus of boundary crisis in the Ikeda map, which models the dynamics of energy levels in a laser ring cavity. We find that the Ikeda map features periodic channels with a richer and more general organisation than for the Hénon map. Using numerical continuation, we investigate how the periodic channels depend on a third parameter and characterise how they split into multiple channels with different properties.

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.

Constant-concentration boundary condition: Lessons from the HYDROCOIN variable-density groundwater benchmark problem

USGS Publications Warehouse

Konikow, Leonard F.; Sanford, W.E.; Campbell, P.J.

1997-01-01

In a solute-transport model, if a constant-concentration boundary condition is applied at a node in an active flow field, a solute flux can occur by both advective and dispersive processes. The potential for advective release is demonstrated by reexamining the Hydrologic Code Intercomparison (HYDROCOIN) project case 5 problem, which represents a salt dome overlain by a shallow groundwater system. The resulting flow field includes significant salinity and fluid density variations. Several independent teams simulated this problem using finite difference or finite element numerical models. We applied a method-of-characteristics model (MOCDENSE). The previous numerical implementations by HYDROCOIN teams of a constant-concentration boundary to represent salt release by lateral dispersion only (as stipulated in the original problem definition) was flawed because this boundary condition allows the release of salt into the flow field by both dispersion and advection. When the constant-concentration boundary is modified to allow salt release by dispersion only, significantly less salt is released into the flow field. The calculated brine distribution for case 5 depends very little on which numerical model is used, as long as the selected model is solving the proper equations. Instead, the accuracy of the solution depends strongly on the proper conceptualization of the problem, including the detailed design of the constant-concentration boundary condition. The importance and sensitivity to the manner of specification of this boundary does not appear to have been recognized previously in the analysis of this problem.

Implementation of the glacial rebound prestress advection correction in general-purpose finite element analysis software: Springs versus foundations

NASA Astrophysics Data System (ADS)

Schmidt, Peter; Lund, Björn; Hieronymus, Christoph

2012-03-01

When general-purpose finite element analysis software is used to model glacial isostatic adjustment (GIA), the first-order effect of prestress advection has to be accounted for by the user. We show here that the common use of elastic foundations at boundaries between materials of different densities will produce incorrect displacements, unless the boundary is perpendicular to the direction of gravity. This is due to the foundations always acting perpendicular to the surface to which they are attached, while the body force they represent always acts in the direction of gravity. If prestress advection is instead accounted for by the use of elastic spring elements in the direction of gravity, the representation will be correct. The use of springs adds a computation of the spring constants to the analysis. The spring constant for a particular node is defined by the product of the density contrast at the boundary, the gravitational acceleration, and the area supported by the node. To be consistent with the finite element formulation, the area is evaluated by integration of the nodal shape functions. We outline an algorithm for the calculation and include a Python script that integrates the shape functions over a bilinear quadrilateral element. For linear rectangular and triangular elements, the area supported by each node is equal to the element area divided the number of defining nodes, thereby simplifying the computation. This is, however, not true in the general nonrectangular case, and we demonstrate this with a simple 1-element model. The spring constant calculation is simple and performed in the preprocessing stage of the analysis. The time spent on the calculation is more than compensated for by a shorter analysis time, compared to that for a model with foundations. We illustrate the effects of using springs versus foundations with a simple two-dimensional GIA model of glacial loading, where the Earth model has an inclined boundary between the overlying elastic layer and the lower viscoelastic layer. Our example shows that the error introduced by the use of foundations is large enough to affect an analysis based on high-accuracy geodetic data.

Toward the Reliability of Fault Representation Methods in Finite Difference Schemes for Simulation of Shear Rupture Propagation

NASA Astrophysics Data System (ADS)

Dalguer, L. A.; Day, S. M.

2006-12-01

Accuracy in finite difference (FD) solutions to spontaneous rupture problems is controlled principally by the scheme used to represent the fault discontinuity, and not by the grid geometry used to represent the continuum. We have numerically tested three fault representation methods, the Thick Fault (TF) proposed by Madariaga et al (1998), the Stress Glut (SG) described by Andrews (1999), and the Staggered-Grid Split-Node (SGSN) methods proposed by Dalguer and Day (2006), each implemented in a the fourth-order velocity-stress staggered-grid (VSSG) FD scheme. The TF and the SG methods approximate the discontinuity through inelastic increments to stress components ("inelastic-zone" schemes) at a set of stress grid points taken to lie on the fault plane. With this type of scheme, the fault surface is indistinguishable from an inelastic zone with a thickness given by a spatial step dx for the SG, and 2dx for the TF model. The SGSN method uses the traction-at-split-node (TSN) approach adapted to the VSSG FD. This method represents the fault discontinuity by explicitly incorporating discontinuity terms at velocity nodes in the grid, with interactions between the "split nodes" occurring exclusively through the tractions (frictional resistance) acting between them. These tractions in turn are controlled by the jump conditions and a friction law. Our 3D tests problem solutions show that the inelastic-zone TF and SG methods show much poorer performance than does the SGSN formulation. The SG inelastic-zone method achieved solutions that are qualitatively meaningful and quantitatively reliable to within a few percent. The TF inelastic-zone method did not achieve qualitatively agreement with the reference solutions to the 3D test problem, and proved to be sufficiently computationally inefficient that it was not feasible to explore convergence quantitatively. The SGSN method gives very accurate solutions, and is also very efficient. Reliable solution of the rupture time is reached with a median resolution of the cohesive zone of only ~2 grid points, and efficiency is competitive with the Boundary Integral (BI) method. The results presented here demonstrate that appropriate fault representation in a numerical scheme is crucial to reduce uncertainties in numerical simulations of earthquake source dynamics and ground motion, and therefore important to improving our understanding of earthquake physics in general.

GPU-accelerated Modeling and Element-free Reverse-time Migration with Gauss Points Partition

NASA Astrophysics Data System (ADS)

Zhen, Z.; Jia, X.

2014-12-01

Element-free method (EFM) has been applied to seismic modeling and migration. Compared with finite element method (FEM) and finite difference method (FDM), it is much cheaper and more flexible because only the information of the nodes and the boundary of the study area are required in computation. In the EFM, the number of Gauss points should be consistent with the number of model nodes; otherwise the accuracy of the intermediate coefficient matrices would be harmed. Thus when we increase the nodes of velocity model in order to obtain higher resolution, we find that the size of the computer's memory will be a bottleneck. The original EFM can deal with at most 81×81 nodes in the case of 2G memory, as tested by Jia and Hu (2006). In order to solve the problem of storage and computation efficiency, we propose a concept of Gauss points partition (GPP), and utilize the GPUs to improve the computation efficiency. Considering the characteristics of the Gaussian points, the GPP method doesn't influence the propagation of seismic wave in the velocity model. To overcome the time-consuming computation of the stiffness matrix (K) and the mass matrix (M), we also use the GPUs in our computation program. We employ the compressed sparse row (CSR) format to compress the intermediate sparse matrices and try to simplify the operations by solving the linear equations with the CULA Sparse's Conjugate Gradient (CG) solver instead of the linear sparse solver 'PARDISO'. It is observed that our strategy can significantly reduce the computational time of K and Mcompared with the algorithm based on CPU. The model tested is Marmousi model. The length of the model is 7425m and the depth is 2990m. We discretize the model with 595x298 nodes, 300x300 Gauss cells and 3x3 Gauss points in each cell. In contrast to the computational time of the conventional EFM, the GPUs-GPP approach can substantially improve the efficiency. The speedup ratio of time consumption of computing K, M is 120 and the speedup ratio time consumption of RTM is 11.5. At the same time, the accuracy of imaging is not harmed. Another advantage of the GPUs-GPP method is its easy applications in other numerical methods such as the FEM. Finally, in the GPUs-GPP method, the arrays require quite limited memory storage, which makes the method promising in dealing with large-scale 3D problems.

On the sub-model errors of a generalized one-way coupling scheme for linking models at different scales

NASA Astrophysics Data System (ADS)

Zeng, Jicai; Zha, Yuanyuan; Zhang, Yonggen; Shi, Liangsheng; Zhu, Yan; Yang, Jinzhong

2017-11-01

Multi-scale modeling of the localized groundwater flow problems in a large-scale aquifer has been extensively investigated under the context of cost-benefit controversy. An alternative is to couple the parent and child models with different spatial and temporal scales, which may result in non-trivial sub-model errors in the local areas of interest. Basically, such errors in the child models originate from the deficiency in the coupling methods, as well as from the inadequacy in the spatial and temporal discretizations of the parent and child models. In this study, we investigate the sub-model errors within a generalized one-way coupling scheme given its numerical stability and efficiency, which enables more flexibility in choosing sub-models. To couple the models at different scales, the head solution at parent scale is delivered downward onto the child boundary nodes by means of the spatial and temporal head interpolation approaches. The efficiency of the coupling model is improved either by refining the grid or time step size in the parent and child models, or by carefully locating the sub-model boundary nodes. The temporal truncation errors in the sub-models can be significantly reduced by the adaptive local time-stepping scheme. The generalized one-way coupling scheme is promising to handle the multi-scale groundwater flow problems with complex stresses and heterogeneity.

Numerical solution to the oblique derivative boundary value problem on non-uniform grids above the Earth topography

NASA Astrophysics Data System (ADS)

Medl'a, Matej; Mikula, Karol; Čunderlík, Róbert; Macák, Marek

2018-01-01

The paper presents a numerical solution of the oblique derivative boundary value problem on and above the Earth's topography using the finite volume method (FVM). It introduces a novel method for constructing non-uniform hexahedron 3D grids above the Earth's surface. It is based on an evolution of a surface, which approximates the Earth's topography, by mean curvature. To obtain optimal shapes of non-uniform 3D grid, the proposed evolution is accompanied by a tangential redistribution of grid nodes. Afterwards, the Laplace equation is discretized using FVM developed for such a non-uniform grid. The oblique derivative boundary condition is treated as a stationary advection equation, and we derive a new upwind type discretization suitable for non-uniform 3D grids. The discretization of the Laplace equation together with the discretization of the oblique derivative boundary condition leads to a linear system of equations. The solution of this system gives the disturbing potential in the whole computational domain including the Earth's surface. Numerical experiments aim to show properties and demonstrate efficiency of the developed FVM approach. The first experiments study an experimental order of convergence of the method. Then, a reconstruction of the harmonic function on the Earth's topography, which is generated from the EGM2008 or EIGEN-6C4 global geopotential model, is presented. The obtained FVM solutions show that refining of the computational grid leads to more precise results. The last experiment deals with local gravity field modelling in Slovakia using terrestrial gravity data. The GNSS-levelling test shows accuracy of the obtained local quasigeoid model.

Control of minimum member size in parameter-free structural shape optimization by a medial axis approximation

NASA Astrophysics Data System (ADS)

Schmitt, Oliver; Steinmann, Paul

2018-06-01

We introduce a manufacturing constraint for controlling the minimum member size in structural shape optimization problems, which is for example of interest for components fabricated in a molding process. In a parameter-free approach, whereby the coordinates of the FE boundary nodes are used as design variables, the challenging task is to find a generally valid definition for the thickness of non-parametric geometries in terms of their boundary nodes. Therefore we use the medial axis, which is the union of all points with at least two closest points on the boundary of the domain. Since the effort for the exact computation of the medial axis of geometries given by their FE discretization highly increases with the number of surface elements we use the distance function instead to approximate the medial axis by a cloud of points. The approximation is demonstrated on three 2D examples. Moreover, the formulation of a minimum thickness constraint is applied to a sensitivity-based shape optimization problem of one 2D and one 3D model.

Control of minimum member size in parameter-free structural shape optimization by a medial axis approximation

NASA Astrophysics Data System (ADS)

Schmitt, Oliver; Steinmann, Paul

2017-09-01

We introduce a manufacturing constraint for controlling the minimum member size in structural shape optimization problems, which is for example of interest for components fabricated in a molding process. In a parameter-free approach, whereby the coordinates of the FE boundary nodes are used as design variables, the challenging task is to find a generally valid definition for the thickness of non-parametric geometries in terms of their boundary nodes. Therefore we use the medial axis, which is the union of all points with at least two closest points on the boundary of the domain. Since the effort for the exact computation of the medial axis of geometries given by their FE discretization highly increases with the number of surface elements we use the distance function instead to approximate the medial axis by a cloud of points. The approximation is demonstrated on three 2D examples. Moreover, the formulation of a minimum thickness constraint is applied to a sensitivity-based shape optimization problem of one 2D and one 3D model.

Integration of Mesh Optimization with 3D All-Hex Mesh Generation, LDRD Subcase 3504340000, Final Report

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

KNUPP,PATRICK; MITCHELL,SCOTT A.

1999-11-01

In an attempt to automatically produce high-quality all-hex meshes, we investigated a mesh improvement strategy: given an initial poor-quality all-hex mesh, we iteratively changed the element connectivity, adding and deleting elements and nodes, and optimized the node positions. We found a set of hex reconnection primitives. We improved the optimization algorithms so they can untangle a negative-Jacobian mesh, even considering Jacobians on the boundary, and subsequently optimize the condition number of elements in an untangled mesh. However, even after applying both the primitives and optimization we were unable to produce high-quality meshes in certain regions. Our experiences suggest that manymore » boundary configurations of quadrilaterals admit no hexahedral mesh with positive Jacobians, although we have no proof of this.« less

Local lymph node assay (LLNA): comparison of different protocols by testing skin-sensitizing epoxy resin system components.

PubMed

Gamer, Armin O; Nies, Eberhard; Vohr, Hans-Werner

2008-12-01

Thirteen epoxy resin system components were tested in the LLNA with regard to their sensitizing potency. Lymph node stimulation was quantified not only by measuring the incorporation of [3H]-thymidine into the ear lymph nodes but also the counts of cells recovered from these organs. Equivalent figures were obtained with both endpoints used for the evaluation of lymph node cell proliferation if the reference stimulation indices were adjusted. When dissolved in acetone, all test substances showed skin-sensitizing potential, mainly on the boundary between "strong" and "moderate" according to common potency evaluation schemes. Replacing acetone with acetone/olive oil (4:1) as a vehicle for four selected test items, resulted in considerably lower estimated concentrations for sensitization induction. The challenges in comparing the results obtained by different LLNA variations are discussed.

Aeroacoustic simulation of a linear cascade by a prefactored compact scheme

NASA Astrophysics Data System (ADS)

Ghillani, Pietro

This work documents the development of a three-dimensional high-order prefactored compact finite-difference solver for computational aeroacoustics (CAA) based on the inviscid Euler equations. This time explicit scheme is applied to representative problems of sound generation by flow interacting with solid boundaries. Four aeroacoustic problems are explored and the results validated against available reference analytical solution. Selected mesh convergence studies are conducted to determine the effective order of accuracy of the complete scheme. The first test case simulates the noise emitted by a still cylinder in an oscillating field. It provides a simple validation for the CAA-compatible solid wall condition used in the remainder of the work. The following test cases are increasingly complex versions of the turbomachinery rotor-stator interaction problem taken from NASA CAA workshops. In all the cases the results are compared against the available literature. The numerical method features some appreciable contributions to computational aeroacoustics. A reduced data exchange technique for parallel computations is implemented, which requires the exchange of just two values for each boundary node, independently of the size of the zone overlap. A modified version of the non-reflecting buffer layer by Chen is used to allow aerodynamic perturbations at the through flow boundaries. The Giles subsonic boundary conditions are extended to three-dimensional curvilinear coordinates. These advances have enabled to resolve the aerodynamic noise generation and near-field propagation on a representative cascade geometry with a time-marching scheme, with accuracy similar to spectral methods..

Three-dimensional object surface identification

NASA Astrophysics Data System (ADS)

Celenk, Mehmet

1995-03-01

This paper describes a computationally efficient matching method for inspecting 3D objects using their serial cross sections. Object regions of interest in cross-sectional binary images of successive slices are aligned with those of the models. Cross-sectional differences between the object and the models are measured in the direction of the gradient of the cross section boundary. This is repeated in all the cross-sectional images. The model with minimum average cross-sectional difference is selected as the best match to the given object (i.e., no defect). The method is tested using various computer generated surfaces and matching results are presented. It is also demonstrated using Symult S-2010 16-node system that the method is suitable for parallel implementation in massage passing processors with the maximum attainable speedup (close to 16 for S-2010).

Topological edge states in ultra thin Bi(110) puckered crystal lattice

NASA Astrophysics Data System (ADS)

Wang, Baokai; Hsu, Chuanghan; Chang, Guoqing; Lin, Hsin; Bansil, Arun

We discuss the electronic structure of a 2-ML Bi(110) film with a crystal structure similar to that of black phosphorene. In the absence of Spin-Orbit coupling (SOC), the film is found to be a semimetal with two kinds of Dirac cones, which are classified by their locations in the Brillouin zone. All Dirac nodes are protected by crystal symmetry and carry non-zero winding numbers. When considering ribbons, along specific directions, projections of Dirac nodes serve as starting or ending points of edge bands depending on the sign of their carried winding number. After the inclusion of the SOC, all Dirac nodes are gapped out. Correspondingly, the edge states connecting Dirac nodes split and cross each other, and thus form a Dirac node at the boundary of the 1D Brillouin zone, which suggests that the system is a Quantum Spin Hall insulator. The nontrivial Quantum Spin Hall phase is also confirmed by counting the product of parities of the occupied bands at time-reversal invariant points.

IGA-ADS: Isogeometric analysis FEM using ADS solver

NASA Astrophysics Data System (ADS)

Łoś, Marcin M.; Woźniak, Maciej; Paszyński, Maciej; Lenharth, Andrew; Hassaan, Muhamm Amber; Pingali, Keshav

2017-08-01

In this paper we present a fast explicit solver for solution of non-stationary problems using L2 projections with isogeometric finite element method. The solver has been implemented within GALOIS framework. It enables parallel multi-core simulations of different time-dependent problems, in 1D, 2D, or 3D. We have prepared the solver framework in a way that enables direct implementation of the selected PDE and corresponding boundary conditions. In this paper we describe the installation, implementation of exemplary three PDEs, and execution of the simulations on multi-core Linux cluster nodes. We consider three case studies, including heat transfer, linear elasticity, as well as non-linear flow in heterogeneous media. The presented package generates output suitable for interfacing with Gnuplot and ParaView visualization software. The exemplary simulations show near perfect scalability on Gilbert shared-memory node with four Intel® Xeon® CPU E7-4860 processors, each possessing 10 physical cores (for a total of 40 cores).

Resonance Shift of Single-Axis Acoustic Levitation

NASA Astrophysics Data System (ADS)

Xie, Wen-Jun; Wei, Bing-Bo

2007-01-01

The resonance shift due to the presence and movement of a rigid spherical sample in a single-axis acoustic levitator is studied with the boundary element method on the basis of a two-cylinder model of the levitator. The introduction of a sample into the sound pressure nodes, where it is usually levitated, reduces the resonant interval Hn (n is the mode number) between the reflector and emitter. The larger the sample radius, the greater the resonance shift. When the sample moves along the symmetric axis, the resonance interval Hn varies in an approximately periodical manner, which reaches the minima near the pressure nodes and the maxima near the pressure antinodes. This suggests a resonance interval oscillation around its minimum if the stably levitated sample is slightly perturbed. The dependence of the resonance shift on the sample radius R and position h for the single-axis acoustic levitator is compared with Leung's theory for a closed rectangular chamber, which shows a good agreement.

Use of Picard and Newton iteration for solving nonlinear ground water flow equations

USGS Publications Warehouse

Mehl, S.

2006-01-01

This study examines the use of Picard and Newton iteration to solve the nonlinear, saturated ground water flow equation. Here, a simple three-node problem is used to demonstrate the convergence difficulties that can arise when solving the nonlinear, saturated ground water flow equation in both homogeneous and heterogeneous systems with and without nonlinear boundary conditions. For these cases, the characteristic types of convergence patterns are examined. Viewing these convergence patterns as orbits of an attractor in a dynamical system provides further insight. It is shown that the nonlinearity that arises from nonlinear head-dependent boundary conditions can cause more convergence difficulties than the nonlinearity that arises from flow in an unconfined aquifer. Furthermore, the effects of damping on both convergence and convergence rate are investigated. It is shown that no single strategy is effective for all problems and how understanding pitfalls and merits of several methods can be helpful in overcoming convergence difficulties. Results show that Picard iterations can be a simple and effective method for the solution of nonlinear, saturated ground water flow problems.

Self-organized classification of boundary layer meteorology and associated characteristics of air quality in Beijing

NASA Astrophysics Data System (ADS)

Liao, Zhiheng; Sun, Jiaren; Yao, Jialin; Liu, Li; Li, Haowen; Liu, Jian; Xie, Jielan; Wu, Dui; Fan, Shaojia

2018-05-01

Self-organizing maps (SOMs; a feature-extracting technique based on an unsupervised machine learning algorithm) are used to classify atmospheric boundary layer (ABL) meteorology over Beijing through detecting topological relationships among the 5-year (2013-2017) radiosonde-based virtual potential temperature profiles. The classified ABL types are then examined in relation to near-surface pollutant concentrations to understand the modulation effects of the changing ABL meteorology on Beijing's air quality. Nine ABL types (i.e., SOM nodes) are obtained through the SOM classification technique, and each is characterized by distinct dynamic and thermodynamic conditions. In general, the self-organized ABL types are able to distinguish between high and low loadings of near-surface pollutants. The average concentrations of PM2.5, NO2 and CO dramatically increased from the near neutral (i.e., Node 1) to strong stable conditions (i.e., Node 9) during all seasons except for summer. Since extremely strong stability can isolate the near-surface observations from the influence of elevated SO2 pollution layers, the highest average SO2 concentrations are typically observed in Node 3 (a layer with strong stability in the upper ABL) rather than Node 9. In contrast, near-surface O3 shows an opposite dependence on atmospheric stability, with the lowest average concentration in Node 9. Analysis of three typical pollution months (i.e., January 2013, December 2015 and December 2016) suggests that the ABL types are the primary drivers of day-to-day variations in Beijing's air quality. Assuming a fixed relationship between ABL type and PM2.5 loading for different years, the relative (absolute) contributions of the ABL anomaly to elevated PM2.5 levels are estimated to be 58.3 % (44.4 µg m-3) in January 2013, 46.4 % (22.2 µg m-3) in December 2015 and 73.3 % (34.6 µg m-3) in December 2016.

Tracking Nonpalpable Breast Cancer for Breast-conserving Surgery With Carbon Nanoparticles

PubMed Central

Jiang, Yanyan; Lin, Nan; Huang, Sheng; Lin, Chongping; Jin, Na; Zhang, Zaizhong; Ke, Jun; Yu, Yinghao; Zhu, Jianping; Wang, Yu

2015-01-01

Abstract To examine the feasibility of using carbon nanoparticles to track nonpalpable breast cancer for breast-conserving surgery. During breast-conserving surgery, it is often very challenging to determine the boundary of tumor and identify involved lymph nodes. Currently used methods are useful in identifying tumor location, but do not provide direct visual guidance for resection margin during surgery. The study was approved by the Institutional Review Board of the Fuzhou General Hospital (Fuzhou, China). The current retrospective analysis included 16 patients with nonpalpable breast cancer receiving breast-conserving surgery under the guidance of preoperative marking using a carbon nanoparticle, as well as 3 patients receiving carbon nanoparticle marking followed by neoadjuvant treatment and then breast-conserving surgery. The Tumor Node Metastasis stage in the 16 cases included: T1N0M0 in 7, T1N1M0 in 2, T2N0M0 in 4, and T2N1M0 in the remaining 3 cases. The nanoparticle was injected at 12 sites at 0.5 cm away from the apparent edge under colored ultrasonography along 6 tracks separated by 60 degrees (2 sites every track). Lymph node status was also examined. The resection edge was free from cancer cells in all 16 cases (and the 3 cases with neoadjuvant treatment). Cancer cells were identified in majority of stained lymph nodes, but not in any of the unstained lymph nodes. No recurrence or metastasis was noticed after the surgery (2 to 22-month follow-up; median: 6 months). Tracking nonpalpable breast cancer with carbon nanoparticle could guide breast-conserving surgery. PMID:25761181

Selective MBE growth of hexagonal networks of trapezoidal and triangular GaAs nanowires on patterned (1 1 1)B substrates

NASA Astrophysics Data System (ADS)

Tamai, Isao; Hasegawa, Hideki

2007-04-01

As a combination of novel hardware architecture and novel system architecture for future ultrahigh-density III-V nanodevice LSIs, the authors' group has recently proposed a hexagonal binary decision diagram (BDD) quantum circuit approach where gate-controlled path switching BDD node devices for a single or few electrons are laid out on a hexagonal nanowire network to realize a logic function. In this paper, attempts are made to establish a method to grow highly dense hexagonal nanowire networks for future BDD circuits by selective molecular beam epitaxy (MBE) on (1 1 1)B substrates. The (1 1 1)B orientation is suitable for BDD architecture because of the basic three-fold symmetry of the BDD node device. The growth experiments showed complex evolution of the cross-sectional structures, and it was explained in terms of kinetics determining facet boundaries. Straight arrays of triangular nanowires with 60 nm base width as well as hexagonal arrays of trapezoidal nanowires with a node density of 7.5×10 6 cm -2 were successfully grown with the aid of computer simulation. The result shows feasibility of growing high-density hexagonal networks of GaAs nanowires with precise control of the shape and size.

Research on Finite Element Model Generating Method of General Gear Based on Parametric Modelling

NASA Astrophysics Data System (ADS)

Lei, Yulong; Yan, Bo; Fu, Yao; Chen, Wei; Hou, Liguo

2017-06-01

Aiming at the problems of low efficiency and poor quality of gear meshing in the current mainstream finite element software, through the establishment of universal gear three-dimensional model, and explore the rules of unit and node arrangement. In this paper, a finite element model generation method of universal gear based on parameterization is proposed. Visual Basic program is used to realize the finite element meshing, give the material properties, and set the boundary / load conditions and other pre-processing work. The dynamic meshing analysis of the gears is carried out with the method proposed in this pape, and compared with the calculated values to verify the correctness of the method. The method greatly shortens the workload of gear finite element pre-processing, improves the quality of gear mesh, and provides a new idea for the FEM pre-processing.

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Chima, Rodrick V.; Turkel, Eli; Schaffer, Steve

1987-01-01

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Garbage Collection in a Distributed Object-Oriented System

NASA Technical Reports Server (NTRS)

Gupta, Aloke; Fuchs, W. Kent

1993-01-01

An algorithm is described in this paper for garbage collection in distributed systems with object sharing across processor boundaries. The algorithm allows local garbage collection at each node in the system to proceed independently of local collection at the other nodes. It requires no global synchronization or knowledge of the global state of the system and exhibits the capability of graceful degradation. The concept of a specialized dump node is proposed to facilitate the collection of inaccessible circular structures. An experimental evaluation of the algorithm is also described. The algorithm is compared with a corresponding scheme that requires global synchronization. The results show that the algorithm works well in distributed processing environments even when the locality of object references is low.

Three-dimensional separation and reattachment

NASA Technical Reports Server (NTRS)

Peake, D. J.; Tobak, M.

1982-01-01

The separation of three dimensional turbulent boundary layers from the lee of flight vehicles at high angles of attack is investigated. The separation results in dominant, large scale, coiled vortex motions that pass along the body in the general direction of the free stream. In all cases of three dimensional flow separation and reattachment, the assumption of continuous vector fields of skin friction lines and external flow streamlines, coupled with simple laws of topology, provides a flow grammar whose elemental constituents are the singular points: the nodes, spiral nodes (foci), and saddles. The phenomenon of three dimensional separation may be construed as either a local or a global event, depending on whether the skin friction line that becomes a line of separation originates at a node or a saddle point.

The coupling of fluids, dynamics, and controls on advanced architecture computers

NASA Technical Reports Server (NTRS)

Atwood, Christopher

1995-01-01

This grant provided for the demonstration of coupled controls, body dynamics, and fluids computations in a workstation cluster environment; and an investigation of the impact of peer-peer communication on flow solver performance and robustness. The findings of these investigations were documented in the conference articles.The attached publication, 'Towards Distributed Fluids/Controls Simulations', documents the solution and scaling of the coupled Navier-Stokes, Euler rigid-body dynamics, and state feedback control equations for a two-dimensional canard-wing. The poor scaling shown was due to serialized grid connectivity computation and Ethernet bandwidth limits. The scaling of a peer-to-peer communication flow code on an IBM SP-2 was also shown. The scaling of the code on the switched fabric-linked nodes was good, with a 2.4 percent loss due to communication of intergrid boundary point information. The code performance on 30 worker nodes was 1.7 (mu)s/point/iteration, or a factor of three over a Cray C-90 head. The attached paper, 'Nonlinear Fluid Computations in a Distributed Environment', documents the effect of several computational rate enhancing methods on convergence. For the cases shown, the highest throughput was achieved using boundary updates at each step, with the manager process performing communication tasks only. Constrained domain decomposition of the implicit fluid equations did not degrade the convergence rate or final solution. The scaling of a coupled body/fluid dynamics problem on an Ethernet-linked cluster was also shown.

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

PubMed

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

2014-08-18

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

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

PubMed Central

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

2014-01-01

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

Hydrocarbon Status of Alluvial Soils in the Istra Morphostructural Node (Moscow Oblast)

NASA Astrophysics Data System (ADS)

Pikovskiy, Yu. I.; Gennadiev, A. N.; Kovach, R. G.; Khlynina, N. I.; Khlynina, A. V.

2017-12-01

The effect of the current block structure of the earth's crust and its most active sites (morphostructural nodes) on the natural hydrocarbon status of alluvial soils has been considered. Studies have been performed in the Istra district of Moscow oblast within the Istra morphostructural node. The node represents an area of increased geodynamic activity of the earth's crust located at the convergence or intersection of block boundaries: mobile linear zones following large river valleys with alluvial soils. Soil cover mainly consists of alluvial humic-gley soils (Eutric Gleyic Fluvisols) of different depths and alluvial mucky-gley soils (Eutric Gleyic Histic Fluvisols). Some soils manifest stratification. Two factors forming the hydrocarbon status of soils are considered: soil processes and the effect of geodynamic activity, which is manifested within the morphostructural node. The contents of bitumoids and retained methane and butanes in alluvial soils appreciably increase at the entry of river valley into the node. The occurrence frequency of 5-6-ring polycyclic aromatic hydrocarbons (perylene and benzo[ghi]perylene) in mineral horizons increases. It has been concluded that alluvial soils within the Istra morphostructural node are characterized by the biogeochemical type of hydrocarbon status with signs of emanation type at sites with the highest geodynamic activity.

Finite element modeling of diffusion and partitioning in biological systems: the infinite composite medium problem.

PubMed

Missel, P J

2000-01-01

Four methods are proposed for modeling diffusion in heterogeneous media where diffusion and partition coefficients take on differing values in each subregion. The exercise was conducted to validate finite element modeling (FEM) procedures in anticipation of modeling drug diffusion with regional partitioning into ocular tissue, though the approach can be useful for other organs, or for modeling diffusion in laminate devices. Partitioning creates a discontinuous value in the dependent variable (concentration) at an intertissue boundary that is not easily handled by available general-purpose FEM codes, which allow for only one value at each node. The discontinuity is handled using a transformation on the dependent variable based upon the region-specific partition coefficient. Methods were evaluated by their ability to reproduce a known exact result, for the problem of the infinite composite medium (Crank, J. The Mathematics of Diffusion, 2nd ed. New York: Oxford University Press, 1975, pp. 38-39.). The most physically intuitive method is based upon the concept of chemical potential, which is continuous across an interphase boundary (method III). This method makes the equation of the dependent variable highly nonlinear. This can be linearized easily by a change of variables (method IV). Results are also given for a one-dimensional problem simulating bolus injection into the vitreous, predicting time disposition of drug in vitreous and retina.

Critical temperatures of hybrid laminates using finite elements

NASA Astrophysics Data System (ADS)

Chockalingam, S.; Mathew, T. C.; Singh, G.; Rao, G. V.

1992-06-01

Thermal buckling of antisymmetric cross-ply hybrid laminates is investigated. A one-dimensional finite element based on first-order shear deformation theory, having two nodes and six degrees of freedom per node, namely axial displacement, transverse displacements and rotation of the normal to the beam axis and their derivatives with respect to beam coordinate axis, is employed for this purpose. Various types of hybrid laminates with different combination of glass/epoxy, Kevlar/epoxy and carbon/epoxy are considered. Effects of slenderness ratio, boundary conditions and lay-ups are studied in detail.

Hybrid near-optimal aeroassisted orbit transfer plane change trajectories

NASA Technical Reports Server (NTRS)

Calise, Anthony J.; Duckeman, Gregory A.

1994-01-01

In this paper, a hybrid methodology is used to determine optimal open loop controls for the atmospheric portion of the aeroassisted plane change problem. The method is hybrid in the sense that it combines the features of numerical collocation with the analytically tractable portions of the problem which result when the two-point boundary value problem is cast in the form of a regular perturbation problem. Various levels of approximation are introduced by eliminating particular collocation parameters and their effect upon problem complexity and required number of nodes is discussed. The results include plane changes of 10, 20, and 30 degrees for a given vehicle.

The origin of spurious solutions in computational electromagnetics

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Wu, Jie; Povinelli, L. A.

1995-01-01

The origin of spurious solutions in computational electromagnetics, which violate the divergence equations, is deeply rooted in a misconception about the first-order Maxwell's equations and in an incorrect derivation and use of the curl-curl equations. The divergence equations must be always included in the first-order Maxwell's equations to maintain the ellipticity of the system in the space domain and to guarantee the uniqueness of the solution and/or the accuracy of the numerical solutions. The div-curl method and the least-squares method provide rigorous derivation of the equivalent second-order Maxwell's equations and their boundary conditions. The node-based least-squares finite element method (LSFEM) is recommended for solving the first-order full Maxwell equations directly. Examples of the numerical solutions by LSFEM for time-harmonic problems are given to demonstrate that the LSFEM is free of spurious solutions.

A correction function method for the wave equation with interface jump conditions

NASA Astrophysics Data System (ADS)

Abraham, David S.; Marques, Alexandre Noll; Nave, Jean-Christophe

2018-01-01

In this paper a novel method to solve the constant coefficient wave equation, subject to interface jump conditions, is presented. In general, such problems pose issues for standard finite difference solvers, as the inherent discontinuity in the solution results in erroneous derivative information wherever the stencils straddle the given interface. Here, however, the recently proposed Correction Function Method (CFM) is used, in which correction terms are computed from the interface conditions, and added to affected nodes to compensate for the discontinuity. In contrast to existing methods, these corrections are not simply defined at affected nodes, but rather generalized to a continuous function within a small region surrounding the interface. As a result, the correction function may be defined in terms of its own governing partial differential equation (PDE) which may be solved, in principle, to arbitrary order of accuracy. The resulting scheme is not only arbitrarily high order, but also robust, having already seen application to Poisson problems and the heat equation. By extending the CFM to this new class of PDEs, the treatment of wave interface discontinuities in homogeneous media becomes possible. This allows, for example, for the straightforward treatment of infinitesimal source terms and sharp boundaries, free of staircasing errors. Additionally, new modifications to the CFM are derived, allowing compatibility with explicit multi-step methods, such as Runge-Kutta (RK4), without a reduction in accuracy. These results are then verified through numerous numerical experiments in one and two spatial dimensions.

Traction cytometry: regularization in the Fourier approach and comparisons with finite element method.

PubMed

Kulkarni, Ankur H; Ghosh, Prasenjit; Seetharaman, Ashwin; Kondaiah, Paturu; Gundiah, Namrata

2018-05-09

Traction forces exerted by adherent cells are quantified using displacements of embedded markers on polyacrylamide substrates due to cell contractility. Fourier Transform Traction Cytometry (FTTC) is widely used to calculate tractions but has inherent limitations due to errors in the displacement fields; these are mitigated through a regularization parameter (γ) in the Reg-FTTC method. An alternate finite element (FE) approach computes tractions on a domain using known boundary conditions. Robust verification and recovery studies are lacking but essential in assessing the accuracy and noise sensitivity of the traction solutions from the different methods. We implemented the L2 regularization method and defined a maximum curvature point in the traction with γ plot as the optimal regularization parameter (γ*) in the Reg-FTTC approach. Traction reconstructions using γ* yield accurate values of low and maximum tractions (Tmax) in the presence of up to 5% noise. Reg-FTTC is hence a clear improvement over the FTTC method but is inadequate to reconstruct low stresses such as those at nascent focal adhesions. FE, implemented using a node-by-node comparison, showed an intermediate reconstruction compared to Reg-FTTC. We performed experiments using mouse embryonic fibroblast (MEF) and compared results between these approaches. Tractions from FTTC and FE showed differences of ∼92% and 22% as compared to Reg-FTTC. Selection of an optimum value of γ for each cell reduced variability in the computed tractions as compared to using a single value of γ for all the MEF cells in this study.

Size-Dependent Couple-Stress Fluid Mechanics and Application to the Lid-Driven Square Cavity Flow

NASA Astrophysics Data System (ADS)

Hajesfandiari, Arezoo; Dargush, Gary; Hadjesfandiari, Ali

2012-11-01

We consider a size-dependent fluid that possesses a characteristic material length l, which becomes increasingly important as the characteristic geometric dimension of the problem decreases. The term involving l in the modified Navier-Stokes equations ρDv/Dt = - ∇ p + μ∇2 v - μl2∇2∇2 v generates a new mechanism for energy dissipation in the flow, which has stabilizing effects at high Reynolds numbers. Interestingly, the idea of adding a fourth order term has been introduced long ago in the form of an artificial dissipation term to stabilize numerical results in CFD methods. However, this additional dissipation has no physical basis for inclusion in the differential equations of motion and is never considered at the boundary nodes of the domain. On the other hand, our couple stress-related dissipation is physically motivated, resulting from the consistent application of energy principles, kinematics and boundary conditions. We should note, in particular, that the boundary conditions in the size-dependent theory must be modified from the classical case to include specification of either rotations or moment-tractions. In order to validate the approach, we focus on the lid-driven cavity problem.

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Analytical Assessment of a Gross Leakage Event Within the International Space Station (ISS) Node 2 Internal Active Thermal Control System (IATCS)

NASA Technical Reports Server (NTRS)

Holt, James M.; Clanton, Stephen E.

1999-01-01

Results of the International Space Station (ISS) Node 2 Internal Active Thermal Control System (IATCS) gross leakage analysis are presented for evaluating total leakage flowrates and volume discharge caused by a gross leakage event (i.e. open boundary condition). A Systems Improved Numerical Differencing Analyzer and Fluid Integrator (SINDA/FLUINT) thermal hydraulic mathematical model (THMM) representing the Node 2 IATCS was developed to simulate system performance under steady-state nominal conditions as well as the transient flow effects resulting from an open line exposed to ambient. The objective of the analysis was to determine the adequacy of the leak detection software in limiting the quantity of fluid lost during a gross leakage event to within an acceptable level.

Analytical Assessment of a Gross Leakage Event Within the International Space Station (ISS) Node 2 Internal Active Thermal Control System (IATCS)

NASA Technical Reports Server (NTRS)

Holt, James M.; Clanton, Stephen E.

2001-01-01

Results of the International Space Station (ISS) Node 2 Internal Active Thermal Control System (IATCS) gross leakage analysis are presented for evaluating total leakage flow rates and volume discharge caused by a gross leakage event (i.e. open boundary condition). A Systems Improved Numerical Differencing Analyzer and Fluid Integrator (SINDA85/FLUINT) thermal hydraulic mathematical model (THMM) representing the Node 2 IATCS was developed to simulate system performance under steady-state nominal conditions as well as the transient flow effect resulting from an open line exposed to ambient. The objective of the analysis was to determine the adequacy of the leak detection software in limiting the quantity of fluid lost during a gross leakage event to within an acceptable level.

Two dimensional fully nonlinear numerical wave tank based on the BEM

NASA Astrophysics Data System (ADS)

Sun, Zhe; Pang, Yongjie; Li, Hongwei

2012-12-01

The development of a two dimensional numerical wave tank (NWT) with a rocker or piston type wavemaker based on the high order boundary element method (BEM) and mixed Eulerian-Lagrangian (MEL) is examined. The cauchy principle value (CPV) integral is calculated by a special Gauss type quadrature and a change of variable. In addition the explicit truncated Taylor expansion formula is employed in the time-stepping process. A modified double nodes method is assumed to tackle the corner problem, as well as the damping zone technique is used to absorb the propagation of the free surface wave at the end of the tank. A variety of waves are generated by the NWT, for example; a monochromatic wave, solitary wave and irregular wave. The results confirm the NWT model is efficient and stable.

CHAP-2 heat-transfer analysis of the Fort St. Vrain reactor core

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

Kotas, J.F.; Stroh, K.R.

1983-01-01

The Los Alamos National Laboratory is developing the Composite High-Temperature Gas-Cooled Reactor Analysis Program (CHAP) to provide advanced best-estimate predictions of postulated accidents in gas-cooled reactor plants. The CHAP-2 reactor-core model uses the finite-element method to initialize a two-dimensional temperature map of the Fort St. Vrain (FSV) core and its top and bottom reflectors. The code generates a finite-element mesh, initializes noding and boundary conditions, and solves the nonlinear Laplace heat equation using temperature-dependent thermal conductivities, variable coolant-channel-convection heat-transfer coefficients, and specified internal fuel and moderator heat-generation rates. This paper discusses this method and analyzes an FSV reactor-core accident thatmore » simulates a control-rod withdrawal at full power.« less

Three-dimensional elastic-plastic finite-element analysis of fatigue crack propagation

NASA Technical Reports Server (NTRS)

Goglia, G. L.; Chermahini, R. G.

1985-01-01

Fatigue cracks are a major problem in designing structures subjected to cyclic loading. Cracks frequently occur in structures such as aircraft and spacecraft. The inspection intervals of many aircraft structures are based on crack-propagation lives. Therefore, improved prediction of propagation lives under flight-load conditions (variable-amplitude loading) are needed to provide more realistic design criteria for these structures. The main thrust was to develop a three-dimensional, nonlinear, elastic-plastic, finite element program capable of extending a crack and changing boundary conditions for the model under consideration. The finite-element model is composed of 8-noded (linear-strain) isoparametric elements. In the analysis, the material is assumed to be elastic-perfectly plastic. The cycle stress-strain curve for the material is shown Zienkiewicz's initial-stress method, von Mises's yield criterion, and Drucker's normality condition under small-strain assumptions are used to account for plasticity. The three-dimensional analysis is capable of extending the crack and changing boundary conditions under cyclic loading.

Method and system for source authentication in group communications

NASA Technical Reports Server (NTRS)

Roy-Chowdhury, Ayan (Inventor); Baras, John S. (Inventor)

2013-01-01

A method and system for authentication is provided. A central node for issuing certificates to a plurality of nodes associated with the central node in a network is also provided. The central node receives a first key from at least one node from among the plurality of nodes and generates a second key based on the received first key and generates a certificate for the at least one node. The generated certificate is transmitted to the at least one node.

Efficient Parallel Formulations of Hierarchical Methods and Their Applications

NASA Astrophysics Data System (ADS)

Grama, Ananth Y.

1996-01-01

Hierarchical methods such as the Fast Multipole Method (FMM) and Barnes-Hut (BH) are used for rapid evaluation of potential (gravitational, electrostatic) fields in particle systems. They are also used for solving integral equations using boundary element methods. The linear systems arising from these methods are dense and are solved iteratively. Hierarchical methods reduce the complexity of the core matrix-vector product from O(n^2) to O(n log n) and the memory requirement from O(n^2) to O(n). We have developed highly scalable parallel formulations of a hybrid FMM/BH method that are capable of handling arbitrarily irregular distributions. We apply these formulations to astrophysical simulations of Plummer and Gaussian galaxies. We have used our parallel formulations to solve the integral form of the Laplace equation. We show that our parallel hierarchical mat-vecs yield high efficiency and overall performance even on relatively small problems. A problem containing approximately 200K nodes takes under a second to compute on 256 processors and yet yields over 85% efficiency. The efficiency and raw performance is expected to increase for bigger problems. For the 200K node problem, our code delivers about 5 GFLOPS of performance on a 256 processor T3D. This is impressive considering the fact that the problem has floating point divides and roots, and very little locality resulting in poor cache performance. A dense matrix-vector product of the same dimensions would require about 0.5 TeraBytes of memory and about 770 TeraFLOPS of computing speed. Clearly, if the loss in accuracy resulting from the use of hierarchical methods is acceptable, our code yields significant savings in time and memory. We also study the convergence of a GMRES solver built around this mat-vec. We accelerate the convergence of the solver using three preconditioning techniques: diagonal scaling, block-diagonal preconditioning, and inner-outer preconditioning. We study the performance and parallel efficiency of these preconditioned solvers. Using this solver, we solve dense linear systems with hundreds of thousands of unknowns. Solving a 105K unknown problem takes about 10 minutes on a 64 processor T3D. Until very recently, boundary element problems of this magnitude could not even be generated, let alone solved.

Sentinel lymph node biopsy under fluorescent indocyanin green guidance: Initial experience

PubMed Central

Aydoğan, Fatih; Arıkan, Akif Enes; Aytaç, Erman; Velidedeoğlu, Mehmet; Yılmaz, Mehmet Halit; Sager, Muhammet Sait; Çelik, Varol; Uras, Cihan

2016-01-01

Objective: Sentinel lymph node biopsy can be applied by using either blue dye or radionuclide method or both in breast cancer. Fluorescent imaging with indocyanine green is a new defined method. This study evaluates the applicability of sentinel lymph node biopsy via fluorescent indocyanine green. Material and Methods: IC-VIEW (Pulsion Medical Systems AG, Munich, Germany) infrared visualization system was used for imaging. Two mL of indocyanine green was injected to visualize sentinel lymph nodes. After injection, subcutaneous lymphatics were traced and sentinel lymph nodes were found with simultaneous imaging. Sentinel lymph nodes were excised under fluorescent light guidance, and excised lymph nodes were examined histopathologically. Patients with sentinel lymph node metastases underwent axillary dissection. Results: Four patients with sentinel lymph node biopsy due to breast cancer were included in the study. Sentinel lymph nodes were visualized with indocyanine green in all patients. The median number of excised sentinel lymph node was 2 (2–3). Two patients with lymph node metastasis underwent axillary dissection. No metastasis was detected in lymph nodes other than the sentinel nodes in patients with axillary dissection. There was no complication during and after the operation related to the method. Conclusion: According to our limited experience, sentinel lymph node biopsy under fluorescent indocyanine green guidance, which has an advantage of simultaneous visualization, is technically feasible. PMID:26985159

A constraint optimization based virtual network mapping method

NASA Astrophysics Data System (ADS)

Li, Xiaoling; Guo, Changguo; Wang, Huaimin; Li, Zhendong; Yang, Zhiwen

2013-03-01

Virtual network mapping problem, maps different virtual networks onto the substrate network is an extremely challenging work. This paper proposes a constraint optimization based mapping method for solving virtual network mapping problem. This method divides the problem into two phases, node mapping phase and link mapping phase, which are all NP-hard problems. Node mapping algorithm and link mapping algorithm are proposed for solving node mapping phase and link mapping phase, respectively. Node mapping algorithm adopts the thinking of greedy algorithm, mainly considers two factors, available resources which are supplied by the nodes and distance between the nodes. Link mapping algorithm is based on the result of node mapping phase, adopts the thinking of distributed constraint optimization method, which can guarantee to obtain the optimal mapping with the minimum network cost. Finally, simulation experiments are used to validate the method, and results show that the method performs very well.

BridgeRank: A novel fast centrality measure based on local structure of the network

NASA Astrophysics Data System (ADS)

Salavati, Chiman; Abdollahpouri, Alireza; Manbari, Zhaleh

2018-04-01

Ranking nodes in complex networks have become an important task in many application domains. In a complex network, influential nodes are those that have the most spreading ability. Thus, identifying influential nodes based on their spreading ability is a fundamental task in different applications such as viral marketing. One of the most important centrality measures to ranking nodes is closeness centrality which is efficient but suffers from high computational complexity O(n3) . This paper tries to improve closeness centrality by utilizing the local structure of nodes and presents a new ranking algorithm, called BridgeRank centrality. The proposed method computes local centrality value for each node. For this purpose, at first, communities are detected and the relationship between communities is completely ignored. Then, by applying a centrality in each community, only one best critical node from each community is extracted. Finally, the nodes are ranked based on computing the sum of the shortest path length of nodes to obtained critical nodes. We have also modified the proposed method by weighting the original BridgeRank and selecting several nodes from each community based on the density of that community. Our method can find the best nodes with high spread ability and low time complexity, which make it applicable to large-scale networks. To evaluate the performance of the proposed method, we use the SIR diffusion model. Finally, experiments on real and artificial networks show that our method is able to identify influential nodes so efficiently, and achieves better performance compared to other recent methods.

Nodes of Ranvier Act as Barriers to Restrict Invasion of Flanking Paranodal Domains in Myelinated Axons

PubMed Central

Thaxton, Courtney; Pillai, Anilkumar M.; Pribisko, Alaine L.; Dupree, Jeffrey L.; Bhat, Manzoor A.

2010-01-01

Accumulation of voltage gated sodium (Nav) channels at nodes of Ranvier is paramount for action potential propagation along myelinated fibers, yet the mechanisms governing nodal development, organization and stabilization remain unresolved. Here, we report that genetic ablation of the neuron-specific isoform of Neurofascin (NfascNF186) in vivo results in nodal disorganization, including loss of Nav channel and ankyrin-G (AnkG) enrichment at nodes in the peripheral (PNS) and central (CNS) nervous systems. Interestingly, the presence of paranodal domains failed to rescue nodal organization in the PNS and the CNS. Most importantly, using ultrastructural analysis, we demonstrate that the paranodal domains invade the nodal space in NfascNF186 mutant axons and occlude node formation. Our results suggest that NfascNF186-dependent assembly of the nodal complex acts as a molecular boundary to restrict the movement of flanking paranodal domains into the nodal area, thereby facilitating the stereotypic axonal domain organization and saltatory conduction along myelinated axons. PMID:21262464

Percolation of networks with directed dependency links

NASA Astrophysics Data System (ADS)

Niu, Dunbiao; Yuan, Xin; Du, Minhui; Stanley, H. Eugene; Hu, Yanqing

2016-04-01

The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand how directed dependency links impact criticality, we employ this approach to study the percolation properties of networks with both undirected connectivity links and directed dependency links. We find that when a random network with a given degree distribution undergoes a second-order phase transition, the critical point and the unstable regime surrounding the second-order phase transition regime are determined by the proportion of nodes that do not depend on any other nodes. Moreover, we also find that the triple point and the boundary between first- and second-order transitions are determined by the proportion of nodes that depend on no more than one node. This implies that it is maybe general for multiplex network systems, some important properties of phase transitions can be determined only by a few parameters. We illustrate our findings using Erdős-Rényi networks.

A pseudospectra-based approach to non-normal stability of embedded boundary methods

NASA Astrophysics Data System (ADS)

Rapaka, Narsimha; Samtaney, Ravi

2017-11-01

We present non-normal linear stability of embedded boundary (EB) methods employing pseudospectra and resolvent norms. Stability of the discrete linear wave equation is characterized in terms of the normalized distance of the EB to the nearest ghost node (α) in one and two dimensions. An important objective is that the CFL condition based on the Cartesian grid spacing remains unaffected by the EB. We consider various discretization methods including both central and upwind-biased schemes. Stability is guaranteed when α <=αmax ranges between 0.5 and 0.77 depending on the discretization scheme. Also, the stability characteristics remain the same in both one and two dimensions. Sharper limits on the sufficient conditions for stability are obtained based on the pseudospectral radius (the Kreiss constant) than the restrictive limits based on the usual singular value decomposition analysis. We present a simple and robust reclassification scheme for the ghost cells (``hybrid ghost cells'') to ensure Lax stability of the discrete systems. This has been tested successfully for both low and high order discretization schemes with transient growth of at most O (1). Moreover, we present a stable, fourth order EB reconstruction scheme. Supported by the KAUST Office of Competitive Research Funds under Award No. URF/1/1394-01.

Generalized Fluid System Simulation Program (GFSSP) - Version 6

NASA Technical Reports Server (NTRS)

Majumdar, Alok; LeClair, Andre; Moore, Ric; Schallhorn, Paul

2015-01-01

The Generalized Fluid System Simulation Program (GFSSP) is a finite-volume based general-purpose computer program for analyzing steady state and time-dependent flow rates, pressures, temperatures, and concentrations in a complex flow network. The program is capable of modeling real fluids with phase changes, compressibility, mixture thermodynamics, conjugate heat transfer between solid and fluid, fluid transients, pumps, compressors, flow control valves and external body forces such as gravity and centrifugal. The thermo-fluid system to be analyzed is discretized into nodes, branches, and conductors. The scalar properties such as pressure, temperature, and concentrations are calculated at nodes. Mass flow rates and heat transfer rates are computed in branches and conductors. The graphical user interface allows users to build their models using the 'point, drag, and click' method; the users can also run their models and post-process the results in the same environment. The integrated fluid library supplies thermodynamic and thermo-physical properties of 36 fluids, and 24 different resistance/source options are provided for modeling momentum sources or sinks in the branches. Users can introduce new physics, non-linear and time-dependent boundary conditions through user-subroutine.

Robot Acquisition of Active Maps Through Teleoperation and Vector Space Analysis

NASA Technical Reports Server (NTRS)

Peters, Richard Alan, II

2003-01-01

The work performed under this contract was in the area of intelligent robotics. The problem being studied was the acquisition of intelligent behaviors by a robot. The method was to acquire action maps that describe tasks as sequences of reflexive behaviors. Action maps (a.k.a. topological maps) are graphs whose nodes represent sensorimotor states and whose edges represent the motor actions that cause the robot to proceed from one state to the next. The maps were acquired by the robot after being teleoperated or otherwise guided by a person through a task several times. During a guided task, the robot records all its sensorimotor signals. The signals from several task trials are partitioned into episodes of static behavior. The corresponding episodes from each trial are averaged to produce a task description as a sequence of characteristic episodes. The sensorimotor states that indicate episode boundaries become the nodes, and the static behaviors, the edges. It was demonstrated that if compound maps are constructed from a set of tasks then the robot can perform new tasks in which it was never explicitly trained.

Numerical modelling of flow through foam's node.

PubMed

Anazadehsayed, Abdolhamid; Rezaee, Nastaran; Naser, Jamal

2017-10-15

In this work, for the first time, a three-dimensional model to describe the dynamics of flow through geometric Plateau border and node components of foam is presented. The model involves a microscopic-scale structure of one interior node and four Plateau borders with an angle of 109.5 from each other. The majority of the surfaces in the model make a liquid-gas interface where the boundary condition of stress balance between the surface and bulk is applied. The three-dimensional Navier-Stoke equation, along with continuity equation, is solved using the finite volume approach. The numerical results are validated against the available experimental results for the flow velocity and resistance in the interior nodes and Plateau borders. A qualitative illustration of flow in a node in different orientations is shown. The scaled resistance against the flow for different liquid-gas interface mobility is studied and the geometrical characteristics of the node and Plateau border components of the system are compared to investigate the Plateau border and node dominated flow regimes numerically. The findings show the values of the resistance in each component, in addition to the exact point where the flow regimes switch. Furthermore, a more accurate effect of the liquid-gas interface on the foam flow, particularly in the presence of a node in the foam network is obtained. The comparison of the available numerical results with our numerical results shows that the velocity of the node-PB system is lower than the velocity of single PB system for mobile interfaces. That is owing to the fact that despite the more relaxed geometrical structure of the node, constraining effect of merging and mixing of flow and increased viscous damping in the node component result in the node-dominated regime. Moreover, we obtain an accurate updated correlation for the dependence of the scaled average velocity of the node-Plateau border system on the liquid-gas interface mobility described by Boussinesq number. Copyright © 2017 Elsevier Inc. All rights reserved.

A finite element method with overlapping meshes for free-boundary axisymmetric plasma equilibria in realistic geometries

NASA Astrophysics Data System (ADS)

Heumann, Holger; Rapetti, Francesca

2017-04-01

Existing finite element implementations for the computation of free-boundary axisymmetric plasma equilibria approximate the unknown poloidal flux function by standard lowest order continuous finite elements with discontinuous gradients. As a consequence, the location of critical points of the poloidal flux, that are of paramount importance in tokamak engineering, is constrained to nodes of the mesh leading to undesired jumps in transient problems. Moreover, recent numerical results for the self-consistent coupling of equilibrium with resistive diffusion and transport suggest the necessity of higher regularity when approximating the flux map. In this work we propose a mortar element method that employs two overlapping meshes. One mesh with Cartesian quadrilaterals covers the vacuum chamber domain accessible by the plasma and one mesh with triangles discretizes the region outside. The two meshes overlap in a narrow region. This approach gives the flexibility to achieve easily and at low cost higher order regularity for the approximation of the flux function in the domain covered by the plasma, while preserving accurate meshing of the geometric details outside this region. The continuity of the numerical solution in the region of overlap is weakly enforced by a mortar-like mapping.

The first eigenvalue of the p-Laplacian on quantum graphs

NASA Astrophysics Data System (ADS)

Del Pezzo, Leandro M.; Rossi, Julio D.

2016-12-01

We study the first eigenvalue of the p-Laplacian (with 1

The Natural Neighbour Radial Point Interpolation Meshless Method Applied to the Non-Linear Analysis

NASA Astrophysics Data System (ADS)

Dinis, L. M. J. S.; Jorge, R. M. Natal; Belinha, J.

2011-05-01

In this work the Natural Neighbour Radial Point Interpolation Method (NNRPIM), is extended to large deformation analysis of elastic and elasto-plastic structures. The NNPRIM uses the Natural Neighbour concept in order to enforce the nodal connectivity and to create a node-depending background mesh, used in the numerical integration of the NNRPIM interpolation functions. Unlike the FEM, where geometrical restrictions on elements are imposed for the convergence of the method, in the NNRPIM there are no such restrictions, which permits a random node distribution for the discretized problem. The NNRPIM interpolation functions, used in the Galerkin weak form, are constructed using the Radial Point Interpolators, with some differences that modify the method performance. In the construction of the NNRPIM interpolation functions no polynomial base is required and the used Radial Basis Function (RBF) is the Multiquadric RBF. The NNRPIM interpolation functions posses the delta Kronecker property, which simplify the imposition of the natural and essential boundary conditions. One of the scopes of this work is to present the validation the NNRPIM in the large-deformation elasto-plastic analysis, thus the used non-linear solution algorithm is the Newton-Rapson initial stiffness method and the efficient "forward-Euler" procedure is used in order to return the stress state to the yield surface. Several non-linear examples, exhibiting elastic and elasto-plastic material properties, are studied to demonstrate the effectiveness of the method. The numerical results indicated that NNRPIM handles large material distortion effectively and provides an accurate solution under large deformation.

A Hybrid MPI/OpenMP Approach for Parallel Groundwater Model Calibration on Multicore Computers

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

Tang, Guoping; D'Azevedo, Ed F; Zhang, Fan

2010-01-01

Groundwater model calibration is becoming increasingly computationally time intensive. We describe a hybrid MPI/OpenMP approach to exploit two levels of parallelism in software and hardware to reduce calibration time on multicore computers with minimal parallelization effort. At first, HydroGeoChem 5.0 (HGC5) is parallelized using OpenMP for a uranium transport model with over a hundred species involving nearly a hundred reactions, and a field scale coupled flow and transport model. In the first application, a single parallelizable loop is identified to consume over 97% of the total computational time. With a few lines of OpenMP compiler directives inserted into the code,more » the computational time reduces about ten times on a compute node with 16 cores. The performance is further improved by selectively parallelizing a few more loops. For the field scale application, parallelizable loops in 15 of the 174 subroutines in HGC5 are identified to take more than 99% of the execution time. By adding the preconditioned conjugate gradient solver and BICGSTAB, and using a coloring scheme to separate the elements, nodes, and boundary sides, the subroutines for finite element assembly, soil property update, and boundary condition application are parallelized, resulting in a speedup of about 10 on a 16-core compute node. The Levenberg-Marquardt (LM) algorithm is added into HGC5 with the Jacobian calculation and lambda search parallelized using MPI. With this hybrid approach, compute nodes at the number of adjustable parameters (when the forward difference is used for Jacobian approximation), or twice that number (if the center difference is used), are used to reduce the calibration time from days and weeks to a few hours for the two applications. This approach can be extended to global optimization scheme and Monte Carol analysis where thousands of compute nodes can be efficiently utilized.« less

Boundary-based cellwise OPC for standard-cell layouts

NASA Astrophysics Data System (ADS)

Pawlowski, David M.; Deng, Liang; Wong, Martin D. F.

2007-03-01

Model based optical proximity correction (OPC) has become necessary at 90nm technology node. Cellwise OPC is an attractive technique to reduce the mask data size as well as the prohibitive runtime of full-chip OPC. As feature dimensions have gotten smaller, the radius of influence for edge features has extended further into neighboring cells such that it is no longer sufficient to perform cellwise OPC independent of neighboring cells, especially for the critical layers. The methodology described in this work accounts for features in neighboring cells and allows a cellwise approach to be applied to cells with a printed gate length of 45nm with the projection that it can also be applied to future technology nodes. OPC-ready cells are generated at library creation (independent of placement) using a boundary-based technique. Each cell has a tractable number of OPC-ready versions due to an intelligent characterization of standard cell layout features. Results are very promising: the average edge placement error (EPE) for all metal1 features in 100 layouts is 0.731nm which is less than 1% of metal1 width; the maximum EPE for poly features reduced to 1/3, compared to cellwise OPC without considering boundaries, creating similar levels of lithographic accuracy while obviating any of the drawbacks inherent in layout specific full-chip model-based OPC.

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

DOE PAGES

Quadros, William Roshan

2015-08-22

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

Unsteady two dimensional airloads acting on oscillating thin airfoils in subsonic ventilated wind tunnels

NASA Technical Reports Server (NTRS)

Fromme, J.; Golberg, M.

1978-01-01

The numerical calculation of unsteady two dimensional airloads which act upon thin airfoils in subsonic ventilated wind tunnels was studied. Neglecting certain quadrature errors, Bland's collocation method is rigorously proved to converge to the mathematically exact solution of Bland's integral equation, and a three way equivalence was established between collocation, Galerkin's method and least squares whenever the collocation points are chosen to be the nodes of the quadrature rule used for Galerkin's method. A computer program displayed convergence with respect to the number of pressure basis functions employed, and agreement with known special cases was demonstrated. Results are obtained for the combined effects of wind tunnel wall ventilation and wind tunnel depth to airfoil chord ratio, and for acoustic resonance between the airfoil and wind tunnel walls. A boundary condition is proposed for permeable walls through which mass flow rate is proportional to pressure jump.

Element free Galerkin formulation of composite beam with longitudinal slip

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

Ahmad, Dzulkarnain; Mokhtaram, Mokhtazul Haizad; Badli, Mohd Iqbal

2015-05-15

Behaviour between two materials in composite beam is assumed partially interact when longitudinal slip at its interfacial surfaces is considered. Commonly analysed by the mesh-based formulation, this study used meshless formulation known as Element Free Galerkin (EFG) method in the beam partial interaction analysis, numerically. As meshless formulation implies that the problem domain is discretised only by nodes, the EFG method is based on Moving Least Square (MLS) approach for shape functions formulation with its weak form is developed using variational method. The essential boundary conditions are enforced by Langrange multipliers. The proposed EFG formulation gives comparable results, after beenmore » verified by analytical solution, thus signify its application in partial interaction problems. Based on numerical test results, the Cubic Spline and Quartic Spline weight functions yield better accuracy for the EFG formulation, compares to other proposed weight functions.« less

TACT1- TRANSIENT THERMAL ANALYSIS OF A COOLED TURBINE BLADE OR VANE EQUIPPED WITH A COOLANT INSERT

NASA Technical Reports Server (NTRS)

Gaugler, R. E.

1994-01-01

As turbine-engine core operating conditions become more severe, designers must develop more effective means of cooling blades and vanes. In order to design reliable, cooled turbine blades, advanced transient thermal calculation techniques are required. The TACT1 computer program was developed to perform transient and steady-state heat-transfer and coolant-flow analyses for cooled blades, given the outside hot-gas boundary condition, the coolant inlet conditions, the geometry of the blade shell, and the cooling configuration. TACT1 can analyze turbine blades, or vanes, equipped with a central coolant-plenum insert from which coolant-air impinges on the inner surface of the blade shell. Coolant-side heat-transfer coefficients are calculated with the heat transfer mode at each station being user specified as either impingement with crossflow, forced convection channel flow, or forced convection over pin fins. A limited capability to handle film cooling is also available in the program. The TACT1 program solves for the blade temperature distribution using a transient energy equation for each node. The nodal energy balances are linearized, one-dimensional, heat-conduction equations which are applied at the wall-outer-surface node, at the junction of the cladding and the metal node, and at the wall-inner-surface node. At the mid-metal node a linear, three-dimensional, heat-conduction equation is used. Similarly, the coolant pressure distribution is determined by solving the set of transfer momentum equations for the one-dimensional flow between adjacent fluid nodes. In the coolant channel, energy and momentum equations for one-dimensional compressible flow, including friction and heat transfer, are used for the elemental channel length between two coolant nodes. The TACT1 program first obtains a steady-state solution using iterative calculations to obtain convergence of stable temperatures, pressures, coolant-flow split, and overall coolant mass balance. Transient calculations are based on the steady-state solutions obtained. Input to the TACT1 program includes a geometrical description of the blade and insert, the nodal spacing to be used, and the boundary conditions describing the outside hot-gas and the coolant-inlet conditions. The program output includes the value of nodal temperatures and pressures at each iteration. The final solution output includes the temperature at each coolant node, and the coolant flow rates and Reynolds numbers. This program is written in FORTRAN IV for batch execution and has been implemented on an IBM 360 computer with a central memory requirement of approximately 480K of 8 bit bytes. The TACT1 program was developed in 1978.

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

Sackett, S.J.

JASON solves general electrostatics problems having either slab or cylindrical symmetry. More specifically, it solves the self-adjoint elliptic equation, div . (KgradV) - ..gamma..V + rho = 0 in an aritrary two-dimensional domain. For electrostatics, V is the electrostatic potential, K is the dielectric tensor, and rho is the free-charge density. The parameter ..gamma.. is identically zero for electrostatics but may have a positive nonzero value in other cases (e.g., capillary surface problems with gravity loading). The system of algebraic equations used in JASON is generated by the finite element method. Four-node quadrilateral elements are used for most of themore » mesh. Triangular elements, however, are occasionally used on boundaries to avoid severe mesh distortions. 15 figures. (RWR)« less

A Non-Cut Cell Immersed Boundary Method for Use in Icing Simulations

NASA Technical Reports Server (NTRS)

Sarofeen, Christian M.; Noack, Ralph W.; Kreeger, Richard E.

2013-01-01

This paper describes a computational fluid dynamic method used for modelling changes in aircraft geometry due to icing. While an aircraft undergoes icing, the accumulated ice results in a geometric alteration of the aerodynamic surfaces. In computational simulations for icing, it is necessary that the corresponding geometric change is taken into consideration. The method used, herein, for the representation of the geometric change due to icing is a non-cut cell Immersed Boundary Method (IBM). Computational cells that are in a body fitted grid of a clean aerodynamic geometry that are inside a predicted ice formation are identified. An IBM is then used to change these cells from being active computational cells to having properties of viscous solid bodies. This method has been implemented in the NASA developed node centered, finite volume computational fluid dynamics code, FUN3D. The presented capability is tested for two-dimensional airfoils including a clean airfoil, an iced airfoil, and an airfoil in harmonic pitching motion about its quarter chord. For these simulations velocity contours, pressure distributions, coefficients of lift, coefficients of drag, and coefficients of pitching moment about the airfoil's quarter chord are computed and used for comparison against experimental results, a higher order panel method code with viscous effects, XFOIL, and the results from FUN3D's original solution process. The results of the IBM simulations show that the accuracy of the IBM compares satisfactorily with the experimental results, XFOIL results, and the results from FUN3D's original solution process.

Novel diagnostic procedure for determining metastasis to sentinel lymph nodes in breast cancer using a semi-dry dot-blot method.

PubMed

Otsubo, Ryota; Oikawa, Masahiro; Hirakawa, Hiroshi; Shibata, Kenichiro; Abe, Kuniko; Hayashi, Tomayoshi; Kinoshita, Naoe; Shigematsu, Kazuto; Hatachi, Toshiko; Yano, Hiroshi; Matsumoto, Megumi; Takagi, Katsunori; Tsuchiya, Tomoshi; Tomoshige, Koichi; Nakashima, Masahiro; Taniguchi, Hideki; Omagari, Takeyuki; Itoyanagi, Noriaki; Nagayasu, Takeshi

2014-02-15

We developed an easy, quick and cost-effective detection method for lymph node metastasis called the semi-dry dot-blot (SDB) method, which visualizes the presence of cancer cells with washing of sectioned lymph nodes by anti-pancytokeratin antibody, modifying dot-blot technology. We evaluated the validity and efficacy of the SDB method for the diagnosis of lymph node metastasis in a clinical setting (Trial 1). To evaluate the validity of the SDB method in clinical specimens, 180 dissected lymph nodes from 29 cases, including breast, gastric and colorectal cancer, were examined. Each lymph node was sliced at the maximum diameter and the sensitivity, specificity and accuracy of the SDB method were determined and compared with the final pathology report. Metastasis was detected in 32 lymph nodes (17.8%), and the sensitivity, specificity and accuracy of the SDB method were 100, 98.0 and 98.3%, respectively (Trial 2). To evaluate the efficacy of the SDB method in sentinel lymph node (SLN) biopsy, 174 SLNs from 100 cases of clinically node-negative breast cancer were analyzed. Each SLN was longitudinally sliced at 2-mm intervals and the sensitivity, specificity, accuracy and time required for the SDB method were determined and compared with the intraoperative pathology report. Metastasis was detected in 15 SLNs (8.6%), and the sensitivity, specificity, accuracy and mean required time of the SDB method were 93.3, 96.9, 96.6 and 43.3 min, respectively. The SDB method is a novel and reliable modality for the intraoperative diagnosis of SLN metastasis. © 2013 UICC.

Sentinel lymph node biopsy under fluorescent indocyanin green guidance: Initial experience.

PubMed

Aydoğan, Fatih; Arıkan, Akif Enes; Aytaç, Erman; Velidedeoğlu, Mehmet; Yılmaz, Mehmet Halit; Sager, Muhammet Sait; Çelik, Varol; Uras, Cihan

2016-01-01

Sentinel lymph node biopsy can be applied by using either blue dye or radionuclide method or both in breast cancer. Fluorescent imaging with indocyanine green is a new defined method. This study evaluates the applicability of sentinel lymph node biopsy via fluorescent indocyanine green. IC-VIEW (Pulsion Medical Systems AG, Munich, Germany) infrared visualization system was used for imaging. Two mL of indocyanine green was injected to visualize sentinel lymph nodes. After injection, subcutaneous lymphatics were traced and sentinel lymph nodes were found with simultaneous imaging. Sentinel lymph nodes were excised under fluorescent light guidance, and excised lymph nodes were examined histopathologically. Patients with sentinel lymph node metastases underwent axillary dissection. Four patients with sentinel lymph node biopsy due to breast cancer were included in the study. Sentinel lymph nodes were visualized with indocyanine green in all patients. The median number of excised sentinel lymph node was 2 (2-3). Two patients with lymph node metastasis underwent axillary dissection. No metastasis was detected in lymph nodes other than the sentinel nodes in patients with axillary dissection. There was no complication during and after the operation related to the method. According to our limited experience, sentinel lymph node biopsy under fluorescent indocyanine green guidance, which has an advantage of simultaneous visualization, is technically feasible.

An Extraction Method of an Informative DOM Node from a Web Page by Using Layout Information

NASA Astrophysics Data System (ADS)

Tsuruta, Masanobu; Masuyama, Shigeru

We propose an informative DOM node extraction method from a Web page for preprocessing of Web content mining. Our proposed method LM uses layout data of DOM nodes generated by a generic Web browser, and the learning set consists of hundreds of Web pages and the annotations of informative DOM nodes of those Web pages. Our method does not require large scale crawling of the whole Web site to which the target Web page belongs. We design LM so that it uses the information of the learning set more efficiently in comparison to the existing method that uses the same learning set. By experiments, we evaluate the methods obtained by combining one that consists of the method for extracting the informative DOM node both the proposed method and the existing methods, and the existing noise elimination methods: Heur removes advertisements and link-lists by some heuristics and CE removes the DOM nodes existing in the Web pages in the same Web site to which the target Web page belongs. Experimental results show that 1) LM outperforms other methods for extracting the informative DOM node, 2) the combination method (LM, {CE(10), Heur}) based on LM (precision: 0.755, recall: 0.826, F-measure: 0.746) outperforms other combination methods.

Competing contact processes in the Watts-Strogatz network

NASA Astrophysics Data System (ADS)

Rybak, Marcin; Malarz, Krzysztof; Kułakowski, Krzysztof

2016-06-01

We investigate two competing contact processes on a set of Watts-Strogatz networks with the clustering coefficient tuned by rewiring. The base for network construction is one-dimensional chain of N sites, where each site i is directly linked to nodes labelled as i ± 1 and i ± 2. So initially, each node has the same degree k i = 4. The periodic boundary conditions are assumed as well. For each node i the links to sites i + 1 and i + 2 are rewired to two randomly selected nodes so far not-connected to node i. An increase of the rewiring probability q influences the nodes degree distribution and the network clusterization coefficient 𝓒. For given values of rewiring probability q the set 𝓝(q)={𝓝1,𝓝2,...,𝓝 M } of M networks is generated. The network's nodes are decorated with spin-like variables s i ∈ { S,D }. During simulation each S node having a D-site in its neighbourhood converts this neighbour from D to S state. Conversely, a node in D state having at least one neighbour also in state D-state converts all nearest-neighbours of this pair into D-state. The latter is realized with probability p. We plot the dependence of the nodes S final density n S T on initial nodes S fraction n S 0. Then, we construct the surface of the unstable fixed points in (𝓒, p, n S 0) space. The system evolves more often toward n S T for (𝓒, p, n S 0) points situated above this surface while starting simulation with (𝓒, p, n S 0) parameters situated below this surface leads system to n S T =0. The points on this surface correspond to such value of initial fraction n S * of S nodes (for fixed values 𝓒 and p) for which their final density is n S T=1/2.

Connectivity-based, all-hexahedral mesh generation method and apparatus

DOEpatents

Tautges, T.J.; Mitchell, S.A.; Blacker, T.D.; Murdoch, P.

1998-06-16

The present invention is a computer-based method and apparatus for constructing all-hexahedral finite element meshes for finite element analysis. The present invention begins with a three-dimensional geometry and an all-quadrilateral surface mesh, then constructs hexahedral element connectivity from the outer boundary inward, and then resolves invalid connectivity. The result of the present invention is a complete representation of hex mesh connectivity only; actual mesh node locations are determined later. The basic method of the present invention comprises the step of forming hexahedral elements by making crossings of entities referred to as ``whisker chords.`` This step, combined with a seaming operation in space, is shown to be sufficient for meshing simple block problems. Entities that appear when meshing more complex geometries, namely blind chords, merged sheets, and self-intersecting chords, are described. A method for detecting invalid connectivity in space, based on repeated edges, is also described, along with its application to various cases of invalid connectivity introduced and resolved by the method. 79 figs.

Connectivity-based, all-hexahedral mesh generation method and apparatus

DOEpatents

Tautges, Timothy James; Mitchell, Scott A.; Blacker, Ted D.; Murdoch, Peter

1998-01-01

The present invention is a computer-based method and apparatus for constructing all-hexahedral finite element meshes for finite element analysis. The present invention begins with a three-dimensional geometry and an all-quadrilateral surface mesh, then constructs hexahedral element connectivity from the outer boundary inward, and then resolves invalid connectivity. The result of the present invention is a complete representation of hex mesh connectivity only; actual mesh node locations are determined later. The basic method of the present invention comprises the step of forming hexahedral elements by making crossings of entities referred to as "whisker chords." This step, combined with a seaming operation in space, is shown to be sufficient for meshing simple block problems. Entities that appear when meshing more complex geometries, namely blind chords, merged sheets, and self-intersecting chords, are described. A method for detecting invalid connectivity in space, based on repeated edges, is also described, along with its application to various cases of invalid connectivity introduced and resolved by the method.

Mathematical investigations of branch length similarity entropy profiles of shapes for various resolutions

NASA Astrophysics Data System (ADS)

Jeon, Wonju; Lee, Sang-Hee

2012-12-01

In our previous study, we defined the branch length similarity (BLS) entropy for a simple network consisting of a single node and numerous branches. As the first application of this entropy to characterize shapes, the BLS entropy profiles of 20 battle tank shapes were calculated from simple networks created by connecting pixels in the boundary of the shape. The profiles successfully characterized the tank shapes through a comparison of their BLS entropy profiles. Following the application, this entropy was used to characterize human's emotional faces, such as happiness and sad, and to measure the degree of complexity for termite tunnel networks. These applications indirectly indicate that the BLS entropy profile can be a useful tool to characterize networks and shapes. However, the ability of the BLS entropy in the characterization depends on the image resolution because the entropy is determined by the number of nodes for the boundary of a shape. Higher resolution means more nodes. If the entropy is to be widely used in the scientific community, the effect of the resolution on the entropy profile should be understood. In the present study, we mathematically investigated the BLS entropy profile of a shape with infinite resolution and numerically investigated the variation in the pattern of the entropy profile caused by changes in the resolution change in the case of finite resolution.

Routing Based on Length of Time of Available Connection

NASA Technical Reports Server (NTRS)

Anandappan, Thanga (Inventor); Roy, Aloke (Inventor); Malve, Sharath Babu (Inventor); Toth, Louis T. (Inventor)

2016-01-01

In an embodiment, a method of routing packets at a first node in an ad-hoc network is provided. The method includes receiving, at the first node, a plurality of route-alive messages corresponding to a destination, each of the plurality of route-alive messages including a route time indicating a length of time in which a communicative connection is available between the second node that sent the respective route-alive message and the destination. The method also includes determining an updated route time for each second node. The updated route time corresponds to a length of time in which a communication connection is available between the first node and the destination through the respective second node. A second node is selected for sending a packet to based on the updated route time for each of the second nodes, wherein a node having a longer updated route time is given higher priority for selection.

Stability boundaries for command augmentation systems

NASA Technical Reports Server (NTRS)

Shrivastava, P. C.

1987-01-01

The Stability Augmentation System (SAS) is a special case of the Command Augmentation System (CAS). Control saturation imposes bounds on achievable commands. The state equilibrium depends only on the open loop dynamics and control deflection. The control magnitude to achieve a desired command equilibrium is independent of the feedback gain. A feedback controller provides the desired response, maintains the system equilibrium under disturbances, but it does not affect the equilibrium values of states and control. The saturation boundaries change with commands, but the location of the equilibrium points in the saturated region remains unchanged. Nonzero command vectors yield saturation boundaries that are asymmetric with respect to the state equilibrium. Except for the saddle point case with MCE control law, the stability boundaries change with commands. For the cases of saddle point and unstable nodes, the region of stability decreases with increasing command magnitudes.

Node-making process in network meta-analysis of nonpharmacological treatment are poorly reported.

PubMed

James, Arthur; Yavchitz, Amélie; Ravaud, Philippe; Boutron, Isabelle

2018-05-01

To identify methods to support the node-making process in network meta-analyses (NMAs) of nonpharmacological treatments. We proceeded in two stages. First, we conducted a literature review of guidelines and methodological articles about NMAs to identify methods proposed to lump interventions into nodes. Second, we conducted a systematic review of NMAs of nonpharmacological treatments to extract methods used by authors to support their node-making process. MEDLINE and Google Scholar were searched to identify articles assessing NMA guidelines or methodology intended for NMA authors. MEDLINE, CENTRAL, and EMBASE were searched to identify reports of NMAs including at least one nonpharmacological treatment. Both searches involved articles available from database inception to March 2016. From the methodological review, we identified and extracted methods proposed to lump interventions into nodes. From the systematic review, the reporting of the network was assessed as long as the method described supported the node-making process. Among the 116 articles retrieved in the literature review, 12 (10%) discussed the concept of lumping or splitting interventions in NMAs. No consensual method was identified during the methodological review, and expert consensus was the only method proposed to support the node-making process. Among 5187 references for the systematic review, we included 110 reports of NMAs published between 2007 and 2016. The nodes were described in the introduction section of 88 reports (80%), which suggested that the node content might have been a priori decided before the systematic review. Nine reports (8.1%) described a specific process or justification to build nodes for the network. Two methods were identified: (1) fit a previously published classification and (2) expert consensus. Despite the importance of NMA in the delivery of evidence when several interventions are available for a single indication, recommendations on the reporting of the node-making process in NMAs are lacking, and reporting of the node-making process in NMAs seems insufficient. Copyright © 2017 Elsevier Inc. All rights reserved.

Spreading to localized targets in complex networks

NASA Astrophysics Data System (ADS)

Sun, Ye; Ma, Long; Zeng, An; Wang, Wen-Xu

2016-12-01

As an important type of dynamics on complex networks, spreading is widely used to model many real processes such as the epidemic contagion and information propagation. One of the most significant research questions in spreading is to rank the spreading ability of nodes in the network. To this end, substantial effort has been made and a variety of effective methods have been proposed. These methods usually define the spreading ability of a node as the number of finally infected nodes given that the spreading is initialized from the node. However, in many real cases such as advertising and news propagation, the spreading only aims to cover a specific group of nodes. Therefore, it is necessary to study the spreading ability of nodes towards localized targets in complex networks. In this paper, we propose a reversed local path algorithm for this problem. Simulation results show that our method outperforms the existing methods in identifying the influential nodes with respect to these localized targets. Moreover, the influential spreaders identified by our method can effectively avoid infecting the non-target nodes in the spreading process.

Data driven CAN node reliability assessment for manufacturing system

NASA Astrophysics Data System (ADS)

Zhang, Leiming; Yuan, Yong; Lei, Yong

2017-01-01

The reliability of the Controller Area Network(CAN) is critical to the performance and safety of the system. However, direct bus-off time assessment tools are lacking in practice due to inaccessibility of the node information and the complexity of the node interactions upon errors. In order to measure the mean time to bus-off(MTTB) of all the nodes, a novel data driven node bus-off time assessment method for CAN network is proposed by directly using network error information. First, the corresponding network error event sequence for each node is constructed using multiple-layer network error information. Then, the generalized zero inflated Poisson process(GZIP) model is established for each node based on the error event sequence. Finally, the stochastic model is constructed to predict the MTTB of the node. The accelerated case studies with different error injection rates are conducted on a laboratory network to demonstrate the proposed method, where the network errors are generated by a computer controlled error injection system. Experiment results show that the MTTB of nodes predicted by the proposed method agree well with observations in the case studies. The proposed data driven node time to bus-off assessment method for CAN networks can successfully predict the MTTB of nodes by directly using network error event data.

Hybrid data storage system in an HPC exascale environment

DOEpatents

Bent, John M.; Faibish, Sorin; Gupta, Uday K.; Tzelnic, Percy; Ting, Dennis P. J.

2015-08-18

A computer-executable method, system, and computer program product for managing I/O requests from a compute node in communication with a data storage system, including a first burst buffer node and a second burst buffer node, the computer-executable method, system, and computer program product comprising striping data on the first burst buffer node and the second burst buffer node, wherein a first portion of the data is communicated to the first burst buffer node and a second portion of the data is communicated to the second burst buffer node, processing the first portion of the data at the first burst buffer node, and processing the second portion of the data at the second burst buffer node.

Automatic abdominal lymph node detection method based on local intensity structure analysis from 3D x-ray CT images

NASA Astrophysics Data System (ADS)

Nakamura, Yoshihiko; Nimura, Yukitaka; Kitasaka, Takayuki; Mizuno, Shinji; Furukawa, Kazuhiro; Goto, Hidemi; Fujiwara, Michitaka; Misawa, Kazunari; Ito, Masaaki; Nawano, Shigeru; Mori, Kensaku

2013-03-01

This paper presents an automated method of abdominal lymph node detection to aid the preoperative diagnosis of abdominal cancer surgery. In abdominal cancer surgery, surgeons must resect not only tumors and metastases but also lymph nodes that might have a metastasis. This procedure is called lymphadenectomy or lymph node dissection. Insufficient lymphadenectomy carries a high risk for relapse. However, excessive resection decreases a patient's quality of life. Therefore, it is important to identify the location and the structure of lymph nodes to make a suitable surgical plan. The proposed method consists of candidate lymph node detection and false positive reduction. Candidate lymph nodes are detected using a multi-scale blob-like enhancement filter based on local intensity structure analysis. To reduce false positives, the proposed method uses a classifier based on support vector machine with the texture and shape information. The experimental results reveal that it detects 70.5% of the lymph nodes with 13.0 false positives per case.

Method for nonlinear optimization for gas tagging and other systems

DOEpatents

Chen, Ting; Gross, Kenny C.; Wegerich, Stephan

1998-01-01

A method and system for providing nuclear fuel rods with a configuration of isotopic gas tags. The method includes selecting a true location of a first gas tag node, selecting initial locations for the remaining n-1 nodes using target gas tag compositions, generating a set of random gene pools with L nodes, applying a Hopfield network for computing on energy, or cost, for each of the L gene pools and using selected constraints to establish minimum energy states to identify optimal gas tag nodes with each energy compared to a convergence threshold and then upon identifying the gas tag node continuing this procedure until establishing the next gas tag node until all remaining n nodes have been established.

Method for nonlinear optimization for gas tagging and other systems

DOEpatents

Chen, T.; Gross, K.C.; Wegerich, S.

1998-01-06

A method and system are disclosed for providing nuclear fuel rods with a configuration of isotopic gas tags. The method includes selecting a true location of a first gas tag node, selecting initial locations for the remaining n-1 nodes using target gas tag compositions, generating a set of random gene pools with L nodes, applying a Hopfield network for computing on energy, or cost, for each of the L gene pools and using selected constraints to establish minimum energy states to identify optimal gas tag nodes with each energy compared to a convergence threshold and then upon identifying the gas tag node continuing this procedure until establishing the next gas tag node until all remaining n nodes have been established. 6 figs.

Modal ring method for the scattering of sound

NASA Technical Reports Server (NTRS)

Baumeister, Kenneth J.; Kreider, Kevin L.

1993-01-01

The modal element method for acoustic scattering can be simplified when the scattering body is rigid. In this simplified method, called the modal ring method, the scattering body is represented by a ring of triangular finite elements forming the outer surface. The acoustic pressure is calculated at the element nodes. The pressure in the infinite computational region surrounding the body is represented analytically by an eigenfunction expansion. The two solution forms are coupled by the continuity of pressure and velocity on the body surface. The modal ring method effectively reduces the two-dimensional scattering problem to a one-dimensional problem capable of handling very high frequency scattering. In contrast to the boundary element method or the method of moments, which perform a similar reduction in problem dimension, the model line method has the added advantage of having a highly banded solution matrix requiring considerably less computer storage. The method shows excellent agreement with analytic results for scattering from rigid circular cylinders over a wide frequency range (1 is equal to or less than ka is less than or equal to 100) in the near and far fields.

Improving local clustering based top-L link prediction methods via asymmetric link clustering information

NASA Astrophysics Data System (ADS)

Wu, Zhihao; Lin, Youfang; Zhao, Yiji; Yan, Hongyan

2018-02-01

Networks can represent a wide range of complex systems, such as social, biological and technological systems. Link prediction is one of the most important problems in network analysis, and has attracted much research interest recently. Many link prediction methods have been proposed to solve this problem with various techniques. We can note that clustering information plays an important role in solving the link prediction problem. In previous literatures, we find node clustering coefficient appears frequently in many link prediction methods. However, node clustering coefficient is limited to describe the role of a common-neighbor in different local networks, because it cannot distinguish different clustering abilities of a node to different node pairs. In this paper, we shift our focus from nodes to links, and propose the concept of asymmetric link clustering (ALC) coefficient. Further, we improve three node clustering based link prediction methods via the concept of ALC. The experimental results demonstrate that ALC-based methods outperform node clustering based methods, especially achieving remarkable improvements on food web, hamster friendship and Internet networks. Besides, comparing with other methods, the performance of ALC-based methods are very stable in both globalized and personalized top-L link prediction tasks.

System for solving diagnosis and hitting set problems

NASA Technical Reports Server (NTRS)

Vatan, Farrokh (Inventor); Fijany, Amir (Inventor)

2007-01-01

The diagnosis problem arises when a system's actual behavior contradicts the expected behavior, thereby exhibiting symptoms (a collection of conflict sets). System diagnosis is then the task of identifying faulty components that are responsible for anomalous behavior. To solve the diagnosis problem, the present invention describes a method for finding the minimal set of faulty components (minimal diagnosis set) that explain the conflict sets. The method includes acts of creating a matrix of the collection of conflict sets, and then creating nodes from the matrix such that each node is a node in a search tree. A determination is made as to whether each node is a leaf node or has any children nodes. If any given node has children nodes, then the node is split until all nodes are leaf nodes. Information gathered from the leaf nodes is used to determine the minimal diagnosis set.

Methods and apparatus using commutative error detection values for fault isolation in multiple node computers

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

Almasi, Gheorghe; Blumrich, Matthias Augustin; Chen, Dong

Methods and apparatus perform fault isolation in multiple node computing systems using commutative error detection values for--example, checksums--to identify and to isolate faulty nodes. When information associated with a reproducible portion of a computer program is injected into a network by a node, a commutative error detection value is calculated. At intervals, node fault detection apparatus associated with the multiple node computer system retrieve commutative error detection values associated with the node and stores them in memory. When the computer program is executed again by the multiple node computer system, new commutative error detection values are created and stored inmore » memory. The node fault detection apparatus identifies faulty nodes by comparing commutative error detection values associated with reproducible portions of the application program generated by a particular node from different runs of the application program. Differences in values indicate a possible faulty node.« less

Modified methylene blue injection improves lymph node harvest in rectal cancer.

PubMed

Liu, Jianpei; Huang, Pinjie; Zheng, Zongheng; Chen, Tufeng; Wei, Hongbo

2017-04-01

The presence of nodal metastases in rectal cancer plays an important role in accurate staging and prognosis, which depends on adequate lymph node harvest. The aim of this prospective study is to investigate the feasibility and survival benefit of improving lymph node harvest by a modified method with methylene blue injection in rectal cancer specimens. One hundred and thirty-one patients with rectal cancer were randomly assigned to the control group in which lymph nodes were harvested by palpation and sight, or to the methylene blue group using a modified method of injection into the superior rectal artery with methylene blue. Analysis of clinicopathologic records, including a long-term follow-up, was performed. In the methylene blue group, 678 lymph nodes were harvested by simple palpation and sight. Methylene blue injection added 853 lymph nodes to the total harvest as well as 32 additional metastatic lymph nodes, causing a shift to node-positive stage in four patients. The average number of lymph nodes harvested was 11.7 ± 3.4 in the control group and 23.2 ± 4.7 in the methylene blue group, respectively. The harvest of small lymph nodes (<5 mm) and the average number of metastatic nodes were both significantly higher in the methylene blue group. The modified method of injection with methylene blue had no impact on overall survival. The modified method with methylene blue injection improved lymph node harvest in rectal cancer, especially small node and metastatic node retrieval, which provided more accurate staging. However, it was not associated with overall survival. © 2014 Royal Australasian College of Surgeons.

Vascularity as assessed by Doppler intraoral ultrasound around the invasion front of tongue cancer is a predictor of pathological grade of malignancy and cervical lymph node metastasis.

PubMed

Yamamoto, Chika; Yuasa, Kenji; Okamura, Kazuhiko; Shiraishi, Tomoko; Miwa, Kunihiro

2016-01-01

To quantitatively evaluate the relationship of vascularity of tongue cancer as demonstrated on intraoral ultrasonography images and tumour thickness with pathological grade of malignancy and the presence of cervical lymph node metastases. 18 patients with tongue cancer were enrolled in this retrospective study. Using Doppler ultrasonography images of the invasion front of the cancers along the length of their tumour boundaries, three vascular indexes were analysed quantitatively, namely ratio of blood flow signal area within the cancer to whole tumour area (BAR), blood flow signal number ratio (BNR) and blood flow signal width ratio (BWR). The associations between these three indexes and occurrence of cervical lymph node metastasis and pathological grade of malignancy [Yamamoto-Kohama (YK) classification] were assessed. Furthermore, the relationship between tumour thickness and occurrence of cervical lymph node metastasis was evaluated on B-mode intraoral ultrasonography images. There was no significant association between BAR and tumour thickness or occurrence of cervical lymph node metastasis. The BNRs and BWRs of patients with cervical lymph node metastasis were significantly higher than those of patients without nodal involvement. The BWRs of patients with high-grade malignancy (YK-4C) were significantly higher than those of patients with low-grade malignancy (YK-2 or 3). BNR and BWR on the invasion front of the tongue cancer are predictors of pathological grade of malignancy and cervical lymph node metastasis.

Wall-layer model for LES with massive separation

NASA Astrophysics Data System (ADS)

Fakhari, Ahmad; Armenio, Vincenzo; Roman, Federico

2016-11-01

Currently, Wall Functions (WF) work well under specific conditions, mostly exhibit drawbacks specially in flows with separation beyond curvatures. In this work, we propose a more general WF which works well in attached and detached flows, in presence and absence of Immersed Boundaries (IB). First we modified an equilibrium stress WF for boundary-fitted geometry making dynamic the computation of the k (von Karman constant) of the log-law; the model was first applied to a periodic open channel flow, and then to the flow over a 2D single hill using uniform coarse grids; the model captured separation with reasonable accuracy. Thereafter IB Method by Roman et al. was improved to avoid momentum loss at the interface between the fluid-solid regions. This required calibration of interfacial eddy viscosity; also a random stochastic forcing was used in wall-normal direction to increase Reynolds stresses and improve mean velocity profile. Finally, to reproduce flow separation, a simplified boundary layer equation was applied to construct velocity at near wall computational nodes. The new scheme was tested on the 2D single hill and periodic hills applying Cartesian and curvilinear grids; good agreement with references was obtained with reduction in cost and complexity. Financial support from project COSMO "CFD open source per opera morta" PAR FSC 2007-2013, Friuli Venezia Giulia.

Dense volumetric detection and segmentation of mediastinal lymph nodes in chest CT images

NASA Astrophysics Data System (ADS)

Oda, Hirohisa; Roth, Holger R.; Bhatia, Kanwal K.; Oda, Masahiro; Kitasaka, Takayuki; Iwano, Shingo; Homma, Hirotoshi; Takabatake, Hirotsugu; Mori, Masaki; Natori, Hiroshi; Schnabel, Julia A.; Mori, Kensaku

2018-02-01

We propose a novel mediastinal lymph node detection and segmentation method from chest CT volumes based on fully convolutional networks (FCNs). Most lymph node detection methods are based on filters for blob-like structures, which are not specific for lymph nodes. The 3D U-Net is a recent example of the state-of-the-art 3D FCNs. The 3D U-Net can be trained to learn appearances of lymph nodes in order to output lymph node likelihood maps on input CT volumes. However, it is prone to oversegmentation of each lymph node due to the strong data imbalance between lymph nodes and the remaining part of the CT volumes. To moderate the balance of sizes between the target classes, we train the 3D U-Net using not only lymph node annotations but also other anatomical structures (lungs, airways, aortic arches, and pulmonary arteries) that can be extracted robustly in an automated fashion. We applied the proposed method to 45 cases of contrast-enhanced chest CT volumes. Experimental results showed that 95.5% of lymph nodes were detected with 16.3 false positives per CT volume. The segmentation results showed that the proposed method can prevent oversegmentation, achieving an average Dice score of 52.3 +/- 23.1%, compared to the baseline method with 49.2 +/- 23.8%, respectively.

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

NASA Technical Reports Server (NTRS)

Majumdar, A. K.; Hedayat, A.

2015-01-01

This paper describes the experience of the authors in using the Generalized Fluid System Simulation Program (GFSSP) in teaching Design of Thermal Systems class at University of Alabama in Huntsville. GFSSP is a finite volume based thermo-fluid system network analysis code, developed at NASA/Marshall Space Flight Center, and is extensively used in NASA, Department of Defense, and aerospace industries for propulsion system design, analysis, and performance evaluation. The educational version of GFSSP is freely available to all US higher education institutions. The main purpose of the paper is to illustrate the utilization of this user-friendly code for the thermal systems design and fluid engineering courses and to encourage the instructors to utilize the code for the class assignments as well as senior design projects. The need for a generalized computer program for thermofluid analysis in a flow network has been felt for a long time in aerospace industries. Designers of thermofluid systems often need to know pressures, temperatures, flow rates, concentrations, and heat transfer rates at different parts of a flow circuit for steady state or transient conditions. Such applications occur in propulsion systems for tank pressurization, internal flow analysis of rocket engine turbopumps, chilldown of cryogenic tanks and transfer lines, and many other applications of gas-liquid systems involving fluid transients and conjugate heat and mass transfer. Computer resource requirements to perform time-dependent, three-dimensional Navier-Stokes computational fluid dynamic (CFD) analysis of such systems are prohibitive and therefore are not practical. Available commercial codes are generally suitable for steady state, single-phase incompressible flow. Because of the proprietary nature of such codes, it is not possible to extend their capability to satisfy the above-mentioned needs. Therefore, the Generalized Fluid System Simulation Program (GFSSP1) has been developed at NASA Marshall Space Flight Center (MSFC) as a general fluid flow system solver capable of handling phase changes, compressibility, mixture thermodynamics and transient operations. It also includes the capability to model external body forces such as gravity and centrifugal effects in a complex flow network. The objectives of GFSSP development are: a) to develop a robust and efficient numerical algorithm to solve a system of equations describing a flow network containing phase changes, mixing, and rotation; and b) to implement the algorithm in a structured, easy-to-use computer program. The analysis of thermofluid dynamics in a complex network requires resolution of the system into fluid nodes and branches, and solid nodes and conductors as shown in Figure 1. Figure 1 shows a schematic and GFSSP flow circuit of a counter-flow heat exchanger. Hot nitrogen gas is flowing through a pipe, colder nitrogen is flowing counter to the hot stream in the annulus pipe and heat transfer occurs through metal tubes. The problem considered is to calculate flowrates and temperature distributions in both streams. GFSSP has a unique data structure, as shown in Figure 2, that allows constructing all possible arrangements of a flow network with no limit on the number of elements. The elements of a flow network are boundary nodes where pressure and temperature are specified, internal nodes where pressure and temperature are calculated, and branches where flowrates are calculated. For conjugate heat transfer problems, there are three additional elements: solid node, ambient node, and conductor. The solid and fluid nodes are connected with solid-fluid conductors. GFSSP solves the conservation equations of mass and energy, and equation of state in internal nodes to calculate pressure, temperature and resident mass. The momentum conservation equation is solved in branches to calculate flowrate. It also solves for energy conservation equations to calculate temperatures of solid nodes. The equations are coupled and nonlinear; therefore, they are solved by an iterative numerical scheme. GFSSP employs a unique numerical scheme known as simultaneous adjustment with successive substitution (SASS), which is a combination of Newton-Raphson and successive substitution methods. The mass and momentum conservation equations and the equation of state are solved by the Newton-Raphson method while the conservation of energy and species are solved by the successive substitution method. GFSSP is linked with two thermodynamic property programs, GASP2 and WASP3 and GASPAK4, that provide thermodynamic and thermophysical properties of selected fluids. Both programs cover a range of pressure and temperature that allows fluid properties to be evaluated for liquid, liquid-vapor (saturation), and vapor region. GASP and WASP provide properties of 12 fluids. GASPAK includes a library of 36 fluids. GFSSP has three major parts. The first part is the graphical user interface (GUI), visual thermofluid analyzer of systems and components (VTASC). VTASC allows users to create a flow circuit by a 'point and click' paradigm. It creates the GFSSP input file after the completion of the model building process. GFSSP's GUI provides the users a platform to build and run their models. It also allows post-processing of results. The network flow circuit is first built using three basic elements: boundary node, internal node, and branch.

Comparative evaluation of [(99m)tc]tilmanocept for sentinel lymph node mapping in breast cancer patients: results of two phase 3 trials.

PubMed

Wallace, Anne M; Han, Linda K; Povoski, Stephen P; Deck, Kenneth; Schneebaum, Schlomo; Hall, Nathan C; Hoh, Carl K; Limmer, Karl K; Krontiras, Helen; Frazier, Thomas G; Cox, Charles; Avisar, Eli; Faries, Mark; King, Dennis W; Christman, Lori; Vera, David R

2013-08-01

Sentinel lymph node (SLN) surgery is used worldwide for staging breast cancer patients and helps limit axillary lymph node dissection. [(99m)Tc]Tilmanocept is a novel receptor-targeted radiopharmaceutical evaluated in 2 open-label, nonrandomized, within-patient, phase 3 trials designed to assess the lymphatic mapping performance. A total of 13 centers contributed 148 patients with breast cancer. Each patient received [(99m)Tc]tilmanocept and vital blue dye (VBD). Lymph nodes identified intraoperatively as radioactive and/or blue stained were excised and histologically examined. The primary endpoint, concordance (lower boundary set point at 90 %), was the proportion of nodes detected by VBD and [(99m)Tc]tilmanocept. A total of 13 centers contributed 148 patients who were injected with both agents. Intraoperatively, 207 of 209 nodes detected by VBD were also detected by [(99m)Tc]tilmanocept for a concordance rate of 99.04 % (p < 0.0001). [(99m)Tc]tilmanocept detected a total of 320 nodes, of which 207 (64.7 %) were detected by VBD. [(99m)Tc]Tilmanocept detected at least 1 SLN in more patients (146) than did VBD (131, p < 0.0001). In 129 of 131 patients with ≥1 blue node, all blue nodes were radioactive. Of 33 pathology-positive nodes (18.2 % patient pathology rate), [(99m)Tc]tilmanocept detected 31 of 33, whereas VBD detected only 25 of 33 (p = 0.0312). No pathology-positive SLNs were detected exclusively by VBD. No serious adverse events were attributed to [(99m)Tc]tilmanocept. [(99m)Tc]Tilmanocept demonstrated success in detecting a SLN while meeting the primary endpoint. Interestingly, [(99m)Tc]tilmanocept was additionally noted to identify more SLNs in more patients. This localization represented a higher number of metastatic breast cancer lymph nodes than that of VBD.

Histologic Review of Sarcoidosis in a Neck Lymph Node.

PubMed

Welter, Shannon M; DeLuca-Johnson, Javier; Thompson, Keith

2018-06-01

Sarcoidosis is a multisystem granulomatous disease of unknown etiology. It may occur at any age, but is most commonly seen in young to middle age adults. Sarcoidosis remains more common in women regardless of geographic or racial boundaries. Although the etiology remains unclear, the most common explanation is that sarcoidosis is a disease of immunologic dysregulation triggered by an as yet unidentified environmental or microbial antigen in genetically susceptible persons. We review a case of sarcoidosis with was initially diagnosed in a neck lymph node that was removed for evaluation of metastatic squamous cell carcinoma with a discussion on the clinical and histologic characteristic of the disease.

A fast object-oriented Matlab implementation of the Reproducing Kernel Particle Method

NASA Astrophysics Data System (ADS)

Barbieri, Ettore; Meo, Michele

2012-05-01

Novel numerical methods, known as Meshless Methods or Meshfree Methods and, in a wider perspective, Partition of Unity Methods, promise to overcome most of disadvantages of the traditional finite element techniques. The absence of a mesh makes meshfree methods very attractive for those problems involving large deformations, moving boundaries and crack propagation. However, meshfree methods still have significant limitations that prevent their acceptance among researchers and engineers, namely the computational costs. This paper presents an in-depth analysis of computational techniques to speed-up the computation of the shape functions in the Reproducing Kernel Particle Method and Moving Least Squares, with particular focus on their bottlenecks, like the neighbour search, the inversion of the moment matrix and the assembly of the stiffness matrix. The paper presents numerous computational solutions aimed at a considerable reduction of the computational times: the use of kd-trees for the neighbour search, sparse indexing of the nodes-points connectivity and, most importantly, the explicit and vectorized inversion of the moment matrix without using loops and numerical routines.

Ranking influential spreaders is an ill-defined problem

NASA Astrophysics Data System (ADS)

Gu, Jain; Lee, Sungmin; Saramäki, Jari; Holme, Petter

2017-06-01

Finding influential spreaders of information and disease in networks is an important theoretical problem, and one of considerable recent interest. It has been almost exclusively formulated as a node-ranking problem —methods for identifying influential spreaders output a ranking of the nodes. In this work, we show that such a greedy heuristic does not necessarily work: the set of most influential nodes depends on the number of nodes in the set. Therefore, the set of n most important nodes to vaccinate does not need to have any node in common with the set of n + 1 most important nodes. We propose a method for quantifying the extent and impact of this phenomenon. By this method, we show that it is a common phenomenon in both empirical and model networks.

Comparing the basins of attraction for several methods in the circular Sitnikov problem with spheroid primaries

NASA Astrophysics Data System (ADS)

Zotos, Euaggelos E.

2018-06-01

The circular Sitnikov problem, where the two primary bodies are prolate or oblate spheroids, is numerically investigated. In particular, the basins of convergence on the complex plane are revealed by using a large collection of numerical methods of several order. We consider four cases, regarding the value of the oblateness coefficient which determines the nature of the roots (attractors) of the system. For all cases we use the iterative schemes for performing a thorough and systematic classification of the nodes on the complex plane. The distribution of the iterations as well as the probability and their correlations with the corresponding basins of convergence are also discussed. Our numerical computations indicate that most of the iterative schemes provide relatively similar convergence structures on the complex plane. However, there are some numerical methods for which the corresponding basins of attraction are extremely complicated with highly fractal basin boundaries. Moreover, it is proved that the efficiency strongly varies between the numerical methods.

A Routing Path Construction Method for Key Dissemination Messages in Sensor Networks

PubMed Central

Moon, Soo Young; Cho, Tae Ho

2014-01-01

Authentication is an important security mechanism for detecting forged messages in a sensor network. Each cluster head (CH) in dynamic key distribution schemes forwards a key dissemination message that contains encrypted authentication keys within its cluster to next-hop nodes for the purpose of authentication. The forwarding path of the key dissemination message strongly affects the number of nodes to which the authentication keys in the message are actually distributed. We propose a routing method for the key dissemination messages to increase the number of nodes that obtain the authentication keys. In the proposed method, each node selects next-hop nodes to which the key dissemination message will be forwarded based on secret key indexes, the distance to the sink node, and the energy consumption of its neighbor nodes. The experimental results show that the proposed method can increase by 50–70% the number of nodes to which authentication keys in each cluster are distributed compared to geographic and energy-aware routing (GEAR). In addition, the proposed method can detect false reports earlier by using the distributed authentication keys, and it consumes less energy than GEAR when the false traffic ratio (FTR) is ≥10%. PMID:25136649

CT-based definition of thoracic lymph node stations: an atlas from the University of Michigan.

PubMed

Chapet, Olivier; Kong, Feng-Ming; Quint, Leslie E; Chang, Andrew C; Ten Haken, Randall K; Eisbruch, Avraham; Hayman, James A

2005-09-01

Accurate delineation of the mediastinal and hilar lymph node regions is essential for a reproducible definition of target volumes used in conformal irradiation of non-small-cell lung cancer. The goal of this work was to generate a consensus to delineate these nodal regions based on definitions from the American Joint Committee on Cancer. A dedicated thoracic radiologist, thoracic surgeon, medical physicist, and three radiation oncologists were gathered to generate a three-dimensional radiologic description for the mediastinal and hilar nodal regions on axial CT scans. This paper proposes an atlas of most of the lymph node stations described by Mountain and Dresler. The CT boundaries of lymph node stations 1-2, 3, 4, 5, 6, 7, 8, 10-11 were defined on axial CT, along with image illustrations. These CT-based illustrative definitions will provide guidelines for clinical practice and studies evaluating incidental radiation in radiotherapy. Studies are ongoing at the University of Michigan to measure quantitatively the incidental nodal radiation received by patients with non-small-cell lung cancer.

Choice of no-slip curved boundary condition for lattice Boltzmann simulations of high-Reynolds-number flows.

PubMed

Sanjeevi, Sathish K P; Zarghami, Ahad; Padding, Johan T

2018-04-01

Various curved no-slip boundary conditions available in literature improve the accuracy of lattice Boltzmann simulations compared to the traditional staircase approximation of curved geometries. Usually, the required unknown distribution functions emerging from the solid nodes are computed based on the known distribution functions using interpolation or extrapolation schemes. On using such curved boundary schemes, there will be mass loss or gain at each time step during the simulations, especially apparent at high Reynolds numbers, which is called mass leakage. Such an issue becomes severe in periodic flows, where the mass leakage accumulation would affect the computed flow fields over time. In this paper, we examine mass leakage of the most well-known curved boundary treatments for high-Reynolds-number flows. Apart from the existing schemes, we also test different forced mass conservation schemes and a constant density scheme. The capability of each scheme is investigated and, finally, recommendations for choosing a proper boundary condition scheme are given for stable and accurate simulations.

Choice of no-slip curved boundary condition for lattice Boltzmann simulations of high-Reynolds-number flows

NASA Astrophysics Data System (ADS)

Sanjeevi, Sathish K. P.; Zarghami, Ahad; Padding, Johan T.

2018-04-01

Various curved no-slip boundary conditions available in literature improve the accuracy of lattice Boltzmann simulations compared to the traditional staircase approximation of curved geometries. Usually, the required unknown distribution functions emerging from the solid nodes are computed based on the known distribution functions using interpolation or extrapolation schemes. On using such curved boundary schemes, there will be mass loss or gain at each time step during the simulations, especially apparent at high Reynolds numbers, which is called mass leakage. Such an issue becomes severe in periodic flows, where the mass leakage accumulation would affect the computed flow fields over time. In this paper, we examine mass leakage of the most well-known curved boundary treatments for high-Reynolds-number flows. Apart from the existing schemes, we also test different forced mass conservation schemes and a constant density scheme. The capability of each scheme is investigated and, finally, recommendations for choosing a proper boundary condition scheme are given for stable and accurate simulations.

Semi-automatic central-chest lymph-node definition from 3D MDCT images

NASA Astrophysics Data System (ADS)

Lu, Kongkuo; Higgins, William E.

2010-03-01

Central-chest lymph nodes play a vital role in lung-cancer staging. The three-dimensional (3D) definition of lymph nodes from multidetector computed-tomography (MDCT) images, however, remains an open problem. This is because of the limitations in the MDCT imaging of soft-tissue structures and the complicated phenomena that influence the appearance of a lymph node in an MDCT image. In the past, we have made significant efforts toward developing (1) live-wire-based segmentation methods for defining 2D and 3D chest structures and (2) a computer-based system for automatic definition and interactive visualization of the Mountain central-chest lymph-node stations. Based on these works, we propose new single-click and single-section live-wire methods for segmenting central-chest lymph nodes. The single-click live wire only requires the user to select an object pixel on one 2D MDCT section and is designed for typical lymph nodes. The single-section live wire requires the user to process one selected 2D section using standard 2D live wire, but it is more robust. We applied these methods to the segmentation of 20 lymph nodes from two human MDCT chest scans (10 per scan) drawn from our ground-truth database. The single-click live wire segmented 75% of the selected nodes successfully and reproducibly, while the success rate for the single-section live wire was 85%. We are able to segment the remaining nodes, using our previously derived (but more interaction intense) 2D live-wire method incorporated in our lymph-node analysis system. Both proposed methods are reliable and applicable to a wide range of pulmonary lymph nodes.

[Injection of methylene blue into inferior mesenteric artery improves lymph node harvest in rectal cancer after neoadjuvant chemotherapy].

PubMed

Liu, Jianpei; Huang, Pinjie; Huang, Jianglong; Chen, Tufeng; Wei, Hongbo

2015-06-09

To confirm the feasibility of improving lymph node harvest by injecting methylene blue into inferior mesenteric artery in rectal cancer after neoadjuvant therapy. Forty two ex vivo specimens were collected from rectal cancer patients with neoadjuvant therapy and radical operation at our hospital. Traditional method with palpation and injection of methylene blue into inferior mesenteric artery were employed. The data of lymph node harvest were analyzed by paired t and chi-square tests. The average number of detected lymph node in traditional method and methylene blue groups were 6.1 ± 4.3 and 15.2 ± 6.4 respectively (P<0.001). The proportions of lymph nodes <5 mm were 14.1% and 46.7% in traditional method and methylene blue groups respectively (P<0.001). And the injection of methylene blue added 13 extra metastatic lymph nodes and caused a shift to node-positive stage (P=0.89). Neoadjuvant therapy decrease lymph node retrieval in rectal cancer. Injecting methylene blue into inferior mesenteric artery improves lymph node harvest especially for small nodes and helps to acquire more metastatic nodes for accurate pathological staging.

Accuracy Analysis for Finite-Volume Discretization Schemes on Irregular Grids

NASA Technical Reports Server (NTRS)

Diskin, Boris; Thomas, James L.

2010-01-01

A new computational analysis tool, downscaling test, is introduced and applied for studying the convergence rates of truncation and discretization errors of nite-volume discretization schemes on general irregular (e.g., unstructured) grids. The study shows that the design-order convergence of discretization errors can be achieved even when truncation errors exhibit a lower-order convergence or, in some cases, do not converge at all. The downscaling test is a general, efficient, accurate, and practical tool, enabling straightforward extension of verification and validation to general unstructured grid formulations. It also allows separate analysis of the interior, boundaries, and singularities that could be useful even in structured-grid settings. There are several new findings arising from the use of the downscaling test analysis. It is shown that the discretization accuracy of a common node-centered nite-volume scheme, known to be second-order accurate for inviscid equations on triangular grids, degenerates to first order for mixed grids. Alternative node-centered schemes are presented and demonstrated to provide second and third order accuracies on general mixed grids. The local accuracy deterioration at intersections of tangency and in flow/outflow boundaries is demonstrated using the DS tests tailored to examining the local behavior of the boundary conditions. The discretization-error order reduction within inviscid stagnation regions is demonstrated. The accuracy deterioration is local, affecting mainly the velocity components, but applies to any order scheme.

Simulation of Stagnation Region Heating in Hypersonic Flow on Tetrahedral Grids

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2007-01-01

Hypersonic flow simulations using the node based, unstructured grid code FUN3D are presented. Applications include simple (cylinder) and complex (towed ballute) configurations. Emphasis throughout is on computation of stagnation region heating in hypersonic flow on tetrahedral grids. Hypersonic flow over a cylinder provides a simple test problem for exposing any flaws in a simulation algorithm with regard to its ability to compute accurate heating on such grids. Such flaws predominantly derive from the quality of the captured shock. The importance of pure tetrahedral formulations are discussed. Algorithm adjustments for the baseline Roe / Symmetric, Total-Variation-Diminishing (STVD) formulation to deal with simulation accuracy are presented. Formulations of surface normal gradients to compute heating and diffusion to the surface as needed for a radiative equilibrium wall boundary condition and finite catalytic wall boundary in the node-based unstructured environment are developed. A satisfactory resolution of the heating problem on tetrahedral grids is not realized here; however, a definition of a test problem, and discussion of observed algorithm behaviors to date are presented in order to promote further research on this important problem.

Two-dimensional materials based transparent flexible electronics

NASA Astrophysics Data System (ADS)

Yu, Lili; Ha, Sungjae; El-Damak, Dina; McVay, Elaine; Ling, Xi; Chandrakasan, Anantha; Kong, Jing; Palacios, Tomas

2015-03-01

Two-dimensional (2D) materials have generated great interest recently as a set of tools for electronics, as these materials can push electronics beyond traditional boundaries. These materials and their heterostructures offer excellent mechanical flexibility, optical transparency, and favorable transport properties for realizing electronic, sensing, and optical systems on arbitrary surfaces. These thin, lightweight, bendable, highly rugged and low-power devices may bring dramatic changes in information processing, communications and human-electronic interaction. In this report, for the first time, we demonstrate two complex transparent flexible systems based on molybdenum disulfide (MoS2) grown by chemical vapor method: a transparent active-matrix organic light-emitting diode (AMOLED) display and a MoS2 wireless link for sensor nodes. The 1/2 x 1/2 square inch, 4 x 5 pixels AMOLED structures are built on transparent substrates, containing MoS2 back plane circuit and OLEDs integrated on top of it. The back plane circuit turns on and off the individual pixel with two MoS2 transistors and a capacitor. The device is designed and fabricated based on SPICE simulation to achieve desired DC and transient performance. We have also demonstrated a MoS2 wireless self-powered sensor node. The system consists of as energy harvester, rectifier, sensor node and logic units. AC signals from the environment, such as near-field wireless power transfer, piezoelectric film and RF signal, are harvested, then rectified into DC signal by a MoS2 diode. CIQM, CICS, SRC.

Methods for operating parallel computing systems employing sequenced communications

DOEpatents

Benner, R.E.; Gustafson, J.L.; Montry, G.R.

1999-08-10

A parallel computing system and method are disclosed having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system. 15 figs.

Methods for operating parallel computing systems employing sequenced communications

DOEpatents

Benner, Robert E.; Gustafson, John L.; Montry, Gary R.

1999-01-01

A parallel computing system and method having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system.

Method for simultaneous overlapped communications between neighboring processors in a multiple

DOEpatents

Benner, Robert E.; Gustafson, John L.; Montry, Gary R.

1991-01-01

A parallel computing system and method having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system.

An Algorithm for Critical Nodes Problem in Social Networks Based on Owen Value

PubMed Central

Wang, Xue-Guang

2014-01-01

Discovering critical nodes in social networks has many important applications. For finding out the critical nodes and considering the widespread community structure in social networks, we obtain each node's marginal contribution by Owen value. And then we can give a method for the solution of the critical node problem. We validate the feasibility and effectiveness of our method on two synthetic datasets and six real datasets. At the same time, the result obtained by using our method to analyze the terrorist network is in line with the actual situation. PMID:25006592

Analysis of coherent dynamical processes through computer vision

NASA Astrophysics Data System (ADS)

Hack, M. J. Philipp

2016-11-01

Visualizations of turbulent boundary layers show an abundance of characteristic arc-shaped structures whose apparent similarity suggests a common origin in a coherent dynamical process. While the structures have been likened to the hairpin vortices observed in the late stages of transitional flow, a consistent description of the underlying mechanism has remained elusive. Detailed studies are complicated by the chaotic nature of turbulence which modulates each manifestation of the process and which renders the isolation of individual structures a challenging task. The present study applies methods from the field of computer vision to capture the time evolution of turbulent flow features and explore the associated physical mechanisms. The algorithm uses morphological operations to condense the structure of the turbulent flow field into a graph described by nodes and links. The low-dimensional geometric information is stored in a database and allows the identification and analysis of equivalent dynamical processes across multiple scales. The framework is not limited to turbulent boundary layers and can also be applied to different types of flows as well as problems from other fields of science.

Multi-directional fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D.; Smith, Brian Edward

2010-11-23

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Multi-directional fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2009-03-17

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Multi-directional fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D.; Smith, Brian Edward

2010-06-29

An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Implementing asyncronous collective operations in a multi-node processing system

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

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memorymore » buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.« less

Indocyanine green SPY elite-assisted sentinel lymph node biopsy in cutaneous melanoma.

PubMed

Korn, Jason M; Tellez-Diaz, Alejandra; Bartz-Kurycki, Marisa; Gastman, Brian

2014-04-01

Sentinel lymph node biopsy is the standard of care for intermediate-depth and high-risk thin melanomas. Recently, indocyanine green and near-infrared imaging have been used to aid in sentinel node biopsy. The present study aimed to determine the feasibility of sentinel lymph node biopsy with indocyanine green SPY Elite navigation and to critically evaluate the technique compared with the standard modalities. A retrospective review of 90 consecutive cutaneous melanoma patients who underwent sentinel lymph node biopsy was performed. Two cohorts were formed: group A, which had sentinel lymph node biopsy performed with blue dye and radioisotope; and group B, which had sentinel lymph node biopsy performed with radioisotope and indocyanine green SPY Elite navigation. The cohorts were compared to assess for differences in localization rates, sensitivity and specificity of sentinel node identification, and length of surgery. The sentinel lymph node localization rate was 79.4 percent using the blue dye method, 98.0 percent using the indocyanine green fluorescence method, and 97.8 percent using the radioisotope/handheld gamma probe method. Indocyanine green fluorescence detected more sentinel lymph nodes than the vital dye method alone (p = 0.020). A trend toward a reduction in length of surgery was noted in the SPY Elite cohort. Sentinel lymph node mapping and localization in cutaneous melanoma with the indocyanine green SPY Elite navigation system is technically feasible and may offer several advantages over current modalities, including higher sensitivity and specificity, decreased number of lymph nodes sampled, decreased operative time, and potentially lower false-negative rates. Diagnostic, II.

Fluid Structure Interaction Techniques For Extrusion And Mixing Processes

NASA Astrophysics Data System (ADS)

Valette, Rudy; Vergnes, Bruno; Coupez, Thierry

2007-05-01

This work focuses on the development of numerical techniques devoted to the simulation of mixing processes of complex fluids such as twin-screw extrusion or batch mixing. In mixing process simulation, the absence of symmetry of the moving boundaries (the screws or the rotors) implies that their rigid body motion has to be taken into account by using a special treatment We therefore use a mesh immersion technique (MIT), which consists in using a P1+/P1-based (MINI-element) mixed finite element method for solving the velocity-pressure problem and then solving the problem in the whole barrel cavity by imposing a rigid motion (rotation) to nodes found located inside the so called immersed domain, each sub-domain (screw, rotor) being represented by a surface CAD mesh (or its mathematical equation in simple cases). The independent meshes are immersed into a unique background computational mesh by computing the distance function to their boundaries. Intersections of meshes are accounted for, allowing to compute a fill factor usable as for the VOF methodology. This technique, combined with the use of parallel computing, allows to compute the time-dependent flow of generalized Newtonian fluids including yield stress fluids in a complex system such as a twin screw extruder, including moving free surfaces, which are treated by a "level set" and Hamilton-Jacobi method.

Baseline Computational Fluid Dynamics Methodology for Longitudinal-Mode Liquid-Propellant Rocket Combustion Instability

NASA Technical Reports Server (NTRS)

Litchford, R. J.

2005-01-01

A computational method for the analysis of longitudinal-mode liquid rocket combustion instability has been developed based on the unsteady, quasi-one-dimensional Euler equations where the combustion process source terms were introduced through the incorporation of a two-zone, linearized representation: (1) A two-parameter collapsed combustion zone at the injector face, and (2) a two-parameter distributed combustion zone based on a Lagrangian treatment of the propellant spray. The unsteady Euler equations in inhomogeneous form retain full hyperbolicity and are integrated implicitly in time using second-order, high-resolution, characteristic-based, flux-differencing spatial discretization with Roe-averaging of the Jacobian matrix. This method was initially validated against an analytical solution for nonreacting, isentropic duct acoustics with specified admittances at the inflow and outflow boundaries. For small amplitude perturbations, numerical predictions for the amplification coefficient and oscillation period were found to compare favorably with predictions from linearized small-disturbance theory as long as the grid exceeded a critical density (100 nodes/wavelength). The numerical methodology was then exercised on a generic combustor configuration using both collapsed and distributed combustion zone models with a short nozzle admittance approximation for the outflow boundary. In these cases, the response parameters were varied to determine stability limits defining resonant coupling onset.

Two-step FEM-based Liver-CT registration: improving internal and external accuracy

NASA Astrophysics Data System (ADS)

Oyarzun Laura, Cristina; Drechsler, Klaus; Wesarg, Stefan

2014-03-01

To know the exact location of the internal structures of the organs, especially the vasculature, is of great importance for the clinicians. This information allows them to know which structures/vessels will be affected by certain therapy and therefore to better treat the patients. However the use of internal structures for registration is often disregarded especially in physical based registration methods. In this paper we propose an algorithm that uses finite element methods to carry out a registration of liver volumes that will not only have accuracy in the boundaries of the organ but also in the interior. Therefore a graph matching algorithm is used to find correspondences between the vessel trees of the two livers to be registered. In addition to this an adaptive volumetric mesh is generated that contains nodes in the locations in which correspondences were found. The displacements derived from those correspondences are the input for the initial deformation of the model. The first deformation brings the internal structures to their final deformed positions and the surfaces close to it. Finally, thin plate splines are used to refine the solution at the boundaries of the organ achieving an improvement in the accuracy of 71%. The algorithm has been evaluated in CT clinical images of the abdomen.

Analytic Modeling of Pressurization and Cryogenic Propellant

NASA Technical Reports Server (NTRS)

Corpening, Jeremy H.

2010-01-01

An analytic model for pressurization and cryogenic propellant conditions during all mission phases of any liquid rocket based vehicle has been developed and validated. The model assumes the propellant tanks to be divided into five nodes and also implements an empirical correlation for liquid stratification if desired. The five nodes include a tank wall node exposed to ullage gas, an ullage gas node, a saturated propellant vapor node at the liquid-vapor interface, a liquid node, and a tank wall node exposed to liquid. The conservation equations of mass and energy are then applied across all the node boundaries and, with the use of perfect gas assumptions, explicit solutions for ullage and liquid conditions are derived. All fluid properties are updated real time using NIST Refprop.1 Further, mass transfer at the liquid-vapor interface is included in the form of evaporation, bulk boiling of liquid propellant, and condensation given the appropriate conditions for each. Model validation has proven highly successful against previous analytic models and various Saturn era test data and reasonably successful against more recent LH2 tank self pressurization ground test data. Finally, this model has been applied to numerous design iterations for the Altair Lunar Lander, Ares V Core Stage, and Ares V Earth Departure Stage in order to characterize Helium and autogenous pressurant requirements, propellant lost to evaporation and thermodynamic venting to maintain propellant conditions, and non-uniform tank draining in configurations utilizing multiple LH2 or LO2 propellant tanks. In conclusion, this model provides an accurate and efficient means of analyzing multiple design configurations for any cryogenic propellant tank in launch, low-acceleration coast, or in-space maneuvering and supplies the user with pressurization requirements, unusable propellants from evaporation and liquid stratification, and general ullage gas, liquid, and tank wall conditions as functions of time.

A Node Localization Algorithm Based on Multi-Granularity Regional Division and the Lagrange Multiplier Method in Wireless Sensor Networks.

PubMed

Shang, Fengjun; Jiang, Yi; Xiong, Anping; Su, Wen; He, Li

2016-11-18

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed. When the unknown node is inside positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is outside positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

A prospective single-center study of sentinel lymph node detection in cervical carcinoma: is there a place in clinical practice?

PubMed

Devaja, Omer; Mehra, Gautam; Coutts, Michael; Montalto, Stephen Attard; Donaldson, John; Kodampur, Mallikarjun; Papadopoulos, Andreas John

2012-07-01

To establish the accuracy of sentinel lymph node (SLN) detection in early cervical cancer. Sentinel lymph node detection was performed prospectively over a 6-year period in 86 women undergoing surgery for cervical carcinoma by the combined method (Tc-99m and methylene blue dye). Further ultrastaging was performed on a subgroup of 26 patients who had benign SLNs on initial routine histological examination. The SLN was detected in 84 (97.7%) of 86 women by the combined method. Blue dye uptake was not seen in 8 women (90.7%). Sentinel lymph nodes were detected bilaterally in 63 women (73.3%), and the external iliac region was the most common anatomic location (48.8%). The median SLN count was 3 nodes (range, 1-7). Of the 84 women with sentinel node detection, 65 also underwent bilateral pelvic lymph node dissection, and in none of these cases was a benign SLN associated with a malignant non-SLN (100% negative predictive value). The median non-SLN count for all patients was 19 nodes (range, 8-35). Eighteen patients underwent removal of the SLN without bilateral pelvic lymph node dissection. Nine women (10.5%) had positive lymph nodes on final histology. One patient had bulky pelvic nodes on preoperative imaging and underwent removal of the negative bulky malignant lymph nodes and a benign SLN on the contralateral side. This latter case confirms the unreliability of the SLN method with bulky nodes. The remaining 8 patients had positive SLNs with negative nonsentinel lymph nodes. Fifty-nine SLNs from 26 patients, which were benign on initial routine histology, underwent ultrastaging, but no further disease was identified. Four patients (5%) relapsed after a median follow-up of 28 months (range, 8-80 months). Sentinel lymph node detection is an accurate and safe method in the assessment of nodal status in early cervical carcinoma.

A Localization Method for Underwater Wireless Sensor Networks Based on Mobility Prediction and Particle Swarm Optimization Algorithms

PubMed Central

Zhang, Ying; Liang, Jixing; Jiang, Shengming; Chen, Wei

2016-01-01

Due to their special environment, Underwater Wireless Sensor Networks (UWSNs) are usually deployed over a large sea area and the nodes are usually floating. This results in a lower beacon node distribution density, a longer time for localization, and more energy consumption. Currently most of the localization algorithms in this field do not pay enough consideration on the mobility of the nodes. In this paper, by analyzing the mobility patterns of water near the seashore, a localization method for UWSNs based on a Mobility Prediction and a Particle Swarm Optimization algorithm (MP-PSO) is proposed. In this method, the range-based PSO algorithm is used to locate the beacon nodes, and their velocities can be calculated. The velocity of an unknown node is calculated by using the spatial correlation of underwater object’s mobility, and then their locations can be predicted. The range-based PSO algorithm may cause considerable energy consumption and its computation complexity is a little bit high, nevertheless the number of beacon nodes is relatively smaller, so the calculation for the large number of unknown nodes is succinct, and this method can obviously decrease the energy consumption and time cost of localizing these mobile nodes. The simulation results indicate that this method has higher localization accuracy and better localization coverage rate compared with some other widely used localization methods in this field. PMID:26861348

Simulating incompressible flow on moving meshfree grids using General Finite Differences (GFD)

NASA Astrophysics Data System (ADS)

Vasyliv, Yaroslav; Alexeev, Alexander

2016-11-01

We simulate incompressible flow around an oscillating cylinder at different Reynolds numbers using General Finite Differences (GFD) on a meshfree grid. We evolve the meshfree grid by treating each grid node as a particle. To compute velocities and accelerations, we consider the particles at a particular instance as Eulerian observation points. The incompressible Navier-Stokes equations are directly discretized using GFD with boundary conditions enforced using a sharp interface treatment. Cloud sizes are set such that the local approximations use only 16 neighbors. To enforce incompressibility, we apply a semi-implicit approximate projection method. To prevent overlapping particles and formation of voids in the grid, we propose a particle regularization scheme based on a local minimization principle. We validate the GFD results for an oscillating cylinder against the lattice Boltzmann method and find good agreement. Financial support provided by National Science Foundation (NSF) Graduate Research Fellowship, Grant No. DGE-1148903.

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

Dyachenko, Sergey A.; Zlotnik, Anatoly; Korotkevich, Alexander O.

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme ismore » unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.« less

Multiple node remote messaging

DOEpatents

Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Ohmacht, Martin; Salapura, Valentina; Steinmacher-Burow, Burkhard; Vranas, Pavlos

2010-08-31

A method for passing remote messages in a parallel computer system formed as a network of interconnected compute nodes includes that a first compute node (A) sends a single remote message to a remote second compute node (B) in order to control the remote second compute node (B) to send at least one remote message. The method includes various steps including controlling a DMA engine at first compute node (A) to prepare the single remote message to include a first message descriptor and at least one remote message descriptor for controlling the remote second compute node (B) to send at least one remote message, including putting the first message descriptor into an injection FIFO at the first compute node (A) and sending the single remote message and the at least one remote message descriptor to the second compute node (B).

Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network

DOEpatents

Chen, Dong; Eisley, Noel A.; Steinmacher-Burow, Burkhard; Heidelberger, Philip

2013-01-29

A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

Identifying key nodes in multilayer networks based on tensor decomposition.

PubMed

Wang, Dingjie; Wang, Haitao; Zou, Xiufen

2017-06-01

The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.

Identifying key nodes in multilayer networks based on tensor decomposition

NASA Astrophysics Data System (ADS)

Wang, Dingjie; Wang, Haitao; Zou, Xiufen

2017-06-01

The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.

The alarming problems of confounding equivalence using logistic regression models in the perspective of causal diagrams.

PubMed

Yu, Yuanyuan; Li, Hongkai; Sun, Xiaoru; Su, Ping; Wang, Tingting; Liu, Yi; Yuan, Zhongshang; Liu, Yanxun; Xue, Fuzhong

2017-12-28

Confounders can produce spurious associations between exposure and outcome in observational studies. For majority of epidemiologists, adjusting for confounders using logistic regression model is their habitual method, though it has some problems in accuracy and precision. It is, therefore, important to highlight the problems of logistic regression and search the alternative method. Four causal diagram models were defined to summarize confounding equivalence. Both theoretical proofs and simulation studies were performed to verify whether conditioning on different confounding equivalence sets had the same bias-reducing potential and then to select the optimum adjusting strategy, in which logistic regression model and inverse probability weighting based marginal structural model (IPW-based-MSM) were compared. The "do-calculus" was used to calculate the true causal effect of exposure on outcome, then the bias and standard error were used to evaluate the performances of different strategies. Adjusting for different sets of confounding equivalence, as judged by identical Markov boundaries, produced different bias-reducing potential in the logistic regression model. For the sets satisfied G-admissibility, adjusting for the set including all the confounders reduced the equivalent bias to the one containing the parent nodes of the outcome, while the bias after adjusting for the parent nodes of exposure was not equivalent to them. In addition, all causal effect estimations through logistic regression were biased, although the estimation after adjusting for the parent nodes of exposure was nearest to the true causal effect. However, conditioning on different confounding equivalence sets had the same bias-reducing potential under IPW-based-MSM. Compared with logistic regression, the IPW-based-MSM could obtain unbiased causal effect estimation when the adjusted confounders satisfied G-admissibility and the optimal strategy was to adjust for the parent nodes of outcome, which obtained the highest precision. All adjustment strategies through logistic regression were biased for causal effect estimation, while IPW-based-MSM could always obtain unbiased estimation when the adjusted set satisfied G-admissibility. Thus, IPW-based-MSM was recommended to adjust for confounders set.

Simulation of the hot rolling of steel with direct iteration

NASA Astrophysics Data System (ADS)

Hanoglu, Umut; Šarler, Božidar

2017-10-01

In this study a simulation system based on the meshless Local Radial Basis Function Collocation Method (LRBFCM) is applied for the hot rolling of steel. Rolling is a complex, 3D, thermo-mechanical problem; however, 2D cross-sectional slices are used as computational domains that are aligned with the rolling direction and no heat flow or strain is considered in the direction that is orthogonal to the slices. For each predefined position with respect to the rolling direction, the solution procedure is repeated until the slice reaches the final rolling position. Collocation nodes are initially distributed over the domain and boundaries of the initial slice. A local solution is achieved by considering the overlapping influence domains with either 5 or 7 nodes. Radial Basis Functions (RBFs) are used for the temperature discretization in the thermal model and displacement discretization in the mechanical model. The meshless solution procedure does not require a mesh-generation algorithm in the classic sense. Strong-form mechanical and thermal models are run for each slice regarding the contact with the roll's surface. Ideal plastic material behavior is considered for the mechanical results, where the nonlinear stress-strain relation is solved with a direct iteration. The majority of the Finite Element Model (FEM) simulations, including commercial software, use a conventional Newton-Raphson algorithm. However, direct iteration is chosen here due to its better compatibility with meshless methods. In order to overcome any unforeseen stability issues, the redistribution of the nodes by Elliptic Node Generation (ENG) is applied to one or more slices throughout the simulation. The rolling simulation presented here helps the user to design, test and optimize different rolling schedules. The results can be seen minutes after the simulation's start in terms of temperature, displacement, stress and strain fields as well as important technological parameters, like the roll-separating forces, roll toque, etc. An example of a rolling simulation, in which an initial size of 110x110 mm steel is rolled to a round bar with 80 mm diameter, is shown in Fig. 3. A user-friendly computer application for industrial use is created by using the C# and .NET frameworks.

All row, planar fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D; Smith, Brian Edward

2013-07-23

An apparatus, program product and method for detecting nodal faults may simultaneously cause designated nodes of a cell to communicate with all nodes adjacent to each of the designated nodes. Furthermore, all nodes along the axes of the designated nodes are made to communicate with their adjacent nodes, and the communications are analyzed to determine if a node or connection is faulty.

Method and Circuit for Injecting a Precise Amount of Charge onto a Circuit Node

NASA Technical Reports Server (NTRS)

Hancock, Bruce R. (Inventor)

2016-01-01

A method and circuit for injecting charge into a circuit node, comprising (a) resetting a capacitor's voltage through a first transistor; (b) after the resetting, pre-charging the capacitor through the first transistor; and (c) after the pre-charging, further charging the capacitor through a second transistor, wherein the second transistor is connected between the capacitor and a circuit node, and the further charging draws charge through the second transistor from the circuit node, thereby injecting charge into the circuit node.

Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

DOEpatents

Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey

2010-10-05

In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

Very Efficient High-order Hyperbolic Schemes for Time-dependent Advection Diffusion Problems: Third-, Fourth-, and Sixth-order

DTIC Science & Technology

2014-07-07

boundary condition (x ¼ 7p =2; j ¼ 2p; U ¼ 1; m ¼ 1) on N ¼ 10 uniform nodes (Dt ¼ 0:01.) Table 10 Unsteady linear advection–diffusion problem with periodic...500 3rd 55 2 4th 55 2 6th 55 2 1000 3rd 116 2 4th 116 2 6th 116 2 Table 11 Unsteady linear advection–diffusion problem with oscillatory BC (x ¼ 7p =2; a...dependent problem with oscillatory BC (x ¼ 7p =2; a ¼ 1.) using the third-order RD-GT scheme with the BDF3 time discretization. Number of nodes Dt (BDF3

Distributed processing method for arbitrary view generation in camera sensor network

NASA Astrophysics Data System (ADS)

Tehrani, Mehrdad P.; Fujii, Toshiaki; Tanimoto, Masayuki

2003-05-01

Camera sensor network as a new advent of technology is a network that each sensor node can capture video signals, process and communicate them with other nodes. The processing task in this network is to generate arbitrary view, which can be requested from central node or user. To avoid unnecessary communication between nodes in camera sensor network and speed up the processing time, we have distributed the processing tasks between nodes. In this method, each sensor node processes part of interpolation algorithm to generate the interpolated image with local communication between nodes. The processing task in camera sensor network is ray-space interpolation, which is an object independent method and based on MSE minimization by using adaptive filtering. Two methods were proposed for distributing processing tasks, which are Fully Image Shared Decentralized Processing (FIS-DP), and Partially Image Shared Decentralized Processing (PIS-DP), to share image data locally. Comparison of the proposed methods with Centralized Processing (CP) method shows that PIS-DP has the highest processing speed after FIS-DP, and CP has the lowest processing speed. Communication rate of CP and PIS-DP is almost same and better than FIS-DP. So, PIS-DP is recommended because of its better performance than CP and FIS-DP.

Operator splitting method for simulation of dynamic flows in natural gas pipeline networks

DOE PAGES

Dyachenko, Sergey A.; Zlotnik, Anatoly; Korotkevich, Alexander O.; ...

2017-09-19

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme ismore » unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.« less

Rapid identifying high-influence nodes in complex networks

NASA Astrophysics Data System (ADS)

Song, Bo; Jiang, Guo-Ping; Song, Yu-Rong; Xia, Ling-Ling

2015-10-01

A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying the influential nodes in complex networks has theoretical and practical significance. Considering the uncertainties of network scale and topology, and the timeliness of dynamic behaviors in real networks, we propose a rapid identifying method (RIM) to find the fraction of high-influential nodes. Instead of ranking all nodes, our method only aims at ranking a small number of nodes in network. We set the high-influential nodes as initial spreaders, and evaluate the performance of RIM by the susceptible-infected-recovered (SIR) model. The simulations show that in different networks, RIM performs well on rapid identifying high-influential nodes, which is verified by typical ranking methods, such as degree, closeness, betweenness, and eigenvector centrality methods. Project supported by the National Natural Science Foundation of China (Grant Nos. 61374180 and 61373136), the Ministry of Education Research in the Humanities and Social Sciences Planning Fund Project, China (Grant No. 12YJAZH120), and the Six Projects Sponsoring Talent Summits of Jiangsu Province, China (Grant No. RLD201212).

Network of dedicated processors for finding lowest-cost map path

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P. (Inventor)

1991-01-01

A method and associated apparatus are disclosed for finding the lowest cost path of several variable paths. The paths are comprised of a plurality of linked cost-incurring areas existing between an origin point and a destination point. The method comprises the steps of connecting a purality of nodes together in the manner of the cost-incurring areas; programming each node to have a cost associated therewith corresponding to one of the cost-incurring areas; injecting a signal into one of the nodes representing the origin point; propagating the signal through the plurality of nodes from inputs to outputs; reducing the signal in magnitude at each node as a function of the respective cost of the node; and, starting at one of the nodes representing the destination point and following a path having the least reduction in magnitude of the signal from node to node back to one of the nodes representing the origin point whereby the lowest cost path from the origin point to the destination point is found.

Method for designing gas tag compositions

DOEpatents

Gross, Kenny C.

1995-01-01

For use in the manufacture of gas tags such as employed in a nuclear reactor gas tagging failure detection system, a method for designing gas tagging compositions utilizes an analytical approach wherein the final composition of a first canister of tag gas as measured by a mass spectrometer is designated as node #1. Lattice locations of tag nodes in multi-dimensional space are then used in calculating the compositions of a node #2 and each subsequent node so as to maximize the distance of each node from any combination of tag components which might be indistinguishable from another tag composition in a reactor fuel assembly. Alternatively, the measured compositions of tag gas numbers 1 and 2 may be used to fix the locations of nodes 1 and 2, with the locations of nodes 3-N then calculated for optimum tag gas composition. A single sphere defining the lattice locations of the tag nodes may be used to define approximately 20 tag nodes, while concentric spheres can extend the number of tag nodes to several hundred.

A Modified Kirchhoff plate theory for Free Vibration analysis of functionally graded material plates using meshfree method

NASA Astrophysics Data System (ADS)

Nguyen Van Do, Vuong

2018-04-01

In this paper, a modified Kirchhoff theory is presented for free vibration analyses of functionally graded material (FGM) plate based on modified radial point interpolation method (RPIM). The shear deformation effects are taken account into modified theory to ignore the locking phenomenon of thin plates. Due to the proposed refined plate theory, the number of independent unknowns reduces one variable and exists with four degrees of freedom per node. The simulated free vibration results employed by the modified RPIM are compared with the other analytical solutions to verify the effectiveness and the accuracy of the developed mesh-free method. Detail parametric studies of the proposed method are then conducted including the effectiveness of thickness ratio, boundary condition and material inhomogeneity on the sample problems of square plates. Results illustrated that the modified mesh-free RPIM can effectively predict the numerical calculation as compared to the exact solutions. The obtained numerical results are indicated that the proposed method are stable and well accurate prediction to evaluate with other published analyses.

Dynamic Floodplain representation in hydrologic flood forecasting using WRF-Hydro modeling framework

NASA Astrophysics Data System (ADS)

Gangodagamage, C.; Li, Z.; Maitaria, K.; Islam, M.; Ito, T.; Dhondia, J.

2016-12-01

Floods claim more lives and damage more property than any other category of natural disaster in the Continental United States. A system that can demarcate local flood boundaries dynamically could help flood prone communities prepare for and even prevent from catastrophic flood events. Lateral distance from the centerline of the river to the right and left floodplains for the water levels coming out of the models at each grid location have not been properly integrated with the national hydrography dataset (NHDPlus). The NHDPlus dataset represents the stream network with feature classes such as rivers, tributaries, canals, lakes, ponds, dams, coastlines, and stream gages. The NHDPlus dataset consists of approximately 2.7 million river reaches defining how surface water drains to the ocean. These river reaches have upstream and downstream nodes and basic parameters such as flow direction, drainage area, reach slope etc. We modified an existing algorithm (Gangodagamage et al., 2007) to provide lateral distance from the centerline of the river to the right and left floodplains for the flows simulated by models. Previous work produced floodplain boundaries for static river stages (i.e. 3D metric: distance along the main stem, flow depth, lateral distance from river center line). Our new approach introduces the floodplain boundary for variable water levels at each reach with the fourth dimension, time. We use modeled flows from WRF-Hydro and demarcate the right and left lateral boundaries of inundation dynamically by appropriately mapping discharges into hydraulically corrected stages. Backwater effects from the mainstem to tributaries are considered and proper corrections are applied for the tributary inundations. We obtained river stages by optimizing reach level channel parameters using newly developed stream flow routing algorithm. Non uniform inundations are mapped at each NHDplus reach (upstream and downstream nodes) and spatial interpolation is carried out on a normalized digital elevation model (always streams are at zero elevations) to obtain the smooth flood boundaries between adjacent reaches. The validation of the dynamic inundation boundaries is performed using multi-temporal satellite datasets as well as HEC-RAS hydrodynamic model results for selected streams for previous flood events.

Building gene co-expression networks using transcriptomics data for systems biology investigations: Comparison of methods using microarray data

PubMed Central

Kadarmideen, Haja N; Watson-haigh, Nathan S

2012-01-01

Gene co-expression networks (GCN), built using high-throughput gene expression data are fundamental aspects of systems biology. The main aims of this study were to compare two popular approaches to building and analysing GCN. We use real ovine microarray transcriptomics datasets representing four different treatments with Metyrapone, an inhibitor of cortisol biosynthesis. We conducted several microarray quality control checks before applying GCN methods to filtered datasets. Then we compared the outputs of two methods using connectivity as a criterion, as it measures how well a node (gene) is connected within a network. The two GCN construction methods used were, Weighted Gene Co-expression Network Analysis (WGCNA) and Partial Correlation and Information Theory (PCIT) methods. Nodes were ranked based on their connectivity measures in each of the four different networks created by WGCNA and PCIT and node ranks in two methods were compared to identify those nodes which are highly differentially ranked (HDR). A total of 1,017 HDR nodes were identified across one or more of four networks. We investigated HDR nodes by gene enrichment analyses in relation to their biological relevance to phenotypes. We observed that, in contrast to WGCNA method, PCIT algorithm removes many of the edges of the most highly interconnected nodes. Removal of edges of most highly connected nodes or hub genes will have consequences for downstream analyses and biological interpretations. In general, for large GCN construction (with > 20000 genes) access to large computer clusters, particularly those with larger amounts of shared memory is recommended. PMID:23144540

Information loss method to measure node similarity in networks

NASA Astrophysics Data System (ADS)

Li, Yongli; Luo, Peng; Wu, Chong

2014-09-01

Similarity measurement for the network node has been paid increasing attention in the field of statistical physics. In this paper, we propose an entropy-based information loss method to measure the node similarity. The whole model is established based on this idea that less information loss is caused by seeing two more similar nodes as the same. The proposed new method has relatively low algorithm complexity, making it less time-consuming and more efficient to deal with the large scale real-world network. In order to clarify its availability and accuracy, this new approach was compared with some other selected approaches on two artificial examples and synthetic networks. Furthermore, the proposed method is also successfully applied to predict the network evolution and predict the unknown nodes' attributions in the two application examples.

Distributed Multihoming Routing Method by Crossing Control MIPv6 with SCTP

NASA Astrophysics Data System (ADS)

Shi, Hongbo; Hamagami, Tomoki

There are various wireless communication technologies, such as 3G, WiFi, used widely in the world. Recently, not only the laptop but also the smart phones can be equipped with multiple wireless devices. The communication terminals which are implemented with multiple interfaces are usually called multi-homed nodes. Meanwhile, a multi-homed node with multiple interfaces can also be regarded as multiple single-homed nodes. For example, when a person who is using smart phone and laptop to connect to the Internet concurrently, we may regard the person as a multi-homed node in the Internet. This paper proposes a new routing method, Multi-homed Mobile Cross-layer Control to handle multi-homed mobile nodes. Our suggestion can provide a distributed end-to-end routing method for handling the communications among multi-homed nodes at the fundamental network layer.

Methods and systems for detecting abnormal digital traffic

DOEpatents

Goranson, Craig A [Kennewick, WA; Burnette, John R [Kennewick, WA

2011-03-22

Aspects of the present invention encompass methods and systems for detecting abnormal digital traffic by assigning characterizations of network behaviors according to knowledge nodes and calculating a confidence value based on the characterizations from at least one knowledge node and on weighting factors associated with the knowledge nodes. The knowledge nodes include a characterization model based on prior network information. At least one of the knowledge nodes should not be based on fixed thresholds or signatures. The confidence value includes a quantification of the degree of confidence that the network behaviors constitute abnormal network traffic.

Identifying influential nodes in complex networks: A node information dimension approach

NASA Astrophysics Data System (ADS)

Bian, Tian; Deng, Yong

2018-04-01

In the field of complex networks, how to identify influential nodes is a significant issue in analyzing the structure of a network. In the existing method proposed to identify influential nodes based on the local dimension, the global structure information in complex networks is not taken into consideration. In this paper, a node information dimension is proposed by synthesizing the local dimensions at different topological distance scales. A case study of the Netscience network is used to illustrate the efficiency and practicability of the proposed method.

Improved 3D live-wire method with application to 3D CT chest image analysis

NASA Astrophysics Data System (ADS)

Lu, Kongkuo; Higgins, William E.

2006-03-01

The definition of regions of interests (ROIs), such as suspect cancer nodules or lymph nodes in 3D CT chest images, is often difficult because of the complexity of the phenomena that give rise to them. Manual slice tracing has been used widely for years for such problems, because it is easy to implement and guaranteed to work. But the manual method is extremely time-consuming, especially for high-solution 3D images which may have hundreds of slices, and it is subject to operator biases. Numerous automated image-segmentation methods have been proposed, but they are generally strongly application dependent, and even the "most robust" methods have difficulty in defining complex anatomical ROIs. To address this problem, the semi-automatic interactive paradigm referred to as "live wire" segmentation has been proposed by researchers. In live-wire segmentation, the human operator interactively defines an ROI's boundary guided by an active automated method which suggests what to define. This process in general is far faster, more reproducible and accurate than manual tracing, while, at the same time, permitting the definition of complex ROIs having ill-defined boundaries. We propose a 2D live-wire method employing an improved cost over previous works. In addition, we define a new 3D live-wire formulation that enables rapid definition of 3D ROIs. The method only requires the human operator to consider a few slices in general. Experimental results indicate that the new 2D and 3D live-wire approaches are efficient, allow for high reproducibility, and are reliable for 2D and 3D object segmentation.

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

PubMed Central

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

2014-01-01

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

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

PubMed

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

2014-01-01

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

Distributed estimation of sensors position in underwater wireless sensor network

NASA Astrophysics Data System (ADS)

Zandi, Rahman; Kamarei, Mahmoud; Amiri, Hadi

2016-05-01

In this paper, a localisation method for determining the position of fixed sensor nodes in an underwater wireless sensor network (UWSN) is introduced. In this simple and range-free scheme, the node localisation is achieved by utilising an autonomous underwater vehicle (AUV) that transverses through the network deployment area, and that periodically emits a message block via four directional acoustic beams. A message block contains the actual known AUV position as well as a directional dependent marker that allows a node to identify the respective transmit beam. The beams form a fixed angle with the AUV body. If a node passively receives message blocks, it could calculate the arithmetic mean of the coordinates existing in each messages sequence, to find coordinates at two different time instants via two different successive beams. The node position can be derived from the two computed positions of the AUV. The major advantage of the proposed localisation algorithm is that it is silent, which leads to energy efficiency for sensor nodes. The proposed method does not require any synchronisation among the nodes owing to being silent. Simulation results, using MATLAB, demonstrated that the proposed method had better performance than other similar AUV-based localisation methods in terms of the rates of well-localised sensor nodes and positional root mean square error.

Load sharing in distributed real-time systems with state-change broadcasts

NASA Technical Reports Server (NTRS)

Shin, Kang G.; Chang, Yi-Chieh

1989-01-01

A decentralized dynamic load-sharing (LS) method based on state-change broadcasts is proposed for a distributed real-time system. Whenever the state of a node changes from underloaded to fully loaded and vice versa, the node broadcasts this change to a set of nodes, called a buddy set, in the system. The performance of the method is evaluated with both analytic modeling and simulation. It is modeled first by an embedded Markov chain for which numerical solutions are derived. The model solutions are then used to calculate the distribution of queue lengths at the nodes and the probability of meeting task deadlines. The analytical results show that buddy sets of 10 nodes outperform those of less than 10 nodes, and the incremental benefit gained from increasing the buddy set size beyond 15 nodes is insignificant. These and other analytical results are verified by simulation. The proposed LS method is shown to meet task deadlines with a very high probability.

Results of using frequency banded SAFT for examining three types of defects

NASA Astrophysics Data System (ADS)

Clayton, Dwight; Barker, Alan; Santos-Villalobos, Hector

2017-02-01

A multitude of concrete-based structures are typically part of a light water reactor (LWR) plant to provide the foundation, support, shielding, and containment functions. Concrete has been used in the construction of nuclear power plants (NPPs) because of three primary properties; its low cost, structural strength, and ability to shield radiation. Examples of concrete structures important to the safety of LWR plants include the containment building, spent fuel pool, and cooling towers. This use has made concrete's long-term performance crucial for the safe operation of commercial NPPs. Extending reactor life to 60 years and beyond will likely increase susceptibility and severity of known forms of degradation. Additionally, new mechanisms of materials degradation are also possible. Specially designed and fabricated test specimens can provide realistic flaws that are similar to actual flaws in terms of how they interact with a particular Nondestructive Evaluation (NDE) technique. Artificial test blocks allow the isolation of certain testing problems as well as the variation of certain parameters. Because conditions in the laboratory are controlled, the number of unknown variables can be decreased, making it possible to focus on specific aspects, investigate them in detail, and gain further information on the capabilities and limitations of each method. To minimize artifacts caused by boundary effects, the dimensions of the specimens should not be too compact. In this paper, we apply the frequency banded Synthetic Aperture Focusing Technique (SAFT) technique to a 2.134 m × 2.134 m × 1.016 m concrete test specimen with twenty deliberately embedded defects. These twenty embedded defects simulate voids (honeycombs), delamination, and embedded organic construction debris. Using the time-frequency technique of wavelet packet decomposition and reconstruction, the spectral content of the signal can be divided into two resulting child nodes. The resulting two nodes can then also be divided into two child nodes with each child node containing half of the bandwidth (spectral content) of its parent node. This process can be repeated until the bandwidth of the child nodes is sufficiently small. Once the desired bandwidth has been obtained, the band limited signal can be analyzed using SAFT, enabling the visualization of reflectivity of a frequency band and that band's interaction with the contents of the concrete structure. This paper examines the benefits of using frequency banded SAFT.

Dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job

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

Budnik, Thomas A; Knudson, Brant L; Megerian, Mark G

Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of computemore » nodes running the re-launched job.« less

AFMPB: An adaptive fast multipole Poisson-Boltzmann solver for calculating electrostatics in biomolecular systems

NASA Astrophysics Data System (ADS)

Lu, Benzhuo; Cheng, Xiaolin; Huang, Jingfang; McCammon, J. Andrew

2010-06-01

A Fortran program package is introduced for rapid evaluation of the electrostatic potentials and forces in biomolecular systems modeled by the linearized Poisson-Boltzmann equation. The numerical solver utilizes a well-conditioned boundary integral equation (BIE) formulation, a node-patch discretization scheme, a Krylov subspace iterative solver package with reverse communication protocols, and an adaptive new version of fast multipole method in which the exponential expansions are used to diagonalize the multipole-to-local translations. The program and its full description, as well as several closely related libraries and utility tools are available at http://lsec.cc.ac.cn/~lubz/afmpb.html and a mirror site at http://mccammon.ucsd.edu/. This paper is a brief summary of the program: the algorithms, the implementation and the usage. Program summaryProgram title: AFMPB: Adaptive fast multipole Poisson-Boltzmann solver Catalogue identifier: AEGB_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEGB_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GPL 2.0 No. of lines in distributed program, including test data, etc.: 453 649 No. of bytes in distributed program, including test data, etc.: 8 764 754 Distribution format: tar.gz Programming language: Fortran Computer: Any Operating system: Any RAM: Depends on the size of the discretized biomolecular system Classification: 3 External routines: Pre- and post-processing tools are required for generating the boundary elements and for visualization. Users can use MSMS ( http://www.scripps.edu/~sanner/html/msms_home.html) for pre-processing, and VMD ( http://www.ks.uiuc.edu/Research/vmd/) for visualization. Sub-programs included: An iterative Krylov subspace solvers package from SPARSKIT by Yousef Saad ( http://www-users.cs.umn.edu/~saad/software/SPARSKIT/sparskit.html), and the fast multipole methods subroutines from FMMSuite ( http://www.fastmultipole.org/). Nature of problem: Numerical solution of the linearized Poisson-Boltzmann equation that describes electrostatic interactions of molecular systems in ionic solutions. Solution method: A novel node-patch scheme is used to discretize the well-conditioned boundary integral equation formulation of the linearized Poisson-Boltzmann equation. Various Krylov subspace solvers can be subsequently applied to solve the resulting linear system, with a bounded number of iterations independent of the number of discretized unknowns. The matrix-vector multiplication at each iteration is accelerated by the adaptive new versions of fast multipole methods. The AFMPB solver requires other stand-alone pre-processing tools for boundary mesh generation, post-processing tools for data analysis and visualization, and can be conveniently coupled with different time stepping methods for dynamics simulation. Restrictions: Only three or six significant digits options are provided in this version. Unusual features: Most of the codes are in Fortran77 style. Memory allocation functions from Fortran90 and above are used in a few subroutines. Additional comments: The current version of the codes is designed and written for single core/processor desktop machines. Check http://lsec.cc.ac.cn/~lubz/afmpb.html and http://mccammon.ucsd.edu/ for updates and changes. Running time: The running time varies with the number of discretized elements ( N) in the system and their distributions. In most cases, it scales linearly as a function of N.

Controlling data transfers from an origin compute node to a target compute node

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN

2011-06-21

Methods, apparatus, and products are disclosed for controlling data transfers from an origin compute node to a target compute node that include: receiving, by an application messaging module on the target compute node, an indication of a data transfer from an origin compute node to the target compute node; and administering, by the application messaging module on the target compute node, the data transfer using one or more messaging primitives of a system messaging module in dependence upon the indication.

Digital system for structural dynamics simulation

NASA Technical Reports Server (NTRS)

Krauter, A. I.; Lagace, L. J.; Wojnar, M. K.; Glor, C.

1982-01-01

State-of-the-art digital hardware and software for the simulation of complex structural dynamic interactions, such as those which occur in rotating structures (engine systems). System were incorporated in a designed to use an array of processors in which the computation for each physical subelement or functional subsystem would be assigned to a single specific processor in the simulator. These node processors are microprogrammed bit-slice microcomputers which function autonomously and can communicate with each other and a central control minicomputer over parallel digital lines. Inter-processor nearest neighbor communications busses pass the constants which represent physical constraints and boundary conditions. The node processors are connected to the six nearest neighbor node processors to simulate the actual physical interface of real substructures. Computer generated finite element mesh and force models can be developed with the aid of the central control minicomputer. The control computer also oversees the animation of a graphics display system, disk-based mass storage along with the individual processing elements.

Technique for Calculating Solution Derivatives With Respect to Geometry Parameters in a CFD Code

NASA Technical Reports Server (NTRS)

Mathur, Sanjay

2011-01-01

A solution has been developed to the challenges of computation of derivatives with respect to geometry, which is not straightforward because these are not typically direct inputs to the computational fluid dynamics (CFD) solver. To overcome these issues, a procedure has been devised that can be used without having access to the mesh generator, while still being applicable to all types of meshes. The basic approach is inspired by the mesh motion algorithms used to deform the interior mesh nodes in a smooth manner when the surface nodes, for example, are in a fluid structure interaction problem. The general idea is to model the mesh edges and nodes as constituting a spring-mass system. Changes to boundary node locations are propagated to interior nodes by allowing them to assume their new equilibrium positions, for instance, one where the forces on each node are in balance. The main advantage of the technique is that it is independent of the volumetric mesh generator, and can be applied to structured, unstructured, single- and multi-block meshes. It essentially reduces the problem down to defining the surface mesh node derivatives with respect to the geometry parameters of interest. For analytical geometries, this is quite straightforward. In the more general case, one would need to be able to interrogate the underlying parametric CAD (computer aided design) model and to evaluate the derivatives either analytically, or by a finite difference technique. Because the technique is based on a partial differential equation (PDE), it is applicable not only to forward mode problems (where derivatives of all the output quantities are computed with respect to a single input), but it could also be extended to the adjoint problem, either by using an analytical adjoint of the PDE or a discrete analog.

Supine MRI for regional breast radiotherapy: imaging axillary lymph nodes before and after sentinel-node biopsy

NASA Astrophysics Data System (ADS)

van Heijst, Tristan C. F.; Eschbach-Zandbergen, Debora; Hoekstra, Nienke; van Asselen, Bram; Lagendijk, Jan J. W.; Verkooijen, Helena M.; Pijnappel, Ruud M.; de Waard, Stephanie N.; Witkamp, Arjen J.; van Dalen, Thijs; Desirée van den Bongard, H. J. G.; Philippens, Marielle E. P.

2017-08-01

Regional radiotherapy (RT) is increasingly used in breast cancer treatment. Conventionally, computed tomography (CT) is performed for RT planning. Lymph node (LN) target levels are delineated according to anatomical boundaries. Magnetic resonance imaging (MRI) could enable individual LN delineation. The purpose was to evaluate the applicability of MRI for LN detection in supine treatment position, before and after sentinel-node biopsy (SNB). Twenty-three female breast cancer patients (cTis-3N0M0) underwent 1.5 T MRI, before and after SNB, in addition to CT. Endurance for MRI was monitored. Axillary levels were delineated. LNs were identified and delineated on MRI from before and after SNB, and on CT, and compared by Wilcoxon signed-rank tests. LN locations and LN-based volumes were related to axillary delineations and associated volumes. Although postoperative effects were visible, LN numbers on postoperative MRI (median 26 LNs) were highly reproducible compared to preoperative MRI when adding excised sentinel nodes, and higher than on CT (median 11, p  <  0.001). LN-based volumes were considerably smaller than respective axillary levels. Supine MRI of LNs is feasible and reproducible before and after SNB. This may lead to more accurate RT target definition compared to CT, with potentially lower toxicity. With the MRI techniques described here, initiation of novel MRI-guided RT strategies aiming at individual LNs could be possible.

Systems and methods for optimal power flow on a radial network

DOEpatents

Low, Steven H.; Peng, Qiuyu

2018-04-24

Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control. One embodiment includes a node controller including a distributed power control application; a plurality of node operating parameters describing the operating parameter of a node and a set of at least one node selected from the group consisting of an ancestor node and at least one child node; wherein send node operating parameters to nodes in the set of at least one node; receive operating parameters from the nodes in the set of at least one node; calculate a plurality of updated node operating parameters using an iterative process to determine the updated node operating parameters using the node operating parameters that describe the operating parameters of the node and the set of at least one node, where the iterative process involves evaluation of a closed form solution; and adjust node operating parameters.

Effect Of Impurity On Cu Electromigration

NASA Astrophysics Data System (ADS)

Hu, C.-K.; Angyal, M.; Baker, B. C.; Bonilla, G.; Cabral, C.; Canaperi, D. F.; Choi, S.; Clevenger, L.; Edelstein, D.; Gignac, L.; Huang, E.; Kelly, J.; Kim, B. Y.; Kyei-Fordjour, V.; Manikonda, S. L.; Maniscalco, J.; Mittal, S.; Nogami, T.; Parks, C.; Rosenberg, R.; Simon, A.; Xu, Y.; Vo, T. A.; Witt, C.

2010-11-01

The impact of the existence of Cu grain boundaries on the degradation of Cu interconnect lifetime at the 45 nm technology node and beyond has suggested that improved electromigra-tion in Cu grain boundaries has become increasingly important. In this paper, solute effects of non-metallic (C, Cl, O and S) and metallic (Al, Co, In, Mg, Sn, and Ti) impurities on Cu elec-tromigration were investigated. The Cu alloy interconnects were fabricated by adjusting Cu electroplating solutions or by depositing a Cu alloy seed, a thin film layer of impurity, an alloy liner, or a metal cap. A large variation of Cu grain structure in the samples was achieved by adjusting the wafer fabrication process steps. The non-metallic impurities were found to be less than 0.1% in the electroplated Cu with no effect on Cu electromigration lifetimes. Most of the metallic impurities reduced Cu interface and grain boundary mass flows and enhanced Cu lifetime, but Al, Co, and Mg impurities did not mitigate Cu grain boundary diffusion.

Network geometry inference using common neighbors

NASA Astrophysics Data System (ADS)

Papadopoulos, Fragkiskos; Aldecoa, Rodrigo; Krioukov, Dmitri

2015-08-01

We introduce and explore a method for inferring hidden geometric coordinates of nodes in complex networks based on the number of common neighbors between the nodes. We compare this approach to the HyperMap method, which is based only on the connections (and disconnections) between the nodes, i.e., on the links that the nodes have (or do not have). We find that for high degree nodes, the common-neighbors approach yields a more accurate inference than the link-based method, unless heuristic periodic adjustments (or "correction steps") are used in the latter. The common-neighbors approach is computationally intensive, requiring O (t4) running time to map a network of t nodes, versus O (t3) in the link-based method. But we also develop a hybrid method with O (t3) running time, which combines the common-neighbors and link-based approaches, and we explore a heuristic that reduces its running time further to O (t2) , without significant reduction in the mapping accuracy. We apply this method to the autonomous systems (ASs) Internet, and we reveal how soft communities of ASs evolve over time in the similarity space. We further demonstrate the method's predictive power by forecasting future links between ASs. Taken altogether, our results advance our understanding of how to efficiently and accurately map real networks to their latent geometric spaces, which is an important necessary step toward understanding the laws that govern the dynamics of nodes in these spaces, and the fine-grained dynamics of network connections.

Multi-attribute integrated measurement of node importance in complex networks.

PubMed

Wang, Shibo; Zhao, Jinlou

2015-11-01

The measure of node importance in complex networks is very important to the research of networks stability and robustness; it also can ensure the security of the whole network. Most researchers have used a single indicator to measure the networks node importance, so that the obtained measurement results only reflect certain aspects of the networks with a loss of information. Meanwhile, because of the difference of networks topology, the nodes' importance should be described by combining the character of the networks topology. Most of the existing evaluation algorithms cannot completely reflect the circumstances of complex networks, so this paper takes into account the degree of centrality, the relative closeness centrality, clustering coefficient, and topology potential and raises an integrated measuring method to measure the nodes' importance. This method can reflect nodes' internal and outside attributes and eliminate the influence of network structure on the node importance. The experiments of karate network and dolphin network show that networks topology structure integrated measure has smaller range of metrical result than a single indicator and more universal. Experiments show that attacking the North American power grid and the Internet network with the method has a faster convergence speed than other methods.

Scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the nodes during execution

DOEpatents

Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

2012-10-16

Methods, apparatus, and products are disclosed for scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the plurality of compute nodes during execution that include: identifying one or more applications for execution on the plurality of compute nodes; creating a plurality of physically discontiguous node partitions in dependence upon temperature characteristics for the compute nodes and a physical topology for the compute nodes, each discontiguous node partition specifying a collection of physically adjacent compute nodes; and assigning, for each application, that application to one or more of the discontiguous node partitions for execution on the compute nodes specified by the assigned discontiguous node partitions.

Method for designing gas tag compositions

DOEpatents

Gross, K.C.

1995-04-11

For use in the manufacture of gas tags such as employed in a nuclear reactor gas tagging failure detection system, a method for designing gas tagging compositions utilizes an analytical approach wherein the final composition of a first canister of tag gas as measured by a mass spectrometer is designated as node No. 1. Lattice locations of tag nodes in multi-dimensional space are then used in calculating the compositions of a node No. 2 and each subsequent node so as to maximize the distance of each node from any combination of tag components which might be indistinguishable from another tag composition in a reactor fuel assembly. Alternatively, the measured compositions of tag gas numbers 1 and 2 may be used to fix the locations of nodes 1 and 2, with the locations of nodes 3-N then calculated for optimum tag gas composition. A single sphere defining the lattice locations of the tag nodes may be used to define approximately 20 tag nodes, while concentric spheres can extend the number of tag nodes to several hundred. 5 figures.

Lambda network having 2.sup.m-1 nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, Jr., Leonard M.

1995-01-01

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance.

Method of Error Floor Mitigation in Low-Density Parity-Check Codes

NASA Technical Reports Server (NTRS)

Hamkins, Jon (Inventor)

2014-01-01

A digital communication decoding method for low-density parity-check coded messages. The decoding method decodes the low-density parity-check coded messages within a bipartite graph having check nodes and variable nodes. Messages from check nodes are partially hard limited, so that every message which would otherwise have a magnitude at or above a certain level is re-assigned to a maximum magnitude.

CAVE3: A general transient heat transfer computer code utilizing eigenvectors and eigenvalues

NASA Technical Reports Server (NTRS)

Palmieri, J. V.; Rathjen, K. A.

1978-01-01

The method of solution is a hybrid analytical numerical technique which utilizes eigenvalues and eigenvectors. The method is inherently stable, permitting large time steps even with the best of conductors with the finest of mesh sizes which can provide a factor of five reduction in machine time compared to conventional explicit finite difference methods when structures with small time constants are analyzed over long time periods. This code will find utility in analyzing hypersonic missile and aircraft structures which fall naturally into this class. The code is a completely general one in that problems involving any geometry, boundary conditions and materials can be analyzed. This is made possible by requiring the user to establish the thermal network conductances between nodes. Dynamic storage allocation is used to minimize core storage requirements. This report is primarily a user's manual for CAVE3 code. Input and output formats are presented and explained. Sample problems are included which illustrate the usage of the code as well as establish the validity and accuracy of the method.

Scalability of Parallel Spatial Direct Numerical Simulations on Intel Hypercube and IBM SP1 and SP2

NASA Technical Reports Server (NTRS)

Joslin, Ronald D.; Hanebutte, Ulf R.; Zubair, Mohammad

1995-01-01

The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube and IBM SP1 and SP2 parallel computers is documented. Spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows are computed with the PSDNS code. The feasibility of using the PSDNS to perform transition studies on these computers is examined. The results indicate that PSDNS approach can effectively be parallelized on a distributed-memory parallel machine by remapping the distributed data structure during the course of the calculation. Scalability information is provided to estimate computational costs to match the actual costs relative to changes in the number of grid points. By increasing the number of processors, slower than linear speedups are achieved with optimized (machine-dependent library) routines. This slower than linear speedup results because the computational cost is dominated by FFT routine, which yields less than ideal speedups. By using appropriate compile options and optimized library routines on the SP1, the serial code achieves 52-56 M ops on a single node of the SP1 (45 percent of theoretical peak performance). The actual performance of the PSDNS code on the SP1 is evaluated with a "real world" simulation that consists of 1.7 million grid points. One time step of this simulation is calculated on eight nodes of the SP1 in the same time as required by a Cray Y/MP supercomputer. For the same simulation, 32-nodes of the SP1 and SP2 are required to reach the performance of a Cray C-90. A 32 node SP1 (SP2) configuration is 2.9 (4.6) times faster than a Cray Y/MP for this simulation, while the hypercube is roughly 2 times slower than the Y/MP for this application. KEY WORDS: Spatial direct numerical simulations; incompressible viscous flows; spectral methods; finite differences; parallel computing.

Uncertainty quantification in hydrodynamics bidimensional models : the case of Gironde estuary forecast model

NASA Astrophysics Data System (ADS)

Laborie, Vanessya; Goutal, Nicole; Ricci, Sophie; Sergent, Philippe

2017-04-01

In the context of the development and the implementation of data assimilation techniques in Gironde estuary for flood forecasting, a Telemac 2D model is used to calculate water depths and velocity fields at each node of an unstructured mesh. Upstream, the model boundaries are respectively La Réole and Pessac on the Garonne and Dordogne river. The maritime boundary is 32 km off the mouth of Gironde estuary, located in Verdon. This model, which contains 7351 nodes and 12838 finite elements, does not take into account overflows. It has been calibrated on 4 non-overflowing events and then validated on 6 overflowing events. In a first step, a mesh convergence study was carried out in order to evaluate the error related to the spatial discretization and to determine the mesh allowing to obtain results "independent" of it. Three additional meshes obtained by dividing the number of finite elements at each refinement by 4 were realized and used to simulate the event of 2003. It appears that a mesh of intermediate size (approximately 27000 nodes) seems required. In a second step, propagation and quantification of uncertainties by an unidirectional analysis method (creation of a set of 2000 members perturbed for each parameter and input forcings and analysis of output water depths) was carried out on the numerical parameters (wind influence coefficient, Strickler friction coefficients for 4 zones) and forcings of the model (rivers discharges and maritime boundary conditions, meteorological forcings). The objective is to determine the variation coefficient (if possible standardized by the input variation coefficient) of water depths for 13 major events between 1981 and 2016. The exploitation of 1981 event results shows a predominance of the influence of the maritime boundary conditions and the Strickler coefficient corresponding to the zone studied for the estuarine part and the confluence, to which must be added the Garonne discharge as a predominant parameter for the latter. Unsurprisingly, river zones are influenced primarily by the coefficient of friction and the respective river flows of Garonne and Dordogne rivers. The non-normalized variation coefficients were also calculated by taking into account the time shift of the maritime input signal and, independently, the Arpege Ensemble Predictions provided by METEO-FRANCE. The relative influence of the phase shift and the PEARP has also been determined. On the second hand, a variance sensitivity study (ANOVA) was carried out, by calculating the total and partial Sobol indices, integrating the forcing variables time- and/or space dependent. It has led to the identification of parameters and forcings to which the model is most sensitive, as well as their inter-dependencies, in order to choose the variables to assimilate. Finally, it should be noted that this work has already made it possible to create a database of multi-temporal simulations (over 13 time periods) on Gironde estuary that can, after formatting, feed the SWOT simulator for Gironde Estuary, which is used to prepare the Franco-American mission for the study of ocean and continental water depths .

Method and system for monitoring environmental conditions

DOEpatents

Kulesz, James J [Oak Ridge, TN; Lee, Ronald W [Oak Ridge, TN

2010-11-16

A system for detecting the occurrence of anomalies includes a plurality of spaced apart nodes, with each node having adjacent nodes, each of the nodes having one or more sensors associated with the node and capable of detecting anomalies, and each of the nodes having a controller connected to the sensors associated with the node. The system also includes communication links between adjacent nodes, whereby the nodes form a network. At least one software agent is capable of changing the operation of at least one of the controllers in response to the detection of an anomaly by a sensor.

Theory and computation of optimal low- and medium-thrust transfers

NASA Technical Reports Server (NTRS)

Chuang, C.-H.

1993-01-01

This report presents the formulation of the optimal low- and medium-thrust orbit transfer control problem and methods for numerical solution of the problem. The problem formulation is for final mass maximization and allows for second-harmonic oblateness, atmospheric drag, and three-dimensional, non-coplanar, non-aligned elliptic terminal orbits. We setup some examples to demonstrate the ability of two indirect methods to solve the resulting TPBVP's. The methods demonstrated are the multiple-point shooting method as formulated in H. J. Oberle's subroutine BOUNDSCO, and the minimizing boundary-condition method (MBCM). We find that although both methods can converge solutions, there are trade-offs to using either method. BOUNDSCO has very poor convergence for guesses that do not exhibit the correct switching structure. MBCM, however, converges for a wider range of guesses. However, BOUNDSCO's multi-point structure allows more freedom in quesses by increasing the node points as opposed to only quessing the initial state in MBCM. Finally, we note an additional drawback for BOUNDSCO: the routine does not supply information to the users routines for switching function polarity but only the location of a preset number of switching points.

Method and systems for a radiation tolerant bus interface circuit

NASA Technical Reports Server (NTRS)

Kinstler, Gary A. (Inventor)

2007-01-01

A bus management tool that allows communication to be maintained between a group of nodes operatively connected on two busses in the presence of radiation by transmitting periodically a first message from one to another of the nodes on one of the busses, determining whether the first message was received by the other of the nodes on the first bus, and when it is determined that the first message was not received by the other of the nodes, transmitting a recovery command to the other of the nodes on a second of the of busses. Methods, systems, and articles of manufacture consistent with the present invention also provide for a bus recovery tool on the other node that re-initializes a bus interface circuit operatively connecting the other node to the first bus in response to the recovery command.

An adjoint view on flux consistency and strong wall boundary conditions to the Navier–Stokes equations

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

Stück, Arthur, E-mail: arthur.stueck@dlr.de

2015-11-15

Inconsistent discrete expressions in the boundary treatment of Navier–Stokes solvers and in the definition of force objective functionals can lead to discrete-adjoint boundary treatments that are not a valid representation of the boundary conditions to the corresponding adjoint partial differential equations. The underlying problem is studied for an elementary 1D advection–diffusion problem first using a node-centred finite-volume discretisation. The defect of the boundary operators in the inconsistently defined discrete-adjoint problem leads to oscillations and becomes evident with the additional insight of the continuous-adjoint approach. A homogenisation of the discretisations for the primal boundary treatment and the force objective functional yieldsmore » second-order functional accuracy and eliminates the defect in the discrete-adjoint boundary treatment. Subsequently, the issue is studied for aerodynamic Reynolds-averaged Navier–Stokes problems in conjunction with a standard finite-volume discretisation on median-dual grids and a strong implementation of noslip walls, found in many unstructured general-purpose flow solvers. Going out from a base-line discretisation of force objective functionals which is independent of the boundary treatment in the flow solver, two improved flux-consistent schemes are presented; based on either body wall-defined or farfield-defined control-volumes they resolve the dual inconsistency. The behaviour of the schemes is investigated on a sequence of grids in 2D and 3D.« less

A Stirling engine analysis method based upon moving gas nodes

NASA Technical Reports Server (NTRS)

Martini, W. R.

1986-01-01

A Lagrangian nodal analysis method for Stirling engines (SEs) is described, validated, and applied to a conventional SE and an isothermalized SE (with fins in the hot and cold spaces). The analysis employs a constant-mass gas node (which moves with respect to the solid nodes during each time step) instead of the fixed gas nodes of Eulerian analysis. The isothermalized SE is found to have efficiency only slightly greater than that of a conventional SE.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-11-16

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

Clinical and anatomical guidelines in pelvic cancer contouring for radiotherapy treatment planning.

PubMed

Portaluri, Maurizio; Bambace, Santa; Perez, Celeste; Giuliano, Giuseppe; Angone, Grazia; Scialpi, Michele; Pili, Giorgio; Didonna, Vittorio; Alloro, Emira

2004-08-01

Many observations on potential inadequate coverage of tumour volume at risk in advanced cervical cancer (CC) when conventional radiation fields are used, have further substantiated by investigators using MRI, CT or lymphangiographic imaging. This work tries to obtain three dimensional margins by observing enlarged nodes in CT scans in order to improve pelvic nodal chains clinical target volumes (CTVs) drawing, and by looking for corroborative evidence in the literature for a better delineation of tumour CTV. Eleven consecutive patients (seven males, four females, mean age 62 years, range 43-78) with CT diagnosis of nodal involvement caused by pathologically proved carcinoma of the cervix (n = 2), carcinoma of the rectum (n = 2), carcinoma of the prostate (n = 2), non-Hodgkin lymphoma (n = 2), Hodgkin lymphoma (n = 1), carcinoma of the penis (n = 1) and carcinoma of the corpus uteri (n = 1) were retrospectively reviewed. Sixty CT scans with 67 enlarged pelvic nodes were reviewed in order to record the more proximal structures (muscle, bone, vessels, cutis or subcutis and other organs) to each enlarged node or group of nodes according to the four surfaces (anterior, lateral, posterior and medial) in a clockwise direction. A summary of the observations of each nodal chain and the number of occurrences of every marginal structure on axial CT slices is presented. Finally, simple guidelines are proposed. Tumour CTV should be based on individual tumour anatomy-mainly for lateral beams as it results from sagittal T2 weighted MRI images. Boundaries of pelvic nodes CTVs can be derived from observations of enlarged lymph nodes in CT scans.

A numerical solution for the diffusion equation in hydrogeologic systems

USGS Publications Warehouse

Ishii, A.L.; Healy, R.W.; Striegl, Robert G.

1989-01-01

The documentation of a computer code for the numerical solution of the linear diffusion equation in one or two dimensions in Cartesian or cylindrical coordinates is presented. Applications of the program include molecular diffusion, heat conduction, and fluid flow in confined systems. The flow media may be anisotropic and heterogeneous. The model is formulated by replacing the continuous linear diffusion equation by discrete finite-difference approximations at each node in a block-centered grid. The resulting matrix equation is solved by the method of preconditioned conjugate gradients. The conjugate gradient method does not require the estimation of iteration parameters and is guaranteed convergent in the absence of rounding error. The matrixes are preconditioned to decrease the steps to convergence. The model allows the specification of any number of boundary conditions for any number of stress periods, and the output of a summary table for selected nodes showing flux and the concentration of the flux quantity for each time step. The model is written in a modular format for ease of modification. The model was verified by comparison of numerical and analytical solutions for cases of molecular diffusion, two-dimensional heat transfer, and axisymmetric radial saturated fluid flow. Application of the model to a hypothetical two-dimensional field situation of gas diffusion in the unsaturated zone is demonstrated. The input and output files are included as a check on program installation. The definition of variables, input requirements, flow chart, and program listing are included in the attachments. (USGS)

Broadcasting a message in a parallel computer

DOEpatents

Archer, Charles J; Faraj, Ahmad A

2013-04-16

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

Broadcasting a message in a parallel computer

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

None

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the childmore » nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.« less

An efficient 3D R-tree spatial index method for virtual geographic environments

NASA Astrophysics Data System (ADS)

Zhu, Qing; Gong, Jun; Zhang, Yeting

A three-dimensional (3D) spatial index is required for real time applications of integrated organization and management in virtual geographic environments of above ground, underground, indoor and outdoor objects. Being one of the most promising methods, the R-tree spatial index has been paid increasing attention in 3D geospatial database management. Since the existing R-tree methods are usually limited by their weakness of low efficiency, due to the critical overlap of sibling nodes and the uneven size of nodes, this paper introduces the k-means clustering method and employs the 3D overlap volume, 3D coverage volume and the minimum bounding box shape value of nodes as the integrative grouping criteria. A new spatial cluster grouping algorithm and R-tree insertion algorithm is then proposed. Experimental analysis on comparative performance of spatial indexing shows that by the new method the overlap of R-tree sibling nodes is minimized drastically and a balance in the volumes of the nodes is maintained.

Compressive sensing of high betweenness centrality nodes in networks

NASA Astrophysics Data System (ADS)

Mahyar, Hamidreza; Hasheminezhad, Rouzbeh; Ghalebi K., Elahe; Nazemian, Ali; Grosu, Radu; Movaghar, Ali; Rabiee, Hamid R.

2018-05-01

Betweenness centrality is a prominent centrality measure expressing importance of a node within a network, in terms of the fraction of shortest paths passing through that node. Nodes with high betweenness centrality have significant impacts on the spread of influence and idea in social networks, the user activity in mobile phone networks, the contagion process in biological networks, and the bottlenecks in communication networks. Thus, identifying k-highest betweenness centrality nodes in networks will be of great interest in many applications. In this paper, we introduce CS-HiBet, a new method to efficiently detect top- k betweenness centrality nodes in networks, using compressive sensing. CS-HiBet can perform as a distributed algorithm by using only the local information at each node. Hence, it is applicable to large real-world and unknown networks in which the global approaches are usually unrealizable. The performance of the proposed method is evaluated by extensive simulations on several synthetic and real-world networks. The experimental results demonstrate that CS-HiBet outperforms the best existing methods with notable improvements.

[Assessment of lymph node metastasis in gastric cancer: status quo, recent advances and new perspectives].

PubMed

Tu, Min; Zhu, Zhen-shu; Shi, Lin-sen; Jiang, Xi-qun; Wang, Hao; Guan, Wen-xian

2012-02-01

The precondition of accurate gastric cancer surgery is precise assessment of lymph node metastasis. To date, no imaging modality achieves both high sensitivity and high specificity in detecting lymph node metastasis in gastric cancer. Intraoperative sentinel node tracing and biopsy are the most popular method to identify the localization of tumor cell, but is limited to early gastric cancer. Nano-composite materials, designed for tumor imaging and tracing, show us a newly emerging domain for tumor detection in gastric cancer. The function of these nano-composite materials to detect lymph node metastasis in gastric cancer relies on the effective backflow of lymph system. However, the lymph vessels can be obstructed by tumor cells in advanced gastric cancer, which may restrain the application of these nanoparticles. Therefore, more methods to detect lymph node metastasis in gastric cancer should be explored. This review summarizes the characteristic of the targeted nanosphere. Based on the reported studies, a novel idea is conceived that targeted multifunctional nanosphere may be a potential method to achieve precise assessment of lymph node metastasis in gastric cancer.

Domain Immersion Technique And Free Surface Computations Applied To Extrusion And Mixing Processes

NASA Astrophysics Data System (ADS)

Valette, Rudy; Vergnes, Bruno; Basset, Olivier; Coupez, Thierry

2007-04-01

This work focuses on the development of numerical techniques devoted to the simulation of mixing processes of complex fluids such as twin-screw extrusion or batch mixing. In mixing process simulation, the absence of symmetry of the moving boundaries (the screws or the rotors) implies that their rigid body motion has to be taken into account by using a special treatment. We therefore use a mesh immersion technique (MIT), which consists in using a P1+/P1-based (MINI-element) mixed finite element method for solving the velocity-pressure problem and then solving the problem in the whole barrel cavity by imposing a rigid motion (rotation) to nodes found located inside the so called immersed domain, each subdomain (screw, rotor) being represented by a surface CAD mesh (or its mathematical equation in simple cases). The independent meshes are immersed into a unique backgound computational mesh by computing the distance function to their boundaries. Intersections of meshes are accounted for, allowing to compute a fill factor usable as for the VOF methodology. This technique, combined with the use of parallel computing, allows to compute the time-dependent flow of generalized Newtonian fluids including yield stress fluids in a complex system such as a twin screw extruder, including moving free surfaces, which are treated by a "level set" and Hamilton-Jacobi method.

Row fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2008-10-14

An apparatus, program product and method checks for nodal faults in a row of nodes by causing each node in the row to concurrently communicate with its adjacent neighbor nodes in the row. The communications are analyzed to determine a presence of a faulty node or connection.

Row fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2012-02-07

An apparatus, program product and method check for nodal faults in a row of nodes by causing each node in the row to concurrently communicate with its adjacent neighbor nodes in the row. The communications are analyzed to determine a presence of a faulty node or connection.

[The clinical value of sentinel lymph node detection in laryngeal and hypopharyngeal carcinoma patients with clinically negative neck by methylene blue method and radiolabeled tracer method].

PubMed

Zhao, Xin; Xiao, Dajiang; Ni, Jianming; Zhu, Guochen; Yuan, Yuan; Xu, Ting; Zhang, Yongsheng

2014-11-01

To investigate the clinical value of sentinel lymph node (SLN) detection in laryngeal and hypopharyngeal carcinoma patients with clinically negative neck (cN0) by methylene blue method, radiolabeled tracer method and combination of these two methods. Thirty-three patients with cN0 laryngeal carcinoma and six patients with cN0 hypopharyngeal carcinoma underwent SLN detection using both of methylene blue and radiolabeled tracer method. All these patients were accepted received the injection of radioactive isotope 99 Tc(m)-sulfur colloid (SC) and methylene blue into the carcinoma before surgery, then all these patients underwent intraopertive lymphatic mapping with a handheld gamma-detecting probe and blue-dyed SLN. After the mapping of SLN, selected neck dissections and tumor resections were peformed. The results of SLN detection by radiolabeled tracer, dye and combination of both methods were compared. The detection rate of SLN by radiolabeled tracer, methylene blue and combined method were 89.7%, 79.5%, 92.3% respectively. The number of detected SLN was significantly different between radiolabeled tracer method and combined method, and also between methylene blue method and combined method. The detection rate of methylene blue and radiolabeled tracer method were significantly different from combined method (P < 0.05). Nine patients were found to have lymph node metastasis by final pathological examination. The accuracy and negative rate of SLN detection of the combined method were 97.2% and 11.1%. The combined method using radiolabeled tracer and methylene blue can improve the detection rate and accuracy of sentinel lymph node detection. Furthermore, sentinel lymph node detection can accurately represent the cervical lymph node status in cN0 laryngeal and hypopharyngeal carcinoma.

Transient response of an active nonlinear sandwich piezolaminated plate

NASA Astrophysics Data System (ADS)

Oveisi, Atta; Nestorović, Tamara

2017-04-01

In this paper, the dynamic modelling and active vibration control of a piezolaminated plate with geometrical nonlinearities are investigated using a semi-analytical approach. For active vibration control purposes, the core orthotropic elastic layer is assumed to be perfectly bonded with two piezo-layers on its top and bottom surfaces which act as sensor and actuator, respectively. In the modelling procedure, the piezo-layers are assumed to be connected via a proportional derivative (PD) feedback control law. Hamilton's principle is employed to acquire the strong form of the dynamic equation in terms of additional higher order strain expressions by means of von Karman strain-displacement correlation. The obtained nonlinear partial differential equation (NPDE) is converted to a system of nonlinear ordinary differential equations (NODEs) by engaging Galerkin method and using the orthogonality of shape functions for the simply supported boundary conditions. Then, the resulting system of NODEs is solved numerically by employing the built-in Mathematica function, "NDSolve". Next, the vibration attenuation performance is evaluated and sensitivity of the closed-loop system is investigated for several control parameters and the external disturbance parameters. The proposed solution in open loop configuration is validated by finite element (FE) package ABAQUS both in the spatial domain and for the time-/frequency-dependent response.

Visualization of Morse connection graphs for topologically rich 2D vector fields.

PubMed

Szymczak, Andrzej; Sipeki, Levente

2013-12-01

Recent advances in vector field topologymake it possible to compute its multi-scale graph representations for autonomous 2D vector fields in a robust and efficient manner. One of these representations is a Morse Connection Graph (MCG), a directed graph whose nodes correspond to Morse sets, generalizing stationary points and periodic trajectories, and arcs - to trajectories connecting them. While being useful for simple vector fields, the MCG can be hard to comprehend for topologically rich vector fields, containing a large number of features. This paper describes a visual representation of the MCG, inspired by previous work on graph visualization. Our approach aims to preserve the spatial relationships between the MCG arcs and nodes and highlight the coherent behavior of connecting trajectories. Using simulations of ocean flow, we show that it can provide useful information on the flow structure. This paper focuses specifically on MCGs computed for piecewise constant (PC) vector fields. In particular, we describe extensions of the PC framework that make it more flexible and better suited for analysis of data on complex shaped domains with a boundary. We also describe a topology simplification scheme that makes our MCG visualizations less ambiguous. Despite the focus on the PC framework, our approach could also be applied to graph representations or topological skeletons computed using different methods.

Method and apparatus for obtaining stack traceback data for multiple computing nodes of a massively parallel computer system

DOEpatents

Gooding, Thomas Michael; McCarthy, Patrick Joseph

2010-03-02

A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within the chosen node.

I/O routing in a multidimensional torus network

DOEpatents

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

2017-02-07

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

Dynamic node immunization for restraint of harmful information diffusion in social networks

NASA Astrophysics Data System (ADS)

Yang, Dingda; Liao, Xiangwen; Shen, Huawei; Cheng, Xueqi; Chen, Guolong

2018-08-01

To restrain the spread of harmful information is crucial for the healthy and sustainable development of social networks. We address the problem of restraining the spread of harmful information by immunizing nodes in the networks. Previous works have developed methods based on the network topology or studied how to immunize nodes in the presence of initial infected nodes. These static methods, in which nodes are immunized at once, may have poor performance in the certain situation due to the dynamics of diffusion. To tackle this problem, we introduce a new dynamic immunization problem of immunizing nodes during the process of the diffusion in this paper. We formulate the problem and propose a novel heuristic algorithm by dealing with two sub-problems: (1) how to select a node to achieve the best immunization effect at the present time? (2) whether the selected node should be immunized right now? Finally, we demonstrate the effectiveness of our algorithm through extensive experiments on various real datasets.

I/O routing in a multidimensional torus network

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

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destinationmore » address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.« less

Lambda network having 2{sup m{minus}1} nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, L.M. Jr.

1995-11-28

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance. 14 figs.

A combined dislocation fan-finite element (DF-FE) method for stress field simulation of dislocations emerging at the free surfaces of 3D elastically anisotropic crystals

NASA Astrophysics Data System (ADS)

Balusu, K.; Huang, H.

2017-04-01

A combined dislocation fan-finite element (DF-FE) method is presented for efficient and accurate simulation of dislocation nodal forces in 3D elastically anisotropic crystals with dislocations intersecting the free surfaces. The finite domain problem is decomposed into half-spaces with singular traction stresses, an infinite domain, and a finite domain with non-singular traction stresses. As such, the singular and non-singular parts of the traction stresses are addressed separately; the dislocation fan (DF) method is introduced to balance the singular traction stresses in the half-spaces while the finite element method (FEM) is employed to enforce the non-singular boundary conditions. The accuracy and efficiency of the DF method is demonstrated using a simple isotropic test case, by comparing it with the analytical solution as well as the FEM solution. The DF-FE method is subsequently used for calculating the dislocation nodal forces in a finite elastically anisotropic crystal, which produces dislocation nodal forces that converge rapidly with increasing mesh resolutions. In comparison, the FEM solution fails to converge, especially for nodes closer to the surfaces.

A finite elements method to solve the Bloch-Torrey equation applied to diffusion magnetic resonance imaging

NASA Astrophysics Data System (ADS)

Nguyen, Dang Van; Li, Jing-Rebecca; Grebenkov, Denis; Le Bihan, Denis

2014-04-01

The complex transverse water proton magnetization subject to diffusion-encoding magnetic field gradient pulses in a heterogeneous medium can be modeled by the multiple compartment Bloch-Torrey partial differential equation (PDE). In addition, steady-state Laplace PDEs can be formulated to produce the homogenized diffusion tensor that describes the diffusion characteristics of the medium in the long time limit. In spatial domains that model biological tissues at the cellular level, these two types of PDEs have to be completed with permeability conditions on the cellular interfaces. To solve these PDEs, we implemented a finite elements method that allows jumps in the solution at the cell interfaces by using double nodes. Using a transformation of the Bloch-Torrey PDE we reduced oscillations in the searched-for solution and simplified the implementation of the boundary conditions. The spatial discretization was then coupled to the adaptive explicit Runge-Kutta-Chebyshev time-stepping method. Our proposed method is second order accurate in space and second order accurate in time. We implemented this method on the FEniCS C++ platform and show time and spatial convergence results. Finally, this method is applied to study some relevant questions in diffusion MRI.

Predicting missing links via correlation between nodes

NASA Astrophysics Data System (ADS)

Liao, Hao; Zeng, An; Zhang, Yi-Cheng

2015-10-01

As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has been intensively investigated recently and many methods have been proposed so far. The essential challenge of link prediction is to estimate the similarity between nodes. Most of the existing methods are based on the common neighbor index and its variants. In this paper, we propose to calculate the similarity between nodes by the Pearson correlation coefficient. This method is found to be very effective when applied to calculate similarity based on high order paths. We finally fuse the correlation-based method with the resource allocation method, and find that the combined method can substantially outperform the existing methods, especially in sparse networks.

EXTENSIBLE DATABASE FRAMEWORK FOR MANAGEMENT OF UNSTRUCTURED AND SEMI-STRUCTURED DOCUMENTS

NASA Technical Reports Server (NTRS)

Gawdiak, Yuri O. (Inventor); La, Tracy T. (Inventor); Lin, Shu-Chun Y. (Inventor); Malof, David A. (Inventor); Tran, Khai Peter B. (Inventor)

2005-01-01

Method and system for querying a collection of Unstructured or semi-structured documents to identify presence of, and provide context and/or content for, keywords and/or keyphrases. The documents are analyzed and assigned a node structure, including an ordered sequence of mutually exclusive node segments or strings. Each node has an associated set of at least four, five or six attributes with node information and can represent a format marker or text, with the last node in any node segment usually being a text node. A keyword (or keyphrase) is specified. and the last node in each node segment is searched for a match with the keyword. When a match is found at a query node, or at a node determined with reference to a query node, the system displays the context andor the content of the query node.

Partially entangled states bridge in quantum teleportation

NASA Astrophysics Data System (ADS)

Cai, Xiao-Fei; Yu, Xu-Tao; Shi, Li-Hui; Zhang, Zai-Chen

2014-10-01

The traditional method for information transfer in a quantum communication system using partially entangled state resource is quantum distillation or direct teleportation. In order to reduce the waiting time cost in hop-by-hop transmission and execute independently in each node, we propose a quantum bridging method with partially entangled states to teleport quantum states from source node to destination node. We also prove that the designed specific quantum bridging circuit is feasible for partially entangled states teleportation across multiple intermediate nodes. Compared to two traditional ways, our partially entanglement quantum bridging method uses simpler logic gates, has better security, and can be used in less quantum resource situation.

Automatic Network Fingerprinting through Single-Node Motifs

PubMed Central

Echtermeyer, Christoph; da Fontoura Costa, Luciano; Rodrigues, Francisco A.; Kaiser, Marcus

2011-01-01

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks. PMID:21297963

Ranking the spreading ability of nodes in network core

NASA Astrophysics Data System (ADS)

Tong, Xiao-Lei; Liu, Jian-Guo; Wang, Jiang-Pan; Guo, Qiang; Ni, Jing

2015-11-01

Ranking nodes by their spreading ability in complex networks is of vital significance to better understand the network structure and more efficiently spread information. The k-shell decomposition method could identify the most influential nodes, namely network core, with the same ks values regardless to their different spreading influence. In this paper, we present an improved method based on the k-shell decomposition method and closeness centrality (CC) to rank the node spreading influence of the network core. Experiment results on the data from the scientific collaboration network and U.S. aviation network show that the accuracy of the presented method could be increased by 31% and 45% than the one obtained by the degree k, 32% and 31% than the one by the betweenness.

Energy-Efficient Data Collection Method for Sensor Networks by Integrating Asymmetric Communication and Wake-Up Radio

PubMed Central

Iwata, Masanari; Tang, Suhua; Obana, Sadao

2018-01-01

In large-scale wireless sensor networks (WSNs), nodes close to sink nodes consume energy more quickly than other nodes due to packet forwarding. A mobile sink is a good solution to this issue, although it causes two new problems to nodes: (i) overhead of updating routing information; and (ii) increased operating time due to aperiodic query. To solve these problems, this paper proposes an energy-efficient data collection method, Sink-based Centralized transmission Scheduling (SC-Sched), by integrating asymmetric communication and wake-up radio. Specifically, each node is equipped with a low-power wake-up receiver. The sink node determines transmission scheduling, and transmits a wake-up message using a large transmission power, directly activating a pair of nodes simultaneously which will communicate with a normal transmission power. This paper further investigates how to deal with frame loss caused by fading and how to mitigate the impact of the wake-up latency of communication modules. Simulation evaluations confirm that using multiple channels effectively reduces data collection time and SC-Sched works well with a mobile sink. Compared with the conventional duty-cycling method, SC-Sched greatly reduces total energy consumption and improves the network lifetime by 7.47 times in a WSN with 4 data collection points and 300 sensor nodes. PMID:29642397

Use of Indocyanine Green for Sentinel Lymph Node Biopsy: Case Series and Methods Comparison.

PubMed

McGregor, Andrew; Pavri, Sabrina N; Tsay, Cynthia; Kim, Samuel; Narayan, Deepak

2017-11-01

Sentinel lymph node biopsy is indicated for patients with biopsy-proven thickness melanoma greater than 1.0 mm. Use of lymphoscintigraphy along with vital blue dyes is the gold standard for identifying sentinel lymph nodes intraoperatively. Indocyanine green (ICG) has recently been used as a method of identifying sentinel lymph nodes. We herein describe a case series of patients who have successfully undergone ICG-assisted sentinel lymph node biopsy for melanoma. We compare 2 imaging systems that are used for ICG-assisted sentinel lymph node biopsy. Fourteen patients underwent ICG-assisted sentinel lymph node biopsy for melanoma using the SPY Elite system (Novadaq, Mississigua, Canada) and the Hamamatsu PDE-Neo probe system (Mitaka USA, Park City, Utah). We analyzed costs for 2 systems that utilize ICG for sentinel lymph node biopsies. Intraoperative use of ICG for sentinel lymph node biopsies was successful in correctly identifying sentinel lymph nodes. There was no difference between the Hamamatsu PDE-Neo probe and SPY Elite systems in the ability to detect sentinel lymph nodes; however, the former was associated with a lower operating cost and ease of use compared with the latter. ICG-assisted sentinel lymph biopsy using the SPY Elite or the Hamamatsu PDE-Neo probe systems for melanoma are comparable in terms of sentinel node detection. The Neo probe system delivers pertinent clinical data with the advantages of lower cost and ease of operation.

Neural networks for link prediction in realistic biomedical graphs: a multi-dimensional evaluation of graph embedding-based approaches.

PubMed

Crichton, Gamal; Guo, Yufan; Pyysalo, Sampo; Korhonen, Anna

2018-05-21

Link prediction in biomedical graphs has several important applications including predicting Drug-Target Interactions (DTI), Protein-Protein Interaction (PPI) prediction and Literature-Based Discovery (LBD). It can be done using a classifier to output the probability of link formation between nodes. Recently several works have used neural networks to create node representations which allow rich inputs to neural classifiers. Preliminary works were done on this and report promising results. However they did not use realistic settings like time-slicing, evaluate performances with comprehensive metrics or explain when or why neural network methods outperform. We investigated how inputs from four node representation algorithms affect performance of a neural link predictor on random- and time-sliced biomedical graphs of real-world sizes (∼ 6 million edges) containing information relevant to DTI, PPI and LBD. We compared the performance of the neural link predictor to those of established baselines and report performance across five metrics. In random- and time-sliced experiments when the neural network methods were able to learn good node representations and there was a negligible amount of disconnected nodes, those approaches outperformed the baselines. In the smallest graph (∼ 15,000 edges) and in larger graphs with approximately 14% disconnected nodes, baselines such as Common Neighbours proved a justifiable choice for link prediction. At low recall levels (∼ 0.3) the approaches were mostly equal, but at higher recall levels across all nodes and average performance at individual nodes, neural network approaches were superior. Analysis showed that neural network methods performed well on links between nodes with no previous common neighbours; potentially the most interesting links. Additionally, while neural network methods benefit from large amounts of data, they require considerable amounts of computational resources to utilise them. Our results indicate that when there is enough data for the neural network methods to use and there are a negligible amount of disconnected nodes, those approaches outperform the baselines. At low recall levels the approaches are mostly equal but at higher recall levels and average performance at individual nodes, neural network approaches are superior. Performance at nodes without common neighbours which indicate more unexpected and perhaps more useful links account for this.

All-to-all sequenced fault detection system

DOEpatents

Archer, Charles Jens; Pinnow, Kurt Walter; Ratterman, Joseph D.; Smith, Brian Edward

2010-11-02

An apparatus, program product and method enable nodal fault detection by sequencing communications between all system nodes. A master node may coordinate communications between two slave nodes before sequencing to and initiating communications between a new pair of slave nodes. The communications may be analyzed to determine the nodal fault.

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

DOEpatents

Archer, Charles J; Faraj, Ahmad A; Inglett, Todd A; Ratterman, Joseph D

2013-04-16

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

A Boundary Scan Test Vehicle for Direct Chip Attach Testing

NASA Technical Reports Server (NTRS)

Parsons, Heather A.; DAgostino, Saverio; Arakaki, Genji

2000-01-01

To facilitate the new faster, better and cheaper spacecraft designs, smaller more mass efficient avionics and instruments are using higher density electronic packaging technologies such as direct chip attach (DCA). For space flight applications, these technologies need to have demonstrated reliability and reasonably well defined fabrication and assembly processes before they will be accepted as baseline designs in new missions. As electronics shrink in size, not only can repair be more difficult, but 49 probing" circuitry can be very risky and it becomes increasingly more difficult to identify the specific source of a problem. To test and monitor these new technologies, the Direct Chip Attach Task, under NASA's Electronic Parts and Packaging Program (NEPP), chose the test methodology of boundary scan testing. The boundary scan methodology was developed for interconnect integrity and functional testing at hard to access electrical nodes. With boundary scan testing, active devices are used and failures can be identified to the specific device and lead. This technology permits the incorporation of "built in test" into almost any circuit and thus gives detailed test access to the highly integrated electronic assemblies. This presentation will describe boundary scan, discuss the development of the boundary scan test vehicle for DCA and current plans for testing of direct chip attach configurations.

Reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Peters, Amanda A [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN

2012-01-10

Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.

Reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Peters, Amanda E [Cambridge, MA; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN

2012-04-17

Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.

Generalized multiscale finite-element method (GMsFEM) for elastic wave propagation in heterogeneous, anisotropic media

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

Gao, Kai; Fu, Shubin; Gibson, Richard L.

It is important to develop fast yet accurate numerical methods for seismic wave propagation to characterize complex geological structures and oil and gas reservoirs. However, the computational cost of conventional numerical modeling methods, such as finite-difference method and finite-element method, becomes prohibitively expensive when applied to very large models. We propose a Generalized Multiscale Finite-Element Method (GMsFEM) for elastic wave propagation in heterogeneous, anisotropic media, where we construct basis functions from multiple local problems for both the boundaries and interior of a coarse node support or coarse element. The application of multiscale basis functions can capture the fine scale mediummore » property variations, and allows us to greatly reduce the degrees of freedom that are required to implement the modeling compared with conventional finite-element method for wave equation, while restricting the error to low values. We formulate the continuous Galerkin and discontinuous Galerkin formulation of the multiscale method, both of which have pros and cons. Applications of the multiscale method to three heterogeneous models show that our multiscale method can effectively model the elastic wave propagation in anisotropic media with a significant reduction in the degrees of freedom in the modeling system.« less

Generalized Multiscale Finite-Element Method (GMsFEM) for elastic wave propagation in heterogeneous, anisotropic media

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

Gao, Kai, E-mail: kaigao87@gmail.com; Fu, Shubin, E-mail: shubinfu89@gmail.com; Gibson, Richard L., E-mail: gibson@tamu.edu

It is important to develop fast yet accurate numerical methods for seismic wave propagation to characterize complex geological structures and oil and gas reservoirs. However, the computational cost of conventional numerical modeling methods, such as finite-difference method and finite-element method, becomes prohibitively expensive when applied to very large models. We propose a Generalized Multiscale Finite-Element Method (GMsFEM) for elastic wave propagation in heterogeneous, anisotropic media, where we construct basis functions from multiple local problems for both the boundaries and interior of a coarse node support or coarse element. The application of multiscale basis functions can capture the fine scale mediummore » property variations, and allows us to greatly reduce the degrees of freedom that are required to implement the modeling compared with conventional finite-element method for wave equation, while restricting the error to low values. We formulate the continuous Galerkin and discontinuous Galerkin formulation of the multiscale method, both of which have pros and cons. Applications of the multiscale method to three heterogeneous models show that our multiscale method can effectively model the elastic wave propagation in anisotropic media with a significant reduction in the degrees of freedom in the modeling system.« less

Generalized multiscale finite-element method (GMsFEM) for elastic wave propagation in heterogeneous, anisotropic media

DOE PAGES

Gao, Kai; Fu, Shubin; Gibson, Richard L.; ...

2015-04-14

It is important to develop fast yet accurate numerical methods for seismic wave propagation to characterize complex geological structures and oil and gas reservoirs. However, the computational cost of conventional numerical modeling methods, such as finite-difference method and finite-element method, becomes prohibitively expensive when applied to very large models. We propose a Generalized Multiscale Finite-Element Method (GMsFEM) for elastic wave propagation in heterogeneous, anisotropic media, where we construct basis functions from multiple local problems for both the boundaries and interior of a coarse node support or coarse element. The application of multiscale basis functions can capture the fine scale mediummore » property variations, and allows us to greatly reduce the degrees of freedom that are required to implement the modeling compared with conventional finite-element method for wave equation, while restricting the error to low values. We formulate the continuous Galerkin and discontinuous Galerkin formulation of the multiscale method, both of which have pros and cons. Applications of the multiscale method to three heterogeneous models show that our multiscale method can effectively model the elastic wave propagation in anisotropic media with a significant reduction in the degrees of freedom in the modeling system.« less

Error recovery to enable error-free message transfer between nodes of a computer network

DOEpatents

Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd; Steinmacher-Burow, Burkhard; Vranas, Pavlos M.

2016-01-26

An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

Review of edgematchimg procedures for digital cartographic data used in Geographic Information Systems (GIS)

USGS Publications Warehouse

Nebert, D.D.

1989-01-01

In the process of developing a continuous hydrographic data layer for water resources applications in the Pacific Northwest, map-edge discontinuities in the U.S. Geological Survey 1:100 ,000-scale digital data that required application of computer-assisted edgematching procedures were identified. The spatial data sets required by the project must have line features that match closely enough across map boundaries to ensure full line topology when adjacent files are joined by the computer. Automated edgematching techniques are evaluated as to their effects on positional accuracy. Interactive methods such as selective node-matching and on-screen editing are also reviewed. Interactive procedures complement automated methods by allowing supervision of edgematching in a cartographic and hydrologic context. Common edge conditions encountered in the preparation of the Northwest Rivers data base are described, as are recommended processing solutions. Suggested edgematching procedures for 1:100,000-scale hydrography data are included in an appendix to encourage consistent processing of this theme on a national scale. (USGS)

A hybrid 3D spatial access method based on quadtrees and R-trees for globe data

NASA Astrophysics Data System (ADS)

Gong, Jun; Ke, Shengnan; Li, Xiaomin; Qi, Shuhua

2009-10-01

3D spatial access method for globe data is very crucial technique for virtual earth. This paper presents a brand-new maintenance method to index 3d objects distributed on the whole surface of the earth, which integrates the 1:1,000,000- scale topographic map tiles, Quad-tree and R-tree. Furthermore, when traditional methods are extended into 3d space, the performance of spatial index deteriorates badly, for example 3D R-tree. In order to effectively solve this difficult problem, a new algorithm of dynamic R-tree is put forward, which includes two sub-procedures, namely node-choosing and node-split. In the node-choosing algorithm, a new strategy is adopted, not like the traditional mode which is from top to bottom, but firstly from bottom to top then from top to bottom. This strategy can effectively solve the negative influence of node overlap. In the node-split algorithm, 2-to-3 split mode substitutes the traditional 1-to-2 mode, which can better concern the shape and size of nodes. Because of the rational tree shape, this R-tree method can easily integrate the concept of LOD. Therefore, it will be later implemented in commercial DBMS and adopted in time-crucial 3d GIS system.

Coverage-guaranteed sensor node deployment strategies for wireless sensor networks.

PubMed

Fan, Gaojuan; Wang, Ruchuan; Huang, Haiping; Sun, Lijuan; Sha, Chao

2010-01-01

Deployment quality and cost are two conflicting aspects in wireless sensor networks. Random deployment, where the monitored field is covered by randomly and uniformly deployed sensor nodes, is an appropriate approach for large-scale network applications. However, their successful applications depend considerably on the deployment quality that uses the minimum number of sensors to achieve a desired coverage. Currently, the number of sensors required to meet the desired coverage is based on asymptotic analysis, which cannot meet deployment quality due to coverage overestimation in real applications. In this paper, we first investigate the coverage overestimation and address the challenge of designing coverage-guaranteed deployment strategies. To overcome this problem, we propose two deployment strategies, namely, the Expected-area Coverage Deployment (ECD) and BOundary Assistant Deployment (BOAD). The deployment quality of the two strategies is analyzed mathematically. Under the analysis, a lower bound on the number of deployed sensor nodes is given to satisfy the desired deployment quality. We justify the correctness of our analysis through rigorous proof, and validate the effectiveness of the two strategies through extensive simulation experiments. The simulation results show that both strategies alleviate the coverage overestimation significantly. In addition, we also evaluate two proposed strategies in the context of target detection application. The comparison results demonstrate that if the target appears at the boundary of monitored region in a given random deployment, the average intrusion distance of BOAD is considerably shorter than that of ECD with the same desired deployment quality. In contrast, ECD has better performance in terms of the average intrusion distance when the invasion of intruder is from the inside of monitored region.

Pulse bifurcations and instabilities in an excitable medium: Computations in finite ring domains

NASA Astrophysics Data System (ADS)

Or-Guil, M.; Krishnan, J.; Kevrekidis, I. G.; Bär, M.

2001-10-01

We investigate the instabilities and bifurcations of traveling pulses in a model excitable medium; in particular, we discuss three different scenarios involving either the loss of stability or disappearance of stable pulses. In numerical simulations beyond the instabilities we observe replication of pulses (``backfiring'') resulting in complex periodic or spatiotemporally chaotic dynamics as well as modulated traveling pulses. We approximate the linear stability of traveling pulses through computations in a finite albeit large domain with periodic boundary conditions. The critical eigenmodes at the onset of the instabilities are related to the resulting spatiotemporal dynamics and ``act'' upon the back of the pulses. The first scenario has been analyzed earlier [M. G. Zimmermann et al., Physica D 110, 92 (1997)] for high excitability (low excitation threshold): it involves the collision of a stable pulse branch with an unstable pulse branch in a so-called T point. In the framework of traveling wave ordinary differential equations, pulses correspond to homoclinic orbits and the T point to a double heteroclinic loop. We investigate this transition for a pulse in a domain with finite length and periodic boundary conditions. Numerical evidence of the proximity of the infinite-domain T point in this setup appears in the form of two saddle node bifurcations. Alternatively, for intermediate excitation threshold, an entire cascade of saddle nodes causing a ``spiraling'' of the pulse branch appears near the parameter values corresponding to the infinite-domain T point. Backfiring appears at the first saddle-node bifurcation, which limits the existence region of stable pulses. The third case found in the model for large excitation threshold is an oscillatory instability giving rise to ``breathing,'' traveling pulses that periodically vary in width and speed.

Stability and instability of axisymmetric droplets in thermocapillary-driven thin films

NASA Astrophysics Data System (ADS)

Nicolaou, Zachary G.

2018-03-01

The stability of compactly supported, axisymmetric droplet states is considered for driven thin viscous films evolving on two-dimensional surfaces. Stability is assessed using Lyapunov energy methods afforded by the Cahn-Hilliard variational form of the governing equation. For general driving forces, a criterion on the gradient of profiles at the boundary of their support (their contact slope) is shown to be a necessary condition for stability. Additional necessary and sufficient conditions for stability are established for a specific driving force corresponding to a thermocapillary-driven film. It is found that only droplets of sufficiently short height that satisfy the contact slope criterion are stable. This destabilization of droplets with increasing height is characterized as a saddle-node bifurcation between a branch of tall, unstable droplets and a branch of short, stable droplets.

Simulation of unsteady flow and solute transport in a tidal river network

USGS Publications Warehouse

Zhan, X.

2003-01-01

A mathematical model and numerical method for water flow and solute transport in a tidal river network is presented. The tidal river network is defined as a system of open channels of rivers with junctions and cross sections. As an example, the Pearl River in China is represented by a network of 104 channels, 62 nodes, and a total of 330 cross sections with 11 boundary section for one of the applications. The simulations are performed with a supercomputer for seven scenarios of water flow and/or solute transport in the Pearl River, China, with different hydrological and weather conditions. Comparisons with available data are shown. The intention of this study is to summarize previous works and to provide a useful tool for water environmental management in a tidal river network, particularly for the Pearl River, China.

On the existence and stability conditions for mixed-hybrid finite element solutions based on Reissner's variational principle

NASA Technical Reports Server (NTRS)

Karlovitz, L. A.; Atluri, S. N.; Xue, W.-M.

1985-01-01

The extensions of Reissner's two-field (stress and displacement) principle to the cases wherein the displacement field is discontinuous and/or the stress field results in unreciprocated tractions, at a finite number of surfaces ('interelement boundaries') in a domain (as, for instance, when the domain is discretized into finite elements), is considered. The conditions for the existence, uniqueness, and stability of mixed-hybrid finite element solutions based on such discontinuous fields, are summarized. The reduction of these global conditions to local ('element') level, and the attendant conditions on the ranks of element matrices, are discussed. Two examples of stable, invariant, least-order elements - a four-node square planar element and an eight-node cubic element - are discussed in detail.

Energy Efficient Real-Time Scheduling Using DPM on Mobile Sensors with a Uniform Multi-Cores

PubMed Central

Kim, Youngmin; Lee, Chan-Gun

2017-01-01

In wireless sensor networks (WSNs), sensor nodes are deployed for collecting and analyzing data. These nodes use limited energy batteries for easy deployment and low cost. The use of limited energy batteries is closely related to the lifetime of the sensor nodes when using wireless sensor networks. Efficient-energy management is important to extending the lifetime of the sensor nodes. Most effort for improving power efficiency in tiny sensor nodes has focused mainly on reducing the power consumed during data transmission. However, recent emergence of sensor nodes equipped with multi-cores strongly requires attention to be given to the problem of reducing power consumption in multi-cores. In this paper, we propose an energy efficient scheduling method for sensor nodes supporting a uniform multi-cores. We extend the proposed T-Ler plane based scheduling for global optimal scheduling of a uniform multi-cores and multi-processors to enable power management using dynamic power management. In the proposed approach, processor selection for a scheduling and mapping method between the tasks and processors is proposed to efficiently utilize dynamic power management. Experiments show the effectiveness of the proposed approach compared to other existing methods. PMID:29240695

Embedding global barrier and collective in torus network with each node combining input from receivers according to class map for output to senders

DOEpatents

Chen, Dong; Coteus, Paul W; Eisley, Noel A; Gara, Alan; Heidelberger, Philip; Senger, Robert M; Salapura, Valentina; Steinmacher-Burow, Burkhard; Sugawara, Yutaka; Takken, Todd E

2013-08-27

Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computer program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.

A local immunization strategy for networks with overlapping community structure

NASA Astrophysics Data System (ADS)

Taghavian, Fatemeh; Salehi, Mostafa; Teimouri, Mehdi

2017-02-01

Since full coverage treatment is not feasible due to limited resources, we need to utilize an immunization strategy to effectively distribute the available vaccines. On the other hand, the structure of contact network among people has a significant impact on epidemics of infectious diseases (such as SARS and influenza) in a population. Therefore, network-based immunization strategies aim to reduce the spreading rate by removing the vaccinated nodes from contact network. Such strategies try to identify more important nodes in epidemics spreading over a network. In this paper, we address the effect of overlapping nodes among communities on epidemics spreading. The proposed strategy is an optimized random-walk based selection of these nodes. The whole process is local, i.e. it requires contact network information in the level of nodes. Thus, it is applicable to large-scale and unknown networks in which the global methods usually are unrealizable. Our simulation results on different synthetic and real networks show that the proposed method outperforms the existing local methods in most cases. In particular, for networks with strong community structures, high overlapping membership of nodes or small size communities, the proposed method shows better performance.

Link Prediction in Evolving Networks Based on Popularity of Nodes.

PubMed

Wang, Tong; He, Xing-Sheng; Zhou, Ming-Yang; Fu, Zhong-Qian

2017-08-02

Link prediction aims to uncover the underlying relationship behind networks, which could be utilized to predict missing edges or identify the spurious edges. The key issue of link prediction is to estimate the likelihood of potential links in networks. Most classical static-structure based methods ignore the temporal aspects of networks, limited by the time-varying features, such approaches perform poorly in evolving networks. In this paper, we propose a hypothesis that the ability of each node to attract links depends not only on its structural importance, but also on its current popularity (activeness), since active nodes have much more probability to attract future links. Then a novel approach named popularity based structural perturbation method (PBSPM) and its fast algorithm are proposed to characterize the likelihood of an edge from both existing connectivity structure and current popularity of its two endpoints. Experiments on six evolving networks show that the proposed methods outperform state-of-the-art methods in accuracy and robustness. Besides, visual results and statistical analysis reveal that the proposed methods are inclined to predict future edges between active nodes, rather than edges between inactive nodes.

Data Delivery Method Based on Neighbor Nodes' Information in a Mobile Ad Hoc Network

PubMed Central

Hayashi, Takuma; Taenaka, Yuzo; Okuda, Takeshi; Yamaguchi, Suguru

2014-01-01

This paper proposes a data delivery method based on neighbor nodes' information to achieve reliable communication in a mobile ad hoc network (MANET). In a MANET, it is difficult to deliver data reliably due to instabilities in network topology and wireless network condition which result from node movement. To overcome such unstable communication, opportunistic routing and network coding schemes have lately attracted considerable attention. Although an existing method that employs such schemes, MAC-independent opportunistic routing and encoding (MORE), Chachulski et al. (2007), improves the efficiency of data delivery in an unstable wireless mesh network, it does not address node movement. To efficiently deliver data in a MANET, the method proposed in this paper thus first employs the same opportunistic routing and network coding used in MORE and also uses the location information and transmission probabilities of neighbor nodes to adapt to changeable network topology and wireless network condition. The simulation experiments showed that the proposed method can achieve efficient data delivery with low network load when the movement speed is relatively slow. PMID:24672371

Data delivery method based on neighbor nodes' information in a mobile ad hoc network.

PubMed

Kashihara, Shigeru; Hayashi, Takuma; Taenaka, Yuzo; Okuda, Takeshi; Yamaguchi, Suguru

2014-01-01

This paper proposes a data delivery method based on neighbor nodes' information to achieve reliable communication in a mobile ad hoc network (MANET). In a MANET, it is difficult to deliver data reliably due to instabilities in network topology and wireless network condition which result from node movement. To overcome such unstable communication, opportunistic routing and network coding schemes have lately attracted considerable attention. Although an existing method that employs such schemes, MAC-independent opportunistic routing and encoding (MORE), Chachulski et al. (2007), improves the efficiency of data delivery in an unstable wireless mesh network, it does not address node movement. To efficiently deliver data in a MANET, the method proposed in this paper thus first employs the same opportunistic routing and network coding used in MORE and also uses the location information and transmission probabilities of neighbor nodes to adapt to changeable network topology and wireless network condition. The simulation experiments showed that the proposed method can achieve efficient data delivery with low network load when the movement speed is relatively slow.

Australasian Gastrointestinal Trials Group (AGITG) Contouring Atlas and Planning Guidelines for Intensity-Modulated Radiotherapy in Anal Cancer

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

Ng, Michael, E-mail: mng@radoncvic.com.au; Leong, Trevor; University of Melbourne

2012-08-01

Purpose: To develop a high-resolution target volume atlas with intensity-modulated radiotherapy (IMRT) planning guidelines for the conformal treatment of anal cancer. Methods and Materials: A draft contouring atlas and planning guidelines for anal cancer IMRT were prepared at the Australasian Gastrointestinal Trials Group (AGITG) annual meeting in September 2010. An expert panel of radiation oncologists contoured an anal cancer case to generate discussion on recommendations regarding target definition for gross disease, elective nodal volumes, and organs at risk (OARs). Clinical target volume (CTV) and planning target volume (PTV) margins, dose fractionation, and other IMRT-specific issues were also addressed. A steeringmore » committee produced the final consensus guidelines. Results: Detailed contouring and planning guidelines and a high-resolution atlas are provided. Gross tumor and elective target volumes are described and pictorially depicted. All elective regions should be routinely contoured for all disease stages, with the possible exception of the inguinal and high pelvic nodes for select, early-stage T1N0. A 20-mm CTV margin for the primary, 10- to 20-mm CTV margin for involved nodes and a 7-mm CTV margin for the elective pelvic nodal groups are recommended, while respecting anatomical boundaries. A 5- to 10-mm PTV margin is suggested. When using a simultaneous integrated boost technique, a dose of 54 Gy in 30 fractions to gross disease and 45 Gy to elective nodes with chemotherapy is appropriate. Guidelines are provided for OAR delineation. Conclusion: These consensus planning guidelines and high-resolution atlas complement the existing Radiation Therapy Oncology Group (RTOG) elective nodal ano-rectal atlas and provide additional anatomic, clinical, and technical instructions to guide radiation oncologists in the planning and delivery of IMRT for anal cancer.« less

The improved business valuation model for RFID company based on the community mining method.

PubMed

Li, Shugang; Yu, Zhaoxu

2017-01-01

Nowadays, the appetite for the investment and mergers and acquisitions (M&A) activity in RFID companies is growing rapidly. Although the huge number of papers have addressed the topic of business valuation models based on statistical methods or neural network methods, only a few are dedicated to constructing a general framework for business valuation that improves the performance with network graph (NG) and the corresponding community mining (CM) method. In this study, an NG based business valuation model is proposed, where real options approach (ROA) integrating CM method is designed to predict the company's net profit as well as estimate the company value. Three improvements are made in the proposed valuation model: Firstly, our model figures out the credibility of the node belonging to each community and clusters the network according to the evolutionary Bayesian method. Secondly, the improved bacterial foraging optimization algorithm (IBFOA) is adopted to calculate the optimized Bayesian posterior probability function. Finally, in IBFOA, bi-objective method is used to assess the accuracy of prediction, and these two objectives are combined into one objective function using a new Pareto boundary method. The proposed method returns lower forecasting error than 10 well-known forecasting models on 3 different time interval valuing tasks for the real-life simulation of RFID companies.

A k-space method for acoustic propagation using coupled first-order equations in three dimensions.

PubMed

Tillett, Jason C; Daoud, Mohammad I; Lacefield, James C; Waag, Robert C

2009-09-01

A previously described two-dimensional k-space method for large-scale calculation of acoustic wave propagation in tissues is extended to three dimensions. The three-dimensional method contains all of the two-dimensional method features that allow accurate and stable calculation of propagation. These features are spectral calculation of spatial derivatives, temporal correction that produces exact propagation in a homogeneous medium, staggered spatial and temporal grids, and a perfectly matched boundary layer. Spectral evaluation of spatial derivatives is accomplished using a fast Fourier transform in three dimensions. This computational bottleneck requires all-to-all communication; execution time in a parallel implementation is therefore sensitive to node interconnect latency and bandwidth. Accuracy of the three-dimensional method is evaluated through comparisons with exact solutions for media having spherical inhomogeneities. Large-scale calculations in three dimensions were performed by distributing the nearly 50 variables per voxel that are used to implement the method over a cluster of computers. Two computer clusters used to evaluate method accuracy are compared. Comparisons of k-space calculations with exact methods including absorption highlight the need to model accurately the medium dispersion relationships, especially in large-scale media. Accurately modeled media allow the k-space method to calculate acoustic propagation in tissues over hundreds of wavelengths.

The improved business valuation model for RFID company based on the community mining method

PubMed Central

Li, Shugang; Yu, Zhaoxu

2017-01-01

Nowadays, the appetite for the investment and mergers and acquisitions (M&A) activity in RFID companies is growing rapidly. Although the huge number of papers have addressed the topic of business valuation models based on statistical methods or neural network methods, only a few are dedicated to constructing a general framework for business valuation that improves the performance with network graph (NG) and the corresponding community mining (CM) method. In this study, an NG based business valuation model is proposed, where real options approach (ROA) integrating CM method is designed to predict the company’s net profit as well as estimate the company value. Three improvements are made in the proposed valuation model: Firstly, our model figures out the credibility of the node belonging to each community and clusters the network according to the evolutionary Bayesian method. Secondly, the improved bacterial foraging optimization algorithm (IBFOA) is adopted to calculate the optimized Bayesian posterior probability function. Finally, in IBFOA, bi-objective method is used to assess the accuracy of prediction, and these two objectives are combined into one objective function using a new Pareto boundary method. The proposed method returns lower forecasting error than 10 well-known forecasting models on 3 different time interval valuing tasks for the real-life simulation of RFID companies. PMID:28459815

Soybean (Glycine max) transformation using mature cotyledonary node explants.

PubMed

Olhoft, Paula M; Donovan, Christopher M; Somers, David A

2006-01-01

Agrobacterium tumefaciens-mediated transformation of soybeans has been steadily improved since its development in 1988. Soybean transformation is now possible in a range of genotypes from different maturity groups using different explants as sources of regenerable cells, various selectable marker genes and selective agents, and different A. tumefaciens strains. The cotyledonary-node method has been extensively investigated and across a number of laboratories yields on average greater than 1% transformation efficiency (one Southern-positive, independent event per 100 cotyledonary-node explants). Continued improvements in the cotyledonary-node method concomitant with further increases in transformation efficiency will enhance broader adoption of this already productive transformation method for use in crop improvement and functional genomics research efforts.

Identifying influential spreaders in complex networks based on kshell hybrid method

NASA Astrophysics Data System (ADS)

Namtirtha, Amrita; Dutta, Animesh; Dutta, Biswanath

2018-06-01

Influential spreaders are the key players in maximizing or controlling the spreading in a complex network. Identifying the influential spreaders using kshell decomposition method has become very popular in the recent time. In the literature, the core nodes i.e. with the largest kshell index of a network are considered as the most influential spreaders. We have studied the kshell method and spreading dynamics of nodes using Susceptible-Infected-Recovered (SIR) epidemic model to understand the behavior of influential spreaders in terms of its topological location in the network. From the study, we have found that every node in the core area is not the most influential spreader. Even a strategically placed lower shell node can also be a most influential spreader. Moreover, the core area can also be situated at the periphery of the network. The existing indexing methods are only designed to identify the most influential spreaders from core nodes and not from lower shells. In this work, we propose a kshell hybrid method to identify highly influential spreaders not only from the core but also from lower shells. The proposed method comprises the parameters such as kshell power, node's degree, contact distance, and many levels of neighbors' influence potential. The proposed method is evaluated using nine real world network datasets. In terms of the spreading dynamics, the experimental results show the superiority of the proposed method over the other existing indexing methods such as the kshell method, the neighborhood coreness centrality, the mixed degree decomposition, etc. Furthermore, the proposed method can also be applied to large-scale networks by considering the three levels of neighbors' influence potential.

A fictitious domain approach for the simulation of dense suspensions

NASA Astrophysics Data System (ADS)

Gallier, Stany; Lemaire, Elisabeth; Lobry, Laurent; Peters, François

2014-01-01

Low Reynolds number concentrated suspensions do exhibit an intricate physics which can be partly unraveled by the use of numerical simulation. To this end, a Lagrange multiplier-free fictitious domain approach is described in this work. Unlike some methods recently proposed, the present approach is fully Eulerian and therefore does not need any transfer between the Eulerian background grid and some Lagrangian nodes attached to particles. Lubrication forces between particles play an important role in the suspension rheology and have been properly accounted for in the model. A robust and effective lubrication scheme is outlined which consists in transposing the classical approach used in Stokesian Dynamics to our present direct numerical simulation. This lubrication model has also been adapted to account for solid boundaries such as walls. Contact forces between particles are modeled using a classical Discrete Element Method (DEM), a widely used method in granular matter physics. Comprehensive validations are presented on various one-particle, two-particle or three-particle configurations in a linear shear flow as well as some O(103) and O(104) particle simulations.

Connecting node and method for constructing a connecting node

NASA Technical Reports Server (NTRS)

Johnson, Christopher J. (Inventor); Raboin, Jasen L. (Inventor); Spexarth, Gary R. (Inventor)

2011-01-01

A connecting node comprises a polyhedral structure comprising a plurality of panels joined together at its side edges to form a spherical approximation, wherein at least one of the plurality of panels comprises a faceted surface being constructed with a passage for integrating with one of a plurality of elements comprising a docking port, a hatch, and a window that is attached to the connecting node. A method for manufacturing a connecting node comprises the steps of providing a plurality of panels, connecting the plurality of panels to form a spherical approximation, wherein each edge of each panel of the plurality is joined to another edge of another panel, and constructing at least one of the plurality of panels to include a passage for integrating at least one of a plurality of elements that may be attached to the connecting node.

Adaption of the temporal correlation coefficient calculation for temporal networks (applied to a real-world pig trade network).

PubMed

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

The average topological overlap of two graphs of two consecutive time steps measures the amount of changes in the edge configuration between the two snapshots. This value has to be zero if the edge configuration changes completely and one if the two consecutive graphs are identical. Current methods depend on the number of nodes in the network or on the maximal number of connected nodes in the consecutive time steps. In the first case, this methodology breaks down if there are nodes with no edges. In the second case, it fails if the maximal number of active nodes is larger than the maximal number of connected nodes. In the following, an adaption of the calculation of the temporal correlation coefficient and of the topological overlap of the graph between two consecutive time steps is presented, which shows the expected behaviour mentioned above. The newly proposed adaption uses the maximal number of active nodes, i.e. the number of nodes with at least one edge, for the calculation of the topological overlap. The three methods were compared with the help of vivid example networks to reveal the differences between the proposed notations. Furthermore, these three calculation methods were applied to a real-world network of animal movements in order to detect influences of the network structure on the outcome of the different methods.

Continuum Modeling and Control of Large Nonuniform Wireless Networks via Nonlinear Partial Differential Equations

DOE PAGES

Zhang, Yang; Chong, Edwin K. P.; Hannig, Jan; ...

2013-01-01

We inmore » troduce a continuum modeling method to approximate a class of large wireless networks by nonlinear partial differential equations (PDEs). This method is based on the convergence of a sequence of underlying Markov chains of the network indexed by N , the number of nodes in the network. As N goes to infinity, the sequence converges to a continuum limit, which is the solution of a certain nonlinear PDE. We first describe PDE models for networks with uniformly located nodes and then generalize to networks with nonuniformly located, and possibly mobile, nodes. Based on the PDE models, we develop a method to control the transmissions in nonuniform networks so that the continuum limit is invariant under perturbations in node locations. This enables the networks to maintain stable global characteristics in the presence of varying node locations.« less

Low- and high-order accurate boundary conditions: From Stokes to Darcy porous flow modeled with standard and improved Brinkman lattice Boltzmann schemes

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

Silva, Goncalo, E-mail: goncalo.nuno.silva@gmail.com; Talon, Laurent, E-mail: talon@fast.u-psud.fr; Ginzburg, Irina, E-mail: irina.ginzburg@irstea.fr

The present contribution focuses on the accuracy of reflection-type boundary conditions in the Stokes–Brinkman–Darcy modeling of porous flows solved with the lattice Boltzmann method (LBM), which we operate with the two-relaxation-time (TRT) collision and the Brinkman-force based scheme (BF), called BF-TRT scheme. In parallel, we compare it with the Stokes–Brinkman–Darcy linear finite element method (FEM) where the Dirichlet boundary conditions are enforced on grid vertices. In bulk, both BF-TRT and FEM share the same defect: in their discretization a correction to the modeled Brinkman equation appears, given by the discrete Laplacian of the velocity-proportional resistance force. This correction modifies themore » effective Brinkman viscosity, playing a crucial role in the triggering of spurious oscillations in the bulk solution. While the exact form of this defect is available in lattice-aligned, straight or diagonal, flows; in arbitrary flow/lattice orientations its approximation is constructed. At boundaries, we verify that such a Brinkman viscosity correction has an even more harmful impact. Already at the first order, it shifts the location of the no-slip wall condition supported by traditional LBM boundary schemes, such as the bounce-back rule. For that reason, this work develops a new class of boundary schemes to prescribe the Dirichlet velocity condition at an arbitrary wall/boundary-node distance and that supports a higher order accuracy in the accommodation of the TRT-Brinkman solutions. For their modeling, we consider the standard BF scheme and its improved version, called IBF; this latter is generalized in this work to suppress or to reduce the viscosity correction in arbitrarily oriented flows. Our framework extends the one- and two-point families of linear and parabolic link-wise boundary schemes, respectively called B-LI and B-MLI, which avoid the interference of the Brinkman viscosity correction in their closure relations. The performance of LBM and FEM is thoroughly evaluated in three benchmark tests, which are run throughout three distinctive permeability regimes. The first configuration is a horizontal porous channel, studied with a symbolic approach, where we construct the exact solutions of FEM and BF/IBF with different boundary schemes. The second problem refers to an inclined porous channel flow, which brings in as new challenge the formation of spurious boundary layers in LBM; that is, numerical artefacts that arise due to a deficient accommodation of the bulk solution by the low-accurate boundary scheme. The third problem considers a porous flow past a periodic square array of solid cylinders, which intensifies the previous two tests with the simulation of a more complex flow pattern. The ensemble of numerical tests provides guidelines on the effect of grid resolution and the TRT free collision parameter over the accuracy and the quality of the velocity field, spanning from Stokes to Darcy permeability regimes. It is shown that, with the use of the high-order accurate boundary schemes, the simple, uniform-mesh-based TRT-LBM formulation can even surpass the accuracy of FEM employing hardworking body-fitted meshes.« less

Low- and high-order accurate boundary conditions: From Stokes to Darcy porous flow modeled with standard and improved Brinkman lattice Boltzmann schemes

NASA Astrophysics Data System (ADS)

Silva, Goncalo; Talon, Laurent; Ginzburg, Irina

2017-04-01

The present contribution focuses on the accuracy of reflection-type boundary conditions in the Stokes-Brinkman-Darcy modeling of porous flows solved with the lattice Boltzmann method (LBM), which we operate with the two-relaxation-time (TRT) collision and the Brinkman-force based scheme (BF), called BF-TRT scheme. In parallel, we compare it with the Stokes-Brinkman-Darcy linear finite element method (FEM) where the Dirichlet boundary conditions are enforced on grid vertices. In bulk, both BF-TRT and FEM share the same defect: in their discretization a correction to the modeled Brinkman equation appears, given by the discrete Laplacian of the velocity-proportional resistance force. This correction modifies the effective Brinkman viscosity, playing a crucial role in the triggering of spurious oscillations in the bulk solution. While the exact form of this defect is available in lattice-aligned, straight or diagonal, flows; in arbitrary flow/lattice orientations its approximation is constructed. At boundaries, we verify that such a Brinkman viscosity correction has an even more harmful impact. Already at the first order, it shifts the location of the no-slip wall condition supported by traditional LBM boundary schemes, such as the bounce-back rule. For that reason, this work develops a new class of boundary schemes to prescribe the Dirichlet velocity condition at an arbitrary wall/boundary-node distance and that supports a higher order accuracy in the accommodation of the TRT-Brinkman solutions. For their modeling, we consider the standard BF scheme and its improved version, called IBF; this latter is generalized in this work to suppress or to reduce the viscosity correction in arbitrarily oriented flows. Our framework extends the one- and two-point families of linear and parabolic link-wise boundary schemes, respectively called B-LI and B-MLI, which avoid the interference of the Brinkman viscosity correction in their closure relations. The performance of LBM and FEM is thoroughly evaluated in three benchmark tests, which are run throughout three distinctive permeability regimes. The first configuration is a horizontal porous channel, studied with a symbolic approach, where we construct the exact solutions of FEM and BF/IBF with different boundary schemes. The second problem refers to an inclined porous channel flow, which brings in as new challenge the formation of spurious boundary layers in LBM; that is, numerical artefacts that arise due to a deficient accommodation of the bulk solution by the low-accurate boundary scheme. The third problem considers a porous flow past a periodic square array of solid cylinders, which intensifies the previous two tests with the simulation of a more complex flow pattern. The ensemble of numerical tests provides guidelines on the effect of grid resolution and the TRT free collision parameter over the accuracy and the quality of the velocity field, spanning from Stokes to Darcy permeability regimes. It is shown that, with the use of the high-order accurate boundary schemes, the simple, uniform-mesh-based TRT-LBM formulation can even surpass the accuracy of FEM employing hardworking body-fitted meshes.

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

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

Archer, Charles J.; Faraj, Daniel A.; Inglett, Todd A.

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selectedmore » link to the adjacent compute node connected to the compute node through the selected link.« less

A postprocessing method in the HMC framework for predicting gene function based on biological instrumental data

NASA Astrophysics Data System (ADS)

Feng, Shou; Fu, Ping; Zheng, Wenbin

2018-03-01

Predicting gene function based on biological instrumental data is a complicated and challenging hierarchical multi-label classification (HMC) problem. When using local approach methods to solve this problem, a preliminary results processing method is usually needed. This paper proposed a novel preliminary results processing method called the nodes interaction method. The nodes interaction method revises the preliminary results and guarantees that the predictions are consistent with the hierarchy constraint. This method exploits the label dependency and considers the hierarchical interaction between nodes when making decisions based on the Bayesian network in its first phase. In the second phase, this method further adjusts the results according to the hierarchy constraint. Implementing the nodes interaction method in the HMC framework also enhances the HMC performance for solving the gene function prediction problem based on the Gene Ontology (GO), the hierarchy of which is a directed acyclic graph that is more difficult to tackle. The experimental results validate the promising performance of the proposed method compared to state-of-the-art methods on eight benchmark yeast data sets annotated by the GO.

Prediction of an arc-tunable Weyl Fermion metallic state in Mo xW 1-xTe 2

DOE PAGES

Chang, Tay-Rong; Xu, Su-Yang; Chang, Guoqing; ...

2016-02-15

A Weyl semimetal is a new state of matter that hosts Weyl fermions as emergent quasiparticles. The Weyl fermions correspond to isolated points of bulk band degeneracy, Weyl nodes, which are connected only through the crystal’s boundary by exotic Fermi arcs. The length of the Fermi arc gives a measure of the topological strength, because the only way to destroy the Weyl nodes is to annihilate them in pairs in the reciprocal space. To date, Weyl semimetals are only realized in the TaAs class. Here, we propose a tunable Weyl state in Mo xW 1₋xTe 2 where Weyl nodes aremore » formed by touching points between metallic pockets. We show that the Fermi arc length can be changed as a function of Mo concentration, thus tuning the topological strength. Lastly,our results provide an experimentally feasible route to realizing Weyl physics in the layered compound Mo xW 1₋xTe 2, where non-saturating magneto-resistance and pressure-driven superconductivity have been observed.« less

Energy efficient sensor scheduling with a mobile sink node for the target tracking application.

PubMed

Maheswararajah, Suhinthan; Halgamuge, Saman; Premaratne, Malin

2009-01-01

Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance.

Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application

PubMed Central

Maheswararajah, Suhinthan; Halgamuge, Saman; Premaratne, Malin

2009-01-01

Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance PMID:22399934

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations. Part 1; Viscous Fluxes

NASA Technical Reports Server (NTRS)

Diskin, Boris; Thomas, James L.; Nielsen, Eric J.; Nishikawa, Hiroaki; White, Jeffery A.

2009-01-01

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

a Non-Overlapping Discretization Method for Partial Differential Equations

NASA Astrophysics Data System (ADS)

Rosas-Medina, A.; Herrera, I.

2013-05-01

Mathematical models of many systems of interest, including very important continuous systems of Engineering and Science, lead to a great variety of partial differential equations whose solution methods are based on the computational processing of large-scale algebraic systems. Furthermore, the incredible expansion experienced by the existing computational hardware and software has made amenable to effective treatment problems of an ever increasing diversity and complexity, posed by engineering and scientific applications. The emergence of parallel computing prompted on the part of the computational-modeling community a continued and systematic effort with the purpose of harnessing it for the endeavor of solving boundary-value problems (BVPs) of partial differential equations. Very early after such an effort began, it was recognized that domain decomposition methods (DDM) were the most effective technique for applying parallel computing to the solution of partial differential equations, since such an approach drastically simplifies the coordination of the many processors that carry out the different tasks and also reduces very much the requirements of information-transmission between them. Ideally, DDMs intend producing algorithms that fulfill the DDM-paradigm; i.e., such that "the global solution is obtained by solving local problems defined separately in each subdomain of the coarse-mesh -or domain-decomposition-". Stated in a simplistic manner, the basic idea is that, when the DDM-paradigm is satisfied, full parallelization can be achieved by assigning each subdomain to a different processor. When intensive DDM research began much attention was given to overlapping DDMs, but soon after attention shifted to non-overlapping DDMs. This evolution seems natural when the DDM-paradigm is taken into account: it is easier to uncouple the local problems when the subdomains are separated. However, an important limitation of non-overlapping domain decompositions, as that concept is usually understood today, is that interface nodes are shared by two or more subdomains of the coarse-mesh and, therefore, even non-overlapping DDMs are actually overlapping when seen from the perspective of the nodes used in the discretization. In this talk we present and discuss a discretization method in which the nodes used are non-overlapping, in the sense that each one of them belongs to one and only one subdomain of the coarse-mesh.

Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks

DOEpatents

Archer, Charles J.; Inglett, Todd A.; Ratterman, Joseph D.; Smith, Brian E.

2010-03-02

Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.

Multilayer Extreme Learning Machine With Subnetwork Nodes for Representation Learning.

PubMed

Yang, Yimin; Wu, Q M Jonathan

2016-11-01

The extreme learning machine (ELM), which was originally proposed for "generalized" single-hidden layer feedforward neural networks, provides efficient unified learning solutions for the applications of clustering, regression, and classification. It presents competitive accuracy with superb efficiency in many applications. However, ELM with subnetwork nodes architecture has not attracted much research attentions. Recently, many methods have been proposed for supervised/unsupervised dimension reduction or representation learning, but these methods normally only work for one type of problem. This paper studies the general architecture of multilayer ELM (ML-ELM) with subnetwork nodes, showing that: 1) the proposed method provides a representation learning platform with unsupervised/supervised and compressed/sparse representation learning and 2) experimental results on ten image datasets and 16 classification datasets show that, compared to other conventional feature learning methods, the proposed ML-ELM with subnetwork nodes performs competitively or much better than other feature learning methods.

Collaborative localization in wireless sensor networks via pattern recognition in radio irregularity using omnidirectional antennas.

PubMed

Jiang, Joe-Air; Chuang, Cheng-Long; Lin, Tzu-Shiang; Chen, Chia-Pang; Hung, Chih-Hung; Wang, Jiing-Yi; Liu, Chang-Wang; Lai, Tzu-Yun

2010-01-01

In recent years, various received signal strength (RSS)-based localization estimation approaches for wireless sensor networks (WSNs) have been proposed. RSS-based localization is regarded as a low-cost solution for many location-aware applications in WSNs. In previous studies, the radiation patterns of all sensor nodes are assumed to be spherical, which is an oversimplification of the radio propagation model in practical applications. In this study, we present an RSS-based cooperative localization method that estimates unknown coordinates of sensor nodes in a network. Arrangement of two external low-cost omnidirectional dipole antennas is developed by using the distance-power gradient model. A modified robust regression is also proposed to determine the relative azimuth and distance between a sensor node and a fixed reference node. In addition, a cooperative localization scheme that incorporates estimations from multiple fixed reference nodes is presented to improve the accuracy of the localization. The proposed method is tested via computer-based analysis and field test. Experimental results demonstrate that the proposed low-cost method is a useful solution for localizing sensor nodes in unknown or changing environments.

MILAMIN 2 - Fast MATLAB FEM solver

NASA Astrophysics Data System (ADS)

Dabrowski, Marcin; Krotkiewski, Marcin; Schmid, Daniel W.

2013-04-01

MILAMIN is a free and efficient MATLAB-based two-dimensional FEM solver utilizing unstructured meshes [Dabrowski et al., G-cubed (2008)]. The code consists of steady-state thermal diffusion and incompressible Stokes flow solvers implemented in approximately 200 lines of native MATLAB code. The brevity makes the code easily customizable. An important quality of MILAMIN is speed - it can handle millions of nodes within minutes on one CPU core of a standard desktop computer, and is faster than many commercial solutions. The new MILAMIN 2 allows three-dimensional modeling. It is designed as a set of functional modules that can be used as building blocks for efficient FEM simulations using MATLAB. The utilities are largely implemented as native MATLAB functions. For performance critical parts we use MUTILS - a suite of compiled MEX functions optimized for shared memory multi-core computers. The most important features of MILAMIN 2 are: 1. Modular approach to defining, tracking, and discretizing the geometry of the model 2. Interfaces to external mesh generators (e.g., Triangle, Fade2d, T3D) and mesh utilities (e.g., element type conversion, fast point location, boundary extraction) 3. Efficient computation of the stiffness matrix for a wide range of element types, anisotropic materials and three-dimensional problems 4. Fast global matrix assembly using a dedicated MEX function 5. Automatic integration rules 6. Flexible prescription (spatial, temporal, and field functions) and efficient application of Dirichlet, Neuman, and periodic boundary conditions 7. Treatment of transient and non-linear problems 8. Various iterative and multi-level solution strategies 9. Post-processing tools (e.g., numerical integration) 10. Visualization primitives using MATLAB, and VTK export functions We provide a large number of examples that show how to implement a custom FEM solver using the MILAMIN 2 framework. The examples are MATLAB scripts of increasing complexity that address a given technical topic (e.g., creating meshes, reordering nodes, applying boundary conditions), a given numerical topic (e.g., using various solution strategies, non-linear iterations), or that present a fully-developed solver designed to address a scientific topic (e.g., performing Stokes flow simulations in synthetic porous medium). References: Dabrowski, M., M. Krotkiewski, and D. W. Schmid MILAMIN: MATLAB-based finite element method solver for large problems, Geochem. Geophys. Geosyst., 9, Q04030, 2008

Network modelling methods for FMRI.

PubMed

Smith, Stephen M; Miller, Karla L; Salimi-Khorshidi, Gholamreza; Webster, Matthew; Beckmann, Christian F; Nichols, Thomas E; Ramsey, Joseph D; Woolrich, Mark W

2011-01-15

There is great interest in estimating brain "networks" from FMRI data. This is often attempted by identifying a set of functional "nodes" (e.g., spatial ROIs or ICA maps) and then conducting a connectivity analysis between the nodes, based on the FMRI timeseries associated with the nodes. Analysis methods range from very simple measures that consider just two nodes at a time (e.g., correlation between two nodes' timeseries) to sophisticated approaches that consider all nodes simultaneously and estimate one global network model (e.g., Bayes net models). Many different methods are being used in the literature, but almost none has been carefully validated or compared for use on FMRI timeseries data. In this work we generate rich, realistic simulated FMRI data for a wide range of underlying networks, experimental protocols and problematic confounds in the data, in order to compare different connectivity estimation approaches. Our results show that in general correlation-based approaches can be quite successful, methods based on higher-order statistics are less sensitive, and lag-based approaches perform very poorly. More specifically: there are several methods that can give high sensitivity to network connection detection on good quality FMRI data, in particular, partial correlation, regularised inverse covariance estimation and several Bayes net methods; however, accurate estimation of connection directionality is more difficult to achieve, though Patel's τ can be reasonably successful. With respect to the various confounds added to the data, the most striking result was that the use of functionally inaccurate ROIs (when defining the network nodes and extracting their associated timeseries) is extremely damaging to network estimation; hence, results derived from inappropriate ROI definition (such as via structural atlases) should be regarded with great caution. Copyright © 2010 Elsevier Inc. All rights reserved.

Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

NASA Astrophysics Data System (ADS)

Kozma, William; Lazos, Loukas

We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.

Combined node and link partitions method for finding overlapping communities in complex networks

PubMed Central

Jin, Di; Gabrys, Bogdan; Dang, Jianwu

2015-01-01

Community detection in complex networks is a fundamental data analysis task in various domains, and how to effectively find overlapping communities in real applications is still a challenge. In this work, we propose a new unified model and method for finding the best overlapping communities on the basis of the associated node and link partitions derived from the same framework. Specifically, we first describe a unified model that accommodates node and link communities (partitions) together, and then present a nonnegative matrix factorization method to learn the parameters of the model. Thereafter, we infer the overlapping communities based on the derived node and link communities, i.e., determine each overlapped community between the corresponding node and link community with a greedy optimization of a local community function conductance. Finally, we introduce a model selection method based on consensus clustering to determine the number of communities. We have evaluated our method on both synthetic and real-world networks with ground-truths, and compared it with seven state-of-the-art methods. The experimental results demonstrate the superior performance of our method over the competing ones in detecting overlapping communities for all analysed data sets. Improved performance is particularly pronounced in cases of more complicated networked community structures. PMID:25715829

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes

NASA Technical Reports Server (NTRS)

Diskin, Boris; Thomas, James L.; Nielsen, Eric J.; Nishikawa, Hiroaki; White, Jeffery A.

2010-01-01

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and complexity are studied for four nominally second-order accurate schemes: a node-centered scheme and three cell-centered schemes - a node-averaging scheme and two schemes with nearest-neighbor and adaptive compact stencils for least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Tests from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The tests of the second class are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes may degenerate on mixed grids, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to that of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping based on a distance function commonly available in practical schemes or modifying the scheme stencil to reflect the direction of strong coupling. The major conclusion is that accuracies of the node centered and the best cell-centered schemes are comparable at equivalent number of degrees of freedom.

Accurate evaluation of axillary sentinel lymph node metastasis using contrast-enhanced ultrasonography with Sonazoid in breast cancer: a preliminary clinical trial.

PubMed

Matsuzawa, Fumihiko; Omoto, Kiyoka; Einama, Takahiro; Abe, Hironori; Suzuki, Takashi; Hamaguchi, Jun; Kaga, Terumi; Sato, Mami; Oomura, Masako; Takata, Yumiko; Fujibe, Ayako; Takeda, Chie; Tamura, Etsuya; Taketomi, Akinobu; Kyuno, Kenichi

2015-01-01

Breast cancer is the most common type of cancer in women. The 5-year survival rate in patients with breast cancer ranges from 74 to 82 %. Sentinel lymph node biopsy has become an alternative to axillary lymph node dissection for nodal staging. We evaluated the detection of the sentinel lymph node and metastasis of the lymph node using contrast enhanced ultrasonography with Sonazoid. Between December 2013 and May 2014, 32 patients with operable breast cancer were enrolled in this study. We evaluated the detection of axillary sentinel lymph nodes and the evaluation of axillary lymph nodes metastasis using contrast enhanced computed tomography, color Doppler ultrasonography and contrast enhanced ultrasonography with Sonazoid. All the sentinel lymph nodes were identified, and the sentinel lymph nodes detected by contrast enhanced ultrasonography with Sonazoid corresponded with those detected by computed tomography lymphography and indigo carmine method. The detection of metastasis based on contrast enhanced computed tomography were sensitivity 20.0 %, specificity 88.2 %, PPV 60.0 %, NPV 55.6 %, accuracy 56.3 %. Based on color Doppler ultrasonography, the results were sensitivity 36.4 %, specificity 95.2 %, PPV 80.0 %, NPV 74.1 %, accuracy 75.0 %. Based on contrast enhanced ultrasonography with Sonazoid, the results were sensitivity 81.8 %, specificity 95.2 %, PPV 90.0 %, NPV 90.9 %, accuracy 90.6 %. The results suggested that contrast enhanced ultrasonography with Sonazoid was the most accurate among the evaluations of these modalities. In the future, we believe that our method would take the place of conventional sentinel lymph node biopsy for an axillary staging method.

Bisectional fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2012-02-14

An apparatus, program product and method logically divide a group of nodes and causes node pairs comprising a node from each section to communicate. Results from the communications may be analyzed to determine performance characteristics, such as bandwidth and proper connectivity.

Bisectional fault detection system

DOEpatents

Archer, Charles Jens [Rochester, MN; Pinnow, Kurt Walter [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian Edward [Rochester, MN

2008-11-11

An apparatus, program product and method logically divides a group of nodes and causes node pairs comprising a node from each section to communicate. Results from the communications may be analyzed to determine performance characteristics, such as bandwidth and proper connectivity.

Identifying and characterizing key nodes among communities based on electrical-circuit networks.

PubMed

Zhu, Fenghui; Wang, Wenxu; Di, Zengru; Fan, Ying

2014-01-01

Complex networks with community structures are ubiquitous in the real world. Despite many approaches developed for detecting communities, we continue to lack tools for identifying overlapping and bridging nodes that play crucial roles in the interactions and communications among communities in complex networks. Here we develop an algorithm based on the local flow conservation to effectively and efficiently identify and distinguish the two types of nodes. Our method is applicable in both undirected and directed networks without a priori knowledge of the community structure. Our method bypasses the extremely challenging problem of partitioning communities in the presence of overlapping nodes that may belong to multiple communities. Due to the fact that overlapping and bridging nodes are of paramount importance in maintaining the function of many social and biological networks, our tools open new avenues towards understanding and controlling real complex networks with communities accompanied with the key nodes.

Profiling an application for power consumption during execution on a compute node

DOEpatents

Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

2013-09-17

Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

DOEpatents

Faraj, Ahmad

2013-07-09

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring for that node, a global allreduce operation using contribution data for the cores assigned to that ring or any global allreduce results from previous global allreduce operations, yielding current global allreduce results for each core; and performing, for each node, a local allreduce operation using the global allreduce results.

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

DOEpatents

Faraj, Ahmad

2013-02-12

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: performing, for each node, a local reduction operation using allreduce contribution data for the cores of that node, yielding, for each node, a local reduction result for one or more representative cores for that node; establishing one or more logical rings among the nodes, each logical ring including only one of the representative cores from each node; performing, for each logical ring, a global allreduce operation using the local reduction result for the representative cores included in that logical ring, yielding a global allreduce result for each representative core included in that logical ring; and performing, for each node, a local broadcast operation using the global allreduce results for each representative core on that node.

Methods, apparatus and system for selective duplication of subtasks

DOEpatents

Andrade Costa, Carlos H.; Cher, Chen-Yong; Park, Yoonho; Rosenburg, Bryan S.; Ryu, Kyung D.

2016-03-29

A method for selective duplication of subtasks in a high-performance computing system includes: monitoring a health status of one or more nodes in a high-performance computing system, where one or more subtasks of a parallel task execute on the one or more nodes; identifying one or more nodes as having a likelihood of failure which exceeds a first prescribed threshold; selectively duplicating the one or more subtasks that execute on the one or more nodes having a likelihood of failure which exceeds the first prescribed threshold; and notifying a messaging library that one or more subtasks were duplicated.

Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

DOEpatents

Archer, Charles J [Rochester, MN; Hardwick, Camesha R [Fayetteville, NC; McCarthy, Patrick J [Rochester, MN; Wallenfelt, Brian P [Eden Prairie, MN

2009-06-23

Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

Identification of influential spreaders in online social networks using interaction weighted K-core decomposition method

NASA Astrophysics Data System (ADS)

Al-garadi, Mohammed Ali; Varathan, Kasturi Dewi; Ravana, Sri Devi

2017-02-01

Online social networks (OSNs) have become a vital part of everyday living. OSNs provide researchers and scientists with unique prospects to comprehend individuals on a scale and to analyze human behavioral patterns. Influential spreaders identification is an important subject in understanding the dynamics of information diffusion in OSNs. Targeting these influential spreaders is significant in planning the techniques for accelerating the propagation of information that is useful for various applications, such as viral marketing applications or blocking the diffusion of annoying information (spreading of viruses, rumors, online negative behaviors, and cyberbullying). Existing K-core decomposition methods consider links equally when calculating the influential spreaders for unweighted networks. Alternatively, the proposed link weights are based only on the degree of nodes. Thus, if a node is linked to high-degree nodes, then this node will receive high weight and is treated as an important node. Conversely, the degree of nodes in OSN context does not always provide accurate influence of users. In the present study, we improve the K-core method for OSNs by proposing a novel link-weighting method based on the interaction among users. The proposed method is based on the observation that the interaction of users is a significant factor in quantifying the spreading capability of user in OSNs. The tracking of diffusion links in the real spreading dynamics of information verifies the effectiveness of our proposed method for identifying influential spreaders in OSNs as compared with degree centrality, PageRank, and original K-core.

An improved graph cut segmentation method for cervical lymph nodes on sonograms and its relationship with node's shape assessment.

PubMed

Zhang, Junhua; Wang, Yuanyuan; Shi, Xinling

2009-12-01

A modified graph cut was proposed under the elliptical shape constraint to segment cervical lymph nodes on sonograms, and its effect on the measurement of short axis to long axis ratio (S/L) was investigated by using the relative ultimate measurement accuracy (RUMA). Under the same user inputs, the proposed algorithm successfully segmented all 60 sonograms tested, while the traditional graph cut failed. The mean RUMA resulted from the developed method was comparable to that resulted from the manual segmentation. Results indicated that utilizing the elliptical shape prior could appreciably improve the graph cut for nodes segmentation, and the proposed method satisfied the accuracy requirement of S/L measurement.

A refined mixed shear flexible finite element for the nonlinear analysis of laminated plates

NASA Technical Reports Server (NTRS)

Putcha, N. S.; Reddy, J. N.

1986-01-01

The present study is concerned with the development of a mixed shear flexible finite element with relaxed continuity for the geometrically linear and nonlinear analysis of laminated anisotropic plates. The formulation of the element is based on a refined higher-order theory. This theory satisfies the zero transverse shear stress boundary conditions on the top and bottom faces of the plate. Shear correction coefficients are not needed. The developed element consists of 11 degrees-of-freedom per node, taking into account three displacements, two rotations, and six moment resultants. An evaluation of the element is conducted with respect to the accuracy obtained in the bending of laminated anistropic rectangular plates with different lamination schemes, loadings, and boundary conditions.

Venus atmospheric structure and dynamics from the VEGA lander and balloons: New results and PDS archive

NASA Astrophysics Data System (ADS)

Lorenz, Ralph D.; Crisp, David; Huber, Lyle

2018-05-01

The longest-lived in-situ measurement platforms at Venus have been the Soviet VEGA balloons in 1985 and the only high-quality pressure/temperature profile in the lowest 10 km of the atmosphere is that from the VEGA-2 lander. Here we review the mission and the resultant literature and report the archival of numerical data from these investigations on the NASA Planetary Data System Atmospheres Node to facilitate their access to the community. We additionally report some new results, including the striking absence of a signature of the planetary boundary layer in the near-surface potential temperature profile from the VEGA-2 lander, in contrast to the well-defined boundaries seen in a comparable profile at Titan.

Towards fenceless boundaries for solar powered insect biobots.

PubMed

Latif, Tahmid; Whitmire, Eric; Novak, Tristan; Bozkurt, Alper

2014-01-01

Demonstration of remote navigation with instrumented insects, such as the Madagascar Hissing Cockroach, Gromphadorhina portentosa, has enabled the concept of biobotic agents for search and rescue missions and environmental monitoring applications. The biobots can form the nodes of a mobile sensor network to be established, for example, in unknown and dynamic environments after natural disasters to pinpoint surviving victims. We demonstrate here, for the first time, the concept of an invisible fence for insect biobots with an ultimate goal of keeping insect biobots within a certain distance of each other or a base station to ensure a reliable wireless network. For extended mission durations, this fenceless boundary would also be used to guide insects towards light sources for autonomous solar charging of their on-board batteries.

The Ultimate Strength of Double Hull Oil Tanker Due to Grounding and Collision

NASA Astrophysics Data System (ADS)

Izaak Latumahina, Samuel; Zubair Muis Alie, Muhammad; Sitepu, Ganding

2018-02-01

The damaged tanker by grounding and collision may totally collapse if loss its buoyancy, stability and suffer structural failure. The objective of the present study is to investigate the ultimate strength of double hull oil tanker under vertical bending moments due to grounding and collision. The damages are modelled by removing the elements consist of stiffened and unstiffened plates from the damages part. One-frame space of the double hull oil tanker is taken to be analysed. Two damages cases are considered in the analyses those are grounding and collision. The transversal damage extent for grounding are 10%, 25%, 40% and 55%. The groundings are placed at symmetric position on the outer bottom part. For the case of collision, the vertical damage extent are taken as 10%, 20%, 40% and 60%. The transversal damages extent is taken to be B/16 and it is constant for all collision damages. The investigation of the ultimate strength is performed by the Non-Linear Finite Element Analysis method under moment control. The boundary condition is applied with fully constrained on all nodes at the aft-end, while the rigid linked on all nodes is attached at the fore-end with respect to the reference point on the neutral axis. The initial imperfection, welding residual stress and crack are not considered in the analyses. The results obtained by Non-Linear Finite Element Analyses for the ultimate strength are compared with the in-house program using Smith’s method implemented in HULLST. The stress distribution and deformation for every case of damages including intact are also discussed in the present study.

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

PubMed Central

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

2014-01-01

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

A Practice Approach of Multi-source Geospatial Data Integration for Web-based Geoinformation Services

NASA Astrophysics Data System (ADS)

Huang, W.; Jiang, J.; Zha, Z.; Zhang, H.; Wang, C.; Zhang, J.

2014-04-01

Geospatial data resources are the foundation of the construction of geo portal which is designed to provide online geoinformation services for the government, enterprise and public. It is vital to keep geospatial data fresh, accurate and comprehensive in order to satisfy the requirements of application and development of geographic location, route navigation, geo search and so on. One of the major problems we are facing is data acquisition. For us, integrating multi-sources geospatial data is the mainly means of data acquisition. This paper introduced a practice integration approach of multi-source geospatial data with different data model, structure and format, which provided the construction of National Geospatial Information Service Platform of China (NGISP) with effective technical supports. NGISP is the China's official geo portal which provides online geoinformation services based on internet, e-government network and classified network. Within the NGISP architecture, there are three kinds of nodes: national, provincial and municipal. Therefore, the geospatial data is from these nodes and the different datasets are heterogeneous. According to the results of analysis of the heterogeneous datasets, the first thing we do is to define the basic principles of data fusion, including following aspects: 1. location precision; 2.geometric representation; 3. up-to-date state; 4. attribute values; and 5. spatial relationship. Then the technical procedure is researched and the method that used to process different categories of features such as road, railway, boundary, river, settlement and building is proposed based on the principles. A case study in Jiangsu province demonstrated the applicability of the principle, procedure and method of multi-source geospatial data integration.

Sentinel Node Mapping Using a Fluorescent Dye and Visible Light During Laparoscopic Gastrectomy for Early Gastric Cancer: Result of a Prospective Study From a Single Institute.

PubMed

Lee, Chang Min; Park, Sungsoo; Park, Seong-Heum; Jung, Sung Woo; Choe, Jung Wan; Sul, Ji-Young; Jang, You Jin; Mok, Young-Jae; Kim, Jong-Han

2017-04-01

The aim of this study was to investigate the feasibility of sentinel node mapping using a fluorescent dye and visible light in patients with gastric cancer. Recently, fluorescent imaging technology offers improved visibility with the possibility of better sensitivity or accuracy in sentinel node mapping. Twenty patients with early gastric cancer, for whom laparoscopic distal gastrectomy with standard lymphadenectomy had been planned, were enrolled in this study. Before lymphadenectomy, the patients received a gastrofiberoscopic peritumoral injection of fluorescein solution. The sentinel basin was investigated via laparoscopic fluorescent imaging under blue light (wavelength of 440-490 nm) emitted from an LED curing light. The detection rate and lymph node status were analyzed in the enrolled patients. In addition, short-term clinical outcomes were also investigated. No hypersensitivity to the dye was identified in any enrolled patients. Sentinel nodes were detected in 19 of 20 enrolled patients (95.0%), and metastatic lymph nodes were found in 2 patients. The latter lymph nodes belonged to the sentinel basin of each patient. Meanwhile, 1 patient (5.0%) experienced a postoperative complication that was unrelated to sentinel node mapping. No mortality was recorded among enrolled cases. Sentinel node mapping with visible light fluorescence was a feasible method for visualizing sentinel nodes in patients with early gastric cancer. In addition, this method is advantageous in terms of visualizing the concrete relationship between the sentinel nodes and surrounding structures.

Message passing with a limited number of DMA byte counters

DOEpatents

Blocksome, Michael [Rochester, MN; Chen, Dong [Croton on Hudson, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kumar, Sameer [White Plains, NY; Parker, Jeffrey J [Rochester, MN

2011-10-04

A method for passing messages in a parallel computer system constructed as a plurality of compute nodes interconnected as a network where each compute node includes a DMA engine but includes only a limited number of byte counters for tracking a number of bytes that are sent or received by the DMA engine, where the byte counters may be used in shared counter or exclusive counter modes of operation. The method includes using rendezvous protocol, a source compute node deterministically sending a request to send (RTS) message with a single RTS descriptor using an exclusive injection counter to track both the RTS message and message data to be sent in association with the RTS message, to a destination compute node such that the RTS descriptor indicates to the destination compute node that the message data will be adaptively routed to the destination node. Using one DMA FIFO at the source compute node, the RTS descriptors are maintained for rendezvous messages destined for the destination compute node to ensure proper message data ordering thereat. Using a reception counter at a DMA engine, the destination compute node tracks reception of the RTS and associated message data and sends a clear to send (CTS) message to the source node in a rendezvous protocol form of a remote get to accept the RTS message and message data and processing the remote get (CTS) by the source compute node DMA engine to provide the message data to be sent.

Virtual gap element approach for the treatment of non-matching interface using three-dimensional solid elements

NASA Astrophysics Data System (ADS)

Song, Yeo-Ul; Youn, Sung-Kie; Park, K. C.

2017-10-01

A method for three-dimensional non-matching interface treatment with a virtual gap element is developed. When partitioned structures contain curved interfaces and have different brick meshes, the discretized models have gaps along the interfaces. As these gaps bring unexpected errors, special treatments are required to handle the gaps. In the present work, a virtual gap element is introduced to link the frame and surface domain nodes in the frame work of the mortar method. Since the surface of the hexahedron element is quadrilateral, the gap element is pyramidal. The pyramidal gap element consists of four domain nodes and one frame node. Zero-strain condition in the gap element is utilized for the interpolation of frame nodes in terms of the domain nodes. This approach is taken to satisfy the momentum and energy conservation. The present method is applicable not only to curved interfaces with gaps, but also to flat interfaces in three dimensions. Several numerical examples are given to describe the effectiveness and accuracy of the proposed method.

An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

PubMed Central

Hasbullah, Halabi; Nazir, Babar; Khan, Imran Ali

2014-01-01

Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results. PMID:25152924

Intra-lymph node injection of biodegradable polymer particles.

PubMed

Andorko, James I; Tostanoski, Lisa H; Solano, Eduardo; Mukhamedova, Maryam; Jewell, Christopher M

2014-01-02

Generation of adaptive immune response relies on efficient drainage or trafficking of antigen to lymph nodes for processing and presentation of these foreign molecules to T and B lymphocytes. Lymph nodes have thus become critical targets for new vaccines and immunotherapies. A recent strategy for targeting these tissues is direct lymph node injection of soluble vaccine components, and clinical trials involving this technique have been promising. Several biomaterial strategies have also been investigated to improve lymph node targeting, for example, tuning particle size for optimal drainage of biomaterial vaccine particles. In this paper we present a new method that combines direct lymph node injection with biodegradable polymer particles that can be laden with antigen, adjuvant, or other vaccine components. In this method polymeric microparticles or nanoparticles are synthesized by a modified double emulsion protocol incorporating lipid stabilizers. Particle properties (e.g. size, cargo loading) are confirmed by laser diffraction and fluorescent microscopy, respectively. Mouse lymph nodes are then identified by peripheral injection of a nontoxic tracer dye that allows visualization of the target injection site and subsequent deposition of polymer particles in lymph nodes. This technique allows direct control over the doses and combinations of biomaterials and vaccine components delivered to lymph nodes and could be harnessed in the development of new biomaterial-based vaccines.

Color Filtering Localization for Three-Dimensional Underwater Acoustic Sensor Networks

PubMed Central

Liu, Zhihua; Gao, Han; Wang, Wuling; Chang, Shuai; Chen, Jiaxing

2015-01-01

Accurate localization of mobile nodes has been an important and fundamental problem in underwater acoustic sensor networks (UASNs). The detection information returned from a mobile node is meaningful only if its location is known. In this paper, we propose two localization algorithms based on color filtering technology called PCFL and ACFL. PCFL and ACFL aim at collaboratively accomplishing accurate localization of underwater mobile nodes with minimum energy expenditure. They both adopt the overlapping signal region of task anchors which can communicate with the mobile node directly as the current sampling area. PCFL employs the projected distances between each of the task projections and the mobile node, while ACFL adopts the direct distance between each of the task anchors and the mobile node. The proportion factor of distance is also proposed to weight the RGB values. By comparing the nearness degrees of the RGB sequences between the samples and the mobile node, samples can be filtered out. The normalized nearness degrees are considered as the weighted standards to calculate the coordinates of the mobile nodes. The simulation results show that the proposed methods have excellent localization performance and can localize the mobile node in a timely way. The average localization error of PCFL is decreased by about 30.4% compared to the AFLA method. PMID:25774706

Axillary lymph node recurrence after sentinel lymph node biopsy performed using a combination of indocyanine green fluorescence and the blue dye method in early breast cancer.

PubMed

Inoue, Tomoo; Nishi, Toshio; Nakano, Yoshiaki; Nishimae, Ayaka; Sawai, Yuka; Yamasaki, Masaru; Inaji, Hideo

2016-03-01

There is limited information on indocyanine green (ICG) fluorescence and blue dye for detecting sentinel lymph node (SLN) in early breast cancer. A retrospective study was conducted to assess the feasibility of an SLN biopsy using the combination of ICG fluorescence and the blue dye method. Seven hundred and fourteen patients with clinically node-negative breast cancer were included in this study. They underwent SLN biopsy using a combination of ICG fluorescence and the blue dye method from March 2007 to February 2014. The ICG (a fluorescence-emitting source) and patent blue (the blue dye) were injected into the patients' subareolar region. The removed lymph nodes that had ICG fluorescence and/or blue dye uptake were defined as SLNs. The results of the SLN biopsies and follow-up results of patients who underwent SLN biopsy alone were investigated. In 711 out of 714 patients, SLNs were identified by a combination of ICG fluorescence and the blue dye method (detection rate, 99.6 %). The average number of SLNs was 2.4 (range 1-7), and the average number of resected swollen para-SLNs was 0.4 (range 0-5). Ninety-nine patients with an SLN and/or para-SLN involvement during the intraoperative pathological diagnosis underwent axillary lymph node resection (ALND). In addition, two of three patients whose SLN was not identified also underwent ALND. In 46 of 101 patients with an ALND, non-SLN involvement was not found. Follow-up results were analyzed in 464 patients with invasive carcinoma excluding those with ductal carcinoma in situ (n = 148) and those who underwent ALND (n = 101). During the follow-up period (range 4.4-87.7 months; median, 38 months), two patients (0.4 %) developed axillary lymph node recurrence. They were successfully salvaged, and to date, no further locoregional recurrence has been observed. A high rate of SLN detection and low rate of axillary lymph node recurrence were confirmed by an SLN biopsy using a combination of ICG fluorescence and the blue dye method. Therefore, it is suggested that this method may replace the combination of dye and radioisotope methods.

Calculus domains modelled using an original bool algebra based on polygons

NASA Astrophysics Data System (ADS)

Oanta, E.; Panait, C.; Raicu, A.; Barhalescu, M.; Axinte, T.

2016-08-01

Analytical and numerical computer based models require analytical definitions of the calculus domains. The paper presents a method to model a calculus domain based on a bool algebra which uses solid and hollow polygons. The general calculus relations of the geometrical characteristics that are widely used in mechanical engineering are tested using several shapes of the calculus domain in order to draw conclusions regarding the most effective methods to discretize the domain. The paper also tests the results of several CAD commercial software applications which are able to compute the geometrical characteristics, being drawn interesting conclusions. The tests were also targeting the accuracy of the results vs. the number of nodes on the curved boundary of the cross section. The study required the development of an original software consisting of more than 1700 computer code lines. In comparison with other calculus methods, the discretization using convex polygons is a simpler approach. Moreover, this method doesn't lead to large numbers as the spline approximation did, in that case being required special software packages in order to offer multiple, arbitrary precision. The knowledge resulted from this study may be used to develop complex computer based models in engineering.

Monte Carlo-based fluorescence molecular tomography reconstruction method accelerated by a cluster of graphic processing units.

PubMed

Quan, Guotao; Gong, Hui; Deng, Yong; Fu, Jianwei; Luo, Qingming

2011-02-01

High-speed fluorescence molecular tomography (FMT) reconstruction for 3-D heterogeneous media is still one of the most challenging problems in diffusive optical fluorescence imaging. In this paper, we propose a fast FMT reconstruction method that is based on Monte Carlo (MC) simulation and accelerated by a cluster of graphics processing units (GPUs). Based on the Message Passing Interface standard, we modified the MC code for fast FMT reconstruction, and different Green's functions representing the flux distribution in media are calculated simultaneously by different GPUs in the cluster. A load-balancing method was also developed to increase the computational efficiency. By applying the Fréchet derivative, a Jacobian matrix is formed to reconstruct the distribution of the fluorochromes using the calculated Green's functions. Phantom experiments have shown that only 10 min are required to get reconstruction results with a cluster of 6 GPUs, rather than 6 h with a cluster of multiple dual opteron CPU nodes. Because of the advantages of high accuracy and suitability for 3-D heterogeneity media with refractive-index-unmatched boundaries from the MC simulation, the GPU cluster-accelerated method provides a reliable approach to high-speed reconstruction for FMT imaging.

Joint estimation of preferential attachment and node fitness in growing complex networks

NASA Astrophysics Data System (ADS)

Pham, Thong; Sheridan, Paul; Shimodaira, Hidetoshi

2016-09-01

Complex network growth across diverse fields of science is hypothesized to be driven in the main by a combination of preferential attachment and node fitness processes. For measuring the respective influences of these processes, previous approaches make strong and untested assumptions on the functional forms of either the preferential attachment function or fitness function or both. We introduce a Bayesian statistical method called PAFit to estimate preferential attachment and node fitness without imposing such functional constraints that works by maximizing a log-likelihood function with suitably added regularization terms. We use PAFit to investigate the interplay between preferential attachment and node fitness processes in a Facebook wall-post network. While we uncover evidence for both preferential attachment and node fitness, thus validating the hypothesis that these processes together drive complex network evolution, we also find that node fitness plays the bigger role in determining the degree of a node. This is the first validation of its kind on real-world network data. But surprisingly the rate of preferential attachment is found to deviate from the conventional log-linear form when node fitness is taken into account. The proposed method is implemented in the R package PAFit.

Joint estimation of preferential attachment and node fitness in growing complex networks

PubMed Central

Pham, Thong; Sheridan, Paul; Shimodaira, Hidetoshi

2016-01-01

Complex network growth across diverse fields of science is hypothesized to be driven in the main by a combination of preferential attachment and node fitness processes. For measuring the respective influences of these processes, previous approaches make strong and untested assumptions on the functional forms of either the preferential attachment function or fitness function or both. We introduce a Bayesian statistical method called PAFit to estimate preferential attachment and node fitness without imposing such functional constraints that works by maximizing a log-likelihood function with suitably added regularization terms. We use PAFit to investigate the interplay between preferential attachment and node fitness processes in a Facebook wall-post network. While we uncover evidence for both preferential attachment and node fitness, thus validating the hypothesis that these processes together drive complex network evolution, we also find that node fitness plays the bigger role in determining the degree of a node. This is the first validation of its kind on real-world network data. But surprisingly the rate of preferential attachment is found to deviate from the conventional log-linear form when node fitness is taken into account. The proposed method is implemented in the R package PAFit. PMID:27601314

Method and apparatus for offloading compute resources to a flash co-processing appliance

DOEpatents

Tzelnic, Percy; Faibish, Sorin; Gupta, Uday K.; Bent, John; Grider, Gary Alan; Chen, Hsing -bung

2015-10-13

Solid-State Drive (SSD) burst buffer nodes are interposed into a parallel supercomputing cluster to enable fast burst checkpoint of cluster memory to or from nearby interconnected solid-state storage with asynchronous migration between the burst buffer nodes and slower more distant disk storage. The SSD nodes also perform tasks offloaded from the compute nodes or associated with the checkpoint data. For example, the data for the next job is preloaded in the SSD node and very fast uploaded to the respective compute node just before the next job starts. During a job, the SSD nodes perform fast visualization and statistical analysis upon the checkpoint data. The SSD nodes can also perform data reduction and encryption of the checkpoint data.

Pacing a data transfer operation between compute nodes on a parallel computer

DOEpatents

Blocksome, Michael A [Rochester, MN

2011-09-13

Methods, systems, and products are disclosed for pacing a data transfer between compute nodes on a parallel computer that include: transferring, by an origin compute node, a chunk of an application message to a target compute node; sending, by the origin compute node, a pacing request to a target direct memory access (`DMA`) engine on the target compute node using a remote get DMA operation; determining, by the origin compute node, whether a pacing response to the pacing request has been received from the target DMA engine; and transferring, by the origin compute node, a next chunk of the application message if the pacing response to the pacing request has been received from the target DMA engine.

An interpolation-free ALE scheme for unsteady inviscid flows computations with large boundary displacements over three-dimensional adaptive grids

NASA Astrophysics Data System (ADS)

Re, B.; Dobrzynski, C.; Guardone, A.

2017-07-01

A novel strategy to solve the finite volume discretization of the unsteady Euler equations within the Arbitrary Lagrangian-Eulerian framework over tetrahedral adaptive grids is proposed. The volume changes due to local mesh adaptation are treated as continuous deformations of the finite volumes and they are taken into account by adding fictitious numerical fluxes to the governing equation. This peculiar interpretation enables to avoid any explicit interpolation of the solution between different grids and to compute grid velocities so that the Geometric Conservation Law is automatically fulfilled also for connectivity changes. The solution on the new grid is obtained through standard ALE techniques, thus preserving the underlying scheme properties, such as conservativeness, stability and monotonicity. The adaptation procedure includes node insertion, node deletion, edge swapping and points relocation and it is exploited both to enhance grid quality after the boundary movement and to modify the grid spacing to increase solution accuracy. The presented approach is assessed by three-dimensional simulations of steady and unsteady flow fields. The capability of dealing with large boundary displacements is demonstrated by computing the flow around the translating infinite- and finite-span NACA 0012 wing moving through the domain at the flight speed. The proposed adaptive scheme is applied also to the simulation of a pitching infinite-span wing, where the bi-dimensional character of the flow is well reproduced despite the three-dimensional unstructured grid. Finally, the scheme is exploited in a piston-induced shock-tube problem to take into account simultaneously the large deformation of the domain and the shock wave. In all tests, mesh adaptation plays a crucial role.

Contingency maneuver strategies for the Total Ozone Mapping Spectrometer-Earth Probe (TOMS-EP)

NASA Technical Reports Server (NTRS)

Kestler, James; Walls, Donna

1995-01-01

The Total Ozone Mapping Spectrometer-Earth Probe (TOMS-EP) is a polar-orbiting spacecraft designed to measure total ozone levels in the Earth's atmosphere. The nominal mission orbit is a 955-kilometer circular Sun-synchronous orbit with an ascending node mean local crossing time (MLT) between 11:02 a.m. and 11:25 a.m. These two mean local ascending node times constitute the boundaries of the MLT box for this mission. The MLT boundaries were chosen to maintain the Sun-to-Earth-to-vehicle orbit-normal (SVN) angle within a preselected set of seasonally independent boundaries. Because the SVN angle is seasonally dependent, but the MLT is not, contingency options for correcting the MLT of orbital states that fall outside of the required MLT range become time dependent. This paper focuses on contingency orbit adjustment strategies developed at the Goddard Space Flight Center (GSFC) Flight Dynamics Division (FDD) during the mission planning phase of TOMS-EP. Time-dependent delta-V strategies are presented for correcting mission orbit states lying outside of the MLT range. Typically, passive control of the MLT drift rate can be used to restore the orbit state to the required MLT before a seasonal violation of SVN angle constraints can occur. Passive control of the MLT drift rate is obtained through adjustment of the semimajor axis and/or the inclination. The time between initial arrival on orbit at an 'out-of-the box' MLT state and violation of the SVN angle constraints is always less than or equal to 1 year. The choice of which parameter(s) to adjust is dictated by the duration of this time period, the desired mission lifetime, the delta-V cost, and operational constraints.

A robust two-node, 13 moment quadrature method of moments for dilute particle flows including wall bouncing

NASA Astrophysics Data System (ADS)

Sun, Dan; Garmory, Andrew; Page, Gary J.

2017-02-01

For flows where the particle number density is low and the Stokes number is relatively high, as found when sand or ice is ingested into aircraft gas turbine engines, streams of particles can cross each other's path or bounce from a solid surface without being influenced by inter-particle collisions. The aim of this work is to develop an Eulerian method to simulate these types of flow. To this end, a two-node quadrature-based moment method using 13 moments is proposed. In the proposed algorithm thirteen moments of particle velocity, including cross-moments of second order, are used to determine the weights and abscissas of the two nodes and to set up the association between the velocity components in each node. Previous Quadrature Method of Moments (QMOM) algorithms either use more than two nodes, leading to increased computational expense, or are shown here to give incorrect results under some circumstances. This method gives the computational efficiency advantages of only needing two particle phase velocity fields whilst ensuring that a correct combination of weights and abscissas is returned for any arbitrary combination of particle trajectories without the need for any further assumptions. Particle crossing and wall bouncing with arbitrary combinations of angles are demonstrated using the method in a two-dimensional scheme. The ability of the scheme to include the presence of drag from a carrier phase is also demonstrated, as is bouncing off surfaces with inelastic collisions. The method is also applied to the Taylor-Green vortex flow test case and is found to give results superior to the existing two-node QMOM method and is in good agreement with results from Lagrangian modelling of this case.

Environmental Assessment for North Central Texas Relay Node Site NO. RN8C915TX

DTIC Science & Technology

1993-02-11

Relatively steep escarpments, reaching up to 20 percent in gradient , form boundaries between these incised river valleys and the surrounding plain...Pleistocene, approximately 11,500 to 7,500 years ago, when small bands composed of several families hunted megafauna such as bison and mammoth...conditions in the upper part Megafauna Large mammals such as bison and mammoths Native A generalized reference to an individual whose ancestry may be

Prediction of potential disease-associated microRNAs based on random walk.

PubMed

Xuan, Ping; Han, Ke; Guo, Yahong; Li, Jin; Li, Xia; Zhong, Yingli; Zhang, Zhaogong; Ding, Jian

2015-06-01

Identifying microRNAs associated with diseases (disease miRNAs) is helpful for exploring the pathogenesis of diseases. Because miRNAs fulfill function via the regulation of their target genes and because the current number of experimentally validated targets is insufficient, some existing methods have inferred potential disease miRNAs based on the predicted targets. It is difficult for these methods to achieve excellent performance due to the high false-positive and false-negative rates for the target prediction results. Alternatively, several methods have constructed a network composed of miRNAs based on their associated diseases and have exploited the information within the network to predict the disease miRNAs. However, these methods have failed to take into account the prior information regarding the network nodes and the respective local topological structures of the different categories of nodes. Therefore, it is essential to develop a method that exploits the more useful information to predict reliable disease miRNA candidates. miRNAs with similar functions are normally associated with similar diseases and vice versa. Therefore, the functional similarity between a pair of miRNAs is calculated based on their associated diseases to construct a miRNA network. We present a new prediction method based on random walk on the network. For the diseases with some known related miRNAs, the network nodes are divided into labeled nodes and unlabeled nodes, and the transition matrices are established for the two categories of nodes. Furthermore, different categories of nodes have different transition weights. In this way, the prior information of nodes can be completely exploited. Simultaneously, the various ranges of topologies around the different categories of nodes are integrated. In addition, how far the walker can go away from the labeled nodes is controlled by restarting the walking. This is helpful for relieving the negative effect of noisy data. For the diseases without any known related miRNAs, we extend the walking on a miRNA-disease bilayer network. During the prediction process, the similarity between diseases, the similarity between miRNAs, the known miRNA-disease associations and the topology information of the bilayer network are exploited. Moreover, the importance of information from different layers of network is considered. Our method achieves superior performance for 18 human diseases with AUC values ranging from 0.786 to 0.945. Moreover, case studies on breast neoplasms, lung neoplasms, prostatic neoplasms and 32 diseases further confirm the ability of our method to discover potential disease miRNAs. A web service for the prediction and analysis of disease miRNAs is available at http://bioinfolab.stx.hk/midp/. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Self-pacing direct memory access data transfer operations for compute nodes in a parallel computer

DOEpatents

Blocksome, Michael A

2015-02-17

Methods, apparatus, and products are disclosed for self-pacing DMA data transfer operations for nodes in a parallel computer that include: transferring, by an origin DMA on an origin node, a RTS message to a target node, the RTS message specifying an message on the origin node for transfer to the target node; receiving, in an origin injection FIFO for the origin DMA from a target DMA on the target node in response to transferring the RTS message, a target RGET descriptor followed by a DMA transfer operation descriptor, the DMA descriptor for transmitting a message portion to the target node, the target RGET descriptor specifying an origin RGET descriptor on the origin node that specifies an additional DMA descriptor for transmitting an additional message portion to the target node; processing, by the origin DMA, the target RGET descriptor; and processing, by the origin DMA, the DMA transfer operation descriptor.

Complex networks repair strategies: Dynamic models

NASA Astrophysics Data System (ADS)

Fu, Chaoqi; Wang, Ying; Gao, Yangjun; Wang, Xiaoyang

2017-09-01

Network repair strategies are tactical methods that restore the efficiency of damaged networks; however, unreasonable repair strategies not only waste resources, they are also ineffective for network recovery. Most extant research on network repair focuses on static networks, but results and findings on static networks cannot be applied to evolutionary dynamic networks because, in dynamic models, complex network repair has completely different characteristics. For instance, repaired nodes face more severe challenges, and require strategic repair methods in order to have a significant effect. In this study, we propose the Shell Repair Strategy (SRS) to minimize the risk of secondary node failures due to the cascading effect. Our proposed method includes the identification of a set of vital nodes that have a significant impact on network repair and defense. Our identification of these vital nodes reduces the number of switching nodes that face the risk of secondary failures during the dynamic repair process. This is positively correlated with the size of the average degree 〈 k 〉 and enhances network invulnerability.

Reducing power consumption while performing collective operations on a plurality of compute nodes

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Peters, Amanda E [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN

2011-10-18

Methods, apparatus, and products are disclosed for reducing power consumption while performing collective operations on a plurality of compute nodes that include: receiving, by each compute node, instructions to perform a type of collective operation; selecting, by each compute node from a plurality of collective operations for the collective operation type, a particular collective operation in dependence upon power consumption characteristics for each of the plurality of collective operations; and executing, by each compute node, the selected collective operation.

Anchor-free localization method for mobile targets in coal mine wireless sensor networks.

PubMed

Pei, Zhongmin; Deng, Zhidong; Xu, Shuo; Xu, Xiao

2009-01-01

Severe natural conditions and complex terrain make it difficult to apply precise localization in underground mines. In this paper, an anchor-free localization method for mobile targets is proposed based on non-metric multi-dimensional scaling (Multi-dimensional Scaling: MDS) and rank sequence. Firstly, a coal mine wireless sensor network is constructed in underground mines based on the ZigBee technology. Then a non-metric MDS algorithm is imported to estimate the reference nodes' location. Finally, an improved sequence-based localization algorithm is presented to complete precise localization for mobile targets. The proposed method is tested through simulations with 100 nodes, outdoor experiments with 15 ZigBee physical nodes, and the experiments in the mine gas explosion laboratory with 12 ZigBee nodes. Experimental results show that our method has better localization accuracy and is more robust in underground mines.

Embedding global and collective in a torus network with message class map based tree path selection

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

Chen, Dong; Coteus, Paul W.; Eisley, Noel A.

Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computermore » program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.« less

Apparatus and method supporting wireless access to multiple security layers in an industrial control and automation system or other system

DOEpatents

Chen, Yu-Gene T.

2013-04-16

A method includes receiving a message at a first wireless node. The first wireless node is associated with a first wired network, and the first wired network is associated with a first security layer. The method also includes transmitting the message over the first wired network when at least one destination of the message is located in the first security layer. The method further includes wirelessly transmitting the message for delivery to a second wireless node when at least one destination of the message is located in a second security layer. The second wireless node is associated with a second wired network, and the second wired network is associated with the second security layer. The first and second security layers may be associated with different security paradigms and/or different security domains. Also, the message could be associated with destinations in the first and second security layers.

Profiling an application for power consumption during execution on a plurality of compute nodes

DOEpatents

Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

2012-08-21

Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-03-16

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

The optimal community detection of software based on complex networks

NASA Astrophysics Data System (ADS)

Huang, Guoyan; Zhang, Peng; Zhang, Bing; Yin, Tengteng; Ren, Jiadong

2016-02-01

The community structure is important for software in terms of understanding the design patterns, controlling the development and the maintenance process. In order to detect the optimal community structure in the software network, a method Optimal Partition Software Network (OPSN) is proposed based on the dependency relationship among the software functions. First, by analyzing the information of multiple execution traces of one software, we construct Software Execution Dependency Network (SEDN). Second, based on the relationship among the function nodes in the network, we define Fault Accumulation (FA) to measure the importance of the function node and sort the nodes with measure results. Third, we select the top K(K=1,2,…) nodes as the core of the primal communities (only exist one core node). By comparing the dependency relationships between each node and the K communities, we put the node into the existing community which has the most close relationship. Finally, we calculate the modularity with different initial K to obtain the optimal division. With experiments, the method OPSN is verified to be efficient to detect the optimal community in various softwares.

A Simple Method for Estimating Informative Node Age Priors for the Fossil Calibration of Molecular Divergence Time Analyses

PubMed Central

Nowak, Michael D.; Smith, Andrew B.; Simpson, Carl; Zwickl, Derrick J.

2013-01-01

Molecular divergence time analyses often rely on the age of fossil lineages to calibrate node age estimates. Most divergence time analyses are now performed in a Bayesian framework, where fossil calibrations are incorporated as parametric prior probabilities on node ages. It is widely accepted that an ideal parameterization of such node age prior probabilities should be based on a comprehensive analysis of the fossil record of the clade of interest, but there is currently no generally applicable approach for calculating such informative priors. We provide here a simple and easily implemented method that employs fossil data to estimate the likely amount of missing history prior to the oldest fossil occurrence of a clade, which can be used to fit an informative parametric prior probability distribution on a node age. Specifically, our method uses the extant diversity and the stratigraphic distribution of fossil lineages confidently assigned to a clade to fit a branching model of lineage diversification. Conditioning this on a simple model of fossil preservation, we estimate the likely amount of missing history prior to the oldest fossil occurrence of a clade. The likelihood surface of missing history can then be translated into a parametric prior probability distribution on the age of the clade of interest. We show that the method performs well with simulated fossil distribution data, but that the likelihood surface of missing history can at times be too complex for the distribution-fitting algorithm employed by our software tool. An empirical example of the application of our method is performed to estimate echinoid node ages. A simulation-based sensitivity analysis using the echinoid data set shows that node age prior distributions estimated under poor preservation rates are significantly less informative than those estimated under high preservation rates. PMID:23755303

A mixed-penalty biphasic finite element formulation incorporating viscous fluids and material interfaces.

PubMed

Chan, B; Donzelli, P S; Spilker, R L

2000-06-01

The fluid viscosity term of the fluid phase constitutive equation and the interface boundary conditions between biphasic, solid and fluid domains have been incorporated into a mixed-penalty finite element formulation of the linear biphasic theory for hydrated soft tissue. The finite element code can now model a single-phase viscous incompressible fluid, or a single-phase elastic solid, as limiting cases of a biphasic material. Interface boundary conditions allow the solution of problems involving combinations of biphasic, fluid and solid regions. To incorporate these conditions, the volume-weighted mixture velocity is introduced as a degree of freedom at interface nodes so that the kinematic continuity conditions are satisfied by conventional finite element assembly techniques. Results comparing our numerical method with an independent, analytic solution for the problem of Couette flow over rigid and deformable porous biphasic layers show that the finite element code accurately predicts the viscous fluid flows and deformation in the porous biphasic region. Thus, the analysis can be used to model the interface between synovial fluid and articular cartilage in diarthrodial joints. This is an important step toward modeling and understanding the mechanisms of joint lubrication and another step toward fully modeling the in vivo behavior of a diarthrodial joint.

Efficient computation of k-Nearest Neighbour Graphs for large high-dimensional data sets on GPU clusters.

PubMed

Dashti, Ali; Komarov, Ivan; D'Souza, Roshan M

2013-01-01

This paper presents an implementation of the brute-force exact k-Nearest Neighbor Graph (k-NNG) construction for ultra-large high-dimensional data cloud. The proposed method uses Graphics Processing Units (GPUs) and is scalable with multi-levels of parallelism (between nodes of a cluster, between different GPUs on a single node, and within a GPU). The method is applicable to homogeneous computing clusters with a varying number of nodes and GPUs per node. We achieve a 6-fold speedup in data processing as compared with an optimized method running on a cluster of CPUs and bring a hitherto impossible [Formula: see text]-NNG generation for a dataset of twenty million images with 15 k dimensionality into the realm of practical possibility.

Network community structure and loop coefficient method

NASA Astrophysics Data System (ADS)

Vragović, I.; Louis, E.

2006-07-01

A modular structure, in which groups of tightly connected nodes could be resolved as separate entities, is a property that can be found in many complex networks. In this paper, we propose a algorithm for identifying communities in networks. It is based on a local measure, so-called loop coefficient that is a generalization of the clustering coefficient. Nodes with a large loop coefficient tend to be core inner community nodes, while other vertices are usually peripheral sites at the borders of communities. Our method gives satisfactory results for both artificial and real-world graphs, if they have a relatively pronounced modular structure. This type of algorithm could open a way of interpreting the role of nodes in communities in terms of the local loop coefficient, and could be used as a complement to other methods.

Parallel scalability of Hartree-Fock calculations

NASA Astrophysics Data System (ADS)

Chow, Edmond; Liu, Xing; Smelyanskiy, Mikhail; Hammond, Jeff R.

2015-03-01

Quantum chemistry is increasingly performed using large cluster computers consisting of multiple interconnected nodes. For a fixed molecular problem, the efficiency of a calculation usually decreases as more nodes are used, due to the cost of communication between the nodes. This paper empirically investigates the parallel scalability of Hartree-Fock calculations. The construction of the Fock matrix and the density matrix calculation are analyzed separately. For the former, we use a parallelization of Fock matrix construction based on a static partitioning of work followed by a work stealing phase. For the latter, we use density matrix purification from the linear scaling methods literature, but without using sparsity. When using large numbers of nodes for moderately sized problems, density matrix computations are network-bandwidth bound, making purification methods potentially faster than eigendecomposition methods.

Identifying failure in a tree network of a parallel computer

DOEpatents

Archer, Charles J.; Pinnow, Kurt W.; Wallenfelt, Brian P.

2010-08-24

Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

System and method for merging clusters of wireless nodes in a wireless network

DOEpatents

Budampati, Ramakrishna S [Maple Grove, MN; Gonia, Patrick S [Maplewood, MN; Kolavennu, Soumitri N [Blaine, MN; Mahasenan, Arun V [Kerala, IN

2012-05-29

A system includes a first cluster having multiple first wireless nodes. One first node is configured to act as a first cluster master, and other first nodes are configured to receive time synchronization information provided by the first cluster master. The system also includes a second cluster having one or more second wireless nodes. One second node is configured to act as a second cluster master, and any other second nodes configured to receive time synchronization information provided by the second cluster master. The system further includes a manager configured to merge the clusters into a combined cluster. One of the nodes is configured to act as a single cluster master for the combined cluster, and the other nodes are configured to receive time synchronization information provided by the single cluster master.

Physical mechanisms of longitudinal vortexes formation, appearance of zones with high heat fluxes and early transition in hypersonic flow over delta wing with blunted leading edges

NASA Astrophysics Data System (ADS)

Alexandrov, S. V.; Vaganov, A. V.; Shalaev, V. I.

2016-10-01

Processes of vortex structures formation and they interactions with the boundary layer in the hypersonic flow over delta wing with blunted leading edges are analyzed on the base of experimental investigations and numerical solutions of Navier-Stokes equations. Physical mechanisms of longitudinal vortexes formation, appearance of abnormal zones with high heat fluxes and early laminar turbulent transition are studied. These phenomena were observed in many high-speed wind tunnel experiments; however they were understood only using the detailed analysis of numerical modeling results with the high resolution. Presented results allowed explaining experimental phenomena. ANSYS CFX code (the DAFE MIPT license) on the grid with 50 million nodes was used for the numerical modeling. The numerical method was verified by comparison calculated heat flux distributions on the wing surface with experimental data.

SIERRA/Aero Theory Manual Version 4.46.

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

Sierra Thermal/Fluid Team

2017-09-01

SIERRA/Aero is a two and three dimensional, node-centered, edge-based finite volume code that approximates the compressible Navier-Stokes equations on unstructured meshes. It is applicable to inviscid and high Reynolds number laminar and turbulent flows. Currently, two classes of turbulence models are provided: Reynolds Averaged Navier-Stokes (RANS) and hybrid methods such as Detached Eddy Simulation (DES). Large Eddy Simulation (LES) models are currently under development. The gas may be modeled either as ideal, or as a non-equilibrium, chemically reacting mixture of ideal gases. This document describes the mathematical models contained in the code, as well as certain implementation details. First, themore » governing equations are presented, followed by a description of the spatial discretization. Next, the time discretization is described, and finally the boundary conditions. Throughout the document, SIERRA/ Aero is referred to simply as Aero for brevity.« less

SIERRA/Aero Theory Manual Version 4.44

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

Sierra Thermal /Fluid Team

2017-04-01

SIERRA/Aero is a two and three dimensional, node-centered, edge-based finite volume code that approximates the compressible Navier-Stokes equations on unstructured meshes. It is applicable to inviscid and high Reynolds number laminar and turbulent flows. Currently, two classes of turbulence models are provided: Reynolds Averaged Navier-Stokes (RANS) and hybrid methods such as Detached Eddy Simulation (DES). Large Eddy Simulation (LES) models are currently under development. The gas may be modeled either as ideal, or as a non-equilibrium, chemically reacting mixture of ideal gases. This document describes the mathematical models contained in the code, as well as certain implementation details. First, themore » governing equations are presented, followed by a description of the spatial discretization. Next, the time discretization is described, and finally the boundary conditions. Throughout the document, SIERRA/ Aero is referred to simply as Aero for brevity.« less

User's Guide for ENSAERO_FE Parallel Finite Element Solver

NASA Technical Reports Server (NTRS)

Eldred, Lloyd B.; Guruswamy, Guru P.

1999-01-01

A high fidelity parallel static structural analysis capability is created and interfaced to the multidisciplinary analysis package ENSAERO-MPI of Ames Research Center. This new module replaces ENSAERO's lower fidelity simple finite element and modal modules. Full aircraft structures may be more accurately modeled using the new finite element capability. Parallel computation is performed by breaking the full structure into multiple substructures. This approach is conceptually similar to ENSAERO's multizonal fluid analysis capability. The new substructure code is used to solve the structural finite element equations for each substructure in parallel. NASTRANKOSMIC is utilized as a front end for this code. Its full library of elements can be used to create an accurate and realistic aircraft model. It is used to create the stiffness matrices for each substructure. The new parallel code then uses an iterative preconditioned conjugate gradient method to solve the global structural equations for the substructure boundary nodes.

Ray tracing a three-dimensional scene using a hierarchical data structure

DOEpatents

Wald, Ingo; Boulos, Solomon; Shirley, Peter

2012-09-04

Ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. One example embodiment is a method for ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. In this example embodiment, the hierarchical data structure includes at least a parent node and a corresponding plurality of child nodes. The method includes a first act of determining that a first active ray in the packet hits the parent node and a second act of descending to each of the plurality of child nodes.

Biomechanics Simulations Using Cubic Hermite Meshes with Extraordinary Nodes for Isogeometric Cardiac Modeling

PubMed Central

Gonzales, Matthew J.; Sturgeon, Gregory; Segars, W. Paul; McCulloch, Andrew D.

2016-01-01

Cubic Hermite hexahedral finite element meshes have some well-known advantages over linear tetrahedral finite element meshes in biomechanical and anatomic modeling using isogeometric analysis. These include faster convergence rates as well as the ability to easily model rule-based anatomic features such as cardiac fiber directions. However, it is not possible to create closed complex objects with only regular nodes; these objects require the presence of extraordinary nodes (nodes with 3 or >= 5 adjacent elements in 2D) in the mesh. The presence of extraordinary nodes requires new constraints on the derivatives of adjacent elements to maintain continuity. We have developed a new method that uses an ensemble coordinate frame at the nodes and a local-to-global mapping to maintain continuity. In this paper, we make use of this mapping to create cubic Hermite models of the human ventricles and a four-chamber heart. We also extend the methods to the finite element equations to perform biomechanics simulations using these meshes. The new methods are validated using simple test models and applied to anatomically accurate ventricular meshes with valve annuli to simulate complete cardiac cycle simulations. PMID:27182096

A finite elements method to solve the Bloch–Torrey equation applied to diffusion magnetic resonance imaging

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

Nguyen, Dang Van; NeuroSpin, Bat145, Point Courrier 156, CEA Saclay Center, 91191 Gif-sur-Yvette Cedex; Li, Jing-Rebecca, E-mail: jingrebecca.li@inria.fr

2014-04-15

The complex transverse water proton magnetization subject to diffusion-encoding magnetic field gradient pulses in a heterogeneous medium can be modeled by the multiple compartment Bloch–Torrey partial differential equation (PDE). In addition, steady-state Laplace PDEs can be formulated to produce the homogenized diffusion tensor that describes the diffusion characteristics of the medium in the long time limit. In spatial domains that model biological tissues at the cellular level, these two types of PDEs have to be completed with permeability conditions on the cellular interfaces. To solve these PDEs, we implemented a finite elements method that allows jumps in the solution atmore » the cell interfaces by using double nodes. Using a transformation of the Bloch–Torrey PDE we reduced oscillations in the searched-for solution and simplified the implementation of the boundary conditions. The spatial discretization was then coupled to the adaptive explicit Runge–Kutta–Chebyshev time-stepping method. Our proposed method is second order accurate in space and second order accurate in time. We implemented this method on the FEniCS C++ platform and show time and spatial convergence results. Finally, this method is applied to study some relevant questions in diffusion MRI.« less

Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

DOEpatents

Archer, Charles J.; Faraj, Ahmad A.; Inglett, Todd A.; Ratterman, Joseph D.

2012-10-23

Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

Documentation and verification of VST2D; a model for simulating transient, Variably Saturated, coupled water-heat-solute Transport in heterogeneous, anisotropic 2-Dimensional, ground-water systems with variable fluid density

USGS Publications Warehouse

Friedel, Michael J.

2001-01-01

This report describes a model for simulating transient, Variably Saturated, coupled water-heatsolute Transport in heterogeneous, anisotropic, 2-Dimensional, ground-water systems with variable fluid density (VST2D). VST2D was developed to help understand the effects of natural and anthropogenic factors on quantity and quality of variably saturated ground-water systems. The model solves simultaneously for one or more dependent variables (pressure, temperature, and concentration) at nodes in a horizontal or vertical mesh using a quasi-linearized general minimum residual method. This approach enhances computational speed beyond the speed of a sequential approach. Heterogeneous and anisotropic conditions are implemented locally using individual element property descriptions. This implementation allows local principal directions to differ among elements and from the global solution domain coordinates. Boundary conditions can include time-varying pressure head (or moisture content), heat, and/or concentration; fluxes distributed along domain boundaries and/or at internal node points; and/or convective moisture, heat, and solute fluxes along the domain boundaries; and/or unit hydraulic gradient along domain boundaries. Other model features include temperature and concentration dependent density (liquid and vapor) and viscosity, sorption and/or decay of a solute, and capability to determine moisture content beyond residual to zero. These features are described in the documentation together with development of the governing equations, application of the finite-element formulation (using the Galerkin approach), solution procedure, mass and energy balance considerations, input requirements, and output options. The VST2D model was verified, and results included solutions for problems of water transport under isohaline and isothermal conditions, heat transport under isobaric and isohaline conditions, solute transport under isobaric and isothermal conditions, and coupled water-heat-solute transport. The first three problems considered in model verification were compared to either analytical or numerical solutions, whereas the coupled problem was compared to measured laboratory results for which no known analytic solutions or numerical models are available. The test results indicate the model is accurate and applicable for a wide range of conditions, including when water (liquid and vapor), heat (sensible and latent), and solute are coupled in ground-water systems. The cumulative residual errors for the coupled problem tested was less than 10-8 cubic centimeter per cubic centimeter, 10-5 moles per kilogram, and 102 calories per cubic meter for liquid water content, solute concentration and heat content, respectively. This model should be useful to hydrologists, engineers, and researchers interested in studying coupled processes associated with variably saturated transport in ground-water systems.

A Green Media Access Method for IEEE 802.15.6 Wireless Body Area Network.

PubMed

Jacob, Anil K; Jacob, Lillykutty

2017-09-30

It is of utmost importance to conserve battery energy to the maximum possible extent in WBAN nodes while collecting and transferring medical data. The IEEE 802.15.6 WBAN standard does not specify any method to conserve energy. This paper focuses on a method to conserve energy in IEEE 802.15.6 WBAN nodes when using CSMA/CA, while simultaneously restricting data delivery delay to the required value as specified in medical applications. The technique is to allow the nodes to sleep all the times except for receiving beacons and for transmitting data frames whenever a data frame enters an empty buffer. The energy consumed by the nodes and the average latency of data frame for periodical arrival of data are found out analytically. The analytical results are validated and also the proposed method is compared with other energy conserving schemes, using Castalia simulation studies. The proposed method shows superior performance in both device lifetime and latency of emergency medical data.

Further development of LLNA:DAE method as stand-alone skin-sensitization testing method and applied for evaluation of relative skin-sensitizing potency between chemicals.

PubMed

Yamashita, Kunihiko; Shinoda, Shinsuke; Hagiwara, Saori; Itagaki, Hiroshi

2015-04-01

To date, there has been no well-established local lymph node assay (LLNA) that includes an elicitation phase. Therefore, we developed a modified local lymph node assay with an elicitation phase (LLNA:DAE) to discriminate true skin sensitizers from chemicals that gave borderline positive results and previously reported this assay. To develop the LLNA:DAE method as a useful stand-alone testing method, we investigated the complete procedure for the LLNA:DAE method using hexyl cinnamic aldehyde (HCA), isoeugenol, and 2,4-dinitrochlorobenzene (DNCB) as test compounds. We defined the LLNA:DAE procedure as follows: in the dose-finding test, four concentrations of chemical applied to dorsum of the right ear on days 1, 2, and 3 and dorsum of both ears on day 10. Ear thickness and skin irritation score were measured on days 1, 3, 5, 10, and 12. Local lymph nodes were excised and weighed on day 12. The test dose for the primary LLNA:DAE study was selected as the dose that gave the highest left ear lymph node weight in the dose-finding study, or the lowest dose that produced a left ear lymph node of over 4 mg. This procedure was validated using nine different chemicals. Furthermore, qualitative relationship was observed between the degree of elicitation response in the left ear lymph node and the skin sensitizing potency of 32 chemicals tested in this study and the previous study. These results indicated that LLNA:DAE method was as first LLNA method that was able to evaluate the skin sensitizing potential and potency in elicitation response.

System and method for time synchronization in a wireless network

DOEpatents

Gonia, Patrick S.; Kolavennu, Soumitri N.; Mahasenan, Arun V.; Budampati, Ramakrishna S.

2010-03-30

A system includes multiple wireless nodes forming a cluster in a wireless network, where each wireless node is configured to communicate and exchange data wirelessly based on a clock. One of the wireless nodes is configured to operate as a cluster master. Each of the other wireless nodes is configured to (i) receive time synchronization information from a parent node, (ii) adjust its clock based on the received time synchronization information, and (iii) broadcast time synchronization information based on the time synchronization information received by that wireless node. The time synchronization information received by each of the other wireless nodes is based on time synchronization information provided by the cluster master so that the other wireless nodes substantially synchronize their clocks with the clock of the cluster master.

Broadcasting collective operation contributions throughout a parallel computer

DOEpatents

Faraj, Ahmad [Rochester, MN

2012-02-21

Methods, systems, and products are disclosed for broadcasting collective operation contributions throughout a parallel computer. The parallel computer includes a plurality of compute nodes connected together through a data communications network. Each compute node has a plurality of processors for use in collective parallel operations on the parallel computer. Broadcasting collective operation contributions throughout a parallel computer according to embodiments of the present invention includes: transmitting, by each processor on each compute node, that processor's collective operation contribution to the other processors on that compute node using intra-node communications; and transmitting on a designated network link, by each processor on each compute node according to a serial processor transmission sequence, that processor's collective operation contribution to the other processors on the other compute nodes using inter-node communications.

Centrally managed unified shared virtual address space

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

Wilkes, John

Systems, apparatuses, and methods for managing a unified shared virtual address space. A host may execute system software and manage a plurality of nodes coupled to the host. The host may send work tasks to the nodes, and for each node, the host may externally manage the node's view of the system's virtual address space. Each node may have a central processing unit (CPU) style memory management unit (MMU) with an internal translation lookaside buffer (TLB). In one embodiment, the host may be coupled to a given node via an input/output memory management unit (IOMMU) interface, where the IOMMU frontendmore » interface shares the TLB with the given node's MMU. In another embodiment, the host may control the given node's view of virtual address space via memory-mapped control registers.« less

Relation extraction for biological pathway construction using node2vec.

PubMed

Kim, Munui; Baek, Seung Han; Song, Min

2018-06-13

Systems biology is an important field for understanding whole biological mechanisms composed of interactions between biological components. One approach for understanding complex and diverse mechanisms is to analyze biological pathways. However, because these pathways consist of important interactions and information on these interactions is disseminated in a large number of biomedical reports, text-mining techniques are essential for extracting these relationships automatically. In this study, we applied node2vec, an algorithmic framework for feature learning in networks, for relationship extraction. To this end, we extracted genes from paper abstracts using pkde4j, a text-mining tool for detecting entities and relationships. Using the extracted genes, a co-occurrence network was constructed and node2vec was used with the network to generate a latent representation. To demonstrate the efficacy of node2vec in extracting relationships between genes, performance was evaluated for gene-gene interactions involved in a type 2 diabetes pathway. Moreover, we compared the results of node2vec to those of baseline methods such as co-occurrence and DeepWalk. Node2vec outperformed existing methods in detecting relationships in the type 2 diabetes pathway, demonstrating that this method is appropriate for capturing the relatedness between pairs of biological entities involved in biological pathways. The results demonstrated that node2vec is useful for automatic pathway construction.

The Influence of Total Nodes Examined, Number of Positive Nodes, and Lymph Node Ratio on Survival After Surgical Resection and Adjuvant Chemoradiation for Pancreatic Cancer: A Secondary Analysis of RTOG 9704

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

Showalter, Timothy N.; Winter, Kathryn A.; Berger, Adam C., E-mail: adam.berger@jefferson.edu

2011-12-01

Purpose: Lymph node status is an important predictor of survival in pancreatic cancer. We performed a secondary analysis of Radiation Therapy Oncology Group (RTOG) 9704, an adjuvant chemotherapy and chemoradiation trial, to determine the influence of lymph node factors-number of positive nodes (NPN), total nodes examined (TNE), and lymph node ratio (LNR ratio of NPN to TNE)-on OS and disease-free survival (DFS). Patient and Methods: Eligible patients from RTOG 9704 form the basis of this secondary analysis of lymph node parameters. Actuarial estimates for OS and DFS were calculated using Kaplan-Meier methods. Cox proportional hazards models were performed to evaluatemore » associations of NPN, TNE, and LNR with OS and DFS. Multivariate Cox proportional hazards models were also performed. Results: There were 538 patients enrolled in the RTOG 9704 trial. Of these, 445 patients were eligible with lymph nodes removed. Overall median NPN was 1 (min-max, 0-18). Increased NPN was associated with worse OS (HR = 1.06, p = 0.001) and DFS (HR = 1.05, p = 0.01). In multivariate analyses, both NPN and TNE were associated with OS and DFS. TNE > 12, and >15 were associated with increased OS for all patients, but not for node-negative patients (n = 142). Increased LNR was associated with worse OS (HR = 1.01, p < 0.0001) and DFS (HR = 1.006, p = 0.002). Conclusion: In patients who undergo surgical resection followed by adjuvant chemoradiation, TNE, NPN, and LNR are associated with OS and DFS. This secondary analysis of a prospective, cooperative group trial supports the influence of these lymph node parameters on outcomes after surgery and adjuvant therapy using contemporary techniques.« less

Intraoperative Fluorescence Imaging for Detection of Sentinel Lymph Nodes and Lymphatic Vessels during Open Prostatectomy using Indocyanine Green.

PubMed

Yuen, Keiji; Miura, Tetsuya; Sakai, Iori; Kiyosue, Akiko; Yamashita, Masuo

2015-08-01

We investigated the feasibility and validity of intraoperative fluorescence imaging using indocyanine green for the detection of sentinel lymph nodes and lymphatic vessels during open prostatectomy. Indocyanine green was injected into the prostate under transrectal ultrasound guidance just before surgery. Intraoperative fluorescence imaging was performed using a near-infrared camera system in 66 consecutive patients with clinically localized prostate cancer after a 10-patient pilot test to optimize indocyanine green dosing, observation timing and injection method. Lymphatic vessels were visualized and followed to identify the sentinel lymph nodes. Confirmatory pelvic lymph node dissection including all fluorescent nodes and open radical prostatectomy were performed in all patients. Lymphatic vessels were successfully visualized in 65 patients (98%) and sentinel lymph nodes in 64 patients (97%). Sentinel lymph nodes were located in the obturator fossa, internal and external iliac regions, and rarely in the common iliac and presacral regions. A median of 4 sentinel lymph nodes per patient was detected. Three lymphatic pathways, the paravesical, internal and lateral routes, were identified. Pathological examination revealed metastases to 9 sentinel lymph nodes in 6 patients (9%). All pathologically positive lymph nodes were detected as sentinel lymph nodes using this imaging. No adverse reactions due to the use of indocyanine green were observed. Intraoperative fluorescence imaging using indocyanine green during open prostatectomy enables the detection of lymphatic vessels and sentinel lymph nodes with high sensitivity. This novel method is technically feasible, safe and easy to apply with minimal additional operative time. Copyright © 2015 American Urological Association Education and Research, Inc. Published by Elsevier Inc. All rights reserved.

Improvement of the sentinel lymph node detection rate of cervical sentinel lymph node biopsy using real-time fluorescence navigation with indocyanine green in head and neck skin cancer.

PubMed

Nakamura, Yasuhiro; Fujisawa, Yasuhiro; Nakamura, Yoshiyuki; Maruyama, Hiroshi; Furuta, Jun-ichi; Kawachi, Yasuhiro; Otsuka, Fujio

2013-06-01

The standard technique using lymphoscintigraphy, blue dye and a gamma probe has established a reliable method for sentinel node biopsy for skin cancer. However, the detection rate of cervical sentinel lymph nodes (SLN) is generally lower than that of inguinal or axillary SLN because of the complexity of lymphatic drainage in the head and neck region and the "shine-through" phenomenon. Recently, indocyanine green fluorescence imaging has been reported as a new method to detect SLN. We hypothesized that fluorescence navigation with indocyanine green in combination with the standard technique would improve the detection rate of cervical sentinel nodes. We performed cervical sentinel node biopsies using the standard technique in 20 basins of 18 patients (group A) and using fluorescence navigation in combination with the standard technique in 12 basins of 16 patients (group B). The mean number of sentinel nodes was two per basin (range, 1-4) in group A and three per basin (range, 1-5) in group B. The detection rate of sentinel nodes was 83% (29/35) in group A and 95% (36/38) in group B. The false-negative rate was 6% (1/18 patients) in group A and 0% in group B. Fluorescence navigation with indocyanine green may improve the cervical sentinel node detection rate. However, greater collection of data regarding the usefulness of cervical sentinel node biopsy using indocyanine green is necessary. © 2013 Japanese Dermatological Association.

[Comparison of two quantitative methods of endobronchial ultrasound real-time elastography for evaluating intrathoracic lymph nodes].

PubMed

Mao, X W; Yang, J Y; Zheng, X X; Wang, L; Zhu, L; Li, Y; Xiong, H K; Sun, J Y

2017-06-12

Objective: To compare the clinical value of two quantitative methods in analyzing endobronchial ultrasound real-time elastography (EBUS-RTE) images for evaluating intrathoracic lymph nodes. Methods: From January 2014 to April 2014, EBUS-RTE examination was performed in patients who received EBUS-TBNA examination in Shanghai Chest Hospital. Each intrathoracic lymph node had a selected EBUS-RTE image. Stiff area ratio and mean hue value of region of interest (ROI) in each image were calculated respectively. The final diagnosis of lymph node was based on the pathologic/microbiologic results of EBUS-TBNA, pathologic/microbiologic results of other examinations and clinical following-up. The sensitivity, specificity, positive predictive value, negative predictive value and accuracy were evaluated for distinguishing malignant and benign lesions. Results: Fifty-six patients and 68 lymph nodes were enrolled in this study, of which 35 lymph nodes were malignant and 33 lymph nodes were benign. The stiff area ratio and mean hue value of benign and malignant lesions were 0.32±0.29, 0.62±0.20 and 109.99±28.13, 141.62±17.52, respectively, and statistical differences were found in both of those two methods ( t =-5.14, P <0.01; t =-5.53, P <0.01). The area under curves was 0.813, 0.814 in stiff area ratio and mean hue value, respectively. The optimal diagnostic cut-off value of stiff area ratio was 0.48, and the sensitivity, specificity, positive predictive value, negative predictive value and accuracy were 82.86%, 81.82%, 82.86%, 81.82% and 82.35%, respectively. The optimal diagnostic cut-off value of mean hue value was 126.28, and the sensitivity, specificity, positive predictive value, negative predictive value and accuracy were 85.71%, 75.76%, 78.95%, 83.33% and 80.88%, respectively. Conclusion: Both the stiff area ratio and mean hue value methods can be used for analyzing EBUS-RTE images quantitatively, having the value of differentiating benign and malignant intrathoracic lymph nodes, and the stiff area ratio is better than the mean hue value between the two methods.

Automatic mediastinal lymph node detection in chest CT

NASA Astrophysics Data System (ADS)

Feuerstein, Marco; Deguchi, Daisuke; Kitasaka, Takayuki; Iwano, Shingo; Imaizumi, Kazuyoshi; Hasegawa, Yoshinori; Suenaga, Yasuhito; Mori, Kensaku

2009-02-01

Computed tomography (CT) of the chest is a very common staging investigation for the assessment of mediastinal, hilar, and intrapulmonary lymph nodes in the context of lung cancer. In the current clinical workflow, the detection and assessment of lymph nodes is usually performed manually, which can be error-prone and timeconsuming. We therefore propose a method for the automatic detection of mediastinal, hilar, and intrapulmonary lymph node candidates in contrast-enhanced chest CT. Based on the segmentation of important mediastinal anatomy (bronchial tree, aortic arch) and making use of anatomical knowledge, we utilize Hessian eigenvalues to detect lymph node candidates. As lymph nodes can be characterized as blob-like structures of varying size and shape within a specific intensity interval, we can utilize these characteristics to reduce the number of false positive candidates significantly. We applied our method to 5 cases suspected to have lung cancer. The processing time of our algorithm did not exceed 6 minutes, and we achieved an average sensitivity of 82.1% and an average precision of 13.3%.

Sentinel nodes identified by computed tomography-lymphography accurately stage the axilla in patients with breast cancer

PubMed Central

2013-01-01

Background Sentinel node biopsy often results in the identification and removal of multiple nodes as sentinel nodes, although most of these nodes could be non-sentinel nodes. This study investigated whether computed tomography-lymphography (CT-LG) can distinguish sentinel nodes from non-sentinel nodes and whether sentinel nodes identified by CT-LG can accurately stage the axilla in patients with breast cancer. Methods This study included 184 patients with breast cancer and clinically negative nodes. Contrast agent was injected interstitially. The location of sentinel nodes was marked on the skin surface using a CT laser light navigator system. Lymph nodes located just under the marks were first removed as sentinel nodes. Then, all dyed nodes or all hot nodes were removed. Results The mean number of sentinel nodes identified by CT-LG was significantly lower than that of dyed and/or hot nodes removed (1.1 vs 1.8, p <0.0001). Twenty-three (12.5%) patients had ≥2 sentinel nodes identified by CT-LG removed, whereas 94 (51.1%) of patients had ≥2 dyed and/or hot nodes removed (p <0.0001). Pathological evaluation demonstrated that 47 (25.5%) of 184 patients had metastasis to at least one node. All 47 patients demonstrated metastases to at least one of the sentinel nodes identified by CT-LG. Conclusions CT-LG can distinguish sentinel nodes from non-sentinel nodes, and sentinel nodes identified by CT-LG can accurately stage the axilla in patients with breast cancer. Successful identification of sentinel nodes using CT-LG may facilitate image-based diagnosis of metastasis, possibly leading to the omission of sentinel node biopsy. PMID:24321242

An improved network model for railway traffic

NASA Astrophysics Data System (ADS)

Li, Keping; Ma, Xin; Shao, Fubo

In railway traffic, safety analysis is a key issue for controlling train operation. Here, the identification and order of key factors are very important. In this paper, a new network model is constructed for analyzing the railway safety, in which nodes are regarded as causation factors and links represent possible relationships among those factors. Our aim is to give all these nodes an importance order, and to find the in-depth relationship among these nodes including how failures spread among them. Based on the constructed network model, we propose a control method to ensure the safe state by setting each node a threshold. As the results, by protecting the Hub node of the constructed network, the spreading of railway accident can be controlled well. The efficiency of such a method is further tested with the help of numerical example.

Link failure detection in a parallel computer

DOEpatents

Archer, Charles J.; Blocksome, Michael A.; Megerian, Mark G.; Smith, Brian E.

2010-11-09

Methods, apparatus, and products are disclosed for link failure detection in a parallel computer including compute nodes connected in a rectangular mesh network, each pair of adjacent compute nodes in the rectangular mesh network connected together using a pair of links, that includes: assigning each compute node to either a first group or a second group such that adjacent compute nodes in the rectangular mesh network are assigned to different groups; sending, by each of the compute nodes assigned to the first group, a first test message to each adjacent compute node assigned to the second group; determining, by each of the compute nodes assigned to the second group, whether the first test message was received from each adjacent compute node assigned to the first group; and notifying a user, by each of the compute nodes assigned to the second group, whether the first test message was received.

General framework for dynamic large deformation contact problems based on phantom-node X-FEM

NASA Astrophysics Data System (ADS)

Broumand, P.; Khoei, A. R.

2018-04-01

This paper presents a general framework for modeling dynamic large deformation contact-impact problems based on the phantom-node extended finite element method. The large sliding penalty contact formulation is presented based on a master-slave approach which is implemented within the phantom-node X-FEM and an explicit central difference scheme is used to model the inertial effects. The method is compared with conventional contact X-FEM; advantages, limitations and implementational aspects are also addressed. Several numerical examples are presented to show the robustness and accuracy of the proposed method.

Complex Network Simulation of Forest Network Spatial Pattern in Pearl River Delta

NASA Astrophysics Data System (ADS)

Zeng, Y.

2017-09-01

Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network's power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network's degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network's main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc.) for networking a standard and base datum.

Fuzzy-Logic Based Distributed Energy-Efficient Clustering Algorithm for Wireless Sensor Networks.

PubMed

Zhang, Ying; Wang, Jun; Han, Dezhi; Wu, Huafeng; Zhou, Rundong

2017-07-03

Due to the high-energy efficiency and scalability, the clustering routing algorithm has been widely used in wireless sensor networks (WSNs). In order to gather information more efficiently, each sensor node transmits data to its Cluster Head (CH) to which it belongs, by multi-hop communication. However, the multi-hop communication in the cluster brings the problem of excessive energy consumption of the relay nodes which are closer to the CH. These nodes' energy will be consumed more quickly than the farther nodes, which brings the negative influence on load balance for the whole networks. Therefore, we propose an energy-efficient distributed clustering algorithm based on fuzzy approach with non-uniform distribution (EEDCF). During CHs' election, we take nodes' energies, nodes' degree and neighbor nodes' residual energies into consideration as the input parameters. In addition, we take advantage of Takagi, Sugeno and Kang (TSK) fuzzy model instead of traditional method as our inference system to guarantee the quantitative analysis more reasonable. In our scheme, each sensor node calculates the probability of being as CH with the help of fuzzy inference system in a distributed way. The experimental results indicate EEDCF algorithm is better than some current representative methods in aspects of data transmission, energy consumption and lifetime of networks.

Node degree distribution in spanning trees

NASA Astrophysics Data System (ADS)

Pozrikidis, C.

2016-03-01

A method is presented for computing the number of spanning trees involving one link or a specified group of links, and excluding another link or a specified group of links, in a network described by a simple graph in terms of derivatives of the spanning-tree generating function defined with respect to the eigenvalues of the Kirchhoff (weighted Laplacian) matrix. The method is applied to deduce the node degree distribution in a complete or randomized set of spanning trees of an arbitrary network. An important feature of the proposed method is that the explicit construction of spanning trees is not required. It is shown that the node degree distribution in the spanning trees of the complete network is described by the binomial distribution. Numerical results are presented for the node degree distribution in square, triangular, and honeycomb lattices.

Effective one-dimensional images of arterial trees in the cardiovascular system

NASA Astrophysics Data System (ADS)

Kozlov, V. A.; Nazarov, S. A.

2017-03-01

An exponential smallness of the errors in the one-dimensional model of the Stokes flow in a branching thin vessel with rigid walls is achieved by introducing effective lengths of the one-dimensional image of internodal fragments of vessels. Such lengths are eluated through the pressure-drop matrix at each node describing the boundary-layer phenomenon. The medical interpretation and the accessible generalizations of the result, in particular, for the Navier-Stokes equations are presented.

Unstructured 3D Delaunay mesh generation applied to planes, trains and automobiles

NASA Technical Reports Server (NTRS)

Blake, Kenneth R.; Spragle, Gregory S.

1993-01-01

Technical issues associated with domain-tessellation production, including initial boundary node triangulation and volume mesh refinement, are presented for the 'TGrid' 3D Delaunay unstructured grid generation program. The approach employed is noted to be capable of preserving predefined triangular surface facets in the final tessellation. The capabilities of the approach are demonstrated by generating grids about an entire fighter aircraft configuration, a train, and a wind tunnel model of an automobile.

Electromigration Reliability of Advanced Interconnects

NASA Astrophysics Data System (ADS)

Hu, C.-K.; Gignac, L. M.; Baker-O'Neal, B.; Liniger, E.; Yu, R.; Flaitz, P.; Stamper, A. K.

2007-10-01

Electromigration behavior in Cu damascene wires was studied for various metal line widths, thicknesses and grain sizes where the grain size was modulated by Cu linewidth and thickness, and by adjusting the wafer annealing process step after Cu electroplating and before Cu chemical mechanical polishing. Significantly different results were found between 0.2 μm and 65 nm CMOS node technologies. A larger variation of Cu grain size between the samples was achieved on 65 nm node which was due to the finer line width and thinner metal thickness. The Cu lifetime and mass flow in samples with bamboo, near bamboo, bamboo-polycrystalline mixture, and polycrystalline grain structures were measured. These factors allow one to accurately resolve the relative contribution between grain boundary and interface diffusions in the Cu nanowires. The electromigration mass flow estimated from the lifetime on the test line on a W via and physically stable liner was found to be linearly proportional to current density. The effects of Cu(Ti) alloy seeds and Cu surface pre-clean techniques before the dielectric cap depositions on Cu electromigration were also observed. A significantly improved Cu lifetime, at the expense of the Cu conductivity, was found. The electromigration activation energies for Cu in Cu(Ti) alloy, along Cu/amorphous a-SiCxNyHz interface and in Cu grain boundaries were found to be 1.3, 0.95 and 0.79+0.05 eV, respectively.

Bad data packet capture device

DOEpatents

Chen, Dong; Gara, Alan; Heidelberger, Philip; Vranas, Pavlos

2010-04-20

An apparatus and method for capturing data packets for analysis on a network computing system includes a sending node and a receiving node connected by a bi-directional communication link. The sending node sends a data transmission to the receiving node on the bi-directional communication link, and the receiving node receives the data transmission and verifies the data transmission to determine valid data and invalid data and verify retransmissions of invalid data as corresponding valid data. A memory device communicates with the receiving node for storing the invalid data and the corresponding valid data. A computing node communicates with the memory device and receives and performs an analysis of the invalid data and the corresponding valid data received from the memory device.

Innovative research of AD HOC network mobility model

NASA Astrophysics Data System (ADS)

Chen, Xin

2017-08-01

It is difficult for researchers of AD HOC network to conduct actual deployment during experimental stage as the network topology is changeable and location of nodes is unfixed. Thus simulation still remains the main research method of the network. Mobility model is an important component of AD HOC network simulation. It is used to describe the movement pattern of nodes in AD HOC network (including location and velocity, etc.) and decides the movement trail of nodes, playing as the abstraction of the movement modes of nodes. Therefore, mobility model which simulates node movement is an important foundation for simulation research. In AD HOC network research, mobility model shall reflect the movement law of nodes as truly as possible. In this paper, node generally refers to the wireless equipment people carry. The main research contents include how nodes avoid obstacles during movement process and the impacts of obstacles on the mutual relation among nodes, based on which a Node Self Avoiding Obstacle, i.e. NASO model is established in AD HOC network.

Global tree network for computing structures enabling global processing operations

DOEpatents

Blumrich; Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

2010-01-19

A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

CAPRI: A Geometric Foundation for Computational Analysis and Design

NASA Technical Reports Server (NTRS)

Haimes, Robert

2006-01-01

CAPRI is a software building tool-kit that refers to two ideas; (1) A simplified, object-oriented, hierarchical view of a solid part integrating both geometry and topology definitions, and (2) programming access to this part or assembly and any attached data. A complete definition of the geometry and application programming interface can be found in the document CAPRI: Computational Analysis PRogramming Interface appended to this report. In summary the interface is subdivided into the following functional components: 1. Utility routines -- These routines include the initialization of CAPRI, loading CAD parts and querying the operational status as well as closing the system down. 2. Geometry data-base queries -- This group of functions allow all top level applications to figure out and get detailed information on any geometric component in the Volume definition. 3. Point queries -- These calls allow grid generators, or solvers doing node adaptation, to snap points directly onto geometric entities. 4. Calculated or geometrically derived queries -- These entry points calculate data from the geometry to aid in grid generation. 5. Boundary data routines -- This part of CAPRI allows general data to be attached to Boundaries so that the boundary conditions can be specified and stored within CAPRI s data-base. 6. Tag based routines -- This part of the API allows the specification of properties associated with either the Volume (material properties) or Boundary (surface properties) entities. 7. Geometry based interpolation routines -- This part of the API facilitates Multi-disciplinary coupling and allows zooming through Boundary Attachments. 8. Geometric creation and manipulation -- These calls facilitate constructing simple solid entities and perform the Boolean solid operations. Geometry constructed in this manner has the advantage that if the data is kept consistent with the CAD package, therefore a new design can be incorporated directly and is manufacturable. 9. Master Model access This addition to the API allows for the querying of the parameters and dimensions of the model. The feature tree is also exposed so it is easy to see where the parameters are applied. Calls exist to allow for the modification of the parameters and the suppression/unsuppression of nodes in the tree. Part regeneration is performed by a single API call and a new part becomes available within CAPRI (if the regeneration was successful). This is described in a separate document. Components 1-7 are considered the CAPRI base level reader.

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

DOEpatents

Faraj, Ahmad [Rochester, MN

2012-04-17

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer. Each compute node includes at least two processing cores. Each processing core has contribution data for the allreduce operation. Performing an allreduce operation on a plurality of compute nodes of a parallel computer includes: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node; performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; and performing, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node.

Wireless Sensor Node for Autonomous Monitoring and Alerts in Remote Environments

NASA Technical Reports Server (NTRS)

Panangadan, Anand V. (Inventor); Monacos, Steve P. (Inventor)

2015-01-01

A method, apparatus, system, and computer program products provides personal alert and tracking capabilities using one or more nodes. Each node includes radio transceiver chips operating at different frequency ranges, a power amplifier, sensors, a display, and embedded software. The chips enable the node to operate as either a mobile sensor node or a relay base station node while providing a long distance relay link between nodes. The power amplifier enables a line-of-sight communication between the one or more nodes. The sensors provide a GPS signal, temperature, and accelerometer information (used to trigger an alert condition). The embedded software captures and processes the sensor information, provides a multi-hop packet routing protocol to relay the sensor information to and receive alert information from a command center, and to display the alert information on the display.

GPU-accelerated element-free reverse-time migration with Gauss points partition

NASA Astrophysics Data System (ADS)

Zhou, Zhen; Jia, Xiaofeng; Qiang, Xiaodong

2018-06-01

An element-free method (EFM) has been demonstrated successfully in elasticity, heat conduction and fatigue crack growth problems. We present the theory of EFM and its numerical applications in seismic modelling and reverse time migration (RTM). Compared with the finite difference method and the finite element method, the EFM has unique advantages: (1) independence of grids in computation and (2) lower expense and more flexibility (because only the information of the nodes and the boundary of the concerned area is required). However, in EFM, due to improper computation and storage of some large sparse matrices, such as the mass matrix and the stiffness matrix, the method is difficult to apply to seismic modelling and RTM for a large velocity model. To solve the problem of storage and computation efficiency, we propose a concept of Gauss points partition and utilise the graphics processing unit to improve the computational efficiency. We employ the compressed sparse row format to compress the intermediate large sparse matrices and attempt to simplify the operations by solving the linear equations with CULA solver. To improve the computation efficiency further, we introduce the concept of the lumped mass matrix. Numerical experiments indicate that the proposed method is accurate and more efficient than the regular EFM.

Monitoring Traffic Information with a Developed Acceleration Sensing Node.

PubMed

Ye, Zhoujing; Wang, Linbing; Xu, Wen; Gao, Zhifei; Yan, Guannan

2017-12-05

In this paper, an acceleration sensing node for pavement vibration was developed to monitor traffic information, including vehicle speed, vehicle types, and traffic flow, where a hardware design with low energy consumption and node encapsulation could be accomplished. The service performance of the sensing node was evaluated, by methods including waterproof test, compression test, sensing performance analysis, and comparison test. The results demonstrate that the sensing node is low in energy consumption, high in strength, IPX8 waterproof, and high in sensitivity and resolution. These characteristics can be applied to practical road environments. Two sensing nodes were spaced apart in the direction of travelling. In the experiment, three types of vehicles passed by the monitoring points at several different speeds and values of d (the distance between the sensor and the nearest tire center line). Based on cross-correlation with kernel pre-smoothing, a calculation method was applied to process the raw data. New algorithms for traffic flow, speed, and axle length were proposed. Finally, the effects of vehicle speed, vehicle weight, and d value on acceleration amplitude were statistically evaluated. It was found that the acceleration sensing node can be used for traffic flow, vehicle speed, and other types of monitoring.

Monitoring Traffic Information with a Developed Acceleration Sensing Node

PubMed Central

Ye, Zhoujing; Wang, Linbing; Xu, Wen; Gao, Zhifei; Yan, Guannan

2017-01-01

In this paper, an acceleration sensing node for pavement vibration was developed to monitor traffic information, including vehicle speed, vehicle types, and traffic flow, where a hardware design with low energy consumption and node encapsulation could be accomplished. The service performance of the sensing node was evaluated, by methods including waterproof test, compression test, sensing performance analysis, and comparison test. The results demonstrate that the sensing node is low in energy consumption, high in strength, IPX8 waterproof, and high in sensitivity and resolution. These characteristics can be applied to practical road environments. Two sensing nodes were spaced apart in the direction of travelling. In the experiment, three types of vehicles passed by the monitoring points at several different speeds and values of d (the distance between the sensor and the nearest tire center line). Based on cross-correlation with kernel pre-smoothing, a calculation method was applied to process the raw data. New algorithms for traffic flow, speed, and axle length were proposed. Finally, the effects of vehicle speed, vehicle weight, and d value on acceleration amplitude were statistically evaluated. It was found that the acceleration sensing node can be used for traffic flow, vehicle speed, and other types of monitoring. PMID:29206169

Predicting Node Degree Centrality with the Node Prominence Profile

PubMed Central

Yang, Yang; Dong, Yuxiao; Chawla, Nitesh V.

2014-01-01

Centrality of a node measures its relative importance within a network. There are a number of applications of centrality, including inferring the influence or success of an individual in a social network, and the resulting social network dynamics. While we can compute the centrality of any node in a given network snapshot, a number of applications are also interested in knowing the potential importance of an individual in the future. However, current centrality is not necessarily an effective predictor of future centrality. While there are different measures of centrality, we focus on degree centrality in this paper. We develop a method that reconciles preferential attachment and triadic closure to capture a node's prominence profile. We show that the proposed node prominence profile method is an effective predictor of degree centrality. Notably, our analysis reveals that individuals in the early stage of evolution display a distinctive and robust signature in degree centrality trend, adequately predicted by their prominence profile. We evaluate our work across four real-world social networks. Our findings have important implications for the applications that require prediction of a node's future degree centrality, as well as the study of social network dynamics. PMID:25429797

Study of hypervelocity meteoroid impact on orbital space stations

NASA Technical Reports Server (NTRS)

Leimbach, K. R.; Prozan, R. J.

1973-01-01

Structural damage resulting in hypervelocity impact of a meteorite on a spacecraft is discussed. Of particular interest is the backside spallation caused by such a collision. To treat this phenomenon two numerical schemes were developed in the course of this study to compute the elastic-plastic flow fracture of a solid. The numerical schemes are a five-point finite difference scheme and a four-node finite element scheme. The four-node finite element scheme proved to be less sensitive to the type of boundary conditions and loadings. Although further development work is needed to improve the program versatility (generalization of the network topology, secondary storage for large systems, improving of the coding to reduce the run time, etc.), the basic framework is provided for a utilitarian computer program which may be used in a wide variety of situations. Analytic results showing the program output are given for several test cases.

CAPRI (Computational Analysis PRogramming Interface): A Solid Modeling Based Infra-Structure for Engineering Analysis and Design Simulations

NASA Technical Reports Server (NTRS)

Haimes, Robert; Follen, Gregory J.

1998-01-01

CAPRI is a CAD-vendor neutral application programming interface designed for the construction of analysis and design systems. By allowing access to the geometry from within all modules (grid generators, solvers and post-processors) such tasks as meshing on the actual surfaces, node enrichment by solvers and defining which mesh faces are boundaries (for the solver and visualization system) become simpler. The overall reliance on file 'standards' is minimized. This 'Geometry Centric' approach makes multi-physics (multi-disciplinary) analysis codes much easier to build. By using the shared (coupled) surface as the foundation, CAPRI provides a single call to interpolate grid-node based data from the surface discretization in one volume to another. Finally, design systems are possible where the results can be brought back into the CAD system (and therefore manufactured) because all geometry construction and modification are performed using the CAD system's geometry kernel.

Astronomers Without Borders: An IYA2009 Organizational Node Dedicated to Connecting Groups Worldwide

NASA Astrophysics Data System (ADS)

Simmons, M.

2008-11-01

Astronomers Without Borders (AWB) is a new global organization and IYA2009 Organizational Node dedicated to furthering understanding and goodwill across national and cultural boundaries using the universal appeal of astronomy. The AWB network of Affiliates will bring together up to 1000 astronomy clubs, magazines and other organizations involved in astronomy. IYA2009 projects include The World at Night, a Special IYA2009 Project, and coordination of the 100 Hours of Astronomy Global Cornerstone Project. Sharing Telescopes and Resources (STAR) gathers surplus and new equipment in developed countries and donates them to clubs in undeveloped countries, with follow-up programs meant to ensure the best use of the equipment. The AWB website will serve as the basis for all programs including forums, galleries, video conferences and other relationship-building activities. AWB will continue and grow for many years beyond the end of IYA2009.

Iodine-131: An Effective Method for Treating Lymph Node Metastases of Differentiated Thyroid Cancer.

PubMed

He, Ying; Pan, Ming-Zhi; Huang, Jian-Min; Xie, Peng; Zhang, Fang; Wei, Ling-Ge

2016-12-15

BACKGROUND The aim of this study was to assess the efficacy of radioactive iodine-131 (¹³¹I) therapy for lymph node metastasis of differentiated thyroid cancer (DTC) and to identify influential factors using univariate and multivariate analyses to determine if identified factors influence the efficacy of treatment. MATERIAL AND METHODS This study included a retrospective review of 218 patients with histologically proven DTC in the post-operation stage. After thyroid tissue remnants were eliminated with ¹³¹I therapy, patients' lymph node status was confirmed by ultrasound and by ¹³¹I whole body scan regarding lymph node metastasis, and then patients were treated with ¹³¹I as appropriate. The treatment efficacy was assessed and possible influencing factors were identified using univariate and multivariate analyses. RESULTS The total effective rate of ¹³¹I therapy was 88.07% (including a cure rate of 20.64% and an improvement rate of 67.43%). The non-effective rate was 11.93%. Of the total 406 lymph nodes of 218 patients, 319 lymph nodes (78.57%) were judged to be effectively cured, including 133 (32.75%) lymph nodes that were totally eliminated and 186 (45.82%) lymph nodes that shrank. Eighty-seven (21.43%) of the 406 lymph nodes had no obvious change. No lymph nodes were found to be in a continuously enlarging state. Distant metastasis, size of lymph node, human serum thyroglobulin (HTG) level, and condition of thyroid remnants ablation were identified as the independent factors influencing the efficacy of treatment using univariate and multivariate analyses. CONCLUSIONS The use of ¹³¹I is a promising treatment for lymph node metastasis of DCT. Distant metastasis, size of lymph nodes, HTG level, and condition of thyroid remnant ablation were independent factors influencing the treatment efficacy.

A multi-sensor RSS spatial sensing-based robust stochastic optimization algorithm for enhanced wireless tethering.

PubMed

Parasuraman, Ramviyas; Fabry, Thomas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel

2014-12-12

The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the "server-relay-client" framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions.

A Multi-Sensor RSS Spatial Sensing-Based Robust Stochastic Optimization Algorithm for Enhanced Wireless Tethering

PubMed Central

Parasuraman, Ramviyas; Fabry, Thomas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel

2014-01-01

The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the “server-relay-client” framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions. PMID:25615734

Endobronchial ultrasound-guided transbronchial needle aspiration for lung cancer staging: early experience in Brazil*,**

PubMed Central

Figueiredo, Viviane Rossi; Cardoso, Paulo Francisco Guerreiro; Jacomelli, Márcia; Demarzo, Sérgio Eduardo; Palomino, Addy Lidvina Mejia; Rodrigues, Ascédio José; Terra, Ricardo Mingarini; Pego-Fernandes, Paulo Manoel; Carvalho, Carlos Roberto Ribeiro

2015-01-01

Objective: Endobronchial ultrasound-guided transbronchial needle aspiration (EBUS-TBNA) is a minimally invasive, safe and accurate method for collecting samples from mediastinal and hilar lymph nodes. This study focused on the initial results obtained with EBUS-TBNA for lung cancer and lymph node staging at three teaching hospitals in Brazil. Methods: This was a retrospective analysis of patients diagnosed with lung cancer and submitted to EBUS-TBNA for mediastinal lymph node staging. The EBUS-TBNA procedures, which involved the use of an EBUS scope, an ultrasound processor, and a compatible, disposable 22 G needle, were performed while the patients were under general anesthesia. Results: Between January of 2011 and January of 2014, 149 patients underwent EBUS-TBNA for lymph node staging. The mean age was 66 ± 12 years, and 58% were male. A total of 407 lymph nodes were sampled by EBUS-TBNA. The most common types of lung neoplasm were adenocarcinoma (in 67%) and squamous cell carcinoma (in 24%). For lung cancer staging, EBUS-TBNA was found to have a sensitivity of 96%, a specificity of 100%, and a negative predictive value of 85%. Conclusions: We found EBUS-TBNA to be a safe and accurate method for lymph node staging in lung cancer patients. PMID:25750671

Multiple network alignment via multiMAGNA+.

PubMed

Vijayan, Vipin; Milenkovic, Tijana

2017-08-21

Network alignment (NA) aims to find a node mapping that identifies topologically or functionally similar network regions between molecular networks of different species. Analogous to genomic sequence alignment, NA can be used to transfer biological knowledge from well- to poorly-studied species between aligned network regions. Pairwise NA (PNA) finds similar regions between two networks while multiple NA (MNA) can align more than two networks. We focus on MNA. Existing MNA methods aim to maximize total similarity over all aligned nodes (node conservation). Then, they evaluate alignment quality by measuring the amount of conserved edges, but only after the alignment is constructed. Directly optimizing edge conservation during alignment construction in addition to node conservation may result in superior alignments. Thus, we present a novel MNA method called multiMAGNA++ that can achieve this. Indeed, multiMAGNA++ outperforms or is on par with existing MNA methods, while often completing faster than existing methods. That is, multiMAGNA++ scales well to larger network data and can be parallelized effectively. During method evaluation, we also introduce new MNA quality measures to allow for more fair MNA method comparison compared to the existing alignment quality measures. MultiMAGNA++ code is available on the method's web page at http://nd.edu/~cone/multiMAGNA++/.

Maximizing the Spread of Influence via Generalized Degree Discount.

PubMed

Wang, Xiaojie; Zhang, Xue; Zhao, Chengli; Yi, Dongyun

2016-01-01

It is a crucial and fundamental issue to identify a small subset of influential spreaders that can control the spreading process in networks. In previous studies, a degree-based heuristic called DegreeDiscount has been shown to effectively identify multiple influential spreaders and has severed as a benchmark method. However, the basic assumption of DegreeDiscount is not adequate, because it treats all the nodes equally without any differences. To consider a general situation in real world networks, a novel heuristic method named GeneralizedDegreeDiscount is proposed in this paper as an effective extension of original method. In our method, the status of a node is defined as a probability of not being influenced by any of its neighbors, and an index generalized discounted degree of one node is presented to measure the expected number of nodes it can influence. Then the spreaders are selected sequentially upon its generalized discounted degree in current network. Empirical experiments are conducted on four real networks, and the results show that the spreaders identified by our approach are more influential than several benchmark methods. Finally, we analyze the relationship between our method and three common degree-based methods.

Decomposition method for fast computation of gigapixel-sized Fresnel holograms on a graphics processing unit cluster.

PubMed

Jackin, Boaz Jessie; Watanabe, Shinpei; Ootsu, Kanemitsu; Ohkawa, Takeshi; Yokota, Takashi; Hayasaki, Yoshio; Yatagai, Toyohiko; Baba, Takanobu

2018-04-20

A parallel computation method for large-size Fresnel computer-generated hologram (CGH) is reported. The method was introduced by us in an earlier report as a technique for calculating Fourier CGH from 2D object data. In this paper we extend the method to compute Fresnel CGH from 3D object data. The scale of the computation problem is also expanded to 2 gigapixels, making it closer to real application requirements. The significant feature of the reported method is its ability to avoid communication overhead and thereby fully utilize the computing power of parallel devices. The method exhibits three layers of parallelism that favor small to large scale parallel computing machines. Simulation and optical experiments were conducted to demonstrate the workability and to evaluate the efficiency of the proposed technique. A two-times improvement in computation speed has been achieved compared to the conventional method, on a 16-node cluster (one GPU per node) utilizing only one layer of parallelism. A 20-times improvement in computation speed has been estimated utilizing two layers of parallelism on a very large-scale parallel machine with 16 nodes, where each node has 16 GPUs.

Maximizing the Spread of Influence via Generalized Degree Discount

PubMed Central

Wang, Xiaojie; Zhang, Xue; Zhao, Chengli; Yi, Dongyun

2016-01-01

It is a crucial and fundamental issue to identify a small subset of influential spreaders that can control the spreading process in networks. In previous studies, a degree-based heuristic called DegreeDiscount has been shown to effectively identify multiple influential spreaders and has severed as a benchmark method. However, the basic assumption of DegreeDiscount is not adequate, because it treats all the nodes equally without any differences. To consider a general situation in real world networks, a novel heuristic method named GeneralizedDegreeDiscount is proposed in this paper as an effective extension of original method. In our method, the status of a node is defined as a probability of not being influenced by any of its neighbors, and an index generalized discounted degree of one node is presented to measure the expected number of nodes it can influence. Then the spreaders are selected sequentially upon its generalized discounted degree in current network. Empirical experiments are conducted on four real networks, and the results show that the spreaders identified by our approach are more influential than several benchmark methods. Finally, we analyze the relationship between our method and three common degree-based methods. PMID:27732681

The 2011 Tohoku-oki Earthquake related to a large velocity gradient within the Pacific plate

NASA Astrophysics Data System (ADS)

Matsubara, Makoto; Obara, Kazushige

2015-04-01

We conduct seismic tomography using arrival time data picked by the high sensitivity seismograph network (Hi-net) operated by National Research Institute for Earth Science and Disaster Prevention (NIED). We used earthquakes off the coast outside the seismic network around the source region of the 2011 Tohoku-oki Earthquake with the centroid depth estimated from moment tensor inversion by NIED F-net (broadband seismograph network) as well as earthquakes within the seismic network determined by Hi-net. The target region, 20-48N and 120-148E, covers the Japanese Islands from Hokkaido to Okinawa. A total of manually picked 4,622,346 P-wave and 3,062,846 S-wave arrival times for 100,733 earthquakes recorded at 1,212 stations from October 2000 to August 2009 is available for use in the tomographic method. In the final iteration, we estimate the P-wave slowness at 458,234 nodes and the S-wave slowness at 347,037 nodes. The inversion reduces the root mean square of the P-wave traveltime residual from 0.455 s to 0.187 s and that of the S-wave data from 0.692 s to 0.228 s after eight iterations (Matsubara and Obara, 2011). Centroid depths are determined using a Green's function approach (Okada et al., 2004) such as in NIED F-net. For the events distant from the seismic network, the centroid depth is more reliable than that determined by NIED Hi-net, since there are no stations above the hypocenter. We determine the upper boundary of the Pacific plate based on the velocity structure and earthquake hypocentral distribution. The upper boundary of the low-velocity (low-V) oceanic crust corresponds to the plate boundary where thrust earthquakes are expected to occur. Where we do not observe low-V oceanic crust, we determine the upper boundary of the upper layer of the double seismic zone within high-V Pacific plate. We assume the depth at the Japan Trench as 7 km. We can investigate the velocity structure within the Pacific plate such as 10 km beneath the plate boundary since the rays from the hypocenter around the coseismic region of the Tohoku-oki earthquake take off downward and pass through the Pacific plate. The landward low-V zone with a large anomaly corresponds to the western edge of the coseismic slip zone of the 2011 Tohoku-oki earthquake. The initial break point (hypocenter) is associated with the edge of a slightly low-V and low-Vp/Vs zone corresponding to the boundary of the low- and high-V zone. The trenchward low-V and low-Vp/Vs zone extending southwestward from the hypocenter may indicate the existence of a subducted seamount. The high-V zone and low-Vp/Vs zone might have accumulated the strain and resulted in the huge coseismic slip zone of the 2011 Tohoku earthquake. The low-V and low-Vp/Vs zone is a slight fluctuation within the high-V zone and might have acted as the initial break point of the 2011 Tohoku earthquake. Reference Matsubara, M. and K. Obara (2011) The 2011 Off the Pacific Coast of Tohoku earthquake related to a strong velocity gradient with the Pacific plate, Earth Planets Space, 63, 663-667. Okada, Y., K. Kasahara, S. Hori, K. Obara, S. Sekiguchi, H. Fujiwara, and A. Yamamoto (2004) Recent progress of seismic observation networks in Japan-Hi-net, F-net, K-NET and KiK-net, Research News Earth Planets Space, 56, xv-xxviii.

Simplified Dynamic Analysis of Grinders Spindle Node

NASA Astrophysics Data System (ADS)

Demec, Peter

2014-12-01

The contribution deals with the simplified dynamic analysis of surface grinding machine spindle node. Dynamic analysis is based on the use of the transfer matrix method, which is essentially a matrix form of method of initial parameters. The advantage of the described method, despite the seemingly complex mathematical apparatus, is primarily, that it does not require for solve the problem of costly commercial software using finite element method. All calculations can be made for example in MS Excel, which is advantageous especially in the initial stages of constructing of spindle node for the rapid assessment of the suitability its design. After detailing the entire structure of spindle node is then also necessary to perform the refined dynamic analysis in the environment of FEM, which it requires the necessary skills and experience and it is therefore economically difficult. This work was developed within grant project KEGA No. 023TUKE-4/2012 Creation of a comprehensive educational - teaching material for the article Production technique using a combination of traditional and modern information technology and e-learning.

Assessing node risk and vulnerability in epidemics on networks

NASA Astrophysics Data System (ADS)

Rogers, T.

2015-01-01

Which nodes are most vulnerable to an epidemic spreading through a network, and which carry the highest risk of causing a major outbreak if they are the source of the infection? Here we show how these questions can be answered to good approximation using the cavity method. Several curious properties of node vulnerability and risk are explored: some nodes are more vulnerable than others to weaker infections, yet less vulnerable to stronger ones; a node is always more likely to be caught in an outbreak than it is to start one, except when the disease has a deterministic lifetime; the rank order of node risk depends on the details of the distribution of infectious periods.

Reducing power consumption during execution of an application on a plurality of compute nodes

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Peters, Amanda E [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN

2012-06-05

Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: executing, by each compute node, an application, the application including power consumption directives corresponding to one or more portions of the application; identifying, by each compute node, the power consumption directives included within the application during execution of the portions of the application corresponding to those identified power consumption directives; and reducing power, by each compute node, to one or more components of that compute node according to the identified power consumption directives during execution of the portions of the application corresponding to those identified power consumption directives.

Method and apparatus for analyzing error conditions in a massively parallel computer system by identifying anomalous nodes within a communicator set

DOEpatents

Gooding, Thomas Michael [Rochester, MN

2011-04-19

An analytical mechanism for a massively parallel computer system automatically analyzes data retrieved from the system, and identifies nodes which exhibit anomalous behavior in comparison to their immediate neighbors. Preferably, anomalous behavior is determined by comparing call-return stack tracebacks for each node, grouping like nodes together, and identifying neighboring nodes which do not themselves belong to the group. A node, not itself in the group, having a large number of neighbors in the group, is a likely locality of error. The analyzer preferably presents this information to the user by sorting the neighbors according to number of adjoining members of the group.

Vital nodes identification in complex networks

NASA Astrophysics Data System (ADS)

Lü, Linyuan; Chen, Duanbing; Ren, Xiao-Long; Zhang, Qian-Ming; Zhang, Yi-Cheng; Zhou, Tao

2016-09-01

Real networks exhibit heterogeneous nature with nodes playing far different roles in structure and function. To identify vital nodes is thus very significant, allowing us to control the outbreak of epidemics, to conduct advertisements for e-commercial products, to predict popular scientific publications, and so on. The vital nodes identification attracts increasing attentions from both computer science and physical societies, with algorithms ranging from simply counting the immediate neighbors to complicated machine learning and message passing approaches. In this review, we clarify the concepts and metrics, classify the problems and methods, as well as review the important progresses and describe the state of the art. Furthermore, we provide extensive empirical analyses to compare well-known methods on disparate real networks, and highlight the future directions. In spite of the emphasis on physics-rooted approaches, the unification of the language and comparison with cross-domain methods would trigger interdisciplinary solutions in the near future.

Analysis of Network Vulnerability Under Joint Node and Link Attacks

NASA Astrophysics Data System (ADS)

Li, Yongcheng; Liu, Shumei; Yu, Yao; Cao, Ting

2018-03-01

The security problem of computer network system is becoming more and more serious. The fundamental reason is that there are security vulnerabilities in the network system. Therefore, it’s very important to identify and reduce or eliminate these vulnerabilities before they are attacked. In this paper, we are interested in joint node and link attacks and propose a vulnerability evaluation method based on the overall connectivity of the network to defense this attack. Especially, we analyze the attack cost problem from the attackers’ perspective. The purpose is to find the set of least costs for joint links and nodes, and their deletion will lead to serious network connection damage. The simulation results show that the vulnerable elements obtained from the proposed method are more suitable for the attacking idea of the malicious persons in joint node and link attack. It is easy to find that the proposed method has more realistic protection significance.

Digital map of aquifer boundary for the High Plains aquifer in parts of Colorado, Kansas, Nebraska, New Mexico, Oklahoma, South Dakota, Texas, and Wyoming

USGS Publications Warehouse

Qi, Sharon

2010-01-01

This digital data set represents the extent of the High Plains aquifer in the central United States. The extent of the High Plains aquifer covers 174,000 square miles in eight states: Colorado, Kansas, Nebraska, New Mexico, Oklahoma, South Dakota, Texas, and Wyoming. This data set represents a compilation of information from digital and paper sources and personal communication. This boundary is an update to the boundary published in U.S. Geological Survey Professional Paper 1400-B, and this report supersedes Open-File Report 99-267. The purpose of this data set is to refine and update the extent of the High Plains aquifer based on currently available information. This data set represents a compilation of arcs from a variety of sources and scales that represent the 174,000 square-mile extent of the High Plains aquifer within the eight states. Where updated information was not available, the original boundary extent defined by OFR 99-267 was retained. The citations for the sources in each State are listed in the 00README.txt file. The boundary also contains internal polygons, or 'islands', that represent the areas within the aquifer boundary where the aquifer is not present due to erosion or non-deposition. The datasets that pertain to this report can be found on the U.S. Geological Survey's NSDI (National Spatial Data Infrastructure) Node, the links are provided on the sidebar.

General method to find the attractors of discrete dynamic models of biological systems.

PubMed

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

General method to find the attractors of discrete dynamic models of biological systems

NASA Astrophysics Data System (ADS)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

What Is a False Negative Sentinel Node Biopsy: Definition, Reasons and Ways to Minimize It?

PubMed

Kataria, Kamal; Srivastava, Anurag; Qaiser, Darakhshan

2016-10-01

Sentinel node biopsy helps in assessing the involvement of axillary lymph node without the morbidity of full axillary lymph node dissection, namely arm and shoulder pain, paraesthesia and lymphoedema. The various methods described in the literature identify the sentinel lymph nodes in approximately 96 % of cases and associated with a false negativity rate of 5 to 10 %. A false negative sentinel node is defined as the proportion of cases in whom sentinel node biopsy is reported as negative, but the rest of axillary lymph node(s) harbours cancer cells. The possible causes of a false negative sentinel lymph node may be because of blocked lymphatics either by cancer cells or following fibrosis of previous surgery/radiotherapy, and an alternative pathway opens draining the blue dye or isotope to another uninvolved node . The other reasons may be two lymphatic pathways for a tumour area, the one opening to a superficial node and the other in deep nodes. Sometimes, lymphatics do not relay into a node but traverse it going to a higher node. In some patients, the microscopic focus of metastasis inside a lymph node is so small-micrometastasis (i.e. between 0.2 and 2 mm) or isolated tumour cells (i.e. less than 0.2 mm) that is missed by the pathologist. The purpose of this review is to clear some fears lurking in the mind of most surgeons about the false negative sentinel lymph node (FNSLN).

Sentinel node biopsy before neoadjuvant chemotherapy spares breast cancer patients axillary lymph node dissection.

PubMed

van Rijk, Maartje C; Nieweg, Omgo E; Rutgers, Emiel J T; Oldenburg, Hester S A; Olmos, Renato Valdés; Hoefnagel, Cornelis A; Kroon, Bin B R

2006-04-01

Neoadjuvant chemotherapy in breast cancer patients is a valuable method to determine the efficacy of chemotherapy and potentially downsize the primary tumor, which facilitates breast-conserving therapy. In 18 studies published about sentinel node biopsy after neoadjuvant chemotherapy, the sentinel node was identified in on average 89%, and the false-negative rate was on average 10%. Because of these mediocre results, no author dares to omit axillary clearance just yet. In our institute, sentinel lymph node biopsy is performed before neoadjuvant chemotherapy. The aim of this study was to evaluate our experience with this approach. Sentinel node biopsy was performed before neoadjuvant chemotherapy in 25 T2N0 patients by using lymphoscintigraphy, a gamma ray detection probe, and patent blue dye. Axillary lymph node dissection was performed after chemotherapy if the sentinel node contained metastases. Ten patients had a tumor-positive axillary sentinel node, and one patient had an involved lateral intramammary node. Four patients had additional involved nodes in the completion lymph node dissection specimen. The other 14 patients (56%) had a tumor-negative sentinel node and did not undergo axillary lymph node dissection. No recurrences have been observed after a median follow-up of 18 months. Fourteen (56%) of the 25 patients were spared axillary lymph node dissection when the sentinel node was found to be disease free. Performing sentinel node biopsy before neoadjuvant chemotherapy seems successful and reliable in patients with T2N0 breast cancer.

Dedicated heterogeneous node scheduling including backfill scheduling

DOEpatents

Wood, Robert R [Livermore, CA; Eckert, Philip D [Livermore, CA; Hommes, Gregg [Pleasanton, CA

2006-07-25

A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

Chaining direct memory access data transfer operations for compute nodes in a parallel computer

DOEpatents

Archer, Charles J.; Blocksome, Michael A.

2010-09-28

Methods, systems, and products are disclosed for chaining DMA data transfer operations for compute nodes in a parallel computer that include: receiving, by an origin DMA engine on an origin node in an origin injection FIFO buffer for the origin DMA engine, a RGET data descriptor specifying a DMA transfer operation data descriptor on the origin node and a second RGET data descriptor on the origin node, the second RGET data descriptor specifying a target RGET data descriptor on the target node, the target RGET data descriptor specifying an additional DMA transfer operation data descriptor on the origin node; creating, by the origin DMA engine, an RGET packet in dependence upon the RGET data descriptor, the RGET packet containing the DMA transfer operation data descriptor and the second RGET data descriptor; and transferring, by the origin DMA engine to a target DMA engine on the target node, the RGET packet.