Powered by Deep Web Technologies
Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

Graphical rule of transforming continuous-variable graph states by local homodyne detection  

E-Print Network [OSTI]

Graphical rule, describing that any single-mode homodyne detection turns a given continuous-variable (CV) graph state into a new one, is presented. Employing two simple graphical rules: local complement operation and vertex deletion (single quadrature-amplitude $\\hat{x}$ measurement), the graphical rule for any single-mode quadrature component measurement can be obtained. The shape of CV weighted graph state may be designed and constructed easily from a given larger graph state by applying this graphical rule.

Jing Zhang

2010-06-21T23:59:59.000Z

2

159.235 Graphics 1 159.235 Graphics & Graphical  

E-Print Network [OSTI]

High quality rendering of test scene. Note : · Mirror and chrome teapot. · Shadows on floor. · Shiny : ­ Mirror ­ Chrome teapot. ­ Shiny floor ­ Shadows with local illumination. #12;159.235 Graphics 13 Kajiya

Hawick, Ken

3

Introduction to computer graphics  

Science Journals Connector (OSTI)

Computer graphics is an exciting field of endeavor, but it is often difficult for a newcomer to get started. This course is that opportunity! The topics being presented will address many areas within computer graphics and treat each from the point of ...

Mike Bailey; Andrew Glassner

2004-08-01T23:59:59.000Z

4

Fermilab | Graphic Standards at Fermilab  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Graphic Standards at Fermilab Navbar Toggle Graphic Standards Logo and usage Templates Email signatures Color palette Fonts Bar element Co-branding Administrative relationships...

5

Graphics Using GDI+  

Science Journals Connector (OSTI)

Using the .NET Framework...class librarys Win Form controls is not the only way to graphically present data to the user. Wm Form controls are powerful, there is no doubt about it, but there are stil...

Stephen R. G. Fraser

2003-01-01T23:59:59.000Z

6

Dynamic Graphics and GDI+  

Science Journals Connector (OSTI)

In Chapter 4, you learned about basic web controls for displaying graphics, such as the Image and ImageButton controls. Both allow you to display an image, and the ImageButton control also fires a ...

2007-01-01T23:59:59.000Z

7

Graphics, GDI+, and Charting  

Science Journals Connector (OSTI)

In Chapter 4, you learned about basic web controls for displaying graphics, such as the Image and ImageButton controls. Both allow you to display an image, and the ImageButton control also fires a Click event ...

Matthew MacDonald; Dan Mabbutt; Adam Freeman

2010-01-01T23:59:59.000Z

8

Graphics Using GDI+  

Science Journals Connector (OSTI)

U...sing the .NET Framework class librarys Windows Form controls is not the only way to graphically present data to the user. There is no doubt that Win Form controls are powerful, but occasionall...

2009-01-01T23:59:59.000Z

9

Dynamic Graphics and GDI+  

Science Journals Connector (OSTI)

In Chapter 4, you learned about basic web controls for displaying graphics, such as the Image and ImageButton controls. Both allow you to display an image, and the ImageButton control also fires a Click event ...

2008-01-01T23:59:59.000Z

10

Dynamic Graphics and GDI+  

Science Journals Connector (OSTI)

In Chapter 4, you learned about basic web controls for displaying graphics, such as the Image and ImageButton controls. Both allow you to display an image, and the ImageButton control also fires a Click event ...

2009-01-01T23:59:59.000Z

11

Dynamic Graphics and GDI+  

Science Journals Connector (OSTI)

In this chapter, you learned how to master basic and advanced GDI+. Although these techniques arent right ... . For even more detailed information about how GDI+ works and how to optimize it,...Pro .NET Graphics...

2005-01-01T23:59:59.000Z

12

Implementing Turtle Graphics...  

Science Journals Connector (OSTI)

Turtle Graphics were invented by Seymour Papert in ... drawn on the screen by an (imaginary) turtle which happens to be carrying a pen ... trace is left. In some implementations the turtle is a robot, and the nam...

Robin Jones; Ian Stewart

1987-01-01T23:59:59.000Z

13

Point-Based Graphics  

Science Journals Connector (OSTI)

The polygon-mesh approach to 3D modeling was a huge advance, but today its limitations are clear. Longer render times for increasingly complex images effectively cap image complexity, or else stretch budgets and schedules to the breaking point. Point-based ... Keywords: Computer Graphics, Computers

Markus Gross; Hanspeter Pfister

2007-06-01T23:59:59.000Z

14

Graphical description of local Gaussian operations for continuous-variable weighted graph states  

E-Print Network [OSTI]

The form of a local Clifford (LC, also called local Gaussian (LG)) operation for the continuous-variable (CV) weighted graph states is presented in this paper, which is the counterpart of the LC operation of local complementation for qubit graph states. The novel property of the CV weighted graph states is shown, which can be expressed by the stabilizer formalism. It is distinctively different from the qubit weighted graph states, which can not be expressed by the stabilizer formalism. The corresponding graph rule, stated in purely graph theoretical terms, is described, which completely characterizes the evolution of CV weighted graph states under this LC operation. This LC operation may be applied repeatedly on a CV weighted graph state, which can generate the infinite LC equivalent graph states of this graph state. This work is an important step to characterize the LC equivalence class of CV weighted graph states.

Jing Zhang

2008-10-08T23:59:59.000Z

15

Berea College Graphics Style Guide  

E-Print Network [OSTI]

, and its brand image. This Graphics Style Guide will help you with the technical aspects of representing

Baltisberger, Jay H.

16

Graphics for the Masses: A Hardware Rasterization Architecture for Mobile Phones  

E-Print Network [OSTI]

--Graphics Processors I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism--Texture Keywords: graphics. However, this type of render- ing has mostly been limited to very simple two-dimensional graph- ics, and it is only recently that three-dimensional graphics has seen the light in this context. Increased interest

17

Graphical calculus for Gaussian pure states  

Science Journals Connector (OSTI)

We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semilocal Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical calculus to analyze continuous-variable (CV) cluster states, the essential resource for one-way quantum computing with CV systems. Current graphical approaches to CV cluster states are only valid in the unphysical limit of infinite squeezing, and the associated graph transformation rules only apply when the initial and final states are of this form. Our formalism applies to all Gaussian pure states and subsumes these rules in a natural way. In addition, the term CV graph state currently has several inequivalent definitions in use. Using this formalism we provide a single unifying definition that encompasses all of them. We provide many examples of how the formalism may be used in the context of CV cluster states: defining the closest CV cluster state to a given Gaussian pure state and quantifying the error in the approximation due to finite squeezing; analyzing the optimality of certain methods of generating CV cluster states; drawing connections between this graphical formalism and bosonic Hamiltonians with Gaussian ground states, including those useful for CV one-way quantum computing; and deriving a graphical measure of bipartite entanglement for certain classes of CV cluster states. We mention other possible applications of this formalism and conclude with a brief note on fault tolerance in CV one-way quantum computing.

Nicolas C. Menicucci; Steven T. Flammia; Peter van Loock

2011-04-28T23:59:59.000Z

18

Computer Graphics Group Leif KobbeltAACHEN  

E-Print Network [OSTI]

Computer Graphics Group Leif KobbeltAACHEN Computer Graphics Leif Kobbelt Computer Graphics Group Leif KobbeltAACHEN Public Perception of CG · Games · Movies Computer Graphics Group Leif KobbeltAACHEN Computer Graphics Research · fundamental algorithms & data structures - continuous & discrete mathematics

Kobbelt, Leif

19

Graphic Design, Media and Communications  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Graphic Design Graphic Design Note: Graphic Design services are available at no charge to BNL and Guest users. There is a charge for laminating and/or mounting of printed posters The Graphic Design Studio is located to the second floor in the north wing of the Research Support Building 400. The telephone number is Ext. 7288. If you have any questions, please call supervisor, Rick Backofen, Ext. 6183. As graphic designers, one of the things we do best, is to solve complex problems using our ability to make ideas visible, culturally, aesthetically and economically. Our work includes a wide range of printed documents and presentation products. We will coordinate the technical aspects of the project and provide a production schedule to meet your requirements. Design

20

Parallel Graphics and Interactivity with the Scaleable Graphics Engine  

SciTech Connect (OSTI)

A parallel rendering environment is being developed to utilize the IBM Scaleable Graphics Engine (SGE), a hardware frame buffer for parallel computers. Goals of this software development effort include finding efficient ways of producing and displaying graphics generated on SP nodes and of assisting programmers in adapting or creating scientific simulation applications to use the SGE. Four software development phases are discussed utilize the SGE: tunneling, SMP Rendering, graphics API development using an OpenGL API implementation which utilizes the SGE in the parallel environment, and additions to the SGE-enabled OpenGL API implementation that uses threads. The SGE's ability to accept pixel data from multiple nodes simultaneously makes it a viable tool for use. With the performance observed in the test applications and performance optimizations gained programmers writing applications for IBM SPs and Linux clusters will be able to support high-speed output of graphics and be able to interact with data.

Perrine, Kenneth A.; Jones, Donald R.

2001-11-10T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Logo Turtle Graphics for the Lisp Machine  

E-Print Network [OSTI]

This paper is a manual for an implementation of Logo graphics primitives in Lisp on the MIT Lisp Machine. The graphics system provides:

Lieberman, Henry

1981-05-05T23:59:59.000Z

22

NCAR Graphics Libraries at NERSC  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

NCAR/NCL NCAR/NCL IO Libraries ALTD Debugging and Profiling Visualization and Analytics Grid Software and Services NERSC Software Downloads Accounts & Allocations Policies Data Analytics & Visualization Data Management Policies Science Gateways User Surveys NERSC Users Group User Announcements Help Operations for: Passwords & Off-Hours Status 1-800-66-NERSC, option 1 or 510-486-6821 Account Support https://nim.nersc.gov accounts@nersc.gov 1-800-66-NERSC, option 2 or 510-486-8612 Consulting http://help.nersc.gov consult@nersc.gov 1-800-66-NERSC, option 3 or 510-486-8611 Home » For Users » Software » Programming Libraries » NCAR/NCL NCAR Graphics What is NCAR Graphics? NCAR Graphics is a collection of graphics libraries that support the display of scientific data. Several interfaces are available for

23

Rendering Graphical Data with GDI+  

Science Journals Connector (OSTI)

