Modification of Prim’s algorithm on complete broadcasting graph

NASA Astrophysics Data System (ADS)

Dairina; Arif, Salmawaty; Munzir, Said; Halfiani, Vera; Ramli, Marwan

2017-09-01

Broadcasting is an information dissemination from one object to another object through communication between two objects in a network. Broadcasting for n objects can be solved by n - 1 communications and minimum time unit defined by ⌈2log n⌉ In this paper, weighted graph broadcasting is considered. The minimum weight of a complete broadcasting graph will be determined. Broadcasting graph is said to be complete if every vertex is connected. Thus to determine the minimum weight of complete broadcasting graph is equivalent to determine the minimum spanning tree of a complete graph. The Kruskal’s and Prim’s algorithm will be used to determine the minimum weight of a complete broadcasting graph regardless the minimum time unit ⌈2log n⌉ and modified Prim’s algorithm for the problems of the minimum time unit ⌈2log n⌉ is done. As an example case, here, the training of trainer problem is solved using these algorithms.

San Nicolas Island surface radiation-meteorology data

NASA Technical Reports Server (NTRS)

Johnson-Pasqua, Christopher M.; Cox, Stephen K.

1990-01-01

A summary of the surface data collected by Colorado State University (CSU) on San Nicolas Island during the First ISCCP Regional Experiment (FIRE) from 30 June (Julian Day 181) through 19 July (Julian Day 200) is given. The data are available in two formats: hard copy graphs, and processed data on floppy disk.

The Versatility of Photo CD Technology in the Classroom.

ERIC Educational Resources Information Center

Mustoe, Myles

The Kodak Photo CD (compact disk) system provides a fun, new, very accessible way to integrate images into geography classroom presentations. Graphicacy deals with spatial information that can only be expressed by a graph, map, or photograph. The importance for geography students to develop visual observation and graphic interpretive skills is…

Cool Stars May Have Different Prebiotic Chemical Mix

NASA Technical Reports Server (NTRS)

2009-01-01

NASA's Spitzer Space Telescope detected a prebiotic, or potentially life-forming, molecule called hydrogen cyanide (HCN) in the planet-forming disks around yellow stars like our sun, but not in the disks around cooler, reddish stars.

The observations are plotted in this graph, called a spectrum, in which light from the gas in the disks around the stars has been split up into its basic components, or wavelengths. Data from stars like our sun are yellow, and data from cool stars are orange. Light wavelengths are shown on the X-axis, and the relative brightness of disk emission is shown on the Y-axis. The signature of a baseline molecule, called acetylene (C₂H₂), was seen for both types of stars, but hydrogen cyanide was seen only around stars like our sun.

Hydrogen cyanide is an organic, nitrogen-containing molecule. Five hydrogen cyanide molecules can link up to form adenine, one of the four chemical bases of DNA.

I/O-Efficient Scientific Computation Using TPIE

NASA Technical Reports Server (NTRS)

Vengroff, Darren Erik; Vitter, Jeffrey Scott

1996-01-01

In recent years, input/output (I/O)-efficient algorithms for a wide variety of problems have appeared in the literature. However, systems specifically designed to assist programmers in implementing such algorithms have remained scarce. TPIE is a system designed to support I/O-efficient paradigms for problems from a variety of domains, including computational geometry, graph algorithms, and scientific computation. The TPIE interface frees programmers from having to deal not only with explicit read and write calls, but also the complex memory management that must be performed for I/O-efficient computation. In this paper we discuss applications of TPIE to problems in scientific computation. We discuss algorithmic issues underlying the design and implementation of the relevant components of TPIE and present performance results of programs written to solve a series of benchmark problems using our current TPIE prototype. Some of the benchmarks we present are based on the NAS parallel benchmarks while others are of our own creation. We demonstrate that the central processing unit (CPU) overhead required to manage I/O is small and that even with just a single disk, the I/O overhead of I/O-efficient computation ranges from negligible to the same order of magnitude as CPU time. We conjecture that if we use a number of disks in parallel this overhead can be all but eliminated.

Geometrical study of phyllotactic patterns by Bernoulli spiral lattices.

PubMed

Sushida, Takamichi; Yamagishi, Yoshikazu

2017-06-01

Geometrical studies of phyllotactic patterns deal with the centric or cylindrical models produced by ideal lattices. van Iterson (Mathematische und mikroskopisch - anatomische Studien über Blattstellungen nebst Betrachtungen über den Schalenbau der Miliolinen, Verlag von Gustav Fischer, Jena, 1907) suggested a centric model representing ideal phyllotactic patterns as disk packings of Bernoulli spiral lattices and presented a phase diagram now called Van Iterson's diagram explaining the bifurcation processes of their combinatorial structures. Geometrical properties on disk packings were shown by Rothen & Koch (J. Phys France, 50(13), 1603-1621, 1989). In contrast, as another centric model, we organized a mathematical framework of Voronoi tilings of Bernoulli spiral lattices and showed mathematically that the phase diagram of a Voronoi tiling is graph-theoretically dual to Van Iterson's diagram. This paper gives a review of two centric models for disk packings and Voronoi tilings of Bernoulli spiral lattices. © 2017 Japanese Society of Developmental Biologists.

Project on Teaching Charts and Graphs to ABE Students. Part I: Teacher's Guide [and] Part II: Transparency Assembly Package.

ERIC Educational Resources Information Center

Renton Vocational Inst., WA.

The teacher's guide and collection of transparency masters are designed for use in teaching adult basic education (ABE) students how to read and interpret graphs and charts. Covered in the individual lessons of the instructional unit are the reading and interpretation of charts as well as picture, line, bar, and circle graphs. Each unit contains a…

Pattern formations and optimal packing.

PubMed

Mityushev, Vladimir

2016-04-01

Patterns of different symmetries may arise after solution to reaction-diffusion equations. Hexagonal arrays, layers and their perturbations are observed in different models after numerical solution to the corresponding initial-boundary value problems. We demonstrate an intimate connection between pattern formations and optimal random packing on the plane. The main study is based on the following two points. First, the diffusive flux in reaction-diffusion systems is approximated by piecewise linear functions in the framework of structural approximations. This leads to a discrete network approximation of the considered continuous problem. Second, the discrete energy minimization yields optimal random packing of the domains (disks) in the representative cell. Therefore, the general problem of pattern formations based on the reaction-diffusion equations is reduced to the geometric problem of random packing. It is demonstrated that all random packings can be divided onto classes associated with classes of isomorphic graphs obtained from the Delaunay triangulation. The unique optimal solution is constructed in each class of the random packings. If the number of disks per representative cell is finite, the number of classes of isomorphic graphs, hence, the number of optimal packings is also finite. Copyright © 2016 Elsevier Inc. All rights reserved.

Couple Graph Based Label Propagation Method for Hyperspectral Remote Sensing Data Classification

NASA Astrophysics Data System (ADS)

Wang, X. P.; Hu, Y.; Chen, J.

2018-04-01

Graph based semi-supervised classification method are widely used for hyperspectral image classification. We present a couple graph based label propagation method, which contains both the adjacency graph and the similar graph. We propose to construct the similar graph by using the similar probability, which utilize the label similarity among examples probably. The adjacency graph was utilized by a common manifold learning method, which has effective improve the classification accuracy of hyperspectral data. The experiments indicate that the couple graph Laplacian which unite both the adjacency graph and the similar graph, produce superior classification results than other manifold Learning based graph Laplacian and Sparse representation based graph Laplacian in label propagation framework.

47 CFR 80.761 - Conversion graphs.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is...

47 CFR 80.761 - Conversion graphs.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Conversion graphs. 80.761 Section 80.761... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is...

A high-speed, large-capacity, 'jukebox' optical disk system

NASA Technical Reports Server (NTRS)

Ammon, G. J.; Calabria, J. A.; Thomas, D. T.

1985-01-01

Two optical disk 'jukebox' mass storage systems which provide access to any data in a store of 10 to the 13th bits (1250G bytes) within six seconds have been developed. The optical disk jukebox system is divided into two units, including a hardware/software controller and a disk drive. The controller provides flexibility and adaptability, through a ROM-based microcode-driven data processor and a ROM-based software-driven control processor. The cartridge storage module contains 125 optical disks housed in protective cartridges. Attention is given to a conceptual view of the disk drive unit, the NASA optical disk system, the NASA database management system configuration, the NASA optical disk system interface, and an open systems interconnect reference model.

The influence of disk's flexibility on coupling vibration of shaft disk blades systems

NASA Astrophysics Data System (ADS)

Yang, Chia-Hao; Huang, Shyh-Chin

2007-03-01

The coupling vibrations among shaft-torsion, disk-transverse and blade-bending in a shaft-disk-blades unit are investigated. The equations of motion for the shaft-disk-blades unit are first derived from the energy approach in conjunction with the assumed modes method. The effects of disk flexibility, blade's stagger angle and rotational speed upon the natural frequencies and mode shapes are particularly studied. Previous studies have shown that there were four types of coupling modes, the shaft-blade (SB), the shaft-disk-blades (SDBs), the disk-blades (DB) and the blade-blade (BB) in such a unit. The present research focuses on the influence of disk flexibility on the coupling behavior and discovers that disk's flexibility strongly affects the modes bifurcation and the transition of modes. At slightly flexible disk, the BB modes bifurcate into BB and DB modes. As disk goes further flexible, SB modes shift into SDB modes. If it goes furthermore, additional disk-predominating modes are generated and DB modes appear before the SDB mode. Examination of stagger angle β proves that at two extreme cases; at β=0° the shaft and blades coupled but not the disk, and at β=90° the disk and blades coupled but not the shaft. In between, coupling exists among three components. Increasing β may increase or decrease SB modes, depending on which, the disk or shaft's first mode, is more rigid. The natural frequencies of DB modes usually decrease with the increase of β. Rotation effects show that bifurcation, veering and merging phenomena occur due to disk flexibility. Disk flexibility is also observed to induce more critical speeds in the SDBs systems.

How Fast Do Trees Grow? Using Tables and Graphs to Explore Slope

ERIC Educational Resources Information Center

Joram, Elana; Oleson, Vicki

2007-01-01

This article describes a lesson unit in which students constructed tables and graphs to represent the growth of different trees. Students then compared the graphs to develop an understanding of slope.

Multispectral determination of soil moisture-2. [Guymon, Oklahoma and Dalhart, Texas

NASA Technical Reports Server (NTRS)

Estes, J. E.; Simonett, D. S. (Principal Investigator); Hajic, E. J.; Hilton, B. M.; Lees, R. D.

1982-01-01

Soil moisture data obtained using scatterometers, modular multispectral scanners and passive microwave radiometers were revised and grouped into four field cover types for statistical anaysis. Guymon data are grouped as alfalfa, bare, milo with rows perpendicular to the field view, and milo viewed parallel to the field of view. Dalhart data are grouped as bare combo, stubble, disked stubble, and corn field. Summary graphs combine selected analyses to compare the effects of field cover. The analysis for each of the cover types is presented in tables and graphs. Other tables show elementary statistics, correlation matrices, and single variable regressions. Selected eigenvectors and factor analyses are included and the highest correlating sensor typs for each location are summarized.

Numerical study for heat generation/absorption in flow of nanofluid by a rotating disk

NASA Astrophysics Data System (ADS)

Aziz, Arsalan; Alsaedi, Ahmed; Muhammad, Taseer; Hayat, Tasawar

2018-03-01

Here MHD three-dimensional flow of viscous nanoliquid by a rotating disk with heat generation/absorption and slip effects is addressed. Thermophoresis and random motion features are also incorporated. Velocity, temperature and concentration slip conditions are imposed at boundary. Applied magnetic field is utilized. Low magnetic Reynolds number and boundary layer approximations have been employed in the problem formulation. Suitable transformations lead to strong nonlinear ordinary differential system. The obtained nonlinear system is solved numerically through NDSolve technique. Graphs have been sketched in order to analyze that how the velocity, temperature and concentration fields are affected by various pertinent variables. Moreover the numerical values for rates of heat and mass transfer have been tabulated and discussed.

Basic Skills for Reflective Inquiry in the Social Studies. Bridges to the Future.

ERIC Educational Resources Information Center

Rodabaugh, Mary Jane; And Others

The document consists of five social studies units for developing basic inquiry skills at the secondary level. Students read and analyze data through the construction of a table and a graph in Unit I, "Reading Graphs and Charts." Topics include a model of consumer demand, census information, and national budgeting. In Unit II, "Community Change,"…

Method for concurrent execution of primitive operations by dynamically assigning operations based upon computational marked graph and availability of data

NASA Technical Reports Server (NTRS)

Mielke, Roland V. (Inventor); Stoughton, John W. (Inventor)

1990-01-01

Computationally complex primitive operations of an algorithm are executed concurrently in a plurality of functional units under the control of an assignment manager. The algorithm is preferably defined as a computationally marked graph contianing data status edges (paths) corresponding to each of the data flow edges. The assignment manager assigns primitive operations to the functional units and monitors completion of the primitive operations to determine data availability using the computational marked graph of the algorithm. All data accessing of the primitive operations is performed by the functional units independently of the assignment manager.

Using graph approach for managing connectivity in integrative landscape modelling

NASA Astrophysics Data System (ADS)

Rabotin, Michael; Fabre, Jean-Christophe; Libres, Aline; Lagacherie, Philippe; Crevoisier, David; Moussa, Roger

2013-04-01

In cultivated landscapes, a lot of landscape elements such as field boundaries, ditches or banks strongly impact water flows, mass and energy fluxes. At the watershed scale, these impacts are strongly conditionned by the connectivity of these landscape elements. An accurate representation of these elements and of their complex spatial arrangements is therefore of great importance for modelling and predicting these impacts.We developped in the framework of the OpenFLUID platform (Software Environment for Modelling Fluxes in Landscapes) a digital landscape representation that takes into account the spatial variabilities and connectivities of diverse landscape elements through the application of the graph theory concepts. The proposed landscape representation consider spatial units connected together to represent the flux exchanges or any other information exchanges. Each spatial unit of the landscape is represented as a node of a graph and relations between units as graph connections. The connections are of two types - parent-child connection and up/downstream connection - which allows OpenFLUID to handle hierarchical graphs. Connections can also carry informations and graph evolution during simulation is possible (connections or elements modifications). This graph approach allows a better genericity on landscape representation, a management of complex connections and facilitate development of new landscape representation algorithms. Graph management is fully operational in OpenFLUID for developers or modelers ; and several graph tools are available such as graph traversal algorithms or graph displays. Graph representation can be managed i) manually by the user (for example in simple catchments) through XML-based files in easily editable and readable format or ii) by using methods of the OpenFLUID-landr library which is an OpenFLUID library relying on common open-source spatial libraries (ogr vector, geos topologic vector and gdal raster libraries). OpenFLUID-landr library has been developed in order i) to be used with no GIS expert skills needed (common gis formats can be read and simplified spatial management is provided), ii) to easily develop adapted rules of landscape discretization and graph creation to follow spatialized model requirements and iii) to allow model developers to manage dynamic and complex spatial topology. Graph management in OpenFLUID are shown with i) examples of hydrological modelizations on complex farmed landscapes and ii) the new implementation of Geo-MHYDAS tool based on the OpenFLUID-landr library, which allows to discretize a landscape and create graph structure for the MHYDAS model requirements.

Where Planets Take up Residence

NASA Technical Reports Server (NTRS)

2007-01-01

This diagram illustrates that mature planetary systems like our own might be more common around twin, or binary, stars that are either really close together, or really far apart.

NASA's Spitzer Space Telescope observed that debris disks, which are signposts of mature planetary systems, are more abundant around the tightest and widest of binary stars it studied. Specifically, the infrared telescope found significantly more debris disks around binary stars that are 0 to 3 astronomical units apart (top panel) and 50 to 500 astronomical units apart (bottom panel) than binary stars that are 3 to 50 astronomical units apart (middle panel). An astronomical unit is the distance between Earth and the sun.

In other words, if two stars are as far apart from each other as the sun is from Jupiter (5 astronomical units) or Pluto (40 astronomical units), they would be unlikely to host a family of planetary bodies.

The Spitzer data also revealed that debris disks circle all the way around both members of a close-knit binary (top panel), but only a single member of a wide duo (bottom panel). This could explain why the intermediately spaced binary systems (middle panel) can be inhospitable to planetary disks: they are too far apart to support one big disk around both stars, and they are too close together to have enough room for a disk around just one star.

Interval Graph Limits

PubMed Central

Diaconis, Persi; Holmes, Susan; Janson, Svante

2015-01-01

We work out a graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W (x, y) on the unit square, with x and y uniform on the interval (0, 1). Instead, we fix a W and change the underlying distribution of the coordinates x and y. We find choices such that our limits are continuous. Connections to random interval graphs are given, including some examples. We also show a continuity result for the chromatic number and clique number of interval graphs. Some results on uniqueness of the limit description are given for general graph limits. PMID:26405368

Demystifying Data

ERIC Educational Resources Information Center

Dash, Carolyn; Hug, Barbara

2014-01-01

We constantly encounter data--in the form of graphs--that convey information about weather, medicine, politics, finances, and nutrition. These graphs are intended to help us visualize data for easy interpretation; however, approximately 41% of adults in the United States have low graph literacy (Galesic and Garcia-Retamero 2011). In this article,…

Graph-based normalization and whitening for non-linear data analysis.

PubMed

Aaron, Catherine

2006-01-01

In this paper we construct a graph-based normalization algorithm for non-linear data analysis. The principle of this algorithm is to get a spherical average neighborhood with unit radius. First we present a class of global dispersion measures used for "global normalization"; we then adapt these measures using a weighted graph to build a local normalization called "graph-based" normalization. Then we give details of the graph-based normalization algorithm and illustrate some results. In the second part we present a graph-based whitening algorithm built by analogy between the "global" and the "local" problem.

The Quiescent-Chamber Type Compression-Ignition Engine

NASA Technical Reports Server (NTRS)

Foster, H H

1937-01-01

Report presents the results of performance tests of a single-cylinder 4-stroke-cycle compression-ignition engine having a vertical disk form of combustion chamber without air flow. The number, size, and direction of the orifices of the fuel-injection nozzles used were independently varied. A table and graphs are presented showing the performance of the engine with different nozzles; results of tests at different compression ratios, boost pressures, and coolant temperatures are also included.

Graphing Misconceptions and Possible Remedies Using Microcomputer-Based Labs.

ERIC Educational Resources Information Center

Barclay, William L.

Graphing is a common and powerful symbol system for representing concrete data. Yet research has shown that students often have graphical misconceptions about how graphs are related to the concrete event. Currently, the Technical Education Research Center (TERC) is developing microcomputer-based laboratories (MBL) science units that use probes to…

Partial slip effect in the flow of MHD micropolar nanofluid flow due to a rotating disk - A numerical approach

NASA Astrophysics Data System (ADS)

Ramzan, Muhammad; Chung, Jae Dong; Ullah, Naeem

The aim of present exploration is to study the flow of micropolar nanofluid due to a rotating disk in the presence of magnetic field and partial slip condition. The governing coupled partial differential equations are reduced to nonlinear ordinary differential equations using appropriate transformations. The differential equations are solved numerically by using Maple dsolve command with option numeric which utilize Runge-Kutta fourth-fifth order Fehlberg technique. A comparison to previous study is also added to validate the present results. Moreover, behavior of different parameters on velocity, microrotation, temperature and concentration of nanofluid are presented via graphs and tables. It is noted that the slip effect and magnetic field decay the velocity and microrotation or spin component.

The dynamics of particle disks. III - Dense and spinning particle disks. [development of kinetic theory for planetary rings

NASA Technical Reports Server (NTRS)

Araki, Suguru

1991-01-01

The kinetic theory of planetary rings developed by Araki and Tremaine (1986) and Araki (1988) is extended and refined, with a focus on the implications of finite particle size: (1) nonlocal collisions and (2) finite filling factors. Consideration is given to the derivation of the equations for the local steady state, the low-optical-depth limit, and the steady state at finite filling factors (including the effects of collision inelasticity, spin degrees of freedom, and self-gravity). Numerical results are presented in extensive graphs and characterized in detail. The importance of distinguishing effects (1) and (2) at low optical depths is stressed, and the existence of vertical density profiles with layered structures at high filling factors is demonstrated.

Discovery of an Inner Disk Component Around HD 141569 A

NASA Technical Reports Server (NTRS)

Konishi, Mihoko; Grady, Carol A.; Schneider, Glenn; Shibai, Hiroshi; McElwain, Michael W.; Nesvold, Erika R.; Kuchner, Marc J.; Carson, Joseph; Debes, John H.; Gaspar, Andras;

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows.

PubMed

Blattner, Timothy; Keyrouz, Walid; Bhattacharyya, Shuvra S; Halem, Milton; Brady, Mary

2017-12-01

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3× and 1.8× speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.

Graph Structure in Three National Academic Webs: Power Laws with Anomalies.

ERIC Educational Resources Information Center

Thelwall, Mike; Wilkinson, David

2003-01-01

Explains how the Web can be modeled as a mathematical graph and analyzes the graph structures of three national university publicly indexable Web sites from Australia, New Zealand, and the United Kingdom. Topics include commercial search engines and academic Web link research; method-analysis environment and data sets; and power laws. (LRW)

A hot compact dust disk around a massive young stellar object.

PubMed

Kraus, Stefan; Hofmann, Karl-Heinz; Menten, Karl M; Schertl, Dieter; Weigelt, Gerd; Wyrowski, Friedrich; Meilland, Anthony; Perraut, Karine; Petrov, Romain; Robbe-Dubois, Sylvie; Schilke, Peter; Testi, Leonardo

2010-07-15

Circumstellar disks are an essential ingredient of the formation of low-mass stars. It is unclear, however, whether the accretion-disk paradigm can also account for the formation of stars more massive than about 10 solar masses, in which strong radiation pressure might halt mass infall. Massive stars may form by stellar merging, although more recent theoretical investigations suggest that the radiative-pressure limit may be overcome by considering more complex, non-spherical infall geometries. Clear observational evidence, such as the detection of compact dusty disks around massive young stellar objects, is needed to identify unambiguously the formation mode of the most massive stars. Here we report near-infrared interferometric observations that spatially resolve the astronomical-unit-scale distribution of hot material around a high-mass ( approximately 20 solar masses) young stellar object. The image shows an elongated structure with a size of approximately 13 x 19 astronomical units, consistent with a disk seen at an inclination angle of approximately 45 degrees . Using geometric and detailed physical models, we found a radial temperature gradient in the disk, with a dust-free region less than 9.5 astronomical units from the star, qualitatively and quantitatively similar to the disks observed in low-mass star formation. Perpendicular to the disk plane we observed a molecular outflow and two bow shocks, indicating that a bipolar outflow emanates from the inner regions of the system.

The range and valence of a real Smirnov function

NASA Astrophysics Data System (ADS)

Ferguson, Timothy; Ross, William T.

2018-02-01

We give a complete description of the possible ranges of real Smirnov functions (quotients of two bounded analytic functions on the open unit disk where the denominator is outer and such that the radial boundary values are real almost everywhere on the unit circle). Our techniques use the theory of unbounded symmetric Toeplitz operators, some general theory of unbounded symmetric operators, classical Hardy spaces, and an application of the uniformization theorem. In addition, we completely characterize the possible valences for these real Smirnov functions when the valence is finite. To do so we construct Riemann surfaces we call disk trees by welding together copies of the unit disk and its complement in the Riemann sphere. We also make use of certain trees we call valence trees that mirror the structure of disk trees.

Study of torsion oscillations of pumping unit shafts

NASA Astrophysics Data System (ADS)

Loginovskikh, V. M.; Cherentsov, D. A.; Voronin, K. S.; Pirogov, S. P.

2018-05-01

The method of detuning from resonant frequencies is an effective method of reducing the vibration activity of the HA at the design stage, which allows selecting the necessary operating mode for the HA, which will provide the necessary reliability of operation. In this connection, works in the field of increasing the vibration protection of NA are relevant. All calculations are based on the dynamic model of free torsional vibrations of the pumping unit, for which the oscillation equation was derived on the basis of Lagrange equations of the second kind, where the angle of rotation of the rotor was taken as the generalized coordinate. Next, expressions were obtained for the determination of the potential and kinetic energies that take into account all the characteristics of the shaft and the disk of the rotor HA; in particular, for the first time the mass of the shaft is taken into account. Then an expression was obtained for determining the frequencies of free torsional oscillations and the equation of motion of the rotor HA. Knowing the parameters of the oscillatory motion makes it possible to estimate the stresses that arise when the shaft rotates. The following is a case of a sudden stop of the shaft, for example, when the support is destroyed, and a graph is obtained from which the main conclusions are drawn.

Local dependence in random graph models: characterization, properties and statistical inference

PubMed Central

Schweinberger, Michael; Handcock, Mark S.

2015-01-01

Summary Dependent phenomena, such as relational, spatial and temporal phenomena, tend to be characterized by local dependence in the sense that units which are close in a well-defined sense are dependent. In contrast with spatial and temporal phenomena, though, relational phenomena tend to lack a natural neighbourhood structure in the sense that it is unknown which units are close and thus dependent. Owing to the challenge of characterizing local dependence and constructing random graph models with local dependence, many conventional exponential family random graph models induce strong dependence and are not amenable to statistical inference. We take first steps to characterize local dependence in random graph models, inspired by the notion of finite neighbourhoods in spatial statistics and M-dependence in time series, and we show that local dependence endows random graph models with desirable properties which make them amenable to statistical inference. We show that random graph models with local dependence satisfy a natural domain consistency condition which every model should satisfy, but conventional exponential family random graph models do not satisfy. In addition, we establish a central limit theorem for random graph models with local dependence, which suggests that random graph models with local dependence are amenable to statistical inference. We discuss how random graph models with local dependence can be constructed by exploiting either observed or unobserved neighbourhood structure. In the absence of observed neighbourhood structure, we take a Bayesian view and express the uncertainty about the neighbourhood structure by specifying a prior on a set of suitable neighbourhood structures. We present simulation results and applications to two real world networks with ‘ground truth’. PMID:26560142

Measurement, Ratios, and Graphing: 3...2...1...Crash! NASA Connect: Program 1 in the 2000-2001 Series.

ERIC Educational Resources Information Center

National Aeronautics and Space Administration, Hampton, VA. Langley Research Center.

This teaching unit is designed to help students in grades 5 to 8 explore the concepts of measurement, ratios, and graphing in the context of designing a dragster. The units in the series have been developed to enhance and enrich mathematics, science, and technology education and to accommodate different teaching and learning styles. Each unit…

Atmosphere-entry behavior of a modular, disk-shaped, isotope heat source.

NASA Technical Reports Server (NTRS)

Vorreiter, J. W.; Pitts, W. C.; Stine, H. A.; Burns, J. J.

1973-01-01

The authors have studied the entry and impact behavior of an isotope heat source for space nuclear power that disassembles into a number of modules which would enter the earth's atmosphere separately if a flight aborted. These modules are disk-shaped units, each with its own reentry heat shield and protective impact container. In normal operation, the disk modules are stacked inside the generator, but during a reentry abort they separate and fly as individual units of low ballistic coefficient. Flight tests at hypersonic speeds have confirmed that a stack of disks will separate and assume a flat-forward mode of flight. Free-fall tests of single disks have demonstrated a nominal impact velocity of 30 m/sec at sea level for a practical range of ballistic coefficients.

Our Diets May Be Killing Us.

ERIC Educational Resources Information Center

Shannon, Brenda K. J.

1995-01-01

Describes a Food-Choice Unit that includes the following activities: drawing circle graphs, graphing dietary content, understanding heart attacks, reducing dietary fat, charting fat content of restaurant foods, and calculating percent of fat. Includes extension activities. (CSCO)

Using Lunar Sample Disks and Resources to Promote Scientific Inquiry

NASA Technical Reports Server (NTRS)

Graff, Paige; Allen, Jaclyn; Runco, Susan

2014-01-01

This poster presentation will illustrate the use of NASA Lunar Sample Disks and resources to promote scientific inquiry and address the Next Generation Science Standards. The poster will present information on the Lunar Sample Disks, housed and managed by the Astromaterials Research and Exploration Science (ARES) Directorate at the NASA Johnson Space Center. The poster will also present information on an inquiry-based planetary sample and impact cratering unit designed to introduce students in grades 4-10 to the significance of studying the rocks, soils, and surfaces of a planetary world. The unit, consisting of many hands-on activities, provides context and background information to enhance the impact of the Lunar Sample Disks.

Emulation Aid System II (EASY II) System Programmer’s Guide.

DTIC Science & Technology

1981-03-01

DISK-SAVE, PASSWD =SSSS .MTUINIT= 17 ,MTF IILE=99,D)SKUNIT=7. RESTORE-DISK, PASSWD =SSSS,,MTt!NI=I 7,MTF [LE--=99,DSKtJNIT=7. where PASSWD - a system disk...DISK-SAVE, PASSWD =SSSS ,MTUNIT=17,MTFILE=99,DSKtJNIT=7. SAVE A DISK FILE ON TAPE HELP ,O,O,O. DSKSV. EDIT. CR’r BASED EDITOR (COMM ANDS EXPLAINED AS...BE EXPLICITLY TURNED ON QCNTRL ,LOCKED. RDTAPE,UNIT= 17. READING TAPE FOR USE WITH 6000 AND PRINT. 0. RDTAPE. RESTORE-DISK, PASSWD =SSSS ,MTUNIT= 17

Analytical exploration of a TiO2 nanofluid along a rotating disk with homogeneous-heterogeneous chemical reactions and non-uniform heat source/sink

NASA Astrophysics Data System (ADS)

Das, Kalidas; Chakraborty, Tanmoy; Kumar Kundu, Prabir

2017-12-01

Comparative flow features of two different nanofluids containing TiO2 nanoparticles along a rotating disk near a stagnation point are theoretically addressed here. The primary fluids are presumed as ethylene glycol and water. The influences of non-uniform heat absorption/generation with homogeneous and heterogeneous chemical reactions have been integrated to modify the energy and concentration profiles. By virtue of similarity conversions, the leading partial differential system has been standardized into non-linear ODEs and then cracked analytically by NDM and numerically by RK-4 based shooting practice. Impressions of emerging parameters on the flow regime have been reported by tables and graphs coupled with required discussions. One of our results predicts that, with the augmentation of TiO2 nanoparticles concentration, the rate of heat transport for ethylene glycol nanofluid becomes 30-36% higher compared to that of a water nanofluid.

Resistance distance and Kirchhoff index in circulant graphs

NASA Astrophysics Data System (ADS)

Zhang, Heping; Yang, Yujun

The resistance distance rij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices. In this work, closed-form formulae for Kirchhoff index and resistance distances of circulant graphs are derived in terms of Laplacian spectrum and eigenvectors. Special formulae are also given for four classes of circulant graphs (complete graphs, complete graphs minus a perfect matching, cycles, Möbius ladders Mp). In particular, the asymptotic behavior of Kf(Mp) as p ? ? is obtained, that is, Kf(Mp) grows as ⅙p3 as p ? ?.

Resistance Distances and Kirchhoff Index in Generalised Join Graphs

NASA Astrophysics Data System (ADS)

Chen, Haiyan

2017-03-01

The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a unit resistor. The Kirchhoff index of a graph is defined as the sum of all the resistance distances between any pair of vertices of the graph. Let G=H[G1, G2, …, Gk ] be the generalised join graph of G1, G2, …, Gk determined by H. In this paper, we first give formulae for resistance distances and Kirchhoff index of G in terms of parameters of {G'_i}s and H. Then, we show that computing resistance distances and Kirchhoff index of G can be decomposed into simpler ones. Finally, we obtain explicit formulae for resistance distances and Kirchhoff index of G when {G'_i}s and H take some special graphs, such as the complete graph, the path, and the cycle.

Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii

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

Kupavskii, A B; Raigorodskii, A M

2013-10-31

We investigate in detail some properties of distance graphs constructed on the integer lattice. Such graphs find wide applications in problems of combinatorial geometry, in particular, such graphs were employed to answer Borsuk's question in the negative and to obtain exponential estimates for the chromatic number of the space. This work is devoted to the study of the number of cliques and the chromatic number of such graphs under certain conditions. Constructions of sequences of distance graphs are given, in which the graphs have unit length edges and contain a large number of triangles that lie on a sphere of radius 1/√3more » (which is the minimum possible). At the same time, the chromatic numbers of the graphs depend exponentially on their dimension. The results of this work strengthen and generalize some of the results obtained in a series of papers devoted to related issues. Bibliography: 29 titles.« less

Graph characterization via Ihara coefficients.

PubMed

Ren, Peng; Wilson, Richard C; Hancock, Edwin R

2011-02-01

The novel contributions of this paper are twofold. First, we demonstrate how to characterize unweighted graphs in a permutation-invariant manner using the polynomial coefficients from the Ihara zeta function, i.e., the Ihara coefficients. Second, we generalize the definition of the Ihara coefficients to edge-weighted graphs. For an unweighted graph, the Ihara zeta function is the reciprocal of a quasi characteristic polynomial of the adjacency matrix of the associated oriented line graph. Since the Ihara zeta function has poles that give rise to infinities, the most convenient numerically stable representation is to work with the coefficients of the quasi characteristic polynomial. Moreover, the polynomial coefficients are invariant to vertex order permutations and also convey information concerning the cycle structure of the graph. To generalize the representation to edge-weighted graphs, we make use of the reduced Bartholdi zeta function. We prove that the computation of the Ihara coefficients for unweighted graphs is a special case of our proposed method for unit edge weights. We also present a spectral analysis of the Ihara coefficients and indicate their advantages over other graph spectral methods. We apply the proposed graph characterization method to capturing graph-class structure and clustering graphs. Experimental results reveal that the Ihara coefficients are more effective than methods based on Laplacian spectra.

Visualization and recommendation of large image collections toward effective sensemaking

NASA Astrophysics Data System (ADS)

Gu, Yi; Wang, Chaoli; Nemiroff, Robert; Kao, David; Parra, Denis

2016-03-01

In our daily lives, images are among the most commonly found data which we need to handle. We present iGraph, a graph-based approach for visual analytics of large image collections and their associated text information. Given such a collection, we compute the similarity between images, the distance between texts, and the connection between image and text to construct iGraph, a compound graph representation which encodes the underlying relationships among these images and texts. To enable effective visual navigation and comprehension of iGraph with tens of thousands of nodes and hundreds of millions of edges, we present a progressive solution that offers collection overview, node comparison, and visual recommendation. Our solution not only allows users to explore the entire collection with representative images and keywords but also supports detailed comparison for understanding and intuitive guidance for navigation. The visual exploration of iGraph is further enhanced with the implementation of bubble sets to highlight group memberships of nodes, suggestion of abnormal keywords or time periods based on text outlier detection, and comparison of four different recommendation solutions. For performance speedup, multiple graphics processing units and central processing units are utilized for processing and visualization in parallel. We experiment with two image collections and leverage a cluster driving a display wall of nearly 50 million pixels. We show the effectiveness of our approach by demonstrating experimental results and conducting a user study.

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.

PubMed

Kundeti, Vamsi K; Rajasekaran, Sanguthevar; Dinh, Hieu; Vaughn, Matthew; Thapar, Vishal

2010-11-15

Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories - based on the data structures which they employ. The first class uses an overlap/string graph and the second type uses a de Bruijn graph. However with the recent advances in short read sequencing technology, de Bruijn graph based algorithms seem to play a vital role in practice. Efficient algorithms for building these massive de Bruijn graphs are very essential in large sequencing projects based on short reads. In an earlier work, an O(n/p) time parallel algorithm has been given for this problem. Here n is the size of the input and p is the number of processors. This algorithm enumerates all possible bi-directed edges which can overlap with a node and ends up generating Θ(nΣ) messages (Σ being the size of the alphabet). In this paper we present a Θ(n/p) time parallel algorithm with a communication complexity that is equal to that of parallel sorting and is not sensitive to Σ. The generality of our algorithm makes it very easy to extend it even to the out-of-core model and in this case it has an optimal I/O complexity of Θ(nlog(n/B)Blog(M/B)) (M being the main memory size and B being the size of the disk block). We demonstrate the scalability of our parallel algorithm on a SGI/Altix computer. A comparison of our algorithm with the previous approaches reveals that our algorithm is faster--both asymptotically and practically. We demonstrate the scalability of our sequential out-of-core algorithm by comparing it with the algorithm used by VELVET to build the bi-directed de Bruijn graph. Our experiments reveal that our algorithm can build the graph with a constant amount of memory, which clearly outperforms VELVET. We also provide efficient algorithms for the bi-directed chain compaction problem. The bi-directed de Bruijn graph is a fundamental data structure for any sequence assembly program based on Eulerian approach. Our algorithms for constructing Bi-directed de Bruijn graphs are efficient in parallel and out of core settings. These algorithms can be used in building large scale bi-directed de Bruijn graphs. Furthermore, our algorithms do not employ any all-to-all communications in a parallel setting and perform better than the prior algorithms. Finally our out-of-core algorithm is extremely memory efficient and can replace the existing graph construction algorithm in VELVET.

Evolution of magnetic disk subsystems

NASA Astrophysics Data System (ADS)

Kaneko, Satoru

1994-06-01

The higher recording density of magnetic disk realized today has brought larger storage capacity per unit and smaller form factors. If the required access performance per MB is constant, the performance of large subsystems has to be several times better. This article describes mainly the technology for improving the performance of the magnetic disk subsystems and the prospects of their future evolution. Also considered are 'crosscall pathing' which makes the data transfer channel more effective, 'disk cache' which improves performance coupling with solid state memory technology, and 'RAID' which improves the availability and integrity of disk subsystems by organizing multiple disk drives in a subsystem. As a result, it is concluded that since the performance of the subsystem is dominated by that of the disk cache, maximation of the performance of the disk cache subsystems is very important.

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

Braunstein, Samuel L.; Ghosh, Sibasish; Severini, Simone

We reconsider density matrices of graphs as defined in quant-ph/0406165. The density matrix of a graph is the combinatorial Laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the 'degree condition') to test the separability of density matrices of graphs. The condition is directly related to the Peres-Horodecki partial transposition condition. We prove that the degree condition is necessary for separability, and we conjecture that it is also sufficient. We prove special cases of the conjecture involving nearest-point graphs and perfect matchings. We observe that the degree condition appears to have a value beyondmore » the density matrices of graphs. In fact, we point out that circulant density matrices and other matrices constructed from groups always satisfy the condition and indeed are separable with respect to any split. We isolate a number of problems and delineate further generalizations.« less

Graphing evolutionary pattern and process: a history of techniques in archaeology and paleobiology.

PubMed

Lyman, R Lee

2009-02-01

Graphs displaying evolutionary patterns are common in paleontology and in United States archaeology. Both disciplines subscribed to a transformational theory of evolution and graphed evolution as a sequence of archetypes in the late nineteenth and early twentieth centuries. U.S. archaeologists in the second decade of the twentieth century, and paleontologists shortly thereafter, developed distinct graphic styles that reflected the Darwinian variational model of evolution. Paleobiologists adopted the view of a species as a set of phenotypically variant individuals and graphed those variations either as central tendencies or as histograms of frequencies of variants. Archaeologists presumed their artifact types reflected cultural norms of prehistoric artisans and the frequency of specimens in each type reflected human choice and type popularity. They graphed cultural evolution as shifts in frequencies of specimens representing each of several artifact types. Confusion of pattern and process is exemplified by a paleobiologist misinterpreting the process illustrated by an archaeological graph, and an archaeologist misinterpreting the process illustrated by a paleobiological graph. Each style of graph displays particular evolutionary patterns and implies particular evolutionary processes. Graphs of a multistratum collection of prehistoric mammal remains and a multistratum collection of artifacts demonstrate that many graph styles can be used for both kinds of collections.

Combinatorial compatibility as habit-controlling factor in lysozyme crystallization I. Monomeric and tetrameric F faces derived graph-theoretically

NASA Astrophysics Data System (ADS)

Strom, C. S.; Bennema, P.

1997-03-01

A series of two articles discusses possible morphological evidence for oligomerization of growth units in the crystallization of tetragonal lysozyme, based on a rigorous graph-theoretic derivation of the F faces. In the first study (Part I), the growth layers are derived as valid networks satisfying the conditions of F slices in the context of the PBC theory using the graph-theoretic method implemented in program FFACE [C.S. Strom, Z. Krist. 172 (1985) 11]. The analysis is performed in monomeric and alternative tetrameric and octameric formulations of the unit cell, assuming tetramer formation according to the strongest bonds. F (flat) slices with thickness Rdhkl ( {1}/{2} < R ≤ 1 ) are predicted theoretically in the forms 1 1 0, 0 1 1, 1 1 1. The relevant energies are established in the broken bond model. The relation between possible oligomeric specifications of the unit cell and combinatorially feasible F slice compositions in these orientations is explored.

USSR Country Notes.

ERIC Educational Resources Information Center

World Eagle, Inc., Wellesley, MA.

The United Soviet Socialist Republic (USSR) is the largest country in area in the world and ranks third in world population. The geography and the people of the USSR are documented in a series of reproducible black and white maps and graphs designed for use as classroom instructional materials. Maps, graphs, charts, and tables with information…

Architecture Aware Partitioning Algorithms

DTIC Science & Technology

2006-01-19

follows: Given a graph G = (V, E ), where V is the set of vertices, n = |V | is the number of vertices, and E is the set of edges in the graph, partition the...communication link l(pi, pj) is associated with a graph edge weight e ∗(pi, pj) that represents the communication cost per unit of communication between...one that is local for each one. For our model we assume that communication in either direction across a given link is the same, therefore e ∗(pi, pj

Fast-moving features in the debris disk around AU Microscopii.

PubMed

Boccaletti, Anthony; Thalmann, Christian; Lagrange, Anne-Marie; Janson, Markus; Augereau, Jean-Charles; Schneider, Glenn; Milli, Julien; Grady, Carol; Debes, John; Langlois, Maud; Mouillet, David; Henning, Thomas; Dominik, Carsten; Maire, Anne-Lise; Beuzit, Jean-Luc; Carson, Joseph; Dohlen, Kjetil; Engler, Natalia; Feldt, Markus; Fusco, Thierry; Ginski, Christian; Girard, Julien H; Hines, Dean; Kasper, Markus; Mawet, Dimitri; Ménard, François; Meyer, Michael R; Moutou, Claire; Olofsson, Johan; Rodigas, Timothy; Sauvage, Jean-Francois; Schlieder, Joshua; Schmid, Hans Martin; Turatto, Massimo; Udry, Stephane; Vakili, Farrokh; Vigan, Arthur; Wahhaj, Zahed; Wisniewski, John

2015-10-08

In the 1980s, excess infrared emission was discovered around main-sequence stars; subsequent direct-imaging observations revealed orbiting disks of cold dust to be the source. These 'debris disks' were thought to be by-products of planet formation because they often exhibited morphological and brightness asymmetries that may result from gravitational perturbation by planets. This was proved to be true for the β Pictoris system, in which the known planet generates an observable warp in the disk. The nearby, young, unusually active late-type star AU Microscopii hosts a well-studied edge-on debris disk; earlier observations in the visible and near-infrared found asymmetric localized structures in the form of intensity variations along the midplane of the disk beyond a distance of 20 astronomical units. Here we report high-contrast imaging that reveals a series of five large-scale features in the southeast side of the disk, at projected separations of 10-60 astronomical units, persisting over intervals of 1-4 years. All these features appear to move away from the star at projected speeds of 4-10 kilometres per second, suggesting highly eccentric or unbound trajectories if they are associated with physical entities. The origin, localization, morphology and rapid evolution of these features are difficult to reconcile with current theories.

Wave chaos in the elastic disk.

PubMed

Sondergaard, Niels; Tanner, Gregor

2002-12-01

The relation between the elastic wave equation for plane, isotropic bodies and an underlying classical ray dynamics is investigated. We study, in particular, the eigenfrequencies of an elastic disk with free boundaries and their connection to periodic rays inside the circular domain. Even though the problem is separable, wave mixing between the shear and pressure component of the wave field at the boundary leads to an effective stochastic part in the ray dynamics. This introduces phenomena typically associated with classical chaos as, for example, an exponential increase in the number of periodic orbits. Classically, the problem can be decomposed into an integrable part and a simple binary Markov process. Similarly, the wave equation can, in the high-frequency limit, be mapped onto a quantum graph. Implications of this result for the level statistics are discussed. Furthermore, a periodic trace formula is derived from the scattering matrix based on the inside-outside duality between eigenmodes and scattering solutions and periodic orbits are identified by Fourier transforming the spectral density.

Representing k-graphs as Matrix Algebras

NASA Astrophysics Data System (ADS)

Rosjanuardi, R.

2018-05-01

For any commutative unital ring R and finitely aligned k-graph Λ with |Λ| < ∞ without cycles, we can realise Kumjian-Pask algebra KP R (Λ) as a direct sum of of matrix algebra over some vertices v with properties ν = νΛ, i.e: ⊕ νΛ=ν M |Λv|(R). When there is only a single vertex ν ∈ Λ° such that ν = νΛ, we can realise the Kumjian-Pask algebra as the matrix algebra M |ΛV|(R). Hence the matrix algebra M |vΛ|(R) can be regarded as a representation of the k-graph Λ. In this talk we will figure out the relation between finitely aligned k-graph and matrix algebra.

A sediment graph model based on SCS-CN method

NASA Astrophysics Data System (ADS)

Singh, P. K.; Bhunya, P. K.; Mishra, S. K.; Chaube, U. C.

2008-01-01

SummaryThis paper proposes new conceptual sediment graph models based on coupling of popular and extensively used methods, viz., Nash model based instantaneous unit sediment graph (IUSG), soil conservation service curve number (SCS-CN) method, and Power law. These models vary in their complexity and this paper tests their performance using data of the Nagwan watershed (area = 92.46 km 2) (India). The sensitivity of total sediment yield and peak sediment flow rate computations to model parameterisation is analysed. The exponent of the Power law, β, is more sensitive than other model parameters. The models are found to have substantial potential for computing sediment graphs (temporal sediment flow rate distribution) as well as total sediment yield.

Structural Analysis of Treatment Cycles Representing Transitions between Nursing Organizational Units Inferred from Diabetes

PubMed Central

Dehmer, Matthias; Kurt, Zeyneb; Emmert-Streib, Frank; Them, Christa; Schulc, Eva; Hofer, Sabine

2015-01-01

In this paper, we investigate treatment cycles inferred from diabetes data by means of graph theory. We define the term treatment cycles graph-theoretically and perform a descriptive as well as quantitative analysis thereof. Also, we interpret our findings in terms of nursing and clinical management. PMID:26030296

Integrating BalloonSAT and Atmospheric Dynamic Concepts into the Secondary Classroom

NASA Astrophysics Data System (ADS)

Fong, B. N.; Kennon, J. T.; Roberts, E.

2016-05-01

Arkansas BalloonSAT is an educational outreach and scientific research program that is part of Arkansas State University in Jonesboro, AR. The following is a unit of instruction to incorporate BalloonSAT measurements into secondary science classes. Students interpret graphs and identify several atmospheric trends and properties of a typical balloon flight. Students engage critical thinking skills in developing and answering their own questions relevant to the BalloonSAT program. Prerequisite concepts students should know are how to interpret graphs and unit conversions. Students should have a basic understanding of gravity, units of temperature and distance, and error in measurements. The unit is designed for one week after end-of-course exams and before the end of school. The unit may take two to five 50-minute periods, depending on how many activities are completed.

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

Demeure, I.M.

The research presented here is concerned with representation techniques and tools to support the design, prototyping, simulation, and evaluation of message-based parallel, distributed computations. The author describes ParaDiGM-Parallel, Distributed computation Graph Model-a visual representation technique for parallel, message-based distributed computations. ParaDiGM provides several views of a computation depending on the aspect of concern. It is made of two complementary submodels, the DCPG-Distributed Computing Precedence Graph-model, and the PAM-Process Architecture Model-model. DCPGs are precedence graphs used to express the functionality of a computation in terms of tasks, message-passing, and data. PAM graphs are used to represent the partitioning of a computationmore » into schedulable units or processes, and the pattern of communication among those units. There is a natural mapping between the two models. He illustrates the utility of ParaDiGM as a representation technique by applying it to various computations (e.g., an adaptive global optimization algorithm, the client-server model). ParaDiGM representations are concise. They can be used in documenting the design and the implementation of parallel, distributed computations, in describing such computations to colleagues, and in comparing and contrasting various implementations of the same computation. He then describes VISA-VISual Assistant, a software tool to support the design, prototyping, and simulation of message-based parallel, distributed computations. VISA is based on the ParaDiGM model. In particular, it supports the editing of ParaDiGM graphs to describe the computations of interest, and the animation of these graphs to provide visual feedback during simulations. The graphs are supplemented with various attributes, simulation parameters, and interpretations which are procedures that can be executed by VISA.« less

An old disk still capable of forming a planetary system.

PubMed

Bergin, Edwin A; Cleeves, L Ilsedore; Gorti, Uma; Zhang, Ke; Blake, Geoffrey A; Green, Joel D; Andrews, Sean M; Evans, Neal J; Henning, Thomas; Oberg, Karin; Pontoppidan, Klaus; Qi, Chunhua; Salyk, Colette; van Dishoeck, Ewine F

2013-01-31

From the masses of the planets orbiting the Sun, and the abundance of elements relative to hydrogen, it is estimated that when the Solar System formed, the circumstellar disk must have had a minimum mass of around 0.01 solar masses within about 100 astronomical units of the star. (One astronomical unit is the Earth-Sun distance.) The main constituent of the disk, gaseous molecular hydrogen, does not efficiently emit radiation from the disk mass reservoir, and so the most common measure of the disk mass is dust thermal emission and lines of gaseous carbon monoxide. Carbon monoxide emission generally indicates properties of the disk surface, and the conversion from dust emission to gas mass requires knowledge of the grain properties and the gas-to-dust mass ratio, which probably differ from their interstellar values. As a result, mass estimates vary by orders of magnitude, as exemplified by the relatively old (3-10 million years) star TW Hydrae, for which the range is 0.0005-0.06 solar masses. Here we report the detection of the fundamental rotational transition of hydrogen deuteride from the direction of TW Hydrae. Hydrogen deuteride is a good tracer of disk gas because it follows the distribution of molecular hydrogen and its emission is sensitive to the total mass. The detection of hydrogen deuteride, combined with existing observations and detailed models, implies a disk mass of more than 0.05 solar masses, which is enough to form a planetary system like our own.

The neighbourhood polynomial of some families of dendrimers

NASA Astrophysics Data System (ADS)

Nazri Husin, Mohamad; Hasni, Roslan

2018-04-01

The neighbourhood polynomial N(G,x) is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph and it is defined as (G,x)={\\sum }U\\in N(G){x}|U|, where N(G) is neighbourhood complex of a graph, whose vertices of the graph and faces are subsets of vertices that have a common neighbour. A dendrimers is an artificially manufactured or synthesized molecule built up from branched units called monomers. In this paper, we compute this polynomial for some families of dendrimer.

High surface plasmon resonance sensitivity enabled by optical disks.

PubMed

Dou, Xuan; Phillips, Blayne M; Chung, Pei-Yu; Jiang, Peng

2012-09-01

We report a systematic, experimental, and theoretical investigation on the surface plasmon resonance (SPR) sensing using optical disks with different track pitches, including Blu-ray disk (BD), digital versatile disk (DVD), and compact disk (CD). Optical reflection measurements indicate that CD and DVD exhibit much higher SPR sensitivity than BD. Both experiments and finite-difference time-domain simulations reveal that the SPR sensitivity is significantly affected by the diffraction order of the SPR peaks and higher diffraction order results in lower sensitivity. Numerical simulations also show that very high sensitivity (∼1600  nm per refractive index unit) is achievable by CDs.

Modeling of a bimetallic eccentric cylindrical plasma waveguide based on a transmission line for TEM-mode

NASA Astrophysics Data System (ADS)

Golharani, Saeedeh; Jazi, Bahram; Jahanbakht, Sajad; Moeini-Nashalji, Azam

2018-07-01

In this paper, a plasma waveguide made of two eccentric cylindrical metallic walls have been studied according to the theory of transmission lines. The inductance per unit length L, the capacitance per unit length C, the resistance per unit length R and the shunt conductance per unit length G are obtained. The graphs of variations of the mentioned parameters vs. geometrical dimensions of waveguide are investigated. This investigations have been done for two different types of plasma waveguide. At first stage, plasma region will be considered in cold and collisional approximation and in second stage, a drift plasma in cold collisionless approximation will be considered. Also, graphs of phase velocity variation vs. the main parameters of the waveguide are presented.

Young Star HD 141569

NASA Image and Video Library

2017-01-30

This image shows the dusty disk of planetary material surrounding the young star HD 141569, located 380 light-years away from Earth. It was taken using the vortex coronagraph on the W.M. Keck Observatory. The vortex suppressed light from the star in the center, revealing light from the innermost ring of planetary material around the star (blue). The disk around the star, made of olivine particles, extends from 23 to 70 astronomical units from the star. By comparison, Uranus is over 19 astronomical units from our sun, and Neptune about 30 astronomical units. One astronomical unit is the distance between Earth and our sun. http://photojournal.jpl.nasa.gov/catalog/PIA21090

The Effect of a Graph-Oriented Computer-Assisted Project-Based Learning Environment on Argumentation Skills

ERIC Educational Resources Information Center

Hsu, P. -S.; Van Dyke, M.; Chen, Y.; Smith, T. J.

2015-01-01

The purpose of this quasi-experimental study was to explore how seventh graders in a suburban school in the United States developed argumentation skills and science knowledge in a project-based learning environment that incorporated a graph-oriented, computer-assisted application. A total of 54 students (three classes) comprised this treatment…

A tunnel and a traffic jam: How transition disks maintain a detectable warm dust component despite the presence of a large planet-carved gap

NASA Astrophysics Data System (ADS)

Pinilla, P.; Klarmann, L.; Birnstiel, T.; Benisty, M.; Dominik, C.; Dullemond, C. P.

2016-01-01

Context. Transition disks are circumstellar disks that show evidence of a dust cavity, which may be related to dynamical clearing by embedded planet(s). Most of these objects show signs of significant accretion, indicating that the inner disks are not truly empty, but that gas is still streaming through to the star. A subset of transition disks, sometimes called pre-transition disks, also shows a strong near-infrared excess, interpreted as an optically thick dusty belt located close to the dust sublimation radius within the first astronomical unit. Aims: We study the conditions for the survival and maintenance of such an inner disk in the case where a massive planet opens a gap in the disk. In this scenario, the planet filters out large dust grains that are trapped at the outer edge of the gap, while the inner regions of the disk may or may not be replenished with small grains. Methods: We combined hydrodynamical simulations of planet-disk interactions with dust evolution models that include coagulation and fragmentation of dust grains over a large range of radii and derived observational properties using radiative transfer calculations. We studied the role of the snow line in the survival of the inner disk of transition disks. Results: Inside the snow line, the lack of ice mantles in dust particles decreases the sticking efficiency between grains. As a consequence, particles fragment at lower collision velocities than in regions beyond the snow line. This effect allows small particles to be maintained for up to a few Myr within the first astronomical unit. These particles are closely coupled to the gas and do not drift significantly with respect to the gas. For lower mass planets (1 MJup), the pre-transition appearance can be maintained even longer because dust still trickles through the gap created by the planet, moves invisibly and quickly in the form of relatively large grains through the gap, and becomes visible again as it fragments and gets slowed down inside of the snow line. Conclusions: The global study of dust evolution of a disk with an embedded planet, including the changes of the dust aerodynamics near the snow line, can explain the concentration of millimetre-sized particles in the outer disk and the survival of the dust in the inner disk if a large dust trap is present in the outer disk. This behaviour solves the conundrum of the combination of both near-infrared excess and ring-like millimetre emission observed in several transition disks.

Fast disk array for image storage

NASA Astrophysics Data System (ADS)

Feng, Dan; Zhu, Zhichun; Jin, Hai; Zhang, Jiangling

1997-01-01

A fast disk array is designed for the large continuous image storage. It includes a high speed data architecture and the technology of data striping and organization on the disk array. The high speed data path which is constructed by two dual port RAM and some control circuit is configured to transfer data between a host system and a plurality of disk drives. The bandwidth can be more than 100 MB/s if the data path based on PCI (peripheral component interconnect). The organization of data stored on the disk array is similar to RAID 4. Data are striped on a plurality of disk, and each striping unit is equal to a track. I/O instructions are performed in parallel on the disk drives. An independent disk is used to store the parity information in the fast disk array architecture. By placing the parity generation circuit directly on the SCSI (or SCSI 2) bus, the parity information can be generated on the fly. It will affect little on the data writing in parallel on the other disks. The fast disk array architecture designed in the paper can meet the demands of the image storage.

Simulator for heterogeneous dataflow architectures

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

1993-01-01

A new simulator is developed to simulate the execution of an algorithm graph in accordance with the Algorithm to Architecture Mapping Model (ATAMM) rules. ATAMM is a Petri Net model which describes the periodic execution of large-grained, data-independent dataflow graphs and which provides predictable steady state time-optimized performance. This simulator extends the ATAMM simulation capability from a heterogenous set of resources, or functional units, to a more general heterogenous architecture. Simulation test cases show that the simulator accurately executes the ATAMM rules for both a heterogenous architecture and a homogenous architecture, which is the special case for only one processor type. The simulator forms one tool in an ATAMM Integrated Environment which contains other tools for graph entry, graph modification for performance optimization, and playback of simulations for analysis.

Stellar nucleosynthesis and chemical evolution of the solar neighborhood

NASA Technical Reports Server (NTRS)

Clayton, Donald D.

1988-01-01

Current theoretical models of nucleosynthesis (N) in stars are reviewed, with an emphasis on their implications for Galactic chemical evolution. Topics addressed include the Galactic population II red giants and early N; N in the big bang; star formation, stellar evolution, and the ejection of thermonuclearly evolved debris; the chemical evolution of an idealized disk galaxy; analytical solutions for a closed-box model with continuous infall; and nuclear burning processes and yields. Consideration is given to shell N in massive stars, N related to degenerate cores, and the types of observational data used to constrain N models. Extensive diagrams, graphs, and tables of numerical data are provided.

Parametric design analysis of a hybrid composite flywheel using a laminated central disc and a filament wound outer ring

NASA Astrophysics Data System (ADS)

Nimmer, R. P.

1980-09-01

A hybrid flywheel design concept based on the use of a laminated central disk with a filament-wound outer ring is analyzed for several different combinations of composite materials. Some of the results of this study are: (1) an optimized E-glass disk with Kevlar-49 outer ring offers the prospect of 30% additional energy density over a laminated disk without a ring; (2) a laminated S2-glass disk is capable of storing more energy per unit mass than an E-glass disk because of its higher tensile strength; and (3) the use of wound graphite outer rings with S2-glass disks leads to substantial reductions in the size of the interference fit while offering still higher energy densities than for a Kevlar-49 outer ring.

New separated polynomial solutions to the Zernike system on the unit disk and interbasis expansion.

PubMed

Pogosyan, George S; Wolf, Kurt Bernardo; Yakhno, Alexander

2017-10-01

The differential equation proposed by Frits Zernike to obtain a basis of polynomial orthogonal solutions on the unit disk to classify wavefront aberrations in circular pupils is shown to have a set of new orthonormal solution bases involving Legendre and Gegenbauer polynomials in nonorthogonal coordinates, close to Cartesian ones. We find the overlaps between the original Zernike basis and a representative of the new set, which turn out to be Clebsch-Gordan coefficients.

Tutorial: Performance and reliability in redundant disk arrays

NASA Technical Reports Server (NTRS)

Gibson, Garth A.

1993-01-01

A disk array is a collection of physically small magnetic disks that is packaged as a single unit but operates in parallel. Disk arrays capitalize on the availability of small-diameter disks from a price-competitive market to provide the cost, volume, and capacity of current disk systems but many times their performance. Unfortunately, relative to current disk systems, the larger number of components in disk arrays leads to higher rates of failure. To tolerate failures, redundant disk arrays devote a fraction of their capacity to an encoding of their information. This redundant information enables the contents of a failed disk to be recovered from the contents of non-failed disks. The simplest and least expensive encoding for this redundancy, known as N+1 parity is highlighted. In addition to compensating for the higher failure rates of disk arrays, redundancy allows highly reliable secondary storage systems to be built much more cost-effectively than is now achieved in conventional duplicated disks. Disk arrays that combine redundancy with the parallelism of many small-diameter disks are often called Redundant Arrays of Inexpensive Disks (RAID). This combination promises improvements to both the performance and the reliability of secondary storage. For example, IBM's premier disk product, the IBM 3390, is compared to a redundant disk array constructed of 84 IBM 0661 3 1/2-inch disks. The redundant disk array has comparable or superior values for each of the metrics given and appears likely to cost less. In the first section of this tutorial, I explain how disk arrays exploit the emergence of high performance, small magnetic disks to provide cost-effective disk parallelism that combats the access and transfer gap problems. The flexibility of disk-array configurations benefits manufacturer and consumer alike. In contrast, I describe in this tutorial's second half how parallelism, achieved through increasing numbers of components, causes overall failure rates to rise. Redundant disk arrays overcome this threat to data reliability by ensuring that data remains available during and after component failures.

The Collaborative Coordination of Special Interest Groups on the Telemedicine University Network (RUTE) in Brazil.

PubMed

de Lima Verde Brito, Thiago Delevidove; Baptista, Roberto Silva; de Lima Lopes, Paulo Roberto; Haddad, Ana Estela; Messina, Luiz Ary; Torres Pisa, Ivan

2015-01-01

In Brazil the Telemedicine University Network (Rede Universitária de Telemedicina RUTE) is an initiative that among others promotes collaboration between university hospitals, universities, and health professionals through information technology infrastructure and special interest groups (SIGs) support. This paper presents results of analyses on collaboration during implementation and coordination activities of RUTE SIGs. This study is based on descriptive statistics and data visualization previously collected by RUTE national coordination relative to the status in July 2014. The analysis through collaboration graph identified the strongest collaboration RUTE units. The graph also highlights the collaborative relationship of RUTE units in form of communities, the most collaborative with each other in a communion in the same SIGs, and the less the collaborative units in the network. It should be stated that the most active units are also the oldest in the community.

Contrast-detail phantom scoring methodology.

PubMed

Thomas, Jerry A; Chakrabarti, Kish; Kaczmarek, Richard; Romanyukha, Alexander

2005-03-01

Published results of medical imaging studies which make use of contrast detail mammography (CDMAM) phantom images for analysis are difficult to compare since data are often not analyzed in the same way. In order to address this situation, the concept of ideal contrast detail curves is suggested. The ideal contrast detail curves are constructed based on the requirement of having the same product of the diameter and contrast (disk thickness) of the minimal correctly determined object for every row of the CDMAM phantom image. A correlation and comparison of five different quality parameters of the CDMAM phantom image determined for obtained ideal contrast detail curves is performed. The image quality parameters compared include: (1) contrast detail curve--a graph correlation between "minimal correct reading" diameter and disk thickness; (2) correct observation ratio--the ratio of the number of correctly identified objects to the actual total number of objects multiplied by 100; (3) image quality figure--the sum of the product of the diameter of the smallest scored object and its relative contrast; (4) figure-of-merit--the zero disk diameter value obtained from extrapolation of the contrast detail curve to the origin (e.g., zero disk diameter); and (5) k-factor--the product of the thickness and the diameter of the smallest correctly identified disks. The analysis carried out showed the existence of a nonlinear relationship between the above parameters, which means that use of different parameters of CDMAM image quality potentially can cause different conclusions about changes in image quality. Construction of the ideal contrast detail curves for CDMAM phantom is an attempt to determine the quantitative limits of the CDMAM phantom as employed for image quality evaluation. These limits are determined by the relationship between certain parameters of a digital mammography system and the set of the gold disks sizes in the CDMAM phantom. Recommendations are made on selections of CDMAM phantom regions which should be used for scoring at different image quality and which scoring methodology may be most appropriate. Special attention is also paid to the use of the CDMAM phantom for image quality assessment of digital mammography systems particularly in the vicinity of the Nyquist frequency.

Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle–Infrastructure Systems †

PubMed Central

Tang, Xiaolan; Hong, Donghui; Chen, Wenlong

2017-01-01

Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay. PMID:28594359

How Well Do COP22 Attendees Understand Graphs on Climate Change Health Impacts from the Fifth IPCC Assessment Report?

PubMed

Fischer, Helen; Schütte, Stefanie; Depoux, Anneliese; Amelung, Dorothee; Sauerborn, Rainer

2018-04-27

Graphs are prevalent in the reports of the Intergovernmental Panel on Climate Change (IPCC), often depicting key points and major results. However, the popularity of graphs in the IPCC reports contrasts with a neglect of empirical tests of their understandability. Here we put the understandability of three graphs taken from the Health chapter of the Fifth Assessment Report to an empirical test. We present a pilot study where we evaluate objective understanding (mean accuracy in multiple-choice questions) and subjective understanding (self-assessed confidence in accuracy) in a sample of attendees of the United Nations Climate Change Conference in Marrakesh, 2016 (COP22), and a student sample. Results show a mean objective understanding of M = 0.33 for the COP sample, and M = 0.38 for the student sample. Subjective and objective understanding were unrelated for the COP22 sample, but associated for the student sample. These results suggest that (i) understandability of the IPCC health chapter graphs is insufficient, and that (ii) particularly COP22 attendees lacked insight into which graphs they did, and which they did not understand. Implications for the construction of graphs to communicate health impacts of climate change to decision-makers are discussed.

Everything You Always Wanted to Know about Computers but Were Afraid to Ask.

ERIC Educational Resources Information Center

DiSpezio, Michael A.

1989-01-01

An overview of the basics of computers is presented. Definitions and discussions of processing, programs, memory, DOS, anatomy and design, central processing unit (CPU), disk drives, floppy disks, and peripherals are included. This article was designed to help teachers to understand basic computer terminology. (CW)

The continued value of disk diffusion for assessing antimicrobial susceptibility in clinical laboratories: report from the Clinical and Laboratory Standards Institute Methods Development and Standardization Working Group.

PubMed

Humphries, Romney M; Kircher, Susan; Ferrell, Andrea; Krause, Kevin M; Malherbe, Rianna; Hsiung, Andre; Burnham, C A

2018-05-09

Expedited pathways to antimicrobial agent approval by the United States Food and Drug Administration (FDA) have led to increased delays between drug approval and the availability of FDA-cleared antimicrobial susceptibility testing (AST) devices. Antimicrobial disks for use with disk diffusion testing are among the first AST devices available to clinical laboratories. However, many laboratories are reluctant to implement a disk diffusion method for a variety of reasons, including dwindling proficiency with this method, interruptions to laboratory workflow, uncertainty surrounding the quality and reliability of a disk diffusion test, and perceived need to report an MIC to clinicians. This mini-review provides a report from the Clinical and Laboratory Standards Institute Working Group on Methods Development and Standardization on the current standards and clinical utility of disk diffusion testing. Copyright © 2018 American Society for Microbiology.

An analytic performance model of disk arrays and its application

NASA Technical Reports Server (NTRS)

Lee, Edward K.; Katz, Randy H.

1991-01-01

As disk arrays become widely used, tools for understanding and analyzing their performance become increasingly important. In particular, performance models can be invaluable in both configuring and designing disk arrays. Accurate analytic performance models are desirable over other types of models because they can be quickly evaluated, are applicable under a wide range of system and workload parameters, and can be manipulated by a range of mathematical techniques. Unfortunately, analytical performance models of disk arrays are difficult to formulate due to the presence of queuing and fork-join synchronization; a disk array request is broken up into independent disk requests which must all complete to satisfy the original request. We develop, validate, and apply an analytic performance model for disk arrays. We derive simple equations for approximating their utilization, response time, and throughput. We then validate the analytic model via simulation and investigate the accuracy of each approximation used in deriving the analytical model. Finally, we apply the analytical model to derive an equation for the optimal unit of data striping in disk arrays.

SciSpark: In-Memory Map-Reduce for Earth Science Algorithms

NASA Astrophysics Data System (ADS)

Ramirez, P.; Wilson, B. D.; Whitehall, K. D.; Palamuttam, R. S.; Mattmann, C. A.; Shah, S.; Goodman, A.; Burke, W.

2016-12-01

We are developing a lightning fast Big Data technology called SciSpark based on ApacheTM Spark under a NASA AIST grant (PI Mattmann). Spark implements the map-reduce paradigm for parallel computing on a cluster, but emphasizes in-memory computation, "spilling" to disk only as needed, and so outperforms the disk-based Apache Hadoop by 100x in memory and by 10x on disk. SciSpark extends Spark to support Earth Science use in three ways: Efficient ingest of N-dimensional geo-located arrays (physical variables) from netCDF3/4, HDF4/5, and/or OPeNDAP URLS; Array operations for dense arrays in scala and Java using the ND4S/ND4J or Breeze libraries; Operations to "split" datasets across a Spark cluster by time or space or both. For example, a decade-long time-series of geo-variables can be split across time to enable parallel "speedups" of analysis by day, month, or season. Similarly, very high-resolution climate grids can be partitioned into spatial tiles for parallel operations across rows, columns, or blocks. In addition, using Spark's gateway into python, PySpark, one can utilize the entire ecosystem of numpy, scipy, etc. Finally, SciSpark Notebooks provide a modern eNotebook technology in which scala, python, or spark-sql codes are entered into cells in the Notebook and executed on the cluster, with results, plots, or graph visualizations displayed in "live widgets". We have exercised SciSpark by implementing three complex Use Cases: discovery and evolution of Mesoscale Convective Complexes (MCCs) in storms, yielding a graph of connected components; PDF Clustering of atmospheric state using parallel K-Means; and statistical "rollups" of geo-variables or model-to-obs. differences (i.e. mean, stddev, skewness, & kurtosis) by day, month, season, year, and multi-year. Geo-variables are ingested and split across the cluster using methods on the sciSparkContext object including netCDFVariables() for spatial decomposition and wholeNetCDFVariables() for time-series. The presentation will cover the architecture of SciSpark, the design of the scientific RDD (sRDD) data structures for N-dim. arrays, results from the three science Use Cases, example Notebooks, lessons learned from the algorithm implementations, and parallel performance metrics.

Using Behavior Over Time Graphs to Spur Systems Thinking Among Public Health Practitioners.

PubMed

Calancie, Larissa; Anderson, Seri; Branscomb, Jane; Apostolico, Alexsandra A; Lich, Kristen Hassmiller

2018-02-01

Public health practitioners can use Behavior Over Time (BOT) graphs to spur discussion and systems thinking around complex challenges. Multiple large systems, such as health care, the economy, and education, affect chronic disease rates in the United States. System thinking tools can build public health practitioners' capacity to understand these systems and collaborate within and across sectors to improve population health. BOT graphs show a variable, or variables (y axis) over time (x axis). Although analyzing trends is not new to public health, drawing BOT graphs, annotating the events and systemic forces that are likely to influence the depicted trends, and then discussing the graphs in a diverse group provides an opportunity for public health practitioners to hear each other's perspectives and creates a more holistic understanding of the key factors that contribute to a trend. We describe how BOT graphs are used in public health, how they can be used to generate group discussion, and how this process can advance systems-level thinking. Then we describe how BOT graphs were used with groups of maternal and child health (MCH) practitioners and partners (N = 101) during a training session to advance their thinking about MCH challenges. Eighty-six percent of the 84 participants who completed an evaluation agreed or strongly agreed that they would use this BOT graph process to engage stakeholders in their home states and jurisdictions. The BOT graph process we describe can be applied to a variety of public health issues and used by practitioners, stakeholders, and researchers.

The United States Today: An Atlas of Reproducible Pages.

ERIC Educational Resources Information Center

World Eagle, Inc., Wellesley, MA.

Black and white maps, graphs and tables that may be reproduced are presented in this volume focusing on the United States. Some of the features of the United States depicted are: size, population, agriculture and resources, manufactures, trade, citizenship, employment, income, poverty, the federal budget, energy, health, education, crime, and the…

First detection of equatorial dark dust lane in a protostellar disk at submillimeter wavelength

PubMed Central

Lee, Chin-Fei; Li, Zhi-Yun; Ho, Paul T. P.; Hirano, Naomi; Zhang, Qizhou; Shang, Hsien

2017-01-01

In the earliest (so-called “Class 0”) phase of Sun-like (low-mass) star formation, circumstellar disks are expected to form, feeding the protostars. However, these disks are difficult to resolve spatially because of their small sizes. Moreover, there are theoretical difficulties in producing these disks in the earliest phase because of the retarding effects of magnetic fields on the rotating, collapsing material (so-called “magnetic braking”). With the Atacama Large Millimeter/submillimeter Array (ALMA), it becomes possible to uncover these disks and study them in detail. HH 212 is a very young protostellar system. With ALMA, we not only detect but also spatially resolve its disk in dust emission at submillimeter wavelength. The disk is nearly edge-on and has a radius of ~60 astronomical unit. It shows a prominent equatorial dark lane sandwiched between two brighter features due to relatively low temperature and high optical depth near the disk midplane. For the first time, this dark lane is seen at submillimeter wavelength, producing a “hamburger”-shaped appearance that is reminiscent of the scattered-light image of an edge-on disk in optical and near infrared light. Our observations open up an exciting possibility of directly detecting and characterizing small disks around the youngest protostars through high-resolution imaging with ALMA, which provides strong constraints on theories of disk formation. PMID:28439561

Imaging Transitional Disks with TMT: Lessons Learned from the SEEDS Survey

NASA Technical Reports Server (NTRS)

Grady, Carol A.; Fukagawa, M.; Muto, T.; Hashimoto, J.

2014-01-01

TMT studies of the early phases of giant planet formation will build on studies carried out in this decade using 8-meter class telescopes. One such study is the Strategic Exploration of Exoplanets and Disks with Subaru transitional disk survey. We have found a wealth of indirect signatures of giant planet presence, including spiral arms, pericenter offsets of the outer disk from the star, and changes in disk color at the inner edge of the outer disk in intermediate-mass PMS star disks. T Tauri star transitional disks are less flamboyant, but are also dynamically colder: any spiral arms in these diskswill be more tightly wound. Imaging such features at the distance of the nearest star-forming regions requires higher angular resolution than achieved with HiCIAO+ AO188. Imaging such disks with extreme AO systems requires use of laser guide stars, and are infeasible with the extreme AO systems currently commissioning on 8-meter class telescopes. Similarly, the JWST and AFTAWFIRST coronagraphs being considered have inner working angles 0.2, and will occult the inner 28 atomic units of systems at d140pc, a region where both high-contrast imagery and ALMA data indicate that giant planets are located in transitional disks. However, studies of transitional disks associated with solar-mass stars and their planet complement are feasible with TMT using NFIRAOS.

UX Tau A

NASA Technical Reports Server (NTRS)

2007-01-01

This is an artist's rendition of the one-million-year-old star system called UX Tau A, located approximately 450 light-years away. Observations from NASA's Spitzer Space Telescope showed a gap in the dusty planet-forming disk swirling around the system's central sun-like star.

Spitzer saw a gap in UX Tau A's disk that extends from 0.2 to 56 astronomical units (an astronomical unit is the distance between the sun and Earth). The gap extends from the equivalent of Mercury to Pluto in our solar system, and is sandwiched between thick inner and outer disks on either side. Astronomers suspect that the gap was carved out by one or more forming planets.

Such dusty disks are where planets are thought to be born. Dust grains clump together like snowballs to form larger rocks, and then the bigger rocks collide to form the cores of planets. When rocks revolve around their central star, they act like cosmic vacuum cleaners, picking up all the gas and dust in their path and creating gaps.

Although gaps have been detected in disks swirling around young stars before, UX Tau A is special because the gap is sandwiched between two thick disks of dust. An inner thick dusty disk hugs the central star, then, moving outward, there is a gap, followed by another thick doughnut-shaped disk. Other systems with gaps contain very little to no dust near the central star. In other words, those gaps are more like big holes in the centers of disks.

Some scientists suspect that these holes could have been carved out by a process called photoevaporation. Photoevaporation occurs when radiation from the central star heats up the gas and dust around it to the point where it evaporates away. The fact that there is thick disk swirling extremely close to UX Tau A's central star rules out the photoevaporation scenario. If photoevaporation from the star played a role, then large amounts of dust would not be floating so close to the star.

Burst-by-burst laser frequency monitor

NASA Technical Reports Server (NTRS)

Esproles, Carlos (Inventor)

1994-01-01

The invention is a system for real-time frequency monitoring and display of an RF burst where the burst frequency is analyzed and displayed on a burst-by-burst basis in order to allow for frequency control. Although the invention was made for monitoring the laser frequency of a LIDAR system, it has other applications where realtime monitoring is required. The novelty of the invention resides in the use of a counter that is reset at the beginning of each unit time of monitoring and then gated for a unit of time. The invention also has an LED bar graph for displaying the measure of frequency at the end of each unit time in either a bar length mode or a moving dot mode. In the latter mode, the operator makes necessary adjustments to maintain the dot at the center of the bar graph.

36 CFR 1235.46 - What electronic media may be used for transferring records to the National Archives of the United...

Code of Federal Regulations, 2012 CFR

2012-07-01

... that meet ANSI X3.39 or ANSI X3.54 (both incorporated by reference, see § 1235.4), respectively. (2) 18...) Compact-Disk, Read Only Memory (CD-ROM) and Digital Video Disks (DVDs). Agencies may use CD-ROMs and DVDs...

36 CFR 1235.46 - What electronic media may be used for transferring records to the National Archives of the United...

Code of Federal Regulations, 2010 CFR

2010-07-01

... that meet ANSI X3.39 or ANSI X3.54 (both incorporated by reference, see § 1235.4), respectively. (2) 18...) Compact-Disk, Read Only Memory (CD-ROM) and Digital Video Disks (DVDs). Agencies may use CD-ROMs and DVDs...

36 CFR 1235.46 - What electronic media may be used for transferring records to the National Archives of the United...

Code of Federal Regulations, 2014 CFR

2014-07-01

... that meet ANSI X3.39 or ANSI X3.54 (both incorporated by reference, see § 1235.4), respectively. (2) 18...) Compact-Disk, Read Only Memory (CD-ROM) and Digital Video Disks (DVDs). Agencies may use CD-ROMs and DVDs...

36 CFR 1235.46 - What electronic media may be used for transferring records to the National Archives of the United...

Code of Federal Regulations, 2011 CFR

2011-07-01

... that meet ANSI X3.39 or ANSI X3.54 (both incorporated by reference, see § 1235.4), respectively. (2) 18...) Compact-Disk, Read Only Memory (CD-ROM) and Digital Video Disks (DVDs). Agencies may use CD-ROMs and DVDs...

36 CFR § 1235.46 - What electronic media may be used for transferring records to the National Archives of the United...

Code of Federal Regulations, 2013 CFR

2013-07-01

...), respectively. (2) 18-track 3480-class cartridges must be recorded at 37,871 bpi that meet ANSI X3.180..., § 1235.4). (c) Compact-Disk, Read Only Memory (CD-ROM) and Digital Video Disks (DVDs). Agencies may use...

Analysis of the dynamics and frequency spectrum synthesis of an optical-mechanical scanning device

NASA Technical Reports Server (NTRS)

Andryushkevichyus, A. I.; Kumpikas, A. L.; Kumpikas, K. L.

1973-01-01

A two-coordinate optical-mechanical scanning device (OMSD), the operating unit of which is a scanning disk, with directional and focusing optics and a board, on which the data carrier is placed, is examined. The disk and board are kinematically connected by a transmission mechanism, consisting of a worm and complex gear drive and a tightening screw-nut with correcting device, and it is run by a synchronous type motor. The dynamic errors in the system depend, first, on irregularities in rotation of the disk, fluctuations in its axis and vibrations of the table in the plane parallel to the plane of the disk. The basic sources of the fluctuations referred to above are residual disbalance of the rotor and other rotating masses, the periodic component of the driving torque of the synchronous motor, variability in the resistance, kinematic errors in the drive and other things. The fluctuations can be transmitted to the operating units through the kinematic link as a flexural-torsional system, as well as through vibrations of the housing of the device.

Using a CBL Unit, a Temperature Sensor, and a Graphing Calculator to Model the Kinetics of Consecutive First-Order Reactions as Safe In-Class Demonstrations

ERIC Educational Resources Information Center

Moore-Russo, Deborah A.; Cortes-Figueroa, Jose E.; Schuman, Michael J.

2006-01-01

The use of Calculator-Based Laboratory (CBL) technology, the graphing calculator, and the cooling and heating of water to model the behavior of consecutive first-order reactions is presented, where B is the reactant, I is the intermediate, and P is the product for an in-class demonstration. The activity demonstrates the spontaneous and consecutive…

Turbo Pascal/GEM Software Interface for Scientific Graph Preparation

DTIC Science & Technology

1991-04-01

Well as whatever artistic touches that the author may desire. Even colour hardcopy reproduuction is possible through use of an appropriate colour...drawing axes on graphs. The unit also contains an autoscaling procedure that may be applied separately to all curve axes. 6.3.1 Available structures...procedures AxisScale Provides autoscaled values from specified min and max values. LabelRightAxis Draws ticks and numbers on the right axis. LabelXAxis

A Cross-Cultural Study of the Effect of a Graph-Oriented Computer-Assisted Project-Based Learning Environment on Middle School Students' Science Knowledge and Argumentation Skills

ERIC Educational Resources Information Center

Hsu, P.-S.; Van Dyke, M.; Chen, Y.; Smith, T. J.

2016-01-01

The purpose of this mixed-methods study was to explore how seventh graders in a suburban school in the United States and sixth graders in an urban school in Taiwan developed argumentation skills and science knowledge in a project-based learning environment that incorporated a graph-oriented, computer-assisted application (GOCAA). A total of 42…

Discrete Methods and their Applications

DTIC Science & Technology

1993-02-03

problem of finding all near-optimal solutions to a linear program. In paper [18], we give a brief and elementary proof of a result of Hoffman [1952) about...relies only on linear programming duality; second, we obtain geometric and algebraic representations of the bounds that are determined explicitly in...same. We have studied the problem of finding the minimum n such that a given unit interval graph is an n--graph. A linear time algorithm to compute

Stress Response of Granular Systems

NASA Astrophysics Data System (ADS)

Ramola, Kabir; Chakraborty, Bulbul

2017-10-01

We develop a framework for stress response in two dimensional granular media, with and without friction, that respects vector force balance at the microscopic level. We introduce local gauge degrees of freedom that determine the response of contact forces between constituent grains on a given, disordered, contact network, to external perturbations. By mapping this response to the spectral properties of the graph Laplacian corresponding to the underlying contact network, we show that this naturally leads to spatial localization of forces. We present numerical evidence for localization using exact diagonalization studies of network Laplacians of soft disk packings. Finally, we discuss the role of other constraints, such as torque balance, in determining the stability of a granular packing to external perturbations.

A disk asymmetry in motion around the B[e] star MWC158

NASA Astrophysics Data System (ADS)

Kluska, J.; Benisty, M.; Soulez, F.; Berger, J.-P.; Le Bouquin, J.-B.; Malbet, F.; Lazareff, B.; Thiébaut, E.

2016-06-01

Context. MWC158 is a star with the B[e] phenomenon that shows strong spectrophotometric variability (in lines and in UV and visible continuum) attributed to phases of shell ejection. The evolutionary stage of this star was never clearly determined. Previous interferometric, spectropolarimetric and spectro-interferometric studies suggest a disk morphology for its environment. Aims: We investigate the origin of the variability within the inner astronomical unit of the central star using near-infrared interferometric observations with PIONIER at the VLTI over a two-year period. Methods: We performed an image reconstruction of the circumstellar environment using the SPARCO method. We discovered that the morphology of the circumstellar environment could vary on timescales of weeks or days. We carried out a parametric fit of the data with a model consisting of a star, a disk and a bright spot that represents a brighter emission in the disk. Results: We detect strong morphological changes in the first astronomical unit around the star, that happen on a timescale of few months. We cannot account for such variability well with a binary model. Our parametric model fits the data well and allows us to extract the location of the asymmetry for different epochs. Conclusions: For the first time, we detect a morphological variability in the environment of MWC158. This variability is reproduced by a model of a disk and a bright spot. The locations of the bright spot suggest that it is located in the disk, but its precise motion is not determined. The origin of the asymmetry in the disk is complex and may be related to asymmetric shell ejections. Based on observations performed with PIONIER mounted on the ESO Very Large Telescope interferometer (programmes: 089.C-0211, 190.C-0963).

Disk-based k-mer counting on a PC

PubMed Central

2013-01-01

Background The k-mer counting problem, which is to build the histogram of occurrences of every k-symbol long substring in a given text, is important for many bioinformatics applications. They include developing de Bruijn graph genome assemblers, fast multiple sequence alignment and repeat detection. Results We propose a simple, yet efficient, parallel disk-based algorithm for counting k-mers. Experiments show that it usually offers the fastest solution to the considered problem, while demanding a relatively small amount of memory. In particular, it is capable of counting the statistics for short-read human genome data, in input gzipped FASTQ file, in less than 40 minutes on a PC with 16 GB of RAM and 6 CPU cores, and for long-read human genome data in less than 70 minutes. On a more powerful machine, using 32 GB of RAM and 32 CPU cores, the tasks are accomplished in less than half the time. No other algorithm for most tested settings of this problem and mammalian-size data can accomplish this task in comparable time. Our solution also belongs to memory-frugal ones; most competitive algorithms cannot efficiently work on a PC with 16 GB of memory for such massive data. Conclusions By making use of cheap disk space and exploiting CPU and I/O parallelism we propose a very competitive k-mer counting procedure, called KMC. Our results suggest that judicious resource management may allow to solve at least some bioinformatics problems with massive data on a commodity personal computer. PMID:23679007

A giant planet imaged in the disk of the young star beta Pictoris.

PubMed

Lagrange, A-M; Bonnefoy, M; Chauvin, G; Apai, D; Ehrenreich, D; Boccaletti, A; Gratadour, D; Rouan, D; Mouillet, D; Lacour, S; Kasper, M

2010-07-02

Here, we show that the approximately 10-million-year-old beta Pictoris system hosts a massive giant planet, beta Pictoris b, located 8 to 15 astronomical units from the star. This result confirms that gas giant planets form rapidly within disks and validates the use of disk structures as fingerprints of embedded planets. Among the few planets already imaged, beta Pictoris b is the closest to its parent star. Its short period could allow for recording of the full orbit within 17 years.

Bumble bees of the western United States

USDA-ARS?s Scientific Manuscript database

Bumble bees (genus Bombus) are critical pollinators of flowering plants. Thirty species of bumble bees are native to the western United States and this publication is a guide to the natural history and identification of these species. We present phenology graphs, host-plant associations, detailed ...

Detailing the equivalence between real equiangular tight frames and certain strongly regular graphs

NASA Astrophysics Data System (ADS)

Fickus, Matthew; Watson, Cody E.

2015-08-01

An equiangular tight frame (ETF) is a set of unit vectors whose coherence achieves the Welch bound, and so is as incoherent as possible. They arise in numerous applications. It is well known that real ETFs are equivalent to a certain subclass of strongly regular graphs. In this note, we give some alternative techniques for understanding this equivalence. In a later document, we will use these techniques to further generalize this theory.

A Comparative Evaluation of the Effects of the Implementation of the Production Oriented Maintenance Organization (POMO) on Aircraft Maintenance

DTIC Science & Technology

1978-09-01

Division AREA & WORK UNIT NUMBERS School of Systems and Logistics’ Air Force Institute of Technology,WPAFB,OH II. CONTROLLING OFFICE NAME AND ADDRESS 12 ...STRUCTURE) ............. ................ 9) 12 . SUMMARY OF ALL ANALYSIS RESUILT,"S ........ ........ 94 vii i LIST OF FIGURES Figure Page 1. Deputy...ness Rate (Variable 4) .... ............ ... 81 12 . Graph of Data Values for Abort Rate (Variable 5 e) . ..................... 82 13. Graph of Data

Quasirandom geometric networks from low-discrepancy sequences

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2017-08-01

We define quasirandom geometric networks using low-discrepancy sequences, such as Halton, Sobol, and Niederreiter. The networks are built in d dimensions by considering the d -tuples of digits generated by these sequences as the coordinates of the vertices of the networks in a d -dimensional Id unit hypercube. Then, two vertices are connected by an edge if they are at a distance smaller than a connection radius. We investigate computationally 11 network-theoretic properties of two-dimensional quasirandom networks and compare them with analogous random geometric networks. We also study their degree distribution and their spectral density distributions. We conclude from this intensive computational study that in terms of the uniformity of the distribution of the vertices in the unit square, the quasirandom networks look more random than the random geometric networks. We include an analysis of potential strategies for generating higher-dimensional quasirandom networks, where it is know that some of the low-discrepancy sequences are highly correlated. In this respect, we conclude that up to dimension 20, the use of scrambling, skipping and leaping strategies generate quasirandom networks with the desired properties of uniformity. Finally, we consider a diffusive process taking place on the nodes and edges of the quasirandom and random geometric graphs. We show that the diffusion time is shorter in the quasirandom graphs as a consequence of their larger structural homogeneity. In the random geometric graphs the diffusion produces clusters of concentration that make the process more slow. Such clusters are a direct consequence of the heterogeneous and irregular distribution of the nodes in the unit square in which the generation of random geometric graphs is based on.

On Learning Cluster Coefficient of Private Networks

PubMed Central

Wang, Yue; Wu, Xintao; Zhu, Jun; Xiang, Yang

2013-01-01

Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as clustering coefficient or modularity often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we treat a graph statistics as a function f and develop a divide and conquer approach to enforce differential privacy. The basic procedure of this approach is to first decompose the target computation f into several less complex unit computations f1, …, fm connected by basic mathematical operations (e.g., addition, subtraction, multiplication, division), then perturb the output of each fi with Laplace noise derived from its own sensitivity value and the distributed privacy threshold εi, and finally combine those perturbed fi as the perturbed output of computation f. We examine how various operations affect the accuracy of complex computations. When unit computations have large global sensitivity values, we enforce the differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We illustrate our approach by using clustering coefficient, which is a popular statistics used in social network analysis. Empirical evaluations on five real social networks and various synthetic graphs generated from three random graph models show the developed divide and conquer approach outperforms the direct approach. PMID:24429843

A binary-decision-diagram-based two-bit arithmetic logic unit on a GaAs-based regular nanowire network with hexagonal topology.

PubMed

Zhao, Hong-Quan; Kasai, Seiya; Shiratori, Yuta; Hashizume, Tamotsu

2009-06-17

A two-bit arithmetic logic unit (ALU) was successfully fabricated on a GaAs-based regular nanowire network with hexagonal topology. This fundamental building block of central processing units can be implemented on a regular nanowire network structure with simple circuit architecture based on graphical representation of logic functions using a binary decision diagram and topology control of the graph. The four-instruction ALU was designed by integrating subgraphs representing each instruction, and the circuitry was implemented by transferring the logical graph structure to a GaAs-based nanowire network formed by electron beam lithography and wet chemical etching. A path switching function was implemented in nodes by Schottky wrap gate control of nanowires. The fabricated circuit integrating 32 node devices exhibits the correct output waveforms at room temperature allowing for threshold voltage variation.

Double-disk solid-phase extraction--Simultaneous cleanup and trace enrichment of herbicides and metabolites from environmental samples

USGS Publications Warehouse

Ferrar, Imma; Barceló, Damià; Thurman, E.M.

1999-01-01

Phenylurea and triazine herbicides, including some metabolites, were isolated from water and soil extracts by solid-phase extraction using a layered system of two extraction disks, a method called double-disk solid-phase extraction. The first disk consisted of strong anion exchange (SAX) of 10-μm styrene divinylbenzene (SDB) particles embedded in Teflon, and the second disk was a C18 disk of 10-μm particles also embedded in Teflon. A volume of 500 mL of water or aqueous soil extract is passed through the layered system with the SAX disk first. The purpose of the SAX disk is to remove the humic and fulvic acids from the water or aqueous soil extract by ion exchange through their carboxyl groups. Even during methanol elution of herbicides, the humic substances remain bound to the SAX disk with >85% retention. Elution with methanol results in more than 90% recovery of the herbicides from the layered extraction disks. Removal of the humic and fulvic acids results in greater sensitivity for diode array detection quantitation (0.05 μg/L for herbicides) by substantially reducing the absorbance of the humic peak on the LC chromatogram. The herbicides adsorb to the SAX disk either through hydrogen bonding to the anion-exchange sites or by hydrophobic interaction with the SDB surface of the anion-exchange disk. The method was tested for the analysis of natural water samples from the Mississippi Embayment, a cotton-growing area of the southeastern United States.

Cost-effective data storage/archival subsystem for functional PACS

NASA Astrophysics Data System (ADS)

Chen, Y. P.; Kim, Yongmin

1993-09-01

Not the least of the requirements of a workable PACS is the ability to store and archive vast amounts of information. A medium-size hospital will generate between 1 and 2 TBytes of data annually on a fully functional PACS. A high-speed image transmission network coupled with a comparably high-speed central data storage unit can make local memory and magnetic disks in the PACS workstations less critical and, in an extreme case, unnecessary. Under these circumstances, the capacity and performance of the central data storage subsystem and database is critical in determining the response time at the workstations, thus significantly affecting clinical acceptability. The central data storage subsystem not only needs to provide sufficient capacity to store about ten days worth of images (five days worth of new studies, and on the average, about one comparison study for each new study), but also supplies images to the requesting workstation in a timely fashion. The database must provide fast retrieval responses upon users' requests for images. This paper analyzes both advantages and disadvantages of multiple parallel transfer disks versus RAID disks for short-term central data storage subsystem, as well as optical disk jukebox versus digital recorder tape subsystem for long-term archive. Furthermore, an example high-performance cost-effective storage subsystem which integrates both the RAID disks and high-speed digital tape subsystem as a cost-effective PACS data storage/archival unit are presented.

An optical disk archive for a data base management system

NASA Technical Reports Server (NTRS)

Thomas, Douglas T.

1985-01-01

An overview is given of a data base management system that can catalog and archive data at rates up to 50M bits/sec. Emphasis is on the laser disk system that is used for the archive. All key components in the system (3 Vax 11/780s, a SEL 32/2750, a high speed communication interface, and the optical disk) are interfaced to a 100M bits/sec 16-port fiber optic bus to achieve the high data rates. The basic data unit is an autonomous data packet. Each packet contains a primary and secondary header and can be up to a million bits in length. The data packets are recorded on the optical disk at the same time the packet headers are being used by the relational data base management software ORACLE to create a directory independent of the packet recording process. The user then interfaces to the VAX that contains the directory for a quick-look scan or retrieval of the packet(s). The total system functions are distributed between the VAX and the SEL. The optical disk unit records the data with an argon laser at 100M bits/sec from its buffer, which is interfaced to the fiber optic bus. The same laser is used in the read cycle by reducing the laser power. Additional information is given in the form of outlines, charts, and diagrams.

Wyoming's Early Settlement and Ethnic Groups, Unit IV.

ERIC Educational Resources Information Center

Robinson, Terry

This unit on Wyoming's early settlement and ethnic groups provides concepts, activities, stories, charts, and graphs for elementary school students. Concepts include the attraction Wyoming held for trappers; the major social, economic, and religious event called "The Rendezvous"; the different ethnic and religious groups that presently…

ROAD CLASS 1 TRANSPORTATION DIGITAL LINE GRAPHS FOR THE MID-ATLANTIC INTEGRATED ASSESSMENT (MAIA) STUDY AREA

EPA Science Inventory

This data set is a geographic information system (GIS) coverage of the Interstate and United States Highways (Class 1 Roads) for the United States Environmental Protection Agency (USEPA) Mid-Atlantic Integrated Assessment (MAIA) Project region. The coverage was produced using U...

Warming Up to STS. Activities to Encourage Environmental Awareness.

ERIC Educational Resources Information Center

Rosenthal, Dorothy B.

1990-01-01

Developed is an interdisciplinary unit that deals with global warming and the greenhouse effect. Included are 10 lessons that can be used to supplement existing plans or used as a basis for developing a new unit. Included are modeling, laboratory, graphing, role-playing, and discussion activities. (KR)

Canada, Its Land and People.

ERIC Educational Resources Information Center

Massey, Donald; Connors, Bryan

Eight units which depict the people and geography of Canada are featured in this document. Learning is facilitated through the use of maps, case studies, charts, graphs, sketches, photographs, and drawings which appear throughout the units. To help organize the information four symbols are used to indicate the concepts being explained. The symbol…

"As People Get Older, They Get Taller": An Integrated Unit on Measurement, Linear Relationships, and Data Analysis

ERIC Educational Resources Information Center

Joram, Elana; Hartman, Christina; Trafton, Paul R.

2004-01-01

This article describes a unit of instruction designed to promote algebraic thinking in second graders. Students examined second- and fourth-grade students' ages and heights on a table and graph and described the patterns that they observed in the data.

Calorimetric Studies of Bovine Rod Outer Segment Disk Membranes Support a Monomeric Unit for Both Rhodopsin and Opsin

PubMed Central

Edrington, Thomas C.; Bennett, Michael; Albert, Arlene D.

2008-01-01

The photoreceptor rhodopsin is a G-protein coupled receptor that has recently been proposed to exist as a dimer or higher order oligomer, in contrast to the previously described monomer, in retinal rod outer segment disk membranes. Rhodopsin exhibits considerably greater thermal stability than opsin (the bleached form of the receptor), which is reflected in an ∼15°C difference in the thermal denaturation temperatures (Tm) of rhodopsin and opsin as measured by differential scanning calorimetry. Here we use differential scanning calorimetry to investigate the effect of partial bleaching of disk membranes on the Tm of rhodopsin and of opsin in native disk membranes, as well as in cross-linked disk membranes in which rhodopsin dimers are known to be present. The Tms of rhodopsin and opsin are expected to be perturbed if mixed oligomers are present. The Tm remained constant for rhodopsin and opsin in native disks regardless of the level of bleaching. In contrast, the Tm of cross-linked rhodopsin in disk membranes was dependent on the extent of bleaching. The energy of activation for denaturation of rhodopsin and cross-linked rhodopsin was calculated. Cross-linking rhodopsin significantly decreased the energy of activation. We conclude that in native disk membranes, rhodopsin behaves predominantly as a monomer. PMID:18586850

SciSpark: Highly Interactive and Scalable Model Evaluation and Climate Metrics

NASA Astrophysics Data System (ADS)

Wilson, B. D.; Mattmann, C. A.; Waliser, D. E.; Kim, J.; Loikith, P.; Lee, H.; McGibbney, L. J.; Whitehall, K. D.

2014-12-01

Remote sensing data and climate model output are multi-dimensional arrays of massive sizes locked away in heterogeneous file formats (HDF5/4, NetCDF 3/4) and metadata models (HDF-EOS, CF) making it difficult to perform multi-stage, iterative science processing since each stage requires writing and reading data to and from disk. We are developing a lightning fast Big Data technology called SciSpark based on ApacheTM Spark. Spark implements the map-reduce paradigm for parallel computing on a cluster, but emphasizes in-memory computation, "spilling" to disk only as needed, and so outperforms the disk-based ApacheTM Hadoop by 100x in memory and by 10x on disk, and makes iterative algorithms feasible. SciSpark will enable scalable model evaluation by executing large-scale comparisons of A-Train satellite observations to model grids on a cluster of 100 to 1000 compute nodes. This 2nd generation capability for NASA's Regional Climate Model Evaluation System (RCMES) will compute simple climate metrics at interactive speeds, and extend to quite sophisticated iterative algorithms such as machine-learning (ML) based clustering of temperature PDFs, and even graph-based algorithms for searching for Mesocale Convective Complexes. The goals of SciSpark are to: (1) Decrease the time to compute comparison statistics and plots from minutes to seconds; (2) Allow for interactive exploration of time-series properties over seasons and years; (3) Decrease the time for satellite data ingestion into RCMES to hours; (4) Allow for Level-2 comparisons with higher-order statistics or PDF's in minutes to hours; and (5) Move RCMES into a near real time decision-making platform. We will report on: the architecture and design of SciSpark, our efforts to integrate climate science algorithms in Python and Scala, parallel ingest and partitioning (sharding) of A-Train satellite observations from HDF files and model grids from netCDF files, first parallel runs to compute comparison statistics and PDF's, and first metrics quantifying parallel speedups and memory & disk usage.

Exploring the evolution of London's street network in the information space: A dual approach

NASA Astrophysics Data System (ADS)

Masucci, A. Paolo; Stanilov, Kiril; Batty, Michael

2014-01-01

We study the growth of London's street network in its dual representation, as the city has evolved over the past 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the planar graph and represents a transportation unit in the so-called information space, i.e., the space where information is handled in order to navigate through the city. First, we discuss a novel hybrid technique to extract dual graphs from planar graphs, called the hierarchical intersection continuity negotiation principle. Then we show that the growth of the network can be analytically described by logistic laws and that the topological properties of the network are governed by robust log-normal distributions characterizing the network's connectivity and small-world properties that are consistent over time. Moreover, we find that the double-Pareto-like distributions for the connectivity emerge for major roads and can be modeled via a stochastic content-based network model using simple space-filling principles.

Experimental transition probabilities for Mn II spectral lines

NASA Astrophysics Data System (ADS)

Manrique, J.; Aguilera, J. A.; Aragón, C.

2018-06-01

Transition probabilities for 46 spectral lines of Mn II with wavelengths in the range 2000-3500 Å have been measured by CSigma laser-induced breakdown spectroscopy (Cσ-LIBS). For 28 of the lines, experimental data had not been reported previously. The Cσ-LIBS method, based in the construction of generalized curves of growth called Cσ graphs, avoids the error due to self-absorption. The samples used to generate the laser-induced plasmas are fused glass disks prepared from pure MnO. The Mn concentrations in the samples and the lines included in the study are selected to ensure the validity of the model of homogeneous plasma used. The results are compared to experimental and theoretical values available in the literature.

Knotting fingerprints resolve knot complexity and knotting pathways in ideal knots.

PubMed

Hyde, David A B; Henrich, Joshua; Rawdon, Eric J; Millett, Kenneth C

2015-09-09

We use disk matrices to define knotting fingerprints that provide fine-grained insights into the local knotting structure of ideal knots. These knots have been found to have spatial properties that highly correlate with those of interesting macromolecules. From this fine structure and an analysis of the associated planar graph, one can define a measure of knot complexity using the number of independent unknotting pathways from the global knot type as the knot is trimmed progressively to a short arc unknot. A specialization of the Cheeger constant provides a measure of constraint on these independent unknotting pathways. Furthermore, the structure of the knotting fingerprint supports a comparison of the tight knot pathways to the unconstrained unknotting pathways of comparable length.

Inexpensive portable drug detector

NASA Technical Reports Server (NTRS)

Dimeff, J.; Heimbuch, A. H.; Parker, J. A.

1977-01-01

Inexpensive, easy-to-use, self-scanning, self-calibrating, portable unit automatically graphs fluorescence spectrum of drug sample. Device also measures rate of movement through chromatographic column for forensic and medical testing.

Information Theory, Inference and Learning Algorithms

NASA Astrophysics Data System (ADS)

Mackay, David J. C.

2003-10-01

Information theory and inference, often taught separately, are here united in one entertaining textbook. These topics lie at the heart of many exciting areas of contemporary science and engineering - communication, signal processing, data mining, machine learning, pattern recognition, computational neuroscience, bioinformatics, and cryptography. This textbook introduces theory in tandem with applications. Information theory is taught alongside practical communication systems, such as arithmetic coding for data compression and sparse-graph codes for error-correction. A toolbox of inference techniques, including message-passing algorithms, Monte Carlo methods, and variational approximations, are developed alongside applications of these tools to clustering, convolutional codes, independent component analysis, and neural networks. The final part of the book describes the state of the art in error-correcting codes, including low-density parity-check codes, turbo codes, and digital fountain codes -- the twenty-first century standards for satellite communications, disk drives, and data broadcast. Richly illustrated, filled with worked examples and over 400 exercises, some with detailed solutions, David MacKay's groundbreaking book is ideal for self-learning and for undergraduate or graduate courses. Interludes on crosswords, evolution, and sex provide entertainment along the way. In sum, this is a textbook on information, communication, and coding for a new generation of students, and an unparalleled entry point into these subjects for professionals in areas as diverse as computational biology, financial engineering, and machine learning.

Protoplanetary Worlds at the Astronomical Unit Scale. First Step towards Aperture Synthesis Images

NASA Astrophysics Data System (ADS)

Berger, J.; Monnier, J.; Millan-Gabet, R.; Malbet, F.; Benisty, M.; Pedretti, E.; Traub, W.

Optical interferometry has started to play a crucial role in the field of star formation. In particular, it offers a unique opportunity to observe protoplanetary disks at a spatial scale where planets may be forming. We present here some of the most recent discoveries in this field putting the emphasis on the progress towards direct imaging of proto-planetary worlds at the astronomical unit scale. In particular we develop our use of the IOTA/IONIC3 interferometer to measure closure phase quantities, a powerful observable to quantify the degree of skewness of the infrared emission at spatial scales corresponding to the internal part of the disk.

Portable light source unit for simulating fires having an adjustable aperture

NASA Technical Reports Server (NTRS)

Youngquist, Robert C. (Inventor); Moerk, John S. (Inventor); Strobel, James P. (Inventor)

1997-01-01

A portable, hand held light source unit is employed to check operation of fire detectors, such as hydrogen fire detectors. The unit emits radiation in a narrow band of wavelengths which are generated by the type of fire to be tested, but not by other light sources such as the sun or incandescent lamps. The unit can test fire detectors at different distances, and of different sensitivities. The intensity of the radiation emitted by the unit is adjustable for this purpose by means of a rotatable disk having a plurality of different sized apertures for selective placement between the light source and an output lens. The disk can also be rotated to a calibration position which causes a microprocessor circuit in the unit to initiate a calibration procedure. During this procedure, the lamp intensity is measured by a photodetector contained within the unit, and the microprocessor adjusts the lamp current to insure that its intensity remains within a preset range of values. A green and a red LED are mounted on the unit which indicate to an operator whether the calibration is successful, as well as the condition of the unit's battery power supply.

Equilibrium moisture content of wood in outdoor locations in the United States and worldwide

Treesearch

W. T. Simpson

1998-01-01

With relative humidity and temperature data from the National Oceanic and Atmospheric Administration, the average equilibrium moisture content for each month of the year was calculated for 262 locations in the United States and 122 locations outside the United States. As an aid for storage of kiln-dried lumber, a graph is presented for determining the reduction in...

COLA: Optimizing Stream Processing Applications via Graph Partitioning

NASA Astrophysics Data System (ADS)

Khandekar, Rohit; Hildrum, Kirsten; Parekh, Sujay; Rajan, Deepak; Wolf, Joel; Wu, Kun-Lung; Andrade, Henrique; Gedik, Buğra

In this paper, we describe an optimization scheme for fusing compile-time operators into reasonably-sized run-time software units called processing elements (PEs). Such PEs are the basic deployable units in System S, a highly scalable distributed stream processing middleware system. Finding a high quality fusion significantly benefits the performance of streaming jobs. In order to maximize throughput, our solution approach attempts to minimize the processing cost associated with inter-PE stream traffic while simultaneously balancing load across the processing hosts. Our algorithm computes a hierarchical partitioning of the operator graph based on a minimum-ratio cut subroutine. We also incorporate several fusion constraints in order to support real-world System S jobs. We experimentally compare our algorithm with several other reasonable alternative schemes, highlighting the effectiveness of our approach.

We, the Asian and Pacific Islander Americans.

ERIC Educational Resources Information Center

Johnson, Dwight L.; And Others

Demographic data are presented about the people who have immigrated to the United States from Asia and the Pacific Islands. Twelve figures (pie charts, bar graphs, and maps), and eight tables provide detailed, statistical information on such things as (1) distribution of Asians and Pacific Islanders in the United States, (2) states with the…

Plate Tectonics: The Way the Earth Works. Teacher's Guide. LHS GEMS.

ERIC Educational Resources Information Center

Cuff, Kevin

This teacher guide presents a unit on plate tectonics and introduces hands-on activities for students in grades 6-8. In each unit, students act as real scientists and gather evidence by using science process skills such as observing, graphing, analyzing data, designing and making models, visualizing, communicating, theorizing, and drawing…

[Environmental Education Units.

ERIC Educational Resources Information Center

Minneapolis Independent School District 275, Minn.

Two of these three pamphlets describe methods of teaching young elementary school children the principles of sampling. Tiles of five colors are added to a tub and children sample these randomly; using the tiles as units for a graph, they draw a representation of the population. Pooling results leads to a more reliable sample. Practice is given in…

Paint a Playground

ERIC Educational Resources Information Center

Modern Schools, 1977

1977-01-01

A new graph transfer method will enable schools to increase the use of recreational surfaces by color coating them with maps of the United States, the world, and whimsical animal game designs. (Author/MLF)

THE GRAVITATIONAL INTERACTION BETWEEN PLANETS ON INCLINED ORBITS AND PROTOPLANETARY DISKS AS THE ORIGIN OF PRIMORDIAL SPIN–ORBIT MISALIGNMENTS

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

Matsakos, Titos; Königl, Arieh

Many of the observed spin–orbit alignment properties of exoplanets can be explained in the context of the primordial disk misalignment model, in which an initially aligned protoplanetary disk is torqued by a distant stellar companion on a misaligned orbit, resulting in a precessional motion that can lead to large-amplitude oscillations of the spin–orbit angle. We consider a variant of this model in which the companion is a giant planet with an orbital radius of a few astronomical units. Guided by the results of published numerical simulations, we model the dynamical evolution of this system by dividing the disk into inner andmore » outer parts—separated at the location of the planet—that behave as distinct, rigid disks. We show that the planet misaligns the inner disk even as the orientation of the outer disk remains unchanged. In addition to the oscillations induced by the precessional motion, whose amplitude is larger the smaller the initial inner-disk-to-planet mass ratio, the spin–orbit angle also exhibits a secular growth in this case—driven by ongoing mass depletion from the disk—that becomes significant when the inner disk’s angular momentum drops below that of the planet. Altogether, these two effects can produce significant misalignment angles for the inner disk, including retrograde configurations. We discuss these results within the framework of the Stranded Hot Jupiter scenario and consider their implications, including the interpretation of the alignment properties of debris disks.« less

Zodiac II: Debris Disk Science from a Balloon

NASA Technical Reports Server (NTRS)

Bryden, Geoffrey; Traub, Wesley; Roberts, Lewis C., Jr.; Bruno, Robin; Unwin, Stephen; Backovsky, Stan; Brugarolas, Paul; Chakrabarti, Supriya; Chen, Pin; Hillenbrand, Lynne;

Google matrix of business process management

NASA Astrophysics Data System (ADS)

Abel, M. W.; Shepelyansky, D. L.

2011-12-01

Development of efficient business process models and determination of their characteristic properties are subject of intense interdisciplinary research. Here, we consider a business process model as a directed graph. Its nodes correspond to the units identified by the modeler and the link direction indicates the causal dependencies between units. It is of primary interest to obtain the stationary flow on such a directed graph, which corresponds to the steady-state of a firm during the business process. Following the ideas developed recently for the World Wide Web, we construct the Google matrix for our business process model and analyze its spectral properties. The importance of nodes is characterized by PageRank and recently proposed CheiRank and 2DRank, respectively. The results show that this two-dimensional ranking gives a significant information about the influence and communication properties of business model units. We argue that the Google matrix method, described here, provides a new efficient tool helping companies to make their decisions on how to evolve in the exceedingly dynamic global market.

The Portevin-Le Chatelier Effect in the Ni-Based Superalloy IN100

NASA Astrophysics Data System (ADS)

Fernandez-Zelaia, Patxi; Adair, Benjamin S.; Barker, Vincent M.; Antolovich, Stephen D.

2015-12-01

The Portevin-Le Chatelier (PLC) effect has been studied in the Ni-based superalloy IN100 which is currently used as a disk material in jet engines. A series of tensile tests was carried out at 588 K, 755 K, and 922 K (315 °C, 482 °C, and 649 °C) at plastic strain rates ranging from a low of 6.21 × 10-6 s-1 to a high of 4.92 × 10-2 s-1. The activation energy was determined using the slope of a line on a strain rate/temperature graph which divided the area of the graph into two regions: (1) "PLC behavior observed," and (2) "No PLC behavior observed." A new statistical approach was developed to objectively differentiate between a true PLC effect and experimental uncertainty ( i.e., "noise"). The value of the activation energy was found to be 1.14 eV/atom, which strongly suggests that the rate controlling process was bulk diffusion of C in the lattice. A qualitative model, based on the Orowan equation and slip band dislocation mechanics, was proposed, which unifies the seemingly disparate ideas of the process being controlled by a single atom/dislocation interaction while at the same time exhibiting significant strains during PLC load drops.

Variation in Loblolly pine cross-sectional microfibril angle with tree height and physiographic region

Treesearch

Lewis Jordon; Rechum Re; Daniel B. Hall; Alexander Clark; Richard F. Daniels

2006-01-01

The effect of height and physiographic region on whole disk cross-sectional microfibril angle (CSMFA) in loblolly pine (Pinus raeda L.) in the southern United States was evaluated. Whole disk CSMFA was determined at 1.4, 4.6, 7.6, 10.7, and 13.7 m up the stem of 59 trees, representing five physiographic regions. A mixed-effects analysis of variance was performed to...

The Gaia-ESO Survey: Separating disk chemical substructures with cluster models. Evidence of a separate evolution in the metal-poor thin disk

NASA Astrophysics Data System (ADS)

Rojas-Arriagada, A.; Recio-Blanco, A.; de Laverny, P.; Schultheis, M.; Guiglion, G.; Mikolaitis, Š.; Kordopatis, G.; Hill, V.; Gilmore, G.; Randich, S.; Alfaro, E. J.; Bensby, T.; Koposov, S. E.; Costado, M. T.; Franciosini, E.; Hourihane, A.; Jofré, P.; Lardo, C.; Lewis, J.; Lind, K.; Magrini, L.; Monaco, L.; Morbidelli, L.; Sacco, G. G.; Worley, C. C.; Zaggia, S.; Chiappini, C.

2016-02-01

Context. Recent spectroscopic surveys have begun to explore the Galactic disk system on the basis of large data samples, with spatial distributions sampling regions well outside the solar neighborhood. In this way, they provide valuable information for testing spatial and temporal variations of disk structure kinematics and chemical evolution. Aims: The main purposes of this study are to demonstrate the usefulness of a rigorous mathematical approach to separate substructures of a stellar sample in the abundance-metallicity plane, and provide new evidence with which to characterize the nature of the metal-poor end of the thin disk sequence. Methods: We used a Gaussian mixture model algorithm to separate in the [Mg/Fe] vs. [Fe/H] plane a clean disk star subsample (essentially at RGC< 10 kpc) from the Gaia-ESO survey (GES) internal data release 2 (iDR2). We aim at decomposing it into data groups highlighting number density and/or slope variations in the abundance-metallicity plane. An independent sample of disk red clump stars from the Apache Point Observatory Galactic Evolution Experiment (APOGEE) was used to cross-check the identified features. Results: We find that the sample is separated into five groups associated with major Galactic components; the metal-rich end of the halo, the thick disk, and three subgroups for the thin disk sequence. This is confirmed with the sample of red clump stars from APOGEE. The three thin disk groups served to explore this sequence in more detail. The two metal-intermediate and metal-rich groups of the thin disk decomposition ([Fe/H] > -0.25 dex) highlight a change in the slope at solar metallicity. This holds true at different radial regions of the Milky Way. The distribution of Galactocentric radial distances of the metal-poor part of the thin disk ([Fe/H] < -0.25 dex) is shifted to larger distances than those of the more metal-rich parts. Moreover, the metal-poor part of the thin disk presents indications of a scale height intermediate between those of the thick and the rest of the thin disk, and it displays higher azimuthal velocities than the latter. These stars might have formed and evolved in parallel and/or dissociated from the inside-out formation taking place in the internal thin disk. Their enhancement levels might be due to their origin from gas pre-enriched by outflows from the thick disk or the inner halo. The smooth trends of their properties (their spatial distribution with respect to the plane, in particular) with [Fe/H] and [Mg/Fe] suggested by the data indicates a quiet dynamical evolution, with no relevant merger events. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under programme ID 188.B-3002. These data products have been processed by the Cambridge Astronomy Survey Unit (CASU) at the Institute of Astronomy, University of Cambridge, and by the FLAMES/UVES reduction team at INAF/Osservatorio Astrofisico di Arcetri. These data have been obtained from the Gaia-ESO Survey Data Archive, prepared and hosted by the Wide Field Astronomy Unit, Institute for Astronomy, University of Edinburgh, which is funded by the UK Science and Technology Facilities Council.

Energy Perspectives: Trends and Milestones

EIA Publications

2012-01-01

Energy Perspectives is a graphical overview of energy history in the United States. The 43 graphs shown here reveal sweeping trends related to the nation's production, consumption, and trade of energy from 1949 through 2011.

Hypergraph partitioning implementation for parallelizing matrix-vector multiplication using CUDA GPU-based parallel computing

NASA Astrophysics Data System (ADS)

Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.

2017-07-01

Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).

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

Oohama, N.; Okamura, S.; Fukugita, M.

A bulge-disk decomposition is made for 737 spiral and lenticular galaxies drawn from a Sloan Digital Sky Survey galaxy sample for which morphological types are estimated. We carry out the bulge-disk decomposition using the growth curve fitting method. It is found that bulge properties, effective radius, effective surface brightness, and also absolute magnitude, change systematically with the morphological sequence; from early to late types, the size becomes somewhat larger, and surface brightness and luminosity fainter. In contrast, disks are nearly universal, their properties remaining similar among disk galaxies irrespective of detailed morphologies from S0 to Sc. While these tendencies weremore » often discussed in previous studies, the present study confirms them based on a large homogeneous magnitude-limited field galaxy sample with morphological types estimated. The systematic change of bulge-to-total luminosity ratio, B/T, along the morphological sequence is therefore not caused by disks but mostly by bulges. It is also shown that elliptical galaxies and bulges of spiral galaxies are unlikely to be in a single sequence. We infer the stellar mass density (in units of the critical mass density) to be OMEGA = 0.0021 for spheroids, i.e., elliptical galaxies plus bulges of spiral galaxies, and OMEGA = 0.00081 for disks.« less

Application of graph-based semi-supervised learning for development of cyber COP and network intrusion detection

NASA Astrophysics Data System (ADS)

Levchuk, Georgiy; Colonna-Romano, John; Eslami, Mohammed

2017-05-01

The United States increasingly relies on cyber-physical systems to conduct military and commercial operations. Attacks on these systems have increased dramatically around the globe. The attackers constantly change their methods, making state-of-the-art commercial and military intrusion detection systems ineffective. In this paper, we present a model to identify functional behavior of network devices from netflow traces. Our model includes two innovations. First, we define novel features for a host IP using detection of application graph patterns in IP's host graph constructed from 5-min aggregated packet flows. Second, we present the first application, to the best of our knowledge, of Graph Semi-Supervised Learning (GSSL) to the space of IP behavior classification. Using a cyber-attack dataset collected from NetFlow packet traces, we show that GSSL trained with only 20% of the data achieves higher attack detection rates than Support Vector Machines (SVM) and Naïve Bayes (NB) classifiers trained with 80% of data points. We also show how to improve detection quality by filtering out web browsing data, and conclude with discussion of future research directions.

Zernike-like systems in polygons and polygonal facets.

PubMed

Ferreira, Chelo; López, José L; Navarro, Rafael; Sinusía, Ester Pérez

2015-07-20

Zernike polynomials are commonly used to represent the wavefront phase on circular optical apertures, since they form a complete and orthonormal basis on the unit disk. In [Opt. Lett.32, 74 (2007)10.1364/OL.32.000074OPLEDP0146-9592] we introduced a new Zernike basis for elliptic and annular optical apertures based on an appropriate diffeomorphism between the unit disk and the ellipse and the annulus. Here, we present a generalization of this Zernike basis for a variety of important optical apertures, paying special attention to polygons and the polygonal facets present in segmented mirror telescopes. On the contrary to ad hoc solutions, most of them based on the Gram-Smith orthonormalization method, here we consider a piecewise diffeomorphism that transforms the unit disk into the polygon under consideration. We use this mapping to define a Zernike-like orthonormal system over the polygon. We also consider ensembles of polygonal facets that are essential in the design of segmented mirror telescopes. This generalization, based on in-plane warping of the basis functions, provides a unique solution, and what is more important, it guarantees a reasonable level of invariance of the mathematical properties and the physical meaning of the initial basis functions. Both the general form and the explicit expressions for a typical example of telescope optical aperture are provided.

KMC 2: fast and resource-frugal k-mer counting.

PubMed

Deorowicz, Sebastian; Kokot, Marek; Grabowski, Szymon; Debudaj-Grabysz, Agnieszka

2015-05-15

Building the histogram of occurrences of every k-symbol long substring of nucleotide data is a standard step in many bioinformatics applications, known under the name of k-mer counting. Its applications include developing de Bruijn graph genome assemblers, fast multiple sequence alignment and repeat detection. The tremendous amounts of NGS data require fast algorithms for k-mer counting, preferably using moderate amounts of memory. We present a novel method for k-mer counting, on large datasets about twice faster than the strongest competitors (Jellyfish 2, KMC 1), using about 12 GB (or less) of RAM. Our disk-based method bears some resemblance to MSPKmerCounter, yet replacing the original minimizers with signatures (a carefully selected subset of all minimizers) and using (k, x)-mers allows to significantly reduce the I/O and a highly parallel overall architecture allows to achieve unprecedented processing speeds. For example, KMC 2 counts the 28-mers of a human reads collection with 44-fold coverage (106 GB of compressed size) in about 20 min, on a 6-core Intel i7 PC with an solid-state disk. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

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

Pawellek, Nicole; Krivov, Alexander V.; Marshall, Jonathan P.

The radii of debris disks and the sizes of their dust grains are important tracers of the planetesimal formation mechanisms and physical processes operating in these systems. Here we use a representative sample of 34 debris disks resolved in various Herschel Space Observatory (Herschel is an ESA space observatory with science instruments provided by European-led Principal Investigator consortia and with important participation from NASA) programs to constrain the disk radii and the size distribution of their dust. While we modeled disks with both warm and cold components, and identified warm inner disks around about two-thirds of the stars, we focusmore » our analysis only on the cold outer disks, i.e., Kuiper-belt analogs. We derive the disk radii from the resolved images and find a large dispersion for host stars of any spectral class, but no significant trend with the stellar luminosity. This argues against ice lines as a dominant player in setting the debris disk sizes, since the ice line location varies with the luminosity of the central star. Fixing the disk radii to those inferred from the resolved images, we model the spectral energy distribution to determine the dust temperature and the grain size distribution for each target. While the dust temperature systematically increases toward earlier spectral types, the ratio of the dust temperature to the blackbody temperature at the disk radius decreases with the stellar luminosity. This is explained by a clear trend of typical sizes increasing toward more luminous stars. The typical grain sizes are compared to the radiation pressure blowout limit s {sub blow} that is proportional to the stellar luminosity-to-mass ratio and thus also increases toward earlier spectral classes. The grain sizes in the disks of G- to A-stars are inferred to be several times s {sub blow} at all stellar luminosities, in agreement with collisional models of debris disks. The sizes, measured in the units of s {sub blow}, appear to decrease with the luminosity, which may be suggestive of the disk's stirring level increasing toward earlier-type stars. The dust opacity index β ranges between zero and two, and the size distribution index q varies between three and five for all the disks in the sample.« less

Observation of Eye Pattern on Super-Resolution Near-Field Structure Disk with Write-Strategy Technique

NASA Astrophysics Data System (ADS)

Fuji, Hiroshi; Kikukawa, Takashi; Tominaga, Junji

2004-07-01

Pit-edge recording at a density of 150 nm pits and spaces is carried out on a super-resolution near-field structure (super-RENS) disk with a platinum oxide layer. Pits are recorded and read using a 635-nm-wavelength laser and an objective lens with a 0.6 numerical aperture. We arrange laser pulses to correctly record the pits on the disk by a write-strategy technique. The laser-pulse figure includes a unit time of 0.25 T and intensities of Pw1, Pw2 and Pw3. After recording pits of various lengths, the observation of an eye pattern is achieved despite a pit smaller than the resolution limit. Furthermore, the eye pattern maintains its shape even though other pits fill the adjacent tracks at a track density of 600 nm. The disk can be used as a pit-edge recording system through a write-strategy technique.

Capsule- and disk-filter procedure

USGS Publications Warehouse

Skrobialowski, Stanley C.

2016-01-01

Capsule and disk filters are disposable, self-contained units composed of a pleated or woven filter medium encased in a polypropylene or other plastic housing that can be connected inline to a sample-delivery system (such as a submersible or peristaltic pump) that generates sufficient pressure (positive or negative) to force water through the filter. Filter media are available in several pore sizes, but 0.45 µm is the pore size used routinely for most studies at this time. Capsule or disk filters (table 5.2.1.A.1) are required routinely for most studies when filtering samples for trace-element analyses and are recommended when filtering samples for major-ion or other inorganic-constituent analyses.

Dynamics of acoustically levitated disk samples.

PubMed

Xie, W J; Wei, B

2004-10-01

The acoustic levitation force on disk samples and the dynamics of large water drops in a planar standing wave are studied by solving the acoustic scattering problem through incorporating the boundary element method. The dependence of levitation force amplitude on the equivalent radius R of disks deviates seriously from the R3 law predicted by King's theory, and a larger force can be obtained for thin disks. When the disk aspect ratio gamma is larger than a critical value gamma(*) ( approximately 1.9 ) and the disk radius a is smaller than the critical value a(*) (gamma) , the levitation force per unit volume of the sample will increase with the enlargement of the disk. The acoustic levitation force on thin-disk samples ( gamma

Dynamics of acoustically levitated disk samples

NASA Astrophysics Data System (ADS)

Xie, W. J.; Wei, B.

2004-10-01

The acoustic levitation force on disk samples and the dynamics of large water drops in a planar standing wave are studied by solving the acoustic scattering problem through incorporating the boundary element method. The dependence of levitation force amplitude on the equivalent radius R of disks deviates seriously from the R3 law predicted by King’s theory, and a larger force can be obtained for thin disks. When the disk aspect ratio γ is larger than a critical value γ*(≈1.9) and the disk radius a is smaller than the critical value a*(γ) , the levitation force per unit volume of the sample will increase with the enlargement of the disk. The acoustic levitation force on thin-disk samples (γ⩽γ*) can be formulated by the shape factor f(γ,a) when a⩽a*(γ) . It is found experimentally that a necessary condition of the acoustic field for stable levitation of a large water drop is to adjust the reflector-emitter interval H slightly above the resonant interval Hn . The simulation shows that the drop is flattened and the central parts of its top and bottom surface become concave with the increase of sound pressure level, which agrees with the experimental observation. The main frequencies of the shape oscillation under different sound pressures are slightly larger than the Rayleigh frequency because of the large shape deformation. The simulated translational frequencies of the vertical vibration under normal gravity condition agree with the theoretical analysis.

Resistance Distances and Kirchhoff Index in Generalised Join Graphs

NASA Astrophysics Data System (ADS)

Chen, Haiyan

2017-03-01

The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a unit resistor. The Kirchhoff index of a graph is defined as the sum of all the resistance distances between any pair of vertices of the graph. Let G=H[G1, G2, …, Gk ] be the generalised join graph of G1, G2, …, Gk determined by H. In this paper, we first give formulae for resistance distances and Kirchhoff index of G in terms of parameters of G'is {G'_i}s and H. Then, we show that computing resistance distances and Kirchhoff index of G can be decomposed into simpler ones. Finally, we obtain explicit formulae for resistance distances and Kirchhoff index of G when G'is {G'_i}s and H take some special graphs, such as the complete graph, the path, and the cycle.

Recent Trends in Fertility and Mortality in Hungary: A Curriculum Unit. Fulbright-Hays Summer Seminars Abroad Program, 1998 (Hungary/Poland).

ERIC Educational Resources Information Center

Behr, Michelle

This curriculum unit, suitable for advanced placement high school courses or introductory level college courses, explores Hungarian fertility and mortality rates and their social and economic consequences. Students are required to map, graph, analyze, and summarize demographic data to examine population trends in Hungary in the post-World War 2…

Altering Public University Admission Standards to Preserve White Group Position in the United States: Results from a Laboratory Experiment

ERIC Educational Resources Information Center

Samson, Frank L.

2013-01-01

This study identifies a theoretical mechanism that could potentially affect public university admissions standards in a context of demographic change. I explore how demographic changes at a prestigious public university in the United States affect individuals' evaluations of college applications. Responding to a line graph that randomly displays a…

SciSpark: Highly Interactive and Scalable Model Evaluation and Climate Metrics

NASA Astrophysics Data System (ADS)

Wilson, B. D.; Palamuttam, R. S.; Mogrovejo, R. M.; Whitehall, K. D.; Mattmann, C. A.; Verma, R.; Waliser, D. E.; Lee, H.

2015-12-01

Remote sensing data and climate model output are multi-dimensional arrays of massive sizes locked away in heterogeneous file formats (HDF5/4, NetCDF 3/4) and metadata models (HDF-EOS, CF) making it difficult to perform multi-stage, iterative science processing since each stage requires writing and reading data to and from disk. We are developing a lightning fast Big Data technology called SciSpark based on ApacheTM Spark under a NASA AIST grant (PI Mattmann). Spark implements the map-reduce paradigm for parallel computing on a cluster, but emphasizes in-memory computation, "spilling" to disk only as needed, and so outperforms the disk-based ApacheTM Hadoop by 100x in memory and by 10x on disk. SciSpark will enable scalable model evaluation by executing large-scale comparisons of A-Train satellite observations to model grids on a cluster of 10 to 1000 compute nodes. This 2nd generation capability for NASA's Regional Climate Model Evaluation System (RCMES) will compute simple climate metrics at interactive speeds, and extend to quite sophisticated iterative algorithms such as machine-learning based clustering of temperature PDFs, and even graph-based algorithms for searching for Mesocale Convective Complexes. We have implemented a parallel data ingest capability in which the user specifies desired variables (arrays) as several time-sorted lists of URL's (i.e. using OPeNDAP model.nc?varname, or local files). The specified variables are partitioned by time/space and then each Spark node pulls its bundle of arrays into memory to begin a computation pipeline. We also investigated the performance of several N-dim. array libraries (scala breeze, java jblas & netlib-java, and ND4J). We are currently developing science codes using ND4J and studying memory behavior on the JVM. On the pyspark side, many of our science codes already use the numpy and SciPy ecosystems. The talk will cover: the architecture of SciSpark, the design of the scientific RDD (sRDD) data structure, our efforts to integrate climate science algorithms in Python and Scala, parallel ingest and partitioning of A-Train satellite observations from HDF files and model grids from netCDF files, first parallel runs to compute comparison statistics and PDF's, and first metrics quantifying parallel speedups and memory & disk usage.

Understanding Solubility through Excel Spreadsheets

NASA Astrophysics Data System (ADS)

Brown, Pamela

2001-02-01

This article describes assignments related to the solubility of inorganic salts that can be given in an introductory general chemistry course. Le Châtelier's principle, solubility, unit conversion, and thermodynamics are tied together to calculate heats of solution by two methods: heats of formation and an application of the van't Hoff equation. These assignments address the need for math, graphing, and computer skills in the chemical technology program by developing skill in the use of Microsoft Excel to prepare spreadsheets and graphs and to perform linear and nonlinear curve-fitting. Background information on the value of understanding and predicting solubility is provided.

Using Zipf-Mandelbrot law and graph theory to evaluate animal welfare

NASA Astrophysics Data System (ADS)

de Oliveira, Caprice G. L.; Miranda, José G. V.; Japyassú, Hilton F.; El-Hani, Charbel N.

2018-02-01

This work deals with the construction and testing of metrics of welfare based on behavioral complexity, using assumptions derived from Zipf-Mandelbrot law and graph theory. To test these metrics we compared yellow-breasted capuchins (Sapajus xanthosternos) (Wied-Neuwied, 1826) (PRIMATES CEBIDAE) found in two institutions, subjected to different captive conditions: a Zoobotanical Garden (hereafter, ZOO; n = 14), in good welfare condition, and a Wildlife Rescue Center (hereafter, WRC; n = 8), in poor welfare condition. In the Zipf-Mandelbrot-based analysis, the power law exponent was calculated using behavior frequency values versus behavior rank value. These values allow us to evaluate variations in individual behavioral complexity. For each individual we also constructed a graph using the sequence of behavioral units displayed in each recording (average recording time per individual: 4 h 26 min in the ZOO, 4 h 30 min in the WRC). Then, we calculated the values of the main graph attributes, which allowed us to analyze the complexity of the connectivity of the behaviors displayed in the individuals' behavioral sequences. We found significant differences between the two groups for the slope values in the Zipf-Mandelbrot analysis. The slope values for the ZOO individuals approached -1, with graphs representing a power law, while the values for the WRC individuals diverged from -1, differing from a power law pattern. Likewise, we found significant differences for the graph attributes average degree, weighted average degree, and clustering coefficient when comparing the ZOO and WRC individual graphs. However, no significant difference was found for the attributes modularity and average path length. Both analyses were effective in detecting differences between the patterns of behavioral complexity in the two groups. The slope values for the ZOO individuals indicated a higher behavioral complexity when compared to the WRC individuals. Similarly, graph construction and the calculation of its attributes values allowed us to show that the complexity of the connectivity among the behaviors was higher in the ZOO than in the WRC individual graphs. These results show that the two measuring approaches introduced and tested in this paper were capable of capturing the differences in welfare levels between the two conditions, as shown by differences in behavioral complexity.

Needle puncture in rabbit functional spinal units alters rotational biomechanics.

PubMed

Hartman, Robert A; Bell, Kevin M; Quan, Bichun; Nuzhao, Yao; Sowa, Gwendolyn A; Kang, James D

2015-04-01

An in vitro biomechanical study for rabbit lumbar functional spinal units (FSUs) using a robot-based spine testing system. To elucidate the effect of annular puncture with a 16 G needle on mechanical properties in flexion/extension, axial rotation, and lateral bending. Needle puncture of the intervertebral disk has been shown to alter mechanical properties of the disk in compression, torsion, and bending. The effect of needle puncture in FSUs, where intact spinal ligaments and facet joints may mitigate or amplify these changes in the disk, on spinal motion segment stability subject to physiological rotations remains unknown. Rabbit FSUs were tested using a robot testing system whose force/moment and position precision were assessed to demonstrate system capability. Flexibility testing methods were developed by load-to-failure testing in flexion/extension, axial rotation, and lateral bending. Subsequent testing methods were used to examine a 16 G needle disk puncture and No. 11 blade disk stab (positive control for mechanical disruption). Flexibility testing was used to assess segmental range-of-motion (degrees), neutral zone stiffness (N m/degrees) and width (degrees and N m), and elastic zone stiffness before and after annular injury. The robot-based system was capable of performing flexibility testing on FSUs-mean precision of force/moment measurements and robot system movements were <3% and 1%, respectively, of moment-rotation target values. Flexibility moment targets were 0.3 N m for flexion and axial rotation and 0.15 N m for extension and lateral bending. Needle puncture caused significant (P<0.05) changes only in flexion/extension range-of-motion and neutral zone stiffness and width (N m) compared with preintervention. No. 11 blade-stab significantly increased range-of-motion in all motions, decreased neutral zone stiffness and width (N m) in flexion/extension, and increased elastic zone stiffness in flexion and lateral bending. These findings suggest that disk puncture and stab can destabilize FSUs in primary rotations.

Formation of Gradient Structures in the Zone of Joining a Deformable Nickel Alloy and a Single-Crystal Intermetallic Alloy during Thermodiffusion Pressure Welding and Subsequent Heat Treatment

NASA Astrophysics Data System (ADS)

Povarova, K. B.; Valitov, V. A.; Drozdov, A. A.; Bazyleva, O. A.; Galieva, E. V.; Arginbaeva, E. G.

2018-01-01

The possibility of formation of a high-quality solid-phase joint of an Ni3Al-based single-crystal intermetallic VKNA-25 blade alloy with a high-temperature deformable EP975 disk alloy by pressure welding is studied to create high-performance one-piece blisk unit for the next-generation aviation gas turbine engines and to decrease the unit mass. The influence of the conditions of thermodiffusion pressure welding under the hightemperature superplasticity of the disk alloy and the influence of heat treatment of welded joints on the gradient structures in the welded joint zone and the structure at the periphery of the welded samples are investigated.

[Health for All-Italia: an indicator system on health].

PubMed

Burgio, Alessandra; Crialesi, Roberta; Loghi, Marzia

2003-01-01

The Health for All - Italia information system collects health data from several sources. It is intended to be a cornerstone for the achievement of an overview about health in Italy. Health is analyzed at different levels, ranging from health services, health needs, lifestyles, demographic, social, economic and environmental contexts. The database associated software allows to pin down statistical data into graphs and tables, and to carry out simple statistical analysis. It is therefore possible to view the indicators' time series, make simple projections and compare the various indicators over the years for each territorial unit. This is possible by means of tables, graphs (histograms, line graphs, frequencies, linear regression with calculation of correlation coefficients, etc) and maps. These charts can be exported to other programs (i.e. Word, Excel, Power Point), or they can be directly printed in color or black and white.

On Topological Indices of Certain Families of Nanostar Dendrimers.

PubMed

Husin, Mohamad Nazri; Hasni, Roslan; Arif, Nabeel Ezzulddin; Imran, Muhammad

2016-06-24

A topological index of graph G is a numerical parameter related to G which characterizes its molecular topology and is usually graph invariant. In the field of quantitative structure-activity (QSAR)/quantitative structure-activity structure-property (QSPR) research, theoretical properties of the chemical compounds and their molecular topological indices such as the Randić connectivity index, atom-bond connectivity (ABC) index and geometric-arithmetic (GA) index are used to predict the bioactivity of different chemical compounds. A dendrimer is an artificially manufactured or synthesized molecule built up from the branched units called monomers. In this paper, the fourth version of ABC index and the fifth version of GA index of certain families of nanostar dendrimers are investigated. We derive the analytical closed formulas for these families of nanostar dendrimers. The obtained results can be of use in molecular data mining, particularly in researching the uniqueness of tested (hyper-branched) molecular graphs.

Gambler's ruin problem on Erdős-Rényi graphs

NASA Astrophysics Data System (ADS)

Néda, Zoltán; Davidova, Larissa; Újvári, Szeréna; Istrate, Gabriel

2017-02-01

A multiagent ruin-game is studied on Erdős-Rényi type graphs. Initially the players have the same wealth. At each time step a monopolist game is played on all active links (links that connect nodes with nonzero wealth). In such a game each player puts a unit wealth in the pot and the pot is won with equal probability by one of the players. The game ends when there are no connected players such that both of them have non-zero wealth. In order to characterize the final state for dense graphs a compact formula is given for the expected number of the remaining players with non-zero wealth and the wealth distribution among these players. Theoretical predictions are given for the expected duration of the ruin game. The dynamics of the number of active players is also investigated. Validity of the theoretical predictions is investigated by Monte Carlo experiments.

Graph Theory at the Service of Electroencephalograms.

PubMed

Iakovidou, Nantia D

2017-04-01

The brain is one of the largest and most complex organs in the human body and EEG is a noninvasive electrophysiological monitoring method that is used to record the electrical activity of the brain. Lately, the functional connectivity in human brain has been regarded and studied as a complex network using EEG signals. This means that the brain is studied as a connected system where nodes, or units, represent different specialized brain regions and links, or connections, represent communication pathways between the nodes. Graph theory and theory of complex networks provide a variety of measures, methods, and tools that can be useful to efficiently model, analyze, and study EEG networks. This article is addressed to computer scientists who wish to be acquainted and deal with the study of EEG data and also to neuroscientists who would like to become familiar with graph theoretic approaches and tools to analyze EEG data.

On a phase diagram for random neural networks with embedded spike timing dependent plasticity.

PubMed

Turova, Tatyana S; Villa, Alessandro E P

2007-01-01

This paper presents an original mathematical framework based on graph theory which is a first attempt to investigate the dynamics of a model of neural networks with embedded spike timing dependent plasticity. The neurons correspond to integrate-and-fire units located at the vertices of a finite subset of 2D lattice. There are two types of vertices, corresponding to the inhibitory and the excitatory neurons. The edges are directed and labelled by the discrete values of the synaptic strength. We assume that there is an initial firing pattern corresponding to a subset of units that generate a spike. The number of activated externally vertices is a small fraction of the entire network. The model presented here describes how such pattern propagates throughout the network as a random walk on graph. Several results are compared with computational simulations and new data are presented for identifying critical parameters of the model.

Deformation and Life Analysis of Composite Flywheel Disk and Multi-disk Systems

NASA Technical Reports Server (NTRS)

Arnold, S. M.; Saleeb, A. F.; AlZoubi, N. R.

2001-01-01

In this study an attempt is made to put into perspective the problem of a rotating disk, be it a single disk or a number of concentric disks forming a unit. An analytical model capable of performing an elastic stress analysis for single/multiple, annular/solid, anisotropic/isotropic disk systems, subjected to both pressure surface tractions, body forces (in the form of temperature-changes and rotation fields) and interfacial misfits is derived and discussed. Results of an extensive parametric study are presented to clearly define the key design variables and their associated influence. In general the important parameters were identified as misfit, mean radius, thickness, material property and/or load gradation, and speed; all of which must be simultaneously optimized to achieve the "best" and most reliable design. Also, the important issue of defining proper performance/merit indices (based on the specific stored energy), in the presence of multiaxiality and material anisotropy is addressed. These merit indices are then utilized to discuss the difference between flywheels made from PMC and TMC materials with either an annular or solid geometry. Finally two major aspects of failure analysis, that is the static and cyclic limit (burst) speeds are addressed. In the case of static limit loads, upper, lower, and out-of-plane bounds for disks with constant thickness are presented for both the case of internal pressure loading (as one would see in a hydroburst test) and pure rotation (as in the case of a free spinning disk). The results (interaction diagrams) are displayed graphically in designer friendly format. For the case of fatigue, a representative fatigue/life master curve is illustrated in which the normalized limit speed versus number of applied cycles is given for a cladded TMC disk application.

RAG-3D: A search tool for RNA 3D substructures

DOE PAGES

Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef; ...

2015-08-24

In this study, to address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally describedmore » in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding.« less

RAG-3D: a search tool for RNA 3D substructures

PubMed Central

Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef; Schlick, Tamar

2015-01-01

To address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally described in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding. PMID:26304547

RAG-3D: A search tool for RNA 3D substructures

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

Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef

In this study, to address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally describedmore » in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding.« less

An in vitro evaluation of the antibacterial efficacy of chlorine dioxide on E. faecalis in bovine incisors.

PubMed

Eddy, Russell S; Joyce, Anthony P; Roberts, Steven; Buxton, Thomas B; Liewehr, Frederick

2005-09-01

This study investigated the ability of chlorine dioxide to eliminate Enterococcus faecalis from dentinal tubules of bovine incisors. Thirty-seven extracted bovine incisor roots were sectioned into seventy-four 5 mm disks. Standardized lumens were filled with either sterile Brain Heart Infusion Broth (contamination controls, n = 10) or BHI containing E. faecalis (1.0 x 10 cfu/ml). Disks were incubated in 5% CO2 at 37 degrees C for 72 h. To simulate endodontic instrumentation the lumens were again enlarged. Sixty disks were randomly divided into four experimental groups and filled with one of the following irrigants: 10% Clidox-S (chlorine dioxide), 13.8% BioClenz (chlorine dioxide), 5.25% Clorox, or saline. The disks were incubated for 30 min and were then frozen, pulverized, serially diluted in phosphate buffered saline, and plated on BHI plates in triplicate. Total colony forming units were counted macroscopically. Statistical analysis of the data was performed with a Kruskal-Wallis one-way ANOVA on ranks (p < 0.05, n = 60). Bacterial counts, expressed in log10 cfu/disk were as follows (">" denotes significant differences): Saline > Clidox-S = BioClenz > Clorox. All negative controls were sterile. Chlorine dioxide and NaOCL were both effective in eliminating E. faecalis from the dentinal disks within 30 min.

High-Resolution Spectroscopy of [Ne II] Emission from AA Tau and GM Aur

NASA Astrophysics Data System (ADS)

Najita, Joan R.; Doppmann, Greg W.; Bitner, Martin A.; Richter, Matthew J.; Lacy, John H.; Jaffe, Daniel T.; Carr, John S.; Meijerink, Rowin; Blake, Geoffrey A.; Herczeg, Gregory J.; Glassgold, Alfred E.

2009-05-01

We present high-resolution (R = 80,000) spectroscopy of [Ne II] emission from two young stars, GM Aur and AA Tau, which have moderate to high inclinations. The emission from both sources appears centered near the stellar velocity and is broader than the [Ne II] emission measured previously for the face-on disk system TW Hya. These properties are consistent with a disk origin for the [Ne II] emission we detect, with disk rotation (rather than photoevaporation or turbulence in a hot disk atmosphere) playing the dominant role in the origin of the line width. In the non-face-on systems, the [Ne II] emission is narrower than the CO fundamental emission from the same sources. If the widths of both diagnostics are dominated by Keplerian rotation, this suggests that the [Ne II] emission arises from larger disk radii on average than does the CO emission. The equivalent width of the [Ne II] emission we detect is less than that of the spectrally unresolved [Ne II] feature in the Spitzer spectra of the same sources. Variability in the [Ne II] emission or the mid-infrared continuum, a spatially extended [Ne II] component, or a very (spectrally) broad [Ne II] component might account for the difference in the equivalent widths. Based on observations obtained at the Gemini Observatory, which is operated by the Association of Universities for Research in Astronomy, Inc., under a cooperative agreement with the NSF on behalf of the Gemini partnership: the National Science Foundation (United States), the Science and Technology Facilities Council (United Kingdom), the National Research Council (Canada), CONICYT (Chile), the Australian Research Council (Australia), Ministrio da Cincia e Tecnologia (Brazil), and SECYT (Argentina).

DEVELOPMENT OF A LAMINATED DISK FOR THE SPIN TEK ROTARY MICROFILTER

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

Herman, D.

2011-06-03

Funded by the Department of Energy Office of Environmental Management, EM-31, the Savannah River National Laboratory (SRNL) partnered with SpinTek Filtration{trademark} to develop a filter disk that would withstand a reverse pressure or flow during operation of the rotary microfilter. The ability to withstand a reverse pressure and flow eliminates a potential accident scenario that could have resulted in damage to the filter membranes. While the original welded filter disks have been shown to withstand and reverse pressure/flow in the static condition, the filter disk design discussed in this report will allow a reverse pressure/flow while the disks are rotating.more » In addition, the laminated disk increases the flexibility during filter startup and cleaning operations. The new filter disk developed by SRNL and SpinTek is manufactured with a more open structure significantly reducing internal flow restrictions in the disk. The prototype was tested at the University of Maryland and demonstrated to withstand the reverse pressure due to the centrifugal action of the rotary filter. The tested water flux of the disk was demonstrated to be 1.34 gpm in a single disk test. By comparison, the water flux of the current disk was 0.49 gpm per disk during a 25 disk test. The disk also demonstrated rejection of solids by filtering a 5 wt % Strontium Carbonate slurry with a filtrate clarity of less the 1.4 Nephelometric Turbidity Units (NTU) throughout the two hour test. The Savannah River National Laboratory (SRNL) has been working with SpinTek Filtration{trademark} to adapt the rotary microfilter for radioactive service in the Department of Energy (DOE) Complex. One potential weakness is the loose nature of the membrane on the filter disks. The current disk is constructed by welding the membrane at the outer edge of the disk. The seal for the center of the membrane is accomplished by an o-ring in compression for the assembled stack. The remainder of the membrane is free floating on the disk. This construction requires that a positive pressure be applied to the rotary filter tank to prevent the membrane from rising from the disk structure and potentially contacting the filter turbulence promoter. In addition, one accident scenario is a reverse flow through the filtrate line due to mis-alignment of valves resulting in the membrane rising from the disk structure. The structural integrity of the current disk has been investigated, and shown that the disk can withstand a significant reverse pressure in a static condition. However, the disk will likely incur damage if the filter stack is rotated during a reverse pressure. The development of a laminated disk would have several significant benefits for the operation of the rotary filter including the prevention of a compromise in filter disk integrity during a reverse flow accident, increasing operational flexibility, and increasing the self cleaning ability of the filter. A laminated disk would allow the filter rotor operation prior to a positive pressure in the filter tank. This would prevent the initial dead-head of the filter and prevent the resulting initial filter cake buildup. The laminated disk would allow rotor operation with cleaning fluid, eliminating the need for a recirculation pump. Additionally, a laminated disk would allow a reverse flow of fluid through the membrane pores removing trapped particles.« less

SIGNATURES OF GRAVITATIONAL INSTABILITY IN RESOLVED IMAGES OF PROTOSTELLAR DISKS

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

Dong, Ruobing; Vorobyov, Eduard; Pavlyuchenkov, Yaroslav

2016-06-01

Protostellar (class 0/I) disks, which have masses comparable to those of their nascent host stars and are fed continuously from their natal infalling envelopes, are prone to gravitational instability (GI). Motivated by advances in near-infrared (NIR) adaptive optics imaging and millimeter-wave interferometry, we explore the observational signatures of GI in disks using hydrodynamical and Monte Carlo radiative transfer simulations to synthesize NIR scattered light images and millimeter dust continuum maps. Spiral arms induced by GI, located at disk radii of hundreds of astronomical units, are local overdensities and have their photospheres displaced to higher altitudes above the disk midplane; therefore,more » arms scatter more NIR light from their central stars than inter-arm regions, and are detectable at distances up to 1 kpc by Gemini/GPI, VLT/SPHERE, and Subaru/HiCIAO/SCExAO. In contrast, collapsed clumps formed by disk fragmentation have such strong local gravitational fields that their scattering photospheres are at lower altitudes; such fragments appear fainter than their surroundings in NIR scattered light. Spiral arms and streamers recently imaged in four FU Ori systems at NIR wavelengths resemble GI-induced structures and support the interpretation that FUors are gravitationally unstable protostellar disks. At millimeter wavelengths, both spirals and clumps appear brighter in thermal emission than the ambient disk and can be detected by ALMA at distances up to 0.4 kpc with one hour integration times at ∼0.″1 resolution. Collapsed fragments having masses ≳1 M {sub J} can be detected by ALMA within ∼10 minutes.« less

Method of manufacturing fibrous hemostatic bandages

DOEpatents

Larsen, Gustavo; Spretz, Ruben; Velarde-Ortiz, Raffet

2012-09-04

A method of manufacturing a sturdy and pliable fibrous hemostatic dressing by making fibers that maximally expose surface area per unit weight of active ingredients as a means for aiding in the clot forming process and as a means of minimizing waste of active ingredients. The method uses a rotating object to spin off a liquid biocompatible fiber precursor, which is added at its center. Fibers formed then deposit on a collector located at a distance from the rotating object creating a fiber layer on the collector. An electrical potential difference is maintained between the rotating disk and the collector. Then, a liquid procoagulation species is introduced at the center of the rotating disk such that it spins off the rotating disk and coats the fibers.

Surface waves with high angular momentum: leakage from remote caustics, and tightly coiled streamlines

NASA Astrophysics Data System (ADS)

Berry, M. V.

2018-07-01

Outgoing cylindrical waves scattered by a disk, or emerging from a source inside it, are represented by Hankel functions of order m. For large m, these waves decay rapidly outside the disk and resemble radially evanescent surface waves travelling around it. But they eventually leak weakly away, in a manner described accurately by the asymptotics of the Hankel function. The transition occurs at radial distance ∣m∣ (in wavelength units), which constitutes a circular caustic from which the radiation leaking out, described by the streamlines, appears to issue tangentially. In the evanescent region, the streamlines form spirals, whose windings get exponentially closer nearer the disk. These insights are intended to help graduate students demystify mathematics associated with scattering theory.

Observations of disk-shaped bodies in free flight at terminal velocity

NASA Technical Reports Server (NTRS)

Vorreiter, J. W.; Tate, D. L.

1973-01-01

Ten disk-shaped models of a proposed nuclear heat source module were released from an aircraft and observed by radar. The initial launch attitude, spin rate, and mass of the models were varied. Significant differences were observed in the mode of flight and terminal velocity among models of different mass and launch attitudes. The data were analyzed to yield lift and drag coefficients as a function of Reynolds number. The total sea-level velocity of the models was found to be well correlated as a function of mass per unit frontal area. The demonstrated terminal velocity of the modular disk heat source, about 27 m/sec for this specific design, is only 33% of that of existing heat source designs.

Inquiring minds: Case studies of two middle school science teachers as they include inquiry and graphing in their curricula

NASA Astrophysics Data System (ADS)

Scarano, Grace Hotchkiss

2000-10-01

Current reform documents in science and mathematics call for teachers to include inquiry and data analysis in their teaching. This interpretive quasi-ethnographic case study examined two middle school science teachers as they planned and implemented inquiry and graphing in their science curricula. The focus question for this research was: What are middle school science teachers' experiences as they include graphing and inquiry-based student research projects in their curricula? How is teaching these areas different from usual teaching? The research examined two teachers teaching their favorite unit, parts of other familiar units, graphing, and student inquiry. Four main types of data were gathered: (1) observations of teachers' instruction, (2) interviews and meetings with the teachers, (3) curricular artifacts, and (4) questionnaires and other written material. The study took place over a seven-month period. The findings revealed that these two teachers had different ideologies of schooling and that these ideologies shaped the teachers' planning and implementation of their usual content as well as graphing and inquiry. One teacher's ideology was technical, and the other's was constructive. Six themes emerged as salient features of their teaching: (1) the role of developing a vision for curricular implementation, (2) curricular decisions: internal and external authority, (3) views of knowing and learning, (4) perceptions of the nature of science, (5) attending to a personal concern in teaching, and (6) reflection. The textures of these themes varied between the two teachers, and formed a coherent yet dynamic system within which each teacher maneuvered. This study found that both teachers found it challenging to include inquiry in their curricula, even though both had attended workshops designed to help teachers use student inquiry. The constructive teacher's implementation was more in line with the notions that are central to constructivism and current non-traditional views of the nature of science than was that of the technical teacher. The teacher with a technical ideology relied on the scientific method to organize student projects and implemented inquiry as a technique to increase student-centered work. It is proposed that teachers with technical ideologies need to undergo an ideological shift toward constructive ideologies of schooling in order to teach graphing and inquiry in ways that are aligned with current reform efforts.

Consensus seeking in a network of discrete-time linear agents with communication noises

NASA Astrophysics Data System (ADS)

Wang, Yunpeng; Cheng, Long; Hou, Zeng-Guang; Tan, Min; Zhou, Chao; Wang, Ming

2015-07-01

This paper studies the mean square consensus of discrete-time linear time-invariant multi-agent systems with communication noises. A distributed consensus protocol, which is composed of the agent's own state feedback and the relative states between the agent and its neighbours, is proposed. A time-varying consensus gain a[k] is applied to attenuate the effect of noises which inherits in the inaccurate measurement of relative states with neighbours. A polynomial, namely 'parameter polynomial', is constructed. And its coefficients are the parameters in the feedback gain vector of the proposed protocol. It turns out that the parameter polynomial plays an important role in guaranteeing the consensus of linear multi-agent systems. By the proposed protocol, necessary and sufficient conditions for mean square consensus are presented under different topology conditions: (1) if the communication topology graph has a spanning tree and every node in the graph has at least one parent node, then the mean square consensus can be achieved if and only if ∑∞k = 0a[k] = ∞, ∑∞k = 0a2[k] < ∞ and all roots of the parameter polynomial are in the unit circle; (2) if the communication topology graph has a spanning tree and there exits one node without any parent node (the leader-follower case), then the mean square consensus can be achieved if and only if ∑∞k = 0a[k] = ∞, limk → ∞a[k] = 0 and all roots of the parameter polynomial are in the unit circle; (3) if the communication topology graph does not have a spanning tree, then the mean square consensus can never be achieved. Finally, one simulation example on the multiple aircrafts system is provided to validate the theoretical analysis.

A Comparison Study and Software Implementation of NORDA Ocean Models.

DTIC Science & Technology

1980-10-08

L01?C07 ’EEEEElshhhh A COMPARISON STUDY AND SOFTWARE IMPLEMENTATION OF NORDA OCEAN MODELS J&IEA m/ MST* f-....~ cre mx IRSD~I?( J 300 Unicorn Park...34- NOO-79- 741 9. PERFORMING ORGANIZATION NAME AND ADDRESS 10. PROGRAM ELEMENT. PROJECT, TASK AREA 6 WORK UNIT NUMBERSJAYC0, 300 Unicorn Park Drive...before another execution of the energetics program, move them back to disk. Note that the outputs of the preprocessor reside on disk, they should not be

Integrated IMA (Information Mission Areas) IC (Information Center) Guide

DTIC Science & Technology

1989-06-01

COMPUTER AIDED DESIGN / COMPUTER AIDED MANUFACTURE 8-8 8.3.7 LIQUID CRYSTAL DISPLAY PANELS 8-8 8.3.8 ARTIFICIAL INTELLIGENCE APPLIED TO VI 8-9 8.4...2 10.3.1 DESKTOP PUBLISHING 10-3 10.3.2 INTELLIGENT COPIERS 10-5 10.3.3 ELECTRONIC ALTERNATIVES TO PRINTED DOCUMENTS 10-5 10.3.4 ELECTRONIC FORMS...Optical Disk LCD Units Storage Image Scanners Graphics Forms Output Generation Copiers Devices Software Optical Disk Intelligent Storage Copiers Work Group

EARTH, MOON, SUN, AND CV ACCRETION DISKS

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

Montgomery, M. M.

2009-11-01

Net tidal torque by the secondary on a misaligned accretion disk, like the net tidal torque by the Moon and the Sun on the equatorial bulge of the spinning and tilted Earth, is suggested by others to be a source to retrograde precession in non-magnetic, accreting cataclysmic variable (CV) dwarf novae (DN) systems that show negative superhumps in their light curves. We investigate this idea in this work. We generate a generic theoretical expression for retrograde precession in spinning disks that are misaligned with the orbital plane. Our generic theoretical expression matches that which describes the retrograde precession of Earths'more » equinoxes. By making appropriate assumptions, we reduce our generic theoretical expression to those generated by others, or to those used by others, to describe retrograde precession in protostellar, protoplanetary, X-ray binary, non-magnetic CV DN, quasar, and black hole systems. We find that spinning, tilted CV DN systems cannot be described by a precessing ring or by a precessing rigid disk. We find that differential rotation and effects on the disk by the accretion stream must be addressed. Our analysis indicates that the best description of a retrogradely precessing spinning, tilted, CV DN accretion disk is a differentially rotating, tilted disk with an attached rotating, tilted ring located near the innermost disk annuli. In agreement with the observations and numerical simulations by others, we find that our numerically simulated CV DN accretion disks retrogradely precess as a unit. Our final, reduced expression for retrograde precession agrees well with our numerical simulation results and with selective observational systems that seem to have main-sequence secondaries. Our results suggest that a major source to retrograde precession is tidal torques like that by the Moon and the Sun on the Earth. In addition, these tidal torques should be common to a variety of systems where one member is spinning and tilted, regardless if accretion disks are present or not. Our results suggest that the accretion disk's geometric shape directly affects the disk's precession rate.« less

Graph analysis of functional brain networks: practical issues in translational neuroscience

PubMed Central

De Vico Fallani, Fabrizio; Richiardi, Jonas; Chavez, Mario; Achard, Sophie

2014-01-01

The brain can be regarded as a network: a connected system where nodes, or units, represent different specialized regions and links, or connections, represent communication pathways. From a functional perspective, communication is coded by temporal dependence between the activities of different brain areas. In the last decade, the abstract representation of the brain as a graph has allowed to visualize functional brain networks and describe their non-trivial topological properties in a compact and objective way. Nowadays, the use of graph analysis in translational neuroscience has become essential to quantify brain dysfunctions in terms of aberrant reconfiguration of functional brain networks. Despite its evident impact, graph analysis of functional brain networks is not a simple toolbox that can be blindly applied to brain signals. On the one hand, it requires the know-how of all the methodological steps of the pipeline that manipulate the input brain signals and extract the functional network properties. On the other hand, knowledge of the neural phenomenon under study is required to perform physiologically relevant analysis. The aim of this review is to provide practical indications to make sense of brain network analysis and contrast counterproductive attitudes. PMID:25180301

Inside-out Planet Formation. IV. Pebble Evolution and Planet Formation Timescales

NASA Astrophysics Data System (ADS)

Hu, Xiao; Tan, Jonathan C.; Zhu, Zhaohuan; Chatterjee, Sourav; Birnstiel, Tilman; Youdin, Andrew N.; Mohanty, Subhanjoy

2018-04-01

Systems with tightly packed inner planets (STIPs) are very common. Chatterjee & Tan proposed Inside-out Planet Formation (IOPF), an in situ formation theory, to explain these planets. IOPF involves sequential planet formation from pebble-rich rings that are fed from the outer disk and trapped at the pressure maximum associated with the dead zone inner boundary (DZIB). Planet masses are set by their ability to open a gap and cause the DZIB to retreat outwards. We present models for the disk density and temperature structures that are relevant to the conditions of IOPF. For a wide range of DZIB conditions, we evaluate the gap-opening masses of planets in these disks that are expected to lead to the truncation of pebble accretion onto the forming planet. We then consider the evolution of dust and pebbles in the disk, estimating that pebbles typically grow to sizes of a few centimeters during their radial drift from several tens of astronomical units to the inner, ≲1 au scale disk. A large fraction of the accretion flux of solids is expected to be in such pebbles. This allows us to estimate the timescales for individual planet formation and the entire planetary system formation in the IOPF scenario. We find that to produce realistic STIPs within reasonable timescales similar to disk lifetimes requires disk accretion rates of ∼10‑9 M ⊙ yr‑1 and relatively low viscosity conditions in the DZIB region, i.e., a Shakura–Sunyaev parameter of α ∼ 10‑4.

Gaps, rings, and non-axisymmetric structures in protoplanetary disks: Emission from large grains

NASA Astrophysics Data System (ADS)

Ruge, J. P.; Flock, M.; Wolf, S.; Dzyurkevich, N.; Fromang, S.; Henning, Th.; Klahr, H.; Meheut, H.

2016-05-01

Aims: Dust grains with sizes around (sub)mm are expected to couple only weakly to the gas motion in regions beyond 10 au of circumstellar disks. In this work, we investigate the influence of the spatial distribution of these grains on the (sub)mm appearance of magnetized protoplanetary disks. Methods: We perform non-ideal global 3D magneto-hydrodynamic (MHD) stratified disk simulations, including particles of different sizes (50 μm to 1 cm), using a Lagrangian particle solver. Subsequently, we calculate the spatial dust temperature distribution, including the dynamically coupled submicron-sized dust grains, and derive ideal continuum re-emission maps of the disk through radiative transfer simulations. Finally, we investigate the feasibility of observing specific structures in the thermal re-emission maps with the Atacama Large Millimeter/submillimeter Array (ALMA). Results: Depending on the level of turbulence, the radial pressure gradient of the gas, and the grain size, particles settle to the midplane and/or drift radially inward. The pressure bump close to the outer edge of the dead-zone leads to particle-trapping in ring structures. More specifically, vortices in the disk concentrate the dust and create an inhomogeneous distribution of solid material in the azimuthal direction. The large-scale disk perturbations are preserved in the (sub)mm re-emission maps. The observable structures are very similar to those expected from planet-disk interaction. Additionally, the larger dust particles increase the brightness contrast between the gap and ring structures. We find that rings, gaps, and the dust accumulation in the vortex could be traced with ALMA down to a scale of a few astronomical units in circumstellar disks located in nearby star-forming regions. Finally, we present a brief comparison of these structures with those recently found with ALMA in the young circumstellar disks of HL Tau and Oph IRS 48.

Mission: Define Computer Literacy. The Illinois-Wisconsin ISACS Computer Coordinators' Committee on Computer Literacy Report (May 1985).

ERIC Educational Resources Information Center

Computing Teacher, 1985

1985-01-01

Defines computer literacy and describes a computer literacy course which stresses ethics, hardware, and disk operating systems throughout. Core units on keyboarding, word processing, graphics, database management, problem solving, algorithmic thinking, and programing are outlined, together with additional units on spreadsheets, simulations,…

Traffic Safety for Special Children

ERIC Educational Resources Information Center

Wilson, Val; MacKenzie, R. A.

1974-01-01

In a 6 weeks' unit on traffic education using flannel graphs, filmstrips and models, 12 special class students (IQ 55-82) ages 7- to 11-years-old learned six basic skills including crossing a road, obeying traffic lights and walking on country roads. (CL)

DIGITAL LINE GRAPHS - USGS

EPA Science Inventory

USGS DLGs are digital representations of program-quadrangle format and sectional maps. All DLG data distributed by the United States Geological Survey (USGS) are DLG-Level 3 (DLG-3), which means the data contain a full range of attribute codes, have full topological structuring, ...

Animals & Livestock | National Agricultural Library

Science.gov Websites

Skip to main content Home National Agricultural Library United States Department of Agriculture Ag (maps, tables, graphs), Agricultural Products html National Animal Nutrition Program (NANP) Feed | Agricultural Research Service | Plain Language | FOIA | Accessibility Statement | Information Quality | Privacy

Agroecosystems & Environment | National Agricultural Library

Science.gov Websites

Skip to main content Home National Agricultural Library United States Department of Agriculture Ag useful formats (maps, tables, graphs), Agricultural Products html Useful to Usable: Developing usable integrated expertise in applied climatology, crop modeling, agronomy, cyber-technology, agricultural

Plants & Crops | National Agricultural Library

Science.gov Websites

Skip to main content Home National Agricultural Library United States Department of Agriculture Ag , tables, graphs), Agricultural Products html Useful to Usable: Developing usable climate science for climatology, crop modeling, agronomy, cyber-technology, agricultural economics, sociology, Extension and

Diabetes Interactive Atlas

PubMed Central

Burrows, Nilka R.; Geiss, Linda S.

2014-01-01

The Diabetes Interactive Atlas is a recently released Web-based collection of maps that allows users to view geographic patterns and examine trends in diabetes and its risk factors over time across the United States and within states. The atlas provides maps, tables, graphs, and motion charts that depict national, state, and county data. Large amounts of data can be viewed in various ways simultaneously. In this article, we describe the design and technical issues for developing the atlas and provide an overview of the atlas’ maps and graphs. The Diabetes Interactive Atlas improves visualization of geographic patterns, highlights observation of trends, and demonstrates the concomitant geographic and temporal growth of diabetes and obesity. PMID:24503340

A well-posed numerical method to track isolated conformal map singularities in Hele-Shaw flow

NASA Technical Reports Server (NTRS)

Baker, Gregory; Siegel, Michael; Tanveer, Saleh

1995-01-01

We present a new numerical method for calculating an evolving 2D Hele-Shaw interface when surface tension effects are neglected. In the case where the flow is directed from the less viscous fluid into the more viscous fluid, the motion of the interface is ill-posed; small deviations in the initial condition will produce significant changes in the ensuing motion. This situation is disastrous for numerical computation, as small round-off errors can quickly lead to large inaccuracies in the computed solution. Our method of computation is most easily formulated using a conformal map from the fluid domain into a unit disk. The method relies on analytically continuing the initial data and equations of motion into the region exterior to the disk, where the evolution problem becomes well-posed. The equations are then numerically solved in the extended domain. The presence of singularities in the conformal map outside of the disk introduces specific structures along the fluid interface. Our method can explicitly track the location of isolated pole and branch point singularities, allowing us to draw connections between the development of interfacial patterns and the motion of singularities as they approach the unit disk. In particular, we are able to relate physical features such as finger shape, side-branch formation, and competition between fingers to the nature and location of the singularities. The usefulness of this method in studying the formation of topological singularities (self-intersections of the interface) is also pointed out.

Trends in Fertility in the United States. Vital and Health Statistics, Data from the National Vital Statistics System. Series 21, Number 28.

ERIC Educational Resources Information Center

Taffel, Selma

This report presents and interprets birth statistics for the United States with particular emphasis on changes that took place during the period 1970-73. Data for the report were based on information entered on birth certificates collected from all states. The majority of the document comprises graphs and tables of data, but there are four short…

A deep search for H2D+ in protoplanetary disks. Perspectives for ALMA

NASA Astrophysics Data System (ADS)

Chapillon, E.; Parise, B.; Guilloteau, S.; Du, F.

2011-09-01

Context. The structure in density and temperature of protoplanetary disks surrounding low-mass stars is not well known yet. The protoplanetary disks' midplane are expected to be very cold and thus depleted in molecules in gas phase, especially CO. Recent observations of molecules at very low apparent temperatures (~6 K) challenge this current picture of the protoplanetary disk structures. Aims: We aim at constraining the physical conditions and, in particular, the gas-phase CO abundance in the midplane of protoplanetary disks. Methods: The light molecule H2D+ is a tracer of cold and CO-depleted environment. It is therefore a good candidate for exploring the disks midplanes. We performed a deep search for H2D+ in the two well-known disks surrounding TW Hya and DM Tau using the APEX and JCMT telescopes. The analysis of the observations was done with DISKFIT, a radiative transfer code dedicated to disks. In addition, we used a chemical model describing deuterium chemistry to infer the implications of our observations on the level of CO depletion and on the ionization rate in the disk midplane. Results: The ortho-H2D+ (11,0-11,1) line at 372 GHz was not detected. Although our limit is three times better than previous observations, comparison with the chemical modeling indicates that it is still insufficient for putting useful constraints on the CO abundance in the disk midplane. Conclusions: Even with ALMA, the detection of H2D+ may not be straightforward, and H2D+ may not be sensitive enough to trace the protoplanetary disks midplane. Based on observations carried out with the Atacama Pathfinder Experiment and the James Clerk Maxwell Telescope. APEX is a collaboration between the Max-Planck-Institut für Radioastronomie, the European Southern Observatory, and the Onsala Space Observatory. The JCMT is operated by the Joint Astronomy Centre on behalf of the Science and Technology Facilities Council of the United Kingdom, the Netherlands Organisation for Scientific Research, and the National Research Council of Canada.

RAILROAD DIGITAL LINE GRAPHS FOR THE MID-ATLANTIC INTEGRATED ASSESSMENT (MAIA) STUDY AREA

EPA Science Inventory

This data set is a geographic information system (GIS) coverage of railroads for the United States Environmental Protection Agency (USEPA) Mid-Atlantic Integrated Assessment (MAIA) Project region. The coverage was produced using US Geological Survey transportation digital line ...

DIGITAL LINE GRAPHS - USGS 1:24,000

EPA Science Inventory

USGS DLGs are digital representations of program-quadrangle format and sectional maps. All DLG data distributed by the United States Geological Survey (USGS) are DLG-Level 3 (DLG-3), which means the data contain a full range of attribute codes, have full topological structuring, ...

DIGITAL LINE GRAPHS - USGS 1:100,000

EPA Science Inventory

USGS DLGs are digital representations of program-quadrangle format and sectional maps. All DLG data distributed by the United States Geological Survey (USGS) are DLG-Level 3 (DLG-3), which means the data contain a full range of attribute codes, have full topological structuring, ...

Metric Rocketry and the Three Rs.

ERIC Educational Resources Information Center

Walter, Frank W.

1982-01-01

Described is a unit on rockets which begins with watching a film and ends with teams of students launching their own rockets. Activities teach students metric measuring, data collecting and graphing, report writing, and calculating, as well as group skills and model building skills. (DC)

Habitat manipulation influences northern bobwhite resource selection on a reclaimed surface mine

USGS Publications Warehouse

Brooke, Jarred M.; Peters, David C.; Unger, Ashley M.; Tanner, Evan P.; Harper, Craig A.; Keyser, Patrick D.; Clark, Joseph D.; Morgan, John J.

2015-01-01

More than 600,000 ha of mine land have been reclaimed in the eastern United States, providing large contiguous tracts of early successional vegetation that can be managed for northern bobwhite (Colinus virginianus). However, habitat quality on reclaimed mine land can be limited by extensive coverage of non-native invasive species, which are commonly planted during reclamation. We used discrete-choice analysis to investigate bobwhite resource selection throughout the year on Peabody Wildlife Management Area, a 3,330-ha reclaimed surface mine in western Kentucky. We used a treatment-control design to study resource selection at 2 spatial scales to identify important aspects of mine land vegetation and whether resource selection differed between areas with habitat management (i.e., burning, disking, herbicide; treatment) and unmanaged units (control). Our objectives were to estimate bobwhite resource selection on reclaimed mine land and to estimate the influence of habitat management practices on resource selection. We used locations from 283 individuals during the breeding season (1 Apr–30 Sep) and 136 coveys during the non-breeding season (1 Oct–Mar 31) from August 2009 to March 2014. Individuals were located closer to shrub cover than would be expected at random throughout the year. During the breeding season, individuals on treatment units used areas with smaller contagion index values (i.e., greater interspersion) compared with individuals on control units. During the non-breeding season, birds selected areas with greater shrub-open edge density compared with random. At the microhabitat scale, individuals selected areas with increased visual obstruction >1 m aboveground. During the breeding season, birds were closer to disked areas (linear and non-linear) than would be expected at random. Individuals selected non-linear disked areas during winter but did not select linear disked areas (firebreaks) because they were planted to winter wheat each fall and lacked cover during the non-breeding season. Individuals also selected areas treated with herbicide to control sericea lespedeza (Lespedeza cuneata) throughout the year. During the breeding season, bobwhites avoided areas burned during the previous dormant season. Habitat quality of reclaimed mine lands may be limited by a lack of shrub cover and extensive coverage of non-native herbaceous vegetation. Managers aiming to increase bobwhite abundance should focus on increasing interspersion of shrub cover, with no area >100 m from shrub cover. We suggest disking and herbicide application to control invasive species and improve the structure and composition of vegetation for bobwhites.

The Gaia-ESO Survey: Probes of the inner disk abundance gradient

NASA Astrophysics Data System (ADS)

Jacobson, H. R.; Friel, E. D.; Jílková, L.; Magrini, L.; Bragaglia, A.; Vallenari, A.; Tosi, M.; Randich, S.; Donati, P.; Cantat-Gaudin, T.; Sordo, R.; Smiljanic, R.; Overbeek, J. C.; Carraro, G.; Tautvaišienė, G.; San Roman, I.; Villanova, S.; Geisler, D.; Muñoz, C.; Jiménez-Esteban, F.; Tang, B.; Gilmore, G.; Alfaro, E. J.; Bensby, T.; Flaccomio, E.; Koposov, S. E.; Korn, A. J.; Pancino, E.; Recio-Blanco, A.; Casey, A. R.; Costado, M. T.; Franciosini, E.; Heiter, U.; Hill, V.; Hourihane, A.; Lardo, C.; de Laverny, P.; Lewis, J.; Monaco, L.; Morbidelli, L.; Sacco, G. G.; Sousa, S. G.; Worley, C. C.; Zaggia, S.

2016-06-01

Context. The nature of the metallicity gradient inside the solar circle (RGC < 8 kpc) is poorly understood, but studies of Cepheids and a small sample of open clusters suggest that it steepens in the inner disk. Aims: We investigate the metallicity gradient of the inner disk using a sample of inner disk open clusters that is three times larger than has previously been studied in the literature to better characterize the gradient in this part of the disk. Methods: We used the Gaia-ESO Survey (GES) [Fe/H] values and stellar parameters for stars in 12 open clusters in the inner disk from GES-UVES data. Cluster mean [Fe/H] values were determined based on a membership analysis for each cluster. Where necessary, distances and ages to clusters were determined via comparison to theoretical isochrones. Results: The GES open clusters exhibit a radial metallicity gradient of -0.10 ± 0.02 dex kpc-1, consistent with the gradient measured by other literature studies of field red giant stars and open clusters in the range RGC ~ 6-12 kpc. We also measure a trend of increasing [Fe/H] with increasing cluster age, as has also been found in the literature. Conclusions: We find no evidence for a steepening of the inner disk metallicity gradient inside the solar circle as earlier studies indicated. The age-metallicity relation shown by the clusters is consistent with that predicted by chemical evolution models that include the effects of radial migration, but a more detailed comparison between cluster observations and models would be premature. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under programme ID 188.B-3002 and 193.B-0936. These data products have been processed by the Cambridge Astronomy Survey Unit (CASU) at the Institute of Astronomy, University of Cambridge, and by the FLAMES/UVES reduction team at INAF/Osservatorio Astrofisico di Arcetri. These data have been obtained from the Gaia-ESO Survey Data Archive, prepared and hosted by the Wide Field Astronomy Unit, Institute for Astronomy, University of Edinburgh, which is funded by the UK Science and Technology Facilities Council.Full Table 2 is only available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr (http://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/591/A37

WaterWatch - Maps, graphs, and tables of current, recent, and past streamflow conditions

USGS Publications Warehouse

Jian, Xiaodong; Wolock, David; Lins, Harry F.

2008-01-01

WaterWatch (http://water.usgs.gov/waterwatch/) is a U.S. Geological Survey (USGS) World Wide Web site that dis­plays maps, graphs, and tables describing real-time, recent, and past streamflow conditions for the United States. The real-time information generally is updated on an hourly basis. WaterWatch provides streamgage-based maps that show the location of more than 3,000 long-term (30 years or more) USGS streamgages; use colors to represent streamflow conditions compared to historical streamflow; feature a point-and-click interface allowing users to retrieve graphs of stream stage (water elevation) and flow; and highlight locations where extreme hydrologic events, such as floods and droughts, are occurring.The streamgage-based maps show streamflow conditions for real-time, average daily, and 7-day average streamflow. The real-time streamflow maps highlight flood and high flow conditions. The 7-day average streamflow maps highlight below-normal and drought conditions.WaterWatch also provides hydrologic unit code (HUC) maps. HUC-based maps are derived from the streamgage-based maps and illustrate streamflow conditions in hydrologic regions. These maps show average streamflow conditions for 1-, 7-, 14-, and 28-day periods, and for monthly average streamflow; highlight regions of low flow or hydrologic drought; and provide historical runoff and streamflow conditions beginning in 1901.WaterWatch summarizes streamflow conditions in a region (state or hydrologic unit) in terms of the long-term typical condition at streamgages in the region. Summary tables are provided along with time-series plots that depict variations through time. WaterWatch also includes tables of current streamflow information and locations of flooding.

The effect of lab based instruction on ACT science scores

NASA Astrophysics Data System (ADS)

Hamilton, Michelle

Standardized tests, although unpopular, are required for a multitude of reasons. One of these tests is the ACT. The ACT is a college readiness test that many high school juniors take to gain college admittance. Students throughout the United States are unprepared for this assessment. The average high school junior is three points behind twenty-four, the ACT recommended score, for the science section. The science section focuses on reading text and, interpreting graphs, charts, tables and diagrams with an emphasis on experimental design and relationships among variables. For students to become better at interpreting and understanding scientific graphics they must have vast experience developing their own graphics. The purpose of this study was to provide students the opportunity to generate their own graphics to master interpretation of them on the ACT. According to a t-test the results show that students who are continually exposed to creating graphs are able to understand and locate information from graphs at a significantly faster rate.

Kirchhoff index of linear hexagonal chains

NASA Astrophysics Data System (ADS)

Yang, Yujun; Zhang, Heping

The resistance distance rij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices. In this work, according to the decomposition theorem of Laplacian polynomial, we obtain that the Laplacian spectrum of linear hexagonal chain Ln consists of the Laplacian spectrum of path P2n+1 and eigenvalues of a symmetric tridiagonal matrix of order 2n + 1. By applying the relationship between roots and coefficients of the characteristic polynomial of the above matrix, explicit closed-form formula for Kirchhoff index of Ln is derived in terms of Laplacian spectrum. To our surprise, the Krichhoff index of Ln is approximately to one half of its Wiener index. Finally, we show that holds for all graphs G in a class of graphs including Ln.0

Assessment of tautomer distribution using the condensed reaction graph approach

NASA Astrophysics Data System (ADS)

Gimadiev, T. R.; Madzhidov, T. I.; Nugmanov, R. I.; Baskin, I. I.; Antipin, I. S.; Varnek, A.

2018-03-01

We report the first direct QSPR modeling of equilibrium constants of tautomeric transformations (logK T ) in different solvents and at different temperatures, which do not require intermediate assessment of acidity (basicity) constants for all tautomeric forms. The key step of the modeling consisted in the merging of two tautomers in one sole molecular graph ("condensed reaction graph") which enables to compute molecular descriptors characterizing entire equilibrium. The support vector regression method was used to build the models. The training set consisted of 785 transformations belonging to 11 types of tautomeric reactions with equilibrium constants measured in different solvents and at different temperatures. The models obtained perform well both in cross-validation (Q2 = 0.81 RMSE = 0.7 logK T units) and on two external test sets. Benchmarking studies demonstrate that our models outperform results obtained with DFT B3LYP/6-311 ++ G(d,p) and ChemAxon Tautomerizer applicable only in water at room temperature.

Water Powered Tools

NASA Technical Reports Server (NTRS)

1976-01-01

Space Spin-Offs, Inc. under a contract with Lewis Research Center and Marshall Space Flight Center produced a new water-powered saw that cuts through concrete and steel plate reducing danger of explosion or electric shock in rescue and other operations. In prototype unit efficient water-powered turbine drives an 8 inch diameter grinding disk at 6,600 rpm. Exhaust water cools disk and workpiece quenching any sparks produced by cutting head. At maximum power, tool easily cuts through quarter inch steel plate. Adapter heads for chain saws, impact wrenches, heavy duty drills, and power hack saws can be fitted.

Exploring the Moon: A teacher's guide with activities for Earth and space sciences

NASA Technical Reports Server (NTRS)

Taylor, G. Jeffrey; Martel, Linda M. V.; Bays, Brooks G., Jr.

1994-01-01

This guide contains educational materials designed for use in upper elementary through high schools with the Lunar Sample Disk. A set of thirty-six 35-mm slides complements the activities in this guidebook. The book contains: (1) information on the Lunar Sample Disk; (2) a curriculum content matrix; (3) a teacher's guide; (4) moon ABC's fact sheet; (5) rock ABC's fact sheet; (6) progress in Lunar Science chart; (7) seventeen activities; (8) a resource section for each unit; (9) a glossary; and (10) a list of NASA educational resources.

ALMA observations of protoplanetary disks

NASA Astrophysics Data System (ADS)

Hogerheijde, Michiel

2015-08-01

The Universe is filled with planetary systems, as recent detections of exo-planets have shown. Such systems grow out of disks of gas and dust that surround newly formed stars. The ground work for our understanding of the structure, composition, and evolution of such disks has been laid with infrared telescopes in the 1980's, 1990's, and 2000's, as well as with millimeter interferometers operating in the United States, France, and Japan. With the construction of the Atacama Large Millimeter / submillimeter Array, a new era of studying planet-forming disks has started. The unprecedented leap in sensitivity and angular resolution that ALMA offers, has truely revolutionized our understanding of disks. No longer featureless objects consisting of gas and smalll dust, they are now seen to harbor a rich structure and chemistry. The ongoing planet-formation process sculpts many disks into systems of rings and arcs; grains grown to millimeter-sizes collect in high-pressure areas where they could grow out to asteroids or comets or further generations of planets. This wealth of new information directly addresses bottlenecks in our theoretical understanding of planet formation, such as the question how grains can grow past the 'meter-sized' barrier or overcome the 'drift barrier', and how gas and ice evolve together and ultimately determine the elemental compositions of both giant and terrestrial planets. I will review the recent ALMA results on protoplanetary disks, presenting results on individual objects and from the first populations studies. I will conclude with a forward look, on what we might expect from ALMA in this area for the years and decades to come.

Onboard System Evaluation of Rotors Vibration, Engines (OBSERVE) monitoring System

DTIC Science & Technology

1992-07-01

consists of a Data Acquisiiton Unit (DAU), Control and Display Unit ( CADU ), Universal Tracking Devices (UTD), Remote Cockpit Display (RCD) and a PC...and Display Unit ( CADU ) - The CADU provides data storage and a graphical user interface neccesary to display both the measured data and diagnostic...information. The CADU has an interface to a Credit Card Memory (CCM) which operates similar to a disk drive, allowing the storage of data and programs. The

Characterization of high speed synthetic jet actuators

NASA Astrophysics Data System (ADS)

Pikcilingis, Lucia

Over the last 20 years, synthetic jets have been studied as a means for aerodynamic active flow control. Specifically, synthetic jets provide momentum transfer with zero-net mass flux, which has been proven to be effective for controlling flow fields. A synthetic jet is created by the periodic formation of vortex rings at its orifice due to the periodic motion of a piezoelectric disk(s). The present study seeks to optimize the performance of a synthetic jet actuator by utilizing different geometrical parameters such as disk thickness, orifice width and length, cavity height and cavity diameter, and different input parameters such as driving voltage and frequency. Two apparatuses were used with a cavity diameter of either 80 mm or 160 mm. Piezoelectric-based disks were provided by the Mide Corporation. Experiments were conducted using several synthetic jet apparatuses designed for various geometrical parameters utilizing a dual disk configuration. Velocity and temperature measurements were acquired at the center of the synthetic jet orifice using a temperature compensated hotwire and thermocouple probe. The disk(s) displacement was measured at the center of the disk with a laser displacement sensor. It was shown that the synthetic jets, having the 80 mm cavity diameter, are capable of exceeding peak velocities of 200 m/s with a relatively large orifice of dimensions AR = 12, hc* = 3, and hn* = 4. In addition, the conditions at which the disks were manufactured had minimal effect on the performance of the jet, except for the pair with overnight resting time as opposed to less than an hour resting time for the control units. Altering the tab style of the disks, where the tab allows the electrical circuit to be exposed for external power connection, showed that a thin fragile tab versus a tab of the same thickness as the disk has minimal effect on the performance but affects the durability of the disk due to the fragility or robustness of the tab. The synthetic jets, having a 160 mm cavity diameter, yielded jet velocities greater than 300 m/s. Altering the clamping conditions, at which the disks are clamped, showed that increasing the number of clamping points where the disks are clamped, improved the performance of the jet. Coupling this with a flexible clamping boundary condition yielded the best performing jets. Fatigue tests were conducted for both apparatuses using several different disk designs. These tests showed that there is a degradation of the disks that causes the jet performance to decay and eventually cause a fracture in the disk. It is apparent from this work that, though the conditions at which the disks are manufactured have a small effect on performance, the disks do exhibit a threshold where beyond it the performance decays. Though desired jet velocities and momentums are achievable, the abnormality of the disks needs to be addressed before applying the actuator to practical situations. As this research continues, the synthetic jet actuator will become more robust and reliable to be an effective and reliable source of active flow control.

Area distortion under certain classes of quasiconformal mappings.

PubMed

Hernández-Montes, Alfonso; Reséndis O, Lino F

2017-01-01

In this paper we study the hyperbolic and Euclidean area distortion of measurable sets under some classes of K -quasiconformal mappings from the upper half-plane and the unit disk onto themselves, respectively.

21 CFR 1314.110 - Reports for mail-order sales.

Code of Federal Regulations, 2010 CFR

2010-04-01

... Administration, submit the report in electronic form, either via computer disk or direct electronic data... units (e.g., 100 doses per package); (11) Package type (blister pack, etc.); (12) Number of packages...

21 CFR 1314.110 - Reports for mail-order sales.

Code of Federal Regulations, 2014 CFR

2014-04-01

... Administration, submit the report in electronic form, either via computer disk or direct electronic data... units (e.g., 100 doses per package); (11) Package type (blister pack, etc.); (12) Number of packages...

21 CFR 1314.110 - Reports for mail-order sales.

Code of Federal Regulations, 2013 CFR

2013-04-01

... Administration, submit the report in electronic form, either via computer disk or direct electronic data... units (e.g., 100 doses per package); (11) Package type (blister pack, etc.); (12) Number of packages...

21 CFR 1314.110 - Reports for mail-order sales.

Code of Federal Regulations, 2011 CFR

2011-04-01

... Administration, submit the report in electronic form, either via computer disk or direct electronic data... units (e.g., 100 doses per package); (11) Package type (blister pack, etc.); (12) Number of packages...

21 CFR 1314.110 - Reports for mail-order sales.

Code of Federal Regulations, 2012 CFR

2012-04-01

... Administration, submit the report in electronic form, either via computer disk or direct electronic data... units (e.g., 100 doses per package); (11) Package type (blister pack, etc.); (12) Number of packages...

Bioenergy | National Agricultural Library

Science.gov Websites

Skip to main content Home National Agricultural Library United States Department of Agriculture Ag , graphs), Agricultural Products html Data from: Comparative farm-gate life cycle assessment of oilseed registered trademark of Dries Buytaert. NAL Home | USDA.gov | Agricultural Research Service | Plain Language

Digital line graphs from 1:24,000-scale maps

USGS Publications Warehouse

,

1990-01-01

The Earth Science Information Centers (ESIC) distribute digital cartographic/geographic data files produced by the U.S. Geological Survey (USGS) as part of the National Mapping Program. Digital cartographic data flles are grouped into four basic types. The first of these, called a Digital Line . Graph (DLG), is line map information in digital form. These data files include information on planimetric base categories, such as transportation, hydrography, and boundaries. The second type, called a Digital Elevation Model (DEM), consists of a sampled array of elevations for a number of ground positions that are usually at regularly spaced intervals. The third type is Land Use and Land Cover digital data, which provides information on nine major classes of land use such as urban, agricultural, or forest as wen as associated map data such as political units and Federal land ownership. The fourth type, the Geographic Names Information System, provides primary information for all known places, features, and areas in the United States identified by a proper name.

Digital line graphs from 1:100,000-scale maps

USGS Publications Warehouse

,

1989-01-01

The National Cartographic Information Center (NCIC) distributes digital cartographic/geographic data files produced by the U.S. Geological Survey (USGS) as part of the National Mapping Program. Digital cartographic data files may be grouped into four basic types. The first of these, called a Digital Line Graph (DLG), is line map information in digital form. These data files include information on planimetric base categories, such as transportation, hydrography, and boundaries. The second form, called a Digital Elevation Model (OEM), consists of a sampled array of elevations for ground positions that are usually, but not always, at regularly spaced intervals. The third type is Land Use and Land Cover digital data, which provides information on nine major classes of land use such as urban, agricultural, or forest as well as associated map data such as political units and Federal land ownership. The fourth type, the Geographic Names Information System, provides primary information for known places, features, and areas in the United States identified by a proper name.

An implantable seal-less centrifugal pump with integrated double-disk motor.

PubMed

Schima, H; Schmallegger, H; Huber, L; Birgmann, I; Reindl, C; Schmidt, C; Roschal, K; Wieselthaler, G; Trubel, W; Losert, U

1995-07-01

Thrombus formation and sealing problems at the shaft as well as the compact and efficient design of the driving unit have been major difficulties in the construction of a long-term implantable centrifugal pump. To eliminate the problems of the seal, motor size, and efficiency, two major steps were taken by modifying the Vienna implantable centrifugal pump. First, a special driving unit was developed, in which the permanent magnets of the motor themselves are used for coupling the force into the rotor. Second, the rotor shaft in the pumping chamber was eliminated by adopting a concept recently presented by Ohara. The rotor is supported by 3 pins, which run on a carbon disk, whose concave shape leads to stabilization. The device has the following specifications: size: 65 mm (diameter) by 35 mm (height), 101 cm3; priming volume 30 cm3, 240 g; and a 6-pole brushless double disk DC motor. The required input power of the described prototype is 15 W at 150 mm Hg, 5 L/min (overall eta = 11%), and has an in vitro index of hemolysis (IH) of 0.0046 g/100 L. The test for in vitro thrombus growth exhibited far less thrombus formation in the new design than in designs with axles. In conclusion, the design of a special driving unit and the elimination of the axle led to the construction of a small pump with very low blood traumatization.

A Comparison of the Readability of Selected Instructions, Publications and Forms Commonly Used by Adults and the Minimum Literacy Level as Defined by the United States Office of Education.

ERIC Educational Resources Information Center

Beris, Carole

The Fry Readability Graph was used to assess the approximate readability level of each of 23 selected instructions, publications, and forms commonly used by adults in order to compare their readability levels with the minimum literacy level as defined by the United States Office of Education (approximately the eighth grade level). The results…

Using graph theory to quantify coarse sediment connectivity in alpine geosystems

NASA Astrophysics Data System (ADS)

Heckmann, Tobias; Thiel, Markus; Schwanghart, Wolfgang; Haas, Florian; Becht, Michael

2010-05-01

Networks are a common object of study in various disciplines. Among others, informatics, sociology, transportation science, economics and ecology frequently deal with objects which are linked with other objects to form a network. Despite this wide thematic range, a coherent formal basis to represent, measure and model the relational structure of models exists. The mathematical model for networks of all kinds is a graph which can be analysed using the tools of mathematical graph theory. In a graph model of a generic system, system components are represented by graph nodes, and the linkages between them are formed by graph edges. The latter may represent all kinds of linkages, from matter or energy fluxes to functional relations. To some extent, graph theory has been used in geosciences and related disciplines; in hydrology and fluvial geomorphology, for example, river networks have been modeled and analysed as graphs. An important issue in hydrology is the hydrological connectivity which determines if runoff generated on some area reaches the channel network. In ecology, a number of graph-theoretical indices is applicable to describing the influence of habitat distribution and landscape fragmentation on population structure and species mobility. In these examples, the mobility of matter (water, sediment, animals) through a system is an important consequence of system structure, i.e. the location and topology of its components as well as of properties of linkages between them. In geomorphology, sediment connectivity relates to the potential of sediment particles to move through the catchment. As a system property, connectivity depends, for example, on the degree to which hillslopes within a catchment are coupled to the channel system (lateral coupling), and to which channel reaches are coupled to each other (longitudinal coupling). In the present study, numerical GIS-based models are used to investigate the coupling of geomorphic process units by delineating the process domains of important geomorphic processes in a high-mountain environment (rockfall, slope-type debris flows, slope aquatic and fluvial processes). The results are validated by field mapping; they show that only small parts of a catchment are actually coupled to its outlet with respect to coarse (bedload) sediment. The models not only generate maps of the spatial extent and geomorphic activity of the aforementioned processes, they also output so-called edge lists that can be converted to adjacency matrices and graphs. Graph theory is then employed to explore ‘local' (i.e. referring to single nodes or edges) and ‘global' (i.e. system-wide, referring to the whole graph) measures that can be used to quantify coarse sediment connectivity. Such a quantification will complement the mainly qualitative appraisal of coupling and connectivity; the effect of connectivity on catchment properties such as specific sediment yield and catchment sensitivity will then be studied on the basis of quantitative measures.

Feasibility of using the linac real-time log data for VMAT treatment verification

NASA Astrophysics Data System (ADS)

Midi, N. S.; Zin, Hafiz M.

2017-05-01

This study investigates the feasibility of using the real-time log data from a linac to verify Volumetric Modulated Arc Therapy (VMAT) treatment. The treatment log data for an Elekta Synergy linac can be recorded at a sampling rate of 4 Hz using the service graphing tool on the linac control computer. A treatment plan that simulates a VMAT treatment was delivered from the linac and all the dynamic treatment parameters including monitor unit (MU), Multileaf Collimator (MLC) position, jaw position, gantry angle and collimator angle were recorded in real-time using the service graphing tool. The recorded raw data were extracted and analysed using algorithms written in Matlab (MathWorks, Natick, MA). The actual treatment parameters logged using the service graphing tool was compared to the prescription and the deviations were analysed. The MLC position errors travelling at the speed range from -3.25 to 5.92 cm/s were between -1.7 mm to 2.5 mm, well within the 3.5 mm tolerance value (AAPM TG-142). The discrepancies of other delivery parameters were also within the tolerance. The real-time linac parameters logged using the service graphing tool can be used as a supplementary data for patient specific VMAT pre-treatment quality assurance.

Two's company, three (or more) is a simplex : Algebraic-topological tools for understanding higher-order structure in neural data.

PubMed

Giusti, Chad; Ghrist, Robert; Bassett, Danielle S

2016-08-01

The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit of interest in a brain is a dyad - two nodes (neurons or brain regions) connected by an edge. While rarely mentioned, this fundamental assumption inherently limits the types of neural structure and function that graphs can be used to model. Here, we describe a generalization of graphs that overcomes these limitations, thereby offering a broad range of new possibilities in terms of modeling and measuring neural phenomena. Specifically, we explore the use of simplicial complexes: a structure developed in the field of mathematics known as algebraic topology, of increasing applicability to real data due to a rapidly growing computational toolset. We review the underlying mathematical formalism as well as the budding literature applying simplicial complexes to neural data, from electrophysiological recordings in animal models to hemodynamic fluctuations in humans. Based on the exceptional flexibility of the tools and recent ground-breaking insights into neural function, we posit that this framework has the potential to eclipse graph theory in unraveling the fundamental mysteries of cognition.

Protein domain organisation: adding order.

PubMed

Kummerfeld, Sarah K; Teichmann, Sarah A

2009-01-29

Domains are the building blocks of proteins. During evolution, they have been duplicated, fused and recombined, to produce proteins with novel structures and functions. Structural and genome-scale studies have shown that pairs or groups of domains observed together in a protein are almost always found in only one N to C terminal order and are the result of a single recombination event that has been propagated by duplication of the multi-domain unit. Previous studies of domain organisation have used graph theory to represent the co-occurrence of domains within proteins. We build on this approach by adding directionality to the graphs and connecting nodes based on their relative order in the protein. Most of the time, the linear order of domains is conserved. However, using the directed graph representation we have identified non-linear features of domain organization that are over-represented in genomes. Recognising these patterns and unravelling how they have arisen may allow us to understand the functional relationships between domains and understand how the protein repertoire has evolved. We identify groups of domains that are not linearly conserved, but instead have been shuffled during evolution so that they occur in multiple different orders. We consider 192 genomes across all three kingdoms of life and use domain and protein annotation to understand their functional significance. To identify these features and assess their statistical significance, we represent the linear order of domains in proteins as a directed graph and apply graph theoretical methods. We describe two higher-order patterns of domain organisation: clusters and bi-directionally associated domain pairs and explore their functional importance and phylogenetic conservation. Taking into account the order of domains, we have derived a novel picture of global protein organization. We found that all genomes have a higher than expected degree of clustering and more domain pairs in forward and reverse orientation in different proteins relative to random graphs with identical degree distributions. While these features were statistically over-represented, they are still fairly rare. Looking in detail at the proteins involved, we found strong functional relationships within each cluster. In addition, the domains tended to be involved in protein-protein interaction and are able to function as independent structural units. A particularly striking example was the human Jak-STAT signalling pathway which makes use of a set of domains in a range of orders and orientations to provide nuanced signaling functionality. This illustrated the importance of functional and structural constraints (or lack thereof) on domain organisation.

Optimization of memory use of fragment extension-based protein-ligand docking with an original fast minimum cost flow algorithm.

PubMed

Yanagisawa, Keisuke; Komine, Shunta; Kubota, Rikuto; Ohue, Masahito; Akiyama, Yutaka

2018-06-01

The need to accelerate large-scale protein-ligand docking in virtual screening against a huge compound database led researchers to propose a strategy that entails memorizing the evaluation result of the partial structure of a compound and reusing it to evaluate other compounds. However, the previous method required frequent disk accesses, resulting in insufficient acceleration. Thus, more efficient memory usage can be expected to lead to further acceleration, and optimal memory usage could be achieved by solving the minimum cost flow problem. In this research, we propose a fast algorithm for the minimum cost flow problem utilizing the characteristics of the graph generated for this problem as constraints. The proposed algorithm, which optimized memory usage, was approximately seven times faster compared to existing minimum cost flow algorithms. Copyright © 2018 The Authors. Published by Elsevier Ltd.. All rights reserved.

Low-flow frequency curves for selected long-term stream gaging stations in eastern United States

USGS Publications Warehouse

Hardison, Clayton H.; Martin, Robert O.R.

1963-01-01

Curves showing the magnitude and frequency of annual low flow at 85 streamgaging stations located in 17 States east and 5 States west of the Mississippi River have been smoothed and adjusted to one of four long-term periods. They are presented to show the similarity and dissimilarity of curves even in the same State and to provide background information for studies of the statistical properties of low-flow frequency curves and for studies of the relation between hydrologic environment and low flow. The results are presented as greatly reduced graphs to facilitate comparison and are summarized in tables from which expanded graphs can be plotted.

Operational characteristics of energy storage high temperature superconducting flywheels considering time dependent processes

NASA Astrophysics Data System (ADS)

Vajda, Istvan; Kohari, Zalan; Porjesz, Tamas; Benko, Laszlo; Meerovich, V.; Sokolovsky; Gawalek, W.

2002-08-01

Technical and economical feasibilities of short-term energy storage flywheels with high temperature superconducting (HTS) bearing are widely investigated. It is essential to reduce the ac losses caused by magnetic field variations in HTS bulk disks/rings (levitators) used in the magnetic bearings of flywheels. For the HTS bearings the calculation and measurement of the magnetic field distribution were performed. Effects like eccentricity, tilting were measured. Time dependency of the levitation force following a jumpwise movement of the permanent magnet was measured. The results were used to setup an engineering design algorithm for energy storage HTS flywheels. This algorithm was applied to an experimental HTS flywheel model with a disk type permanent magnet motor/generator unit designed and constructed by the authors. A conceptual design of the disk-type motor/generator with radial flux is shown.

Imaging of the CO snow line in a solar nebula analog.

PubMed

Qi, Chunhua; Öberg, Karin I; Wilner, David J; D'Alessio, Paola; Bergin, Edwin; Andrews, Sean M; Blake, Geoffrey A; Hogerheijde, Michiel R; van Dishoeck, Ewine F

2013-08-09

Planets form in the disks around young stars. Their formation efficiency and composition are intimately linked to the protoplanetary disk locations of "snow lines" of abundant volatiles. We present chemical imaging of the carbon monoxide (CO) snow line in the disk around TW Hya, an analog of the solar nebula, using high spatial and spectral resolution Atacama Large Millimeter/Submillimeter Array observations of diazenylium (N2H(+)), a reactive ion present in large abundance only where CO is frozen out. The N2H(+) emission is distributed in a large ring, with an inner radius that matches CO snow line model predictions. The extracted CO snow line radius of ~30 astronomical units helps to assess models of the formation dynamics of the solar system, when combined with measurements of the bulk composition of planets and comets.

Superpower Competition and the Militarization of the Third World.

ERIC Educational Resources Information Center

O'Loughlin, John

1987-01-01

Discusses the United States' policy on containment of communism after World War II and the superpower competition for influence in developing nations. Examines the increasing arms build-up in developing nations and provides graphs of arms sales and maps of superpower armed forces distribution. (GEA)

Using the Graphing Calculator--in Two-Dimensional Motion Plots.

ERIC Educational Resources Information Center

Brueningsen, Chris; Bower, William

1995-01-01

Presents a series of simple activities involving generalized two-dimensional motion topics to prepare students to study projectile motion. Uses a pair of motion detectors, each connected to a calculator-based-laboratory (CBL) unit interfaced with a standard graphics calculator, to explore two-dimensional motion. (JRH)

En route air traffic controllers' use of flight progress strips : a graph-theoretic analysis.

DOT National Transportation Integrated Search

1992-11-01

In the United States, flight data are represented on a paper Flight Progress Strip (FPS). The role of the FPS has recently attracted attention because of plans to automate this aspect of air traffic control. The communication activities and FPS activ...

Employment in the U.S. Chemical Industry. Chemical Work Force Tops 1.1 Million.

ERIC Educational Resources Information Center

Chemical and Engineering News, 1990

1990-01-01

The annual census of industrial employment, production workers, women, the workweek, scientists and engineers, chemical employment, wages, and productivity in the chemical industry is presented. Trends in the numbers of workers, productivity, and unit labor costs are illustrated in graphs. (CW)

Agricultural Products | National Agricultural Library

Science.gov Websites

Skip to main content Home National Agricultural Library United States Department of Agriculture Ag News Contact Us Search  Log inRegister Home Home Agricultural Products NEWT: National Extension Web , tables, graphs), Agricultural Products html National Animal Nutrition Program (NANP) Feed Composition

A well-posed numerical method to track isolated conformal map singularities in Hele-Shaw flow

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

Baker, G.; Siegel, M.; Tanveer, S.

1995-09-01

We present a new numerical method for calculating an evolving 2D Hele-Shaw interface when surface tension effects are neglected. In the case where the flow is directed from the less viscous fluid into the more viscous fluid, the motion of the interface is ill-posed; small deviations in the initial condition will produce significant changes in the ensuing motion. The situation is disastrous for numerical computation, as small roundoff errors can quickly lead to large inaccuracies in the computed solution. Our method of computation is most easily formulated using a conformal map from the fluid domain into a unit disk. Themore » method relies on analytically continuing the initial data and equations of motion into the region exterior to the disk, where the evolution problem becomes well-posed. The equations are then numerically solved in the extended domain. The presence of singularities in the conformal map outside of the disk introduces specific structures along the fluid interface. Our method can explicitly track the location of isolated pole and branch point singularities, allowing us to draw connections between the development of interfacial patterns and the motion of singularities as they approach the unit disk. In particular, we are able to relate physical features such as finger shape, side-branch formation, and competition between fingers to the nature and location of the singularities. The usefulness of this method in studying the formation of topological singularities (self-intersections of the interface) is also pointed out. 47 refs., 10 figs., 1 tab.« less

The structure and dynamics of interactive documents

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

Rocha, J.T.

1999-04-01

Advances in information technology continue to accelerate as the new millennium approaches. With these advances, electronic information management is becoming increasingly important and is now supported by a seemingly bewildering array of hardware and software whose sole purpose is the design and implementation of interactive documents employing multimedia applications. Multimedia memory and storage applications such as Compact Disk-Read Only Memory (CD-ROMs) are already a familiar interactive tool in both the entertainment and business sectors. Even home enthusiasts now have the means at their disposal to design and produce CD-ROMs. More recently, Digital Video Disk (DVD) technology is carving its ownmore » niche in these markets and may (once application bugs are corrected and prices are lowered) eventually supplant CD-ROM technology. CD-ROM and DVD are not the only memory and storage applications capable of supporting interactive media. External, high-capacity drives and disks such as the Iomega{copyright} zip{reg_sign} and jaz{reg_sign} are also useful platforms for launching interactive documents without the need for additional hardware such as CD-ROM burners and copiers. The main drawback here, however, is the relatively high unit price per disk when compared to the unit cost of CD-ROMs. Regardless of the application chosen, there are fundamental structural characteristics that must be considered before effective interactive documents can be created. Additionally, the dynamics of interactive documents employing hypertext links are unique and bear only slight resemblance to those of their traditional hard-copy counterparts. These two considerations form the essential content of this paper.« less

Ecrh on Asdex Upgrade - System Extension, New Modes of Operation, Plasma Physics Results

NASA Astrophysics Data System (ADS)

Stober, J.; Wagner, D.; Giannone, L.; Leuterer, F.; Marascheck, M.; Mlynek, A.; Monaco, F.; Münich, M.; Poli, E.; Reich, M.; Schmid-Lorch, D.; Schütz, H.; Schweinzer, J.; Treutterer, W.; Zohm, H.; Meier, A.; Scherer, Th.; Flamm, J.; Thumm, M.; Höhnle, H.; Kasparek, W.; Stroth, U.; Chirkov, A. V.; Denisov, G. G.; Litvak, A.; Malygin, S. A.; Myasnikov, V. E.; Nichiporenko, V. O.; Popov, L. G.; Soluyanova, E. A.; Tai, E. M.

2011-02-01

The ECRH system at ASDEX Upgrade is currently extended from 1.6 MW to 5 MW. The extension so far consists of 2-frequency units, which use single diamond-disk vacuum-windows to transmit power at the natural resonances of these disks (105 & 140 GHz). For the last unit of this extension two additional intermediate non-resonant frequencies are foreseen, requiring new window concepts. For the torus a polarisation-independent double-disk window has been developed. For the gyrotron a grooved diamond disk is actually favoured, for which the grooved surfaces act as anti-reflective coating. Since ASDEX Upgrade operates with completely W-covered plasma facing components, central ECRH is often applied to suppresses W-accumulation in the plasma center. In order to extend the operational range for central ECRH, X3- and O2-heating schemes were developed. Both are characterized by incomplete single-path absorption. For X3 heating, the X2 resonance at the pedestal on the high field side is used as a 'beam-dump', for the O2 scheme a specific reflector tile on the inner heat shield enforces a second path through the plasma center. The geometry for NTM control had to be modified to allow simultaneous central heating. In real-time the ECRH position can be determined either by ray-tracing based on real-time equilibria and density profiles or from ECE for modulated ECRH power. Fast real-time ECE also allows to determine the NTM position. Further major physics applications of the system are summarized.

Superresolution upgrade for confocal spinning disk systems using image scanning microscopy (Conference Presentation)

NASA Astrophysics Data System (ADS)

Isbaner, Sebastian; Hähnel, Dirk; Gregor, Ingo; Enderlein, Jörg

2017-02-01

Confocal Spinning Disk Systems are widely used for 3D cell imaging because they offer the advantage of optical sectioning at high framerates and are easy to use. However, as in confocal microscopy, the imaging resolution is diffraction limited, which can be theoretically improved by a factor of 2 using the principle of Image Scanning Microscopy (ISM) [1]. ISM with a Confocal Spinning Disk setup (CSDISM) has been shown to improve contrast as well as lateral resolution (FWHM) from 201 +/- 20 nm to 130 +/- 10 nm at 488 nm excitation. A minimum total acquisition time of one second per ISM image makes this method highly suitable for 3D live cell imaging [2]. Here, we present a multicolor implementation of CSDISM for the popular Micro-Manager Open Source Microscopy platform. Since changes in the optical path are not necessary, this will allow any researcher to easily upgrade their standard Confocal Spinning Disk system at remarkable low cost ( 5000 USD) with an ISM superresolution option. [1]. Müller, C.B. and Enderlein, J. Image Scanning Microscopy. Physical Review Letters 104, (2010). [2]. Schulz, O. et al. Resolution doubling in fluorescence microscopy with confocal spinning-disk image scanning microscopy. Proceedings of the National Academy of Sciences of the United States of America 110, 21000-5 (2013).

Performance of asynchronous transfer mode (ATM) local area and wide area networks for medical imaging transmission in clinical environment.

PubMed

Huang, H K; Wong, A W; Zhu, X

1997-01-01

Asynchronous transfer mode (ATM) technology emerges as a leading candidate for medical image transmission in both local area network (LAN) and wide area network (WAN) applications. This paper describes the performance of an ATM LAN and WAN network at the University of California, San Francisco. The measurements were obtained using an intensive care unit (ICU) server connecting to four image workstations (WS) at four different locations of a hospital-integrated picture archiving and communication system (HI-PACS) in a daily regular clinical environment. Four types of performance were evaluated: magnetic disk-to-disk, disk-to-redundant array of inexpensive disks (RAID), RAID-to-memory, and memory-to-memory. Results demonstrate that the transmission rate between two workstations can reach 5-6 Mbytes/s from RAID-to-memory, and 8-10 Mbytes/s from memory-to-memory. When the server has to send images to all four workstations simultaneously, the transmission rate to each WS is about 4 Mbytes/s. Both situations are adequate for radiologic image communications for picture archiving and communication systems (PACS) and teleradiology applications.

An evaluation of strategies to control noise from air conditioning and refrigeration condensing units

NASA Astrophysics Data System (ADS)

Durden, G. L.; Myers, J. O.; Towers, T. A.; Dickman, D. M.

1981-12-01

Noise from air conditioning and refrigeration condensing units is investigated. The practical aspects of attempting to implement innovative approaches are emphasized. These included: (1) sample selection, (2) noise measurement survey, (3) implementation of aggressive abatement procedures, (4) development and use of a screening graph for determining acceptability of sound rated outdoor unitary equipment, (5) incorporation of noise control considerations, (6) exploration of an operatinal curfew, and (7) development of an incentive/information program.

Considerations on the Use of Custom Accelerators for Big Data Analytics

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

Castellana, Vito G.; Tumeo, Antonino; Minutoli, Marco

Accelerators, including Graphic Processing Units (GPUs) for gen- eral purpose computation, many-core designs with wide vector units (e.g., Intel Phi), have become a common component of many high performance clusters. The appearance of more stable and reliable tools tools that can automatically convert code written in high-level specifications with annotations (such as C or C++) to hardware de- scription languages (High-Level Synthesis - HLS), is also setting the stage for a broader use of reconfigurable devices (e.g., Field Pro- grammable Gate Arrays - FPGAs) in high performance system for the implementation of custom accelerators, helped by the fact that newmore » processors include advanced cache-coherent interconnects for these components. In this chapter, we briefly survey the status of the use of accelerators in high performance systems targeted at big data analytics applications. We argue that, although the progress in the use of accelerators for this class of applications has been sig- nificant, differently from scientific simulations there still are gaps to close. This is particularly true for the ”irregular” behaviors exhibited by no-SQL, graph databases. We focus our attention on the limits of HLS tools for data analytics and graph methods, and discuss a new architectural template that better fits the requirement of this class of applications. We validate the new architectural templates by mod- ifying the Graph Engine for Multithreaded System (GEMS) frame- work to support accelerators generated with such a methodology, and testing with queries coming from the Lehigh University Benchmark (LUBM). The architectural template enables better supporting the task and memory level parallelism present in graph methods by sup- porting a new control model and a enhanced memory interface. We show that out solution allows generating parallel accelerators, pro- viding speed ups with respect to conventional HLS flows. We finally draw conclusions and present a perspective on the use of reconfig- urable devices and Design Automation tools for data analytics.« less

Effect of wearable sensor dynamics on physical activity estimates: A comparison between SCI vs. healthy individuals.

PubMed

Jayaraman, C; Mummidisetty, C K; Jayaraman, A

2016-08-01

Accuracy of physical activity estimates predicted by activity monitoring technologies may be affected by device location, analysis algorithms, type of technology (i.e. wearable/stickable) and population demographics (disability) being studied. Consequently, the main purpose of this investigation was to study such sensor dynamics (i.e. effect of device location, type and population demographics on energy expenditure estimates) of two commercial activity monitors. It was hypothesized that device location, population studied (disability), choice of proprietary algorithm and type of technology used will significantly impact the accuracy of the predicted physical activity metrics. 10 healthy controls and eight individuals with spinal cord injury (SCI) performed structured activities in a laboratory environment. All participants wore, (i) three ActiGraph-G3TX's one each on their wrist, waist & ankle, (ii) a stickable activity monitor (Metria-IH1) on their upper-arm and (3) a Cosmed-K4B 2 metabolic unit, while performing sedentary (lying), low intensity (walk 50 steps at self-speed) and vigorous activity (a 6 minute walk test). To validate the hypothesis, the energy expenditures (EE) predicted by ActiGraph-GT3X and Metria-IH1 were benchmarked with estimated EE per Cosmed K4B 2 metabolic unit. To verify the step count accuracy predicted by ActiGraph-GT3X's and Metria-IH1, the manually calculated step count during the low intensity activity were compared to estimates from both devices. Results suggest that Metria-IH1 out-performed ActiGraph-GT3X in estimating EE during sedentary activity in both groups. The device location and population demographics, significantly affected the accuracy of predicted estimates. In conclusion, selecting activity monitor locations, analysis algorithm and choice of technology plays based on the movement threshold of population being studied can pave a better way for reliable healthcare decisions and data analytics in population with SCI.

PIPELINES, TRANSMISSION LINES, AND MISCELLANEOUS TRANSPORTATION FEATURES DIGITAL LINE GRAPHS FOR THE MID-ATLANTIC INTEGRATED ASSESSMENT (MAIA) STUDY AREA

EPA Science Inventory

This data set is a geographic information system (GIS) coverage of pipelines, transmission lines, and miscellaneous transportation features for the United States Environmental Protection Agency (USEPA) Mid-Atlantic Integrated Assessment (MAIA) Project region. The coverage was p...

ROAD CLASS 5 TRANSPORTATION DIGITAL LINE GRAPHS FOR THE MID-ATLANTIC INTEGRATED ASSESSMENT (MAIA) STUDY AREA

EPA Science Inventory

This data set is a geographic information system (GIS) coverage of the trails, footbridges, and perimeters of parking areas (Class 5 Roads) for the United States Environmental Protection Agency (USEPA) Mid-Atlantic Integrated Assessment (MAIA) Project region. The coverage was p...

ROAD CLASS 3 TRANSPORTATION DIGITAL LINE GRAPHS FOR THE MID-ATLANTIC INTEGRATED ASSESSMENT (MAIA) STUDY AREA

EPA Science Inventory

This data set is a geographic information system (GIS) coverage of the lower level divided roads and streets (Class 3 Roads) for the United States Environmental Protection Agency (USEPA) Mid-Atlantic Integrated Assessment (MAIA) Project region. The coverage was produced using U...

ROAD CLASS 4 TRANSPORTATION DIGITAL LINE GRAPHS FOR THE MID-ATLANTIC INTEGRATED ASSESSMENT (MAIA) STUDY AREA

EPA Science Inventory

This data set is a geographic information system (GIS) coverage of the lower level roads and streets (Class 4 Roads) for the United States Environmental Protection Agency (USEPA) Mid-Atlantic Integrated Assessment (MAIA) Project region. The coverage was produced using US Geolog...

ROAD CLASS 2 TRANSPORTATION DIGITAL LINE GRAPHS FOR THE MID-ATLANTIC INTEGRATED ASSESSMENT (MAIA) STUDY AREA

EPA Science Inventory

This data set is a geographic information system (GIS) coverage of the state and county highways (Class 2 Roads) for the United States Environmental Protection Agency (USEPA) Mid-Atlantic Integrated Assessment (MAIA) Project region. The coverage was produced using US Geological...

TRANSITIONS IN FOREST FRAGMENTATION: IMPLICATIONS FOR RESTORATION OPPORTUNITIES AT REGIONAL SCALES

EPA Science Inventory

Where the potential natural vegetation is continuous forest (e.g., eastern US), a region can be divided into smaller units (e.g., counties, watersheds), and a graph of the proportion of forest in the largest patch versus the proportion in anthropogenic cover can be used as an ind...

Maps & Multimedia | National Agricultural Library

Science.gov Websites

Skip to main content Home National Agricultural Library United States Department of Agriculture Ag , tables, graphs), Agricultural Products html A how-to-build guide for Deadpool, a proximal sensing cart platform suitable for proximal sensing and imaging in a wide range of agricultural and environmental

Science and Technology Pocket Data Book.

ERIC Educational Resources Information Center

National Science Foundation, Washington, DC. Div. of Science Resources Studies.

This pocket guide contains a collection of graphed data, available in 1994, on science and technology funding patterns within the United States, public attitudes toward science and technology, and international trends in science and technology. Sections contain: (1) national research and development (R&D) funding patterns; (2) academic R&D…

1986 Agricultural Chartbook. Agriculture Handbook No. 663.

ERIC Educational Resources Information Center

Department of Agriculture, Washington, DC.

This book contains 310 charts, tables, and graphs containing statistical information about agriculture-related commodities and services, primarily in the United States, in 1986. The book is organized in seven sections that cover the following topics: (1) the farm (farm income, farm population, farm workers, food and fiber system, agriculture and…

The Primary Theme Club. Home & Family.

ERIC Educational Resources Information Center

Instructor, 1996

1996-01-01

This cross-curricular primary unit helps teachers and students get to know one another. Students collect information about their families, then create bulletin boards, class albums, graphs, and art projects. One activity is for students to invite their families into the classroom to share their projects and feast on traditional family foods. (SM)

Group Coordination Support in Networked Multimedia Systems

DTIC Science & Technology

1999-12-01

GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d. PROJECT NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S...51 2.3.3 Aggregation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 2.4 Discussion...Hierarchical aggregation of concurrent sessions and corresponding session graph. 23 2.4 User attributes

RPA Data Wiz users guide, version 1.0

Treesearch

Scott A. Pugh

2004-01-01

RPA Data Wiz is a computer application use to create summary tables, graphs, and maps of Resource Planning Act (RPA) Assessment forest information (English or metric units). Volumes for growing stock, live cull, dead salvable, netgrowth, and mortality can be estimated. Acreage, biomass, and tree count estimates are also available.

Industrial wood productivity in the United States, 1900-1998

Treesearch

Peter J. Ince

2000-01-01

The productivity of U.S. wood and paper product output in terms of wood input is computed and displayed in graphs. Background tables provide supporting data. The productivity trend parallels trends in the recovered paper utilization rate. Recycling and wood residue use are key factors in productivity gains.

Forming Spirals From Shadows

NASA Astrophysics Data System (ADS)

Kohler, Susanna

2016-07-01

What causes the large-scale spiral structures found in some protoplanetary disks? Most models assume theyre created by newly-forming planets, but a new study suggests that planets might have nothing to do with it.Perturbations from Planets?In some transition disks protoplanetary disks with gaps in their inner regions weve directly imaged large-scale spiral arms. Many theories currently attribute the formation of these structures to young planets: either the direct perturbations of a planet embedded in the disk cause the spirals, or theyre indirectly caused by the orbit of a planetary body outside of the arms.Another example of spiral arms detected in a protoplanetary disk, MWC 758. [NASA/ESA/ESO/M. Benisty et al.]But what if you could get spirals without any planets? A team of scientists led by Matas Montesinos (University of Chile) have recently published a study in which they examine what happens to a shadowed protoplanetary disk.Casting Shadows with WarpsIn the teams setup, they envision a protoplanetary disk that is warped: the inner region is slightly tilted relative to the outer region. As the central star casts light out over its protoplanetary disk, this disk warping would cause some regions of the disk to be shaded in a way that isnt axially symmetric with potentially interesting implications.Montesinos and collaborators ran 2D hydrodynamics simulations to determine what happens to the motion of particles within the disk when they pass in and out of the shadowed regions. Since the shadowed regions are significantly colder than the illuminated disk, the pressure in these regions is much lower. Particles are therefore accelerated and decelerated as they pass through these regions, and the lack of axial symmetry causes spiral density waves to form in the disk as a result.Initial profile for the stellar heating rate per unit area for one of the authors simulations. The regions shadowed as a result of the disk warp subtend 0.5 radians each (shown on the left and right sides of the disks here). [Montesinos et al. 2016]Observations of Shadow SpiralsIn the authors models, two shadowed regions result in the formation of two spiral arms. The arms that develop start at a pitch angle of 1522, and gradually evolve to a shallower 1114 pitch at distances of ~65150 AU.The more luminous the central star, the more quickly the spiral arms form, due to the greater contrast between illuminated and shadowed disk regions: for a 0.25 solar-mass disk illuminated by a 1 solar-luminosity star, arms start to form after about 2500 orbits. If we increasethe stars brightness to 100 solar luminosities, the arms form after only 150 orbits.Montesinos and collaborators conclude by testing whether or not such spiral structures would be observable. They use a 3D radiative transfer code to produce scattered-light predictions of what the disk would look like to direct-imaging telescopes. They find that these shadow-induced spirals should be detectable.This first study clearly demonstrates that large-scale spiral density waves can form in protoplanetary disks without the presence of planets. The authors now plan to add more detailed physics to their models to better understand what we might observe when looking at systems that were shapedin this way.Density evolution in two shadowed disks. Top row: disk illuminated by a 100 L star, at 150, 250, and 500 orbits (from left to right). Bottom row: disk illuminated by a 1 L star, at 2500, 3500, and 4000 orbits. The rightmost top and bottom panels show control simulations (no shadows were present on the disk) after 1000 and 6000 orbits. (A different type of spiral starts to develop in the bottom control simulation as a result of a gravitational instability, but it never extends to the edges of the disk.) [Montesinos et al. 2016]CitationMatas Montesinos et al 2016 ApJ 823 L8. doi:10.3847/2041-8205/823/1/L8

The EDGE-CALIFA Survey: Variations in the Molecular Gas Depletion Time in Local Galaxies

NASA Astrophysics Data System (ADS)

Utomo, Dyas; Bolatto, Alberto D.; Wong, Tony; Ostriker, Eve C.; Blitz, Leo; Sanchez, Sebastian F.; Colombo, Dario; Leroy, Adam K.; Cao, Yixian; Dannerbauer, Helmut; Garcia-Benito, Ruben; Husemann, Bernd; Kalinova, Veselina; Levy, Rebecca C.; Mast, Damian; Rosolowsky, Erik; Vogel, Stuart N.

2017-11-01

We present results from the EDGE survey, a spatially resolved CO(1-0) follow-up to CALIFA, an optical Integral Field Unit survey of local galaxies. By combining the data products of EDGE and CALIFA, we study the variation in molecular gas depletion time (τ dep) on kiloparsec scales in 52 galaxies. We divide each galaxy into two parts: the center, defined as the region within 0.1 {R}25, and the disk, defined as the region between 0.1 and 0.7 {R}25. We find that 14 galaxies show a shorter τ dep (˜1 Gyr) in the center relative to that in the disk (τ dep ˜ 2.4 Gyr), which means the central region in those galaxies is more efficient at forming stars per unit molecular gas mass. This finding implies that the centers with shorter τ dep resemble the intermediate regime between galactic disks and starburst galaxies. Furthermore, the central drop in τ dep is correlated with a central increase in the stellar surface density, suggesting that a shorter τ dep is associated with molecular gas compression by the stellar gravitational potential. We argue that varying the CO-to-H2 conversion factor only exaggerates the central drop of τ dep.

Improving spinning disk confocal microscopy by preventing pinhole cross-talk for intravital imaging

PubMed Central

Shimozawa, Togo; Yamagata, Kazuo; Kondo, Takefumi; Hayashi, Shigeo; Shitamukai, Atsunori; Konno, Daijiro; Matsuzaki, Fumio; Takayama, Jun; Onami, Shuichi; Nakayama, Hiroshi; Kosugi, Yasuhito; Watanabe, Tomonobu M.; Fujita, Katsumasa; Mimori-Kiyosue, Yuko

2013-01-01

A recent key requirement in life sciences is the observation of biological processes in their natural in vivo context. However, imaging techniques that allow fast imaging with higher resolution in 3D thick specimens are still limited. Spinning disk confocal microscopy using a Yokogawa Confocal Scanner Unit, which offers high-speed multipoint confocal live imaging, has been found to have wide utility among cell biologists. A conventional Confocal Scanner Unit configuration, however, is not optimized for thick specimens, for which the background noise attributed to “pinhole cross-talk,” which is unintended pinhole transmission of out-of-focus light, limits overall performance in focal discrimination and reduces confocal capability. Here, we improve spinning disk confocal microscopy by eliminating pinhole cross-talk. First, the amount of pinhole cross-talk is reduced by increasing the interpinhole distance. Second, the generation of out-of-focus light is prevented by two-photon excitation that achieves selective-plane illumination. We evaluate the effect of these modifications and test the applicability to the live imaging of green fluorescent protein-expressing model animals. As demonstrated by visualizing the fine details of the 3D cell shape and submicron-size cytoskeletal structures inside animals, these strategies dramatically improve higher-resolution intravital imaging. PMID:23401517

Improving spinning disk confocal microscopy by preventing pinhole cross-talk for intravital imaging.

PubMed

Shimozawa, Togo; Yamagata, Kazuo; Kondo, Takefumi; Hayashi, Shigeo; Shitamukai, Atsunori; Konno, Daijiro; Matsuzaki, Fumio; Takayama, Jun; Onami, Shuichi; Nakayama, Hiroshi; Kosugi, Yasuhito; Watanabe, Tomonobu M; Fujita, Katsumasa; Mimori-Kiyosue, Yuko

2013-02-26

A recent key requirement in life sciences is the observation of biological processes in their natural in vivo context. However, imaging techniques that allow fast imaging with higher resolution in 3D thick specimens are still limited. Spinning disk confocal microscopy using a Yokogawa Confocal Scanner Unit, which offers high-speed multipoint confocal live imaging, has been found to have wide utility among cell biologists. A conventional Confocal Scanner Unit configuration, however, is not optimized for thick specimens, for which the background noise attributed to "pinhole cross-talk," which is unintended pinhole transmission of out-of-focus light, limits overall performance in focal discrimination and reduces confocal capability. Here, we improve spinning disk confocal microscopy by eliminating pinhole cross-talk. First, the amount of pinhole cross-talk is reduced by increasing the interpinhole distance. Second, the generation of out-of-focus light is prevented by two-photon excitation that achieves selective-plane illumination. We evaluate the effect of these modifications and test the applicability to the live imaging of green fluorescent protein-expressing model animals. As demonstrated by visualizing the fine details of the 3D cell shape and submicron-size cytoskeletal structures inside animals, these strategies dramatically improve higher-resolution intravital imaging.

Near-Field Phase-Change Optical Recording of 1.36 Numerical Aperture

NASA Astrophysics Data System (ADS)

Ichimura, Isao; Kishima, Koichiro; Osato, Kiyoshi; Yamamoto, Kenji; Kuroda, Yuji; Saito, Kimihiro

2000-02-01

A bit density of 125 nm was demonstrated through near-field phase-change (PC) optical recording at the wavelength of 657 nm by using a supersphere solid immersion lens (SIL). The lens unit consists of a standard objective and a φ2.5 mm SIL@. Since this lens size still prevents the unit from being mounted on an air-bearing slider, we developed a one-axis positioning actuator and an active capacitance servo for precise gap control to thoroughly investigate near-field recording. An electrode was fabricated on the bottom of the SIL, and a capacitor was formed facing a disk material. This setup realized a stable air gap below 50 nm, and a new method of simulating modulation transfer function (MTF) optimized the PC disk structure at this gap height. Obtained jitter of 8.8% and a clear eye-pattern prove that our system successfully attained the designed numerical-aperture (\\mathit{NA}) of 1.36.

He2-90'S APPEARANCE DECEIVES ASTRONOMERS

NASA Technical Reports Server (NTRS)

2002-01-01

Astronomers using NASA's Hubble Space Telescope have stumbled upon a mysterious object that is grudgingly yielding clues to its identity. A quick glance at the Hubble picture at top shows that this celestial body, called He2-90, looks like a young, dust-enshrouded star with narrow jets of material streaming from each side. But it's not. The object is classified as a planetary nebula, the glowing remains of a dying, lightweight star. But the Hubble observations suggest that it may not fit that classification, either. The Hubble astronomers now suspect that this enigmatic object may actually be a pair of aging stars masquerading as a single youngster. One member of the duo is a bloated red giant star shedding matter from its outer layers. This matter is then gravitationally captured in a rotating, pancake-shaped accretion disk around a compact partner, which is most likely a young white dwarf (the collapsed remnant of a sun-like star). The stars cannot be seen in the Hubble images because a lane of dust obscures them. The Hubble picture at top shows a centrally bright object with jets, appearing like strings of beads, emanating from both sides of center. (The other streaks of light running diagonally from He2-90 are artificial effects of the telescope's optical system.) Each jet possesses at least six bright clumps of gas, which are speeding along at rates estimated to be at least 375,000 miles an hour (600,000 kilometers an hour). These gaseous salvos are being ejected into space about every 100 years, and may be caused by periodic instabilities in He2-90's accretion disk. The jets from very young stars behave in a similar way. Deep images taken from terrestrial observatories show each jet extending at least 100,000 astronomical units (one astronomical unit equals the Earth-Sun distance, 93 million miles). The jets' relatively modest speed implies that one member of the duo is a white dwarf. Observations by the Compton Gamma-Ray Observatory, however, discovered a gamma-ray source in the vicinity of He2-90, suggesting that the companion may be a neutron star or a black hole (the compact corpses of dying, massive stars). But the jets from accretion disks around neutron stars or black holes travel at a few tenths the speed of light, much faster than the plodding pace of He2-90's jets. The Hubble astronomers are planning more observations to pinpoint the gamma-ray source to determine whether it is associated with He2-90. An accretion disk needs gravity to form. For gravity to create He2-90's disk, the pair of stars must reside at a cozy distance from each other: within about 10 astronomical units. Although the astronomers are uncertain about the details, they believe that magnetic fields associated with the accretion disk produce and constrict the pencil-thin jets seen in the Hubble image. The close-up Hubble photo at bottom shows a dark, flaring, disk-like structure [off-center] bisecting the bright light from the object. The disk is seen edge-on. Although too large to be an accretion disk, this dark, flaring disk may provide indirect proof of the other's existence. Most theories for producing jets require the presence of an accretion disk. The jets are seen streaming from both sides of the central object. The round, white objects at the lower left and upper right corners are two bright clumps of gas in the jets. The astronomers traced the jets to within 1,000 astronomical units of the central obscured star. The star ejected this jet material about 30 years ago. Scientists discovered this puzzling object while taking a census of planetary nebulae. They knew it had been classified as a dying, sun-like star. He2-90 is enshrouded in very hot (17,500 degrees Fahrenheit or 10,000 degrees Kelvin), glowing gas, a typical feature of planetary nebulae. And yet the disk and jets indicated the presence of an embryonic star. The mystified astronomers needed more information. Since embryonic stars are usually associated with cool, dense clouds of gas and dust, they used a ground-based radio telescope in Chile to look for evidence of such a cloud around He2-90. No such cloud was found, and He2-90's neighborhood showed no traces of developing stars. He2-90 lies about 8,000 light-years from Earth in the constellation Centaurus in the southern sky. The images were taken Sept 28, 1999 with the Wide Field and Planetary Camera 2. The images and results appear in the Aug. 1 issue of the Astrophysical Journal Letters. Credits: NASA, Raghvendra Sahai (NASA Jet Propulsion Laboratory), Lars-Ake Nyman (European Southern Observatory, Chile and Onsala Space Observatory, Sweden)

Faster, Better, Cheaper: A Decade of PC Progress.

ERIC Educational Resources Information Center

Crawford, Walt

1997-01-01

Reviews the development of personal computers and how computer components have changed in price and value. Highlights include disk drives; keyboards; displays; memory; color graphics; modems; CPU (central processing unit); storage; direct mail vendors; and future possibilities. (LRW)

Effective centrality and explosive synchronization in complex networks

NASA Astrophysics Data System (ADS)

Navas, A.; Villacorta-Atienza, J. A.; Leyva, I.; Almendral, J. A.; Sendiña-Nadal, I.; Boccaletti, S.

2015-12-01

Synchronization of networked oscillators is known to depend fundamentally on the interplay between the dynamics of the graph's units and the microscopic arrangement of the network's structure. We here propose an effective network whose topological properties reflect the interplay between the topology and dynamics of the original network. On that basis, we are able to introduce the effective centrality, a measure that quantifies the role and importance of each network's node in the synchronization process. In particular, in the context of explosive synchronization, we use such a measure to assess the propensity of a graph to sustain an irreversible transition to synchronization. We furthermore discuss a strategy to induce the explosive behavior in a generic network, by acting only upon a fraction of its nodes.

Study of cryogenic propellant systems for loading the space shuttle. Part 2: Hydrogen systems

NASA Technical Reports Server (NTRS)

Steward, W. G.

1975-01-01

Computer simulation studies of liquid hydrogen fill and vent systems for the space shuttle are studied. The computer programs calculate maximum and minimum permissible flow rates during cooldown as limited by thermal stress considerations, fill line cooldown time, pressure drop, flow rates, vapor content, vent line pressure drop and vent line discharge temperature. The input data for these programs are selected through graphic displays which schematically depict the part of the system being analyzed. The computed output is also displayed in the form of printed messages and graphs. Digital readouts of graph coordinates may also be obtained. Procedures are given for operation of the graphic display unit and the associated minicomputer and timesharing computer.

[Analgesic quality in a postoperative pain service: continuous assessment with the cumulative sum (cusum) method].

PubMed

Baptista Macaroff, W M; Castroman Espasandín, P

2007-01-01

The aim of this study was to assess the cumulative sum (cusum) method for evaluating the performance of our hospital's acute postoperative pain service. The period of analysis was 7 months. Analgesic failure was defined as a score of 3 points or more on a simple numerical scale. Acceptable failure (p0) was set at 20% of patients upon admission to the postanesthetic recovery unit and at 7% 24 hours after surgery. Unacceptable failure was set at double the p0 rate at each time (40% and 14%, respectively). The unit's patient records were used to generate a cusum graph for each evaluation. Nine hundred four records were included. The rate of failure was 31.6% upon admission to the unit and 12.1% at the 24-hour postoperative assessment. The curve rose rapidly to the value set for p0 at both evaluation times (n = 14 and n = 17, respectively), later leveled off, and began to fall after 721 and 521 cases, respectively. Our study shows the efficacy of the cusum method for monitoring a proposed quality standard. The graph also showed periods of suboptimal performance that would not have been evident from analyzing the data en block. Thus the cusum method would facilitate rapid detection of periods in which quality declines.

On self-exciting coupled Faraday disk homopolar dynamos driving series motors

NASA Astrophysics Data System (ADS)

Moroz, Irene M.; Hide, Raymond; Soward, Andrew M.

1998-06-01

We present the results of a preliminary analytical and numerical study of one of the simpler members of a hierarchy of N (where N ≥ 1) coupled self-exciting Faraday disk homopolar dynamos, incorporating motors as additional electrical elements driven by the dynamo-generated current, as proposed by Hide (1997). The hierarchy is a generalisation of a single disk dynamo ( N = 1) with just one electric motor in the system, and crucially, incorporating effects due to mechanical friction in both the disk and the motor, as investigated by Hide et al. (1996). This is describable by a set of three coupled autonomous nonlinear ordinary differential equations, which, due to the presence of the motor, has solutions corresponding to co-existing periodic states of increasing complexity, as well as to chaotic dynamics. We consider the case of two such homopolar dynamos ( N = 2) with generally dissimilar characteristics but coupled together magnetically, with the aim of determining the extent to which this coupled system differs in its behaviour from the single disk dynamo with a series motor (Hide et al. 1996). In the case when the units are identical, the behaviour of the double dynamo system (after initial transients have decayed away) is identical to that of the single dynamo system, with solutions (including “synchronised chaos”) locked in both amplitude and phase. When there is no motor in the system and the coefficient of mechanical friction in the disks is small, these transients resemble the well-known ‘non-synchronous’, but structurally unstable Rikitake solution.

Plotting Points: Implications of "Over and Up" on Students' Covariational Reasoning

ERIC Educational Resources Information Center

Frank, Kristin M.

2016-01-01

In this study I investigate Saldanha and Thompson's (1998) claim that conceptualizing a coordinate pair in the Cartesian coordinate system as a multiplicative object, a way to unite two quantities' values, supports students in conceptualizing graphs as emergent representations of how two quantities' values change together. I presented three…

Climate of the Frank Church-River of No Return Wilderness, central Idaho

Treesearch

Arnold I. Finklin

1988-01-01

Describes the climate of the largest designated wilderness in the conterminous United States. Contains numerous maps, graphs, and tables. Shows annual patterns and 10-day details during the fire season. Includes both average values and frequency distributions. Examines relationship of climatic averages to topography, persistence of weather, and climatic trends.

A Generalization of "n Choose r"

ERIC Educational Resources Information Center

Skurnick, Ronald

2005-01-01

The subject matter presented in this article can be used in the classroom to enrich the learning experience of students taking a course that includes a unit on combinatorics, such as discrete mathematics, graph theory, or probability. In order to provide such students with the background needed to appreciate the significance of the generalization…

Monarch Butterflies: Spirits of Loved Ones

ERIC Educational Resources Information Center

Crumpecker, Cheryl

2011-01-01

The study of the beautiful monarch butterfly lends itself to a vast array of subject matter, and offers the opportunity to meet a large and varied number of standards and objectives for many grade levels. Art projects featuring monarchs may include many cross-curricular units such as math (symmetry and number graphing), science (adaptation and…

The Shaping of Modern Hawaiian History: Databook and Atlas; Teacher Answer Book.

ERIC Educational Resources Information Center

Tamura, Eileen; And Others

This book is intended for use as a supplement to a five-unit instructional series, "The Shaping of Modern Hawaiian History." It presents information on land use, population and ethnic diversity, government, politics, the economy, and Hawaii's place in the Pacific. Provided are many graphs, tables, readings, documents, and maps, which…

Renewable Electricity Futures Study - Volume One

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

Hand, Maureen; Mai, Treui; Baldwin, Sam

Renewable Electricity Futures Study - Volume One. This is part of a series of four volumes describing exploring a high-penetration renewable electricity future for the United States of America. This data set is provides data for the entire volume one document and includes all data for the charts and graphs included in the document.

Design and Implementation of Parallel Algorithms

DTIC Science & Technology

1992-05-01

Alon, N., Y. Azar, and Y. Ravid [1990]. "Universal sequences for complete graphs," SIAM J. Discrete Math 27. Alon, N., A. Bar-Noy, N. Linial, and D...SIAM J. Discrete Math .’ Klein, P., S. A. Plotkin, C. Stein, and E. Tardos [19911. "Faster approximation algorithms for the unit capacity concurrent

America's Soil and Water: Condition and Trends.

ERIC Educational Resources Information Center

1981

A review of conditions and trends regarding soil and water resources of rural nonfederal lands of the United States is presented in this publication. Maps, charts, and graphs illustrate the data collected on various aspects of soil and water use and practice. Topic areas considered include: (1) land use patterns; (2) classes of land; (3)…

TEACHERS' GUIDE. SEVENTH GRADE MATHEMATICS FOR THE ACADEMICALLY TALENTED.

ERIC Educational Resources Information Center

HORN, R.A.; AND OTHERS

MATERIALS ARE INTENDED FOR USE BY BOTH ENRICHED AND ACCELERATED MATHEMATICS COURSES. TEXTBOOKS AND SUPPLEMENTARY TEXTS FOR THE COURSE ARE GIVEN. THE COURSE OF STUDY IS DIVIDED INTO BROAD UNITS FOR EACH OF THE SEMESTERS--SEMESTER I- LINES, ANGLES, NUMBER SYSTEMS, POLYGONS, COMMON AND DECIMAL FRACTIONS, PERCENTAGE, AND MEASUREMENTS, GRAPHS,…

Shuttle cryogenic supply system optimization study. Volume 6: Appendixes

NASA Technical Reports Server (NTRS)

1973-01-01

The optimization of the cryogenic supply system for space shuttles is discussed. The subjects considered are: (1) auxiliary power unit parametric data, (2) propellant acquisition, (3) thermal protection and thermodynamic properties, (4) instrumentation and controls, and (5) initial component redundancy evaluations. Diagrams of the systems are provided. Graphs of the performance capabilities are included.

Reading an Analogy Can Cause the Illusion of Comprehension

ERIC Educational Resources Information Center

Jaeger, Allison J.; Wiley, Jennifer

2015-01-01

This study explored students' ability to evaluate their learning from a multimedia inquiry unit about the causes of global climate change. Participants were 90 sixth grade students from four science classrooms. Students were provided with a text describing the causes of climate change as well as graphs showing average global temperature changes.…

Status of Family Support Services and Spending in the United States.

ERIC Educational Resources Information Center

Parish, Susan L.; Braddock, David; Hemp, Richard; Rizzolo, Mary C.

2000-01-01

Analysis of data on family support services and spending for individuals with developmental disabilities presents information on cash subsidy payments, respite care, and other family support. A graph shows U.S. spending for family support, 1986-1998. Additional tables break down subsidy spending for family support services by state in 1998 and…

Coalition: Black/Brown Relations Fused by Anti-Affirmative Action Policies.

ERIC Educational Resources Information Center

Rodriguez, Roberto

1995-01-01

This article examined efforts to end affirmative action policies in higher education, which are uniting black and Latino groups, white women, Native Americans, and Asians, especially in California and some East Coast universities. Tables and graphs provide data on student racial and ethnic demographics of institutions of higher education. (MSE)

Algebraic Activities Aid Discovery Lessons

ERIC Educational Resources Information Center

Wallace-Gomez, Patricia

2013-01-01

After a unit on the rules for positive and negative numbers and the order of operations for evaluating algebraic expressions, many students believe that they understand these principles well enough, but they really do not. They clearly need more practice, but not more of the same kind of drill. Wallace-Gomez provides three graphing activities that…

Does It Mix?

ERIC Educational Resources Information Center

Kennon, J. Tillman; Fong, Bryant; Grippo, Anne

2016-01-01

This article describes how by using three points to make a line and comparing the graphs for water and oil, students can mathematically demonstrate that Gatorade dissolves in water much more readily than in oil. Students can also use units to understand and solve a multi-step problem by observing the color of each solution, making conductivity…

22 CFR 1.2 - Office of the Deputy Secretary of State.

Code of Federal Regulations, 2014 CFR

2014-04-01

... follows: On a white rectangular field a blue disk bearing the official coat of arms of the United States... one point upward. The colors and automobile flag to be the same design, adding a blue fringe. For the...

22 CFR 1.2 - Office of the Deputy Secretary of State.

Code of Federal Regulations, 2013 CFR

2013-04-01

... follows: On a white rectangular field a blue disk bearing the official coat of arms of the United States... one point upward. The colors and automobile flag to be the same design, adding a blue fringe. For the...

22 CFR 1.2 - Office of the Deputy Secretary of State.

Code of Federal Regulations, 2010 CFR

2010-04-01

... follows: On a white rectangular field a blue disk bearing the official coat of arms of the United States... one point upward. The colors and automobile flag to be the same design, adding a blue fringe. For the...

22 CFR 1.2 - Office of the Deputy Secretary of State.

Code of Federal Regulations, 2012 CFR

2012-04-01

... follows: On a white rectangular field a blue disk bearing the official coat of arms of the United States... one point upward. The colors and automobile flag to be the same design, adding a blue fringe. For the...

22 CFR 1.2 - Office of the Deputy Secretary of State.

Code of Federal Regulations, 2011 CFR

2011-04-01

... follows: On a white rectangular field a blue disk bearing the official coat of arms of the United States... one point upward. The colors and automobile flag to be the same design, adding a blue fringe. For the...

Microsphere integrated microfluidic disk: synergy of two techniques for rapid and ultrasensitive dengue detection.

PubMed

Hosseini, Samira; Aeinehvand, Mohammad M; Uddin, Shah M; Benzina, Abderazak; Rothan, Hussin A; Yusof, Rohana; Koole, Leo H; Madou, Marc J; Djordjevic, Ivan; Ibrahim, Fatimah

2015-11-09

The application of microfluidic devices in diagnostic systems is well-established in contemporary research. Large specific surface area of microspheres, on the other hand, has secured an important position for their use in bioanalytical assays. Herein, we report a combination of microspheres and microfluidic disk in a unique hybrid platform for highly sensitive and selective detection of dengue virus. Surface engineered polymethacrylate microspheres with carefully designed functional groups facilitate biorecognition in a multitude manner. In order to maximize the utility of the microspheres' specific surface area in biomolecular interaction, the microfluidic disk was equipped with a micromixing system. The mixing mechanism (microballoon mixing) enhances the number of molecular encounters between spheres and target analyte by accessing the entire sample volume more effectively, which subsequently results in signal amplification. Significant reduction of incubation time along with considerable lower detection limits were the prime motivations for the integration of microspheres inside the microfluidic disk. Lengthy incubations of routine analytical assays were reduced from 2 hours to 5 minutes while developed system successfully detected a few units of dengue virus. Obtained results make this hybrid microsphere-microfluidic approach to dengue detection a promising avenue for early detection of this fatal illness.

The effect of shape on the fracture of a soft elastic gel subjected to shear load.

PubMed

Kundan, Krishna Kant; Ghatak, Animangsu

2018-02-21

For brittle solids, the fracture energy is the energy required to create a unit area of new surface through the process of division. For crosslinked materials, it is a function of the intrinsic properties like crosslinking density and bond strength of the crosslinks. Here we show that the energy released due to fracture can depend also on the shape of a joint made of this material. Our experiment involves two gel blocks connected via a thin gel disk. The disk is formed into different regular and exotic shapes, but with identical areas of cross-section. When one of the blocks is sheared with respect to the other, the shear load increases with vertical displacement, eventually causing a fracture at a threshold load. The maximum fracture load is different for different disks and among different regularly shaped disks, it is at a maximum for pentagon and hexagon shapes. The fracture energy release rate of the joint depends also on the aspect ratio (height/width) of the shapes. Our experiments also throw light on possible reasons for such a dependence on the shape of the joints.

Vortical structures for nanomagnetic memory induced by dipole-dipole interaction in monolayer disks

NASA Astrophysics Data System (ADS)

Liu, Zhaosen; Ciftja, Orion; Zhang, Xichao; Zhou, Yan; Ian, Hou

2018-05-01

It is well known that magnetic domains in nanodisks can be used as storage units for computer memory. Using two quantum simulation approaches, we show here that spin vortices on magnetic monolayer nanodisks, which are chirality-free, can be induced by dipole-dipole interaction (DDI) on the disk-plane. When DDI is sufficiently strong, vortical and anti-vortical multi-domain textures can be generated simultaneously. Especially, a spin vortex can be easily created and deleted through either external magnetic or electrical signals, making them ideal to be used in nanomagnetic memory and logical devices. We demonstrate these properties in our simulations.

Technology and the Online Catalog.

ERIC Educational Resources Information Center

Graham, Peter S.

1983-01-01

Discusses trends in computer technology and their use for library catalogs, noting the concept of bandwidth (describes quantity of information transmitted per given unit of time); computer hardware differences (micros, minis, maxis); distributed processing systems and databases; optical disk storage; networks; transmission media; and terminals.…

An Overview of U.S. Trends in Educational Software Design.

ERIC Educational Resources Information Center

Colvin, Linda B.

1989-01-01

Describes trends in educational software design in the United States for elementary and secondary education. Highlights include user-friendly software; learner control; interfacing the computer with other media, including television, telecommunications networks, and optical disk technology; microworlds; graphics; word processing; database…

Shape Analysis of Planar Multiply-Connected Objects Using Conformal Welding.

PubMed

Lok Ming Lui; Wei Zeng; Shing-Tung Yau; Xianfeng Gu

2014-07-01

Shape analysis is a central problem in the field of computer vision. In 2D shape analysis, classification and recognition of objects from their observed silhouettes are extremely crucial but difficult. It usually involves an efficient representation of 2D shape space with a metric, so that its mathematical structure can be used for further analysis. Although the study of 2D simply-connected shapes has been subject to a corpus of literatures, the analysis of multiply-connected shapes is comparatively less studied. In this work, we propose a representation for general 2D multiply-connected domains with arbitrary topologies using conformal welding. A metric can be defined on the proposed representation space, which gives a metric to measure dissimilarities between objects. The main idea is to map the exterior and interior of the domain conformally to unit disks and circle domains (unit disk with several inner disks removed), using holomorphic 1-forms. A set of diffeomorphisms of the unit circle S(1) can be obtained, which together with the conformal modules are used to define the shape signature. A shape distance between shape signatures can be defined to measure dissimilarities between shapes. We prove theoretically that the proposed shape signature uniquely determines the multiply-connected objects under suitable normalization. We also introduce a reconstruction algorithm to obtain shapes from their signatures. This completes our framework and allows us to move back and forth between shapes and signatures. With that, a morphing algorithm between shapes can be developed through the interpolation of the Beltrami coefficients associated with the signatures. Experiments have been carried out on shapes extracted from real images. Results demonstrate the efficacy of our proposed algorithm as a stable shape representation scheme.

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.

Static versus Dynamic Disposition: The Role of GeoGebra in Representing Polynomial-Rational Inequalities and Exponential-Logarithmic Functions

ERIC Educational Resources Information Center

Caglayan, Günhan

2014-01-01

This study investigates prospective secondary mathematics teachers' visual representations of polynomial and rational inequalities, and graphs of exponential and logarithmic functions with GeoGebra Dynamic Software. Five prospective teachers in a university in the United States participated in this research study, which was situated within a…

How We Live: Then and Now.

ERIC Educational Resources Information Center

Linden, Fabian; Ryscavage, Paul

The 20th century has brought many demographic changes to the United States. This booklet briefly relates some of those changes and provides many charts and graphs to illustrate the changes graphically. The century has been one of population growth, but the rate of growth has slowed since the 1950s. The population is mobile, with more than two out…

Giving USA 1997: The Annual Report on Philanthropy for the Year 1996.

ERIC Educational Resources Information Center

Kaplan, Ann E., Ed.

This report presents a comprehensive review of private philanthropy in the United States during 1996. After a preliminary section, the first section presents data on giving, using text, graphs, and charts. Sections cover: overall 1996 contributions; changes in giving by source and use; total giving (1966-1996); inflation-adjusted giving in 5-year…

Comparative Financial Statistics for Public Two-Year Colleges: FY 1995 National Sample.

ERIC Educational Resources Information Center

Meeker, Bradley

Based on responses by 405 public two-year colleges in the United States to 2 surveys, this report provides comparative financial information for fiscal year 1994-95. The report provides space for colleges to compare their institutional statistics with national sample medians, quartile data for the national sample, and tables and graphs of…

Comparative Financial Statistics for Public Two-Year Colleges: FY 1994 National Sample.

ERIC Educational Resources Information Center

Dickmeyer, Nathan; Meeker, Bradley

Based on responses by 427 public two-year colleges in the United States to two surveys, this report provides comparative financial information for fiscal year 1993-94. The report provides space for colleges to compare their institutional statistics with national sample medians, quartile data for the national sample, and tables and graphs of…

Scarcity and Survival in El Salvador. Grades Six to Twelve.

ERIC Educational Resources Information Center

Stanford Univ., CA. Stanford Program on International and Cross Cultural Education.

This unit, designed for use with students in grades 6-12, has two purposes: (1) to inform teachers and students about social and economic conditions in rural El Salvador; and (2) to teach students how to analyze the indicators of such social and economic conditions. The six included lessons incorporate reading, graphing, and critical thinking…

77 FR 15561 - Requests for Testimony or the Production of Records in a Court or Other Proceedings in Which the...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-16

... regulations, after the Supreme Court's decision in United States ex rel. Touhy v. Regan, 340 U.S. 462 (1951..., telegrams, memoranda, facsimiles, reports, studies, calendar and diary entries, maps, graphs, pamphlets.... Legal proceeding means all pretrial, trial and post-trial stages of all judicial or administrative...

Sorting: Groups and Graphs. Used Numbers. Grades 2-3.

ERIC Educational Resources Information Center

Russell, Susan Jo; Corwin, Rebecca B.

A unit of study that introduces sorting and classification as a way of organizing data is presented. Suitable for students in grades 2 and 3, it provides a foundation for further work in statistics and data analysis. The investigations may extend from one to five class sessions and are grouped into three parts: "Introduction to Sorting"; "Sorting…

Balancing Structure and Creativity in Culminating Projects for Liberal Arts Mathematics

ERIC Educational Resources Information Center

Kasman, Reva

2014-01-01

Liberal arts mathematics courses can provide non-majors the opportunity to connect mathematical topics with areas of personal interest. This article describes two end-of-unit writing assignments (on voting and graph theory) that have been structured so that each student is able to synthesize course material in a unique way, while ensuring a…

MANPOWER PROJECTIONS AND TRAINING NEEDS FORECAST TO 1975 FOR THE TERRE HAUTE AREA.

ERIC Educational Resources Information Center

Indiana State Univ., Terre Haute.

USING U.S. CENSUS BUREAU AND INDIANA EMPLOYMENT SECURITY DIVISION DATA, A PREVIOUS STUDY WAS UPDATED TO INCLUDE PROJECTIONS OF MANPOWER AND TRAINING NEEDS FOR THE TERRE HAUTE AREA. GRAPHS SHOW TRENDS FOR EIGHT OCCUPATIONAL GROUPS IN THE UNITED STATES, THE NATION'S URBAN AREAS, INDIANA, AND THE TERRE HAUTE STANDARD METROPOLITAN AREA. MANPOWER NEEDS…

Ringed Structures of the HD 163296 Protoplanetary Disk Revealed by ALMA

NASA Astrophysics Data System (ADS)

Isella, Andrea; Guidi, Greta; Testi, Leonardo; Liu, Shangfei; Li, Hui; Li, Shengtai; Weaver, Erik; Boehler, Yann; Carperter, John M.; De Gregorio-Monsalvo, Itziar; Manara, Carlo F.; Natta, Antonella; Pérez, Laura M.; Ricci, Luca; Sargent, Anneila; Tazzari, Marco; Turner, Neal

2016-12-01

We present Atacama Large Millimeter and Submillimeter Array observations of the protoplanetary disk around the Herbig Ae star HD 163296 that trace the spatial distribution of millimeter-sized particles and cold molecular gas on spatial scales as small as 25 astronomical units (A.U.). The image of the disk recorded in the 1.3 mm continuum emission reveals three dark concentric rings that indicate the presence of dust depleted gaps at about 60, 100, and 160 A.U. from the central star. The maps of the 12CO, 13CO, and C 18O J =2 -1 emission do not show such structures but reveal a change in the slope of the radial intensity profile across the positions of the dark rings in the continuum image. By comparing the observations with theoretical models for the disk emission, we find that the density of CO molecules is reduced inside the middle and outer dust gaps. However, in the inner ring there is no evidence of CO depletion. From the measurements of the dust and gas densities, we deduce that the gas-to-dust ratio varies across the disk and, in particular, it increases by at least a factor 5 within the inner dust gap compared to adjacent regions of the disk. The depletion of both dust and gas suggests that the middle and outer rings could be due to the gravitational torque exerted by two Saturn-mass planets orbiting at 100 and 160 A.U. from the star. On the other hand, the inner dust gap could result from dust accumulation at the edge of a magnetorotational instability dead zone, or from dust opacity variations at the edge of the CO frost line. Observations of the dust emission at higher angular resolution and of molecules that probe dense gas are required to establish more precisely the origins of the dark rings observed in the HD 163296 disk.

Ringed Structures of the HD 163296 Protoplanetary Disk Revealed by ALMA.

PubMed

Isella, Andrea; Guidi, Greta; Testi, Leonardo; Liu, Shangfei; Li, Hui; Li, Shengtai; Weaver, Erik; Boehler, Yann; Carperter, John M; De Gregorio-Monsalvo, Itziar; Manara, Carlo F; Natta, Antonella; Pérez, Laura M; Ricci, Luca; Sargent, Anneila; Tazzari, Marco; Turner, Neal

2016-12-16

We present Atacama Large Millimeter and Submillimeter Array observations of the protoplanetary disk around the Herbig Ae star HD 163296 that trace the spatial distribution of millimeter-sized particles and cold molecular gas on spatial scales as small as 25 astronomical units (A.U.). The image of the disk recorded in the 1.3 mm continuum emission reveals three dark concentric rings that indicate the presence of dust depleted gaps at about 60, 100, and 160 A.U. from the central star. The maps of the ^{12}CO, ^{13}CO, and C^{18}O J=2-1 emission do not show such structures but reveal a change in the slope of the radial intensity profile across the positions of the dark rings in the continuum image. By comparing the observations with theoretical models for the disk emission, we find that the density of CO molecules is reduced inside the middle and outer dust gaps. However, in the inner ring there is no evidence of CO depletion. From the measurements of the dust and gas densities, we deduce that the gas-to-dust ratio varies across the disk and, in particular, it increases by at least a factor 5 within the inner dust gap compared to adjacent regions of the disk. The depletion of both dust and gas suggests that the middle and outer rings could be due to the gravitational torque exerted by two Saturn-mass planets orbiting at 100 and 160 A.U. from the star. On the other hand, the inner dust gap could result from dust accumulation at the edge of a magnetorotational instability dead zone, or from dust opacity variations at the edge of the CO frost line. Observations of the dust emission at higher angular resolution and of molecules that probe dense gas are required to establish more precisely the origins of the dark rings observed in the HD 163296 disk.

Partial Accretion in the Propeller Stage of Low-mass X-Ray Binary Aql X-1

NASA Astrophysics Data System (ADS)

Güngör, C.; Ekşi, K. Y.; Göğüş, E.; Güver, T.

2017-10-01

Aql X-1 is one of the most prolific low-mass X-ray binary transients (LMXBTs) showing outbursts almost annually. We present the results of our spectral analyses of Rossi X-Ray Timing Explorer/proportional counter-array observations of the 2000 and 2011 outbursts. We investigate the spectral changes related to the changing disk-magnetosphere interaction modes of Aql X-1. The X-ray light curves of the outbursts of LMXBTs typically show phases of fast rise and exponential decay. The decay phase shows a “knee” where the flux goes from the slow-decay to the rapid-decay stage. We assume that the rapid decay corresponds to a weak propeller stage at which a fraction of the inflowing matter in the disk accretes onto the star. We introduce a novel method for inferring, from the light curve, the fraction of the inflowing matter in the disk that accretes onto the neutron star depending on the fastness parameter. We determine the fastness parameter range within which the transition from the accretion to the partial propeller stage is realized. This fastness parameter range is a measure of the scale height of the disk in units of the inner disk radius. We applied the method to a sample of outbursts of Aql X-1 with different maximum flux and duration times. We show that different outbursts with different maximum luminosity and duration follow a similar path in the parameter space of accreted/inflowing mass flux fraction versus fastness parameter.

Electronic still camera

NASA Astrophysics Data System (ADS)

Holland, S. Douglas

1992-09-01

A handheld, programmable, digital camera is disclosed that supports a variety of sensors and has program control over the system components to provide versatility. The camera uses a high performance design which produces near film quality images from an electronic system. The optical system of the camera incorporates a conventional camera body that was slightly modified, thus permitting the use of conventional camera accessories, such as telephoto lenses, wide-angle lenses, auto-focusing circuitry, auto-exposure circuitry, flash units, and the like. An image sensor, such as a charge coupled device ('CCD') collects the photons that pass through the camera aperture when the shutter is opened, and produces an analog electrical signal indicative of the image. The analog image signal is read out of the CCD and is processed by preamplifier circuitry, a correlated double sampler, and a sample and hold circuit before it is converted to a digital signal. The analog-to-digital converter has an accuracy of eight bits to insure accuracy during the conversion. Two types of data ports are included for two different data transfer needs. One data port comprises a general purpose industrial standard port and the other a high speed/high performance application specific port. The system uses removable hard disks as its permanent storage media. The hard disk receives the digital image signal from the memory buffer and correlates the image signal with other sensed parameters, such as longitudinal or other information. When the storage capacity of the hard disk has been filled, the disk can be replaced with a new disk.

Electronic Still Camera

NASA Technical Reports Server (NTRS)

Holland, S. Douglas (Inventor)

1992-01-01

A handheld, programmable, digital camera is disclosed that supports a variety of sensors and has program control over the system components to provide versatility. The camera uses a high performance design which produces near film quality images from an electronic system. The optical system of the camera incorporates a conventional camera body that was slightly modified, thus permitting the use of conventional camera accessories, such as telephoto lenses, wide-angle lenses, auto-focusing circuitry, auto-exposure circuitry, flash units, and the like. An image sensor, such as a charge coupled device ('CCD') collects the photons that pass through the camera aperture when the shutter is opened, and produces an analog electrical signal indicative of the image. The analog image signal is read out of the CCD and is processed by preamplifier circuitry, a correlated double sampler, and a sample and hold circuit before it is converted to a digital signal. The analog-to-digital converter has an accuracy of eight bits to insure accuracy during the conversion. Two types of data ports are included for two different data transfer needs. One data port comprises a general purpose industrial standard port and the other a high speed/high performance application specific port. The system uses removable hard disks as its permanent storage media. The hard disk receives the digital image signal from the memory buffer and correlates the image signal with other sensed parameters, such as longitudinal or other information. When the storage capacity of the hard disk has been filled, the disk can be replaced with a new disk.

Historic surface faulting in continental United States and adjacent parts of Mexico

USGS Publications Warehouse

Bonilla, M.G.

1967-01-01

This report summarizes geometric aspects of approximately 35 instances of historic faulting of the ground surface in the continental United States and adjacent parts of Mexico. This information is of immediate importance in the selection and evaluation of sites for vital structures such as nuclear power plants. The data are presented in a table and graphs which show the quantitative relations between various aspects of the faulting. Certain items in the table that are uncertain, poorly known, or not in the published literature are briefly described in the text.

Multi-Centrality Graph Spectral Decompositions and Their Application to Cyber Intrusion Detection

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

Chen, Pin-Yu; Choudhury, Sutanay; Hero, Alfred

Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method for single graph analysis, called multi-centrality graph PCA (MC-GPCA), and a new dictionary learning method for ensembles ofmore » graphs, called multi-centrality graph dictionary learning (MC-GDL), both based on spectral decomposition of multi-centrality matrices. As an application to cyber intrusion detection, MC-GPCA can be an effective indicator of anomalous connectivity pattern and MC-GDL can provide discriminative basis for attack classification.« less

Graphs, matrices, and the GraphBLAS: Seven good reasons

DOE PAGES

Kepner, Jeremy; Bader, David; Buluç, Aydın; ...

2015-01-01

The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less

Adjusting protein graphs based on graph entropy.

PubMed

Peng, Sheng-Lung; Tsay, Yu-Wei

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid.

Adjusting protein graphs based on graph entropy

PubMed Central

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid. PMID:25474347

Analysis of wear properties of aluminium based journal bearing alloys with and without lubrication.

NASA Astrophysics Data System (ADS)

Mathavan, J. Joy; Patnaik, Amar

2016-09-01

Apart from classical bearing materials, Aluminium alloys are used as bearing materials these days because of their superior quality. In this analysis, new Aluminium based bearing materials, with filler metals Si, Ni, and Cr are prepared by metal mould casting in burnout furnace machine, and tribological properties of these alloys with and without lubrication were tested. The experiments for wear with lubrication are conducted on multiple specimen tester and experiments without lubrication is conducted on Pin on disk tribometer. The disc material used was SAE 1050 steel. Wear tests were conducted at a sliding speed of 0.785 m/s and at a normal load of 20 N. Coefficient of friction values, temperature changes and wear of the specimens were plotted on graph according to the above mentioned working conditions. Hardness and weight losses of the specimens were calculated. The obtained results demonstrate how the friction and wear properties of these samples have changed with the % addition of Silicon, Chromium and Nickel to the base metal aluminium.

An object-oriented approach to data display and storage: 3 years experience, 25,000 cases.

PubMed

Sainsbury, D A

1993-11-01

Object-oriented programming techniques were used to develop computer based data display and storage systems. These have been operating in the 8 anaesthetising areas of the Adelaide Children's Hospital for 3 years. The analogue and serial outputs from an array of patient monitors are connected to IBM compatible PC-XT computers. The information is displayed on a colour screen as wave-form and trend graphs and digital format in 'real time'. The trend data is printed simultaneously on a dot matrix printer. This data is also stored for 24 hours on 'hard' disk. The major benefit has been the provision of a single visual focus for all monitored variables. The automatic logging of data has been invaluable in the analysis of critical incidents. The systems were made possible by recent, rapid improvements in computer hardware and software. This paper traces the development of the program and demonstrates the advantages of object-oriented programming techniques.

Local Area Networks: Are There Advantages for Primary Schools?

ERIC Educational Resources Information Center

Aherran, Anne

1986-01-01

Examines the relative merits of using computer networks (several computers linked together and sharing a single disk drive) and stand-alone systems (self-contained units operating independently) in Australian primary school classrooms. Advances several arguments favoring stand-alone systems, which improve accessibility and enhance individual…

CD-ROM Growth: Unleashing the Potential.

ERIC Educational Resources Information Center

Nelson, Nancy Melin

1991-01-01

Discusses the use of CD-ROMs in library processing and public services units. Topics discussed include local area networks, workstations, network security, search software, disk operating systems (DOS), computer viruses, CD-ROM selection and acquisition, licensing, and standards. A sidebar lists current CD-ROM products appropriate for reference…

Characterizing Containment and Related Classes of Graphs,

DTIC Science & Technology

1985-01-01

Math . to appear. [G2] Golumbic,. Martin C., D. Rotem and J. Urrutia. "Comparability graphs and intersection graphs" Discrete Math . 43 (1983) 37-40. [G3...intersection classes of graphs" Discrete Math . to appear. [S2] Scheinerman, Edward R. Intersection Classes and Multiple Intersection Parameters of Graphs...graphs and of interval graphs" Canad. Jour. of blath. 16 (1964) 539-548. [G1] Golumbic, Martin C. "Containment graphs: and. intersection graphs" Discrete

A Collection of Features for Semantic Graphs

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

Eliassi-Rad, T; Fodor, I K; Gallagher, B

2007-05-02

Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains brieflymore » features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.« less

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

PubMed

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Hubble Space Telescope discovery of candidate young globular clusters in the merger remnant NGC 7252

NASA Technical Reports Server (NTRS)

Whitmore, Bradley C.; Schweizer, Francois; Leitherer, Claus; Borne, Kirk; Robert, Carmelle

1993-01-01

New, high-resolution images of the central region of NGC 7252 obtained with the Planetary Camera of the HST are presented. NGC 7252 is a prototypical example of a remnant of two merged disk galaxies. Our most striking result is the discovery of a population of about 40 blue pointlike objects in this galaxy. The mean absolute magnitude of these objects is Mv = -13 mag; the mean color is V-I = 0.7 mag; and the mean effective radius is 10 pc. The luminosities, colors, projected spatial distribution, and sizes are all compatible with the hypothesis that these objects formed within the last 1 Gyr following the collision of two spiral galaxies, and that they are young globular clusters. It therefore appears that the number of globular clusters may increase during the merger of gas-rich galaxies. This weakens van den Bergh's objection against ellipticals being formed through disk mergers, based mainly on the fact that disk galaxies have fewer globular clusters per unit luminosity than ellipticals do. NGC 7252 shows a single, semistellar nucleus; relatively bright spiral structure is seen within 1.6 kpc of the center, presumably formed through the continued infall of gas into a disk around the center of the galaxy.

Tracking protein dynamics with photoconvertible Dendra2 on spinning disk confocal systems.

PubMed

Woods, Elena; Courtney, Jane; Scholz, Dimitri; Hall, William W; Gautier, Virginie W

2014-12-01

Understanding the dynamic properties of cellular proteins in live cells and in real time is essential to delineate their function. In this context, we introduce the Fluorescence Recovery After Photobleaching-Photoactivation unit (Andor) combined with the Nikon Eclipse Ti E Spinning Disk (Andor) confocal microscope as an advantageous and robust platform to exploit the properties of the Dendra2 photoconvertible fluorescent protein (Evrogen) and analyse protein subcellular trafficking in living cells. A major advantage of the spinning disk confocal is the rapid acquisition speed, enabling high temporal resolution of cellular processes. Furthermore, photoconversion and imaging are less invasive on the spinning disk confocal as the cell exposition to illumination power is reduced, thereby minimizing photobleaching and increasing cell viability. We have tested this commercially available platform using experimental settings adapted to track the migration of fast trafficking proteins such as UBC9, Fibrillarin and have successfully characterized their differential motion between subnuclear structures. We describe here step-by-step procedures, with emphasis on cellular imaging parameters, to successfully perform the dynamic imaging and photoconversion of Dendra2-fused proteins at high spatial and temporal resolutions necessary to characterize the trafficking pathways of proteins. © 2014 The Authors. Journal of Microscopy published by John Wiley & Sons, Ltd on behalf of Royal Microscopical Society.

Microsphere integrated microfluidic disk: synergy of two techniques for rapid and ultrasensitive dengue detection

PubMed Central

Hosseini, Samira; Aeinehvand, Mohammad M.; Uddin, Shah M.; Benzina, Abderazak; Rothan, Hussin A.; Yusof, Rohana; Koole, Leo H.; Madou, Marc J.; Djordjevic, Ivan; Ibrahim, Fatimah

2015-01-01

The application of microfluidic devices in diagnostic systems is well-established in contemporary research. Large specific surface area of microspheres, on the other hand, has secured an important position for their use in bioanalytical assays. Herein, we report a combination of microspheres and microfluidic disk in a unique hybrid platform for highly sensitive and selective detection of dengue virus. Surface engineered polymethacrylate microspheres with carefully designed functional groups facilitate biorecognition in a multitude manner. In order to maximize the utility of the microspheres’ specific surface area in biomolecular interaction, the microfluidic disk was equipped with a micromixing system. The mixing mechanism (microballoon mixing) enhances the number of molecular encounters between spheres and target analyte by accessing the entire sample volume more effectively, which subsequently results in signal amplification. Significant reduction of incubation time along with considerable lower detection limits were the prime motivations for the integration of microspheres inside the microfluidic disk. Lengthy incubations of routine analytical assays were reduced from 2 hours to 5 minutes while developed system successfully detected a few units of dengue virus. Obtained results make this hybrid microsphere-microfluidic approach to dengue detection a promising avenue for early detection of this fatal illness. PMID:26548806

Graphing with "LogoWriter."

ERIC Educational Resources Information Center

Yoder, Sharon K.

This book discusses four kinds of graphs that are taught in mathematics at the middle school level: pictographs, bar graphs, line graphs, and circle graphs. The chapters on each of these types of graphs contain information such as starting, scaling, drawing, labeling, and finishing the graphs using "LogoWriter." The final chapter of the…

PAGANI Toolkit: Parallel graph-theoretical analysis package for brain network big data.

PubMed

Du, Haixiao; Xia, Mingrui; Zhao, Kang; Liao, Xuhong; Yang, Huazhong; Wang, Yu; He, Yong

2018-05-01

The recent collection of unprecedented quantities of neuroimaging data with high spatial resolution has led to brain network big data. However, a toolkit for fast and scalable computational solutions is still lacking. Here, we developed the PArallel Graph-theoretical ANalysIs (PAGANI) Toolkit based on a hybrid central processing unit-graphics processing unit (CPU-GPU) framework with a graphical user interface to facilitate the mapping and characterization of high-resolution brain networks. Specifically, the toolkit provides flexible parameters for users to customize computations of graph metrics in brain network analyses. As an empirical example, the PAGANI Toolkit was applied to individual voxel-based brain networks with ∼200,000 nodes that were derived from a resting-state fMRI dataset of 624 healthy young adults from the Human Connectome Project. Using a personal computer, this toolbox completed all computations in ∼27 h for one subject, which is markedly less than the 118 h required with a single-thread implementation. The voxel-based functional brain networks exhibited prominent small-world characteristics and densely connected hubs, which were mainly located in the medial and lateral fronto-parietal cortices. Moreover, the female group had significantly higher modularity and nodal betweenness centrality mainly in the medial/lateral fronto-parietal and occipital cortices than the male group. Significant correlations between the intelligence quotient and nodal metrics were also observed in several frontal regions. Collectively, the PAGANI Toolkit shows high computational performance and good scalability for analyzing connectome big data and provides a friendly interface without the complicated configuration of computing environments, thereby facilitating high-resolution connectomics research in health and disease. © 2018 Wiley Periodicals, Inc.

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

Zhang, Fangyan; Zhang, Song; Chung Wong, Pak

Effectively visualizing large graphs and capturing the statistical properties are two challenging tasks. To aid in these two tasks, many sampling approaches for graph simplification have been proposed, falling into three categories: node sampling, edge sampling, and traversal-based sampling. It is still unknown which approach is the best. We evaluate commonly used graph sampling methods through a combined visual and statistical comparison of graphs sampled at various rates. We conduct our evaluation on three graph models: random graphs, small-world graphs, and scale-free graphs. Initial results indicate that the effectiveness of a sampling method is dependent on the graph model, themore » size of the graph, and the desired statistical property. This benchmark study can be used as a guideline in choosing the appropriate method for a particular graph sampling task, and the results presented can be incorporated into graph visualization and analysis tools.« less

An application of cluster detection to scene analysis

NASA Technical Reports Server (NTRS)

Rosenfeld, A. H.; Lee, Y. H.

1971-01-01

Certain arrangements of local features in a scene tend to group together and to be seen as units. It is suggested that in some instances, this phenomenon might be interpretable as a process of cluster detection in a graph-structured space derived from the scene. This idea is illustrated using a class of scenes that contain only horizontal and vertical line segments.

Transitions in forest fragmentation: implications for restoration opportunities at regional scales

Treesearch

James D. Wickham; K. Bruce Jones; Kurt H. Riitters; Timothy G. Wade; Robert V. O' Neill

1999-01-01

Where the potential natural vegetation is continuous forest (e.g., eastern US), a region can be divided into smaller units (e.g., counties, watersheds), and a graph of the proportion of forest in the largest patch versus the proportion in anthropogenic cover can be used as an index of forest fragmentation. If forests are not fragmented beyond that converted to...

Resolving the pulpwood canvass with inventory harvest information

Treesearch

Joseph M. McCollum; Tony G. Johnson

2012-01-01

The Resource Use section of the Forest Inventory and Analysis (FIA) Program has done a canvas of wood processing mills for timber product output (TPO) throughout the southern United States. Pulpmills in the South are canvassed on an annual basis, while all other mills (e.g., sawmills, veneer mills, etc.) are canvassed every two years. Attempts have been made to graph...

The Effect of Varied Gender Groupings on Argumentation Skills among Middle School Students in Different Cultures

ERIC Educational Resources Information Center

Hsu, Pi-Sui; Van Dyke, Margot; Smith, Thomas J.

2017-01-01

The purpose of this mixed-methods study was to explore the effect of varied gender groupings on argumentation skills among middle school students in Taiwan and the United States in a project-based learning environment that incorporated a graph-oriented computer-assisted application (GOCAA). A total of 43 students comprised the treatment condition…

How to generate and interpret fire characteristics charts for surface and crown fire behavior

Treesearch

Patricia L. Andrews; Faith Ann Heinsch; Luke Schelvan

2011-01-01

A fire characteristics chart is a graph that presents primary related fire behavior characteristics-rate of spread, flame length, fireline intensity, and heat per unit area. It helps communicate and interpret modeled or observed fire behavior. The Fire Characteristics Chart computer program plots either observed fire behavior or values that have been calculated by...

An algorithm for finding a similar subgraph of all Hamiltonian cycles

NASA Astrophysics Data System (ADS)

Wafdan, R.; Ihsan, M.; Suhaimi, D.

2018-01-01

This paper discusses an algorithm to find a similar subgraph called findSimSubG algorithm. A similar subgraph is a subgraph with a maximum number of edges, contains no isolated vertex and is contained in every Hamiltonian cycle of a Hamiltonian Graph. The algorithm runs only on Hamiltonian graphs with at least two Hamiltonian cycles. The algorithm works by examining whether the initial subgraph of the first Hamiltonian cycle is a subgraph of comparison graphs. If the initial subgraph is not in comparison graphs, the algorithm will remove edges and vertices of the initial subgraph that are not in comparison graphs. There are two main processes in the algorithm, changing Hamiltonian cycle into a cycle graph and removing edges and vertices of the initial subgraph that are not in comparison graphs. The findSimSubG algorithm can find the similar subgraph without using backtracking method. The similar subgraph cannot be found on certain graphs, such as an n-antiprism graph, complete bipartite graph, complete graph, 2n-crossed prism graph, n-crown graph, n-möbius ladder, prism graph, and wheel graph. The complexity of this algorithm is O(m|V|), where m is the number of Hamiltonian cycles and |V| is the number of vertices of a Hamiltonian graph.

Mathematical foundations of the GraphBLAS

DOE PAGES

Kepner, Jeremy; Aaltonen, Peter; Bader, David; ...

2016-12-01

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This study provides an introduction to the mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, themore » two are easily connected by matrix multiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of a small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Finally, performance measurements of prototype GraphBLAS implementations indicate that the overhead is low.« less

SXT and Taxo A Disks for Presumptive Identification of Group A and B Streptococci in Throat Cultures

PubMed Central

Gunn, Bruce A.

1976-01-01

A bacitracin (0.04 units, BBL)-SXT (trimethoprim, 1.25 mg, plus sulfamethoxazole, 23.75 mg, BBL) susceptibility test was 94% accurate in presumptively identifying streptococci as either group A, B or not group A and B. PMID:965480

78 FR 51737 - Notice of Issuance of Final Determination Concerning Certain Hard Disk Drives and Self-Encrypting...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-21

... the HDA incorporate semiconductor, magnetic, mechanical, and manufacturing process design into an..., mechanical surface design and manufacturing process design. It takes approximately [xxx] hours to design... brand names ``Barracuda'' and ``Desktop''. HDDs are designed in the United States and assembled either...

Teach with Databases: Toxics Release Inventory. [Multimedia].

ERIC Educational Resources Information Center

Barracato, Jay; Spooner, Barbara

This curriculum unit provides students with real world applications of science as it pertains to toxic releases into the environment. This boxed package contains the Toxics Release Inventory (TRI) Teacher's Guide, TRI Database Basics guide, comprehensive TRI compact disk with user's guide, "Getting Started: A Guide to Bringing Environmental…

The Dag Hammarskjold Library Reaches Out to the World.

ERIC Educational Resources Information Center

Chepesiuk, Ron

1998-01-01

Describes services offered at the Dag Hammarskjold Library at the United Nations (UN). Highlights include adopting new technology for a virtual library; the international law collection which is now accessible through the World Wide Web; UN depository libraries; material available on the Internet; the Optical Disk System, a storage/retrieval…

Curriculum Bank for Individualized Electronic Instruction. Final Report.

ERIC Educational Resources Information Center

Williamson, Bert; Pedersen, Joe F.

Objectives of this project were to update and convert to disk storage appropriate handout materials for courses for the electronic technology open classroom. Project activities were an ERIC search for computer-managed instructional materials; updating of the course outline, lesson outlines, information handouts, and unit tests; and storage of the…

Aggressiveness of Phytophthora cactorum, P. citricola I, and P. plurivora from European Beech

USDA-ARS?s Scientific Manuscript database

Phytophthora cactorum and P. citricola cause bleeding cankers on European beech trees in the northeastern United States. Inoculation experiments were conducted to compare the aggressiveness of P. cactorum and P. citricola isolates on stems, leaf disks, and roots of European beech and common lilac s...

Supercomputer Environments

DTIC Science & Technology

1990-01-09

data structures can easily be presented to the user interface. An emphasis of the Graph Browser was the realization of graph views and graph animation ... animation of the graph. Anima- tion of the graph includes changing node shapes, changing node and arc colors, changing node and arc text, and making...many graphs tend to be tree-like. Animtion of a graph is a useful feature. One of the primary goals of GMB was to support animated graphs. For animation

Computer-aided boundary delineation of agricultural lands

NASA Technical Reports Server (NTRS)

Cheng, Thomas D.; Angelici, Gary L.; Slye, Robert E.; Ma, Matt

1989-01-01

The National Agricultural Statistics Service of the United States Department of Agriculture (USDA) presently uses labor-intensive aerial photographic interpretation techniques to divide large geographical areas into manageable-sized units for estimating domestic crop and livestock production. Prototype software, the computer-aided stratification (CAS) system, was developed to automate the procedure, and currently runs on a Sun-based image processing system. With a background display of LANDSAT Thematic Mapper and United States Geological Survey Digital Line Graph data, the operator uses a cursor to delineate agricultural areas, called sampling units, which are assigned to strata of land-use and land-cover types. The resultant stratified sampling units are used as input into subsequent USDA sampling procedures. As a test, three counties in Missouri were chosen for application of the CAS procedures. Subsequent analysis indicates that CAS was five times faster in creating sampling units than the manual techniques were.

Probing Factors Influencing Students' Graph Comprehension Regarding Four Operations in Kinematics Graphs

ERIC Educational Resources Information Center

Phage, Itumeleng B.; Lemmer, Miriam; Hitge, Mariette

2017-01-01

Students' graph comprehension may be affected by the background of the students who are the readers or interpreters of the graph, their knowledge of the context in which the graph is set, and the inferential processes required by the graph operation. This research study investigated these aspects of graph comprehension for 152 first year…

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

NASA Astrophysics Data System (ADS)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Comparison and Enumeration of Chemical Graphs

PubMed Central

Akutsu, Tatsuya; Nagamochi, Hiroshi

2013-01-01

Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds. PMID:24688697

Chandra Pinpoints Edge Of Accretion Disk Around Black Hole

NASA Astrophysics Data System (ADS)

2001-05-01

Using four NASA space observatories, astronomers have shown that a flaring black hole source has an accretion disk that stops much farther out than some theories predict. This provides a better understanding of how energy is released when matter spirals into a black hole. On April 18, 2000, the Hubble Space Telescope and the Extreme Ultraviolet Explorer observed ultraviolet radiation from the object known as XTE J1118+480, a black hole roughly seven times the mass of the Sun, locked in a close binary orbit with a Sun-like star. Simultaneously, the Rossi X-ray Timing Explorer observed high-energy X-rays from matter plunging toward the black hole, while the Chandra X-ray Observatory focused on the critical energy band between the ultraviolet and high-energy X-rays, providing the link that tied all the data together. "By combining the observations of XTE J1118+480 at many different wavelengths, we have found the first clear evidence that the accretion disk can stop farther out," said Jeffrey McClintock of the Harvard-Smithsonian Center for Astrophysics who led the Chandra observations. "The Chandra data indicate that this accretion disk gets no closer to the event horizon than about 600 miles, a far cry from the 25 miles that some had expected." Scientists theorize that the accretion disk is truncated there because the material erupts into a hot bubble of gas before taking its final plunge into the black hole. Matter stripped from a companion star by a black hole can form a flat, pancake-like structure, called an “accretion disk.” As material spirals toward the inner edge of the accretion disk, it is heated by the immense gravity of the black hole, which causes it to radiate in X-rays. By examining the X-rays, researchers can gauge how far inward the accretion disk extends. Most astronomers agree that when material is transferred onto the black hole at a high rate, then the accretion disk will reach to within about 25 miles of the event horizon -- the surface of “no return” for matter or light falling into a black hole. However, scientists disagree on how close the accretion disk comes when the rate of transfer is much less. "The breakthrough came when Chandra did not detect the X-ray signature one would expect if the accretion disk came as near as 25 miles," said Ann Esin, a Caltech theoretical astrophysicist who led a group that explored the implications of the observations. "This presents a fundamental problem for models in which the disk extends close to the event horizon." In March 2000, XTE J1118+480 experienced a sudden eruption in X-rays that led to the discovery of the object by RXTE. The X-ray source was in a direction where absorption by gas and dust was minimal, allowing ultraviolet and low-energy X-rays to be observed. In the following month, an international team organized observations of XTE J1118+480 in other wavelengths. Chandra observed XTE J1118+480 for 27,000 seconds with its Low-Energy Transmission Grating (LETG) and the Advanced CCD Imaging Spectrometer (ACIS). The research team for this investigation also included scientists from both the United States (CfA, MIT, University of Notre Dame, Lawrence Livermore National Laboratory, NASA Goddard Space Flight Center) and the United Kingdom (The Open University, University of Southampton, Mullard Radio Astronomy Observatory). The LETG was built by the SRON and the Max Planck Institute, and the ACIS instrument by the Massachusetts Institute of Technology, Cambridge, Mass., and Penn State University, University Park. NASA's Marshall Space Flight Center in Huntsville, AL, manages the Chandra program. TRW, Inc., Redondo Beach, Calif., is the prime contractor for the spacecraft. The Smithsonian's Chandra X-ray Center controls science and flight operations from Cambridge, Mass. Images associated with this release are available on the World Wide Web at: http://chandra.harvard.edu AND http://chandra.nasa.gov

Behavior-over-time graphs: assessing perceived trends in healthy eating and active living environments and behaviors across 49 communities.

PubMed

Hoehner, Christine M; Sabounchi, Nasim S; Brennan, Laura K; Hovmand, Peter; Kemner, Allison

2015-01-01

In the evaluation of the Healthy Kids, Healthy Communities initiative, investigators implemented Group Model Building (GMB) to promote systems thinking at the community level. As part of the GMB sessions held in each community partnership, participants created behavior-over-time graphs (BOTGs) to characterize their perceptions of changes over time related to policies, environments, collaborations, and social determinants in their community related to healthy eating, active living, and childhood obesity. To describe the process of coding BOTGs and their trends. Descriptive study of trends among BOTGs from 11 domains (eg, active living environments, social determinants of health, funding) and relevant categories and subcategories based on the graphed variables. In addition, BOTGs were distinguished by whether the variables were positively (eg, access to healthy foods) or negatively (eg, screen time) associated with health. The GMB sessions were held in 49 community partnerships across the United States. Participants in the GMB sessions (n = 590; n = 5-21 per session) included key individuals engaged in or impacted by the policy, system, or environmental changes occurring in the community. Thirty codes were developed to describe the direction (increasing, decreasing, stable) and shape (linear, reinforcing, balancing, or oscillating) of trends from 1660 graphs. The patterns of trends varied by domain. For example, among variables positively associated with health, the prevalence of reinforcing increasing trends was highest for active living and healthy eating environments (37.4% and 29.3%, respectively), partnership and community capacity (38.8%), and policies (30.2%). Examination of trends of specific variables suggested both convergence (eg, for cost of healthy foods) and divergence (eg, for farmers' markets) of trends across partnerships. Behavior-over-time graphs provide a unique data source for understanding community-level trends and, when combined with causal maps and computer modeling, can yield insights about prevention strategies to address childhood obesity.

Mean square cordial labelling related to some acyclic graphs and its rough approximations

NASA Astrophysics Data System (ADS)

Dhanalakshmi, S.; Parvathi, N.

2018-04-01

In this paper we investigate that the path Pn, comb graph Pn⊙K1, n-centipede graph,centipede graph (n,2) and star Sn admits mean square cordial labeling. Also we proved that the induced sub graph obtained by the upper approximation of any sub graph H of the above acyclic graphs admits mean square cordial labeling.

THE PHOTOMETRIC AND KINEMATIC STRUCTURE OF FACE-ON DISK GALAXIES. III. KINEMATIC INCLINATIONS FROM H{alpha} VELOCITY FIELDS

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

Andersen, David R.; Bershady, Matthew A., E-mail: david.andersen@nrc-cnrc.gc.ca, E-mail: mab@astro.wisc.edu

2013-05-01

Using the integral field unit DensePak on the WIYN 3.5 m telescope we have obtained H{alpha} velocity fields of 39 nearly face-on disks at echelle resolutions. High-quality, uniform kinematic data and a new modeling technique enabled us to derive accurate and precise kinematic inclinations with mean i{sub kin} = 23 Degree-Sign for 90% of these galaxies. Modeling the kinematic data as single, inclined disks in circular rotation improves upon the traditional tilted-ring method. We measure kinematic inclinations with a precision in sin i of 25% at 20 Degree-Sign and 6% at 30 Degree-Sign . Kinematic inclinations are consistent with photometricmore » and inverse Tully-Fisher inclinations when the sample is culled of galaxies with kinematic asymmetries, for which we give two specific prescriptions. Kinematic inclinations can therefore be used in statistical ''face-on'' Tully-Fisher studies. A weighted combination of multiple, independent inclination measurements yield the most precise and accurate inclination. Combining inverse Tully-Fisher inclinations with kinematic inclinations yields joint probability inclinations with a precision in sin i of 10% at 15 Degree-Sign and 5% at 30 Degree-Sign . This level of precision makes accurate mass decompositions of galaxies possible even at low inclination. We find scaling relations between rotation speed and disk-scale length identical to results from more inclined samples. We also observe the trend of more steeply rising rotation curves with increased rotation speed and light concentration. This trend appears to be uncorrelated with disk surface brightness.« less

Partial Accretion in the Propeller Stage of Low-mass X-Ray Binary Aql X–1

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

Güngör, C.; Ekşi, K. Y.; Göğüş, E.

Aql X–1 is one of the most prolific low-mass X-ray binary transients (LMXBTs) showing outbursts almost annually. We present the results of our spectral analyses of Rossi X-Ray Timing Explorer /proportional counter-array observations of the 2000 and 2011 outbursts. We investigate the spectral changes related to the changing disk-magnetosphere interaction modes of Aql X–1. The X-ray light curves of the outbursts of LMXBTs typically show phases of fast rise and exponential decay. The decay phase shows a “knee” where the flux goes from the slow-decay to the rapid-decay stage. We assume that the rapid decay corresponds to a weak propellermore » stage at which a fraction of the inflowing matter in the disk accretes onto the star. We introduce a novel method for inferring, from the light curve, the fraction of the inflowing matter in the disk that accretes onto the neutron star depending on the fastness parameter. We determine the fastness parameter range within which the transition from the accretion to the partial propeller stage is realized. This fastness parameter range is a measure of the scale height of the disk in units of the inner disk radius. We applied the method to a sample of outbursts of Aql X–1 with different maximum flux and duration times. We show that different outbursts with different maximum luminosity and duration follow a similar path in the parameter space of accreted/inflowing mass flux fraction versus fastness parameter.« less

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Compiling and editing agricultural strata boundaries with remotely sensed imagery and map attribute data using graphics workstations

NASA Technical Reports Server (NTRS)

Cheng, Thomas D.; Angelici, Gary L.; Slye, Robert E.; Ma, Matt

1991-01-01

The USDA presently uses labor-intensive photographic interpretation procedures to delineate large geographical areas into manageable size sampling units for the estimation of domestic crop and livestock production. Computer software to automate the boundary delineation procedure, called the computer-assisted stratification and sampling (CASS) system, was developed using a Hewlett Packard color-graphics workstation. The CASS procedures display Thematic Mapper (TM) satellite digital imagery on a graphics display workstation as the backdrop for the onscreen delineation of sampling units. USGS Digital Line Graph (DLG) data for roads and waterways are displayed over the TM imagery to aid in identifying potential sample unit boundaries. Initial analysis conducted with three Missouri counties indicated that CASS was six times faster than the manual techniques in delineating sampling units.

Topic Model for Graph Mining.

PubMed

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

Vibration-Based Data Used to Detect Cracks in Rotating Disks

NASA Technical Reports Server (NTRS)

Gyekenyesi, Andrew L.; Sawicki, Jerzy T.; Martin, Richard E.; Baaklini, George Y.

2004-01-01

Rotor health monitoring and online damage detection are increasingly gaining the interest of aircraft engine manufacturers. This is primarily due to the fact that there is a necessity for improved safety during operation as well as a need for lower maintenance costs. Applied techniques for the damage detection and health monitoring of rotors are essential for engine safety, reliability, and life prediction. Recently, the United States set the ambitious goal of reducing the fatal accident rate for commercial aviation by 80 percent within 10 years. In turn, NASA, in collaboration with the Federal Aviation Administration, other Federal agencies, universities, and the airline and aircraft industries, responded by developing the Aviation Safety Program. This program provides research and technology products needed to help the aerospace industry achieve their aviation safety goal. The Nondestructive Evaluation (NDE) Group of the Optical Instrumentation Technology Branch at the NASA Glenn Research Center is currently developing propulsion-system-specific technologies to detect damage prior to catastrophe under the propulsion health management task. Currently, the NDE group is assessing the feasibility of utilizing real-time vibration data to detect cracks in turbine disks. The data are obtained from radial blade-tip clearance and shaft-clearance measurements made using capacitive or eddy-current probes. The concept is based on the fact that disk cracks distort the strain field within the component. This, in turn, causes a small deformation in the disk's geometry as well as a possible change in the system's center of mass. The geometric change and the center of mass shift can be indirectly characterized by monitoring the amplitude and phase of the first harmonic (i.e., the 1 component) of the vibration data. Spin pit experiments and full-scale engine tests have been conducted while monitoring for crack growth with this detection methodology. Even so, published data are extremely limited, and the basic foundation of the methodology has not been fully studied. The NDE group is working on developing this foundation on the basis of theoretical modeling as well as experimental data by using the newly constructed subscale spin system shown in the preceding photograph. This, in turn, involved designing an optimal sub-scale disk that was meant to represent a full-scale turbine disk; conducting finite element analyses of undamaged and damaged disks to define the disk's deformation and the resulting shift in center of mass; and creating a rotordynamic model of the complete disk and shaft assembly to confirm operation beyond the first critical concerning the subscale experimental setup. The finite element analysis data, defining the center of mass shift due to disk damage, are shown. As an example, the change in the center of mass for a disk spinning at 8000 rpm with a 0.963-in. notch was 1.3 x 10(exp -4) in. The actual vibration response of an undamaged disk as well as the theoretical response of a cracked disk is shown. Experiments with cracked disks are continuing, and new approaches for analyzing the captured vibration data are being developed to better detect damage in a rotor. In addition, the subscale spin system is being used to test the durability and sensitivity of new NDE sensors that focus on detecting localized damage. This is designed to supplement the global response of the crack-detection methodology described here.

Preserving Differential Privacy in Degree-Correlation based Graph Generation

PubMed Central

Wang, Yue; Wu, Xintao

2014-01-01

Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as cluster coefficient often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we study the problem of enforcing edge differential privacy in graph generation. The idea is to enforce differential privacy on graph model parameters learned from the original network and then generate the graphs for releasing using the graph model with the private parameters. In particular, we develop a differential privacy preserving graph generator based on the dK-graph generation model. We first derive from the original graph various parameters (i.e., degree correlations) used in the dK-graph model, then enforce edge differential privacy on the learned parameters, and finally use the dK-graph model with the perturbed parameters to generate graphs. For the 2K-graph model, we enforce the edge differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We conduct experiments on four real networks and compare the performance of our private dK-graph models with the stochastic Kronecker graph generation model in terms of utility and privacy tradeoff. Empirical evaluations show the developed private dK-graph generation models significantly outperform the approach based on the stochastic Kronecker generation model. PMID:24723987

A spatially resolved retarding field energy analyzer design suitable for uniformity analysis across the surface of a semiconductor wafer

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

Sharma, S., E-mail: shailesh.sharma6@mail.dcu.ie; National Centre for Plasma Science and Technology, Dublin City University, Glasnevin, Dublin 9; Gahan, D., E-mail: david.gahan@impedans.com

2014-04-15

A novel retarding field energy analyzer design capable of measuring the spatial uniformity of the ion energy and ion flux across the surface of a semiconductor wafer is presented. The design consists of 13 individual, compact-sized, analyzers, all of which are multiplexed and controlled by a single acquisition unit. The analyzers were tested to have less than 2% variability from unit to unit due to tight manufacturing tolerances. The main sensor assembly consists of a 300 mm disk to mimic a semiconductor wafer and the plasma sampling orifices of each sensor are flush with disk surface. This device is placedmore » directly on top of the rf biased electrode, at the wafer location, in an industrial capacitively coupled plasma reactor without the need for any modification to the electrode structure. The ion energy distribution, average ion energy, and average ion flux were measured at the 13 locations over the surface of the powered electrode to determine the degree of spatial nonuniformity. The ion energy and ion flux are shown to vary by approximately 20% and 5%, respectively, across the surface of the electrode for the range of conditions investigated in this study.« less

How Warm is Mars?

NASA Technical Reports Server (NTRS)

2004-01-01

This graph shows the predicted daily change in the atmospheric temperature one meter above the surface of Mars at Gusev Crater, the Mars Exploration Rover Spirit's landing site. The blue curve denotes predicted values for sol 1 (the first day of Spirit's mission) and the yellow for sol 100 (100 days into the mission). The light blue symbols represent temperatures for a total atmospheric dust abundance of 0.7 visible optical depth units, and the darker blue symbols for a total atmospheric dust abundance of 1.0 visible optical depth units. Scientists use this data to ensure that Spirit stays within the right temperature range.

A general method for computing Tutte polynomials of self-similar graphs

NASA Astrophysics Data System (ADS)

Gong, Helin; Jin, Xian'an

2017-10-01

Self-similar graphs were widely studied in both combinatorics and statistical physics. Motivated by the construction of the well-known 3-dimensional Sierpiński gasket graphs, in this paper we introduce a family of recursively constructed self-similar graphs whose inner duals are of the self-similar property. By combining the dual property of the Tutte polynomial and the subgraph-decomposition trick, we show that the Tutte polynomial of this family of graphs can be computed in an iterative way and in particular the exact expression of the formula of the number of their spanning trees is derived. Furthermore, we show our method is a general one that is easily extended to compute Tutte polynomials for other families of self-similar graphs such as Farey graphs, 2-dimensional Sierpiński gasket graphs, Hanoi graphs, modified Koch graphs, Apollonian graphs, pseudofractal scale-free web, fractal scale-free network, etc.

Bipartite separability and nonlocal quantum operations on graphs

NASA Astrophysics Data System (ADS)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

The Gemini Planet-finding Campaign: The Frequency Of Giant Planets around Debris Disk Stars

NASA Astrophysics Data System (ADS)

Wahhaj, Zahed; Liu, Michael C.; Nielsen, Eric L.; Biller, Beth A.; Hayward, Thomas L.; Close, Laird M.; Males, Jared R.; Skemer, Andrew; Ftaclas, Christ; Chun, Mark; Thatte, Niranjan; Tecza, Matthias; Shkolnik, Evgenya L.; Kuchner, Marc; Reid, I. Neill; de Gouveia Dal Pino, Elisabete M.; Alencar, Silvia H. P.; Gregorio-Hetem, Jane; Boss, Alan; Lin, Douglas N. C.; Toomey, Douglas W.

2013-08-01

We have completed a high-contrast direct imaging survey for giant planets around 57 debris disk stars as part of the Gemini NICI Planet-Finding Campaign. We achieved median H-band contrasts of 12.4 mag at 0.''5 and 14.1 mag at 1'' separation. Follow-up observations of the 66 candidates with projected separation <500 AU show that all of them are background objects. To establish statistical constraints on the underlying giant planet population based on our imaging data, we have developed a new Bayesian formalism that incorporates (1) non-detections, (2) single-epoch candidates, (3) astrometric and (4) photometric information, and (5) the possibility of multiple planets per star to constrain the planet population. Our formalism allows us to include in our analysis the previously known β Pictoris and the HR 8799 planets. Our results show at 95% confidence that <13% of debris disk stars have a >=5 M Jup planet beyond 80 AU, and <21% of debris disk stars have a >=3 M Jup planet outside of 40 AU, based on hot-start evolutionary models. We model the population of directly imaged planets as d 2 N/dMdavpropm α a β, where m is planet mass and a is orbital semi-major axis (with a maximum value of a max). We find that β < -0.8 and/or α > 1.7. Likewise, we find that β < -0.8 and/or a max < 200 AU. For the case where the planet frequency rises sharply with mass (α > 1.7), this occurs because all the planets detected to date have masses above 5 M Jup, but planets of lower mass could easily have been detected by our search. If we ignore the β Pic and HR 8799 planets (should they belong to a rare and distinct group), we find that <20% of debris disk stars have a >=3 M Jup planet beyond 10 AU, and β < -0.8 and/or α < -1.5. Likewise, β < -0.8 and/or a max < 125 AU. Our Bayesian constraints are not strong enough to reveal any dependence of the planet frequency on stellar host mass. Studies of transition disks have suggested that about 20% of stars are undergoing planet formation; our non-detections at large separations show that planets with orbital separation >40 AU and planet masses >3 M Jup do not carve the central holes in these disks. Based on observations obtained at the Gemini Observatory, which is operated by the Association of Universities for Research in Astronomy, Inc., under a cooperative agreement with the NSF on behalf of the Gemini partnership: the National Science Foundation (United States), the Science and Technology Facilities Council (United Kingdom), the National Research Council (Canada), CONICYT (Chile), the Australian Research Council (Australia), Ministério da Ciência e Tecnologia (Brazil) and Ministerio de Ciencia, Tecnología e Innovación Productiva (Argentina).

On the local edge antimagicness of m-splitting graphs

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Dafik; Slamin; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v‧ in every vertex v‧ such that v‧ adjacent to v in graph G. An m-splitting graph is a graph which has m v‧-vertices, denoted by mSpl(G). A local edge antimagic coloring in G = (V, E) graph is a bijection f:V (G)\\to \\{1,2,3,\\ldots,|V(G)|\\} in which for any two adjacent edges e 1 and e 2 satisfies w({e}1)\

Survey of Approaches to Generate Realistic Synthetic Graphs

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

Lim, Seung-Hwan; Lee, Sangkeun; Powers, Sarah S

A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broadmore » set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.« less

Self-organizing maps for learning the edit costs in graph matching.

PubMed

Neuhaus, Michel; Bunke, Horst

2005-06-01

Although graph matching and graph edit distance computation have become areas of intensive research recently, the automatic inference of the cost of edit operations has remained an open problem. In the present paper, we address the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps (SOMs) that represent the distance measuring spaces of node and edge labels. Our learning process is based on the concept of self-organization. It adapts the edit costs in such a way that the similarity of graphs from the same class is increased, whereas the similarity of graphs from different classes decreases. The learning procedure is demonstrated on two different applications involving line drawing graphs and graphs representing diatoms, respectively.

Apparatuses and Methods for Producing Runtime Architectures of Computer Program Modules

NASA Technical Reports Server (NTRS)

Abi-Antoun, Marwan Elia (Inventor); Aldrich, Jonathan Erik (Inventor)

2013-01-01

Apparatuses and methods for producing run-time architectures of computer program modules. One embodiment includes creating an abstract graph from the computer program module and from containment information corresponding to the computer program module, wherein the abstract graph has nodes including types and objects, and wherein the abstract graph relates an object to a type, and wherein for a specific object the abstract graph relates the specific object to a type containing the specific object; and creating a runtime graph from the abstract graph, wherein the runtime graph is a representation of the true runtime object graph, wherein the runtime graph represents containment information such that, for a specific object, the runtime graph relates the specific object to another object that contains the specific object.

Educational Attainment in the United States: March 1989 and 1988.

ERIC Educational Resources Information Center

Kominski, Robert

1991-01-01

Data from the Bureau of the Census' March 1988 and 1989 Current Population Surveys (CPS) on the educational attainment of Americans are provided in 22 tables and 5 graphs. Summary data on the years of school completed by age, sex, race, and Hispanic origin are shown for 1988 and 1989 in Table 1. Other detailed data are shown for 1989 in Tables 2…

Oil Spill! Student Guide and Teacher Guide. OEAGLS Investigation 17.

ERIC Educational Resources Information Center

Fortner, Rosanne W.; Ihle, Stephanie

Presented in this unit are three activities concerning the causes and effects of oil spills and methods used to clean up these spills in the oceans and Great Lakes. Students construct and interpret a graph showing oil pollution sources. The students create and try to clean up a small-scale oil spill in a pan, and they compare the water quality of…

Electrical Power Distribution and Control Modeling and Analysis

NASA Technical Reports Server (NTRS)

Fu, Johnny S.; Liffring, Mark; Mehdi, Ishaque S.

2001-01-01

This slide presentation reviews the use of Electrical Power Distribution and Control (EPD&C) Modeling and how modeling can support analysis. The presentation discusses using the EASY5 model to simulate and analyze the Space Shuttle Electric Auxiliary Power Unit. Diagrams of the model schematics are included, as well as graphs of the battery cell impedance, hydraulic load dynamics, and EPD&C response to hydraulic load variations.

Energy Facts; Subcommittee on Energy of the Committee on Science and Astronautics, House of Representatives, Ninety-Third Congress, First Session [Committee Print.

ERIC Educational Resources Information Center

Library of Congress, Washington, DC. Congressional Research Service.

This handbook contains a comprehensive selection of United States and foreign energy statistics in the form of graphs and tables. The data are classified according to resources, production, consumption and demand, energy and gross national product, and research and development. Statistics on energy sources such as coal, oil, gas, nuclear energy,…

Predicting Hospital Admissions With Poisson Regression Analysis

DTIC Science & Technology

2009-06-01

East and Four West. Four East is where bariatric , general, neurologic, otolaryngology (ENT), ophthalmologic, orthopedic, and plastic surgery ...where care is provided for cardiovascular, thoracic, and vascular surgery patients. Figure 1 shows a bar graph for each unit, giving the proportion of...provided at NMCSD, or a study could be conducted on the amount of time that patients generally wait for elective surgeries . There is also the

Integrated Information Support System (IISS). Volume 8. User Interface Subsystem. Part 10. Graph Support System Unit Test Plan

DTIC Science & Technology

1990-09-30

UTP 620344220 30 September 1990 Command Line form gfl MSG: Estructure closed apIcatic Figure 5-64b (AFTER) 5-132 UTP 620344220 30 September 1990 Command...620344220 30 September 1990 Comman Lineay form gf 1 MSG: Estructure 9 psted on workstation 1 at priority 1 applcatioo Figure 5-101a (BEFORE) 5-205 UTP

Geothermal systems

NASA Technical Reports Server (NTRS)

Mohl, C.

1978-01-01

Several tasks of JPL related to geothermal energy are discussed. The major task is the procurement and test and evaluation of a helical screw drive (wellhead unit). A general review of geothermal energy systems is given. The presentation focuses attention on geothermal reservoirs in California, with graphs and charts to support the discussion. Included are discussions on cost analysis, systems maintenance, and a comparison of geothermal and conventional heating and cooling systems.

High-Resolution Near-Infrared Spectroscopy of FU Orionis Objects

NASA Astrophysics Data System (ADS)

Hartmann, Lee; Hinkle, Kenneth; Calvet, Nuria

2004-07-01

We present an analysis of recent near-infrared, high-resolution spectra of the variable FU Ori objects. During a phase of rapid fading in optical brightness during 1997, V1057 Cyg exhibited shell absorption in first-overtone (v''-v'=2-0) CO lines, blueshifted by about 50 km s-1 from the system velocity. This shell component had not been seen previously, nor was it present in 1999, although some blueshifted absorption asymmetry is seen at the latter epoch. The appearance of this CO absorption shell is connected with the roughly contemporaneous appearance of blueshifted, low-excitation optical absorption lines with comparable low velocities; we suggest that this shell was also responsible for some of the peculiar emission features seen in red-optical spectra of V1057 Cyg. FU Ori continues to exhibit broad CO lines, with some evidence for the double-peaked profiles characteristic of an accretion disk; the line profiles are consistent with previous observations. Both FU Ori and V1057 Cyg continue to exhibit lower rotational broadening at 2.3 μm than at optical wavelengths, in agreement with the prediction of differentially rotating disk models; we have a marginal detection of the same effect in V1515 Cyg. The relative population of the first-overtone CO rotational levels in the FU Ori objects suggests low excitation temperatures. We compare disk models to the observations and find agreement with overall line strengths and rotational broadening, but the observed line profiles are generally less double-peaked than predicted. We suggest that the discrepancy in line profiles is due to turbulent motions in FU Ori disks, an effect qualitatively predicted by recent simulations of the magnetorotational instability in vertically stratified accretion disks. Based on observations obtained at the Gemini Observatory, which is operated by the Association of Universities for Research in Astronomy (AURA), Inc., under a cooperative agreement with the NSF, on behalf of the Gemini partnership: the National Science Foundation (United States), the Particle Physics and Astronomy Research Council (United Kingdom), the National Research Council (Canada), CONICYT (Chile), the Australian Research Council (Australia), CNPq (Brazil), and CONICRT (Argentina). Based on observations obtained with the Phoenix infrared spectrograph, developed and operated by the National Optical Astronomy Observatory. The National Optical Astronomy Observatory is operated by the AURA, Inc. under cooperative agreement with the National Science Foundation.

A Multi-instrument and Multi-wavelength High Angular Resolution Study of MWC 614: Quantum Heated Particles Inside the Disk Cavity

NASA Astrophysics Data System (ADS)

Kluska, Jacques; Kraus, Stefan; Davies, Claire L.; Harries, Tim; Willson, Matthew; Monnier, John D.; Aarnio, Alicia; Baron, Fabien; Millan-Gabet, Rafael; Ten Brummelaar, Theo; Che, Xiao; Hinkley, Sasha; Preibisch, Thomas; Sturmann, Judit; Sturmann, Laszlo; Touhami, Yamina

2018-03-01

High angular resolution observations of young stellar objects are required to study the inner astronomical units of protoplanetary disks in which the majority of planets form. As they evolve, gaps open up in the inner disk regions and the disks are fully dispersed within ∼10 Myr. MWC 614 is a pretransitional object with a ∼10 au radius gap. We present a set of high angular resolution observations of this object including SPHERE/ZIMPOL polarimetric and coronagraphic images in the visible, Keck/NIRC2 near-infrared (NIR) aperture masking observations, and Very Large Telescope Interferometer (AMBER, MIDI, and PIONIER) and Center for High Angular Resolution Astronomy (CLASSIC and CLIMB) long-baseline interferometry at infrared wavelengths. We find that all the observations are compatible with an inclined disk (i ∼ 55° at a position angle of ∼20°–30°). The mid-infrared data set confirms that the disk inner rim is at 12.3 ± 0.4 au from the central star. We determined an upper mass limit of 0.34 M ⊙ for a companion inside the cavity. Within the cavity, the NIR emission, usually associated with the dust sublimation region, is unusually extended (∼10 au, 30 times larger than the theoretical sublimation radius) and indicates a high dust temperature (T ∼ 1800 K). As a possible result of companion-induced dust segregation, quantum heated dust grains could explain the extended NIR emission with this high temperature. Our observations confirm the peculiar state of this object where the inner disk has already been accreted onto the star, exposing small particles inside the cavity to direct stellar radiation. Based on observations made with the Keck observatory (NASA program ID N104N2) and with ESO telescopes at the Paranal Observatory (ESO program IDs 073.C-0720, 077.C-0226, 077.C-0521, 083.C-0984, 087.C-0498(A), 190.C-0963, 095.C-0883) and with the Center for High Angular Resolution Astronomy observatory.

The Interaction of Implant Luting Cements and Oral Bacteria Linked to Peri-Implant Disease: An In Vitro Analysis of Planktonic and Biofilm Growth--A Preliminary Study.

PubMed

Raval, Neal C; Wadhwani, Chandur P K; Jain, Sumita; Darveau, Richard P

2015-12-01

There is little consensus on the most appropriate cement to use when restoring a cement-retained, implant-supported restoration. One consideration should be the interaction of pathogenic oral bacteria with restorative cements. To determine how oral bacteria associated with peri-implant disease grow in the presence of implant cements. Five test cements with varying composition (zinc oxide-eugenol [TBO], eugenol-free zinc oxide [TBNE], zinc orthophosphate [FL], and two resin cements [PIC and ML]) were used to fabricate specimen disks. The disks were submerged in bacterial suspensions of either Aggregatibacter actinomycetemcomitans, Fusobacterium nucleatum, or Porphyromonas gingivalis. Planktonic bacterial growth within the test media was measured by determining the optical density of the cultures (OD600 ). Positive controls (media and bacteria without cement disks) and negative controls (media alone) were similarly evaluated. The mean and standard deviations (SD) were calculated for planktonic growth from three separate experiments. ANOVA statistical analysis with post hoc Tukey tests was performed where differences existed (p < .05). Selected cement disks (TBO and ML) were further examined for bacterial biofilm growth. Surface bacteria were removed and grown on agar media, and colony-forming units (CFUs) were quantified. Planktonic growth for both A. actinomycetemcomitans and P. gingivalis was significantly inhibited (p < .05) when grown in the presence of cement disks consisting of TBNE, PIC, FL, and TBO. In contrast, neither of these bacteria displayed growth inhibition in the presence of ML cement disks. F. nucleatum growth was also significantly inhibited by PIC, FL. and TBO (p < .05), but not by ML and TBNE cement disks. CFU counts for the biofilm study for TBO gave minimal and, in some instances, no bacterial adherence and growth, in contrast to ML, which supported substantially greater bacterial biofilm growth. Cements display differing abilities to inhibit both planktonic and biofilm bacterial growth. Cements with the ability to reduce planktonic or biofilm growth of the test bacteria may be advantageous in reducing peri-implant disease. Understanding the microbial growth-inhibiting characteristics of different cement types should be considered important in the selection criteria. © 2014 Wiley Periodicals, Inc.

G-Hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases.

PubMed

Wang, Xiaohong; Smalter, Aaron; Huan, Jun; Lushington, Gerald H

2009-01-01

Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important research topic. Graph similarity search has applications in a wide range of domains including cheminformatics, bioinformatics, sensor network management, social network management, and XML documents, among others.Most of the current graph indexing methods focus on subgraph query processing, i.e. determining the set of database graphs that contains the query graph and hence do not directly support similarity search. In data mining and machine learning, various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models for supervised learning, graph kernel functions have (i) high computational complexity and (ii) non-trivial difficulty to be indexed in a graph database.Our objective is to bridge graph kernel function and similarity search in graph databases by proposing (i) a novel kernel-based similarity measurement and (ii) an efficient indexing structure for graph data management. Our method of similarity measurement builds upon local features extracted from each node and their neighboring nodes in graphs. A hash table is utilized to support efficient storage and fast search of the extracted local features. Using the hash table, a graph kernel function is defined to capture the intrinsic similarity of graphs and for fast similarity query processing. We have implemented our method, which we have named G-hash, and have demonstrated its utility on large chemical graph databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Most importantly, the new similarity measurement and the index structure is scalable to large database with smaller indexing size, faster indexing construction time, and faster query processing time as compared to state-of-the-art indexing methods such as C-tree, gIndex, and GraphGrep.

GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

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

Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil

2015-11-15

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host andmore » device.« less

Compact Packaging of Photonic Millimeter-Wave Receiver

NASA Technical Reports Server (NTRS)

Nguyen, Hung; Pouch, John; Miranda, Felix; Levi, Anthony F.

2007-01-01

A carrier structure made from a single silicon substrate is the basis of a compact, lightweight, relatively inexpensive package that holds the main optical/electronic coupling components of a photonic millimeter-wave receiver based on a lithium niobate resonator disk. The design of the package is simple and provides for precise relative placement of optical components, eliminating the need for complex, bulky positioning mechanisms like those commonly used to align optical components to optimize focus and coupling. Although a prototype of the package was fabricated as a discrete unit, the design is amenable to integration of the package into a larger photonic and/or electronic receiver system. The components (see figure) include a lithium niobate optical resonator disk of 5-mm diameter and .200- m thickness, positioned adjacent to a millimeter- wave resonator electrode. Other components include input and output coupling prisms and input and output optical fibers tipped with ball lenses for focusing and collimation, respectively. Laser light is introduced via the input optical fiber and focused into the input coupling prism. The input coupling prism is positioned near (but not in contact with) the resonator disk so that by means of evanescent-wave coupling, the input laser light in the prism gives rise to laser light propagating circumferentially in guided modes in the resonator disk. Similarly, a portion of the circumferentially propagating optical power is extracted from the disk by evanescent-wave coupling from the disk to the output coupling prism, from whence the light passes through the collimating ball lens into the output optical fiber. The lens-tipped optical fibers must be positioned at a specified focal distance from the prisms. The optical fibers and the prisms must be correctly positioned relative to the resonator disk and must be oriented to obtain the angle of incidence (55 in the prototype) required for evanescent-wave coupling of light into and out of the desired guided modes in the resonator disk. To satisfy all these requirements, precise alignment features are formed in the silicon substrate by use of a conventional wet-etching process. These features include a 5-mm-diameter, 50- m-deep cavity that holds the disk; two trapezoidal-cross-section recesses for the prisms; and two grooves that hold the optical fibers at the correct positions and angles relative to the prisms and disk. The fiber grooves contain abrupt tapers, near the prisms, that serve as hard stops for positioning the lenses at the focal distance from the prisms. There are also two grooves for prismadjusting rods. The design provides a little slack in the prism recesses for adjusting the positions of the prisms by means of these rods to optimize the optical coupling.

Comparing Internet Probing Methodologies Through an Analysis of Large Dynamic Graphs

DTIC Science & Technology

2014-06-01

comparable Internet topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical...topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical measurements as well...We compare these by modeling union of traceroute outputs as graphs, and study the graphs by using vertex and edge count, average vertex degree

A Dynamic Analysis of the Medium Tank Battalion. Volume I

DTIC Science & Technology

1978-06-01

best available copy. W. KEY WORDS (Cortinue an reverse oIde If necessary And Identifty block number) CONSTRUCTION; PLANNING; MANAGEMENT; MODELS...unit, with 64K, 8-bit bytes, (2) Dual-disk drive, 2 Discs at 262K, 8-bit bytes, (3) Cathode Ray Tube Console and Keyboard, (4) High- speed printer, (5

Automated Instructional Management Systems (AIMS) Version III, Operator's Guide.

ERIC Educational Resources Information Center

New York Inst. of Tech., Old Westbury.

This manual gives the instructions necessary to understand and operate the Automated Instructional Management System (AIMS), utilizing IBM System 360, Model 30/Release 20 Disk Operating System, and the OpScan 100 System Reader and Tape Unit. It covers the AIMS III system initialization, system and operational input, requirements, master response…

Runoff nutrient transport as affected by land application method, swine growth stage, and runoff rate

USDA-ARS?s Scientific Manuscript database

This study was conducted to measure the effects of slurry application method, swine growth stage, and flow rate on runoff nutrient transport. Swine slurry was obtained from production units containing grower pigs, finisher pigs, or sows and gilts. The swine slurry was applied using broadcast, disk, ...

GraphBench

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

Sukumar, Sreenivas R.; Hong, Seokyong; Lee, Sangkeun

2016-06-01

GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)

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

Miranda, Adelaide; De Beule, Pieter A. A., E-mail: pieter.de-beule@inl.int; Martins, Marco

Combined microscopy techniques offer the life science research community a powerful tool to investigate complex biological systems and their interactions. Here, we present a new combined microscopy platform based on fluorescence optical sectioning microscopy through aperture correlation microscopy with a Differential Spinning Disk (DSD) and nanomechanical mapping with an Atomic Force Microscope (AFM). The illumination scheme of the DSD microscope unit, contrary to standard single or multi-point confocal microscopes, provides a time-independent illumination of the AFM cantilever. This enables a distortion-free simultaneous operation of fluorescence optical sectioning microscopy and atomic force microscopy with standard probes. In this context, we discussmore » sample heating due to AFM cantilever illumination with fluorescence excitation light. Integration of a DSD fluorescence optical sectioning unit with an AFM platform requires mitigation of mechanical noise transfer of the spinning disk. We identify and present two solutions to almost annul this noise in the AFM measurement process. The new combined microscopy platform is applied to the characterization of a DOPC/DOPS (4:1) lipid structures labelled with a lipophilic cationic indocarbocyanine dye deposited on a mica substrate.« less

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

ERIC Educational Resources Information Center

Öçal, Mehmet Fatih

2017-01-01

Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students' learning during graphing functions. However, the display of graphs of functions that students sketched by hand may…

Generalized graph states based on Hadamard matrices

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

Cui, Shawn X.; Yu, Nengkun; Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1

2015-07-15

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study themore » entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.« less

Graph processing platforms at scale: practices and experiences

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

Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C

2015-01-01

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution,more » connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.« less

A fast algorithm for vertex-frequency representations of signals on graphs

PubMed Central

Jestrović, Iva; Coyle, James L.; Sejdić, Ervin

2016-01-01

The windowed Fourier transform (short time Fourier transform) and the S-transform are widely used signal processing tools for extracting frequency information from non-stationary signals. Previously, the windowed Fourier transform had been adopted for signals on graphs and has been shown to be very useful for extracting vertex-frequency information from graphs. However, high computational complexity makes these algorithms impractical. We sought to develop a fast windowed graph Fourier transform and a fast graph S-transform requiring significantly shorter computation time. The proposed schemes have been tested with synthetic test graph signals and real graph signals derived from electroencephalography recordings made during swallowing. The results showed that the proposed schemes provide significantly lower computation time in comparison with the standard windowed graph Fourier transform and the fast graph S-transform. Also, the results showed that noise has no effect on the results of the algorithm for the fast windowed graph Fourier transform or on the graph S-transform. Finally, we showed that graphs can be reconstructed from the vertex-frequency representations obtained with the proposed algorithms. PMID:28479645

Observations of A0535 + 26 with the SMM satellite

NASA Technical Reports Server (NTRS)

Sembay, S.; Schwartz, R. A.; Orwig, L. E.; Dennis, B. R.; Davies, S. R.

1990-01-01

An examination of archival data from the hard X-ray instruments on the Solar Maximum Mission (SMM) satellite has revealed a previously undetected outburst from the recurrent X-ray transient, A0535 + 26. The outburst occurred in June 1983 and reached a peak intensity of about 2 crab units in the energy range 32-91 keV. The outburst was detected over a span of 18 days, and the pulse period was observed to spin-up with an average rate of about -6 x 10 to the -8th s/s. A recently proposed model for A0535 + 26 has a pulsar powered by a short-lived accretion disk. A thin accretion disk model is fitted to the present data, assuming an orbital period of 111 days. Two solutions to the magnetic moment of the neutron star are derived. The slow rotator solution is more consistent with the model than the fast rotator, on the grounds that the conditions for the formation of an accretion disk are more favorable for a lower magnetic field strength.

The DiskMass Survey. VI. Gas and stellar kinematics in spiral galaxies from PPak integral-field spectroscopy

NASA Astrophysics Data System (ADS)

Martinsson, Thomas P. K.; Verheijen, Marc A. W.; Westfall, Kyle B.; Bershady, Matthew A.; Schechtman-Rook, Andrew; Andersen, David R.; Swaters, Rob A.

2013-09-01

We present ionized-gas ([Oiii]λ5007 Å) and stellar kinematics (velocities and velocity dispersions) for 30 nearly face-on spiral galaxies out to as many as three K-band disk scale lengths (hR). These data have been derived from PPak integral-field-unit spectroscopy from 4980-5370 Å observed at a mean resolution of λ/Δλ = 7700 (σinst = 17 km s-1). These data are a fundamental product of our survey and will be used in companion papers to, e.g., derive the detailed (baryonic+dark) mass budget of each galaxy in our sample. Our presentation provides a comprehensive description of the observing strategy and data reduction, including a robust measurement and removal of shift, scale, and rotation effects in the data due to instrumental flexure. Using an in-plane coordinate system determined by fitting circular-speed curves to our velocity fields, we derive azimuthally averaged rotation curves and line-of-sight velocity dispersion (σLOS) and luminosity profiles for both the stars and [Oiii]-emitting gas. Along with a clear presentation of the data, we demonstrate: (1) The [Oiii] and stellar rotation curves exhibit a clear signature of asymmetric drift with a rotation difference that is 11% of the maximum rotation speed of the galaxy disk, comparable to measurements in the solar neighborhood in the Milky Way. (2) The e-folding length of the stellar velocity dispersion (hσ) is 2hR on average, as expected for a disk with a constant scale height and mass-to-light ratio, with a scatter that is notably smaller for massive, high-surface-brightness disks in the most luminous galaxies. (3) At radii larger than 1.5hR, σLOS tends to decline slower than the best-fitting exponential function, which may be due to an increase in the disk mass-to-light ratio, disk flaring, or disk heating by the dark-matter halo. (4) A strong correlation exists between the central vertical stellar velocity dispersion of the disks (σz,0) and their circular rotational speed at 2.2hR (V2.2hROiii), with a zero point indicating that galaxy disks are submaximal. Moreover, weak but consistent correlations exist between σz,0/V2.2hROiii and global galaxy properties such that disks with a fainter central surface brightness in bluer and less luminous galaxies of later morphological types are kinematically colder with respect to their rotational velocities. Based on observations collected at the Centro Astronómico Hispano Alemán (CAHA) at Calar Alto, operated jointly by the Max-Planck Institut für Astronomie and the Instituto de Astrofísica de Andalucía (CSIC).Table 2 and Appendices are available in electronic form at http://www.aanda.org

From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems

NASA Astrophysics Data System (ADS)

Hamze, Firas; Jacob, Darryl C.; Ochoa, Andrew J.; Perera, Dilina; Wang, Wenlong; Katzgraber, Helmut G.

2018-04-01

We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model defined on a cubic lattice, where subproblems, whose couplers are restricted to the two values {-1 ,+1 } , are specified on unit cubes and are parametrized by their local degeneracy. The construction is shown to be equivalent to a type of three-dimensional constraint-satisfaction problem known as the tiling puzzle. By varying the proportions of subproblem types, the Hamiltonian can span a dramatic range of typical computational complexity, from fairly easy to many orders of magnitude more difficult than prototypical bimodal and Gaussian spin glasses in three space dimensions. We corroborate this behavior via experiments with different algorithms and discuss generalizations and extensions to different types of graphs.

Efficient parallel architecture for highly coupled real-time linear system applications

NASA Technical Reports Server (NTRS)

Carroll, Chester C.; Homaifar, Abdollah; Barua, Soumavo

1988-01-01

A systematic procedure is developed for exploiting the parallel constructs of computation in a highly coupled, linear system application. An overall top-down design approach is adopted. Differential equations governing the application under consideration are partitioned into subtasks on the basis of a data flow analysis. The interconnected task units constitute a task graph which has to be computed in every update interval. Multiprocessing concepts utilizing parallel integration algorithms are then applied for efficient task graph execution. A simple scheduling routine is developed to handle task allocation while in the multiprocessor mode. Results of simulation and scheduling are compared on the basis of standard performance indices. Processor timing diagrams are developed on the basis of program output accruing to an optimal set of processors. Basic architectural attributes for implementing the system are discussed together with suggestions for processing element design. Emphasis is placed on flexible architectures capable of accommodating widely varying application specifics.

Principles of cophylogenetic maps

NASA Astrophysics Data System (ADS)

Charleston, Michael A.

Cophylogeny is the study of the relationships between phylogenies of ecologically related groups (taxa, geographical areas, genes etc.), where one, the "host" phylogeny, is independent and the other, the "associate" phylogeny, is hypothesized to be dependent to some degree on the host. Given two such phylogenies our aim is to estimate the past associations between the host and associate taxa. This chapter describes cophylogeny and discusses some of its basic pri nciples. The necessary properties of any cophylogenetic method are described. Charleston [5] created a graph which contains all the potential solutions to a given cophylogenetic problem. The vertices of this graph are associations, either observed or hypothetical, between "host" and associated taxonomic units, and the arcs correspond to the associate phylogeny. A new and more general method of constructing the Jungle is presented, which will correctly account for reticulate host and/or parasite phylogenies. Keywords: cophylogeny, coevolution, gene tree/species tree, host/parasite coevolution, host switch, horizontal transfer, biogeography.

Cache-Aware Asymptotically-Optimal Sampling-Based Motion Planning

PubMed Central

Ichnowski, Jeffrey; Prins, Jan F.; Alterovitz, Ron

2014-01-01

We present CARRT* (Cache-Aware Rapidly Exploring Random Tree*), an asymptotically optimal sampling-based motion planner that significantly reduces motion planning computation time by effectively utilizing the cache memory hierarchy of modern central processing units (CPUs). CARRT* can account for the CPU’s cache size in a manner that keeps its working dataset in the cache. The motion planner progressively subdivides the robot’s configuration space into smaller regions as the number of configuration samples rises. By focusing configuration exploration in a region for periods of time, nearest neighbor searching is accelerated since the working dataset is small enough to fit in the cache. CARRT* also rewires the motion planning graph in a manner that complements the cache-aware subdivision strategy to more quickly refine the motion planning graph toward optimality. We demonstrate the performance benefit of our cache-aware motion planning approach for scenarios involving a point robot as well as the Rethink Robotics Baxter robot. PMID:25419474

Cache-Aware Asymptotically-Optimal Sampling-Based Motion Planning.

PubMed

Ichnowski, Jeffrey; Prins, Jan F; Alterovitz, Ron

2014-05-01

We present CARRT* (Cache-Aware Rapidly Exploring Random Tree*), an asymptotically optimal sampling-based motion planner that significantly reduces motion planning computation time by effectively utilizing the cache memory hierarchy of modern central processing units (CPUs). CARRT* can account for the CPU's cache size in a manner that keeps its working dataset in the cache. The motion planner progressively subdivides the robot's configuration space into smaller regions as the number of configuration samples rises. By focusing configuration exploration in a region for periods of time, nearest neighbor searching is accelerated since the working dataset is small enough to fit in the cache. CARRT* also rewires the motion planning graph in a manner that complements the cache-aware subdivision strategy to more quickly refine the motion planning graph toward optimality. We demonstrate the performance benefit of our cache-aware motion planning approach for scenarios involving a point robot as well as the Rethink Robotics Baxter robot.

X-Ray-induced Deuterium Enrichment of N-rich Organics in Protoplanetary Disks: An Experimental Investigation Using Synchrotron Light

NASA Astrophysics Data System (ADS)

Gavilan, Lisseth; Remusat, Laurent; Roskosz, Mathieu; Popescu, Horia; Jaouen, Nicolas; Sandt, Christophe; Jäger, Cornelia; Henning, Thomas; Simionovici, Alexandre; Lemaire, Jean Louis; Mangin, Denis; Carrasco, Nathalie

2017-05-01

The deuterium enrichment of organics in the interstellar medium, protoplanetary disks, and meteorites has been proposed to be the result of ionizing radiation. The goal of this study is to simulate and quantify the effects of soft X-rays (0.1-2 keV), an important component of stellar radiation fields illuminating protoplanetary disks, on the refractory organics present in the disks. We prepared tholins, nitrogen-rich organic analogs to solids found in several astrophysical environments, e.g., Titan’s atmosphere, cometary surfaces, and protoplanetary disks, via plasma deposition. Controlled irradiation experiments with soft X-rays at 0.5 and 1.3 keV were performed at the SEXTANTS beamline of the SOLEIL synchrotron, and were immediately followed by ex-situ infrared, Raman, and isotopic diagnostics. Infrared spectroscopy revealed the preferential loss of singly bonded groups (N-H, C-H, and R-N≡C) and the formation of sp3 carbon defects with signatures at ˜1250-1300 cm-1. Raman analysis revealed that, while the length of polyaromatic units is only slightly modified, the introduction of defects leads to structural amorphization. Finally, tholins were measured via secondary ion mass spectrometry to quantify the D, H, and C elemental abundances in the irradiated versus non-irradiated areas. Isotopic analysis revealed that significant D-enrichment is induced by X-ray irradiation. Our results are compared to previous experimental studies involving the thermal degradation and electron irradiation of organics. The penetration depth of soft X-rays in μm-sized tholins leads to volume rather than surface modifications: lower-energy X-rays (0.5 keV) induce a larger D-enrichment than 1.3 keV X-rays, reaching a plateau for doses larger than 5 × 1027 eV cm-3. Synchrotron fluences fall within the expected soft X-ray fluences in protoplanetary disks, and thus provide evidence of a new non-thermal pathway to deuterium fractionation of organic matter.

Falling Outer Rotation Curves of Star-forming Galaxies at 0.6 ≲ z ≲ 2.6 Probed with KMOS3D and SINS/zC-SINF

NASA Astrophysics Data System (ADS)

Lang, Philipp; Förster Schreiber, Natascha M.; Genzel, Reinhard; Wuyts, Stijn; Wisnioski, Emily; Beifiori, Alessandra; Belli, Sirio; Bender, Ralf; Brammer, Gabe; Burkert, Andreas; Chan, Jeffrey; Davies, Ric; Fossati, Matteo; Galametz, Audrey; Kulkarni, Sandesh K.; Lutz, Dieter; Mendel, J. Trevor; Momcheva, Ivelina G.; Naab, Thorsten; Nelson, Erica J.; Saglia, Roberto P.; Seitz, Stella; Tacchella, Sandro; Tacconi, Linda J.; Tadaki, Ken-ichi; Übler, Hannah; van Dokkum, Pieter G.; Wilman, David J.

2017-05-01

We exploit the deep, resolved, Hα kinematic data from the KMOS3D and SINS/zC-SINF surveys to examine the largely unexplored outer-disk kinematics of star-forming galaxies (SFGs), out to the peak of cosmic star formation. Our sample contains 101 SFGs, representative of the more massive (9.3≲ {log}{M}* /{M}⊙ ≲ 11.5) main sequence population at 0.6 ≤ z ≤ 2.6. Through a novel stacking approach, we are able to constrain a representative rotation curve extending out to ˜4 effective radii. This average rotation curve exhibits a significant drop in rotation velocity beyond the turnover, with a slope of {{Δ }}V/{{Δ }}R=-{0.26}-0.09+0.10 in units of normalized coordinates V/V max and R/R turn. This result confirms that the fall-off seen in some individual galaxies is a common feature of our sample of high-z disks. The outer fall-off strikingly deviates from the flat or mildly rising rotation curves of local spiral galaxies that have similar masses. Through a comparison with models that include baryons and dark matter, we demonstrate that the falling stacked rotation curve is consistent with a high mass fraction of baryons, relative to the total dark matter halo (m d ≳ 0.05), in combination with a sizeable level of pressure support in the outer disk. These findings agree with recent studies demonstrating that high-z star-forming disks are strongly baryon-dominated within the disk scale, and furthermore suggest that pressure gradients caused by large, turbulent gas motions are present even in their outer disks. These results are largely independent of our model assumptions, such as the presence of stellar bulges, the effect of adiabatic contraction, and variations in halo concentration.

Galactic Disk Winds Driven by Cosmic Ray Pressure

NASA Astrophysics Data System (ADS)

Mao, S. Alwin; Ostriker, Eve C.

2018-02-01

Cosmic ray pressure gradients transfer energy and momentum to extraplanar gas in disk galaxies, potentially driving significant mass loss as galactic winds. This may be particularly important for launching high-velocity outflows of “cool” (T ≲ 104 K) gas. We study cosmic ray-driven disk winds using a simplified semi-analytic model assuming streamlines follow the large-scale gravitational potential gradient. We consider scaled Milky Way–like potentials including a disk, bulge, and halo with a range of halo velocities V H = 50–300 km s-1 and streamline footpoints with radii in the disk R 0 = 1–16 kpc at a height of 1 kpc. Our solutions cover a wide range of footpoint gas velocity u 0, magnetic–to–cosmic ray pressure ratio, gas–to–cosmic ray pressure ratio, and angular momentum. Cosmic ray streaming at the Alfvén speed enables the effective sound speed C eff to increase from the footpoint to a critical point where C eff,c = u c ∼ V H; this differs from thermal winds, in which C eff decreases outward. The critical point is typically at a height of 1–6 kpc from the disk, increasing with V H, and the asymptotic wind velocity exceeds the escape speed of the halo. Mass-loss rates are insensitive to the footpoint values of the magnetic field and angular momentum. In addition to numerical parameter space exploration, we develop and compare to analytic scaling relations. We show that winds have mass-loss rates per unit area up to \\dot{Σ}∼ Π0VH-5/3u02/3, where Π0 is the footpoint cosmic ray pressure and u 0 is set by the upwelling of galactic fountains. The predicted wind mass-loss rate exceeds the star formation rate for V H ≲ 200 km s-1 and u 0 = 50 km s-1, a typical fountain velocity.

Novel presentational approaches were developed for reporting network meta-analysis.

PubMed

Tan, Sze Huey; Cooper, Nicola J; Bujkiewicz, Sylwia; Welton, Nicky J; Caldwell, Deborah M; Sutton, Alexander J

2014-06-01

To present graphical tools for reporting network meta-analysis (NMA) results aiming to increase the accessibility, transparency, interpretability, and acceptability of NMA analyses. The key components of NMA results were identified based on recommendations by agencies such as the National Institute for Health and Care Excellence (United Kingdom). Three novel graphs were designed to amalgamate the identified components using familiar graphical tools such as the bar, line, or pie charts and adhering to good graphical design principles. Three key components for presentation of NMA results were identified, namely relative effects and their uncertainty, probability of an intervention being best, and between-study heterogeneity. Two of the three graphs developed present results (for each pairwise comparison of interventions in the network) obtained from both NMA and standard pairwise meta-analysis for easy comparison. They also include options to display the probability best, ranking statistics, heterogeneity, and prediction intervals. The third graph presents rankings of interventions in terms of their effectiveness to enable clinicians to easily identify "top-ranking" interventions. The graphical tools presented can display results tailored to the research question of interest, and targeted at a whole spectrum of users from the technical analyst to the nontechnical clinician. Copyright © 2014 Elsevier Inc. All rights reserved.

Graph 500 on OpenSHMEM: Using a Practical Survey of Past Work to Motivate Novel Algorithmic Developments

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

Grossman, Max; Pritchard Jr., Howard Porter; Budimlic, Zoran

2016-12-22

Graph500 [14] is an effort to offer a standardized benchmark across large-scale distributed platforms which captures the behavior of common communicationbound graph algorithms. Graph500 differs from other large-scale benchmarking efforts (such as HPL [6] or HPGMG [7]) primarily in the irregularity of its computation and data access patterns. The core computational kernel of Graph500 is a breadth-first search (BFS) implemented on an undirected graph. The output of Graph500 is a spanning tree of the input graph, usually represented by a predecessor mapping for every node in the graph. The Graph500 benchmark defines several pre-defined input sizes for implementers to testmore » against. This report summarizes investigation into implementing the Graph500 benchmark on OpenSHMEM, and focuses on first building a strong and practical understanding of the strengths and limitations of past work before proposing and developing novel extensions.« less

Graphing trillions of triangles.

PubMed

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

Multiple graph regularized protein domain ranking.

PubMed

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Evolutionary graph theory: breaking the symmetry between interaction and replacement

PubMed Central

Ohtsuki, Hisashi; Pacheco, Jorge M.; Nowak, Martin A.

2008-01-01

We study evolutionary dynamics in a population whose structure is given by two graphs: the interaction graph determines who plays with whom in an evolutionary game; the replacement graph specifies the geometry of evolutionary competition and updating. First, we calculate the fixation probabilities of frequency dependent selection between two strategies or phenotypes. We consider three different update mechanisms: birth-death, death-birth and imitation. Then, as a particular example, we explore the evolution of cooperation. Suppose the interaction graph is a regular graph of degree h, the replacement graph is a regular graph of degree g and the overlap between the two graphs is a regular graph of degree l. We show that cooperation is favored by natural selection if b/c > hg/l. Here, b and c denote the benefit and cost of the altruistic act. This result holds for death-birth updating, weak selection and large population size. Note that the optimum population structure for cooperators is given by maximum overlap between the interaction and the replacement graph (g = h = l), which means that the two graphs are identical. We also prove that a modified replicator equation can describe how the expected values of the frequencies of an arbitrary number of strategies change on replacement and interaction graphs: the two graphs induce a transformation of the payoff matrix. PMID:17350049

Multiple graph regularized protein domain ranking

PubMed Central

2012-01-01

Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331

A Low Mass for Mars from Jupiter's Early Gas-Driven Migration

NASA Technical Reports Server (NTRS)

Walsh, Kevin J.; Morbidelli, Alessandro; Raymond, Sean N.; O'Brien, David P.; Mandell, Avi M.

2011-01-01

Jupiter and Saturn formed in a few million years from a gas-dominated protoplanetary disk, and were susceptible to gas-driven migration of their orbits on timescales of only approximately 100,000 years. Hydrodynamic simulations show that these giant planets can undergo a two-stage, inward-then-outward, migration. The terrestrial planets finished accreting much later and their characteristics, including Mars' small mass, are best reproduced by starting from a planetesimal disk with an outer edge at about one astronomical unit from the Sun (1 AU is the Earth-Sun distance). Here we report simulations of the early Solar System that show how the inward migration of Jupiter to 1.5 AU, and its subsequent outward migration, lead to a planetesimal disk truncated at 1 AU; the terrestrial planets then form from this disk over the next 30-50 million years, with an Earth/Mars mass ratio consistent with observations. Scattering by Jupiter initially empties but then repopulates the asteroid belt, with inner-belt bodies originating between 1 and 3 AU and outer-belt bodies originating between and beyond the giant planets. This explains the significant compositional differences across the asteroid belt. The key aspect missing from previous models of terrestrial planet formation is the substantial radial migration of the giant planets, which suggests that their behaviour is more similar to that inferred for extrasolar planets than previously thought.

Science packages

NASA Astrophysics Data System (ADS)

1997-01-01

Primary science teachers in Scotland have a new updating method at their disposal with the launch of a package of CDi (Compact Discs Interactive) materials developed by the BBC and the Scottish Office. These were a response to the claim that many primary teachers felt they had been inadequately trained in science and lacked the confidence to teach it properly. Consequently they felt the need for more in-service training to equip them with the personal understanding required. The pack contains five disks and a printed user's guide divided up as follows: disk 1 Investigations; disk 2 Developing understanding; disks 3,4,5 Primary Science staff development videos. It was produced by the Scottish Interactive Technology Centre (Moray House Institute) and is available from BBC Education at £149.99 including VAT. Free Internet distribution of science education materials has also begun as part of the Global Schoolhouse (GSH) scheme. The US National Science Teachers' Association (NSTA) and Microsoft Corporation are making available field-tested comprehensive curriculum material including 'Micro-units' on more than 80 topics in biology, chemistry, earth and space science and physics. The latter are the work of the Scope, Sequence and Coordination of High School Science project, which can be found at http://www.gsh.org/NSTA_SSandC/. More information on NSTA can be obtained from its Web site at http://www.nsta.org.

Alternative Fuels Data Center: Maps and Data

Science.gov Websites

fleet type from 1992-2014 Last update August 2016 View Graph Graph Download Data Generated_thumb20160830 Trend of S&FP AFV acquisitions by fuel type from 1992-2015 Last update August 2016 View Graph Graph transactions from 1997-2014 Last update August 2016 View Graph Graph Download Data Biofuelsatlas BioFuels Atlas

GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems

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

Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen

2015-09-30

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the hostmore » and the device.« less

SING: Subgraph search In Non-homogeneous Graphs

PubMed Central

2010-01-01

Background Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed up the process. Such systems filter out those graphs which cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph. The applicability of such systems is limited to databases of small graphs, because their filtering power degrades on large graphs. Results In this paper, SING (Subgraph search In Non-homogeneous Graphs), a novel indexing system able to cope with large graphs, is presented. The method uses the notion of feature, which can be a small subgraph, subtree or path. Each graph in the database is annotated with the set of all its features. The key point is to make use of feature locality information. This idea is used to both improve the filtering performance and speed up the subgraph isomorphism task. Conclusions Extensive tests on chemical compounds, biological networks and synthetic graphs show that the proposed system outperforms the most popular systems in query time over databases of medium and large graphs. Other specific tests show that the proposed system is effective for single large graphs. PMID:20170516

First astronomical unit scale image of the GW Orionis triple system. Direct detection of a new stellar companion

NASA Astrophysics Data System (ADS)

Berger, J.-P.; Monnier, J. D.; Millan-Gabet, R.; Renard, S.; Pedretti, E.; Traub, W.; Bechet, C.; Benisty, M.; Carleton, N.; Haguenauer, P.; Kern, P.; Labeye, P.; Longa, F.; Lacasse, M.; Malbet, F.; Perraut, K.; Ragland, S.; Schloerb, P.; Schuller, P. A.; Thiébaut, E.

2011-05-01

Context. Young and close multiple systems are unique laboratories to probe the initial dynamical interactions between forming stellar systems and their dust and gas environment. Their study is a key building block to understanding the high frequency of main-sequence multiple systems. However, the number of detected spectroscopic young multiple systems that allow dynamical studies is limited. GW Orionis is one such system. It is one of the brightest young T Tauri stars and is surrounded by a massive disk. Aims: Our goal is to probe the GW Orionis multiplicity at angular scales at which we can spatially resolve the orbit. Methods: We used the IOTA/IONIC3 interferometer to probe the environment of GW Orionis with an astronomical unit resolution in 2003, 2004, and 2005. By measuring squared visibilities and closure phases with a good UV coverage we carry out the first image reconstruction of GW Ori from infrared long-baseline interferometry. Results.We obtained the first infrared image of a T Tauri multiple system with astronomical unit resolution. We show that GW Orionis is a triple system, resolve for the first time the previously known inner pair (separation ρ ~ 1.4 AU) and reveal a new more distant component (GW Ori C) with a projected separation of ~ 8 AU with direct evidence of motion. Furthermore, the nearly equal (2:1) H-band flux ratio of the inner components suggests that either GW Ori B is undergoing a preferential accretion event that increases its disk luminosity or that the estimate of the masses has to be revisited in favour of a more equal mass-ratio system that is seen at lower inclination. Conclusions: Accretion disk models of GW Ori will need to be completely reconsidered because of this outer companion C and the unexpected brightness of companion B.

GrouseFlocks: steerable exploration of graph hierarchy space.

PubMed

Archambault, Daniel; Munzner, Tamara; Auber, David

2008-01-01

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges, which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.

Spectral partitioning in equitable graphs.

PubMed

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Spectral partitioning in equitable graphs

NASA Astrophysics Data System (ADS)

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Well-Covered Graphs: A Survey

DTIC Science & Technology

1991-01-01

critical G’s/# G’s -) 0 as IV(G)I -- oo? References [B1] C. Berge, Regularizable graphs, Ann. Discrete Math ., 3, 1978, 11-19. [B2] _ _, Some common...Springer-Verlag, Berlin, 1980, 108-123. [B3] _ _, Some common properties for regularizable graphs, edge-critical graphs, and B-graphs, Ann. Discrete Math ., 12...graphs - an extension of the K6nig-Egervgiry theorem, Discrete Math ., 27, 1979, 23-33. [ER] M.N Ellingham and G.F. Royle, Well-covered cubic graphs

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

NASA Astrophysics Data System (ADS)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

GBS 1.0

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

2010-09-30

The Umbra gbs (Graph-Based Search) library provides implementations of graph-based search/planning algorithms that can be applied to legacy graph data structures. Unlike some other graph algorithm libraries, this one does not require your graph class to inherit from a specific base class. Implementations of Dijkstra's Algorithm and A-Star search are included and can be used with graphs that are lazily-constructed.

Information visualisation based on graph models

NASA Astrophysics Data System (ADS)

Kasyanov, V. N.; Kasyanova, E. V.

2013-05-01

Information visualisation is a key component of support tools for many applications in science and engineering. A graph is an abstract structure that is widely used to model information for its visualisation. In this paper, we consider practical and general graph formalism called hierarchical graphs and present the Higres and Visual Graph systems aimed at supporting information visualisation on the base of hierarchical graph models.

Polysemy in the Domain-Specific Pedagogical Use of Graphs in Science Textbooks: The Case of an Electrocardiogram

ERIC Educational Resources Information Center

van Eijck, Michiel; Goedhart, Martin J.; Ellermeijer, Ton

2011-01-01

Polysemy in graph-related practices is the phenomenon that a single graph can sustain different meanings assigned to it. Considerable research has been done on polysemy in graph-related practices in school science in which graphs are rather used as scientific tools. However, graphs in science textbooks are also used rather pedagogically to…

Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra

NASA Astrophysics Data System (ADS)

Grigorchuk, R.; Leemann, P.-H.; Nagnibeda, T.

2016-05-01

We study the infinite family of spider-web graphs \\{{{ S }}k,N,M\\}, k≥slant 2, N≥slant 0 and M≥slant 1, initiated in the 50s in the context of network theory. It was later shown in physical literature that these graphs have remarkable percolation and spectral properties. We provide a mathematical explanation of these properties by putting the spider-web graphs in the context of group theory and algebraic graph theory. Namely, we realize them as tensor products of the well-known de Bruijn graphs \\{{{ B }}k,N\\} with cyclic graphs \\{{C}M\\} and show that these graphs are described by the action of the lamplighter group {{ L }}k={Z}/k{Z}\\wr {Z} on the infinite binary tree. Our main result is the identification of the infinite limit of \\{{{ S }}k,N,M\\}, as N,M\\to ∞ , with the Cayley graph of the lamplighter group {{ L }}k which, in turn, is one of the famous Diestel-Leader graphs {{DL}}k,k. As an application we compute the spectra of all spider-web graphs and show their convergence to the discrete spectral distribution associated with the Laplacian on the lamplighter group.

New methods for analyzing semantic graph based assessments in science education

NASA Astrophysics Data System (ADS)

Vikaros, Lance Steven

This research investigated how the scoring of semantic graphs (known by many as concept maps) could be improved and automated in order to address issues of inter-rater reliability and scalability. As part of the NSF funded SENSE-IT project to introduce secondary school science students to sensor networks (NSF Grant No. 0833440), semantic graphs illustrating how temperature change affects water ecology were collected from 221 students across 16 schools. The graphing task did not constrain students' use of terms, as is often done with semantic graph based assessment due to coding and scoring concerns. The graphing software used provided real-time feedback to help students learn how to construct graphs, stay on topic and effectively communicate ideas. The collected graphs were scored by human raters using assessment methods expected to boost reliability, which included adaptations of traditional holistic and propositional scoring methods, use of expert raters, topical rubrics, and criterion graphs. High levels of inter-rater reliability were achieved, demonstrating that vocabulary constraints may not be necessary after all. To investigate a new approach to automating the scoring of graphs, thirty-two different graph features characterizing graphs' structure, semantics, configuration and process of construction were then used to predict human raters' scoring of graphs in order to identify feature patterns correlated to raters' evaluations of graphs' topical accuracy and complexity. Results led to the development of a regression model able to predict raters' scoring with 77% accuracy, with 46% accuracy expected when used to score new sets of graphs, as estimated via cross-validation tests. Although such performance is comparable to other graph and essay based scoring systems, cross-context testing of the model and methods used to develop it would be needed before it could be recommended for widespread use. Still, the findings suggest techniques for improving the reliability and scalability of semantic graph based assessments without requiring constraint of how ideas are expressed.

Biometric Subject Verification Based on Electrocardiographic Signals

NASA Technical Reports Server (NTRS)

Dusan, Sorin V. (Inventor); Jorgensen, Charles C. (Inventor)

2014-01-01

A method of authenticating or declining to authenticate an asserted identity of a candidate-person. In an enrollment phase, a reference PQRST heart action graph is provided or constructed from information obtained from a plurality of graphs that resemble each other for a known reference person, using a first graph comparison metric. In a verification phase, a candidate-person asserts his/her identity and presents a plurality of his/her heart cycle graphs. If a sufficient number of the candidate-person's measured graphs resemble each other, a representative composite graph is constructed from the candidate-person's graphs and is compared with a composite reference graph, for the person whose identity is asserted, using a second graph comparison metric. When the second metric value lies in a selected range, the candidate-person's assertion of identity is accepted.

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

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

Sengupta, Dipanjan; Song, Shuaiwen

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirablemore » and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.« less

Genome alignment with graph data structures: a comparison

PubMed Central

2014-01-01

Background Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference. Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment. Results We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures. Conclusion We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools. PMID:24712884

Efficient dynamic graph construction for inductive semi-supervised learning.

PubMed

Dornaika, F; Dahbi, R; Bosaghzadeh, A; Ruichek, Y

2017-10-01

Most of graph construction techniques assume a transductive setting in which the whole data collection is available at construction time. Addressing graph construction for inductive setting, in which data are coming sequentially, has received much less attention. For inductive settings, constructing the graph from scratch can be very time consuming. This paper introduces a generic framework that is able to make any graph construction method incremental. This framework yields an efficient and dynamic graph construction method that adds new samples (labeled or unlabeled) to a previously constructed graph. As a case study, we use the recently proposed Two Phase Weighted Regularized Least Square (TPWRLS) graph construction method. The paper has two main contributions. First, we use the TPWRLS coding scheme to represent new sample(s) with respect to an existing database. The representative coefficients are then used to update the graph affinity matrix. The proposed method not only appends the new samples to the graph but also updates the whole graph structure by discovering which nodes are affected by the introduction of new samples and by updating their edge weights. The second contribution of the article is the application of the proposed framework to the problem of graph-based label propagation using multiple observations for vision-based recognition tasks. Experiments on several image databases show that, without any significant loss in the accuracy of the final classification, the proposed dynamic graph construction is more efficient than the batch graph construction. Copyright © 2017 Elsevier Ltd. All rights reserved.

JavaGenes: Evolving Graphs with Crossover

NASA Technical Reports Server (NTRS)

Globus, Al; Atsatt, Sean; Lawton, John; Wipke, Todd

2000-01-01

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Chemical Applications of Graph Theory: Part II. Isomer Enumeration.

ERIC Educational Resources Information Center

Hansen, Peter J.; Jurs, Peter C.

1988-01-01

Discusses the use of graph theory to aid in the depiction of organic molecular structures. Gives a historical perspective of graph theory and explains graph theory terminology with organic examples. Lists applications of graph theory to current research projects. (ML)

More on accreting black hole spacetime in equatorial plane

NASA Astrophysics Data System (ADS)

Salahshoor, K.; Nozari, K.; Khesali, A. R.

2017-02-01

Spacetime around an accreting black hole is an interesting issue to study. The metric of an isolated black hole (rotating or non-rotating) spacetime has been well-known for decades. Although metrics of some spacetimes containing accreting black holes are known in some situations, the issue has some faces that are not well-known yet and need further investigation. In this paper, we construct a new form of metric which the effect of accretion disk on black hole spacetime is taken into account in the equatorial plane. We study motion and trajectories of massive particles and also photons falling from infinity towards black hole in equatorial plane around the black hole. We use an exponential form for the density profile of the accretion disk in equatorial plane as ρ =ρ0e^{-α r}. We show that with this density profile, the disk is radially stable if α ≤ 3 × 10^{-3} (in units of length inverse). In order to study some important quantities related to the accretion disks such as locations of marginally stable circular orbits (r_{ms} or r_{ISCO}), marginally bounded circular orbits (r_{mb}), and also photon orbits in equatorial plane, we use the effective potential approach. We show that in this spacetime metric the innermost stable circular orbit in equatorial plane is given by r_{ISCO}=4.03 μ (where μ =MG/c 2) which is different, but comparable, with the Schwarzschild spacetime result, r^{(Sch)}_{ISCO}=6 μ . We show that the maximum radiation efficiency of the accretion disk, η , in equatorial plane is 8.6 percent which is greater than the corresponding value for Schwarzschild spacetime. Finally, we show that in this setup photons can have stable circular orbits in equatorial plane unlike the Schwarzschild spacetime.

High angular resolution N-band observation of the silicate carbon star IRAS08002-3803 with the VLTI/MIDI instrument . Dusty environment spatially resolved

NASA Astrophysics Data System (ADS)

Ohnaka, K.; Driebe, T.; Hofmann, K.-H.; Leinert, Ch.; Morel, S.; Paresce, F.; Preibisch, Th.; Richichi, A.; Schertl, D.; Schöller, M.; Waters, L. B. F. M.; Weigelt, G.; Wittkowski, M.

2006-01-01

We present the results of N-band spectro-interferometric observations of the silicate carbon star IRAS08002-3803 with the MID-infrared Interferometric instrument (MIDI) at the Very Large Telescope Interferometer (VLTI) of the European Southern Observatory (ESO). The observations were carried out using two unit telescopes (UT2 and UT3) with projected baseline lengths ranging from 39 to 47 m. Our observations of IRAS08002-3803 have spatially resolved the dusty environment of a silicate carbon star for the first time and revealed an unexpected wavelength dependence of the angular size in the N band: the uniform-disk diameter is found to be constant and 36 mas (72 Rstar) between 8 and 10 μm, while it steeply increases longward of 10 μm to reach 53 mas (106 Rstar) at 13 μm. Model calculations with our Monte Carlo radiative transfer code show that neither spherical shell models nor axisymmetric disk models consisting of silicate grains alone can simultaneously explain the observed wavelength dependence of the visibility and the spectral energy distribution (SED). We propose that the circumstellar environment of IRAS08002-3803 may consist of two grain species coexisting in the disk: silicate and a second grain species, for which we consider amorphous carbon, large silicate grains, and metallic iron grains. Comparison of the observed visibilities and SED with our models shows that such disk models can fairly - though not entirely satisfactorily - reproduce the observed SED and N-band visibilities. Our MIDI observations and the radiative transfer calculations lend support to the picture where oxygen-rich material around IRAS08002-3803 is stored in a circumbinary disk surrounding the carbon-rich primary star and its putative low-luminosity companion.

Optimal Mass Transport for Shape Matching and Comparison

PubMed Central

Su, Zhengyu; Wang, Yalin; Shi, Rui; Zeng, Wei; Sun, Jian; Luo, Feng; Gu, Xianfeng

2015-01-01

Surface based 3D shape analysis plays a fundamental role in computer vision and medical imaging. This work proposes to use optimal mass transport map for shape matching and comparison, focusing on two important applications including surface registration and shape space. The computation of the optimal mass transport map is based on Monge-Brenier theory, in comparison to the conventional method based on Monge-Kantorovich theory, this method significantly improves the efficiency by reducing computational complexity from O(n2) to O(n). For surface registration problem, one commonly used approach is to use conformal map to convert the shapes into some canonical space. Although conformal mappings have small angle distortions, they may introduce large area distortions which are likely to cause numerical instability thus resulting failures of shape analysis. This work proposes to compose the conformal map with the optimal mass transport map to get the unique area-preserving map, which is intrinsic to the Riemannian metric, unique, and diffeomorphic. For shape space study, this work introduces a novel Riemannian framework, Conformal Wasserstein Shape Space, by combing conformal geometry and optimal mass transport theory. In our work, all metric surfaces with the disk topology are mapped to the unit planar disk by a conformal mapping, which pushes the area element on the surface to a probability measure on the disk. The optimal mass transport provides a map from the shape space of all topological disks with metrics to the Wasserstein space of the disk and the pullback Wasserstein metric equips the shape space with a Riemannian metric. We validate our work by numerous experiments and comparisons with prior approaches and the experimental results demonstrate the efficiency and efficacy of our proposed approach. PMID:26440265

Graphing trillions of triangles

PubMed Central

Burkhardt, Paul

2016-01-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed. PMID:28690426

Exploring Text and Icon Graph Interpretation in Students with Dyslexia: An Eye-tracking Study.

PubMed

Kim, Sunjung; Wiseheart, Rebecca

2017-02-01

A growing body of research suggests that individuals with dyslexia struggle to use graphs efficiently. Given the persistence of orthographic processing deficits in dyslexia, this study tested whether graph interpretation deficits in dyslexia are directly related to difficulties processing the orthographic components of graphs (i.e. axes and legend labels). Participants were 80 college students with and without dyslexia. Response times and eye movements were recorded as students answered comprehension questions about simple data displayed in bar graphs. Axes and legends were labelled either with words (mixed-modality graphs) or icons (orthography-free graphs). Students also answered informationally equivalent questions presented in sentences (orthography-only condition). Response times were slower in the dyslexic group only for processing sentences. However, eye tracking data revealed group differences for processing mixed-modality graphs, whereas no group differences were found for the orthography-free graphs. When processing bar graphs, students with dyslexia differ from their able reading peers only when graphs contain orthographic features. Implications for processing informational text are discussed. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

A linked GeoData map for enabling information access

USGS Publications Warehouse

Powell, Logan J.; Varanka, Dalia E.

2018-01-10

OverviewThe Geospatial Semantic Web (GSW) is an emerging technology that uses the Internet for more effective knowledge engineering and information extraction. Among the aims of the GSW are to structure the semantic specifications of data to reduce ambiguity and to link those data more efficiently. The data are stored as triples, the basic data unit in graph databases, which are similar to the vector data model of geographic information systems (GIS); that is, a node-edge-node model that forms a graph of semantically related information. The GSW is supported by emerging technologies such as linked geospatial data, described below, that enable it to store and manage geographical data that require new cartographic methods for visualization. This report describes a map that can interact with linked geospatial data using a simulation of a data query approach called the browsable graph to find information that is semantically related to a subject of interest, visualized using the Data Driven Documents (D3) library. Such a semantically enabled map functions as a map knowledge base (MKB) (Varanka and Usery, 2017).A MKB differs from a database in an important way. The central element of a triple, alternatively called the edge or property, is composed of a logic formalization that structures the relation between the first and third parts, the nodes or objects. Node-edge-node represents the graphic form of the triple, and the subject-property-object terms represent the data structure. Object classes connect to build a federated graph, similar to a network in visual form. Because the triple property is a logical statement (a predicate), the data graph represents logical propositions or assertions accepted to be true about the subject matter. These logical formalizations can be manipulated to calculate new triples, representing inferred logical assertions, from the existing data.To demonstrate a MKB system, a technical proof-of-concept is developed that uses geographically attributed Resource Description Framework (RDF) serializations of linked data for mapping. The proof-of-concept focuses on accessing triple data from visual elements of a geographic map as the interface to the MKB. The map interface is embedded with other essential functions such as SPARQL Protocol and RDF Query Language (SPARQL) data query endpoint services and reasoning capabilities of Apache Marmotta (Apache Software Foundation, 2017). An RDF database of the Geographic Names Information System (GNIS), which contains official names of domestic feature in the United States, was linked to a county data layer from The National Map of the U.S. Geological Survey. The county data are part of a broader Government Units theme offered to the public as Esri shapefiles. The shapefile used to draw the map itself was converted to a geographic-oriented JavaScript Object Notation (JSON) (GeoJSON) format and linked through various properties with a linked geodata version of the GNIS database called “GNIS–LD” (Butler and others, 2016; B. Regalia and others, University of California-Santa Barbara, written commun., 2017). The GNIS–LD files originated in Terse RDF Triple Language (Turtle) format but were converted to a JSON format specialized in linked data, “JSON–LD” (Beckett and Berners-Lee, 2011; Sorny and others, 2014). The GNIS–LD database is composed of roughly three predominant triple data graphs: Features, Names, and History. The graphs include a set of namespace prefixes used by each of the attributes. Predefining the prefixes made the conversion to the JSON–LD format simple to complete because Turtle and JSON–LD are variant specifications of the basic RDF concept.To convert a shapefile into GeoJSON format to capture the geospatial coordinate geometry objects, an online converter, Mapshaper, was used (Bloch, 2013). To convert the Turtle files, a custom converter written in Java reconstructs the files by parsing each grouping of attributes belonging to one subject and pasting the data into a new file that follows the syntax of JSON–LD. Additionally, the Features file contained its own set of geometries, which was exported into a separate JSON–LD file along with its elevation value to form a fourth file, named “features-geo.json.” Extracted data from external files can be represented in HyperText Markup Language (HTML) path objects. The goal was to import multiple JSON–LD files using this approach.

Learning about Science Graphs and Word Games. Superific Science Book V. A Good Apple Science Activity Book for Grades 5-8+.

ERIC Educational Resources Information Center

Conway, Lorraine

This packet of student materials contains a variety of worksheet activities dealing with science graphs and science word games. These reproducible materials deal with: (1) bar graphs; (2) line graphs; (3) circle graphs; (4) pictographs; (5) histograms; (6) artgraphs; (7) designing your own graphs; (8) medical prefixes; (9) color prefixes; (10)…

The Role of Concurrent Engineering in Weapons System Acquisition

DTIC Science & Technology

1988-12-01

checx sheets, Pareto diagrams, graphs, control charts, and scatter diagrams. Kaoru Iskilkawa, Guide to Qualiy Conmi, Asian Productivity Organization...Dewing [3 !,Juran [141, and Ishikawa [l𔃿). Managers in the United States and Japan have used techniques of statistics to measure performance and they have...New York (1962). 15. Kaoru Ishkawa, Guide to Quall’y Control, KRAUS International Publications, White Plains, NY (1-982). 16. Robert H. Hayc,%. St

Misfortunes of War. Press and Public Reactions to Civilian Deaths in Wartime

DTIC Science & Technology

2006-01-01

Although declines in reporting were evident even before the incident, the shootings at Columbine High School in Littleton, Colorado, on April 20...RAND mono- graphs undergo rigorous peer review to ensure high standards for research quality and objectivity. Prepared for the United States Air Force...189 5.13. High -Altitude Diagram Used by MG McChrystal. . . . . . . . . . . . 193 5.14. Reporting on Civilian Casualties, Marketplace Incident

A Portable Burn Pan for the Disposal of Excess Propellants

DTIC Science & Technology

2016-06-01

of Vegetation in Vacinity of Burn Pan Caused by Radiant Heat ............... 32 Figure 12. Wet Propellant (120 kg) and Dry Propellant (460 kg) Burn...35 Figure 14. Graph of Component Temperatures During an HUTS Burn Pan Test ........................ 37 Figure 15. IR Camera Thermal...detector HUTS Howitzer Unit Training System burn pan IR Infrared JBER Joint Base Elmendorf Richardson (AK) Kg Kilogram m meter mg/kg milligram

Force-Balance Dynamic Display

NASA Technical Reports Server (NTRS)

Ferris, Alice T.; White, William C.

1988-01-01

Balance dynamic display unit (BDDU) is compact system conditioning six dynamic analog signals so they are monitored simultaneously in real time on single-trace oscilloscope. Typical BDDU oscilloscope display in scan mode shows each channel occupying one-sixth of total trace. System features two display modes usable with conventional, single-channel oscilloscope: multiplexed six-channel "bar-graph" format and single-channel display. Two-stage visual and audible limit alarm provided for each channel.

Applications of Graph-Theoretic Tests to Online Change Detection

DTIC Science & Technology

2014-05-09

NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION REPORT ...assessment, crime investigation, and environmental field analysis. Our work offers a new tool for change detection that can be employed in real- time in very...this paper such MSTs and bipartite matchings. Ruth (2009) reports run times for MNBM ensembles created using Derigs’ (1998) algorithm on the order of

TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

PubMed

Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

2016-01-01

We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

Graphing Polar Curves

ERIC Educational Resources Information Center

Lawes, Jonathan F.

2013-01-01

Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…

Graph-theoretic quantum system modelling for neuronal microtubules as hierarchical clustered quantum Hopfield networks

NASA Astrophysics Data System (ADS)

Srivastava, D. P.; Sahni, V.; Satsangi, P. S.

2014-08-01

Graph-theoretic quantum system modelling (GTQSM) is facilitated by considering the fundamental unit of quantum computation and information, viz. a quantum bit or qubit as a basic building block. Unit directional vectors "ket 0" and "ket 1" constitute two distinct fundamental quantum across variable orthonormal basis vectors, for the Hilbert space, specifying the direction of propagation of information, or computation data, while complementary fundamental quantum through, or flow rate, variables specify probability parameters, or amplitudes, as surrogates for scalar quantum information measure (von Neumann entropy). This paper applies GTQSM in continuum of protein heterodimer tubulin molecules of self-assembling polymers, viz. microtubules in the brain as a holistic system of interacting components representing hierarchical clustered quantum Hopfield network, hQHN, of networks. The quantum input/output ports of the constituent elemental interaction components, or processes, of tunnelling interactions and Coulombic bidirectional interactions are in cascade and parallel interconnections with each other, while the classical output ports of all elemental components are interconnected in parallel to accumulate micro-energy functions generated in the system as Hamiltonian, or Lyapunov, energy function. The paper presents an insight, otherwise difficult to gain, for the complex system of systems represented by clustered quantum Hopfield network, hQHN, through the application of GTQSM construct.

On the locating-chromatic number for graphs with two homogenous components

NASA Astrophysics Data System (ADS)

Welyyanti, Des; Baskoro, Edy Tri; Simajuntak, Rinovia; Uttunggadewa, Saladin

2017-10-01

The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002. The concept of the locating-chromatic number is a marriage between graph coloring and the notion of graph partition dimension. This concept is only for connected graphs. In [8], we extended this concept also for disconnected graphs. In this paper, we determine the locating- chromatic number of a graph with two components. In particular, we determine such values if the components are homogeneous and each component has locating-chromatic number 3.

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

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

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

The impact of home care nurses' numeracy and graph literacy on comprehension of visual display information: implications for dashboard design.

PubMed

Dowding, Dawn; Merrill, Jacqueline A; Onorato, Nicole; Barrón, Yolanda; Rosati, Robert J; Russell, David

2018-02-01

To explore home care nurses' numeracy and graph literacy and their relationship to comprehension of visualized data. A multifactorial experimental design using online survey software. Nurses were recruited from 2 Medicare-certified home health agencies. Numeracy and graph literacy were measured using validated scales. Nurses were randomized to 1 of 4 experimental conditions. Each condition displayed data for 1 of 4 quality indicators, in 1 of 4 different visualized formats (bar graph, line graph, spider graph, table). A mixed linear model measured the impact of numeracy, graph literacy, and display format on data understanding. In all, 195 nurses took part in the study. They were slightly more numerate and graph literate than the general population. Overall, nurses understood information presented in bar graphs most easily (88% correct), followed by tables (81% correct), line graphs (77% correct), and spider graphs (41% correct). Individuals with low numeracy and low graph literacy had poorer comprehension of information displayed across all formats. High graph literacy appeared to enhance comprehension of data regardless of numeracy capabilities. Clinical dashboards are increasingly used to provide information to clinicians in visualized format, under the assumption that visual display reduces cognitive workload. Results of this study suggest that nurses' comprehension of visualized information is influenced by their numeracy, graph literacy, and the display format of the data. Individual differences in numeracy and graph literacy skills need to be taken into account when designing dashboard technology. © The Author 2017. Published by Oxford University Press on behalf of the American Medical Informatics Association. All rights reserved. For Permissions, please email: journals.permissions@oup.com

GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins.

PubMed

Durand, Patrick; Labarre, Laurent; Meil, Alain; Divo, Jean-Louis; Vandenbrouck, Yves; Viari, Alain; Wojcik, Jérôme

2006-01-17

A large variety of biological data can be represented by graphs. These graphs can be constructed from heterogeneous data coming from genomic and post-genomic technologies, but there is still need for tools aiming at exploring and analysing such graphs. This paper describes GenoLink, a software platform for the graphical querying and exploration of graphs. GenoLink provides a generic framework for representing and querying data graphs. This framework provides a graph data structure, a graph query engine, allowing to retrieve sub-graphs from the entire data graph, and several graphical interfaces to express such queries and to further explore their results. A query consists in a graph pattern with constraints attached to the vertices and edges. A query result is the set of all sub-graphs of the entire data graph that are isomorphic to the pattern and satisfy the constraints. The graph data structure does not rely upon any particular data model but can dynamically accommodate for any user-supplied data model. However, for genomic and post-genomic applications, we provide a default data model and several parsers for the most popular data sources. GenoLink does not require any programming skill since all operations on graphs and the analysis of the results can be carried out graphically through several dedicated graphical interfaces. GenoLink is a generic and interactive tool allowing biologists to graphically explore various sources of information. GenoLink is distributed either as a standalone application or as a component of the Genostar/Iogma platform. Both distributions are free for academic research and teaching purposes and can be requested at academy@genostar.com. A commercial licence form can be obtained for profit company at info@genostar.com. See also http://www.genostar.org.

GenoLink: a graph-based querying and browsing system for investigating the function of genes and proteins

PubMed Central

Durand, Patrick; Labarre, Laurent; Meil, Alain; Divo1, Jean-Louis; Vandenbrouck, Yves; Viari, Alain; Wojcik, Jérôme

2006-01-01

Background A large variety of biological data can be represented by graphs. These graphs can be constructed from heterogeneous data coming from genomic and post-genomic technologies, but there is still need for tools aiming at exploring and analysing such graphs. This paper describes GenoLink, a software platform for the graphical querying and exploration of graphs. Results GenoLink provides a generic framework for representing and querying data graphs. This framework provides a graph data structure, a graph query engine, allowing to retrieve sub-graphs from the entire data graph, and several graphical interfaces to express such queries and to further explore their results. A query consists in a graph pattern with constraints attached to the vertices and edges. A query result is the set of all sub-graphs of the entire data graph that are isomorphic to the pattern and satisfy the constraints. The graph data structure does not rely upon any particular data model but can dynamically accommodate for any user-supplied data model. However, for genomic and post-genomic applications, we provide a default data model and several parsers for the most popular data sources. GenoLink does not require any programming skill since all operations on graphs and the analysis of the results can be carried out graphically through several dedicated graphical interfaces. Conclusion GenoLink is a generic and interactive tool allowing biologists to graphically explore various sources of information. GenoLink is distributed either as a standalone application or as a component of the Genostar/Iogma platform. Both distributions are free for academic research and teaching purposes and can be requested at academy@genostar.com. A commercial licence form can be obtained for profit company at info@genostar.com. See also . PMID:16417636

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE PAGES

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; ...

2016-01-01

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

Molecular graph convolutions: moving beyond fingerprints.

PubMed

Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick

2016-08-01

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph-atoms, bonds, distances, etc.-which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.

Mutual proximity graphs for improved reachability in music recommendation.

PubMed

Flexer, Arthur; Stevens, Jeff

2018-01-01

This paper is concerned with the impact of hubness, a general problem of machine learning in high-dimensional spaces, on a real-world music recommendation system based on visualisation of a k-nearest neighbour (knn) graph. Due to a problem of measuring distances in high dimensions, hub objects are recommended over and over again while anti-hubs are nonexistent in recommendation lists, resulting in poor reachability of the music catalogue. We present mutual proximity graphs, which are an alternative to knn and mutual knn graphs, and are able to avoid hub vertices having abnormally high connectivity. We show that mutual proximity graphs yield much better graph connectivity resulting in improved reachability compared to knn graphs, mutual knn graphs and mutual knn graphs enhanced with minimum spanning trees, while simultaneously reducing the negative effects of hubness.

Mutual proximity graphs for improved reachability in music recommendation

PubMed Central

Flexer, Arthur; Stevens, Jeff

2018-01-01

This paper is concerned with the impact of hubness, a general problem of machine learning in high-dimensional spaces, on a real-world music recommendation system based on visualisation of a k-nearest neighbour (knn) graph. Due to a problem of measuring distances in high dimensions, hub objects are recommended over and over again while anti-hubs are nonexistent in recommendation lists, resulting in poor reachability of the music catalogue. We present mutual proximity graphs, which are an alternative to knn and mutual knn graphs, and are able to avoid hub vertices having abnormally high connectivity. We show that mutual proximity graphs yield much better graph connectivity resulting in improved reachability compared to knn graphs, mutual knn graphs and mutual knn graphs enhanced with minimum spanning trees, while simultaneously reducing the negative effects of hubness. PMID:29348779

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

NASA Astrophysics Data System (ADS)

Hamilton, Kathleen E.; Humble, Travis S.

2017-04-01

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph G: a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. We show that the complete bipartite graph K_{N,N} has a MSC of N minors, from which K_{N+1} is identified as the largest clique minor of K_{N,N}. The case of determining the largest clique minor of hardware with faults is briefly discussed but remains an open question.

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

DOE PAGES

Hamilton, Kathleen E.; Humble, Travis S.

2017-02-23

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, whichmore » is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.« less

Constructing compact and effective graphs for recommender systems via node and edge aggregations

DOE PAGES

Lee, Sangkeun; Kahng, Minsuk; Lee, Sang-goo

2014-12-10

Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naive graph-based recommendation method, which operates with a heterogeneous log-metadata graph constructed from user log and content metadata databases. Although the na ve graph-based recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we proposemore » node and edge aggregation approaches to constructing compact and e ective graphs called Factor-Item bipartite graphs by aggregating nodes and edges of a log-metadata graph. Furthermore, experimental results using real world datasets indicate that our approach can significantly reduce the size of graphs exploited for recommender systems without sacrificing the recommendation quality.« less

graphkernels: R and Python packages for graph comparison

PubMed Central

Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten

2018-01-01

Abstract Summary Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. Availability and implementation The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. Contact mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch Supplementary information Supplementary data are available online at Bioinformatics. PMID:29028902

Detecting labor using graph theory on connectivity matrices of uterine EMG.

PubMed

Al-Omar, S; Diab, A; Nader, N; Khalil, M; Karlsson, B; Marque, C

2015-08-01

Premature labor is one of the most serious health problems in the developed world. One of the main reasons for this is that no good way exists to distinguish true labor from normal pregnancy contractions. The aim of this paper is to investigate if the application of graph theory techniques to multi-electrode uterine EMG signals can improve the discrimination between pregnancy contractions and labor. To test our methods we first applied them to synthetic graphs where we detected some differences in the parameters results and changes in the graph model from pregnancy-like graphs to labor-like graphs. Then, we applied the same methods to real signals. We obtained the best differentiation between pregnancy and labor through the same parameters. Major improvements in differentiating between pregnancy and labor were obtained using a low pass windowing preprocessing step. Results show that real graphs generally became more organized when moving from pregnancy, where the graph showed random characteristics, to labor where the graph became a more small-world like graph.

Stationary waves on nonlinear quantum graphs. II. Application of canonical perturbation theory in basic graph structures.

PubMed

Gnutzmann, Sven; Waltner, Daniel

2016-12-01

We consider exact and asymptotic solutions of the stationary cubic nonlinear Schrödinger equation on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation formalism developed in our earlier paper [S. Gnutzmann and D. Waltner, Phys. Rev. E 93, 032204 (2016)2470-004510.1103/PhysRevE.93.032204]. For closed example graphs (interval, ring, star graph, tadpole graph), we calculate spectral curves and show how the description of spectra reduces to known characteristic functions of linear quantum graphs in the low-intensity limit. Analogously for open examples, we show how nonlinear scattering of stationary waves arises and how it reduces to known linear scattering amplitudes at low intensities. In the short-wavelength asymptotics we discuss how genuine nonlinear effects may be described using the leading order of canonical perturbation theory: bifurcation of spectral curves (and the corresponding solutions) in closed graphs and multistability in open graphs.

A Visual Analytics Paradigm Enabling Trillion-Edge Graph Exploration

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

Wong, Pak C.; Haglin, David J.; Gillen, David S.

We present a visual analytics paradigm and a system prototype for exploring web-scale graphs. A web-scale graph is described as a graph with ~one trillion edges and ~50 billion vertices. While there is an aggressive R&D effort in processing and exploring web-scale graphs among internet vendors such as Facebook and Google, visualizing a graph of that scale still remains an underexplored R&D area. The paper describes a nontraditional peek-and-filter strategy that facilitates the exploration of a graph database of unprecedented size for visualization and analytics. We demonstrate that our system prototype can 1) preprocess a graph with ~25 billion edgesmore » in less than two hours and 2) support database query and visualization on the processed graph database afterward. Based on our computational performance results, we argue that we most likely will achieve the one trillion edge mark (a computational performance improvement of 40 times) for graph visual analytics in the near future.« less

graphkernels: R and Python packages for graph comparison.

PubMed

Sugiyama, Mahito; Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten

2018-02-01

Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch. Supplementary data are available online at Bioinformatics. © The Author(s) 2017. Published by Oxford University Press.

Continuous-time quantum walks on star graphs

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

Salimi, S.

2009-06-15

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K{sub 2} graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

Matching Extension in Regular Graphs

DTIC Science & Technology

1989-01-01

Plummer, Matching Theory, Ann. Discrete Math . 29, North- Holland, Amsterdam, 1986. [101 , The matching structure of graphs: some recent re- sults...maximums d’un graphe, These, Dr. troisieme cycle, Univ. Grenoble, 1978. [12 ] D. Naddef and W.R. Pulleyblank, Matching in regular graphs, Discrete Math . 34...1981, 283-291. [13 1 M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. . [ 141 ,Matching extension in planar graphs IV

Convex Graph Invariants

DTIC Science & Technology

2010-12-02

Motzkin, T. and Straus, E. (1965). Maxima for graphs and a new proof of a theorem of Turan . Canad. J. Math. 17 533–540. [33] Rendl, F. and Sotirov, R...Convex Graph Invariants Venkat Chandrasekaran, Pablo A . Parrilo, and Alan S. Willsky ∗ Laboratory for Information and Decision Systems Department of...this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph. Some examples

Application-Specific Graph Sampling for Frequent Subgraph Mining and Community Detection

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

Purohit, Sumit; Choudhury, Sutanay; Holder, Lawrence B.

Graph mining is an important data analysis methodology, but struggles as the input graph size increases. The scalability and usability challenges posed by such large graphs make it imperative to sample the input graph and reduce its size. The critical challenge in sampling is to identify the appropriate algorithm to insure the resulting analysis does not suffer heavily from the data reduction. Predicting the expected performance degradation for a given graph and sampling algorithm is also useful. In this paper, we present different sampling approaches for graph mining applications such as Frequent Subgrpah Mining (FSM), and Community Detection (CD). Wemore » explore graph metrics such as PageRank, Triangles, and Diversity to sample a graph and conclude that for heterogeneous graphs Triangles and Diversity perform better than degree based metrics. We also present two new sampling variations for targeted graph mining applications. We present empirical results to show that knowledge of the target application, along with input graph properties can be used to select the best sampling algorithm. We also conclude that performance degradation is an abrupt, rather than gradual phenomena, as the sample size decreases. We present the empirical results to show that the performance degradation follows a logistic function.« less

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

PubMed

Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

2018-01-01

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Knowledge Representation Issues in Semantic Graphs for Relationship Detection

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

Barthelemy, M; Chow, E; Eliassi-Rad, T

2005-02-02

An important task for Homeland Security is the prediction of threat vulnerabilities, such as through the detection of relationships between seemingly disjoint entities. A structure used for this task is a ''semantic graph'', also known as a ''relational data graph'' or an ''attributed relational graph''. These graphs encode relationships as typed links between a pair of typed nodes. Indeed, semantic graphs are very similar to semantic networks used in AI. The node and link types are related through an ontology graph (also known as a schema). Furthermore, each node has a set of attributes associated with it (e.g., ''age'' maymore » be an attribute of a node of type ''person''). Unfortunately, the selection of types and attributes for both nodes and links depends on human expertise and is somewhat subjective and even arbitrary. This subjectiveness introduces biases into any algorithm that operates on semantic graphs. Here, we raise some knowledge representation issues for semantic graphs and provide some possible solutions using recently developed ideas in the field of complex networks. In particular, we use the concept of transitivity to evaluate the relevance of individual links in the semantic graph for detecting relationships. We also propose new statistical measures for semantic graphs and illustrate these semantic measures on graphs constructed from movies and terrorism data.« less

Simple graph models of information spread in finite populations

PubMed Central

Voorhees, Burton; Ryder, Bergerud

2015-01-01

We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs. In addition to fixation probabilities, we study structure parameters for these graphs, including eigenvalues of the Laplacian, conductances, communicability and expected hitting times. In several cases, values of these parameters are related, most strongly so for partial bipartite graphs. A measure of directional bias in cycles and circular flows arises from the non-zero eigenvalues of the antisymmetric part of the Laplacian and another measure is found for cycles as the value of the transition probability for which hitting times going in either direction of the cycle are equal. A generalization of circular flow graphs is used to illustrate the possibility of tuning edge weights to match pre-specified values for graph parameters; in particular, we show that generalizations of circular flows can be tuned to have fixation probabilities equal to the Moran probability for a complete graph by tuning vertex temperature profiles. Finally, single-link graphs are introduced as an example of a graph involving a bottleneck in the connection between two components and these are compared to the partial bipartite graphs. PMID:26064661

Understanding the roles of the strategic element cobalt in nickel base superalloys

NASA Technical Reports Server (NTRS)

Stephens, J. R.; Dreshfield, R. L.

1983-01-01

The United States imports over 90% of its cobalt, chromium, columbium, and tantalum, all key elements in high temperature nickel base superalloys for aircraft gas turbine disks and airfoils. Research progress in understanding the roles of cobalt and some possible substitutes effects on microstructure, mechanical properties, and environmental resistance of turbine alloys is discussed.

77 FR 76518 - Summary of Commission Practice Relating to Administrative Protective Orders

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-28

.... APO breach inquiries are considered on a case-by-case basis. As part of the effort to educate...-called hard disk computer media is to be avoided, because mere erasure of data from such media may not...; (2) Referral to the United States Attorney; (3) In the case of an attorney, accountant, or other...

Some subclasses of multivalent functions involving a certain linear operator

NASA Astrophysics Data System (ADS)

Srivastava, H. M.; Patel, J.

2005-10-01

The authors investigate various inclusion and other properties of several subclasses of the class of normalized p-valent analytic functions in the open unit disk, which are defined here by means of a certain linear operator. Problems involving generalized neighborhoods of analytic functions in the class are investigated. Finally, some applications of fractional calculus operators are considered.

RNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology

PubMed Central

Elmetwaly, Shereef; Schlick, Tamar

2014-01-01

Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG) framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2) corresponding to the second eigenvalues (λ2) associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2′s components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2′s components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼220 nucleotides). While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs also suggest design strategies for novel RNA motifs. PMID:25188578

A Semantic Graph Query Language

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

Kaplan, I L

2006-10-16

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

Kinetic theory for identical, frictional, nearly elastic disks

NASA Astrophysics Data System (ADS)

Yoon, David K.; Jenkins, James T.

2005-08-01

We develop kinetic theory for slightly frictional and nearly elastic disks. The tangential interaction is modeled by two parameters: a Coulomb friction coefficient and a tangential restitution coefficient. Assuming Maxwellian velocity distribution functions for both translational and rotational velocities, we derive exact expressions for the rates of dissipation of translational and rotational fluctuation energies per unit area. Setting the rotational dissipation rate to zero, as in a steady, homogeneous shearing flow, we find the ratio of the rotational temperature to the translational. In the case of small friction, this is used to determine an effective coefficient of normal restitution. In this way, the effects of small friction can be incorporated into the theory, thereby dispensing with the need to separately consider the complete balances for the momentum and the energy of the rotational motion.

Flare forecasting at the Met Office Space Weather Operations Centre

NASA Astrophysics Data System (ADS)

Murray, S. A.; Bingham, S.; Sharpe, M.; Jackson, D. R.

2017-04-01

The Met Office Space Weather Operations Centre produces 24/7/365 space weather guidance, alerts, and forecasts to a wide range of government and commercial end-users across the United Kingdom. Solar flare forecasts are one of its products, which are issued multiple times a day in two forms: forecasts for each active region on the solar disk over the next 24 h and full-disk forecasts for the next 4 days. Here the forecasting process is described in detail, as well as first verification of archived forecasts using methods commonly used in operational weather prediction. Real-time verification available for operational flare forecasting use is also described. The influence of human forecasters is highlighted, with human-edited forecasts outperforming original model results and forecasting skill decreasing over longer forecast lead times.

Telemetry data storage systems technology for the Space Station Freedom era

NASA Technical Reports Server (NTRS)

Dalton, John T.

1989-01-01

This paper examines the requirements and functions of the telemetry-data recording and storage systems, and the data-storage-system technology projected for the Space Station, with particular attention given to the Space Optical Disk Recorder, an on-board storage subsystem based on 160 gigabit erasable optical disk units each capable of operating at 300 M bits per second. Consideration is also given to storage systems for ground transport recording, which include systems for data capture, buffering, processing, and delivery on the ground. These can be categorized as the first in-first out storage, the fast random-access storage, and the slow access with staging. Based on projected mission manifests and data rates, the worst case requirements were developed for these three storage architecture functions. The results of the analysis are presented.

United theory of planet formation (i): Tandem regime

NASA Astrophysics Data System (ADS)

Ebisuzaki, Toshikazu; Imaeda, Yusuke

2017-07-01

The present paper is the first one of a series of papers that present the new united theory of planet formation, which includes magneto-rotational instability and porous aggregation of solid particles in an consistent way. We here describe the ;tandem; planet formation regime, in which a solar system like planetary systems are likely to be produced. We have obtained a steady-state, 1-D model of the accretion disk of a protostar taking into account the magneto-rotational instability (MRI) and and porous aggregation of solid particles. We find that the disk is divided into an outer turbulent region (OTR), a MRI suppressed region (MSR), and an inner turbulent region (ITR). The outer turbulent region is fully turbulent because of MRI. However, in the range, rout(= 8 - 60 AU) from the central star, MRI is suppressed around the midplane of the gas disk and a quiet area without turbulence appears, because the degree of ionization of gas becomes low enough. The disk becomes fully turbulent again in the range rin(= 0.2 - 1 AU), which is called the inner turbulent region, because the midplane temperature become high enough (>1000 K) due to gravitational energy release. Planetesimals are formed through gravitational instability at the outer and inner MRI fronts (the boundaries between the MRI suppressed region (MSR) and the outer and inner turbuent regions) without particle enhancement in the original nebula composition, because of the radial concentration of the solid particles. At the outer MRI front, icy particles grow through low-velocity collisions into porous aggregates with low densities (down to ∼10-5 gcm-3). They eventually undergo gravitational instability to form icy planetesimals. On the other hand, rocky particles accumulate at the inner MRI front, since their drift velocities turn outward due to the local maximum in gas pressure. They undergo gravitational instability in a sub-disk of pebbles to form rocky planetesimals at the inner MRI front. They are likely to be volatile-free because of the high temperature (>1000 K) at this formation site. Such water-free rocky particles may explain the formation of enstatite chondrites, of which the Earth is likely to be primarily composed of. It is also consistent with the model in which the Earth was initially formed as a completely volatile-free planet. The water and other volatile elements came later through the accretion of icy particles by the occasional scatterings in the outer regions. Our new proposed tandem planet formation regime shows that planetesimals are formed at two distinct sites (outer and inner edges of the MRI suppressed region). The former is likely to be the source of outer gas giants and the latter inner rocky planets. The tandem regime also explains the gap in the distribution of solid components (2-4 AU), which is necessary to form a ;solar-system-like; planetary system, which has a relatively small Mars and a very small mass in the main asteroid belt. We found that this tandem regime dose not take place when the vertical magnetic field of the disk five times weaker compared with that we assumed in the present paper, since the outer MRI front shift outward beyond 100 AU. This suggests that yet other regimes exists in our united theory. It may explain the variation observed in exsoplanetary systems by variations in magnetic field and probably angular momentum of the parent molecular cloud.

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

Bogen, Paul Logasa; McKenzie, Amber T; Gillen, Rob

Forensic document analysis has become an important aspect of investigation of many different kinds of crimes from money laundering to fraud and from cybercrime to smuggling. The current workflow for analysts includes powerful tools, such as Palantir and Analyst s Notebook, for moving from evidence to actionable intelligence and tools for finding documents among the millions of files on a hard disk, such as FTK. However, the analysts often leave the process of sorting through collections of seized documents to filter out the noise from the actual evidence to a highly labor-intensive manual effort. This paper presents the Redeye Analysismore » Workbench, a tool to help analysts move from manual sorting of a collection of documents to performing intelligent document triage over a digital library. We will discuss the tools and techniques we build upon in addition to an in-depth discussion of our tool and how it addresses two major use cases we observed analysts performing. Finally, we also include a new layout algorithm for radial graphs that is used to visualize clusters of documents in our system.« less

Software for Training in Pre-College Mathematics

NASA Technical Reports Server (NTRS)

Shelton, Robert O.; Moebes, Travis A.; VanAlstine, Scot

2003-01-01

The Intelligent Math Tutor (IMT) is a computer program for training students in pre-college and college-level mathematics courses, including fundamentals, intermediate algebra, college algebra, and trigonometry. The IMT can be executed on a server computer for access by students via the Internet; alternatively, it can be executed on students computers equipped with compact- disk/read-only-memory (CD-ROM) drives. The IMT provides interactive exercises, assessment, tracking, and an on-line graphing calculator with algebraic-manipulation capabilities. The IMT provides an innovative combination of content, delivery mechanism, and artificial intelligence. Careful organization and presentation of the content make it possible to provide intelligent feedback to the student based on performance on exercises and tests. The tracking and feedback mechanisms are implemented within the capabilities of a commercial off-the-shelf development software tool and are written in the Unified Modeling Language to maximize reuse and minimize development cost. The graphical calculator is a standard feature of most college and pre-college algebra and trigonometry courses. Placing this functionality in a Java applet decreases the cost, provides greater capabilities, and provides an opportunity to integrate the calculator with the lessons.

Constructing Dense Graphs with Unique Hamiltonian Cycles

ERIC Educational Resources Information Center

Lynch, Mark A. M.

2012-01-01

It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…

Dynamic graph of an oxy-fuel combustion system using autocatalytic set model

NASA Astrophysics Data System (ADS)

Harish, Noor Ainy; Bakar, Sumarni Abu

2017-08-01

Evaporation process is one of the main processes besides combustion process in an oxy-combustion boiler system. An Autocatalytic Set (ASC) Model has successfully applied in developing graphical representation of the chemical reactions that occurs in the evaporation process in the system. Seventeen variables identified in the process are represented as nodes and the catalytic relationships are represented as edges in the graph. In addition, in this paper graph dynamics of ACS is further investigated. By using Dynamic Autocatalytic Set Graph Algorithm (DAGA), the adjacency matrix for each of the graphs and its relations to Perron-Frobenius Theorem is investigated. The dynamic graph obtained is further investigated where the connection of the graph to fuzzy graph Type 1 is established.

A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering.

PubMed

Cheng, De; Nie, Feiping; Sun, Jiande; Gong, Yihong

2017-07-01

Graph-based clustering methods perform clustering on a fixed input data graph. Thus such clustering results are sensitive to the particular graph construction. If this initial construction is of low quality, the resulting clustering may also be of low quality. We address this drawback by allowing the data graph itself to be adaptively adjusted in the clustering procedure. In particular, our proposed weight adaptive Laplacian (WAL) method learns a new data similarity matrix that can adaptively adjust the initial graph according to the similarity weight in the input data graph. We develop three versions of these methods based on the L2-norm, fuzzy entropy regularizer, and another exponential-based weight strategy, that yield three new graph-based clustering objectives. We derive optimization algorithms to solve these objectives. Experimental results on synthetic data sets and real-world benchmark data sets exhibit the effectiveness of these new graph-based clustering methods.

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

Hamilton, Kathleen E.; Humble, Travis S.

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, whichmore » is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.« less

Genus Ranges of 4-Regular Rigid Vertex Graphs

PubMed Central

Buck, Dorothy; Dolzhenko, Egor; Jonoska, Nataša; Saito, Masahico; Valencia, Karin

2016-01-01

A rigid vertex of a graph is one that has a prescribed cyclic order of its incident edges. We study orientable genus ranges of 4-regular rigid vertex graphs. The (orientable) genus range is a set of genera values over all orientable surfaces into which a graph is embedded cellularly, and the embeddings of rigid vertex graphs are required to preserve the prescribed cyclic order of incident edges at every vertex. The genus ranges of 4-regular rigid vertex graphs are sets of consecutive integers, and we address two questions: which intervals of integers appear as genus ranges of such graphs, and what types of graphs realize a given genus range. For graphs with 2n vertices (n > 1), we prove that all intervals [a, b] for all a < b ≤ n, and singletons [h, h] for some h ≤ n, are realized as genus ranges. For graphs with 2n − 1 vertices (n ≥ 1), we prove that all intervals [a, b] for all a < b ≤ n except [0, n], and [h, h] for some h ≤ n, are realized as genus ranges. We also provide constructions of graphs that realize these ranges. PMID:27807395

Ringo: Interactive Graph Analytics on Big-Memory Machines

PubMed Central

Perez, Yonathan; Sosič, Rok; Banerjee, Arijit; Puttagunta, Rohan; Raison, Martin; Shah, Pararth; Leskovec, Jure

2016-01-01

We present Ringo, a system for analysis of large graphs. Graphs provide a way to represent and analyze systems of interacting objects (people, proteins, webpages) with edges between the objects denoting interactions (friendships, physical interactions, links). Mining graphs provides valuable insights about individual objects as well as the relationships among them. In building Ringo, we take advantage of the fact that machines with large memory and many cores are widely available and also relatively affordable. This allows us to build an easy-to-use interactive high-performance graph analytics system. Graphs also need to be built from input data, which often resides in the form of relational tables. Thus, Ringo provides rich functionality for manipulating raw input data tables into various kinds of graphs. Furthermore, Ringo also provides over 200 graph analytics functions that can then be applied to constructed graphs. We show that a single big-memory machine provides a very attractive platform for performing analytics on all but the largest graphs as it offers excellent performance and ease of use as compared to alternative approaches. With Ringo, we also demonstrate how to integrate graph analytics with an iterative process of trial-and-error data exploration and rapid experimentation, common in data mining workloads. PMID:27081215

Computing Information Value from RDF Graph Properties

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

al-Saffar, Sinan; Heileman, Gregory

2010-11-08

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We computemore » information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.« less

Ringo: Interactive Graph Analytics on Big-Memory Machines.

PubMed

Perez, Yonathan; Sosič, Rok; Banerjee, Arijit; Puttagunta, Rohan; Raison, Martin; Shah, Pararth; Leskovec, Jure

2015-01-01

We present Ringo, a system for analysis of large graphs. Graphs provide a way to represent and analyze systems of interacting objects (people, proteins, webpages) with edges between the objects denoting interactions (friendships, physical interactions, links). Mining graphs provides valuable insights about individual objects as well as the relationships among them. In building Ringo, we take advantage of the fact that machines with large memory and many cores are widely available and also relatively affordable. This allows us to build an easy-to-use interactive high-performance graph analytics system. Graphs also need to be built from input data, which often resides in the form of relational tables. Thus, Ringo provides rich functionality for manipulating raw input data tables into various kinds of graphs. Furthermore, Ringo also provides over 200 graph analytics functions that can then be applied to constructed graphs. We show that a single big-memory machine provides a very attractive platform for performing analytics on all but the largest graphs as it offers excellent performance and ease of use as compared to alternative approaches. With Ringo, we also demonstrate how to integrate graph analytics with an iterative process of trial-and-error data exploration and rapid experimentation, common in data mining workloads.

Reflecting on Graphs: Attributes of Graph Choice and Construction Practices in Biology

PubMed Central

Angra, Aakanksha; Gardner, Stephanie M.

2017-01-01

Undergraduate biology education reform aims to engage students in scientific practices such as experimental design, experimentation, and data analysis and communication. Graphs are ubiquitous in the biological sciences, and creating effective graphical representations involves quantitative and disciplinary concepts and skills. Past studies document student difficulties with graphing within the contexts of classroom or national assessments without evaluating student reasoning. Operating under the metarepresentational competence framework, we conducted think-aloud interviews to reveal differences in reasoning and graph quality between undergraduate biology students, graduate students, and professors in a pen-and-paper graphing task. All professors planned and thought about data before graph construction. When reflecting on their graphs, professors and graduate students focused on the function of graphs and experimental design, while most undergraduate students relied on intuition and data provided in the task. Most undergraduate students meticulously plotted all data with scaled axes, while professors and some graduate students transformed the data, aligned the graph with the research question, and reflected on statistics and sample size. Differences in reasoning and approaches taken in graph choice and construction corroborate and extend previous findings and provide rich targets for undergraduate and graduate instruction. PMID:28821538

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.

Gas dynamics in the inner few AU around the Herbig B[e] star MWC297. Indications of a disk wind from kinematic modeling and velocity-resolved interferometric imaging

NASA Astrophysics Data System (ADS)

Hone, Edward; Kraus, Stefan; Kreplin, Alexander; Hofmann, Karl-Heinz; Weigelt, Gerd; Harries, Tim; Kluska, Jacques

2017-10-01

Aims: Circumstellar accretion disks and outflows play an important role in star formation. By studying the continuum and Brγ-emitting region of the Herbig B[e] star MWC297 with high-spectral and high-spatial resolution we aim to gain insight into the wind-launching mechanisms in young stars. Methods: We present near-infrared AMBER (R = 12 000) and CRIRES (R = 100 000) observations of the Herbig B[e] star MWC297 in the hydrogen Brγ-line. Using the VLTI unit telescopes, we obtained a uv-coverage suitable for aperture synthesis imaging. We interpret our velocity-resolved images as well as the derived two-dimensional photocenter displacement vectors, and fit kinematic models to our visibility and phase data in order to constrain the gas velocity field on sub-AU scales. Results: The measured continuum visibilities constrain the orientation of the near-infrared-emitting dust disk, where we determine that the disk major axis is oriented along a position angle of 99.6 ± 4.8°. The near-infrared continuum emission is 3.6 × more compact than the expected dust-sublimation radius, possibly indicating the presence of highly refractory dust grains or optically thick gas emission in the inner disk. Our velocity-resolved channel maps and moment maps reveal the motion of the Brγ-emitting gas in six velocity channels, marking the first time that kinematic effects in the sub-AU inner regions of a protoplanetary disk could be directly imaged. We find a rotation-dominated velocity field, where the blue- and red-shifted emissions are displaced along a position angle of 24° ± 3° and the approaching part of the disk is offset west of the star. The visibility drop in the line as well as the strong non-zero phase signals can be modeled reasonably well assuming a Keplerian velocity field, although this model is not able to explain the 3σ difference that we measure between the position angle of the line photocenters and the position angle of the dust disk. We find that the fit can be improved by adding an outflowing component to the velocity field, as inspired by a magneto-centrifugal disk-wind scenario. Conclusions: This study combines spectroscopy, spectroastrometry, and high-spectral dispersion interferometric, providing yet the tightest constraints on the distribution and kinematics of Brγ-emitting gas in the inner few AU around a young star. All observables can be modeled assuming a disk wind scenario. Our simulations show that adding a poloidal velocity component causes the perceived system axis to shift, offering a powerful new diagnostic for detecting non-Keplerian velocity components in other systems. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 081.D-0230, 083.C-0590, 089.C-0959, and 089.C-0563.

Does Guiding Toward Task-Relevant Information Help Improve Graph Processing and Graph Comprehension of Individuals with Low or High Numeracy? An Eye-Tracker Experiment.

PubMed

Keller, Carmen; Junghans, Alex

2017-11-01

Individuals with low numeracy have difficulties with understanding complex graphs. Combining the information-processing approach to numeracy with graph comprehension and information-reduction theories, we examined whether high numerates' better comprehension might be explained by their closer attention to task-relevant graphical elements, from which they would expect numerical information to understand the graph. Furthermore, we investigated whether participants could be trained in improving their attention to task-relevant information and graph comprehension. In an eye-tracker experiment ( N = 110) involving a sample from the general population, we presented participants with 2 hypothetical scenarios (stomach cancer, leukemia) showing survival curves for 2 treatments. In the training condition, participants received written instructions on how to read the graph. In the control condition, participants received another text. We tracked participants' eye movements while they answered 9 knowledge questions. The sum constituted graph comprehension. We analyzed visual attention to task-relevant graphical elements by using relative fixation durations and relative fixation counts. The mediation analysis revealed a significant ( P < 0.05) indirect effect of numeracy on graph comprehension through visual attention to task-relevant information, which did not differ between the 2 conditions. Training had a significant main effect on visual attention ( P < 0.05) but not on graph comprehension ( P < 0.07). Individuals with high numeracy have better graph comprehension due to their greater attention to task-relevant graphical elements than individuals with low numeracy. With appropriate instructions, both groups can be trained to improve their graph-processing efficiency. Future research should examine (e.g., motivational) mediators between visual attention and graph comprehension to develop appropriate instructions that also result in higher graph comprehension.

Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems

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

Hong, Seokyong; Lee, Sangkeun; Lim, Seung-Hwan

2016-01-01

Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons:more » multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.« less