The previous chapter introduced you to the process of building a GUI-based desktop application using System.Windows.Forms. The point of this chapter is to examine the details of rendering graphics (including s...

2007-01-01T23:59:59.000Z

24

Rendering Graphical Data with GDI+  

Science Journals Connector (OSTI)

The previous chapter introduced you to the process of building a GUI-based desktop application using System.Windows.Forms. The point of this chapter is to examine the details of rendering graphics (including s...

2008-01-01T23:59:59.000Z

25

Decoupled Sampling for Graphics Pipelines  

E-Print Network [OSTI]

We propose a generalized approach to decoupling shading from visibility sampling in graphics pipelines, which we call decoupled sampling. Decoupled sampling enables stochastic supersampling of motion and defocus blur at ...

Ragan-Kelley, Jonathan Millar

26

Planar graphical models which are easy  

SciTech Connect (OSTI)

We describe a rich family of binary variables statistical mechanics models on planar graphs which are equivalent to Gaussian Grassmann Graphical models (free fermions). Calculation of partition function (weighted counting) in the models is easy (of polynomial complexity) as reduced to evaluation of determinants of matrixes linear in the number of variables. In particular, this family of models covers Holographic Algorithms of Valiant and extends on the Gauge Transformations discussed in our previous works.

Chertkov, Michael [Los Alamos National Laboratory; Chernyak, Vladimir [WAYNE STATE UNIV

2009-01-01T23:59:59.000Z

27

Approximate inference in Gaussian graphical models  

E-Print Network [OSTI]

The focus of this thesis is approximate inference in Gaussian graphical models. A graphical model is a family of probability distributions in which the structure of interactions among the random variables is captured by a ...

Malioutov, Dmitry M., 1981-

2008-01-01T23:59:59.000Z

28

Improving your image with computer generated graphics  

SciTech Connect (OSTI)

Ways of presenting data for visual communication are discussed. The use of computer-generated graphics is emphasized. (GHT)

Hults, R.F.

1980-01-01T23:59:59.000Z

29

Vignettes of Sweden's Computer Graphics History  

E-Print Network [OSTI]

Vignettes of Sweden's Computer Graphics History Thomas Larsson Ma¨lardalen University, Sweden Ulf Stenlund This article recounts selected historical events in the computer graphics field in Sweden, ranging early achievements in Sweden related to the rapid development of computer graphics. Table 1 lists

Larsson, Thomas

30

Computer Science at Kent Turtle Graphics  

E-Print Network [OSTI]

Computer Science at Kent Turtle Graphics: Exercises in Haskell Eerke Boiten Technical Report No. 11 concerned with Turtle Graphics -- interpreting and generating programs for ``turtles''. Full solutions ``evaluates to''. For visualising turtle graphics, the exercises below use the Picture module from Thompson

Kent, University of

31

Graphical programming at Sandia National Laboratories  

SciTech Connect (OSTI)

Sandia has developed an advanced operational control system approach, called Graphical Programming, to design, program, and operate robotic systems. The Graphical Programming approach produces robot systems that are faster to develop and use, safer in operation, and cheaper overall than altemative teleoperation or autonomous robot control systems. Graphical Programming also provides an efficient and easy-to-use interface to traditional robot systems for use in setup and programming tasks. This paper provides an overview of the Graphical Programming approach and lists key features of Graphical Programming systems. Graphical Programming uses 3-D visualization and simulation software with intuitive operator interfaces for the programming and control of complex robotic systems. Graphical Programming Supervisor software modules allow an operator to command and simulate complex tasks in a graphic preview mode and, when acceptable, command the actual robots and monitor their motions with the graphic system. Graphical Programming Supervisors maintain registration with the real world and allow the robot to perform tasks that cannot be accurately represented with models alone by using a combination of model and sensor-based control.

McDonald, M.J.; Palmquist, R.D. [Sandia National Labs., Albuquerque, NM (United States); Desjarlais, L. [New Mexico Univ., Albuquerque, NM (United States)

1993-09-01T23:59:59.000Z

32

In "Handbook of Mathematical Models in Computer Vision", Springer, 2006 p.1 Graph Cuts in Vision and Graphics  

E-Print Network [OSTI]

In "Handbook of Mathematical Models in Computer Vision", Springer, 2006 p.1 Graph Cuts in Vision, shortest paths [6, 22]), Markov ran- dom fields, statistical physics, simulated annealing and other. This chap- ter does not provide any new research results, however, some applications are presented from

Boykov, Yuri

33

Computers & Graphics 24 (2000) 91}98 Computer graphics in Russia  

E-Print Network [OSTI]

Computers & Graphics 24 (2000) 91}98 Computer graphics in Russia Lossless compression of large), a project between Fin- land, Sweden, Norway and Russia, and GIS-Sever project, spanning the border between Finland and Russia. The objective of the projects is to produce uniform geo- graphic information that can

Joensuu, University of

34

PLOT2K: a graphics interface to System 2000  

SciTech Connect (OSTI)

PLOT2K is a versatile tool for generating graphs from a System 2000 data base. Its chief virtue is the ease with which it can be used, modified, and developed. This makes the graphics plot accessible to a wide range of users and allows it to be altered to suit a wide range of needs.

Creel, L.R.

1981-01-01T23:59:59.000Z

35

Moby/plc --Graphical Development of PLCAutomata ? ??  

E-Print Network [OSTI]

Moby/plc -- Graphical Development of PLC­Automata ? ?? Josef Tapken and Henning Dierks University­Mail: ftapken,dierksg@informatik.uni­oldenburg.de Abstract. Moby/plc is a graphical design tool for PLC­ trollers (PLCs). In this paper we sketch the modelling language in use and some features of Moby/plc, like

Olderog, Ernst-Rüdiger

36

Delynea Blessett Graphic Design 2 4250  

E-Print Network [OSTI]

Delynea Blessett Graphic Design 2 4250 Sept 6, 2012 Primer Project Practice #12;Primes, projects, and practices are things that designers should know about. The primer chosen that I think designers should know about is a text called Graphic Design: Fine Art or Social Science? As a designer I struggle

Berdichevsky, Victor

37

Look at the trends in business graphics  

SciTech Connect (OSTI)

Imagine the possibilities of artificial intelligence combined with animated graphics. More realistically the authors examine certain trends in computer graphics and follow them through to their logical extension in about five years. Predictions include voice activated systems with Icon symbols to enhance communication with applications in production control and a number of business functions.

Jarrett, I.M.; Putnam, L.

1983-02-01T23:59:59.000Z

38

Quantum Graphical Models and Belief Propagation  

SciTech Connect (OSTI)

Belief Propagation algorithms acting on Graphical Models of classical probability distributions, such as Markov Networks, Factor Graphs and Bayesian Networks, are amongst the most powerful known methods for deriving probabilistic inferences amongst large numbers of random variables. This paper presents a generalization of these concepts and methods to the quantum case, based on the idea that quantum theory can be thought of as a noncommutative, operator-valued, generalization of classical probability theory. Some novel characterizations of quantum conditional independence are derived, and definitions of Quantum n-Bifactor Networks, Markov Networks, Factor Graphs and Bayesian Networks are proposed. The structure of Quantum Markov Networks is investigated and some partial characterization results are obtained, along the lines of the Hammersley-Clifford theorem. A Quantum Belief Propagation algorithm is presented and is shown to converge on 1-Bifactor Networks and Markov Networks when the underlying graph is a tree. The use of Quantum Belief Propagation as a heuristic algorithm in cases where it is not known to converge is discussed. Applications to decoding quantum error correcting codes and to the simulation of many-body quantum systems are described.

Leifer, M.S. [Institute for Quantum Computing, University of Waterloo, 200 University Avenue West, Waterloo Ont., N2L 3G1 (Canada); Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo Ont., N2L 2Y5 (Canada)], E-mail: matt@mattleifer.info; Poulin, D. [Center for the Physics of Information, California Institute of Technology, 1200 E. California Boulevard, 107-81, Pasadena, CA 91125 (United States)], E-mail: dpoulin@ist.caltech.edu

2008-08-15T23:59:59.000Z

39

Modeling a city poses a number of problems to computer graph-ics. Every urban area has a transportation network that follows  

E-Print Network [OSTI]

and power- ful tools [20, 27] and have been extensively used in the modeling of plant ecosystems described plan. The buildings appearances follow historical, aesthetic and statutory rules. To create a virtual and graphics power of todays hardware. The potential applications for a procedural creation range from research

O'Brien, James F.

40

Hades: The Construction of a Graphic Novel  

E-Print Network [OSTI]

33 Hades: The Construction of a Graphic Novel Bethany Christiansen Hades is a short graphic novel that reinterprets the sixth chapter of James Joyces Ulysses in light of Dantes Inferno. Descent into a pit, animal symbolism, guilt... acquaintance, Paddy Dignam. As they travel, Blooms convoluted internal narrative touches on subjects such as suicide, the death of his infant son, his estranged wife, and the many forms and consequences of death. I chose to do Hades as a graphic novel...

Christiansen, Bethany

2011-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

Spreadsheet graphics for curve sketching in mathematics  

Science Journals Connector (OSTI)

This paper focuses on one aspect of the recent developments in the use of technology in teaching mathematics -- the use of spreadsheet graphics to display problems visually, as well as numerically. Several applications and recent trends are discussed. ...

David S. Tucker

2002-10-01T23:59:59.000Z

42

1. GRAPHICS API EVOLUTION AND SHADING LANGUAGES  

E-Print Network [OSTI]

Starting late 1980s specialized 3D graphics hardware had been included in graphics workstations, in late 1990s almost every desktop PC had 3D graphics accelerator. At present time the GPU has become a standard part of any desktop or mobile computer system. Graphics APIs were developed in parallel with 3D hardware and from generation to generation they were absorbing all new features of hardware. Two major APIs OpenGL and DirectX have significant influence on GPU architecture development as well as GPU technology achievements introduce new functionality to those APIs. This presentation describes the latest history of API and GPU co-development based on personal experience.

Timour Paltashev

43

Graphic Standards Fermi National Accelerator Laboratory 2014  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

out to white. The logo must always have a crisp contrast with the background color or image. the height of the logomark of an inch wide " Graphic Standards Fermi...

44

Interactive Visual Histories for Vector Graphics  

E-Print Network [OSTI]

Presentation and graphics software enables users to experiment with variations of illustrations. They can revisit recent editing operations using the ubiquitous undo command, but they are limited to sequential exploration. ...

Scull, Craig

2009-06-24T23:59:59.000Z

45

Computation and graphics in mathematical research  

SciTech Connect (OSTI)

This report discusses: The description of the GANG Project and results for prior research; the center for geometry, analysis, numerics and graphics; description of GANG Laboratory; software development at GANG; and mathematical and scientific research activities.

Hoffman, D.A.; Spruck, J.

1992-08-13T23:59:59.000Z

46

Clean Cities: Clean Cities Logos, Graphics, and Photographs  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Logos, Graphics, and Logos, Graphics, and Photographs to someone by E-mail Share Clean Cities: Clean Cities Logos, Graphics, and Photographs on Facebook Tweet about Clean Cities: Clean Cities Logos, Graphics, and Photographs on Twitter Bookmark Clean Cities: Clean Cities Logos, Graphics, and Photographs on Google Bookmark Clean Cities: Clean Cities Logos, Graphics, and Photographs on Delicious Rank Clean Cities: Clean Cities Logos, Graphics, and Photographs on Digg Find More places to share Clean Cities: Clean Cities Logos, Graphics, and Photographs on AddThis.com... Coordinator Basics Outreach Logos, Graphics, & Photographs Print Products & Templates Exhibit Booths Presentations Videos QR Codes Tips Education & Webinars Meetings Reporting Contacts Clean Cities Logos, Graphics, and Photographs

47

Jordan and Weiss: Graphical Models: Probabilistic inference 1 Graphical models: Probabilistic inference  

E-Print Network [OSTI]

Jordan and Weiss: Graphical Models: Probabilistic inference 1 Graphical models: Probabilistic inference Michael I. Jordan jordan@cs.berkeley.edu Division of Computer Science and Department of Statistics. Jordan EECS Computer Science Division 387 Soda Hall # 1776 Berkeley, CA 94720-1776 Phone: (510) 642

Jordan, Michael I.

48

GIS, SPATIAL STATISTICAL GRAPHICS, AND FOREST HEALTH.  

E-Print Network [OSTI]

1 GIS, SPATIAL STATISTICAL GRAPHICS, AND FOREST HEALTH. James J. Majure, Noel Cressie, Dianne Cook, and Jürgen Symanzik ABSTRACT This paper discusses the use of a geographic information systems (GIS), Arcview, into a geographic information system (GIS), Arcview 2.1 (ESRI 1995), and its use in the statistical analysis of spa

Symanzik, Jürgen

49

An interactive graphics environment for architectural energy simulation  

Science Journals Connector (OSTI)

An interactive computer graphics system has been developed for the architecture profession which provides a design environment for the evaluation of building energy consumption. The system includes an integrated set of graphic input tools ...

Jon H. Pittman; Donald P. Greenberg

1982-07-01T23:59:59.000Z

50

Parallel processor-based raster graphics system architecture  

DOE Patents [OSTI]

An apparatus for generating raster graphics images from the graphics command stream includes a plurality of graphics processors connected in parallel, each adapted to receive any part of the graphics command stream for processing the command stream part into pixel data. The apparatus also includes a frame buffer for mapping the pixel data to pixel locations and an interconnection network for interconnecting the graphics processors to the frame buffer. Through the interconnection network, each graphics processor may access any part of the frame buffer concurrently with another graphics processor accessing any other part of the frame buffer. The plurality of graphics processors can thereby transmit concurrently pixel data to pixel locations in the frame buffer.

Littlefield, Richard J. (Seattle, WA)

1990-01-01T23:59:59.000Z

51

Networked Graphics: Building Networked Games and Virtual Environments  

Science Journals Connector (OSTI)

This broad-ranging book equips programmers and designers with a thorough grounding in the techniques used to create truly network-enabled computer graphics and games. Written for graphics/game/VE developers and students, it assumes no prior knowledge ... Keywords: Computer Animation, Computer Graphics, Computer Science, Computers, Game Programming, Interactive & Multimedia, Networking, Video & Electronic, Virtual Reality

Anthony Steed; Manuel Fradinho Oliveira

2009-11-01T23:59:59.000Z

52

Images / Graphics : BioEnergy Science Center  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Images / Graphics Images / Graphics Cellulosic Biofuel Production Steps and Biological Research Challenges Cellulosic Biofuel Production Steps and Biological Research Challenges This figure depicts some key processing steps in an artistâ€(tm)s conception of a future large-scale facility for transforming cellulosic biomass (plant fibers) into biofuels. Three areas where focused biological research can lead to much lower costs and increased productivity include developing crops dedicated to biofuel production (see step 1), engineering enzymes that deconstruct cellulosic biomass (see steps 2 and 3), and engineering microbes and developing new microbial enzyme systems for industrial-scale conversion of biomass sugars into ethanol and other biofuels or bioproducts (see step 4). Biological research challenges

53

Creative graphics | ENERGY STAR Buildings & Plants  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

How can we help you? How can we help you? » Communicate and educate » ENERGY STAR communications toolkit » Motivate with a competition » ENERGY STAR National Building Competition » Competitor resources » Creative graphics Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing buildings Commercial new construction Industrial energy management Small business Service providers Service and product providers Verify applications for ENERGY STAR certification Design commercial buildings Energy efficiency program administrators Commercial and industrial program sponsors Associations State and local governments Federal agencies Tools and resources Training In this section How can we help you? Build an energy program Improve building and plant performance

54

Security Policy Specification Using a Graphical Approach Page 1 Security Policy Specification Using a Graphical  

E-Print Network [OSTI]

Security Policy Specification Using a Graphical Approach Page 1 Security Policy Specification Using of California, Davis {hoagland,pandey,levitt}@cs.ucdavis.edu Technical Report CSE-98-3 A security policy states for organizations to declare their security policies, even informal state- ments would be better than the current

California at Davis, University of

55

Clean Cities: Clean Cities Logos, Graphics, and Photographs  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Logos, Graphics, and Photographs Logos, Graphics, and Photographs Clean Cities logos, graphics, and photos are available for use in outreach materials, such as presentations, posters, banners, and marketing publications. See also print products and templates. Appropriate Use If your outreach materials are not intended for lobbying or advocacy efforts, you may download the graphics below. These graphics may not be used for lobbying or advocacy efforts or to indicate affiliation with or endorsement by the U.S. Department of Energy (DOE), the Office of Energy Efficiency and Renewable Energy (EERE), or the Vehicle Technologies Office. Funding provided by the U.S. Department of Energy may not be used for any of these efforts. When in doubt, ask. Contact your regional manager to approve use of Clean Cities graphics with your organization's materials. Only designated coalitions may use the Clean Cities logo.

56

Top 5 Maps and Interactive Graphics of 2014  

Broader source: Energy.gov [DOE]

Here are our top five maps and interactive graphics from 2014. Explore space-based solar power, how much energy you consume, energy production and more.

57

A graphical operations interface for modular surface systems  

E-Print Network [OSTI]

This paper presents the design and implementation of algorithms for a new graphical operations interface system specifically adapted to operating modular reconfigurable articulated surface systems. Geometric models of ...

Vona, Marsette A.

58

To appear: M. I. Jordan, (Ed.), Learning in Graphical Models, Kluwer Academic Publishers.  

E-Print Network [OSTI]

To appear: M. I. Jordan, (Ed.), Learning in Graphical Models, Kluwer Academic Publishers. IMPROVING of California Santa Cruz, CA AND MICHAEL I. JORDAN Massachusetts Institute of Technology Cambridge, MA Abstract #12; 2 TOMMI S. JAAKKOLA AND MICHAEL I. JORDAN the essential Markov properties underlying the graph

Jordan, Michael I.

59

Graphical Economics Sham M. Kakade, Michael Kearns, and Luis E. Ortiz  

E-Print Network [OSTI]

. [2002] to non­linear utility functions; (3) an algorithm for computing equilibria in the graphical in which the graph is a tree (again permitting non­linear utility functions). We also highlight many through the model of Wald [1936] (see also Brainard and Scarf [2000]). A pinnacle of this line of work

Kakade, Sham M.

60

Probabilistic inference in graphical models Michael I. Jordan  

E-Print Network [OSTI]

Probabilistic inference in graphical models Michael I. Jordan jordan@cs.berkeley.edu Division in graphical models Correspondence: Michael I. Jordan EECS Computer Science Division 387 Soda Hall # 1776 Berkeley, CA 94720-1776 Phone: (510) 642-3806 Fax: (510) 642-5775 email: jordan@cs.berkeley.edu #12;Jordan

Chuang, Yung-Yu

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Teaching Image Computation: From Computer Graphics to Computer Vision  

E-Print Network [OSTI]

Teaching Image Computation: From Computer Graphics to Computer Vision Bruce A. Draper and J. Ross Beveridge Department of Computer Science Colorado State University Fort Collins, CO 80523 draper@cs.colostate.edu ross@cs.colostate.edu Keywords: Computer Vision, Computer Graphics, Education, Course Design

Draper, Bruce A.

62

Automating construction through the use of robotics and Graphical Programming  

SciTech Connect (OSTI)

Sandia has developed an advanced operational control system approach, called Graphical Programming, to design and operate robot systems in unstructured environments. This Graphical Programming approach produces robot systems that are faster to develop and use, safer in operation, and cheaper overall than altemative teleoperation or autonomous robot control systems. This approach uses 3-D visualization and simulation software with intuitive operator interfaces for the programming and control of complex robotic systems. Supervisor software modules allow an operator to command and simulate complex tasks in a graphic preview mode and, when acceptable, command the actual robots and monitor their motions with the graphic system. Graphical Programming Supervisors maintain registration with the real world and allow the robot to perform tasks that cannot be accurately represented with models alone by using a combination of model and sensor-based control. All of these capabilities when combined result in a flexible system which is readily able to meet the demands called for in construction automation. This paper describes the Graphical Programming approach, several example control systems that use Graphical Programming, key features necessary for implementing successful Graphical Programming systems, and specific examples of applying these systems to robotic operations.

McDonald, M.J.; Palmquist, R.D.

1993-08-01T23:59:59.000Z

63

UCPNetworks: A Directed Graphical Representation of Conditional Utilities Craig Boutilier  

E-Print Network [OSTI]

UCP­Networks: A Directed Graphical Representation of Conditional Utilities Craig Boutilier@cs.bgu.ac.il Abstract We propose a directed graphical representation of util­ ity functions, called UCP­networks. The network de­ composes a utility function into a number of additive factors, with the directionality

Brafman, Ronen

64

Using Graphical Representations to Support the Calculation of Infusion Parameters  

E-Print Network [OSTI]

Using Graphical Representations to Support the Calculation of Infusion Parameters Sandy J. J. Gould in which participants were asked to solve a num- ber of infusion parameter problems that were represented representations transfer to actual workplace settings. Keywords: Graphical reasoning, infusion pumps, re

Subramanian, Sriram

65

Dynamic Decision Making for Graphical Models Applied to Oil Exploration  

E-Print Network [OSTI]

We present a framework for sequential decision making in problems described by graphical models. The setting is given by dependent discrete random variables with associated costs or revenues. In our examples, the dependent variables are the potential outcomes (oil, gas or dry) when drilling a petroleum well. The goal is to develop an optimal selection strategy that incorporates a chosen utility function within an approximated dynamic programming scheme. We propose and compare different approximations, from simple heuristics to more complex iterative schemes, and we discuss their computational properties. We apply our strategies to oil exploration over multiple prospects modeled by a directed acyclic graph, and to a reservoir drilling decision problem modeled by a Markov random field. The results show that the suggested strategies clearly improve the simpler intuitive constructions, and this is useful when selecting exploration policies.

Martinelli, Gabriele; Hauge, Ragnar

2012-01-01T23:59:59.000Z

66

FASTPLOT: An interface to Microsoft{reg_sign} FORTRAN graphics  

SciTech Connect (OSTI)

Interface routines to the Microsoft{reg_sign} FORTRAN graphics library (GRAPHICS.LIB) are provided to facilitate development of graphics codes. These routines are collected into the FASTPLOT library (FASTPLOT.LIB). The FASTPLOT routines simplified the development of applications utilizing graphics and add capabilities not available in GRAPHICS.LIB such as plotting histograms, splines, symbols, and error bars. Specifically, these routines were utilized in the development of the mortality data viewing code, MORTVIEW, for the US Environmental Protection Agency. Routines for color imaging, developed for use with the X-ray Computer Tomography (XCT) imaging code, and examples are also provided in the FASTPLOT library. Many example uses of FASTPLOT.LIB are contained in this document to facilitate applications development. The FASTPLOT.LIB library, source, and applications programs are supplied on the accompanying FASTPLOT diskette.

Ward, R.C.

1994-03-01T23:59:59.000Z

67

Campus Recreation Graphic Design Internship The Campus Recreation Graphic Design Internship program is designed to enhance your  

E-Print Network [OSTI]

Campus Recreation Graphic Design Internship The Campus Recreation Graphic Design Internship program the needs of the intern/practicum students, UML Campus Recreation experiences are flexible. Positions and a positive attitude. All intern/practicum students are representatives of the Department of Campus Recreation

Massachusetts at Lowell, University of

68

Computer Vision, Graphics, and Image Processing 40 (1987) 250-266 1 Computer Vision, Graphics, and Image Processing 40 (1987) 250-266 2  

E-Print Network [OSTI]

Computer Vision, Graphics, and Image Processing 40 (1987) 250-266 1 #12;Computer Vision, Graphics, and Image Processing 40 (1987) 250-266 2 #12;Computer Vision, Graphics, and Image Processing 40 (1987) 250-266 3 #12;Computer Vision, Graphics, and Image Processing 40 (1987) 250-266 4 #12;Computer Vision

Murray, David

69

SSC lattice database and graphical interface  

SciTech Connect (OSTI)

When completed the Superconducting Super Collider will be the world's largest accelerator complex. In order to build this system on schedule, the use of database technologies will be essential. In this paper we discuss one of the database efforts underway at the SSC, the lattice database. The SSC lattice database provides a centralized source for the design of each major component of the accelerator complex. This includes the two collider rings, the High Energy Booster, Medium Energy Booster, Low Energy Booster, and the LINAC as well as transfer and test beam lines. These designs have been created using a menagerie of programs such as SYNCH, DIMAD, MAD, TRANSPORT, MAGIC, TRACE3D AND TEAPOT. However, once a design has been completed, it is entered into a uniform database schema in the database system. In this paper we discuss the reasons for creating the lattice database and its implementation via the commercial database system SYBASE. Each lattice in the lattice database is composed of a set of tables whose data structure can describe any of the SSC accelerator lattices. In order to allow the user community access to the databases, a programmatic interface known as dbsf (for database to several formats) has been written. Dbsf creates ascii input files appropriate to the above mentioned accelerator design programs. In addition it has a binary dataset output using the Self Describing Standard data discipline provided with the Integrated Scientific Tool Kit software tools. Finally we discuss the graphical interfaces to the lattice database. The primary interface, known as OZ, is a simulation environment as well as a database browser.

Trahern, C.G.; Zhou, J.

1991-11-01T23:59:59.000Z

70

Property:Integrated Display/Graphics | Open Energy Information  

Open Energy Info (EERE)

Display/Graphics Display/Graphics Jump to: navigation, search Property Name Integrated Display/Graphics Property Type Text Pages using the property "Integrated Display/Graphics" Showing 22 pages using this property. A Alden Large Flume + Lab View, Test Point Alden Small Flume + Lab View, Test Point Alden Tow Tank + Lab View, Test Point Alden Wave Basin + Lab View, Test Point B Bucknell Hydraulic Flume + Microsoft Windows based systems C Conte Large Flume + Conventional PC and video displays; TecPlot Conte Small Flume + Conventional PC and video displays; TecPlot D Davidson Laboratory Tow Tank + Standard PC-based tools H Haynes Tow Tank + National Instruments LabView Haynes Wave Basin + National Instruments LabView Hinsdale Wave Basin 1 + Remote telepresence and experiment participation as part of George E. Brown Jr. Network for Earthquake Engineering Simulation (NEES)

71

The SFC editor a graphical tool for algorithm development  

Science Journals Connector (OSTI)

This paper describes The SFC Editor, a graphical algorithm development tool for both beginning and advanced programmers. Flowcharts have long been used by programmers as a format for designing and visualizing the logic of an algorithm. Since drawing ...

Tia Watts

2004-12-01T23:59:59.000Z

72

Causal Discovery for Climate Research Using Graphical Models  

Science Journals Connector (OSTI)

Causal discovery seeks to recover causeeffect relationships from statistical data using graphical models. One goal of this paper is to provide an accessible introduction to causal discovery methods for climate scientists, with a focus on ...

Imme Ebert-Uphoff; Yi Deng

2012-09-01T23:59:59.000Z

73

The incorporation of bubbles into a computer graphics fluid simulation  

E-Print Network [OSTI]

We present methods for incorporating bubbles into a photorealistc fluid simulation. Previous methods of fluid simulation in computer graphics do not include bubbles. Our system automatically creates bubbles, which are simulated on top of the fluid...

Greenwood, Shannon Thomas

2005-08-29T23:59:59.000Z

74

Using graphical representation of user interfaces as visual references  

E-Print Network [OSTI]

My thesis investigates using a graphical representation of user interfaces - screenshots - as a direct visual reference to support various kinds of applications. We have built several systems to demonstrate and validate ...

Zhang, Zongxiang

2012-01-01T23:59:59.000Z

75

Light & Skin Interactions: Simulations for Computer Graphics Applications  

Science Journals Connector (OSTI)

Light & Skin Interactions immerses you in one of the most fascinating application areas of computer graphics: appearance simulation. The book first illuminates the fundamental biophysical processes that affect skin appearance, and reviews seminal ...

Gladimir V. G. Baranoski; Aravind Krishnaswamy

2010-05-01T23:59:59.000Z

76

Usability and Security of Gaze-Based Graphical Grid Passwords  

Science Journals Connector (OSTI)

We present and analyze several gaze-based graphical password schemes based on recall and cued-recall of grid points; eye-trackers are used to record ... that success rate and entry time for the grid-based schemes...

Majid Arianezhad; Douglas Stebila

2013-01-01T23:59:59.000Z

77

IMPROVISE: Automated Generation of Animated Graphics for Coordinated Multimedia Presentations  

Science Journals Connector (OSTI)

In this chapter, we describe a graphics generation system, Improvise (IllustrativeMetaphor PROduction in VISual Environments), focusing on how it can be used to design coordinated multimedia presentations. Improvise is a knowledge-based system that can ...

Michelle X. Zhou; Steven Feiner

1998-01-01T23:59:59.000Z

78

The Curl Graphics2d immediate mode rendering API  

E-Print Network [OSTI]

(cont.) 170 thousand lines of code in the Curl language. Morgan McGuire has worked on computer graphics and imaging at Morgan Systems, the NEC Research Institute and the IBM T. J. Watson Research Center. He is currently ...

McGuire, Morgan, 1976-

2000-01-01T23:59:59.000Z

79

High-Throughput Characterization of Porous Materials Using Graphics...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

High-Throughput Characterization of Porous Materials Using Graphics Processing Units Previous Next List J. Kim, R. L. Martin, O. Rubel, M. Haranczyk, and B. Smit, J. Chem. Theory...

80

The TV Turtle: A Logo Graphics System for Raster Displays  

E-Print Network [OSTI]

Until recently, most computer graphics systems have been oriented toward the display of line drawins, continually refreshing the screen from a display list of vectors. Developments such as plasma panel displays and ...

Lieberman, Henry

1976-06-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

Development of an embedded 3D graphics processor  

E-Print Network [OSTI]

DEVELOPMENT OF AN EMBEDDED 3D GRAPHICS PROCESSOR A Thesis by BRIAN MURRAY Submitted to the Office of Graduate Studies of Texas ARM University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE May 2002 Major... Subject: Computer Engineering DEVELOPMENT OF AN EMBEDDED 3D GRAPHICS PROCESSOR A Thesis by BRIAN MURRAY Submitted to Texas ASM University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE Approved as to style...

Murray, Brian

2012-06-07T23:59:59.000Z

82

Graphic profile In the event of problems of interpretation or differences between the Swedish and  

E-Print Network [OSTI]

profile? 1.1 Brand strategy 2 Basic concepts 2.1 The graphic profile ­ elements and rules 2.2 Name 2 and image. Our graphic profile and logotype comprise important parts of our communication. Background We. The graphic profile Our graphic profile is based on extensive work on our identity and image and helps us give

Johannesson, Henrik

83

High Performance Flow Simulations on Graphics Processing Units  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

High Performance Flow Simulations on Graphics Processing Units High Performance Flow Simulations on Graphics Processing Units Speaker(s): Wangda Zuo Date: June 17, 2010 - 12:00pm Location: 90-3122 Seminar Host/Point of Contact: Michael Wetter Building design and operation often requires real-time or faster-than-real-time simulations for detailed information on air distributions. However, none of the current flow simulation techniques can satisfy this requirement. To solve this problem, a Fast Fluid Dynamics (FFD) model has been developed. The FFD can solve Navier-Stokes equations at a speed of 50 times faster than Computational Fluid Dynamics (CFD). In addition, the computing speed of the FFD program has been further enhanced up to 30 times by executing in parallel on a Graphics Processing Unit (GPU) instead of a Central Processing Unit (CPU). As a whole, the FFD on a GPU

84

Annual Energy Outlook 2010 with Projections to 2035-Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Annual Energy Outlook 2010 with Projections to 2035 - Graphic Data Annual Energy Outlook 2010 with Projections to 2035 - Graphic Data Annual Energy Outlook 2010 with Projections to 2035 Graphic Data Figure 1. U.S. primary energy consumption, 1980-2035 Figure 1 Data Figure 2. U.S. liquid fuels supply, 1970-2035 Figure 2 Data Figure 3. U.S. natural gas supply, 1990-2035 Figure 3 Data Figure 4. U.S. energy-related carbon dioxide emissions, 2008 and 2035 Figure 4 Data Figure 5. Projected average fleet-wide fuel economy and CO2-equivalent emissions compliance levels for passenger cars, model year 2016 Figure 5 Data Figure 6. Projected average fleet-wide fuel economy and CO2-equivalent emissions compliance levels for light trucks, model year 2016 Figure 6 Data Figure 7. Total energy consumption in three cases, 2005-2035 Figure 7 Data

85

Home Energy Score Interactive Graphic | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Home Energy Score Interactive Graphic Home Energy Score Interactive Graphic Home Energy Score Interactive Graphic The Home Energy Score is similar to a vehicle's mile-per-gallon rating. The Home Energy Score allows homeowners to compare the energy performance of their homes to other homes nationwide. It also provides homeowners with suggestions for improving their homes' efficiency. The process starts with a Home Energy Score Qualified Assessor collecting energy information during a brief home walk-through. Using the Home Energy Scoring Tool, the Qualified Assessor then scores the home on a scale of 1 to 10, with a score of 10 indicating that the home has excellent energy performance. A score of 1 indicates the home needs extensive energy improvements. In addition to providing the Score, the Qualified Assessor

86

Virtual Frog Dissection: Interactive 3D Graphics Via the Web  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Dissection: Interactive 3D Graphics Via the Web Dissection: Interactive 3D Graphics Via the Web David Robertson, William Johnston, and Wing Nip Imaging and Distributed Computing Group Lawrence Berkeley National Laboratory Published in Proceedings, The Second International WWW Conference '94: Mosaic and the Web, Chicago, IL (1994). Hyperlinks have been updated periodically to replace stale links. ABSTRACT We have developed a set of techniques for providing interactive 3D graphics via the World Wide Web (WWW) as part of the ``Whole Frog'' project [ 1 ]. We had three goals: (1) to provide K-12 biology students with the ability to explore the anatomy of a frog with a virtual dissection tool; (2) to show the feasibility of interactive visualization over the Web; and (3) to show the possibility for the Web and its associated browsers to be an

87

A graphical electromagnetic simulation laboratory for power systems engineering programs  

SciTech Connect (OSTI)

The recent availability of Electromagnetic Transient Programs with graphical front ends now makes it possible to put together models for circuits and systems in a manner similar to the connection of components in a laboratory. In the past, the non-graphical EMT Programs required considerable expertise in their use and thus distracted the students into the details or simulation. The introduction of a graphical simulation based laboratory into Undergraduate and Graduate Engineering Programs is presented, based on the PSCAD/EMTDC program. The philosophy behind the design of suitable example cases is presented within the framework of an Undergraduate Power Electronics Course, an HVdc Transmission Course and a course on Power System Protection.

Gole, A.M. [Univ. of Manitoba, Winnipeg, Manitoba (Canada)] [Univ. of Manitoba, Winnipeg, Manitoba (Canada); Nayak, O.B. [Manitoba HVDC Research Centre, Winnipeg, Manitoba (Canada)] [Manitoba HVDC Research Centre, Winnipeg, Manitoba (Canada); Sidhu, T.S.; Sachdev, M.S. [Univ. of Saskatchewan, Saskatoon, Saskatchewan (Canada)] [Univ. of Saskatchewan, Saskatoon, Saskatchewan (Canada)

1996-05-01T23:59:59.000Z

88

Rank/sparsity minimization and latent variable graphical model selection  

E-Print Network [OSTI]

Rank/sparsity minimization and latent variable graphical model selection Pablo A. Parrilo · Complication: latent variables · Rank/sparsity decomposition, and generalizations · Convex optimization cond. on other vars. 1 3 2 4 Sparse Low-rank Concentration matrix #12;Proposal for modeling · Decompose

Parrilo, Pablo A.

89

Graphical language for identification of control strategies allowing Demand Response  

E-Print Network [OSTI]

Graphical language for identification of control strategies allowing Demand Response David DA SILVA. This will allow the identification of the electric appliance availability for demand response control strategies to be implemented in terms of demand response for electrical appliances. Introduction An important part

Paris-Sud XI, Université de

90

CSc 155 Advanced Computer Graphics Fall 2013 Scott Gordon  

E-Print Network [OSTI]

the camera forward a small amount (i.e. in the N direction). S ­ move the camera backward a small amount (i.e1 CSc 155 ­ Advanced Computer Graphics Fall 2013 Scott Gordon Assignment # 2 ­ 3D Model Viewing DUE left"). D ­ move the camera a small amount in the positive U direction (also called "strafe right"). E

Gordon, Scott

91

Object-oriented graphical representations of complex patterns of evidence  

Science Journals Connector (OSTI)

......are represented in one diagram, the result can be...two graphical aids to handling complex mixed masses...are represented in one diagram, the result can be...area of research. What materials are available for analysis...are well-suited to handling large masses of evidence......

Amanda B. Hepler; A. Philip Dawid; Valentina Leucari

2007-01-01T23:59:59.000Z

92

Maritime Threat Detection Using Probabilistic Graphical Models Bryan Auslander1  

E-Print Network [OSTI]

Maritime Threat Detection Using Probabilistic Graphical Models Bryan Auslander1 , Kalyan Moy Gupta1.lastname@knexusresearch.com | david.aha@nrl.navy.mil Abstract Maritime threat detection is a challenging problem because maritime them on a threat recognition task using track data obtained from force protection naval exercises

Gupta, Kalyan Moy

93

Columbia Photographic Images and Photorealistic Computer Graphics Dataset  

E-Print Network [OSTI]

Columbia Photographic Images and Photorealistic Computer Graphics Dataset Tian-Tsong Ng, Shih Abstract Passive-blind image authentication is a new area of research. A suitable dataset. In response to the need for a new dataset, the Columbia Photographic Images and Photorealistic Computer

Chang, Shih-Fu

94

Simple Analytical and Graphical Tools for Carrier Based PWM Methods  

E-Print Network [OSTI]

energy conversion. Shown in Figure 1, the classical VSI generates a low frequency output voltage with conSimple Analytical and Graphical Tools for Carrier Based PWM Methods Ahmet M. Hava y Russel J tools for the study, performance evaluation, and design of the modern carrier based PWM methods which

Hava, Ahmet

95

CS-3388 Computer Graphics Fall 2014 Table of Contents  

E-Print Network [OSTI]

: A wire-mesh model of a once famous teapot #12;CS-3388 Computer Graphics Fall 2014 Representing Objects Illustration 1 shows a triangulation of 3D points that create a teapot. Various methods exist to define for the object. Illustration 2: A mirror-like rendering of the teapot Illustration 3: A rendering of the teapot

Beauchemin, Steven S.

96

The TV Turtle A Logo Graphics System for Raster Displays  

E-Print Network [OSTI]

The TV Turtle A Logo Graphics System for Raster Displays Henry Lieberman Logo Group MIT Artificial programming for raster and vector systems are illustrated with a description of the author's TV Turtle-like interactive programming language designed for use by kids, and is based on Logo's turtle geometry approach

Lieberman, Henry

97

A turtle in a fractal garden 1 Turtle Graphics  

E-Print Network [OSTI]

Chapter 5 A turtle in a fractal garden 1 Turtle Graphics Imagine you have a small turtle who". Imagine also that this turtle carries a pen (or just leaves a trail of green slime wherever he crawls| the pond he came out of was none too clean). As long as our turtle follows our commands without tiring, we

Sutherland, Scott

98

Foundations and Trends R Computer Graphics and Vision  

E-Print Network [OSTI]

at Berkeley, 627 Soda Hall, Berkeley, CA 94720-1776, USA, ravir@cs.berkeley.edu Abstract High quality image-based rendering. #12;1 Introduction High quality image synthesis is one of the oldest goals of computer graphics in sunlight, glossy reflections from a velvet cushion, and caustics from a wine- glass. Three decades

O'Brien, James F.

99

X-ray Diffraction Practicals 1 Graphics Programs  

E-Print Network [OSTI]

X-ray Diffraction Practicals 1 Graphics Programs that will read SHELX or CIF files J. Reibenspies, N. Bhuvanesh ver 1.0.0 #12;X-ray Diffraction Practicals 2 Free software. Gretep : Reads SHELX files shelx files or output thermal ellipsoid plots. http://www.umass.edu/microbio/rasmol/ #12;X-ray

Meagher, Mary

100

Niigata (Japan), July 18-20, 2007 Pierre Laforcade 1 Graphical representation of abstractGraphical representation of abstract  

E-Print Network [OSTI]

Niigata (Japan), July 18-20, 2007 Pierre Laforcade 1 Graphical representation of abstract (Japan), July 18-20, 2007 Pierre Laforcade 2 Outline 1. Research context 2. Experimentation: the UML4LD proposition 3. Summary and ongoing work #12;Niigata (Japan), July 18-20, 2007 Pierre Laforcade 3 Research

Laforcade, Pierre

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

StarLogo TNG : the convergence of graphical programming and text processing  

E-Print Network [OSTI]

StarLogo TNG is a robust graphical programming environment for secondary students. Despite the educational advantages of graphical programming, TNG has sustained criticism from some who object to the exclusion of a textual ...

McCaffrey, Corey (Corey Stanley Gordon)

2006-01-01T23:59:59.000Z

102

Graphical models and variational methods Zoubin Ghahramani and Matthew J. Beal  

E-Print Network [OSTI]

Graphical models and variational methods Zoubin Ghahramani and Matthew J. Beal Gatsby Computational://www.gatsby.ucl.ac.uk July, 2000 Ghahramani, Z. and Beal, M.J. (2000) Graphical models and variational methods. To appear

Ghahramani, Zoubin

103

Real-Time Visualization of Hydroelectric Project Based on Multilayer Object-Oriented Graphics Model  

Science Journals Connector (OSTI)

The objective of this paper is to realize the real-time visualization of hydroelectric project. Based on the object-oriented graphics modeling technology, we construct the three kinds of graphics models sorted by hierarchy---unit model, process model, ... Keywords: visualization, hydroelectric project, simulation, object-oriented graphics modeling technology, interaction

Yuan Huang; Xian-Jia Wang; Zhi-Xiu Cheng

2008-08-01T23:59:59.000Z

104

Experience With Top Gun Wingman: A Proxy-Based Graphical Web  

E-Print Network [OSTI]

Experience With Top Gun Wingman: A Proxy-Based Graphical Web Browser for the 3Com PalmPilot Armando and diverse applications. We describe one such application, Top Gun Wingman, a graphical, split Web browser) approach in the context of Top Gun Wingman, the world's first graphical Web browser for the 3Com Palm

Gribble, Steve

105

Assignment 2: Turtle Graphics Page 1 of 6 600.112: Introduction to Programming  

E-Print Network [OSTI]

Assignment 2: Turtle Graphics Page 1 of 6 600.112: Introduction to Programming for Scientists and Engineers Assignment 2: Turtle Graphics Peter H. Fr¨ohlich phf@cs.jhu.edu Joanne Selinski joanne programming. We will focus on drawing things on the screen using Python's Turtle Graphics module to make

Fröhlich, Peter

106

Assignment 2: Turtle Graphics Page 1 of 6 600.112: Introduction to Programming  

E-Print Network [OSTI]

Assignment 2: Turtle Graphics Page 1 of 6 600.112: Introduction to Programming for Scientists and Engineers Assignment 2: Turtle Graphics Peter H. Fr�ohlich phf@cs.jhu.edu Joanne Selinski joanne programming. We will focus on drawing things on the screen using Python's Turtle Graphics module to make

Fröhlich, Peter

107

Teaching Computational Thinking with L-Systems and Turtle Graphics Bruce A. Maxwell  

E-Print Network [OSTI]

Teaching Computational Thinking with L-Systems and Turtle Graphics Bruce A. Maxwell Colby College L graphics [1]. L-systems can produce strings that have a natural turtle graphics interpretation. L transformer module to interpret a string and execute turtle actions, including pushing and popping the turtle

Maxwell, Bruce

108

EIA - International Energy Outlook 2008-Highlights Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Graphic Data - Highlights Graphic Data - Highlights International Energy Outlook 2008 Figure 1. World Marketed Energy Consumption, 2005-2030 Figure 1 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 2. World Marketed Energy use by Fuel Type, 1980-2030 Figure 2 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 3. World Oil Prices in Two Cases, 1980-2030 Figure 3 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 4. World Liquids Production, 2005-2030 Figure 4 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 5. World Natural Gas Production, 2005-2030 Figure 5 Data. Need help, contact the National Energy Information Center at 202-586-8800.

109

EIA - International Energy Outlook 2007-Highlights Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Graphic Data - Highlights Graphic Data - Highlights International Energy Outlook 2007 Figure 1. World Marketed Energy Consumption by Region, 2004-2030 Figure 1 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 2. Average Annual Growth in Delivered Energy Consumption by Region and End-Use Sector, 2004-2030 Figure 2 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 3. Industrial Sector Delivered Energy Consumption by Region, 2004-2030 Figure 3 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 4. World Marketed Energy Use by Fuel Type, 1980-2030 Figure 4 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 5. World Liquids Production, 2004-2030 Figure 5 Data. Need help, contact the National Energy Information Center at 202-586-8800.

110

SRF Test Areas Cryogenic System Controls Graphical User Interface  

SciTech Connect (OSTI)

Fermi National Accelerator Laboratory has constructed a superconducting 1.3 GHz cavity test facility at Meson Detector Building (MDB) and a superconducting 1.3 GHz cryomodule test facility located at the New Muon Lab Building (NML). The control of these 2K cryogenic systems is accomplished by using a Synoptic graphical user interface (GUI) to interact with the underlying Fermilab Accelerator Control System. The design, testing and operational experience of employing the Synoptic client-server system for graphical representation will be discussed. Details on the Synoptic deployment to the MDB and NML cryogenic sub-systems will also be discussed. The implementation of the Synoptic as the GUI for both NML and MDB has been a success. Both facilities are currently fulfilling their individual roles in SCRF testing as a result of successful availability of the cryogenic systems. The tools available for creating Synoptic pages will continue to be developed to serve the evolving needs of users.

DeGraff, B.D.; Ganster, G.; Klebaner, A.; Petrov, A.D.; Soyars, W.M.; /Fermilab

2011-06-09T23:59:59.000Z

111

High-performance dynamic quantum clustering on graphics processors  

SciTech Connect (OSTI)

Clustering methods in machine learning may benefit from borrowing metaphors from physics. Dynamic quantum clustering associates a Gaussian wave packet with the multidimensional data points and regards them as eigenfunctions of the Schroedinger equation. The clustering structure emerges by letting the system evolve and the visual nature of the algorithm has been shown to be useful in a range of applications. Furthermore, the method only uses matrix operations, which readily lend themselves to parallelization. In this paper, we develop an implementation on graphics hardware and investigate how this approach can accelerate the computations. We achieve a speedup of up to two magnitudes over a multicore CPU implementation, which proves that quantum-like methods and acceleration by graphics processing units have a great relevance to machine learning.

Wittek, Peter, E-mail: peterwittek@acm.org [Swedish School of Library and Information Science, University of Boras, Boras (Sweden)] [Swedish School of Library and Information Science, University of Boras, Boras (Sweden)

2013-01-15T23:59:59.000Z

112

A Comparison of Graphical Techniques for Asymmetric Decision Problems  

E-Print Network [OSTI]

, and Matheson?s (SHM) (1993) influence dia- grams (IDs), Shenoy?s (1993b, 1996) valuation networks (VNs), and Covaliu and Oliver?s (1995) sequential decision diagrams (SDDs). We focus our attention on techniques designed for asymmetric decision problems. In a... chance and decision variables. Each technique has a distinct way of encoding asymmetry. DTs encode asymmetry through the use of scenarios. IDs encode asymmetry using graphical structures called ?distribution trees.? VNs encode asymmetry using functions...

Bielza, Concha; Shenoy, Prakash P.

1999-11-01T23:59:59.000Z

113

Graphical Contingency Analysis for the Nation's Electric Grid  

ScienceCinema (OSTI)

PNNL has developed a new tool to manage the electric grid more effectively, helping prevent blackouts and brownouts--and possibly avoiding millions of dollars in fines for system violations. The Graphical Contingency Analysis tool monitors grid performance, shows prioritized lists of problems, provides visualizations of potential consequences, and helps operators identify the most effective courses of action. This technology yields faster, better decisions and a more stable and reliable power grid.

Zhenyu (Henry) Huang

2012-12-31T23:59:59.000Z

114

A hybrid fluid simulation on the Graphics Processing Unit (GPU)  

E-Print Network [OSTI]

and Computer Graphics. 2 (a) Grid-based (b) Particle-based Fig. 1. Two types of uid simulation. everywhere throughout the uid. Also, particle-based methods can run into stability problems when trying to enforce incompressibility. It is possible to use exact.... In this particular term, it is the uid momentum which is being advected. The mass conservation equation (Equation 2.2) is responsible for enforcing in- compressibility of the uid. It states that the divergence of the uid must be zero everywhere in the uid. One...

Flannery, Rebecca Lynn

2008-10-10T23:59:59.000Z

115

Development of a real time graphical display for an FMS  

E-Print Network [OSTI]

(Single Board Computer) which, in turn, is controlled by a Motorola VME-10 super-microcomputer acting as supervisor. For more information about the current FMS, see the report by Lim and Sal im [5]. The proposed system will contain all of the present... will be sent to the VME-10 which will then download the appropriate program to the individual SBC's for execution. The graphics package will interface with the VAX to provide information to a distant user. Figure 1. I shows the hierarchical arrangement...

Jones, Thomas Hal

2012-06-07T23:59:59.000Z

116

A graphical user interface for knowledge-based control  

E-Print Network [OSTI]

Meta- Controller OUTER LOOP Graphical Ustsr User' , I/O Interface Computer Simulation Knowledge-based Processor Figure 3. Architecture (GUI) for a knowledge-based controller. The objective of the research effort is to produce an object-oriented... cruising to landing. However, in the interest of simulation simplicity, no models were designed to handle turning of the aircraft. Because the simulation ~a& 4m so MACH =m AS ~Z25 160 ~', PO ISO l I~it 20 l. e 22 ENGINE 2l Ezz oaz o. e 12 IO...

Russell, Paul Joseph

2012-06-07T23:59:59.000Z

117

The Not So ShortThe Not So ShortThe Not So ShortThe Not So Short Introduction to Programming Graphical User InterfacesIntroduction to Programming Graphical User InterfacesIntroduction to Programming Graphical User InterfacesIntroduction to Programming Gra  

E-Print Network [OSTI]

Graphical User InterfacesIntroduction to Programming Graphical User InterfacesIntroduction to Programming Graphical User InterfacesIntroduction to Programming Graphical User Interfaces inininin Visual C++Visual C [yonas@cs.sfu.ca] [yonas.t@gmail.com] July 25th 2006 This document originally developed while I

Zhang, Richard "Hao"

118

A Graphic Representation of States for Quantum Copying Machines  

E-Print Network [OSTI]

The aim of this paper is to introduce a new graphic representation of quantum states by means of a specific application: the analysis of two models of quantum copying machines. The graphic representation by diagrams of states offers a clear and detailed visualization of quantum information's flow during the unitary evolution of not too complex systems. The diagrams of states are exponentially more complex in respect to the standard representation and this clearly illustrates the discrepancy of computational power between quantum and classical systems. After a brief introductive exposure of the general theory, we present a constructive procedure to illustrate the new representation by means of concrete examples. Elementary diagrams of states for single-qubit and two-qubit systems and a simple scheme to represent entangled states are presented. Quantum copying machines as imperfect cloners of quantum states are introduced and the quantum copying machines of Griffiths and Niu and of Buzek and Hillery are analyzed, determining quantum circuits of easier interpretation. The method has indeed shown itself to be extremely successful for the representation of the involved quantum operations and it has allowed to point out the characteristic aspects of the quantum computations examined.

Sara Felloni; Giuliano Strini

2006-09-29T23:59:59.000Z

119

E-Print Network 3.0 - activity graphical profiles Sample Search...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

3.3 Via Irix graphical... SupportPartner') 4. Change the default password 5. Enter customer profile data Click on Customer ... Source: Frandsen, Sren - Institut for...

120

Real-space calculation of powder diffraction patterns on graphics processing units  

Science Journals Connector (OSTI)

This paper shows how the power of graphics processing units can be exploited to compute the powder diffraction pattern of nano-sized objects.

Gelisio, L.

2010-04-30T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

MATLAB muliplatform research license: Numeric computation, advanced graphics and visualization, and a high-level programming  

E-Print Network [OSTI]

MATLAB muliplatform research license: Numeric computation, advanced graphics and visualization license allows research and includes the following: Feature # of users MATLAB 7 Simulink 6 Control System

Dawson, Jeff W.

122

E-Print Network 3.0 - applications pacific graphics Sample Search...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Page: << < 1 2 3 4 5 > >> 1 Migration Trends of Striped Marlin (Tetrapturus audax) in the Pacific Ocean Summary: geo- graphical areas of the Pacific. A hypothesisdescribing the...

123

E-Print Network 3.0 - alternative graphical displays Sample Search...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Technologies and Information Sciences 68 EDONAHMI Modelling of Advanced Automotive Interfaces S. Boisgerault1 Summary: -end graphic platforms - typically TFT-LCD, full-color...

124

Annual Energy Outlook 2009 with Projections to 2030-Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Annual Energy Outlook 2009 with Projections to 2030 Annual Energy Outlook 2009 with Projections to 2030 Annual Energy Outlook 2009 with Projections to 2030 Graphic Data Figure 1. Total liquid fuels demand by sector Figure 1 Data Figure 2. Total natural gas supply by source Figure 2 Data Figure 3. New light-duty vehicle sales shares by type Figure 3 Data Figure 4. Proposed CAFE standards for passenger cars by vehicle footprint, model years 2011-2015 Figure 4 Data Figure 5. Proposed CAFE standards for light trucks by vehicle footprint, model years 2011-2015 Figure 5 Data Figure 6. Average fuel economy of new light-duty vehicles in the AEO2008 and AEO2009 projections, 1995-2030 Figure 6 Data Figure 7. Value of fuel saved by a PHEV compared with a conventional ICE vehicle over the life of the vehicles, by gasoline price and PHEV all-electric driving range

125

SPIKY: A graphical user interface for monitoring spike train synchrony  

E-Print Network [OSTI]

Techniques for recording large-scale neuronal spiking activity are developing very fast. This leads to an increasing demand for algorithms capable of analyzing large amounts of experimental spike train data. One of the most crucial and demanding tasks is the identification of similarity patterns with a very high temporal resolution and across different spatial scales. To address this task, in recent years three time-resolved measures of spike train synchrony have been proposed, the ISI-distance, the SPIKE-distance, and event synchronization. The Matlab source codes for calculating and visualizing these measures have been made publicly available. However, due to the many different possible representations of the results the use of these codes is rather complicated and their application requires some basic knowledge of Matlab. Thus it became desirable to provide a more user-friendly and interactive interface. Here we address this need and present SPIKY, a graphical user interface which facilitates the applicati...

Bozanic, Nebojsa

2014-01-01T23:59:59.000Z

126

Implementing wide baseline matching algorithms on a graphics processing unit.  

SciTech Connect (OSTI)

Wide baseline matching is the state of the art for object recognition and image registration problems in computer vision. Though effective, the computational expense of these algorithms limits their application to many real-world problems. The performance of wide baseline matching algorithms may be improved by using a graphical processing unit as a fast multithreaded co-processor. In this paper, we present an implementation of the difference of Gaussian feature extractor, based on the CUDA system of GPU programming developed by NVIDIA, and implemented on their hardware. For a 2000x2000 pixel image, the GPU-based method executes nearly thirteen times faster than a comparable CPU-based method, with no significant loss of accuracy.

Rothganger, Fredrick H.; Larson, Kurt W.; Gonzales, Antonio Ignacio; Myers, Daniel S.

2007-10-01T23:59:59.000Z

127

Graphics processing units accelerated semiclassical initial value representation molecular dynamics  

SciTech Connect (OSTI)

This paper presents a Graphics Processing Units (GPUs) implementation of the Semiclassical Initial Value Representation (SC-IVR) propagator for vibrational molecular spectroscopy calculations. The time-averaging formulation of the SC-IVR for power spectrum calculations is employed. Details about the GPU implementation of the semiclassical code are provided. Four molecules with an increasing number of atoms are considered and the GPU-calculated vibrational frequencies perfectly match the benchmark values. The computational time scaling of two GPUs (NVIDIA Tesla C2075 and Kepler K20), respectively, versus two CPUs (Intel Core i5 and Intel Xeon E5-2687W) and the critical issues related to the GPU implementation are discussed. The resulting reduction in computational time and power consumption is significant and semiclassical GPU calculations are shown to be environment friendly.

Tamascelli, Dario; Dambrosio, Francesco Saverio [Dipartimento di Fisica, Universit degli Studi di Milano, via Celoria 16, 20133 Milano (Italy)] [Dipartimento di Fisica, Universit degli Studi di Milano, via Celoria 16, 20133 Milano (Italy); Conte, Riccardo [Department of Chemistry and Cherry L. Emerson Center for Scientific Computation, Emory University, Atlanta, Georgia 30322 (United States)] [Department of Chemistry and Cherry L. Emerson Center for Scientific Computation, Emory University, Atlanta, Georgia 30322 (United States); Ceotto, Michele, E-mail: michele.ceotto@unimi.it [Dipartimento di Chimica, Universit degli Studi di Milano, via Golgi 19, 20133 Milano (Italy)] [Dipartimento di Chimica, Universit degli Studi di Milano, via Golgi 19, 20133 Milano (Italy)

2014-05-07T23:59:59.000Z

128

StatREC: a graphical user interface tool for visual hypothesis testing of cost prediction models  

Science Journals Connector (OSTI)

Background: During the previous decades there has been noted a significantly increased research interest on the construction of prediction models for accurate estimation of software cost. Despite the development of sophisticated methodologies, ... Keywords: REC curves, graphical comparison, graphical user interface, permutation test, prediction models, software cost estimation

Nikolaos Mittas; Ioannis Mamalikidis; Lefteris Angelis

2012-09-01T23:59:59.000Z

129

Using Imported Graphics in LATEX and pdfLATEX Keith Reckdahl  

E-Print Network [OSTI]

historical information and describes basic LATEX terminol- ogy. It also · The Encapsulated PostScript (eps) format, differences between eps and ps files, and methods for converting non-eps graphics to eps://www.latex-project.org/lppl/ for the details of the LPPL license. 1 #12;· Compressed eps files and non-eps graphic formats (tiff, gif, jpeg

Chapman, Robin

130

Hidden Costs of Graphical User Interfaces: Failure to Make the Transition from Menus and Icon  

E-Print Network [OSTI]

Hidden Costs of Graphical User Interfaces: Failure to Make the Transition from Menus and Icon of Psychology Rice University Graphical interfaces allow users to issue commands using pull-down menus, icon toolbars, and keyboard shortcuts. Menus and icon toolbars are easier to learn, whereas keyboard shortcuts

Lane, David

131

BFA IN STUDIO ART Area of Emphasis: Graphic Design Suggested 4 Year Curriculum  

E-Print Network [OSTI]

Major Studio 51 Hours Art History 9 Hours Total 121 Hours First semester Area Hours Must Second semesterBFA IN STUDIO ART Area of Emphasis: Graphic Design Suggested 4 Year Curriculum revised 09/11 SECOND YEAR First semester Area Hours Must Second semester Area Hours ARGD 2010 Graphics Survey VI 3 Pass ARGD

Arnold, Jonathan

132

UCP-Networks: A Directed Graphical Representation of Conditional Utilities Craig Boutilier  

E-Print Network [OSTI]

UCP-Networks: A Directed Graphical Representation of Conditional Utilities Craig Boutilier@cs.bgu.ac.il Abstract We propose a directed graphical representation of util- ity functions, called UCP-networks. The network de- composes a utility function into a number of additive factors, with the directionality

Boutilier, Craig

133

Computer graphics, interactive technologies and collaborative learning synergy supporting individuals' skills development  

Science Journals Connector (OSTI)

In this paper, we describe work carried out using the synergy of interactive technologies, computer graphics and collaborative learning to improve educators and students' knowledge of basic education by supporting interdisciplinary work.Through direct ... Keywords: education, hypermedia, interactive graphics, literacy, social inclusion, virtual reality

Jorge Ferreira Franco; Sandra Regina da Cruz; Roseli de Deus Lopes

2006-07-01T23:59:59.000Z

134

Turtle Geometry in Computer Graphics and Computer Aided Design Ron Goldman, Scott Schaefer, Tao Ju  

E-Print Network [OSTI]

Turtle Geometry in Computer Graphics and Computer Aided Design Ron Goldman, Scott Schaefer, Tao Ju@cs.rice.edu, sschaefe@rice.edu, jutao@cs.rice.edu Abstract: LOGO is a programming language incorporating turtle graphics, relaxation methods and subdivision schemes from elementary notions in turtle geometry and turtle programming

Schaefer, Scott

135

Application Protocol, Initial Graphics Exchange Specification (IGES), Layered Electrical Product  

SciTech Connect (OSTI)

An application protocol is an information systems engineering view of a specific product The view represents an agreement on the generic activities needed to design and fabricate the product the agreement on the information needed to support those activities, and the specific constructs of a product data standard for use in transferring some or all of the information required. This application protocol describes the data for electrical and electronic products in terms of a product description standard called the Initial Graphics Exchange Specification (IGES). More specifically, the Layered Electrical Product IGES Application Protocol (AP) specifies the mechanisms for defining and exchanging computer-models and their associated data for those products which have been designed in two dimensional geometry so as to be produced as a series of layers in IGES format The AP defines the appropriateness of the data items for describing the geometry of the various parts of a product (shape and location), the connectivity, and the processing and material characteristics. Excluded is the behavioral requirements which the product was intended to satisfy, except as those requirements have been recorded as design rules or product testing requirements.

O`Connell, L.J. [ed.

1994-12-01T23:59:59.000Z

136

A Gaussian graphical model approach to climate networks  

SciTech Connect (OSTI)

Distinguishing between direct and indirect connections is essential when interpreting network structures in terms of dynamical interactions and stability. When constructing networks from climate data the nodes are usually defined on a spatial grid. The edges are usually derived from a bivariate dependency measure, such as Pearson correlation coefficients or mutual information. Thus, the edges indistinguishably represent direct and indirect dependencies. Interpreting climate data fields as realizations of Gaussian Random Fields (GRFs), we have constructed networks according to the Gaussian Graphical Model (GGM) approach. In contrast to the widely used method, the edges of GGM networks are based on partial correlations denoting direct dependencies. Furthermore, GRFs can be represented not only on points in space, but also by expansion coefficients of orthogonal basis functions, such as spherical harmonics. This leads to a modified definition of network nodes and edges in spectral space, which is motivated from an atmospheric dynamics perspective. We construct and analyze networks from climate data in grid point space as well as in spectral space, and derive the edges from both Pearson and partial correlations. Network characteristics, such as mean degree, average shortest path length, and clustering coefficient, reveal that the networks posses an ordered and strongly locally interconnected structure rather than small-world properties. Despite this, the network structures differ strongly depending on the construction method. Straightforward approaches to infer networks from climate data while not regarding any physical processes may contain too strong simplifications to describe the dynamics of the climate system appropriately.

Zerenner, Tanja, E-mail: tanjaz@uni-bonn.de [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany)] [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany); Friederichs, Petra; Hense, Andreas [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany) [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brhler Strae 7, 53119 Bonn (Germany); Lehnertz, Klaus [Department of Epileptology, University of Bonn, Sigmund-Freud-Strae 25, 53105 Bonn (Germany) [Department of Epileptology, University of Bonn, Sigmund-Freud-Strae 25, 53105 Bonn (Germany); Helmholtz Institute for Radiation and Nuclear Physics, University of Bonn, Nussallee 14-16, 53115 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brhler Strae 7, 53119 Bonn (Germany)

2014-06-15T23:59:59.000Z

137

Using Imported Graphics in L A T E X and pdfL A T E X Keith Reckdahl  

E-Print Network [OSTI]

. The Encapsulated PostScript (eps) format, di#erences between eps and ps files, and methods for converting non­eps graphics to eps. . The graphic formats that can be directly imported with pdfT E X (jpeg, png, pdf, Meta; . Compressed eps files and non­eps graphic formats (tiff, gif, jpeg, pict, etc.) can also be inserted on

Chapman, Robin

138

Quantitative genetic activity graphical profiles for use in chemical evaluation  

SciTech Connect (OSTI)

A graphic approach, terms a Genetic Activity Profile (GAP), was developed to display a matrix of data on the genetic and related effects of selected chemical agents. The profiles provide a visual overview of the quantitative (doses) and qualitative (test results) data for each chemical. Either the lowest effective dose or highest ineffective dose is recorded for each agent and bioassay. Up to 200 different test systems are represented across the GAP. Bioassay systems are organized according to the phylogeny of the test organisms and the end points of genetic activity. The methodology for producing and evaluating genetic activity profile was developed in collaboration with the International Agency for Research on Cancer (IARC). Data on individual chemicals were compiles by IARC and by the US Environmental Protection Agency (EPA). Data are available on 343 compounds selected from volumes 1-53 of the IARC Monographs and on 115 compounds identified as Superfund Priority Substances. Software to display the GAPs on an IBM-compatible personal computer is available from the authors. Structurally similar compounds frequently display qualitatively and quantitatively similar profiles of genetic activity. Through examination of the patterns of GAPs of pairs and groups of chemicals, it is possible to make more informed decisions regarding the selection of test batteries to be used in evaluation of chemical analogs. GAPs provided useful data for development of weight-of-evidence hazard ranking schemes. Also, some knowledge of the potential genetic activity of complex environmental mixtures may be gained from an assessment of the genetic activity profiles of component chemicals. The fundamental techniques and computer programs devised for the GAP database may be used to develop similar databases in other disciplines. 36 refs., 2 figs.

Waters, M.D. [Environmental Protection Agency, Washington, DC (United States); Stack, H.F.; Garrett, N.E.; Jackson, M.A. [Environmental Health Research and Testing, Inc., Research Triangle Park, NC (United States)

1990-12-31T23:59:59.000Z

139

FLOCKING-BASED DOCUMENT CLUSTERING ON THE GRAPHICS PROCESSING UNIT  

SciTech Connect (OSTI)

Analyzing and grouping documents by content is a complex problem. One explored method of solving this problem borrows from nature, imitating the fl ocking behavior of birds. Each bird represents a single document and fl ies toward other documents that are similar to it. One limitation of this method of document clustering is its complexity O(n2). As the number of documents grows, it becomes increasingly diffi cult to receive results in a reasonable amount of time. However, fl ocking behavior, along with most naturally inspired algorithms such as ant colony optimization and particle swarm optimization, are highly parallel and have experienced improved performance on expensive cluster computers. In the last few years, the graphics processing unit (GPU) has received attention for its ability to solve highly-parallel and semi-parallel problems much faster than the traditional sequential processor. Some applications see a huge increase in performance on this new platform. The cost of these high-performance devices is also marginal when compared with the price of cluster machines. In this paper, we have conducted research to exploit this architecture and apply its strengths to the document flocking problem. Our results highlight the potential benefi t the GPU brings to all naturally inspired algorithms. Using the CUDA platform from NVIDIA, we developed a document fl ocking implementation to be run on the NVIDIA GEFORCE 8800. Additionally, we developed a similar but sequential implementation of the same algorithm to be run on a desktop CPU. We tested the performance of each on groups of news articles ranging in size from 200 to 3,000 documents. The results of these tests were very signifi cant. Performance gains ranged from three to nearly fi ve times improvement of the GPU over the CPU implementation. This dramatic improvement in runtime makes the GPU a potentially revolutionary platform for document clustering algorithms.

Charles, J.S.; Patton, R.M.; Potok, T.E.; Cui, X.

2008-01-01T23:59:59.000Z

140

Computer Graphics Proceedings, Annual Conference Series, 2003 Animating Suspended Particle Explosions  

E-Print Network [OSTI]

Computer Graphics Proceedings, Annual Conference Series, 2003 Animating Suspended Particle products. Par- ticles immersed in the fluid track the motion of particulate fuel and soot.8 [Simulation and Modeling]: Types of Simulation--Animation 1 Introduction Although explosions are thankfully

O'Brien, James F.

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

Measuring the Effectiveness of the Graphical Communication of Hurricane Storm Surge Threat  

Science Journals Connector (OSTI)

Color is an important variable in the graphical communication of weather information. The effect of different colors on understanding and perception is not always considered prior to releasing an image to the public. This study tests the influence ...

Kathleen Sherman-Morris; Karla B. Antonelli; Carrick C. Williams

142

ModelicaML Graphical Modeling Environment Based on Eclipse MDT Papyrus.  

E-Print Network [OSTI]

?? The ModelicaML graphicalModeling Language and Modelica/UML profile is a language for the description of continuous-time and discrete-time/event-based system dynamics. Modelica ML uses Papyrus as (more)

Hakam, Imran

2011-01-01T23:59:59.000Z

143

Graphics-based site information management at Hanford TRU burial grounds  

SciTech Connect (OSTI)

The objective of the project described in this paper is to demonstrate the use of integrated computer graphics and database techniques in managing nuclear waste facilities. The graphics-based site information management system (SIMS) combines a three- dimensional graphic model of the facility with databases which describe the facility's components and waste inventory. The SIMS can create graphic visualization of any site data. The SIMS described here is being used by Westinghouse Hanford Company (WHC) as part of its transuranic (TRU) waste retrieval program at the Hanford Reservation. It is being used to manage an inventory of over 38,000 containers, to validate records, and to help visualize conceptual designs of waste retrieval operations.

Rod, S.R. (Pacific Northwest Lab., Washington, DC (United States))

1992-04-01T23:59:59.000Z

144

Graphics-based site information management at Hanford TRU burial grounds  

SciTech Connect (OSTI)

The objective of the project described in this paper is to demonstrate the use of integrated computer graphics and database techniques in managing nuclear waste facilities. The graphics-based site information management system (SIMS) combines a three- dimensional graphic model of the facility with databases which describe the facility`s components and waste inventory. The SIMS can create graphic visualization of any site data. The SIMS described here is being used by Westinghouse Hanford Company (WHC) as part of its transuranic (TRU) waste retrieval program at the Hanford Reservation. It is being used to manage an inventory of over 38,000 containers, to validate records, and to help visualize conceptual designs of waste retrieval operations.

Rod, S.R. [Pacific Northwest Lab., Washington, DC (United States)

1992-04-01T23:59:59.000Z

145

An interactive three-dimensional computer graphic simulation of the upper extremity  

E-Print Network [OSTI]

A three-dimensional computer graphic simulation which hics. allows for the arbitrary placement of axes of motion with respect to skeletal structures is described. The simulation, developed on a Sum UItraSPARC high performance workstation integrated...

Pickard, Julie Marie

1998-01-01T23:59:59.000Z

146

The web-based graphic service request system for facility management of apartments  

E-Print Network [OSTI]

This research investigates the feasibility of web technology as a means of handling service requests for delivering high quality service in building operation and maintenance. This research proposes a web-based graphic service request (WGSR) system...

Lee, Kwang Jun

2006-10-30T23:59:59.000Z

147

Three-dimensional range data compression using computer graphics rendering pipeline  

Science Journals Connector (OSTI)

This paper presents the idea of naturally encoding three-dimensional (3D) range data into regular two-dimensional (2D) images utilizing computer graphics rendering pipeline. The...

Zhang, Song

2012-01-01T23:59:59.000Z

148

The Application of Projected Conjugate Gradient Solvers on Graphical Processing Units  

E-Print Network [OSTI]

nearby slices. Keywords High Performance Computing, GPU, Krylov Subspace Meth- ods, Lanczos disciplines on the use of many-core based high performance computing (HPC) architectures. The NVIDIA graphical

Renaut, Rosemary

149

Graphical analysis of PTX relations in granulite facies metapelites  

Science Journals Connector (OSTI)

The study of the complex mineral reactions in metamorphic rocks is facilitated by graphical representation in the form of chemographic projections and phase diagrams. In this chapter we discuss and develop the...

B. J. Hensen; S. L. Harley

1990-01-01T23:59:59.000Z

150

Computation and graphics in mathematical research. Progress report, June 1, 1991--May 31, 1992  

SciTech Connect (OSTI)

This report discusses: The description of the GANG Project and results for prior research; the center for geometry, analysis, numerics and graphics; description of GANG Laboratory; software development at GANG; and mathematical and scientific research activities.

Hoffman, D.A.; Spruck, J.

1992-08-13T23:59:59.000Z

151

Trees and beyond : exploiting and improving tree-structured graphical models  

E-Print Network [OSTI]

Probabilistic models commonly assume that variables are independent of each other conditioned on a subset of other variables. Graphical models provide a powerful framework for encoding such conditional independence structure ...

Choi, Myung Jin, Ph. D. Massachusetts Institute of Technology

2011-01-01T23:59:59.000Z

152

SPARQLGraph: a web-based platform for graphically querying biological Semantic Web databases  

Science Journals Connector (OSTI)

Semantic Web has established itself as a framework for ... and database boundaries. Here, we present a web-based platform for querying biological Semantic Web databases in a graphical way.

Dominik Schweiger; Zlatko Trajanoski; Stephan Pabinger

2014-08-01T23:59:59.000Z

153

Final Report: Interactive Web Technologies for Dissemination of Scientific Graphics, September 2, 1998 - March 17, 1999  

SciTech Connect (OSTI)

An interactive software tool was developed to support the dissemination of scientific graphics. The technologies were developed both as a Java applet and stand-alone application and allow images to be disseminated as a data collection and an appearance script. Phase I efforts defined the model for the grahics tools. Software prototypes were constructed to test the utility of the graphics tool and refine the model.

Stone, Craig

1999-02-28T23:59:59.000Z

154

MATLAB GUI (Graphical User Interface) for the design of GRIN components for optical systems as an educational tool  

Science Journals Connector (OSTI)

New technologies and the available computing tools are becoming more important every day in the teaching evolution. The use of Graphical User Interfaces (GUI) with MATLAB enables the...

Gmez-Varela, A I; Bao-Varela, C

155

Learning Design based on Graphical Knowledge-By Gilbert Paquette, Michel Lonard, Karin Lundgren-Cayrol,  

E-Print Network [OSTI]

design components can guide the construction of learning designs and help to classify them, where knowledge and competencies, learning design and delivery models are constructed in an integrated1 Learning Design based on Graphical Knowledge- Modeling By Gilbert Paquette, Michel Léonard, Karin

Paris-Sud XI, Université de

156

A Graphical Framework for Spectrum Modeling and Decision Making in Cognitive Radio Networks  

E-Print Network [OSTI]

1 A Graphical Framework for Spectrum Modeling and Decision Making in Cognitive Radio Networks occupancies in cognitive radio networks. It is known that there exist correlations of spectrum occupancies for the inference and decision problems related to spectrum ac- tivities in cognitive radio networks. Bayesian

Qiu, Robert Caiming

157

Real-Time Robot Motion Planning Using Rasterizing Computer Graphics Hardware  

E-Print Network [OSTI]

Real-Time Robot Motion Planning Using Rasterizing Computer Graphics Hardware Jed Lengyel Mark Reichert Bruce R. Donaldy Donald P. Greenbergz Abstract We presenta real-time robot motion plannerthatis, and all paths returned are safe. The planner can handle any polyhedral geometry of robot and obstacles

Richardson, David

158

RealTime Robot Motion Planning Using Rasterizing Computer Graphics Hardware  

E-Print Network [OSTI]

Real­Time Robot Motion Planning Using Rasterizing Computer Graphics Hardware Jed Lengyel \\Lambda Mark Reichert \\Lambda Bruce R. Donald y Donald P. Greenberg z Abstract We present a real­time robot geometry of robot and obstacles, including disjoint and highly concave unions of polyhedra. The planner

Richardson, David

159

AutoCAD 2000 Tutor for Engineering Graphics, 1st edition  

Science Journals Connector (OSTI)

From the Publisher:At Autodesk Press we know that you want your books on AutoCAD out "fast and accurate". So, after rigorous peer and accuracy reviews, we are releasing the latest version of The AutoCAD Tutor for Engineering Graphics fully updated ...

Alan J. Kalameja

1999-08-01T23:59:59.000Z

160

Lessons Learned from Online Classification of Photo-Realistic Computer Graphics and Photographs  

E-Print Network [OSTI]

, readers can now take part in the quizzes 1 hosted by the 3D graphic com- pany Autodesk Alias (www.autodesk can be accessed from http://www.autodesk. com/eng/etc/fake_or_foto/index.html and http://www. autodesk

Chang, Shih-Fu

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

Symbolic Variable Elimination for Discrete and Continuous Graphical Models Scott Sanner  

E-Print Network [OSTI]

Symbolic Variable Elimination for Discrete and Continuous Graphical Models Scott Sanner NICTA & ANU, e.g., estimating the position and pose of entities from measurements in robotics, or radar track Intelligence (www.aaai.org). All rights reserved. n xx1 ...x2 d 10 d 0 100 P(d) = P(x |d) = d x i i Figure 1

Sanner, Scott

162

Fast analysis of molecular dynamics trajectories with graphics processing units--Radial distribution function histogramming  

E-Print Network [OSTI]

graphics processing units (GPUs). The algorithm features a tiling scheme to maximize the reuse of data on heterogeneous configurations of GPUs. Several versions of the RDF algorithm are presented, utilizing of the algorithm without atomic operations. The ulti- mate version of the algorithm running in parallel on four

Southern California, University of

163

Some Dynamic Graphics for Spatial Data (with Multiple Attributes) in a GIS  

E-Print Network [OSTI]

Some Dynamic Graphics for Spatial Data (with Multiple Attributes) in a GIS Dianne Cook 1 , Noel. This paper discusses some multivariate exploratory spatial data analy­ sis tools for detecting spatial. canonical correlations, correlation tour, exploratory spatial data anal­ ysis, spatial dependence, spatial

Symanzik, Jürgen

164

Some Dynamic Graphics for Spatial Data with Multiple Attributes in a GIS  

E-Print Network [OSTI]

Some Dynamic Graphics for Spatial Data with Multiple Attributes in a GIS Dianne Cook1, Noel Cressie discusses some multivariate exploratory spatial data analy- sis tools for detecting spatial dependence correlations, correlation tour, exploratory spatial data anal- ysis, spatial dependence, spatial statistics 1

Symanzik, Jürgen

165

Dynamic Graphics in a GIS: Exploring and An-alyzing Multivariate Spatial Data Using Linked  

E-Print Network [OSTI]

Dynamic Graphics in a GIS: Exploring and An- alyzing Multivariate Spatial Data Using Linked of the data set. Two examples of data that are inherently spatial can be seen in the next section: one information with the ground-based sample. Spatial data analysis is largely concerned with lookingfor trends

Symanzik, Jürgen

166

A Process for Anticipating and Executing Icon Selection in Graphical User Interfaces  

E-Print Network [OSTI]

A Process for Anticipating and Executing Icon Selection in Graphical User Interfaces David M. Lane presents a system for predicting the icon a user will select from an icon toolbar, based on command use that only predicted the most frequently used icon choices was better than one that predicted all choices

Lane, David

167

Protein Design by Mining and Sampling an Undirected Graphical Model of Evolutionary Constraints  

E-Print Network [OSTI]

Protein Design by Mining and Sampling an Undirected Graphical Model of Evolutionary Constraints and design conforming sequences. This paper develops such an approach for protein design: we first mine of sequences for further biological study. 1. INTRODUCTION Data mining techniques are now firmly established

168

Graphical Visualisation of Minimum Energy Requirements for Multi-Effect Distillation Arrangements  

E-Print Network [OSTI]

of Chemical Engineering, 7491 Trondheim, Norway Abstract The minimum energy requirements of six different heat1 Graphical Visualisation of Minimum Energy Requirements for Multi-Effect Distillation Arrangements energy-consuming process, where distillation is the process most widely used for fluid separations

Skogestad, Sigurd

169

Student Engagement and Enrollment Services -Office of Intercultural Relations (OIR) OIR Graphic Designer  

E-Print Network [OSTI]

, and more. The graphic designer is also responsible for maintaining the quality of the OIR brand. Ensure that maintain the positive image of OIR, its services and programming. Required hours 10-15 hours information on website for intercultural projects. o Develop the OIR brand. o Demonstrated photography skills

170

Scientific Visualization: An Experimental Introductory Graphics Course for Science and Engineering Students  

E-Print Network [OSTI]

in higher education. Rather than simply focusing on the instructional nuances of teaching Computer Aided as part of the Information Age in the late 20th century was the advent of affordable computer technology explored a much broader role of graphics in science and technology. A single section of the course

171

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS Visualization Task Performance with 2D, 3D,  

E-Print Network [OSTI]

when good viewing angles or measurement tools are available. For precise tasks in other situations--H.5.2 User Interfaces - Graphical User Interfaces (GUI), Screen Design, Evaluation/Methodology, I.3 and precise navigation and distance measurements (since only one dimension is ambiguous)[7],[9] whereas 3D

Tory, Melanie

172

User-friendly and intuitive graphical approach to the design of thermoelectric cooling systems  

E-Print Network [OSTI]

to examine and choose a thermo- electric module from catalogues to meet a specific cooling problem. To start Simon Lineykin*, Sam Ben-Yaakov Department of Electrical and Computer Engineering, Power Electronics-friendly graphical method for calculating the steady-state operational point of a thermoelectric cooler (TEC

173

A Simple and Intuitive Graphical Approach to the Design of Thermoelectric Cooling Systems  

E-Print Network [OSTI]

A Simple and Intuitive Graphical Approach to the Design of Thermoelectric Cooling Systems Simon, thermoelectric active cooling systems can help maintain electronic devices at a desired temperature condition and others. The method could help designers to examine and choose a thermoelectric module from catalogues

174

Phil Schniter The Ohio State University Turbo-AMP: A Graphical-Models  

E-Print Network [OSTI]

Phil Schniter The Ohio State University Turbo-AMP: A Graphical-Models Approach to Compressive) approximate message passing (AMP), (b) turbo-AMP. 4. Illustrative applications of turbo-AMP: (a) compressive (and expanding) range of problems, Yes! ­ Based on "belief propagation" or "message passing." 3 #12

Schniter, Philip

175

TEAPOT: A Toolset for Evaluating Performance, Power and Image Quality on Mobile Graphics Systems  

E-Print Network [OSTI]

TEAPOT: A Toolset for Evaluating Performance, Power and Image Quality on Mobile Graphics Systems present TEAPOT, a full system GPU sim- ulator, whose goal is to allow the evaluation of the GPUs metrics. Unlike prior GPU simulators, TEAPOT supports the OpenGL ES 1.1/2.0 API, so that it can simulate

Parcerisa, Joan-Manuel

176

A turtle in a fractal garden 4.1 Turtle Graphics  

E-Print Network [OSTI]

Chapter 4 A turtle in a fractal garden 4.1 Turtle Graphics Imagine you have a small turtle who left''. Imagine also that this turtle carries a pen (or just leaves a trail of green slime wherever he crawls--- the pond he came out of was none too clean). As long as our turtle follows our commands without

Sutherland, Scott

177

Fractals with turtle graphics: a CS2 programming exercise for introducing recursion  

Science Journals Connector (OSTI)

This paper describes a programming exercise developed and used in CS2 classes to help introduce recursive programming. Providing a set of primitives which comprise a graphics system allows the students to focus on top down design and the nature of recursion, ...

Ivan B. Liss; Thomas C. McMillan

1987-02-01T23:59:59.000Z

178

Here, There and Everywhere On the Recurring Use of Turtle Graphics in CS1  

E-Print Network [OSTI]

Here, There and Everywhere ­ On the Recurring Use of Turtle Graphics in CS1 Michael E. Caspersen implements a virtual drawing machine--the turtle machine. The turtle ma- chine is well-known for giving present our experiences with resurrecting the Logo turtle in a new object-oriented way and using

Christensen, Henrik Bærbak

179

Bubble Clusters: An Interface for Manipulating Spatial Aggregation of Graphical Objects  

E-Print Network [OSTI]

Bubble Clusters: An Interface for Manipulating Spatial Aggregation of Graphical Objects Nayuko recognized as a group, and the group structure is visualized as a two-dimensional bubble surface that surrounds the objects. Users can drag, copy, or delete a group by operat- ing on the bubble. Furthermore

Igarashi, Takeo

180

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 1 Image-Based Stained Glass  

E-Print Network [OSTI]

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 1 Image-Based Stained Glass Stephen Brooks of a work of stained glass. To this end, we develop a novel approach which involves image warping is first segmented. Each segment is subsequently transformed to match real segments of stained glass

Brooks, Stephen

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

Implementation of a Graphical Modelica Editor with Preserved Source Code Formatting  

E-Print Network [OSTI]

of the same document is often essential. An example of this is Modelica models, where it should be possible a graphical ed- itor for Modelica models are discussed. Amongst others, the difficulties in rendering Modelica, by substituting system prototyping for simulation. Modelica is one of many domain spe- cific languages developed

182

low graphics version | feedback | help You are in: Sci/Tech  

E-Print Network [OSTI]

low graphics version | feedback | help You are in: Sci/Tech Front Page World UK UK Politics. The signals were detected by the seismology division of the Royal Netherlands Meteorological Institute. Its Infrasound stations Royal Netherlands Meteorological Institute Infrasound monitoring The BBC

Evers, Läslo G.

183

Ibero-American Symposium on Computer Graphics -SIACG (2006) P. Brunet, N. Correia, and G. Baranoski (Editors)  

E-Print Network [OSTI]

or hands tracking applications [BCD 03]. Recent research in human motion analysis and visual ob- ject power of current graphics cards. Indeed, this commodity graphics hardware has evolved since the mid-90's giving a considerable amount of programming power to developers in order to customize their rendering

Pantrigo Fernández, Juan José

184

Model Driven Development of Graphical User Interfaces for Enterprise Business Applications --- Experience, Lessons Learnt and a Way Forward  

Science Journals Connector (OSTI)

We discuss our experience in applying model-driven techniques to build Graphical User Interfaces (GUI) of large enterprise business applications. Our approach involves capturing various user interface patterns in the form of platform independent parameterized ... Keywords: Code Generation, Graphical User Interfaces, Meta Modeling, Modeling

Rahul Mohan; Vinay Kulkarni

2009-10-01T23:59:59.000Z

185

Simulation of FLIR and LADAR Data Using Graphics Animation Software Gavin Powell, Ralph Martin and David Marshall  

E-Print Network [OSTI]

) data simulation for use in developing a multi-sensor data- fusion automated target recognition (ATR modelling systems within computer graphics have made this a feasible task. The importance of data simulationSimulation of FLIR and LADAR Data Using Graphics Animation Software Gavin Powell, Ralph Martin

Martin, Ralph R.

186

Discriminating natural images and computer generated graphics based on the impact of CFA interpolation on the correlation of PRNU  

Science Journals Connector (OSTI)

To discriminate natural images from computer generated graphics, a novel identification method based on the features of the impact of color filter array (CFA) interpolation on the local correlation of photo response non-uniformity noise (PRNU) is proposed. ... Keywords: CFA interpolation, Computer generated graphics, Digital image forensics, Natural images, PRNU

Fei Peng, Die-Lan Zhou

2014-06-01T23:59:59.000Z

187

Large-scale simulations on multiple Graphics Processing Units (GPUs) for the direct simulation Monte Carlo method  

Science Journals Connector (OSTI)

In this study, the application of the two-dimensional direct simulation Monte Carlo (DSMC) method using an MPI-CUDA parallelization paradigm on Graphics Processing Units (GPUs) clusters is presented. An all-device (i.e. GPU) computational approach is ... Keywords: Graphics Processing Unit (GPU), MPI-CUDA, Parallel direct simulation Monte Carlo, Rarefied gas dynamics, Very large-scale simulation

C. -C. Su; M. R. Smith; F. -A. Kuo; J. -S. Wu; C. -W. Hsieh; K. -C. Tseng

2012-10-01T23:59:59.000Z

188

Graphical Methods for Quantifying Macromolecules through Bright Field Imaging  

SciTech Connect (OSTI)

Bright ?eld imaging of biological samples stained with antibodies and/or special stains provides a rapid protocol for visualizing various macromolecules. However, this method of sample staining and imaging is rarely employed for direct quantitative analysis due to variations in sample fixations, ambiguities introduced by color composition, and the limited dynamic range of imaging instruments. We demonstrate that, through the decomposition of color signals, staining can be scored on a cell-by-cell basis. We have applied our method to Flbroblasts grown from histologically normal breast tissue biopsies obtained from two distinct populations. Initially, nuclear regions are segmented through conversion of color images into gray scale, and detection of dark elliptic features. Subsequently, the strength of staining is quanti?ed by a color decomposition model that is optimized by a graph cut algorithm. In rare cases where nuclear signal is significantly altered as a result of samplepreparation, nuclear segmentation can be validated and corrected. Finally, segmented stained patterns are associated with each nuclear region following region-based tessellation. Compared to classical non-negative matrix factorization, proposed method (i) improves color decomposition, (ii) has a better noise immunity, (iii) is more invariant to initial conditions, and (iv) has a superior computing performance

Chang, Hang; DeFilippis, Rosa Anna; Tlsty, Thea D.; Parvin, Bahram

2008-08-14T23:59:59.000Z

189

Teaching Computer Graphics in Brazil M. WALTER1, A. FRERY2, CARLA M.D.S. FREITAS3, LEO P. MAGALH ~AES4, LUIZ VELHO5  

E-Print Network [OSTI]

Teaching Computer Graphics in Brazil M. WALTER1, A. FRERY2, CARLA M.D.S. FREITAS3, L´EO P. MAGALH about computer graphics teaching and education in Brazil. We hope this discussion will further The activities related with Computer Graphics Teaching in Brazil have received relatively little attention

190

Graphical Environment Tools for Application to Gamma-Ray Energy Tracking Arrays  

SciTech Connect (OSTI)

Highly segmented, position-sensitive germanium detector systems are being developed for nuclear physics research where traditional electronic signal processing with mixed analog and digital function blocks would be enormously complex and costly. Future systems will be constructed using pipelined processing of high-speed digitized signals as is done in the telecommunications industry. Techniques which provide rapid algorithm and system development for future systems are desirable. This project has used digital signal processing concepts and existing graphical system design tools to develop a set of re-usable modular functions and libraries targeted for the nuclear physics community. Researchers working with complex nuclear detector arrays such as the Gamma-Ray Energy Tracking Array (GRETA) have been able to construct advanced data processing algorithms for implementation in field programmable gate arrays (FPGAs) through application of these library functions using intuitive graphical interfaces.

Todd, Richard A. [RIS Corp.] [RIS Corp.; Radford, David C. [ORNL Physics Div.] [ORNL Physics Div.

2013-12-30T23:59:59.000Z

191

Graphic1  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

6, 2009 6, 2009 WIPP Quick Facts (As of 11-5-09) 8,002 Shipments received since opening (7,702 CH and 300 RH) 63,971 Cubic meters of waste disposed (63,828 CH and 143 RH) 124,386 Containers disposed in the underground (124,093 CH and 293 RH) WIPP receives 8000th TRU waste shipment The 8,000th shipment arrives at WIPP late Wednesday night. The two drivers, Phil Godin, left, and Jack Clayton stand next to the truck as it is inspected by Security. The shipment came to WIPP from Los Alamos National Laboratory. Eight thousand shipments and counting... This week, WIPP received its 8,000th shipment of defense-related transuranic (TRU) waste. The milestone shipment from Los Alamos National Laboratory will be safely and permanently disposed in WIPP's underground repository.

192

GDI Graphics  

Science Journals Connector (OSTI)

Now, it is time to start putting the knowledge you have acquired so far into writing a game. The approach that we will take over the next few chapters is to build a straightforward and easy-to-use game framewo...

Adam Dawes

2010-01-01T23:59:59.000Z

193

APFEL Web: a web-based application for the graphical visualization of parton distribution functions  

E-Print Network [OSTI]

We present APFEL Web, a web-based application designed to provide a flexible user-friendly tool for the graphical visualization of parton distribution functions (PDFs). In this note we describe the technical design of the APFEL Web application, motivating the choices and the framework used for the development of this project. We document the basic usage of APFEL Web and show how it can be used to provide useful input for a variety of collider phenomenological studies. Finally we provide some examples showing the output generated by the application.

Carrazza, Stefano; Palazzo, Daniele; Rojo, Juan

2014-01-01T23:59:59.000Z

194

APFEL Web: a web-based application for the graphical visualization of parton distribution functions  

E-Print Network [OSTI]

We present APFEL Web, a web-based application designed to provide a flexible user-friendly tool for the graphical visualization of parton distribution functions (PDFs). In this note we describe the technical design of the APFEL Web application, motivating the choices and the framework used for the development of this project. We document the basic usage of APFEL Web and show how it can be used to provide useful input for a variety of collider phenomenological studies. Finally we provide some examples showing the output generated by the application.

Stefano Carrazza; Alfio Ferrara; Daniele Palazzo; Juan Rojo

2014-10-20T23:59:59.000Z

195

Pseudo-random number generators for Monte Carlo simulations on Graphics Processing Units  

E-Print Network [OSTI]

Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX generator is found to be the most appropriate for using on GPU in Monte Carlo simulations. The brief review of the pseudo-random number generators used in modern software packages for Monte Carlo simulations in high-energy physics is present.

Demchik, Vadim

2010-01-01T23:59:59.000Z

196

Pseudo-random number generators for Monte Carlo simulations on Graphics Processing Units  

E-Print Network [OSTI]

Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX generator is found to be the most appropriate for using on GPU in Monte Carlo simulations. The brief review of the pseudo-random number generators used in modern software packages for Monte Carlo simulations in high-energy physics is present.

Vadim Demchik

2010-03-09T23:59:59.000Z

197

Physical modeling and computer graphic simulation of the depletion of world energy reserve  

Science Journals Connector (OSTI)

A physical modeling device and a computer graphic simulation program of the depletion of world energy reserve are developed to demonstrate how rapidly our energy reserve is depleted, how quickly and enormously our demands for energy grows, and how important energy conservation is to us. In both modeling and simulation cases, the total world energy reserve, the current energy usage annual growth rate, and the current energy consumption rate are given as parameters. One can view the energy shortage in terms of the rapidly falling levels in the physical water tank or the simulated oil barrels.

Chih Wu

1981-01-01T23:59:59.000Z

198

Viewing MORSE-CG radiation transport with 3-D color graphics  

SciTech Connect (OSTI)

In this paper we present the coupling of MORSE-CG with the SLAC Unified Graphics System (UGS77) through an add-on package called MORSGRAF which allows for real-time display of neutron and photon tracks in the Monte Carlo simulation. In addition to displaying the myriad of complicated geometries that can be created with the MORSE Combinatorial Geometry program, MORSGRAF permits color tagging of neutrons (green) and photons (red) with the variation of track intensity an indicator of the energy of the particle. Particle types can be switched off and on by means of a mouse-icon system, and the perspective can be changed (i.e., rotated, translated, and zoomed). MORSGRAF also allows one to display the propagation of radiation through shields and mazes on an ordinary graphics terminal, as well as in documents printed on a laser printer. Several examples will be given to demonstrate the various capabilities of MORSGRAF coupled to MORSE-CG. 12 refs., 8 figs.

Namito, Yoshihito; Jenkins, T.M.; Nelson, W.R.

1990-01-01T23:59:59.000Z

199

Graphically oriented method for obtaining atomic displacement fields in crystals from irreducible representations of space groups  

Science Journals Connector (OSTI)

A method for obtaining distortion fields in a crystal from a given irreducible representation of the underlying space group is described. The method, based on projection operators of group theory, is graphically oriented and therefore calculation-free. For an example (space group P421m), complete sets of representation matrices are analytically calculated for all irreducible representations which correspond to all wave vectors of the form k=(q,q,0). All 96 linear independent atomic displacement modes in the (331) supercell, which are induced by the two irreducible representations with k=(13,13,0), are explicitly determined: the obtained atomic displacement fields are plane waves with wave vector k.

Jrgen K. Gutmann and Horst Bhm

2000-06-01T23:59:59.000Z

200

Parallel Cycle Based Logic Simulation using Graphics Processing Units Alper Sen, Baris Aksanli, Murat Bozkurt, and Melih Mert  

E-Print Network [OSTI]

Parallel Cycle Based Logic Simulation using Graphics Processing Units Alper Sen, Baris Aksanli-based parallelization of logic simulation algorithm for electronic designs. Logic simulation is a crucial component attempts to speedup the verification process (and logic simulation) results in great savings and shorter

Sen, Alper

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

Database-Driven Website Development for Non-Profit Agencies Rob Elliott, Computer Information and Graphics Technology  

E-Print Network [OSTI]

and Graphics Technology School of Engineering and Technology The Near Eastside Legacy Initiative grant programDatabase-Driven Website Development for Non-Profit Agencies Rob Elliott, Computer Information in Indianapolis. Two non-profit organizations were selected to receive grant funds in Spring 2013 and chose

Zhou, Yaoqi

202

GAMES@LARGE GRAPHICS STREAMING ARCHITECTURE Itay Nave, Haggai David, Alex Shani Arto Laikari Peter Eisert, Philipp Fechteler  

E-Print Network [OSTI]

Eisert, Philipp Fechteler Exent Technologies Ltd. VTT Fraunhofer HHI ABSTRACT In coming years we will seeStation and Xbox will require a radical change in system architecture. While traditional CE equipment suffers from of the innovative aspects of the Games@Large project idea ­ the interactive streaming of graphical output to client

Eisert, Peter

203

Computer Graphic Design Fees Scholarship R E G U L A T I O N S F O R 2 0 1 5  

E-Print Network [OSTI]

Computer Graphic Design Fees Scholarship R E G U L A T I O N S F O R 2 0 1 5 BACKGROUND This Scholarship was established in 2009 by the Faculty of Computing and Mathematical Sciences. REGULATIONS 1. The Scholarship will be known as the Computer Graphic Design Fees Scholarship. 2. The Scholarship will have

Waikato, University of

204

A Graphical Interface for Speech-Based Retrieval Laura Slaughter, Douglas W. Oard, Vernon L. Warnick, Julie L. Harding and Galen J. Wilkerson  

E-Print Network [OSTI]

selection interface for speech-based retrieval [5]. Search controls in the upper left allow specificationA Graphical Interface for Speech-Based Retrieval Laura Slaughter, Douglas W. Oard, Vernon L}@glue.umd.edu ABSTRACT This paper describes preliminary usability testing for a graphical interface designed

Oard, Doug

205

Density-fitted singles and doubles coupled cluster on graphics processing units  

SciTech Connect (OSTI)

We adapt an algorithm for singles and doubles coupled cluster (CCSD) that uses density fitting (DF) or Cholesky decomposition (CD) in the construction and contraction of all electron repulsion integrals (ERI s) for use on heterogeneous compute nodes consisting of a multicore CPU and at least one graphics processing unit (GPU). The use of approximate 3-index ERI s ameliorates two of the major difficulties in designing scientific algorithms for GPU s: (i) the extremely limited global memory on the devices and (ii) the overhead associated with data motion across the PCI bus. For the benzene trimer described by an aug-cc-pVDZ basis set, the use of a single NVIDIA Tesla C2070 (Fermi) GPU accelerates a CD-CCSD computation by a factor of 2.1, relative to the multicore CPU-only algorithm that uses 6 highly efficient Intel core i7-3930K CPU cores. The use of two Fermis provides an acceleration of 2.89, which is comparable to that observed when using a single NVIDIA Kepler K20c GPU (2.73).

Sherrill, David [Georgia Institute of Technology, Atlanta] [Georgia Institute of Technology, Atlanta; Sumpter, Bobby G [ORNL] [ORNL; DePrince, III, A. Eugene [Georgia Institute of Technology, Atlanta

2014-01-01T23:59:59.000Z

206

The application of projected conjugate gradient solvers on graphical processing units  

SciTech Connect (OSTI)

Graphical processing units introduce the capability for large scale computation at the desktop. Presented numerical results verify that efficiencies and accuracies of basic linear algebra subroutines of all levels when implemented in CUDA and Jacket are comparable. But experimental results demonstrate that the basic linear algebra subroutines of level three offer the greatest potential for improving efficiency of basic numerical algorithms. We consider the solution of the multiple right hand side set of linear equations using Krylov subspace-based solvers. Thus, for the multiple right hand side case, it is more efficient to make use of a block implementation of the conjugate gradient algorithm, rather than to solve each system independently. Jacket is used for the implementation. Furthermore, including projection from one system to another improves efficiency. A relevant example, for which simulated results are provided, is the reconstruction of a three dimensional medical image volume acquired from a positron emission tomography scanner. Efficiency of the reconstruction is improved by using projection across nearby slices.

Lin, Youzuo [Los Alamos National Laboratory; Renaut, Rosemary [ARIZONA STATE UNIV.

2011-01-26T23:59:59.000Z

207

Layered Electrical Product Application Protocol (AP). Draft: Initial Graphics Exchange Specification (IGES)  

SciTech Connect (OSTI)

An application protocol is an information systems engineering view of a specific product. The view represents an agreement on the generic activities needed to design and fabricate the product, the agreement on the information needed to support those activities, and the specific constructs of a product data standard for use in transfering some or all of the information required. This applications protocol describes the data for electrical and electronic products in terms of a product description standard called the Initial Graphics Exchange Specification (IGES). More specifically, the Layered Electrical Product IGES Application Protocol (AP) specifies the mechanisms for defining and exchanging computer-models and their associated data for those products which have been designed in two dimensional geometry so as to be produced as a series of layers in IGES format. The AP defines the appropriateness of the data items for describing the geometry of the various parts of a product (shape and location), the connectivity, and the processing and material characteristics. Excluded is the behavioral requirements which the product was intended to satisfy, except as those requirements have been recorded as design rules or product testing requirements.

Not Available

1994-09-01T23:59:59.000Z

208

LiTrack: A Fast Longitudinal Phase Space Tracking Code with Graphical User Interface  

SciTech Connect (OSTI)

Linac-based light sources and linear colliders typically apply longitudinal phase space manipulations in their design, including electron bunch compression and wakefield-induced energy spread control. Several computer codes handle such issues, but most also require detailed information on the transverse focusing lattice. In fact, in most linear accelerators, the transverse distributions do not significantly affect the longitudinal, and can be ignored initially. This allows the use of a fast 2D code to study longitudinal aspects without time-consuming considerations of the transverse focusing. LiTrack is based on a 15-year old code (same name) originally written by one of us (KB), which is now a Matlab [1] code with additional features, such as graphical user interface, prompt output plotting, and functional call within a script. This single-bunch tracking code includes RF acceleration, bunch compression to 3rd order, geometric and resistive short-range wakefields, aperture limits, synchrotron radiation, and flexible output plotting. The code was used to design both the LCLS [2] and the SPPS [3] projects at SLAC and typically runs 10{sub 5} particles in < 1 minute. We describe the features, show some examples, and provide free access to the code.

Bane, K.L.F.

2005-03-24T23:59:59.000Z

209

Application of Graphics Processing Units to Search Pipeline for Gravitational Waves from Coalescing Binaries of Compact Objects  

E-Print Network [OSTI]

We report a novel application of graphics processing units (GPUs) for the purpose of accelerating the search pipelines for gravitational waves from coalescing binaries of compact objects. A speed-up of 16 fold has been achieved compared with a single central processing unit (CPU). We show that substantial improvements are possible and discuss the reduction in CPU count required for the detection of inspiral sources afforded by the use of GPUs.

Shin Kee Chung; Linqing Wen; David Blair; Kipp Cannon; Amitava Datta

2009-06-23T23:59:59.000Z

210

The Metropolis Monte Carlo method with CUDA enabled Graphic Processing Units  

SciTech Connect (OSTI)

We present a CPUGPU system for runtime acceleration of large molecular simulations using GPU computation and memory swaps. The memory architecture of the GPU can be used both as container for simulation data stored on the graphics card and as floating-point code target, providing an effective means for the manipulation of atomistic or molecular data on the GPU. To fully take advantage of this mechanism, efficient GPU realizations of algorithms used to perform atomistic and molecular simulations are essential. Our system implements a versatile molecular engine, including inter-molecule interactions and orientational variables for performing the Metropolis Monte Carlo (MMC) algorithm, which is one type of Markov chain Monte Carlo. By combining memory objects with floating-point code fragments we have implemented an MMC parallel engine that entirely avoids the communication time of molecular data at runtime. Our runtime acceleration system is a forerunner of a new class of CPUGPU algorithms exploiting memory concepts combined with threading for avoiding bus bandwidth and communication. The testbed molecular system used here is a condensed phase system of oligopyrrole chains. A benchmark shows a size scaling speedup of 60 for systems with 210,000 pyrrole monomers. Our implementation can easily be combined with MPI to connect in parallel several CPUGPU duets. -- Highlights: We parallelize the Metropolis Monte Carlo (MMC) algorithm on one CPUGPU duet. The Adaptive Tempering Monte Carlo employs MMC and profits from this CPUGPU implementation. Our benchmark shows a size scaling-up speedup of 62 for systems with 225,000 particles. The testbed involves a polymeric system of oligopyrroles in the condensed phase. The CPUGPU parallelization includes dipoledipole and MieJones classic potentials.

Hall, Clifford [Computational Materials Science Center, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States) [Computational Materials Science Center, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States); School of Physics, Astronomy, and Computational Sciences, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States); Ji, Weixiao [Computational Materials Science Center, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States)] [Computational Materials Science Center, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States); Blaisten-Barojas, Estela, E-mail: blaisten@gmu.edu [Computational Materials Science Center, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States) [Computational Materials Science Center, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States); School of Physics, Astronomy, and Computational Sciences, George Mason University, 4400 University Dr., Fairfax, VA 22030 (United States)

2014-02-01T23:59:59.000Z

211

The graphical interpretation of fracture load data for doubly-convex cylindrical discs  

Science Journals Connector (OSTI)

A set of graphs is developed for the determination of the material tensile strength of a brittle, doublyconvex cylindrical disc from the disc dimensions and the fracture load in in-plane diametral compression....

P. Stanley

1991-04-15T23:59:59.000Z

212

A graphical representation of relational formulae with complementation Domenico Cantone, Marianna Nicolosi Asmundo  

E-Print Network [OSTI]

is handled by adopting a Smullyan-like uniform notation to classify and decompose relational expressions . . . . . . . . . . . . . . . . . . . 11 6 Related Work 13 A Details of the graph-thinning 15 A.1 The procedure Rename . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 A.2 The procedure Collapse

Formisano, Andrea

213

Eurographics Symposium on Point-Based Graphics (2004) M. Alexa, S. Rusinkiewicz, (Editors)  

E-Print Network [OSTI]

(magenta) over a 2D point cloud (black dots) based on different distance functions: (a,c) Euclidean, (b) Proximity Graphs for Defining Surfaces over Point Clouds Jan Klein1 and Gabriel Zachmann2 1 Heinz Nixdorf a natural notion of proximity in our context. c The Eurographics Association 2004. #12;J. Klein and G

Zachmann, Gabriel

214

Eurographics Symposium on PointBased Graphics (2004) M. Alexa, S. Rusinkiewicz, (Editors)  

E-Print Network [OSTI]

(magenta) over a 2D point cloud (black dots) based on different distance functions: (a,c) Euclidean, (b) Proximity Graphs for Defining Surfaces over Point Clouds Jan Klein 1 and Gabriel Zachmann 2 1 Heinz Nixdorf a natural notion of proximity in our context. c # The Eurographics Association 2004. #12; J. Klein and G

Zachmann, Gabriel

215

SCG3: An Extensible Scene Graph Library for Teaching Computer Graphics along the Programmable Pipeline  

E-Print Network [OSTI]

teapotCore = geometryFactory.createTeapot(0.35f); auto teapot = scg::Shape::create(); teapot->addCore(materialRed) ->addCore(teapotCore); auto teapotTrans = scg::Transformation::create(); teapotTrans->addChild(table) ->addChild(teapotTrans); teapotTrans->addChild(teapot); // Phong vertex shader (GLSL) in vec4 v

Ahlers, Volker - Fakultät IV

216

A Metaphor Graphics Based Representation of Digital Libraries on the World Wide Web: Using the libViewer to Make Metadata Visible  

E-Print Network [OSTI]

Visualization, Web­based Library Representation, Information Space Metaphors 1. Introduction When entering in a public library rather than in a bookstore), as well as the amount and type of information to be expectedA Metaphor Graphics Based Representation of Digital Libraries on the World Wide Web: Using the lib

Rauber,Andreas

217

A Metaphor Graphics Based Representation of Digital Libraries on the World Wide Web: Using the libViewer to Make Metadata Visible  

E-Print Network [OSTI]

Visualization, Web-based Library Representation, Information Space Metaphors 1. Introduction When entering in a public library rather than in a bookstore), as well as the amount and type of information to be expectedA Metaphor Graphics Based Representation of Digital Libraries on the World Wide Web: Using the lib

Rauber,Andreas

218

Serious Games & Virtual Environments for Educational and Entertainment Speaker: Dr Daniela M Romano, 3D Graphics and Virtual Reality Group, Computer Science, University  

E-Print Network [OSTI]

be sustained while experiencing them. In this presentation serious games and virtual environments applicationSerious Games & Virtual Environments for Educational and Entertainment Speaker: Dr Daniela M Romano learning to ensure that the learning is integrated within `gameplay'. Virtual Environments are 3D graphical

Romano, Daniela

219

MapGraph: A High Level API for Fast Development of High Performance Graph Analytics on GPUs  

Science Journals Connector (OSTI)

High performance graph analytics are critical for a long list of application domains. In recent years, the rapid advancement of many-core processors, in particular graphical processing units (GPUs), has sparked a broad interest in developing high performance ... Keywords: GPU, Graph analytics, high-level API

Zhisong Fu; Michael Personick; Bryan Thompson

2014-06-01T23:59:59.000Z

220

Fast, multi-channel real-time processing of signals with microsecond latency using graphics processing units  

SciTech Connect (OSTI)

Fast, digital signal processing (DSP) has many applications. Typical hardware options for performing DSP are field-programmable gate arrays (FPGAs), application-specific integrated DSP chips, or general purpose personal computer systems. This paper presents a novel DSP platform that has been developed for feedback control on the HBT-EP tokamak device. The system runs all signal processing exclusively on a Graphics Processing Unit (GPU) to achieve real-time performance with latencies below 8 ?s. Signals are transferred into and out of the GPU using PCI Express peer-to-peer direct-memory-access transfers without involvement of the central processing unit or host memory. Tests were performed on the feedback control system of the HBT-EP tokamak using forty 16-bit floating point inputs and outputs each and a sampling rate of up to 250 kHz. Signals were digitized by a D-TACQ ACQ196 module, processing done on an NVIDIA GTX 580 GPU programmed in CUDA, and analog output was generated by D-TACQ AO32CPCI modules.

Rath, N., E-mail: Nikolaus@rath.org; Levesque, J. P.; Mauel, M. E.; Navratil, G. A.; Peng, Q. [Department of Applied Physics and Applied Mathematics, Columbia University, 500 W 120th St, New York, New York 10027 (United States)] [Department of Applied Physics and Applied Mathematics, Columbia University, 500 W 120th St, New York, New York 10027 (United States); Kato, S. [Department of Information Engineering, Nagoya University, Nagoya (Japan)] [Department of Information Engineering, Nagoya University, Nagoya (Japan)

2014-04-15T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

Parallel map projection of vector-based big spatial data: Coupling cloud computing with graphics processing units  

Science Journals Connector (OSTI)

Abstract The objective of this article is to present a framework that couples cloud and high-performance computing for the parallel map projection of vector-based big spatial data. The past few years have witnessed a tremendous growth of a variety of high-volume spatial datai.e., big spatial data. Map projection is often needed, for example, when we apply these big spatial data into large-scale spatial analysis and modeling approaches that require a common coordinate system. However, due to the size of these data and algorithmic complexity of map projections, the transformation of big spatial data between alternative projections represents a pressing computational challenge. Recent advancement in cloud computing and high-performance computing offers a potential means of addressing this computational challenge. The parallel map projection framework presented in this study is based on a layered architecture that couples capabilities of cloud computing and high-performance computing accelerated by Graphics Processing Units. We use large LiDAR data as an example of vector-based big spatial data to investigate the utility of the parallel map projection framework. As experimental results reveal, the framework provides considerable acceleration for re-projecting vector-based big spatial data. Coupling high-performance and cloud computing, which complement to each other, is a suggested solution for the efficient processing and analysis of big spatial data.

Wenwu Tang; Wenpeng Feng

2014-01-01T23:59:59.000Z

222

Open Graphic Evaluative Frameworks  

E-Print Network [OSTI]

software/dview.htm [2] Autodesk Climate Server: http://Weather Tool, produced by Autodesk, is a visualization anddata files. One tool, Autodesks Climate Server, which is

Steinfeld, Kyle; Schiavon, Stefano; Moon, Dustin

2012-01-01T23:59:59.000Z

223

Home Energy Score graphic  

Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

Home Facts Score Air-tightness Air leakage rate 4,200 CFM50 Roof, attic & foundation Roof Roof construction Roof(Standard Roof): Composition Shingles or Metal: R-0 Roof...

224

Graphics insertion in TEX  

E-Print Network [OSTI]

. . 10 TOOLS FOR CONVERSION 48 51 10. 1 DVI-to-bmi 10. 2 TIFF-to-bmi . 10. 3 IFF-to-bmi 10. 4 Sun Screea Dumps-to-bmi . 10. 5 HP-Laserjet-to-bmi 11 OPERATIONS ON BMI FILES . 51 52 53 55 56 58 12 FUTURE WORK 13 CONCLUSIONS 60 62..., I would like to express my gratitude to my family and friends for their relentless support and encouragement. TABLE OF CONTENTS 1 INTRODUCTION . Page THE TEX CYCLE . 3 FONT METRICS 3. 1 Font Parameters 3. 2 TEX Font Metric File 4 DEVICE...

Kattawar, Gregory Williford

1989-01-01T23:59:59.000Z

225

Introduction to computer graphics  

Science Journals Connector (OSTI)

The SIGGRAPH Asia conference is an exciting event, but it is often a confusing experience for first-time attendees. There are many new terms, new concepts, and new products to try to understand. This course is designed to ease newcomers into the SIGGRAPH ...

Mike Bailey; Steve Cunningham

2011-12-01T23:59:59.000Z

226

Communications and graphic manual  

E-Print Network [OSTI]

in health sciences We have a strong brand of which we should be proud and take good care Our activities of us are helping to strengthen the Sahlgrenska Academy brand #12;4 Communicating in a clear to present a consistent image of our organisation The Academy Board has established a business concept

Harding, Karin

227

Graphical Abstract Diastereoselective  

E-Print Network [OSTI]

metalation of chiral ferrocene derived acetals and esters using mixed lithium- cadmium and lithium.mongin@univ-rennes1.fr (F. Mongin). Keywords: deprotometalation, ferrocene, carbohydrates, lithium, zinc, cadmium hal a chiral lithium-zinc base generated from ZnCl2·TMEDA and lithium (R)-bis(1-phenylethyl)amide (4 equiv

Paris-Sud XI, Université de

228

Dynamic Graphics and GDI+  

Science Journals Connector (OSTI)

In this chapter, you learned how to master basic and advanced GDI+. Although these techniques arent right ... . For even more detailed information about how GDI+ works and how to optimize it,...Pro .NET 2.0 Grap...

2006-01-01T23:59:59.000Z

229

Graphics Using GDI+  

Science Journals Connector (OSTI)

This has been another long chapter in which you covered a lot of ground. You started off with the basics of what GDI+ is. You created your third Hello World programthis time with a GDI+ flavor. You then moved ...

2006-01-01T23:59:59.000Z

230

Dynamic Graphics with GDI+  

Science Journals Connector (OSTI)

In this chapter, youve learned how to master basic and advanced GDI+. Although these techniques arent right...

2005-01-01T23:59:59.000Z

231

Graph-Theoretic Scagnostics Leland Wilkinson  

E-Print Network [OSTI]

Tukey and Tukey scagnostics and develop graph- theoretic methods for implementing their procedure, statistical graphics 1 INTRODUCTION Around 20 years ago, John and Paul Tukey developed an ex- ploratory of the method were never published. Paul Tukey did offer more detail at an IMA visualization workshop a few

Grossman, Robert

232

Extending Document Summarization to Information Graphics Sandra Carberry, Stephanie Elzer, Nancy Green, Kathleen McCoy, Daniel Chester  

E-Print Network [OSTI]

to summarize interesting features of automatically generated graphs of time-series data from a gas turbine on society #12;and the development of technology. However, the growing reliance on visual information dis engine. (Futrelle and Nikolakis, 1995) developed a constraint grammar formalism for parsing vector

Carberry, Sandra

233

An Interchange File Format for Graphs Michael Himsolt  

E-Print Network [OSTI]

graphical information. It is designed as an extendible format and provides facilities such that other be as flexible and extensible as possible. Other programs should be able to write graph files with low overhead Ascii). Since end of line is encoded differ­ ently on different platform, we choose not to use end­of­line

Pentus, Mati

234

Computers & Graphics 26 (2002) 143149 Chaos and Graphics  

E-Print Network [OSTI]

, Manuel Alfonsecaa a Departamento de Ingenier!ia Inform!atica, Universidad Aut!onoma de Madrid, Informatica, Madrid, Spain b Centro de Investigaciones Energ!eticas, Medioambientales y Tecnol!ogicas, Spain

Alfonseca, Manuel

235

COMPUTER SCIENCE 3710 Computer Graphics  

E-Print Network [OSTI]

: POVRay, Blender, 3DStudioMax, or Maya. The first two are free downloads. You may use Google's SketchUp.blender.org ­ it is tougher to learn but is more powerful than POVRay. SketchUp can be downloaded from http://sketchup

Wismath, Stephen

236

Improving Filtering for Computer Graphics  

E-Print Network [OSTI]

When drawing images onto a computer screen, the information in the scene is typically more detailed than can be displayed. Most objects, however, will not be close to the camera, so details have to be filtered out, or anti-aliased, when the objects...

Manson, Josiah

2014-04-30T23:59:59.000Z

237

Rendering Graphical Data with GDI+  

Science Journals Connector (OSTI)

GDI+ is the name given to a number ... was spent examining how to work with core GDI+ object types such as colors, fonts, ... type. Along the way, you examined some GDI+-centric details such as hit testing and...

2006-01-01T23:59:59.000Z

238

Rendering Graphical Data with GDI+  

Science Journals Connector (OSTI)

GDI+ is the name given to a number ... was spent examining how to work with core GDI+ object types such as colors, fonts, ... type. Along the way, you examined some GDI+-centric details such as hit testing and...

2005-01-01T23:59:59.000Z

239

Graphical Methods in Energy Conservation  

E-Print Network [OSTI]

It goes without saying that more efficient use of electrical energy results in savings for both companies and their customers, but effective communication of such information to customers, clients, management, and anyone else without technical...

McAlister, J.

240

JOURNAL FOR GEOMETRY AND GRAPHICS  

E-Print Network [OSTI]

), O. Giering (M¨unchen), L. D. Goss (Evansville), S. Ino (Hokkaido), B. Januszewski (Rzeszow), R. D

Stachel, Hellmuth

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Fermilab | Graphics Standards | Guidelines | Colors  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Colors Colors Fermilab's core color is NAL blue, developed for Fermilab in the 1970s by the Rustoleum® paint company. NAL blue, Fermilab's core color, should be the main color for: Two-color applications with black ink on white paper. Logo/mark treatments when a color besides black is desirable. Primary communications from the lab Directorate. Primary communications from the Office of Communication. Multicolor treatments in all media that communicate a core Fermilab message. NAL Blue - R0 G51 B153 When more than one color is desired, the use of colors from Fermilab’s recommended palette is strongly encouraged. The recommended palette is derived from the original selections of Robert Wilson and Angela Gonzales. The links below provide the colors’ nearest Pantone Matching System (PMS)

242

An Experiment on Graph Analysis Methodologies for Scenarios  

SciTech Connect (OSTI)

Visual graph representations are increasingly used to represent, display, and explore scenarios and the structure of organizations. The graph representations of scenarios are readily understood, and commercial software is available to create and manage these representations. The purpose of the research presented in this paper is to explore whether these graph representations support quantitative assessments of the underlying scenarios. The underlying structure of the scenarios is the information that is being targeted in the experiment and the extent to which the scenarios are similar in content. An experiment was designed that incorporated both the contents of the scenarios and analysts graph representations of the scenarios. The scenarios content was represented graphically by analysts, and both the structure and the semantics of the graph representation were attempted to be used to understand the content. The structure information was not found to be discriminating for the content of the scenarios in this experiment; but, the semantic information was discriminating.

Brothers, Alan J.; Whitney, Paul D.; Wolf, Katherine E.; Kuchar, Olga A.; Chin, George

2005-09-30T23:59:59.000Z

243

O:\GRAPHICS\Factsheets\NEW\mont  

Office of Legacy Management (LM)

9 9 United States Department of Energy Grand Junction Office Background The original Monticello mill was built in 1942 to provide an additional supply of vanadium during World War II. The mill was modified in the early 1950s to process uranium ore. Milling continued intermittently until the early 1960s, when the mill was dismantled. Tailings are the sandlike material that remains after processing of ore. Uranium tailings contain naturally occurring materials that radioactively decay to radium and then to radon, a radioactive gas. Tailings and uranium ore contaminated properties in and around the city of Monticello. Tailings were dispersed by wind and water from the millsite and residual ore remained from hauling and stockpiling operations. DOE entered into an agreement with EPA and

244

EIA - International Energy Outlook 2008-Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Demand and Economic Outlook Demand and Economic Outlook International Energy Outlook 2008 Figure 9. World Marketed Energy Use: OECD and Non-OECD, 1980-2030 Figure 9 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 10. World Marketed Energy Consumption: OECD and Non-OECD, 1980-2030 Figure 10 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 11. Marketed Energy Use in the Non-OECD Economies by Region, 1990-2030 Figure 11 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 12. World Marketed Energy Use by Fuel Type,1990-2030 Figure 12 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 13. Coal Consumption in Selected World Regions,1980-2030 Figure 13 Data. Need help, contact the National Energy Information Center at 202-586-8800.

245

EIA - International Energy Outlook 2007-Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Data Data International Energy Outlook 2007 Figure 1. World Marketed Energy Consumption by Region, 2004-2030 Figure 1 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 2. Average Annual Growth in Delivered Energy Consumption by Region and End-Use Sector, 2004-2030 Figure 2 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 3. Industrial Sector Delivered Energy Consumption by Region, 2004-2030 Figure 3 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 4. World Marketed Energy Use by Fuel Type, 1980-2030 Figure 4 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 5. World Liquids Production, 2004-2030 Figure 5 Data. Need help, contact the National Energy Information Center at 202-586-8800.

246

Graphical models for coding and computation  

E-Print Network [OSTI]

n, k, d ) linear code over F q , with generator matrix G andrepresents the generator matrix of a random linear code. Asrepresents the generator matrix of a random linear code. As

Santhi, Nandakishore

2006-01-01T23:59:59.000Z

247

carbonate equilibria: a graphic and algebraic approach  

Science Journals Connector (OSTI)

On such diagrams, the addition or removal of COZ, HCOS-, COB, acid, or base is a vector .... In every case, removal .... of those variables which are additive com-.

248

Analog graphic display method and apparatus  

DOE Patents [OSTI]

An apparatus and method for using an output device such as an LED to show the approximate analog level of a variable electrical signal wherein a modulating AC waveform is superimposed either on the signal or a reference voltage, both of which are then fed to a comparator which drives the output device. Said device flashes at a constant perceptible rate with a duty cycle which varies in response to variations in the level of the input signal. The human eye perceives these variations in duty cycle as analogous to variations in the level of the input signal.

Kronberg, James W. (P.O. Box 385, Beach Island, SC 29841)

1991-01-01T23:59:59.000Z

249

Analog graphic display method and apparatus  

DOE Patents [OSTI]

Disclosed are an apparatus and method for using an output device such as an LED to show the approximate analog level of a variable electrical signal wherein a modulating AC waveform is superimposed either on the signal or a reference voltage, both of which are then fed to a comparator which drives the output device. Said device flashes at a constant perceptible rate with a duty cycle which varies in response to variations in the level of the input signal. The human eye perceives these variations in duty cycle as analogous to variations in the level of the input signal. 21 figures.

Kronberg, J.W.

1991-08-13T23:59:59.000Z

250

A Graphical Demonstration of White Light Interference  

Science Journals Connector (OSTI)

A teaching device is described which can be used in lectures on the interference of white light. The wave forms of four selected components of white light in the violet green yellow and red regions are shown one above the other on a cardboard chart inked in their respective colors. A sheet of clear plastic with an identical set of waves drawn on it is placed over the chart so that the two sets are in register. The combination represents a beam of white light as it arrives at the retina. A retardation of part of the beam is illustrated by displacing the plastic sheet laterally. Since the sine waves differ among themselves in wavelength the various phase changes which result among the four components are shown quite clearly.

Alan C. Traub

1953-01-01T23:59:59.000Z

251

Perspective-Driven Radiosity on Graphics Hardware  

E-Print Network [OSTI]

Radiosity is a global illumination algorithm used by artists, architects, and engineers for its realistic simulation of lighting. Since the illumination model is global, complexity and run time grow as larger environments are provided. Algorithms...

Bozalina, Justin Taylor

2011-08-08T23:59:59.000Z

252

GRAPHICAL MODELS FOR PROTEIN FUNCTION AND  

E-Print Network [OSTI]

learning techniques have been introduced in the bioinformatics field. In fact, the two-decade history of bioinformatics can be viewed, in one sense, as the history of adopting and applying new algorithms to biological evolved into tools for sequence database search [3­5]. Computational sequence alignment and database

Kihara, Daisuke

253

Introduction to SIGGRAPH and computer graphics  

Science Journals Connector (OSTI)

The SIGGRAPH conference is an exciting event, but it is often an intimidating experience for first-time attendees. There are so many new terms, new concepts, and new products to try to understand. It is like standing in a room with 100 doors and having ...

Mike Bailey; Andrew Glassner

2007-08-01T23:59:59.000Z

254

Fermilab | Graphic Standards at Fermilab | Administrative relationship...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Administrative relationships: Fermilab, DOE and FRA LLC PDF Version Fermilab is managed by Fermi Research Alliance, LLC for the U.S. Department of Energy, and whenever possible and...

255

Graphic update of automated logic diagrams  

Science Journals Connector (OSTI)

The Automated Logic Diagram, or ALD, is a well defined document prepared by engineers to specify the design of a machine. 1 The document is coded for computer input by highly trained transcription personnel. Changes or corrections ...

Richard J. Uhlik

1968-07-01T23:59:59.000Z

256

Computers & Graphics 27 (2003) 293301 Technical section  

E-Print Network [OSTI]

environments from video sequences S. Gibson*, R.J. Hubbold, J. Cook, T.L.J. Howard Advanced Interfaces Group of complex and accurate three- dimensional models that represent real environments. In this paper, we built from video sequences captured with standard consumer-level digital cameras. The system combines

Manchester, University of

257

Computers & Graphics 28 (2004) 907918 Technical section  

E-Print Network [OSTI]

. For the straight homogeneous generalized cylinder (SHGC) [6,7], their cross-sections have the same shape but may) a constant axis direction (SHGC), (ii) a constant size of cross-section (PRCGC), or (iii) a fixed shape

Ahuja, Narendra

258

MCNPX graphics and arithmetic tally upgrades  

SciTech Connect (OSTI)

The MCNPX MCPLOT package is the tool used to plot tallies and cross-sections. We report on an assortment of upgrades to MCPLOT that are intended to improve the appearance of two-dimensional tally and cross-section plots. We have also expanded the content and versatility of the MCPLOT 'help' command. Finally, we describe the initial phase of capability implementation to post-process tally data using arithmetic operations. These improvements will enable users to better display and manipulate simulation results.

Durkee, Joe W [Los Alamos National Laboratory; James, Michael R [Los Alamos National Laboratory; Waters, Laurie S [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

259

C3Bio.org - Tags: graphic  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Mickey Mouse is a... - Select an answer - Mouse Suitcase Chicken Teapot Penguin Please leave this field blank. required Problem: required Attach a screenshot: optional (.jpg,...

260

Turtle Graphics in Maple V.2  

Science Journals Connector (OSTI)

We think the Turtle Geometry [1] is a useful and ... have developed brand new implementations of the Turtle Geometry in Turbo Pascal [12] and...

Eugenio Roanes Lozano; Eugenio Roanes Macas

1994-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

Fermilab | Graphics Standards | Guidelines | Administrative Relationsh...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

the connection between Fermilab, the Department of Energy and Fermi Research Alliance, LLC Fermilab is operated by Fermi Research Alliance, LLC for the U.S. Department of...

262

Approximate inference on planar graphs using loop calculus and belief progagation  

SciTech Connect (OSTI)

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.

Chertkov, Michael [Los Alamos National Laboratory; Gomez, Vicenc [RADBOUD UNIV; Kappen, Hilbert [RADBOUD UNIV

2009-01-01T23:59:59.000Z

263

A graph-separation theorem for quantum causal models  

E-Print Network [OSTI]

A causal model is an abstract representation of a physical system as a directed acyclic graph (DAG), where the statistical dependencies are encoded using a graphical criterion called `d-separation'. Recent work by Wood & Spekkens shows that causal models cannot, in general, provide a faithful representation of quantum systems. Since d-separation encodes a form of Reichenbach's Common Cause Principle (RCCP), whose validity is questionable in quantum mechanics, we propose a generalised graph separation rule that does not assume the RCCP. We prove that the new rule faithfully captures the statistical dependencies between observables in a quantum network, encoded as a DAG, and is consistent with d-separation in a classical limit. We note that the resulting model is still unable to give a faithful representation of correlations stronger than quantum mechanics, such as the Popescu-Rorlich box.

Jacques Pienaar; Caslav Brukner

2014-10-31T23:59:59.000Z

264

Graph and matrix approaches to rough sets through matroids  

Science Journals Connector (OSTI)

Abstract Rough sets are efficient for attribute reduction and rule extraction in data mining. However, many important problems including attribute reduction in rough sets are NP-hard, therefore the algorithms to solve them are often greedy. Matroids, generalized from linear independence in vector spaces, provide well-established platforms for greedy algorithm design. In this paper, we use graph and matrix approaches to study rough sets through matroids. First, we construct an isomorphism from equivalence relations to 2-circuit matroids, and then propose graph representations of lower and upper approximations through the graphic matroid. We also study graph representations of lower and upper approximations by that of the dual of the matroid. Second, in light of the fact that the relational matrix is a representable matrix of the matroid induced by an equivalence relation, matrix representations of lower and upper approximations are obtained with the representable matrix of the matroid. In a word, borrowing from matroids, this work presents two interesting views, graph and matrix ones, to investigate rough sets.

Shiping Wang; Qingxin Zhu; William Zhu; Fan Min

2014-01-01T23:59:59.000Z

265

Name: Donald P. Greenberg Title: Director, Program of Computer Graphics; Jacob Schurman Professor of Computer Graphics  

E-Print Network [OSTI]

Global Illumination," Sponsored by Autodesk, ($200 k) · Greenberg, Donald P. (Principal), "Classrooms and Design Studios of the Future," Sponsored by Autodesk, ($150 k) · Greenberg, Donald P. (Principal), "Material Databases," Sponsored by Autodesk, ($150k) · Greenberg, Donald P. (Principal), Pratt, Kevin

Keinan, Alon

266

CSY3019 -Graphics Programming Assignment 2: Development of 3D graphics software: Java 2D (50%)  

E-Print Network [OSTI]

& Title Page · Table of contents · Introduction · Analysis · Design · Implementation · Testing. · A snooker table (L 3700mm x W 1860mm) should be positioned in the centre of the room. · The large clock (500mm diameter) should be positioned on the left side wall as you walk into the room. Additional

Hill, Gary

267

Computer Graphics Proceedings, Annual Conference Series, 2002 Graphical Modeling and Animation of Ductile Fracture  

E-Print Network [OSTI]

of Ductile Fracture James F. O'Brien University of California, Berkeley Adam W. Bargteil University a method for realistically animating duc- tile fracture in common solid materials such as plastics and metals. The effects that characterize ductile fracture occur due to interac- tion between plastic

O'Brien, James F.

268

Graph Algorithms Tours in Graphs  

E-Print Network [OSTI]

terminates only at y. Graph Algorithms 14 #12;Combining the Main and the Secondary Cycles Let C = (x a secondary cycle C starting with y. - Combine the cycles C and C into C. Return the cycle C. Graph AlgorithGraph Algorithms Tours in Graphs Graph Algorithms #12;Special Paths and Cycles in Graphs Euler Path

Bar-Noy, Amotz

269

Graph Rotation Systems for Physical Construction of Large Structures  

E-Print Network [OSTI]

), Form-Z, Rhinoceros 3D, Cadwork, 3ds Max and SketchUp. However, there are still a lot to do theoretically and practically. 9 II.2. Computer Graphics Applied to Architecture Computer Graphics techniques have been used in mostly virtual design...

Xing, Qing

2012-02-14T23:59:59.000Z

270

SUGI 15, April, 1990 SAS/GRAPH SOFTWARE MEETS THE LOGO TURTLE  

E-Print Network [OSTI]

SUGI 15, April, 1990 SAS/GRAPH® SOFTWARE MEETS THE LOGO TURTLE Michael Friendly, York University the accessible to young children (Papert, 1980) in an educational ``turtle­relative'' drawing commands­Y coordinates. This makes drawing much easier graphics component, called ``turtle graphics''. However, Logo

Friendly, Michael

271

EIA - International Energy Outlook 2008-Electricity Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

8 8 Figure 52. Growth in World Electric Power Generation and Total Energy Consumption, 1990-2030 Figure 52 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 53. World Net Electric Power Generation, 1990-2030 Figure 53 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 54. World Electricity Generation by Fuel, 2005-2030 Figure 54 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 55. World Net Electricity Generation from Nuclear Power, 1980 and 2030 Figure 55 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 56. Net Electricity Generation in the United States and China, 1980-2030 Figure 56 Data. Need help, contact the National Energy Information Center at 202-586-8800.

272

EIA - International Energy Outlook 2008-Natural Gas Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

8 8 Figure 35. World Natural Gas Consumption, 1980-2030 Figure 35 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 36. Natural Gas Consumption in North America by Country, 2005-2030 Figure 36 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 37. Natural Gas Consumption in OECD Europe, 2005-2030 Figure 37 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 38. Natural Gas Consumption in OECD Asia by Country, 2005-2030 Figure 38 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 39. Natural Gas Consumption in Non-OECD Europe and Eurasia, 2005-2030 Figure 39 Data. Need help, contact the National Energy Information Center at 202-586-8800.

273

EIA - International Energy Outlook 2007-Electricity Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Electricity Electricity International Energy Outlook 2007 Figure 60. World Electric Power Generation, 2004-2030 Figure 60 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 61. World Electric Power Generation by Region, 1980-2030 Figure 61 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 62. Average Annual Change in End-Use Sector Electricity Demand, 2004-2030 Figure 62 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 63. World Electricity Generation by Fuel, 2004 and 2030 Figure 63 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 64. Annual Growth in Electricity Generation by Region, 2004-2030 Figure 64 Data. Need help, contact the National Energy Information Center at 202-586-8800.

274

Microsoft Word - non-graphics title pages.doc  

Broader source: Energy.gov (indexed) [DOE]

43 43 Prepared by: U.S. Department of Energy Natural Gas Imports and Exports First Quarter Report 2011 LNG LNG Japan Trinidad and Tobago Canada Yemen Egypt Mexico Peru India South Korea Norway Qatar Spain United Kingdom POINTS OF IMPORT 1. Sumas, Washington 2. Eastport, Idaho 3. Whitlash / Babb / Port of Del Bonita / Sweetgrass, Montana 4. Port of Morgan, Montana / Portal, North Dakota 5. Sherwood, North Dakota 6. Noyes / Warroad, Minnesota 7. Detroit / St. Clair / Marysville, Michigan 8. Niagara Falls / Grand Island, New York 9. Waddington, New York 10. Massena / Champlain, New York 11. Highgate Springs, Vermont 12. Pittsburg, New Hampshire 13. Calais, Maine 14. Ogilby, California 15. Alamo / Hidalgo, Texas 16. McAllen / Galvan Ranch, Texas 17. Northeast Gateway Deepwater Port 18.

275

EIA - International Energy Outlook 2008-Liquid Fuels Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

Liquid Fuels Liquid Fuels International Energy Outlook 2008 Figure 26. World Liquids Production in the Reference Case, 1990-2030 Figure 26 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 27. World Production of Unconventional Liquid Fuels, 2005-2030 Figure 27 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 28. World Liquids Consumption by Sector, 2005-2030 Figure 28 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 29. World Liquids Consumption by Region and Country Group, 2005 and 2030 Figure 29 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 30. Nominal World Oil Prices in three Cases, 1980-2030 Figure 30 Data. Need help, contact the National Energy Information Center at 202-586-8800.

276

EIA - International Energy Outlook 2007-Natural Gas Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

7 7 Figure 40. World Natural Gas Consumption by End-Use Sector, 2004-2030 Figure 40 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 41. World Natural Gas Consumption by Region, 2004-2030 Figure 41 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 42. World Natural Gas Reserves by Region, 1980-2007 Figure 42 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 43. World Natural Gas Reserves by Geographic Region as of January 1, 2007 Figure 43 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 44. World Natural Gas Resources by Geographic Region, 2006-2025 Figure 44 Data. Need help, contact the National Energy Information Center at 202-586-8800.

277

EIA - International Energy Outlook 2007-Coal Graphic Data  

Gasoline and Diesel Fuel Update (EIA)

7 7 Figure 54. World Coal Consumption by Region, 1980-2030 Figure 54 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 55. Coal share of World Energy Consumption by Sector, 2004, 2015, and 2030 Figure 55 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 56. OECD Coal Consumption by Region, 1980, 2004, 2015, and 2030 Figure 56 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 57. Non-OECD Coal Consumption by Region, 1980, 2004, 2015, and 2030 Figure 57 Data. Need help, contact the National Energy Information Center at 202-586-8800. Figure 58. Coal Consumption in China by Sector, 2004, 2015, and 2030 Figure 58 Data. Need help, contact the National Energy Information Center at 202-586-8800.

278

Consolidated solutions to rectangular air duct design by graphical methods  

E-Print Network [OSTI]

equation& II, (ay/a )'( ) Q)'(p) ( )'(E) snd then vrite the diswasfons of sech verisb1eJ In order that II be n dimensioniess grouy, the exyoaents of' each of the yriaerp quantities vest edd to sero, i. e? PorJJJOsssctd Por L J 0 ~ -Bn s b - c - g... 4. ~ ~ TABLE 4 DATA FOR PLOTTRQ SCALBS OF BULB Variable Bends of Vsriable Function of Vsriable BanSe Hodulus Length of of Fune- Scale tion F4icstion of Scale Le 0. 01 to I 00 100 to 10~000 0" to 4" to 40" b" to alt I" to Bn 40...

Otts, John Graves

2012-06-07T23:59:59.000Z

279

Computer-aided Design and Graphics Final Projects  

E-Print Network [OSTI]

Rack with Hydraulic Actuators #12;40. Unicycle #12;41. Mini Baja Frame with Front Suspension #12;42. Throttle Body #12;43. Kawasaki ZX-6R Front End Suspension #12;44. Pull Cart for Golf Bag #12;45. Compound

Xue, Deyi

280

Common Pitfalls of Using QVT Relations - Graphical Debugging as Remedy  

Science Journals Connector (OSTI)

OMG's Model-Driven Architecture (MDA) has emerged as a new approach for the development of software. For this, the Query/View/Transformation (QVT) standard plays a central role, since it allows for the specification of model transformations. Nevertheless, ... Keywords: model transformations, colored petri nets, debugging

Angelika Kusel; Wieland Schwinger; Manuel Wimmer; Werner Retschitzegger

2009-06-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Graphically Geo-Coding of Sensor System Information  

E-Print Network [OSTI]

of hazardous situations in industrial areas, such as chemical plants. Hazards may occur due to misplacing of reactive chemicals. As a consequence, location and proximity information is a highly valuable source the Particle sensor network platform[5]. The CoBIs project researches embedding of sensor systems in dangerous

Beigl, Michael

282

Graphical interface for quantitative monitoring of 3D MRI data  

E-Print Network [OSTI]

The recent development of techniques in magnetic resonance imaging allows for the noninvasive monitoring of cartilage for disease progression, effects of lifestyle change, and results of medical interventions. In particular, ...

Gerber, Meredith L

2005-01-01T23:59:59.000Z

283

Computer Graphics CS537 The Flying Camera Brothers  

E-Print Network [OSTI]

, and "at point". The "hard part" is to implement the pitch/roll/yaw ops. Each one of them is simply: (i) the viewing coordinate system (u, v, n) is a right handed coordinate system; (ii) the axis n operations amount to changes of the view- ing coordinate system (u , v , n ). For example, pitching "up

Kamberov, George

284

Pacific Graphics 2009 S. Lee, D. Lischinski, and Y. Yu  

E-Print Network [OSTI]

A Shape-Preserving Approach to Image Resizing Guo-Xin Zhang1 Ming-Ming Cheng1 Shi-Min Hu1 Ralph R. Martin2

Martin, Ralph R.

285

Graphics Hardware (2007) Timo Aila and Mark Segal (Editors)  

E-Print Network [OSTI]

to take advantage of massively parallel floating point capabilities, and Folding@Home has even released

Skadron, Kevin

286

Mimbres rock art: a graphic legacy of cultural expression  

E-Print Network [OSTI]

Rock art abounds along the Mimbres River banks and drainage tributaries reflecting the rich cultural remains of the ancient Mimbres people. The Mimbres are a well established cultural group who lived in southwest New Mexico and northern Mexico from...

Tidemann, Kathryn

2012-06-07T23:59:59.000Z

287

A Graphical Model for Protein Secondary Structure Prediction  

E-Print Network [OSTI]

... ... Q EL NNTLIK V DRM W GWGK V Y S P EWVK V A K N F I ... ... I EL SNSLIK V NEM H GFGM E V T E ESVT M I

Ghahramani, Zoubin

288

Graphical Web Interface for OpenModelica Platform.  

E-Print Network [OSTI]

?? OPENMODELICA is an open-source Modelica-based modeling and simulation environment intended for industrial and academic usage. Its long-term development is supported by a non-profit organization (more)

Baloch, Adeel

2013-01-01T23:59:59.000Z

289

Grouped graphical Granger modeling for gene expression regulatory networks discovery  

Science Journals Connector (OSTI)

......Hinkley (2006) for a review]. More precisely...method to uncover gene regulatory networks for the human...As future work we plan to consider a variant...time-delayed gene regulatory networks based on temporal...et al. Modelling regulatory pathways in E.coli......

Aurlie C. Lozano; Naoki Abe; Yan Liu; Saharon Rosset

2009-06-15T23:59:59.000Z

290

Graphical Toolkits for Rapid Prototyping of Multimodal Systems: A Survey  

Science Journals Connector (OSTI)

......conceives the operation of an interactive system as a group of...composite events, system states and synchronization...have the same power as Petri nets...Moore R. Handbook of Multimodal and Spoken Dialogue Systems. (2000) The......

Fredy Cuenca; Karin Coninx; Davy Vanacken; Kris Luyten

2014-03-01T23:59:59.000Z

291

On Poisson Graphical Models Department of Computer Science  

E-Print Network [OSTI]

count data, which are increasingly ubiquitous in big-data settings such as genomic sequencing data, user are increasingly ubiquitous in big-data 1 #12;settings, including high-throughput genomic sequencing data, spatial pradeepr@cs.utexas.edu Genevera I. Allen Department of Statistics and Electrical & Computer Engineering

Ravikumar, Pradeep

292

Choreographing the extended agent : performance graphics for dance theater  

E-Print Network [OSTI]

The marriage of dance and interactive image has been a persistent dream over the past decades, but reality has fallen far short of potential for both technical and conceptual reasons. This thesis proposes a new approach ...

Downie, Marc (Marc Norman), 1977-

2005-01-01T23:59:59.000Z

293

Graphical Toolkits for Rapid Prototyping of Multimodal Systems: A Survey  

Science Journals Connector (OSTI)

......the data generated by input devices to existing applications...laser pointer and a mobile device to an external application...users can set the address and listening port of the external application...data directly to an output device (without needing an external......

Fredy Cuenca; Karin Coninx; Davy Vanacken; Kris Luyten

2014-03-01T23:59:59.000Z

294

Constructing a Cleaner Economy Info Graphic | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

More Documents & Publications Strategies for the Commercialization & Deployment of GHG Intensity-Reducing Technologies & Practices Open Government Plan 1.0 Fiscal Year 2010...

295

NLand: a Graphical Tool for Exploring NDimensional Data  

E-Print Network [OSTI]

02181 ABSTRACT Dimensional Stacking is a technique for the display of high­dimensional data involving, plotting multivariate data, visualization, dimensional stacking 1 INTRODUCTION Visualization has long been or attribute. Typical among these attributes are location, size, shape, opacity, and intensity/color. The time

Ward, Matthew

296

Predictive genomics in asthma management using probabilistic graphical models  

E-Print Network [OSTI]

Complex traits are conditions that, as a result of the complex interplay among genetic and environmental factors, have wide variability in progression and manifestation. Because most common diseases with high morbidity and ...

Himes, Blanca Elena

2007-01-01T23:59:59.000Z

297

Computer-aided Design and Graphics Final Projects  

E-Print Network [OSTI]

#12;6. Pendulum Clock #12;7. Hunting Rifle #12;8. Solar Car Motor Assembly #12;9. Airplane #12 Vaulting Table #12;31. Battery Powered Drill #12;32. Osterizer Blender #12;33. Mechanical Pencil #12 #12;43. Acoustic Guitar #12;44. Electrical Fan #12;45. Orange X Juicer #12;46. Drum Kit #12;

Xue, Deyi

298

Fermilab | Graphic Standards at Fermilab | Logo and usage  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

below. Provided are various file formats suitable for your communication needs (JPG, EPS, PNG, PDF) in four color options (NAL blue, black, gray and white). The Fermilab logo...

299

Fermilab | Graphic Standards at Fermilab | Co-Branding  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

co-branded logo from Visual Media Services. Logos are available in various file formats (EPS, JPG, PDF, PNG) and various color profiles (CMYK, RGB, PMS) in NAL blue, black, gray or...

300

G-BLASTN: accelerating nucleotide alignment by graphics processors  

Science Journals Connector (OSTI)

......pair into the global array can waste a lot of GPU memory bandwidth...each thread block as temporary storage for the global counter and...configuration CPU Memory GPU Storage OS Intel Core i7- 3820 (4-core...achieve better speedups. A long-term solution is to divide the huge......

Kaiyong Zhao; Xiaowen Chu

2014-05-15T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

A graphics architecture for ray tracing and photon mapping  

E-Print Network [OSTI]

Recently, methods were developed to render various global illumination e?ects with rasterization GPUs. Among those were hardware based ray tracing and photon mapping. However, due to current GPU??s inherent architectural limitations, the e...

Ling, Junyi

2005-11-01T23:59:59.000Z

302

Portable Graphical Tools for Concurrent Plasma Simulation October 18, 1996  

E-Print Network [OSTI]

Conference Plasma Reactor A Standardized Reactor Design for Research Purposes Experimental Model (left Faculty Sponsor: Dr. Stephen Taylor Abstract Low pressure reactors (less than 1.5 Torr) are used for large­scale simulations of these reactors. In order for Hawk to be convenient for the process engineers

303

Combining Graphical and Formal Development of Open Distributed Systems #  

E-Print Network [OSTI]

, {einarj,olaf}@ifi.uio.no 2 Institute for Energy Technology, Halden, Norway 3 BISS, FB3, University,3 , Wenhui Zhang 2 , Olaf Owe 1 , Demissie B. Aredo 2,4 1 Dept. of Informatics, University of Oslo, Norway of Bremen, Germany, einar@tzi.de 4 Norwegian Computing Center, Oslo, Norway, aredo@nr.no Abstract

Johnsen, Einar Broch

304

Combining Graphical and Formal Development of Open Distributed Systems  

E-Print Network [OSTI]

,olaf}@ifi.uio.no 2 Institute for Energy Technology, Halden, Norway 3 BISS, FB3, University of Bremen, Germany, einar Zhang2 , Olaf Owe1 , Demissie B. Aredo2,4 1 Dept. of Informatics, University of Oslo, Norway, {einarj@tzi.de 4 Norwegian Computing Center, Oslo, Norway, aredo@nr.no Abstract A specification of a software

Johnsen, Einar Broch

305

AND/OR Search Spaces for Graphical Models Rina Dechter  

E-Print Network [OSTI]

and may sometime reduce the search space exponentially. Indeed, most algorithmic advances in search- based it is hidden in the linear structure of the search space. Advanced search algorithms developed for constraint use. The AND/OR search spaces view, provides a coherent ac- count of various advanced search methods

Dechter, Rina

306

Graphical models for visual object recognition and tracking  

E-Print Network [OSTI]

We develop statistical methods which allow effective visual detection, categorization, and tracking of objects in complex scenes. Such computer vision systems must be robust to wide variations in object appearance, the ...

Sudderth, Erik B. (Erik Blaine), 1977-

2006-01-01T23:59:59.000Z

307

Exploring constructivist learning theory and course visualization on computer graphics  

Science Journals Connector (OSTI)

Constructivist learning theory has shown its advantages on learning system by improving students' interests and ability. In this paper, we introduce some research works of constructivist learning theory and some successful methods from ACM/IEEE-CS ...

Yiming Zhao; Mingmin Zhang; Shu Wang; Yefang Chen

2005-05-01T23:59:59.000Z

308

ACCELERATING REGULARIZED ITERATIVE CT RECONSTRUCTION ON COMMODITY GRAPHICS HARDWARE (GPU)  

E-Print Network [OSTI]

overhead to very moderate levels. Index Terms-- Iterative Reconstruction, Computed Tomography, Ordered Klaus Mueller Center for Visual Computing, Computer Science Department, Stony Brook University ABSTRACT) is the overall theme in many efforts to lower these exposures. Effective methods here include limiting either

Mueller, Klaus

309

ForReviewers Integrating Theoretical Components: A Graphical Model for  

E-Print Network [OSTI]

formulating a hypothesis, four avenues of194 integration (Integration Routes � IR, dashed lines in Figure 1 to form a new hypothesis on the effects of predation risk on200 disease transmission of the host while foraging.221 We do not include integration routes between identical components (e.g., laws

Prather, Chelse M.

310

GRAPHICAL HUMAN INTERFACE TO A NEUTRAL BEAM SYSTEM  

E-Print Network [OSTI]

of a magnetic confinement fusion reactor is the design for aLaboratory for Tokamak Fusion Test Reactors. The system isin the Tokamak Fusion Test Reactor and at General Atomics in

Elischer, V.

2010-01-01T23:59:59.000Z

311

Sustainability analysis of complex dynamic systems using embodied energy flows: The eco-bond graphs modeling and simulation framework  

Science Journals Connector (OSTI)

Abstract This article presents a general methodology for modeling complex dynamic systems focusing on sustainability properties that emerge from tracking energy flows. We adopt the embodied energy (emergy) concept that traces all energy transformations required for running a process. Thus, energy at any process within a system is studied in terms of all the energy previously invested to support it (up to the primary sources) and therefore sustainability can be analyzed structurally. These ideas were implemented in the bond graph framework, a modeling paradigm where physical variables are explicitly checked for adherence to energy conservation principles. The results are a novel Ecological Bond Graphs (EcoBG) modeling paradigm and the new EcoBondLib library, a set of practical ready-to-use graphical models based on EcoBG principles and developed under the Modelica model encoding standard. EcoBG represents general systems in a three-faceted fashion, describing dynamics at their mass, energy, and emergy facets. EcoBG offers a scalable graphical formalism for the description of emergy dynamic equations, resolving some mathematical difficulties inherited from the original formulation of the equations. The core elements of EcoBG offer a soundly organized mathematical skeleton upon which new custom variables and indexes can be built to extend the modeling power. This can be done safely, without compromising the correctness of the core energy balance calculations. As an example we show how to implement a custom sustainability index at local submodels, for detecting unsustainable phases that are not automatically discovered when using the emergy technique alone. The fact that we implemented EcoBondLib relying on the Modelica technology opens up powerful possibilities for studying sustainability of systems with interactions between natural and industrial processes. Modelica counts on a vast and reusable knowledge base of industrial-strength models and tools in engineering applications, developed by the Modelica community throughout decades.

Rodrigo D. Castro; Franois E. Cellier; Andreas Fischlin

2014-01-01T23:59:59.000Z

312

Graph Algorithms Special Sets in Graphs  

E-Print Network [OSTI]

{u e}. Graph Algorithms 8 #12;Example: A Vertex Cover Set Graph Algorithms 9 #12;Example: A Minimum Size Vertex Cover Set Graph Algorithms 10 #12;A Clique A set of vertices for which all possible edges * * * * * Graph Algorithms 20 #12;Independent Sets and Vertex Cover Sets Observation: I is an independent set

Bar-Noy, Amotz

313

Graph Algorithms Edge Coloring  

E-Print Network [OSTI]

: Perfect Matching Graph Algorithms 6 #12;Edge Covering An edge covering, EC E, is a set of edges #12;Example: Edge Covering Graph Algorithms 8 #12;Example: Minimal Edge Covering Graph Algorithms 9 #12;Example: Minimum Size Edge Covering Graph Algorithms 10 #12;Matching and Edge Covering Definition

Bar-Noy, Amotz

314

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

-regular bipartite graph has a perfect matching. Definition 3: A vertex cover of a graph G = (V, E) is a set Q VGraph Algorithms Robert Els¨asser 10 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

315

PDSF Utilization Graphs  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Graphs Graphs Utilization Graphs This page contains a series of graphs that use data from the PDSF batch scheduler (SGE) to show the utilization of the cluster over the past 24 hours. The graphs were generated with RRDTool and are updated approximately every 15 minutes. This graph shows the aggregate cluster CPU availablity and usage according to sgeload: 24 hour rolling usage graph (click to see long term averages) This graph shows the number of jobs being run by each group: Rolling 24 Running Jobs by Group (click to see long term averages) This is the same graph as above weighted by the clockspeed (GHz) of the node used for the job: Rolling 24 Running Jobs by Group (click to see long term averages) This graph show the number of pending jobs by group: Rolling 24 Pending Jobs

316

Graph Visualization API Library for Application Builders  

Science Journals Connector (OSTI)

Founded in 1991, Tom Sawyer Software produces quality graph-based architectures for application developers. These technologies include graph management, graph layout, graph diagramming, and graph visualization...

Franois Bertault; Wendy Feng; Uli Feier; Gabe Grigorescu

2002-01-01T23:59:59.000Z

317

Graph Algorithms Vertex Coloring  

E-Print Network [OSTI]

Coloring Definition I: A disjoint collection of independent sets that cover all the vertices in the graphGraph Algorithms Vertex Coloring Graph Algorithms #12;The Input Graph G = (V, E) a simple and undirected graph: V : a set of n vertices. E: a set of m edges. A B EF C D A B C D E F A 0 1 1 1 0 0 B 1 0

Bar-Noy, Amotz

318

Graph algorithms experimentation facility  

E-Print Network [OSTI]

minimum vertex cover and maximum clique size heuristics and some visibility and circle graph related methods. As a by-product of our implementation we obtained several results about the structure of maximum independent sets for several classes of graphs...

Sonom, Donald George

2012-06-07T23:59:59.000Z

319

Graphs, Trees Pebbles, Robots  

E-Print Network [OSTI]

Graphs, Trees Pebbles, Robots 1 #12;Outline I. Robot Arms. II. Rigid Graphs. III. Characterizations. Applications: (a) Rigid Components. 2 #12;I. Robot arms and the Carpenter's Rule Problem. Can a robot arm

Haas, Ruth

320

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

We study hidden parasupersymmetry structures in purely bosonic quantum mechanics on compact equilateral graphs. We consider a single free spinless particle on the graphs and show that the Huang-Su parasupersymmetry algebra is hidden behind degenerate spectra.

Satoshi Ohya

2012-10-29T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

Parasupersymmetry in Quantum Graphs  

E-Print Network [OSTI]

We study hidden parasupersymmetry structures in purely bosonic quantum mechanics on compact equilateral graphs. We consider a single free spinless particle on the graphs and show that the Rubakov-Spiridonov-Khare-Tomiya parasupersymmetries are hidden behind degenerate spectra.

Ohya, Satoshi

2012-01-01T23:59:59.000Z

322

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

. Definition 3: A vertex cover of a graph G = (V, E) is a set Q V , such that each edge of E is incidentGraph Algorithms Robert Els¨asser 17 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

323

Spectral characterizations of sun graphs and broken sun graphs  

E-Print Network [OSTI]

Spectral characterizations of sun graphs and broken sun graphs Romain Boulet 10 Dec 2009 Abstract- cyclic graphs. An odd (resp. even) sun is a graph obtained by appending a pendant vertex to each vertex of an odd (resp. even) cycle. A broken sun is a graph obtained by deleting pendant vertices of a sun

Paris-Sud XI, Université de

324

Convex Graph Invariants  

E-Print Network [OSTI]

Dec 2, 2010 ... where A represents the adjacency matrix of a graph, and the maximum is taken over all ...... SDPT3 - a MATLAB software package for.

2010-12-02T23:59:59.000Z

325

Spectral Graph Theory  

E-Print Network [OSTI]

REU this summer was also to examine the brain of. Caenorhabditis elegans (C. Elegans). Chklovskii formed a Laplacian matrix of the graph representing.

*D. J. Kelleher

2011-09-30T23:59:59.000Z

326

Graphs associated with semigroups  

E-Print Network [OSTI]

the empty graph is not td d t b pl t . A ~b* h 1 g ph G graph having all of its vertices and edges in G. The citations on the following pages follow the style f th ~fdt f th A t M th tt 1 ~S1 t A path is a sequence of distinct vertices, V , V... , . . . , V n' where V and V are adjacent for i 1, 2, . . . , n-l. If there exists a path between two vertices, the pair is said to be connected. A connected ~ra h is a graph in which every pair of vertices is joined by a path. The empty graph...

Baber, Stephen Asa

2012-06-07T23:59:59.000Z

327

Reasoning about Probabilistic Phenomena: Lessons Learned and Applied in Software Design  

E-Print Network [OSTI]

the graphical representations (pie and bar graph). Considercurrently displayed in a pie graph from a simulated faira goal of trying to create a pie graph that was all blue (

Lee, Hollylynne S; Lee, J. Todd

2009-01-01T23:59:59.000Z

328

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique 'canonical' form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed for Feynman graphs, they might be useful for more general graph problems.

Batkovich, D; Kompaniets, M; Novikov, S

2014-01-01T23:59:59.000Z

329

GraphState - a tool for graph identification and labelling  

E-Print Network [OSTI]

We present python libraries for Feynman graphs manipulation. The key feature of these libraries is usage of generalization of graph representation offered by B. G. Nickel et al. In this approach graph is represented in some unique 'canonical' form that depends only on its combinatorial type. The uniqueness of graph representation gives an efficient way for isomorphism finding, searching for subgraphs and other graph manipulation tasks. Though offered libraries were originally designed for Feynman graphs, they might be useful for more general graph problems.

D. Batkovich; Yu. Kirienko; M. Kompaniets; S. Novikov

2014-09-29T23:59:59.000Z

330

Querying graphs with data  

E-Print Network [OSTI]

Graph data is becoming more and more pervasive. Indeed, services such as Social Networks or the Semantic Web can no longer rely on the traditional relational model, as its structure is somewhat too rigid for the applications ...

Vrgoc, Domagoj

2014-06-27T23:59:59.000Z

331

Undirected graphs of frequency-dependent functional connectivity in whole brain networks  

Science Journals Connector (OSTI)

...Eichler et al. (2003) for spatial point processes. The definition of the residuals of the...TPOsup amygdala AMYG middle temporal gyrus MTG calcarine fissure and surrounding cortex...graphical models for the time series and point processes. Rev. Econ. 16, 1-23. Chafee...

2005-01-01T23:59:59.000Z

332

Graph degree linkage: agglomerative clustering on a directed graph  

Science Journals Connector (OSTI)

This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The ...

Wei Zhang; Xiaogang Wang; Deli Zhao; Xiaoou Tang

2012-10-01T23:59:59.000Z

333

Kinetic Pie Delaunay Graph and Its Applications  

Science Journals Connector (OSTI)

We construct a new proximity graph, called the Pie Delaunay graph, on a set of n points which is a super graph of Yao graph and Euclidean minimum spanning tree (EMST). We efficiently maintain the Pie

Mohammad Ali Abam; Zahed Rahmati; Alireza Zarei

2012-01-01T23:59:59.000Z

334

Microsoft Word - Graphics A-76 Post - MEO VV Review Report _F_.doc  

Broader source: Energy.gov (indexed) [DOE]

Visual Information Services Most Efficient Organization Post-Award Validation and Verification Review DECEMBER 2004 Office of Security and Safety Performance Assurance Visual Information Services MEO Post-Award Validation and Verification Review December 2004 Page 2 of 21 Table of Contents 1.0 INTRODUCTION 2.0 RESULTS 3.0 CONCLUSIONS Appendix A: Supplemental Information Appendix B: Lexicon Appendix C: Documentation Matrix Attachment 1.: A-76 Cost Comparison: In-House vs. Contract or ISSA Performance 1.0 INTRODUCTION The Office of Security and Safety Performance and Assurance conducted a post-award validation and verification review of the Department of Energy (DOE) Visual Information Services - Most

335

Soft MIMO Detection on Graphics Processing Units and Performance Study of Iterative MIMO Decoding  

E-Print Network [OSTI]

throughput increase of ~7x is achieved. We also compared the performances of two GPUs one with low computational power and one with high computational power. These comparisons show effect of thread serialization on algorithms with the lower end GPU...

Arya, Richeek

2012-10-19T23:59:59.000Z

336

Data-Driven Optimization for Modeling in Computer Graphics and Vision  

E-Print Network [OSTI]

22 Consideration of human ergonomics in furnitureany interior design / ergonomics factor to be applied inarrangement subject to human ergonomics is not an easy task,

Yu, Lap Fai

2013-01-01T23:59:59.000Z

337

Common Pitfalls of Using QVT Relations Graphical Debugging as Remedy* Angelika Kusel, Wieland Schwinger  

E-Print Network [OSTI]

Vienna University of Technology Austria wimmer@big.tuwien.ac.at Werner Retschitzegger University of Vienna Austria werner.retschitzegger@univie.ac.at Abstract OMG's Model-Driven Architecture (MDA) has

Hochreiter, Sepp

338

Common Pitfalls of Using QVT Relations Graphical Debugging as Remedy Angelika Kusel, Wieland Schwinger  

E-Print Network [OSTI]

Vienna University of Technology Austria wimmer@big.tuwien.ac.at Werner Retschitzegger University of Vienna Austria werner.retschitzegger@univie.ac.at Abstract OMG's Model-Driven Architecture (MDA) has

339

Interpreting the visual and cinematic style of Japanese anime using three-dimensional computer graphics  

E-Print Network [OSTI]

was once Tokyo as a secret government installation. Right next to it is the site for the 2030 Olympics event hosted by Neo-Tokyo. The name of the Olympic stadium in the film is the same as the one built in Japan for the 1964 Olympics, Yoyogi Stadium.... The 1964 Tokyo Olympics serves as a symbol of Japan's resurgence from the devastation of WWII [17]. In Akira, the 2030 Olympics symbolize the same purpose as in 1964. However, the Olympic stadium is destroyed again during the climatic battle between...

Mistry, Pradeep Champaklal

2012-06-07T23:59:59.000Z

340

|Low Graphics version Change edition | |About BBC News Feedback Help News Front Page  

E-Print Network [OSTI]

us a breathing space to phase out fossil fuels Professor Yevgeny Velikov 7/3/04 8:41 PMBBC NEWS. He told BBC News Online: "Fission is going to go on. And we'll go on burning fossil fuels too England Northern Ireland Scotland Wales Business Politics Health Education Science/Nature Technology

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

Large-scale Nanostructure Simulations from X-ray Scattering Data On Graphics Processor Clusters  

SciTech Connect (OSTI)

X-ray scattering is a valuable tool for measuring the structural properties of materialsused in the design and fabrication of energy-relevant nanodevices (e.g., photovoltaic, energy storage, battery, fuel, and carbon capture andsequestration devices) that are key to the reduction of carbon emissions. Although today's ultra-fast X-ray scattering detectors can provide tremendousinformation on the structural properties of materials, a primary challenge remains in the analyses of the resulting data. We are developing novelhigh-performance computing algorithms, codes, and software tools for the analyses of X-ray scattering data. In this paper we describe two such HPCalgorithm advances. Firstly, we have implemented a flexible and highly efficient Grazing Incidence Small Angle Scattering (GISAXS) simulation code based on theDistorted Wave Born Approximation (DWBA) theory with C++/CUDA/MPI on a cluster of GPUs. Our code can compute the scattered light intensity from any givensample in all directions of space; thus allowing full construction of the GISAXS pattern. Preliminary tests on a single GPU show speedups over 125x compared tothe sequential code, and almost linear speedup when executing across a GPU cluster with 42 nodes, resulting in an additional 40x speedup compared to usingone GPU node. Secondly, for the structural fitting problems in inverse modeling, we have implemented a Reverse Monte Carlo simulation algorithm with C++/CUDAusing one GPU. Since there are large numbers of parameters for fitting in the in X-ray scattering simulation model, the earlier single CPU code required weeks ofruntime. Deploying the AccelerEyes Jacket/Matlab wrapper to use GPU gave around 100x speedup over the pure CPU code. Our further C++/CUDA optimization deliveredan additional 9x speedup.

Sarje, Abhinav; Pien, Jack; Li, Xiaoye; Chan, Elaine; Chourou, Slim; Hexemer, Alexander; Scholz, Arthur; Kramer, Edward

2012-01-15T23:59:59.000Z

342

Computer graphic simulations of microscopic particle collisions for determining macroscopic thermodynamics along a path  

Science Journals Connector (OSTI)

The heat absorbed by an ideal monotomic gas during an isothermal expansionwhen a piston slowly moves from volume point V 1 to V 2 in a cylinderis a standard problem in thermodynamics. Students taking the SP226 Heat Light and Sound course learn that the process involves (a) an understanding of the kinetic energy loss that a gas molecule makes with the slowly moving piston called the bunt (b) the drop in internal energy of the gas as a collection which leads to a slight drop in temperature of the gas and (c) the transfer of heat from the reservoir to the gas until an equilibrium temperature is reached. This problem is modeled in two dimensions on a computer. The collisions involve Nelastic scatterers that each have a cross section of radius r 0. The heat resevoir is modeled by molecules having a random distribution of velocities at the wall boundary which is in contact with the gas. The piston is modeled as a wall which moves at the speed V wall. Thermodynamic calculations involving work heat and entropy are attempted for the model system. Adiabatic and free expansions are also simulated and compared with the well?known theoretical results. Work is extended to cover collisions involving intermolecular potentials.

Devin P. Espindle; Murray S. Korman

1994-01-01T23:59:59.000Z

343

The role of transfer-appropriate processing in the effectiveness of decision-support graphics  

E-Print Network [OSTI]

.g., Blaxton, 1989; Graf & Ryan, 1999; Horton & Nash, 1999; Leshner & Coyle, 2000; Rajaram, Srinivas, & Roediger, 1998). Blaxton (1989), for example, used TAP to predict dissociations in memory performance on five different types of memory tests?free recall... and a prospective memory test. Leshner and Coyle (2000) applied the TAP theory to research on memory for television news. Based on the TAP account of memory performance, they argue that findings in the literature suggesting poor memory for such news...

Stiso, Michael E.

2004-11-15T23:59:59.000Z

344

A Case Study in Complexity Estimation: Towards Parallel BranchandBound over Graphical Models  

E-Print Network [OSTI]

using extra memory. Mini-bucket heuristic solves relaxed problem to yield upper bounds on subproblem. context size minus mini bucket i-bound 0.19 16 Ratio of leaf nodes in probe 0.18 10 Subproblem upper bound-3730 3-4 28-37 73-108 grid 5 624-675 2 37-39 111-124 log N (n)= ii (n) Algorithm: Computing

Dechter, Rina

345

The Application of Projected Conjugate Gradient Solvers on Graphical Processing Units  

E-Print Network [OSTI]

of Krylov subspace-based solvers in high performance computing environments. Here the focus is to improve dimensional Shepp-Logan phantom. Keywords: High Performance Computing, GPU Computing, Krylov Subspace Methods increasing interest in many disciplines on the use of many-core based high performance computing (HPC

346

TeraVision: a Distributed, Scalable, High Resolution Graphics Streaming System  

E-Print Network [OSTI]

of Illinois at Chicago http://www.evl.uic.edu/cavern +rsingh@evl.uic.edu Abstract In electronically mediated

Johnson, Andrew

347

A Comparison of Time-Space Schemes for Graphical Models Robert Mateescu and Rina Dechter  

E-Print Network [OSTI]

models that can accom- modate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2 show that AOC(i) is better than the vanilla ver- sions of both VEC(i) and TDC(i), and use the guid- ing principles of AOC(i) to improve the other two schemes. Finally, we show that the improved ver- sions of VEC

Dechter, Rina

348

Computer Graphics to Show Optimal Smoothing and Trend Adjustments for Exponential Forecasts  

Science Journals Connector (OSTI)

When simulating various demand conditions and then determining the best factors for both smoothing and trend adjustments in an exponential smoothing model, both the optimal values and the...

David B. Hoffman; Ramachandran Bharath; Carol M. Carlson

1983-01-01T23:59:59.000Z

349

On the back of a cocktail napkin: An exploration of graphic definitions of lean construction  

E-Print Network [OSTI]

application to construction, D. Tech. thesis, Helsinki Univ. of Technology, Espoo, Finland, (April 3). Koskela, L., Howell, G., Ballard, G., and Tommelein, I. (2002). The foundations of lean...

Rybkowski, Zofia K.; Abdelhamid, Tariq; Forbes, Lincoln

2013-07-31T23:59:59.000Z

350

A software package for the graphical simulation of the Global Positioning System's satellite orbits  

E-Print Network [OSTI]

's center, 6 and at a nominal orbiting period of almost 12 hours. The This manuscript follows the style and format of the IEEZ T a t'0 * C~t earth's center is on one focal point of the satellite orbits. Each satellite will transmit two pseudo...****************%****k*** SUBROUTINE TRANSX(T) COMMON/E 2/E2 /ECC/ECC i /RAD/RAD i /GC/GC i /P I/ P I REAL*8 C, GC, RAD, MK, DEL, E1, E2, ECC, PI, TT REAL*8 DSIN, DCOS, DABS, DSGRT, DBLE TT=DBLE(T) C=DSQRT(GC/RAD**3) MK=C*TT ICOUNT=O DEL=1. OD-12 El=MK+ECC*DSIN(MK) 140 E2=E1...

Martinez-Lopez, Eugenio

1981-01-01T23:59:59.000Z

351

Doi:10.1145/1785414.1785436 Interactive computer graphics would rival  

E-Print Network [OSTI]

supported by a number of systems, including Google's SketchUp (http://sketchup.google.com/) and modeling

Igarashi, Takeo

352

Rapid Prototyping of Urban River Corridors Using 3D Interactive, Real-time Graphics  

E-Print Network [OSTI]

of Sheffield, which then proceeded through several levels of detail using SketchUp, until they were finalised

Romano, Daniela

353

Strong formulations for the Multi-module PESP and a quadratic algorithm for Graphical Diophantine  

E-Print Network [OSTI]

Equation Systems Laura Galli and Sebastian Stiller Abstract. The Periodic Event Scheduling Problem (PESP, Italy. E-mail: lgalli@deis.unibo.it MATHEON, Technische Universit¨at Berlin, Germany. E-mail: stiller

Nabben, Reinhard

354

PAD, a computer-aided molecular model building system utilizing two-dimensional graphical input  

E-Print Network [OSTI]

(IP)= (TX-1000) "32+1 P (IP+1) = (IY-1000) + 2+2 P (IP+2) =7 TF( ICIJT. EQ. 1. 0R. QBREAK)P (IP+2) ="17 P( P+ )="014 P (I P+4 ) = "?nn00 TP=IF+2 QBREAK=. FALSE. GO TO 100 IDE 1!TIF TC A TTOI'I NCDULE CALL CIC( "2400, 6) Pc J UW '7'7 45 101..., GT. 9)GC TO 1166 A )QCHEY=. TPUE. FLAG CHECK IF(QPEN. AND. B(1 1) . EQ. F1)G TC 1055 IF(QPEN. A", ID. B( 1 1 ) . FQ. FC)QPEN=. FAL. E. IF( B(11 ) . EC. F1)G TC' 1051 IF( X. GE. 1 "2 . OR. IY. GE. 1025)GO TO 1C14 IF(IX. LE. 1JO. CR. IY. LE. 100)GO...

White, William Gerald

2012-06-07T23:59:59.000Z

355

Eng. Graphics Communication EMEC 103 (CAE I) -Fall 2011 -Class Syllabus  

E-Print Network [OSTI]

Works. By registering with Autodesk at http://www.autodesk.com/edcommunity, students can download a copy of the software

Dyer, Bill

356

AEROgui: A graphical user interface for the optical properties of aerosols  

Science Journals Connector (OSTI)

Atmospheric aerosols have an uncertain effect on climate, and serious impact on human health. The uncertainty in the aerosols role on climate has several sources. First, aerosols present a great spatial and temporal variability. The spatial variability ...

R. Pedrs; J.L. Gmez-Amo; C.R. Marcos; M.P. Utrillas; S. Ganda; F. Tena; J.A. Martinez Lozano

357

DataHigh: Graphical user interface for visualizing and interacting with high-dimensional neural activity  

E-Print Network [OSTI]

, Palo Alto Medical Foundation, Palo Alto, CA. [4], factor analysis (FA) [6], Gaussian-process factor methods. These latent variables define a reduced-dimensional space in which we can study how population to visual- ize the population activity directly in the reduced-dimensional space, whose optimal

Yu, Byron

358

Position-based Methods for the Simulation of Solid Objects in Computer Graphics  

E-Print Network [OSTI]

. There exists a variety of survey papers [GM97, MTV05,NMK 06,MSJT08,BETC12] which document this development

Teschner, Matthias

359

INTERNATIONAL CONFERENCE ON GEOMETRY AND GRAPHICS 2014 ISGG 48 AUGUST, 2014, INNSBRUCK, AUSTRIA  

E-Print Network [OSTI]

on Martin Disteli's work and on the authors' previous results where Camus' concept of an auxiliary curve because of G2-contact. In view of the Camus Theorem, the spatial analogue of the pole tangent is a skew, Camus Theorem 1. INTRODUCTION Let the motions of two gears 2, 3, against the gear box 1 be given, i

Stachel, Hellmuth

360

Graphics Hardware (2002), pp. 111 Thomas Ertl, Wolfgang Heidrich, and Michael Doggett (Editors)  

E-Print Network [OSTI]

accelerator performs ray casting by calculating the path of the ray through the volume using a programmable and post-classification is performed in hardware, giving immediate feedback to changes in the visualization of a dataset. Adding new features, such as pre-integrated classification, can be accomplished using

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

Graphical Procedure for Comparing Thermal Death of Bacillus stearothermophilus Spores in Saturated and Superheated Steam  

Science Journals Connector (OSTI)

...stearothermophilus Spores in Saturated and Superheated Steam James J. Shull 1 Robert R. Ernst Wilmot...Bacillus stearothermophilus in saturated steam was characterized by three phases: (i...death curve of the spores in saturated steam. A jacketed steam sterilizer, equipped...

James J. Shull; Robert R. Ernst

1962-09-01T23:59:59.000Z

362

Exploiting a Graphical Programming Paradigm to Facilitate Rigorous Verification of Embedded Software  

Science Journals Connector (OSTI)

......leading to relatively low costs for each single automation...RAH-loc-LS RAM-loc-BS-isv RAM-loc-THP-L RAH-loc-BS-isv GET GET GET PUT...changing requirements at low costs. In other words, safety-related...the Safety Systems of Nuclear Power Stations, International......

Wolfgang A. Halang; Bernd Krmer; Leszek Trybus

1995-01-01T23:59:59.000Z

363

Generation of random numbers on graphics processors: Forced indentation in silico of the bacteriophage HK97  

E-Print Network [OSTI]

, University of Massachusetts, Lowell, MA, 01854 2Department of Mathematics, University of Massachusetts, and Lagged Fibonacci algorithms on the GPU. We profiled the performance of these generators in terms subsecond timescale using realistic force- loads. We found that the mechanical response of HK97 critically

Barsegov, Valeri

364

Top 5 Maps and Interactive Graphics of 2014 | Department of Energy  

Energy Savers [EERE]

we dug into a far-out idea about harnessing solar power in space and beaming it down to Earth through lasers and microwaves. Sounds unlikely -- but all of the technology already...

365

Graphical Programming: A systems approach for telerobotic servicing of space assets  

SciTech Connect (OSTI)

Satellite servicing is in many ways analogous to subsea robotic servicing in the late 1970`s. A cost effective, reliable, telerobotic capability had to be demonstrated before the oil companies invested money in deep water robot serviceable production facilities. In the same sense, aeronautic engineers will not design satellites for telerobotic servicing until such a quantifiable capability has been demonstrated. New space servicing systems will be markedly different than existing space robot systems. Past space manipulator systems, including the Space Shuttle`s robot arm, have used master/slave technologies with poor fidelity, slow operating speeds and most importantly, in-orbit human operators. In contrast, new systems will be capable of precision operations, conducted at higher rates of speed, and be commanded via ground-control communication links. Challenges presented by this environment include achieving a mandated level of robustness and dependability, radiation hardening, minimum weight and power consumption, and a system which accommodates the inherent communication delay between the ground station and the satellite. There is also a need for a user interface which is easy to use, ensures collision free motions, and is capable of adjusting to an unknown workcell (for repair operations the condition of the satellite may not be known in advance). This paper describes the novel technologies required to deliver such a capability.

Pinkerton, J.T. [New Mexico Univ., Albuquerque, NM (United States). Dept. of Computer Science; McDonald, M.J.; Palmquist, R.D. [Sandia National Labs., Albuquerque, NM (United States); Patten, R. [Oceaneering Space Systems, Webster, TX (United States)

1993-08-01T23:59:59.000Z

366

Computational Aesthetics in Graphics, Visualization, and Imaging (2012) D. Cunningham and D. House (Editors)  

E-Print Network [OSTI]

a visual feedback loop of eDavid, our painting robot. The machine aims at simulating the human painting to their aesthetic properties. eDavid is a one-arm industry robot that we modified and equipped for painting purposes paint. This was our rationale to realize the set-up with an industry robot and not just a pen plotter

Deussen, Oliver

367

Exploiting a Graphical Programming Paradigm to Facilitate Rigorous Verification of Embedded Software  

Science Journals Connector (OSTI)

......growing concern for safety and environmental...that hardware and software are closely coupled...tolerance methods. Software failures, on the...mental events such as radiation or electric impulses...Dependability of software cannot be achieved...workable way of safety licensing by exploiting......

Wolfgang A. Halang; Bernd Krmer; Leszek Trybus

1995-01-01T23:59:59.000Z

368

A graphical preprocessing interface for non-conforming spectral element solvers  

E-Print Network [OSTI]

Page 1 Left: Discretization of a square using 50?50 1 st order elements by FEM. Right: Discretizations of a square using 50 th -order single domain with SM... representative numerical technique of this kind is the Finite Element Method (FEM) [2]. It uses small finite number of elements with low order approximation functions (Fig. 1 left). When engineering models have complex geometry, FEM discretizes the geometry (e...

Kim, Bo Hung

2009-06-02T23:59:59.000Z

369

IEEE/EG International Symposium on Volume Graphics (2010) R. Westermann and G. Kindlmann (Editors)  

E-Print Network [OSTI]

of the well known 2D object-aligned texture stack based technique. From this our novel scheme inherits stack-switching artifacts which are avoided by our novel method. Our approach also shows benefits.'s [LL94] ideas to develop techniques for 2D object jens.krueger@dfki.de aligned stacks

Utah, University of

370

A Graphical Tool to Visualize Predicted Minimum Delay Flights Tanujit Dey, David Phillips, and Patrick Steele  

E-Print Network [OSTI]

destinations from the airports Bal- timore Washington International (BWI) and Dulles International (IAD the predictions of both the minimum-delay and quickest routes for a given origin and destination airport using an airport with the color indicating average delay experienced, and the diameter of each circle representing

Phillips, David

371

Development of a Graphic User Interface for an Overhead Conductor Sag Instrument  

E-Print Network [OSTI]

Research Center program. Our thanks is given to Entergy for its support of this project and the prior to this project: Baj Agrawal Arizona Public Service Company Industry advisor Floyd Galvan Entergy Industry advisor Robert G. Olsen Washington State University University advisor Lance Priez Entergy Industry advisor John

372

Conversion of three-dimensional graphic building models into input data for building energy calculation program  

E-Print Network [OSTI]

and total floor area using the revision screens must to be emphasized. Figures 6 and 7 show the EnerCAD 92. 06 revision screens. 28 1. Proj. : OFFICE BUILDING 2. Site: ROCHESTER, NBW YORK 8 3. Rev. No. : SAMPLE CASE PAGE 1 4. Building Type: Office... and E. ter for MAIN MENU 08-30-1993 00 46 34 Fig. 6. EnerCAD 92. 06 first revision screen Proj . OFFICE BUILDING Sate. ROCHESTER, NEW YORK 4 Rev. No SAMpLE CAsE PAGE 2 The followrng d:faults were derrved f om your Input. Occ p ol' = 290 persors H W...

Hayek, Raja Fares

2012-06-07T23:59:59.000Z

373

'~' Computer Graphics, Volume 23, Number 3, July 1989 VOXEL SPACE AUTOMATA  

E-Print Network [OSTI]

into the voxel environ- ment, allowing accurate simulation of reaction to light includ- ing heliotropism. CR processes, illumination, heliotropism, radiosity t Author's current address: Apple Computer, 20525 Mariani

Turk, Greg

374

Tuesday, January 6, 2009 Today's Paper Video Columns Blogs Graphics Newsletters & Alerts New! Journal Community  

E-Print Network [OSTI]

in the U.S. "It's a lot more than just some boring subject that everybody has to take in school," says Ms job's median income and growth potential. Mathematicians' annual income was pegged at $94,160, but Ms. Dairy Farmer Scott Brundage Email Printer Friendly Text SizeShare: Yahoo Buzz MARKETPLA Edit ' Pi k Page

Rollins, Andrew M.

375

Tuesday, January 6, 2009 Today's Paper Video Columns Blogs Graphics Newsletters & Alerts New! Journal Community  

E-Print Network [OSTI]

that everybody has to take in school," says Ms. Courter, a research mathematician at mental images Inc., a maker considers pay, which was determined by measuring each job's median income and growth potential The Worst 1. Mathematician 200. Lumberjack 2. Actuary 199. Dairy Farmer 3. Statistician 198. Taxi Driver 4

Morrow, James A.

376

A computerized graphical approach to the solution of the machining economics problem  

E-Print Network [OSTI]

. 13. Editing Mode Example. 14. List of Machining Parameters No. 1 15. List of Machining Parameters No. 2 16. List of Machining Parameters No. 3. . . . . . 17. List of Machining Parameters No. 4. . . . . . 18. Default Production Cost Contour... in an adaptive procedure can be viewed as finding an optimum point within the constrained surface of a defined index of performance. Secondly, there exists a wide body of industrial data which also addresses the MEP. Some sources [12, 13, 14] provide industry...

Kirksharian, Aron

2012-06-07T23:59:59.000Z

377

Creating Your App Icon and Additional Graphics for the App Store  

Science Journals Connector (OSTI)

By this time, youve almost completed the entire process of designing your application and have handed it off to your developer for development. While you can add the app icon to the bundle with your other assets...

Sian Morson

2014-01-01T23:59:59.000Z

378

Graphics and Semantics: The Relationship between What Is Seen and What Is Meant in Icon Design  

Science Journals Connector (OSTI)

Visual icons can be considered as a means for ... the relationship between the users interpretation of icons and the meaning that designers intend icons to convey. Focussing on interface users understanding of

Sarah Isherwood

2009-01-01T23:59:59.000Z

379

PERCEPTUAL COLOR SPACES FOR COMPUTER GRAPHICS Gary W. Meyer and Donald P. Greenberg  

E-Print Network [OSTI]

de L'Eclairage (CIE). Since color television is based on the CIE color notation system, these uniformcopyright notice and the title of the publication and its date appear, and notice is given that copying

Meyer, Gary

380

A digital color CRT image and graphics display for data analysis  

E-Print Network [OSTI]

changing information as projected arrival and departure times and ticket availability. The CRT terminal provides a concise display of this frequently up-dated information that both the ticket agent and the public can readily un- derstand. Research... to the non-technical public. For example, many real estate offices now employ computers to store and re- trieve information on listed properties. With the addition of a color image display, the agent could call up color- coded maps of cities...

Bruns, Francis Joseph

2012-06-07T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Microsoft Word - Graphics A-76 Post - MEO VV Review Report _F...  

Broader source: Energy.gov (indexed) [DOE]

- MEO VV Review Report F.doc More Documents & Publications Microsoft Word - NNSA Logistics A-76 Post - MEO VV Review Report 111.doc A-76 QUESTIONS AND ANSWERS...

382

Large-scale Nanostructure Simulations from X-ray Scattering Data On Graphics Processor Clusters  

E-Print Network [OSTI]

nanodevices (e.g. , photovoltaic, energy storage, battery,nanodevices (e.g. , photovoltaic, energy storage, battery,

Sarje, Abhinav

2012-01-01T23:59:59.000Z

383

Journal for Geometry and Graphics Volume 11 (2007), No. 1, 1526.  

E-Print Network [OSTI]

] that the centroid, the Gergonne point, and the Nagel point are the only centers for which (the lengths of) BPa, CPb. In this note, we investigate the locus of those centers for which BPa, CPb, and APc are quasi-linear in a, b, and we define the intercepts x, y, and z of P by x = BPa, y = CPb, z = APc (1) (see Fig. 1). Here, BPa

Stachel, Hellmuth

384

High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion  

E-Print Network [OSTI]

transparent. 5. Local vs. Global Conditions for Success:The conditions required for the success of our methods as

Anandkumar, Animashree; Tan, Vincent Y.F.; Huang, Furong; Willsky , Alan S.

2012-01-01T23:59:59.000Z

385

Instability of graphical strips and a positive answer to the Bernstein ...  

E-Print Network [OSTI]

... by N a Riemann- ian non-unit normal to S and with ? = N/|N| the Riemannian Gauss ...... this, we consider (r1,s1),(r2,s2) so that ((R + r1) sin(s1/R),. h0(s1)) =.

Donatel

2010-11-04T23:59:59.000Z

386

Specification of Distributed Systems with a Combination of Graphical and Formal Languages  

E-Print Network [OSTI]

for Energy Technology N-1751 Halden, Norway wenhuiz@hrp.no Olaf Owe Department of Informatics University of Oslo, Norway olaf@ifi.uio.no Demissie B. Aredo Institute for Energy Technology N-1751 Halden, Norway. Johnsen Department of Informatics University of Oslo, Norway einarj@ifi.uio.no Wenhui Zhang Institute

Johnsen, Einar Broch

387

Specification of Distributed Systems with a Combination of Graphical and Formal Languages #  

E-Print Network [OSTI]

for Energy Technology N­1751 Halden, Norway wenhuiz@hrp.no Olaf Owe Department of Informatics University of Oslo, Norway olaf@ifi.uio.no Demissie B. Aredo Institute for Energy Technology N­1751 Halden, Norway. Johnsen Department of Informatics University of Oslo, Norway einarj@ifi.uio.no Wenhui Zhang Institute

Johnsen, Einar Broch

388

Graphical Representation of Climate-Based Daylight Performance to Support Architectural Design  

E-Print Network [OSTI]

Many conventional daylighting design tools are limited in that each simulation represents only one time of year and time of day (or a single, theoretical overcast sky condition). Since daylight is so variable due to the ...

Kleindienst, Sin

389

A wireless sensor-based mobile music environment complied from a graphical language  

E-Print Network [OSTI]

In this thesis I demonstrate a framework for a wireless sensor-based mobile music environment. Most prior work has not been truly portable. Those that were have focused on external data as opposed to properties of the ...

Jacobs, Robert N. (Robert Nathan)

2007-01-01T23:59:59.000Z

390

Sorender: an interactive graphical interface from Softimage 3D TM to Renderman TM  

E-Print Network [OSTI]

Visualizer does not [11,12, 14, 31]. 12 PROBLEM STATEMENT The problem this thesis addresses is creating an interface from Softimage 3D to RenderMan. Softimage 3D is easily the most popular animation system in the Texas A & M Visualization Laboratory... Visualizer does not [11,12, 14, 31]. 12 PROBLEM STATEMENT The problem this thesis addresses is creating an interface from Softimage 3D to RenderMan. Softimage 3D is easily the most popular animation system in the Texas A & M Visualization Laboratory...

Walvoord, John David

2012-06-07T23:59:59.000Z

391

Figure 6.1. A 2-to-1 multiplexer. (a) Graphical symbol  

E-Print Network [OSTI]

.25. A BCD-to-7-segment display code converter. ce 1 0 1 1 1 1 1 w0 a 1 b 0 1 1 1 1 0 1 1 0 1 0 0 w1 0 1 1 0 (a) Code converter w0 a w1 b c dw2 w3 e f g a g bf d (b)

Kalla, Priyank

392

Accelerated rescaling of single Monte Carlo simulation runs with the Graphics Processing Unit (GPU)  

E-Print Network [OSTI]

and S. Andersson-Engels, Accelerated Monte Carlo models toAccelerated rescaling of single Monte Carlo simulation runsreported on online, GPU- accelerated MC simulations. Along

Yang, Owen; Choi, Bernard

2013-01-01T23:59:59.000Z

393

Foundations of Computer Graphics Online Lecture 8: OpenGL 2  

E-Print Network [OSTI]

floor to all white, added global for teapot and teapotloc, moved geometry to new header file § Demo 0 GLfloat teapotloc = -0.5 ; // ** NEW ** where the teapot is located GLint animate = 0 ; // ** NEW § Matrix Stacks and Transforms (draw 4 pillars) § Depth testing (Z-buffering) § Animation (moving teapot

California at Berkeley, University of

394

Computer Graphics International 2011 Interactive Extraction and Re-Design of Sweep Geometries  

E-Print Network [OSTI]

; B: user draws two strokes (yel- low) to extract the teapot body as a stationary, rotational sweep; C to the teapot body). Two different modified versions of the handle were added for variety. We choose to focus

O'Brien, James F.

395

A graphical method for the construction of rays and travel times in spherically layered media  

Science Journals Connector (OSTI)

...geometric properties as the inner part of the original ray. DIFFERENTIAL EQUATIONS FOR t~AYS IN TANGENTIALLY ISOTROPIC ~-~/[EDIA Consider a ray in a tangentially isotropic medium as defined above. At a point A an element of a ray may be described by the...

Klaus Helbig

396

A graphical interface for the integration of algorithm animations / by Christopher James Roda  

E-Print Network [OSTI]

. A Command Router C. B Environment Liaison C. C Outpnt Dispatch D GLOSSARY VITA LIST OF FIGURES FIGURE Page 1 A Simple Animation Digraph. . . . . . 2 A More Sophisticated Animation Digraph 3 Interface Appearance Upon Invocation 4 Interface...

Roda, Christopher James

1992-01-01T23:59:59.000Z

397

O:\\GRAPHICS\\FACTSH~1\\MONTICEL\\millsite_restoration_web.pmd  

Office of Legacy Management (LM)

July 2001 United States Department of Energy Grand Junction Office The U.S. Department of Energy transferred a former uranium mill tailings site and adjacent government-owned...

398

High-throughput Characterization of Porous Materials Using Graphics Processing Units  

E-Print Network [OSTI]

framework atoms. Using a parallel flood fill CPU algorithm,segmentation using a parallel flood fill (also known as seeddescribed in Ref. 39 Flood fill is a recursive algorithm to

Kim, Jihan

2013-01-01T23:59:59.000Z

399

An interactive computer graphics interface for the introduction of fuzzy inference in environmental education  

Science Journals Connector (OSTI)

......behavior of the aquatic ecosystem under a large...Mills K.E. Aquatic ecosystem protection and restoration: advances in...Attitudes to wetland restoration in Oxfordshire...in models of aquatic ecosystems. Ecological......

Irene A. Ioannidou; Stephanos Paraskevopoulos; Panagiotis Tzionas

2006-07-01T23:59:59.000Z

400

The role of fluency in a mathematics item with an embedded graphic: interpreting a pie chart  

Science Journals Connector (OSTI)

The purpose of this study was to identify the pedagogical knowledge relevant to the successful completion of a pie chart item. This purpose was achieved through ... olds required for the successful solution of a

Carmel Mary Diezmann; Tom Lowrie

2009-10-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

E-Print Network 3.0 - associations graphic analysis Sample Search...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Group Collection: Computer Technologies and Information Sciences 55 Bibliography 1. Color Vision Summary: . Visual Perception: Physiology, Psychology, and Ecology, 2nd...

402

Protein Quaternary Fold Recognition Using Conditional Graphical Models Yan Liu Jaime Carbonell  

E-Print Network [OSTI]

02139 pweigele@mit.edu Abstract Protein fold recognition is a crucial step in infer- ring biological- acid sequences is protein fold recognition and alignment. Given a target protein fold 1 , the task-to-topology alignment against the fold. There are different kinds of protein folds based on their structural properties

Carbonell, Jaime

403

Densities in graphs and matroids  

E-Print Network [OSTI]

|E(H)| |V (H)|?1 ? |E(T)| |V (T)|?1 = 1 for all non-trivial subgraphs of T. In general, a balanced graph G is a graph such that |E(H)| |V (H)| ? |E(G)| |V (G)| and a 1-balanced graph is a graph such that |E(H)| |V (H)|?1 ? |E(G)| |V (G)|?1 for all non...

Kannan, Lavanya

2009-05-15T23:59:59.000Z

404

Exploring the role of graph spectra in graph coloring algorithm performance  

Science Journals Connector (OSTI)

This paper considers the challenge of recognizing how the properties of a graph determine the performance of graph coloring algorithms. In particular, we examine how spectral properties of the graph make the graph coloring task easy or hard. We address ... Keywords: Algorithm selection, Branch and bound, DSATUR, Graph coloring, Graph invariants, Graph spectra, LP-relaxation

Kate Smith-Miles, Davaatseren Baatar

2014-10-01T23:59:59.000Z

405

Exact algorithm for graph homomorphism and locally injective graph homomorphism  

Science Journals Connector (OSTI)

For graphs G and H, a homomorphism from G to H is a function @f:V(G)->V(H), which maps vertices adjacent in G to adjacent vertices of H. A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H. ... Keywords: Exact algorithm, Graph algorithms, Graph homomorphism, H(2,1)-labeling, Locally injective homomorphism

Pawe? Rzewski

2014-07-01T23:59:59.000Z

406

Extremal Graph Numbers of Graphs on Few May 4, 2012  

E-Print Network [OSTI]

Extremal Graph Numbers of Graphs on Few Vertices John Kim May 4, 2012 1 Introduction Let H this number to be the extremal graph number of H on n vertices, and we denote it by ex(n, H). When H(n, K3) n 2 2 . A precise formula for ex(n, K3) is given by: ex(n, K3) = n 2 n + 1 2 . The extremal

Zeilberger, Doron

407

How to Resum Feynman Graphs  

E-Print Network [OSTI]

In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing but the percentage of Hepp's sectors in which the tree is leading the ultraviolet analysis. We explain how they allow to reshuffle the divergent series formulated in terms of Feynman graphs into convergent series indexed by the trees that these graphs contain. The Feynman graphs to be used are not the ordinary ones but those of the intermediate field representation, and the result of the reshuffling is called the Loop Vertex Expansion.

Vincent Rivasseau; Zhituo Wang

2013-09-24T23:59:59.000Z

408

Fast iterative graph computation with block updates  

Science Journals Connector (OSTI)

Scaling iterative graph processing applications to large graphs is an important problem. Performance is critical, as data scientists need to execute graph programs many times with varying parameters. The need for a high-level, high-performance programming ...

Wenlei Xie; Guozhang Wang; David Bindel; Alan Demers; Johannes Gehrke

2013-09-01T23:59:59.000Z

409

L21: "Irregular" Graph Algorithms  

E-Print Network [OSTI]

11/11/10 1 L21: "Irregular" Graph Algorithms November 11, 2010 Administrative ·Class cancelled Monday, November 22, 11:59 PM Today we will cover Successive Over Relaxation. Here is the sequential code ·Irregular parallel computation - Sparse matrix operations (last time) and graph algorithms (this time

Hall, Mary W.

410

Phylogenetic Toric Varieties on Graphs  

E-Print Network [OSTI]

We define the phylogenetic model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. If the underlining graph is a tree, the model has a parametrization that can be expressed in terms of the tree...

Buczynska, Weronika J.

2010-10-12T23:59:59.000Z

411

Contraction semigroups on metric graphs  

E-Print Network [OSTI]

The main objective of the present work is to study contraction semigroups generated by Laplace operators on metric graphs, which are not necessarily self-adjoint. We prove criteria for such semigroups to be continuity and positivity preserving. Also we provide a characterization of generators of Feller semigroups on metric graphs.

Vadim Kostrykin; Jurgen Potthoff; Robert Schrader

2008-02-26T23:59:59.000Z

412

Contractions of planar graphs in polynomial time?  

E-Print Network [OSTI]

Contractions of planar graphs in polynomial time? Marcin Kami´nski??1 , Dani¨el Paulusma2 that for every graph H, there exists a polyno- mial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological minors of embedded (plane) graphs and show that a plane

Dimitrios, Thilikos

413

Some Remarks on Definability of Process Graphs  

E-Print Network [OSTI]

them in the context of the well- known process algebras BPA and BPP. For a process graph G, the density going from s to infinity" exist in G. For BPA-graphs we discuss some tentative findings about-definability results, stating that certain process graphs are not BPA-graphs, and stronger, not even BPA

Klop, Jan Willem

414

Extremal Graph Problems, Degenerate Extremal Problems,  

E-Print Network [OSTI]

Extremal Graph Problems, Degenerate Extremal Problems, and Supersaturated Graphs Mikl´os Simonovits´an-type extremal problem. The graphs attaining the maximum will be called extremal and their family will be denoted and multi- ple edges. In 1940, P. Tur´an posed and solved the extremal problem of Kp+1, the complete graph

Simonovits, Miklós

415

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming  

E-Print Network [OSTI]

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming Gregoire Dooms, Yves constraint programming by introducing CP(Graph), a new computation domain focused on graphs including a new and its associated propagator are sketched. CP(Graph) is in- tegrated with finite domain and finite sets

Deville, Yves

416

Transforming a graph into a 1-balanced graph  

Science Journals Connector (OSTI)

Let G be a non-trivial, loopless graph and for each non-trivial subgraph H of G, let g(H)=|E(H)||V(H)|-@w(H). The graph G is 1-balanced if @c(G), the maximum among g(H), taken over all non-trivial subgraphs H of G, is attained when H=G. This quantity ... Keywords: Fractional arboricity, Molecular, Strongly balanced, Uniformly dense

Lavanya Kannan; Arthur Hobbs; Hong-Jian Lai; Hongyuan Lai

2009-01-01T23:59:59.000Z

417

Standards for graph algorithm primitives  

E-Print Network [OSTI]

It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building ...

Mattson, Tim

418

Graph anomalies in cyber communications  

SciTech Connect (OSTI)

Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.

Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory

2011-01-11T23:59:59.000Z

419

Are Pixel Graphs Are Better at Representing Information than Pie Graphs?  

Science Journals Connector (OSTI)

This study investigates whether pixel graphs more accurately represent percentage based data than pie graphs or bar graphs. Participants were asked ... representing large quantities of percentage based data than

Jolie Bell; Jim Davies

2010-01-01T23:59:59.000Z

420

Multilevel spectral clustering : graph partitions and image segmentation  

E-Print Network [OSTI]

While the spectral graph partitioning method gives high quality segmentation, segmenting large graphs by the spectral method is computationally expensive. Numerous multilevel graph partitioning algorithms are proposed to ...

Kong, Tian Fook

2008-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

Tables and graphs of electron-interaction cross sections from 10 eV to 100 GeV derived from the LLNL Evaluated Electron Data Library (EEDL), Z = 1--100  

SciTech Connect (OSTI)

Energy-dependent evaluated electron interaction cross sections and related parameters are presented for elements H through Fm (Z = 1 to 100). Data are given over the energy range from 10 eV to 100 GeV. Cross sections and average energy deposits are presented in tabulated and graphic form. In addition, ionization cross sections and average energy deposits for each shell are presented in graphic form. This information is derived from the Livermore Evaluated Electron Data Library (EEDL) as of July, 1991.

Perkins, S.T.; Cullen, D.E. (Lawrence Livermore National Lab., CA (United States)); Seltzer, S.M. (National Inst. of Standards and Technology (NML), Gaithersburg, MD (United States). Center for Radiation Research)

1991-11-12T23:59:59.000Z

422

Algebraic connectivity and graph robustness.  

SciTech Connect (OSTI)

Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.

Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T. (University of New Mexico)

2009-07-01T23:59:59.000Z

423

SLQ: a user-friendly graph querying system  

Science Journals Connector (OSTI)

Querying complex graph databases such as knowledge graphs is a challenging task for non-professional users. In this demo, we present SLQ, a user-friendly graph querying system enabling schemales and structures graph querying, where a user need not describe ... Keywords: graph databases, keyword query, schemaless graph querying

Shengqi Yang; Yanan Xie; Yinghui Wu; Tianyu Wu; Huan Sun; Jian Wu; Xifeng Yan

2014-06-01T23:59:59.000Z

424

NLS ground states on graphs  

E-Print Network [OSTI]

We investigate the existence of ground states for the subcritical NLS energy on metric graphs. In particular, we find out a topological assumption that guarantees the nonexistence of ground states, and give an example in which the assumption is not fulfilled and ground states actually exist. In order to obtain the result, we introduce a new rearrangement technique, adapted to the graph where it applies. Owing to such a technique, the energy level of the rearranged function is improved by conveniently mixing the symmetric and monotone rearrangement procedures.

Riccardo Adami; Enrico Serra; Paolo Tilli

2014-06-16T23:59:59.000Z

425

On Edge Szeged Index of Bridge Graphs  

Science Journals Connector (OSTI)

Corollary 2. Let H be any graph with fixed vertex $$ v $$ .... Then the edge Szeged index of the bridge

Fuqin Zhan; Youfu Qiao

2013-01-01T23:59:59.000Z

426

A heuristic algorithm for graph isomorphism  

E-Print Network [OSTI]

polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...

Torres Navarro, Luz

1999-01-01T23:59:59.000Z

427

Hybrid motion graph for character motion synthesis  

Science Journals Connector (OSTI)

Objective: This paper proposes a novel framework of Hybrid Motion Graph (HMG) for creating character animations, which enhances the graph-based structural control by motion field representations for efficient motion synthesis of diverse and interactive ... Keywords: Motion fields, Motion graph, Motion synthesis, Motion template, Motion transition

Weiwei Xing; Xiang Wei; Jian Zhang; Cheng Ren; Wei Lu

2014-02-01T23:59:59.000Z

428

THE TUKEY ORDER FOR GRAPHS 1. Introduction  

E-Print Network [OSTI]

THE TUKEY ORDER FOR GRAPHS 1. Introduction Given a graph G, we let VG stand for the vertex set of G. For graphs G without isolated vertices, the Tukey order can be characterized thus: () G H iff there exist) is called a (generalized) Galois-Tukey connection (abbreviated GT-connection) from R to S if the following

Nyikos, Peter J.

429

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect (OSTI)

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

Schild, Aaron V [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

430

IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 33, NO. 7, JULY 2014 1551 A Unified Graphical Models Framework for  

E-Print Network [OSTI]

is with Auxogyn, Inc., Menlo Park, CA 94025 USA (e-mail: fmoussavi@auxogyn.com). Y. Wang and P. Lorenzen are with Auxogyn, Inc., Menlo Park, CA 94025 USA. J. Oakley and D. Russakoff are with the Voxeleron, LLC, San human em- bryos reach critical developmental milestones [38] and respond to chromosomal abnormalities [6

Gould, Stephen

431

SPIE Electronic Imaging 2007, Computational Imaging V Keynote Why do Commodity Graphics Hardware Boards (GPUs) work so  

E-Print Network [OSTI]

have been emerging [1][2], and the folding@home [3] distributed supercomputing effort will also soon

Mueller, Klaus

432

Rigorous pretesting, including insights from social science, could improve hurricane forecast graphics aimed at the general public.  

E-Print Network [OSTI]

(Pielke and Landsea 1999; Pielke and Pielke 1997), technological and scientific advances (Rappaport to as the "Tropical Cyclone Track and Watches/Warning," in interviews and by the media it has been given several). When a tropical cyclone threate

Colorado at Boulder, University of

433

Journal of Computer Graphics Techniques Vol. 3, No. 3, 2014 http://jcgt.org A Simple Method for Correcting  

E-Print Network [OSTI]

speculate that one cause is that many popular polygon- based 3D modeling tools, such as SketchUp, use double

Plotkin, Joshua B.

434

german research 2/201218 Report Millions of snapshots are floating through the Internet computer graphics experts are  

E-Print Network [OSTI]

sky, the Golden Gate Bridge in the billow- ing morning fog over San Francisco Bay or New York's Statue

Goesele, Michael

435

The Effectiveness of the Hybrid Graphical Representation Method in Visually Combining and Communicating Logical and Spatial Relationships between Scheduled Activities  

E-Print Network [OSTI]

as explained in section 4.7 in Table 4.5..?????????... 79 Table 5.3 The outcomes of the six Shapiro-Wilk normality analyses.?.. 80 Table 5.4 The Kruskal-Wallis test mean ranks of the measurements?? 81 Table 5.5 Kruskal-Wallis test statistics...

Nageeb, Meena

2012-07-16T23:59:59.000Z

436

Mercury + VisIt: Integration of a Real-Time Graphical Analysis Capability into a Monte Carlo Transport Code  

SciTech Connect (OSTI)

Validation of the problem definition and analysis of the results (tallies) produced during a Monte Carlo particle transport calculation can be a complicated, time-intensive processes. The time required for a person to create an accurate, validated combinatorial geometry (CG) or mesh-based representation of a complex problem, free of common errors such as gaps and overlapping cells, can range from days to weeks. The ability to interrogate the internal structure of a complex, three-dimensional (3-D) geometry, prior to running the transport calculation, can improve the user's confidence in the validity of the problem definition. With regard to the analysis of results, the process of extracting tally data from printed tables within a file is laborious and not an intuitive approach to understanding the results. The ability to display tally information overlaid on top of the problem geometry can decrease the time required for analysis and increase the user's understanding of the results. To this end, our team has integrated VisIt, a parallel, production-quality visualization and data analysis tool into Mercury, a massively-parallel Monte Carlo particle transport code. VisIt provides an API for real time visualization of a simulation as it is running. The user may select which plots to display from the VisIt GUI, or by sending VisIt a Python script from Mercury. The frequency at which plots are updated can be set and the user can visualize the simulation results as it is running.

O'Brien, M J; Procassini, R J; Joy, K I

2009-03-09T23:59:59.000Z

437

To appear in IEEE Transactions on Visualization and Computer Graphics Order of Magnitude Markers: An Empirical Study on Large  

E-Print Network [OSTI]

SouthAfrica KoreaSouth SriLanka Sudan Suriname Swaziland Tajikistan Tanzania Thailand Timor-Leste Togo

Jones, Mark W.

438

Systemic properties of ensembles of metabolic networks: application of graphical and statistical methods to simple unbranched pathways  

Science Journals Connector (OSTI)

......the sum of the intermediate pools ( V / i Xi ) , to be larger...metabolite concentrations and the conservation of solvent capacity in the...modeling model identifiability. Water Resour. Res. , 28 , 539 549...state solutions for an n-pool system using a power-law......

Rui Alves; Michael A. Savageau

2000-06-01T23:59:59.000Z

439

Whats in a name? The role of graphics, functions, and their interrelationships in icon identification  

Science Journals Connector (OSTI)

Communication using icons is now commonplace. It is therefore important to understand the processes involved in icon comprehension and the stimulus cues that individuals ... In this study, we examined predictors ...

Sin McDougall; Sarah Isherwood

2009-05-01T23:59:59.000Z

440

Songs in the language of information : using personal computers to create sounds and graphics for a large scale installation  

E-Print Network [OSTI]

Personal computers are easy to program, inexpensive and portable. With two Commodore 64 computers, I created an artistic installation entitled "Songs in the Language of Information". It was composed of elements reflecting ...

Geitz, Sarah

1985-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Computational Aesthetics in Graphics, Visualization and Imaging (2005) L. Neumann, M. Sbert, B. Gooch, W. Purgathofer (Editors)  

E-Print Network [OSTI]

and three aspecular measurements for the metallic basecoat. The program interface provides a means finishes. The software makes use of a reflection model for car paint that is based on industry standards for measuring the appearance characteristics of the paint. These measurements include gloss for the clearcoat

Meyer, Gary

442

Design and Realize of the Graphics Platform for LED Lamps Layout Based on GDI+ and Dual-Buffer  

Science Journals Connector (OSTI)

Based on the GDI+ class library and dual-buffer technology of .NET framework, the software for LED lamps layout is developed. On the basis of determining the scheme of layout platform, the metafile class library model by Composite design-set and the process of calling the LED pixels metafile symbol interface are designed firstly. The design method of realizing the LED pixels metafile visual editing on the drawn LED logical pixel based on GDI+ is analyzed. The dual-buffer technology is used to solve the problem of flicker when fast refreshing. The testing results show that the platform can meet the basic function requirements of engineering application, and realize partial adjust on the process of LED lamps layout without distortion.

Wen Yuanmei; Nie Xinming; Liu Guixiong

2012-01-01T23:59:59.000Z

443

One Tenth of A Picture Is Worth A Hundred Words Partially-Graphic Ways of Conveying Information  

E-Print Network [OSTI]

on the so-called "Obamacare" health care reform law, referring to a poll: "Forty-one percent said, but in a table, it would be. Be careful writing numbers out in words. Here's an excerpt from a newspaper article

Indiana University

444

Inference in Graphical Models In an increasingly connected and automated world, machines that are capable of learning and  

E-Print Network [OSTI]

these boundaries. Where, historically, the industrial revolution was about augmenting or replacing human labour with machine labour, we are on the verge of an inference revolution where machine reasoning augments or replaces human reasoning. Whilst the information revolution has been about communication, processing

Winn, John

445

An implementation of a parallel graphics algorithm on a distributed-memory message-passing parallel computer  

E-Print Network [OSTI]

that the first phase is already implemented on the sequential or parallel computer and the database is optimally dis- tributed among the nodes of the parallel computer, the second phase is implemented on the general-purpose niulticomputer, the nCUBE hypercube... parallel computer. The object space of an image scene is first organized in the candidate object grid, which is distributed among the processors of the nCUBE parallel multicomputer. Then each processor detects simultaneously the intersections...

Kwon, Young-Jun

2012-06-07T23:59:59.000Z

446

Security of graph data: hashing schemes and definitions  

Science Journals Connector (OSTI)

Use of graph-structured data models is on the rise - in graph databases, in representing biological and healthcare data as well as geographical data. In order to secure graph-structured data, and develop cryptographically secure schemes for graph databases, ... Keywords: graphs, hash functions, integrity, perfectly secure hash functions, privacy

Muhammad U. Arshad, Ashish Kundu, Elisa Bertino, Krishna Madhavan, Arif Ghafoor

2014-03-01T23:59:59.000Z

447

Locating-total domination in graphs  

Science Journals Connector (OSTI)

In this paper, we continue the study of locating-total domination in graphs. A set S of vertices in a graph G is a total dominating set in G if every vertex of G is adjacent to a vertex in S . We consider total dominating sets S which have the additional property that distinct vertices in V ( G ) ? S are totally dominated by distinct subsets of the total dominating set. Such a set S is called a locating-total dominating set in G , and the locating-total domination number of G is the minimum cardinality of a locating-total dominating set in G . We obtain new lower and upper bounds on the locating-total domination number of a graph. Interpolation results are established, and the locating-total domination number in special families of graphs, including cubic graphs and grid graphs, is investigated.

Michael A. Henning; Nader Jafari Rad

2012-01-01T23:59:59.000Z

448

API Requirements for Dynamic Graph Prediction  

SciTech Connect (OSTI)

Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.

Gallagher, B; Eliassi-Rad, T

2006-10-13T23:59:59.000Z

449

To make a circle graph (pie graph) in Excel 2010 1. Enter the data ...  

E-Print Network [OSTI]

To make a circle graph (pie graph) in Excel 2010. 1. Enter the data into Excel in rows, with the data labels followed by the numerical data. 2. Select all cells that...

Dave

2012-03-20T23:59:59.000Z

450

On real number labelings and graph invertibility  

Science Journals Connector (OSTI)

For non-negative real x"0 and simple graph G, @l"x"""0","1(G) is the minimum span over all labelings that assign real numbers to the vertices of G such that adjacent vertices receive labels that differ by at least x"0 and vertices at distance two receive ... Keywords: ?-invertible, ?j,k-labeling, ?x,1-labeling, Distance-constrained labeling, Kneser graphs, Self-complementary graphs

Jeong-Ok Choi; John Georges; David Mauro; Yan Wang

2012-10-01T23:59:59.000Z

451

Some algorithmic results in graph imbeddings  

E-Print Network [OSTI]

new technique called double bar amalgamation is developed. The second problem deals with constructing graph imbeddings on a sur- face of genus c (where c is an integer) less than the marimum genus 7, (G) the given graph G. We develop a polynomial... time algorithm that constructs an imbedding of a given upper imbbedable graph G with even Betti number, on an orientable surface of genus (7, (G) ? 1). TABLE OF CONTENTS CHAPTER Page I INTRODUCTION 1. 1 Overview 1. 2 Graphs and Relationships Used...

Joshi, Sanjay

1990-01-01T23:59:59.000Z

452

Generating Reports & Graphs in Portfolio Manager  

Broader source: Energy.gov [DOE]

This presentation, given through the DOE's Technical Assitance Program (TAP), provides information on how to generate reports and graphs in Portfolio Manager.

453

Nuclear reactor multiphysics via bond graph formalism  

E-Print Network [OSTI]

This work proposes a simple and effective approach to modeling nuclear reactor multiphysics problems using bond graphs. Conventional multiphysics simulation paradigms normally use operator splitting, which treats the ...

Sosnovsky, Eugeny

2014-01-01T23:59:59.000Z

454

Hamilton Decompositions of Graphs with Primitive Complements .  

E-Print Network [OSTI]

??A graph G is a pair (V, E) where V is the set of vertices(or nodes) and E is the set of edges connecting the (more)

OZKAN, SIBEL

2007-01-01T23:59:59.000Z

455

Generation of graph-state streams  

E-Print Network [OSTI]

We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like qubit and those of flying atoms through a cavity-mode photonic qubit. The generated graph states fall into an important class that can hugely reduce the resource requirement of fault-tolerant linear optics quantum computation, which was previously known to be far from realistic. In regard to the flying atoms, we also propose a heralded generation scheme, which allows for high-fidelity graph states even under the photon loss.

Daniel Ballester; Jaeyoon Cho; M. S. Kim

2010-12-08T23:59:59.000Z

456

On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy  

E-Print Network [OSTI]

On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy K.A. Germina, Shahul and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended p- sum product and the eigenvalues and energy of the product in terms of those of the factor graphs

Zaslavsky, Thomas

457

3D Graph Visualization with the Oculus Rift Virtual Graph Reality  

E-Print Network [OSTI]

3D Graph Visualization with the Oculus Rift Virtual Graph Reality Farshad Barahimi, Stephen Wismath regarding three- dimensional (3D) representations of graphs. However, the actual usefulness of such 3D reality environment such as a CAVE, or · printed as a physical model with a 3D printer. Early studies

Wismath, Stephen

458

Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs  

E-Print Network [OSTI]

1 Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs Lehigh University Bethlehem, Pennsylvania Abstract Automatic generation and selection of assembly plans a graph-theoretic scheme for the generation of assembly plans. Our scheme involves decomposing the CSP

Wu, David

459

Useful Graphs and Charts - Ion Beams - Radiation Effects Facility...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Ion Beams Available Beams Beam Change Times Measurements Useful Graphs Useful Graphs and Charts LET vs. Range in Si Graphs: 15 MeVu Beams 24.8 MeVu Beams 40 MeVu Beams...

460

Curriculum Vitae Benjamin Aurispa  

E-Print Network [OSTI]

, derivatives of functions, applications, integration, computer algebra (Matlab); Spring 2013, 2010; Fall 2012 · Math 150 (Functions, Trigonometry and Linear Systems (Precalculus)): Graphs, functions, college algebra equations, matrix algebra and applications, linear programming (graphical method), probability

Ward, Joseph D.

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Semi-Supervised Learning Adaptive Computation and Machine Learning  

E-Print Network [OSTI]

, Brendan J. Frey Learning in Graphical Models, Michael I. Jordan Causation, Prediction, and Search, second Kandola John Lafferty Zoubin Ghahramani Many graph-based semi-supervised learning methods can be viewed

Lafferty, John

462

Sequoia supercomputer tops Graph 500 | National Nuclear Security...  

National Nuclear Security Administration (NNSA)

on Graph 500 and new techniques for solving large graph problems on small high performance computing (HPC) systems, all the way down to a single server. Lawrence Livermore's...

463

LD-graphs and global location-domination in bipartite graphs  

Science Journals Connector (OSTI)

Abstract A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality are called LD-codes and the cardinality of an LD-code is the location-domination number, ? ( G ) . An LD-set S of a graph G is global if it is an LD-set for both G and its complement, G . One of the main contributions of this work is the definition of the LD-graph, an edge-labeled graph associated to an LD-set, that will be very helpful to deduce some properties of location-domination in graphs. Concretely, we use LD-graphs to study the relation between the location-domination number in a bipartite graph and its complement.

C. Hernando; M. Mora; I.M. Pelayo

2014-01-01T23:59:59.000Z

464

Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs,  

E-Print Network [OSTI]

Fuzzy Mathematics Fuzzy -Sets, -Relations, -Logic, -Graphs, -Mappings and The Extension Principle . . . . . . . . . . . . . . . . . . 8 2 The Extension Principle 10 3 Fuzzy Graphs 16 4 Fuzzy Logic 19 Back View #12;Section 1: Fuzzy Olaf Wolkenhauer Control Systems Centre UMIST o.wolkenhauer@umist.ac.uk www

Rostock, Universität

465

Extremal optimization for graph partitioning Stefan Boettcher*  

E-Print Network [OSTI]

­4 and of fast-folding protein confor- mations 5 are but two examples. In cases where the relation between-temperature properties of disordered systems. In the present work we focus on the intrinsic features of the method on the graph bipartitioning problem. We consider various kinds of graph ensembles, both with geometric

Percus, Allon

466

Graph searching and a generalized parking function  

E-Print Network [OSTI]

introduced a new generalization, the G-multiparking function, where G is a simple graph on a totally ordered vertex set {1, 2, . . . , n}. We give an algorithm that converts a G-multiparking function into a rooted spanning forest of G by using a graph...

Kostic, Dimitrije Nenad

2009-05-15T23:59:59.000Z

467

Feature Tracking Using Reeb Graphs  

SciTech Connect (OSTI)

Tracking features and exploring their temporal dynamics can aid scientists in identifying interesting time intervals in a simulation and serve as basis for performing quantitative analyses of temporal phenomena. In this paper, we develop a novel approach for tracking subsets of isosurfaces, such as burning regions in simulated flames, which are defined as areas of high fuel consumption on a temperature isosurface. Tracking such regions as they merge and split over time can provide important insights into the impact of turbulence on the combustion process. However, the convoluted nature of the temperature isosurface and its rapid movement make this analysis particularly challenging. Our approach tracks burning regions by extracting a temperature isovolume from the four-dimensional space-time temperature field. It then obtains isosurfaces for the original simulation time steps and labels individual connected 'burning' regions based on the local fuel consumption value. Based on this information, a boundary surface between burning and non-burning regions is constructed. The Reeb graph of this boundary surface is the tracking graph for burning regions.

Weber, Gunther H.; Bremer, Peer-Timo; Day, Marcus S.; Bell, John B.; Pascucci, Valerio

2010-08-02T23:59:59.000Z

468

Path Integral on Star Graph  

E-Print Network [OSTI]

In this paper we study path integral for a single spinless particle on a star graph with N edges, whose vertex is known to be described by U(N) family of boundary conditions. After carefully studying the free particle case, both at the critical and off-critical levels, we propose a new path integral formulation that correctly captures all the scale-invariant subfamily of boundary conditions realized at fixed points of boundary renormalization group flow. Our proposal is based on the folding trick, which maps a scalar-valued wave function on star graph to an N-component vector-valued wave function on half-line. All the parameters of scale-invariant subfamily of boundary conditions are encoded into the momentum independent weight factors, which appear to be associated with the two distinct path classes on half-line that form the cyclic group Z_2. We show that, when bulk interactions are edge-independent, these weight factors are generally given by an N-dimensional unitary representation of Z_2. Generalization to momentum dependent weight factors and applications to worldline formalism are briefly discussed.

Satoshi Ohya

2011-04-28T23:59:59.000Z

469

Path Integral on Star Graph  

E-Print Network [OSTI]

In this paper we study path integral for a single spinless particle on a star graph with N edges, whose vertex is known to be described by U(N) family of boundary conditions. After carefully studying the free particle case, both at the critical and off-critical levels, we propose new path integral formulation that correctly captures all the scale-invariant subfamily of boundary conditions realized at fixed points of boundary renormalization group flow. Our proposal is based on the folding trick, which maps a scalar-valued wave function on star graph to an N-component vector-valued wave function on half-line. All the parameters of scale-invariant subfamily of boundary conditions are encoded into the momentum independent weight factors, which appear to be associated with the two distinct path classes on half-line that form the cyclic group Z_2. We show that, when bulk interactions are edge-independent, these weight factors are generally given by an N-dimensional unitary representation of Z_2. Generalization to ...

Ohya, Satoshi

2011-01-01T23:59:59.000Z

470

Approximate von Neumann entropy for directed graphs  

Science Journals Connector (OSTI)

In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks.

Cheng Ye; Richard C. Wilson; Csar H. Comin; Luciano da F. Costa; Edwin R. Hancock

2014-05-12T23:59:59.000Z

471

Measuring extremal dependencies in Web graphs Yana Volkovich  

E-Print Network [OSTI]

Measuring extremal dependencies in Web graphs Yana Volkovich University of Twente P.O. Box 217 dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using of the proposed methods have never been applied to the Web graph data. This paper fills this gap. The new insights

Boucherie, Richard J.

472

Measuring Extremal Dependencies in Web Graphs Yana Volkovich  

E-Print Network [OSTI]

Measuring Extremal Dependencies in Web Graphs Yana Volkovich University of Twente P.O. Box 217 graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical of the proposed meth- ods have never been used in the Web graph data mining. The present work fills this gap

Boucherie, Richard J.

473

What Energy Functions Can Be Minimized via Graph Cuts?  

E-Print Network [OSTI]

What Energy Functions Can Be Minimized via Graph Cuts? Vladimir Kolmogorov, Member, IEEE, and Ramin been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph

Field, David

474

What Energy Functions can be Minimized via Graph Cuts?  

E-Print Network [OSTI]

What Energy Functions can be Minimized via Graph Cuts? Vladimir Kolmogorov and Ramin Zabih Computer. In the last few years, several new algorithms based on graph cuts have been developed to solve energy cut on the graph also minimizes the energy. Yet because these graph constructions are complex

Field, David

475

A Note on Hamilton Cycles in Kneser Graphs Ian Shields  

E-Print Network [OSTI]

A Note on Hamilton Cycles in Kneser Graphs Ian Shields IBM P.O. Box 12195 Research Triangle Park) have Hamilton cycles when n #20; 27. A similar result is shown for bipartite Kneser graphs. 1 for Hamilton cycles in Kneser graphs, K(n; k), and bipartite Kneser graphs, H(n; k). With the exception

Savage, Carla D.

476

Optimal acyclic edge colouring of grid like graphs  

Science Journals Connector (OSTI)

We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian product of d graphs each of which is an induced path or cycle. This class ... Keywords: Acyclic chromatic index, Acyclic edge colouring, Graph, Hypercube, Mesh

Rahul Muthu, N. Narayanan, C. R. Subramanian

2010-11-01T23:59:59.000Z

477

Discrete Mathematics Algebraic and Topological Methods in Graph Theory  

E-Print Network [OSTI]

symmetrical trivalent graphs which lead to negative currature carbon and bovon nitrie chemical structures. (D

Mohar, Bojan

478

Fibonacci-like cubes as Z-transformation graphs  

Science Journals Connector (OSTI)

The Fibonacci cube @C"n is a subgraph of n-dimensional hypercube induced by the vertices without two consecutive ones. Klavzar and Zigert [Fibonacci cubes are the resonance graphs of fibonaccenes, Fibonacci Quart. 43 (2005) 269-276] proved that Fibonacci ... Keywords: Fibonacci cube, Lucas cube, Perfect matching, Plane bipartite graph, Resonance graph, Z-transformation graph

Heping Zhang, Lifeng Ou, Haiyuan Yao

2009-04-01T23:59:59.000Z

479

Discrete Applied Mathematics 121 (2002) 139153 NeST graphs  

E-Print Network [OSTI]

Discrete Applied Mathematics 121 (2002) 139­153 NeST graphs Ryan B. Haywarda; , Paul E. Kearneyb; received in revised form 14 March 2001; accepted 26 March 2001 Abstract We establish results on NeST graphs show the equivalence of proper NeST graphs and unit NeST graphs, the equivalence of ÿxed distance NeST

Hayward, Ryan B.

480

A role for matrices in graph theory  

E-Print Network [OSTI]

A ROLE FOR MATRICES IN GRAPH THEORY A Thesis by John Patrick McLean Submitted to the Graduate College of Texas A&M University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE May 1971 Ma]or Subject: Mathematics... A ROLE FOR MATRICES IN GRAPH THEORY A Thesis by John Patrick McLean Approved as to style and content by: (Chairman of Committee) (Head of Department) I (Member) (Member) May 1971 tp Qey $ ABSTRACT A Role for Matrices in Graph Theory...

McLean, John Patrick

1971-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "graph graphic graphics" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

3-Rainbow Domination Number in Graphs  

Science Journals Connector (OSTI)

The k-rainbow domination is a location problem in operations research. Give an undirected graph G as the natural model of location problem. We have a set of k colors and assign an arbitrary subset of these col...

Kung-Jui Pai; Wei-Jai Chiu

2013-01-01T23:59:59.000Z

482

Graph Summarization with Bounded Error Saket Navlakha  

E-Print Network [OSTI]

of Maryland College Park, MD, USA-20742 saket@cs.umd.edu Rajeev Rastogi Yahoo! Labs Bangalore, India rrastogi@yahoo-inc Graphs are a fundamental abstraction that have been em- ployed for centuries to model real-world systems

Gruner, Daniel S.

483

On semidefinite programming bounds for graph bandwidth  

E-Print Network [OSTI]

May 24, 2011 ... We propose two new lower bounds on graph bandwidth and cyclic ... matrix computations, parallel computations, VLSI layout, etc; see, for example [19]. ...... problems by SeDuMi [30] using the Yalmip interface [22] with Matlab.

2011-05-24T23:59:59.000Z

484

Graph Implementations for Nonsmooth Convex Programs  

E-Print Network [OSTI]

Summary. We describe graph implementations, a generic method for represent- ... object-oriented features of Matlab to turn it into an optimization modeling language: ..... For matrix and array expressions, these rules are applied on an elemen-.

2007-09-07T23:59:59.000Z

485

The Minimum Rank Problem for Outerplanar Graphs.  

E-Print Network [OSTI]

??Given a simple graph G with vertex set V(G)={1,2,...,n} define S(G) to be the set of all real symmetric matrices A such that for all (more)

Sinkovic, John Henry

2013-01-01T23:59:59.000Z

486

Minimum rank of graphs that allow loops.  

E-Print Network [OSTI]

??The traditional "minimum rank problem" for simple graphs associates a set of symmetric matrices, the zero-nonzero pattern of whose off-diagonal entries are described by the (more)

Mikkelson, Rana C.

2008-01-01T23:59:59.000Z

487

Bipartite graph partitioning and data clustering  

SciTech Connect (OSTI)

Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, the authors propose a new data clustering method based on partitioning the underlying biopartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. They show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. They point out the connection of their clustering algorithm to correspondence analysis used in multivariate analysis. They also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, they apply their clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.

Zha, Hongyuan; He, Xiaofeng; Ding, Chris; Gu, Ming; Simon, Horst D.

2001-05-07T23:59:59.000Z

488

Hamilton Paths in Generalized Petersen Graphs.  

E-Print Network [OSTI]

??This thesis puts forward the conjecture that for n > 3k with k > 2, the generalized Petersen graph, GP(n,k) is Hamilton-laceable if n is (more)

Pensaert, William

2006-01-01T23:59:59.000Z

489

Progressive transitions using body part motion graphs  

Science Journals Connector (OSTI)

In this work we describe a preliminary method for progressive transitions in human locomotions. To achieve this, motion graphs have been used to synthesize body part transitions and every part has been synchronized with the other parts using time scaling. ...

Adso Fernndez-Baena; David Miralles

2011-12-01T23:59:59.000Z

490

A Faster Algorithm for Computing Motorcycle Graphs  

Science Journals Connector (OSTI)

We present a new algorithm for computing motorcycle graphs that runs in $$O(n^{4/3+\\varepsilon })$$O(n4/3+) time for any $$\\varepsilon >0$$>0, improving on all previously known algorithms. The main application of this result is to computing the straight ... Keywords: 65D18, 68Q25, 68U05, Algorithms design and analysis, Medial axis, Motorcycle graph, Polygon, Straight skeleton

Antoine Vigneron, Lie Yan

2014-10-01T23:59:59.000Z

491

About equivalent interval colorings of weighted graphs  

Science Journals Connector (OSTI)

Given a graph G=(V,E) with strictly positive integer weights @w"i on the vertices i@?V, a k-interval coloring of G is a function I that assigns an interval I(i)@?{1,...,k} of @w"i consecutive integers (called colors) to each vertex i@?V. If two adjacent ... Keywords: Equivalent colorings, Interval coloring problem, Weighted graphs

Mathieu Bouchard; Mirjana angalovi?; Alain Hertz

2009-10-01T23:59:59.000Z

492

Accelerating semantic graph databases on commodity clusters  

SciTech Connect (OSTI)

We are developing a full software system for accelerating semantic graph databases on commodity cluster that scales to hundreds of nodes while maintaining constant query throughput. Our framework comprises a SPARQL to C++ compiler, a library of parallel graph methods and a custom multithreaded runtime layer, which provides a Partitioned Global Address Space (PGAS) programming model with fork/join parallelism and automatic load balancing over a commodity clusters. We present preliminary results for the compiler and for the runtime.

Morari, Alessandro; Castellana, Vito G.; Haglin, David J.; Feo, John T.; Weaver, Jesse R.; Tumeo, Antonino; Villa, Oreste

2013-10-06T23:59:59.000Z

493

Graph representation of protein free energy landscape  

SciTech Connect (OSTI)

The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.

Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong, E-mail: shuo@clarku.edu [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States); Han, Li [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)

2013-11-14T23:59:59.000Z

494

A Portrait Drawing Robot Using a Geometric Graph Approach: Furthest Neighbour Theta-Graphs  

E-Print Network [OSTI]

literature include painting robots where various type of systems were implemented [1], [2], [4]. For instanceA Portrait Drawing Robot Using a Geometric Graph Approach: Furthest Neighbour Theta-Graphs Meng drawing humanoid robot, Betty. To solve this line drawing problem we present a modified Theta

Durocher, Stephane

495

Streaming Graph Computations with a Helpful Advisor  

E-Print Network [OSTI]

Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a powerful helper that can provide annotations to the data stream. We extend previous work on such {\\em annotation models} by considering a number of graph streaming problems. Without annotations, streaming algorithms for graph problems generally require significant memory; we show that for many standard problems, including all graph problems that can be expressed with totally unimodular integer programming formulations, only a constant number of hash values are needed for single-pass algorithms given linear-sized annotations. We also obtain a protocol achieving \\textit{optimal} tradeoffs between annotation length and memory usage for matrix-vector multiplication; this result contributes to a trend of recent research on numerical linear algebra in streaming models.

Cormode, Graham; Thaler, Justin

2010-01-01T23:59:59.000Z

496

Sequoia tops Graph 500 list of 'big data' supercomputers  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

ATL062113_graph ATL062113_graph 06/21/2013 The Livermore Lab's Sequoia supercomputer topped the biannual Graph 500 list of the world's fastest systems for "big data" this week. The Graph 500 benchmark measures the speed with which a supercomputer can "connect the dots" within a massive set of data. Sequoia traversed 15,363 connections per second. Sequoia tops Graph 500 list of 'big data' supercomputers Donald B Johnston, LLNL, (925) 423-4902, johnston19@llnl.gov LLNL's 20 petaflops Sequoia supercomputer has retained its No. 1 ranking on the Graph 500 list, a measure of a system's ability to conduct analytic calculations -- finding the proverbial needle in the haystack. An IBM Blue Gene Q system, Sequoia was able to traverse 15,363 giga edges per second on a scale of 40 graph (a graph with 2^40 vertices). The new

497

An efficient semidefinite programming relaxation for the graph ...  

E-Print Network [OSTI]

The general graph partition problem (GPP) is defined as follows. Let G = (V ... We denote by A the adjacency matrix of G. For a given partition of the graph into k.

2012-08-28T23:59:59.000Z

498

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications, Berkeley Spring 1998 #12; Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications Copyright © 1998 by Michael Cameron Williamson #12; 1 Abstract Synthesis of Parallel Hardware

499

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications  

E-Print Network [OSTI]

Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications, Berkeley Spring 1998 #12;Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications Copyright © 1998 by Michael Cameron Williamson #12;1 Abstract Synthesis of Parallel Hardware

500

Towards a Query-by-Example System for Knowledge Graphs  

Science Journals Connector (OSTI)

We witness an unprecedented proliferation of knowledge graphs that record millions of heterogeneous entities and their diverse relationships. While knowledge graphs are structure-flexible and content-rich, it is difficult to query them. The challenge ...

Nandish Jayaram; Arijit Khan; Chengkai Li; Xifeng Yan; Ramez Elmasri

2014-06-01T23:59:59.000Z