Powered by Deep Web Technologies
Note: This page contains sample records for the topic "xls files graphs" 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

graph  

Science Conference Proceedings (OSTI)

... C++). More information. Journal of Combinatorics dynamic surveys DS8 and DS9 are a bibliography and glossary of graphs. ...

2013-11-18T23:59:59.000Z

2

Attachment B.xls | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

B.xls Attachment B.xls More Documents & Publications Attachment 5 Volume II Pricing Matrix.xls&0; Attachment 6 Volume V Pricing Matrix for Optional Enhancements.xls&0;...

3

OMBDOEFAIR2005.xls | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

More Documents & Publications Intnl-NatUnionlistingfor web page2.07Rev2.xls&0; Attachment 5 Volume II Pricing Matrix.xls&0; 2003 DOE IGCA Inventory Data for web.xls&0;...

4

ITP_Data_Centers.xls | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

ITPDataCenters.xls ITPDataCenters.xls ITPDataCenters.xls More Documents & Publications ProjectDescriptionsITPARRAAwards.xls 2003 DOE IGCA Inventory Data for web.xls&0;...

5

consistent (to make pdf file).xls  

Gasoline and Diesel Fuel Update (EIA)

05 05 Q205 Q305 Q405 Q106 Q206 Q306 Q406 Q107 Q207 Q307 Q407 Q108 Q208 Q308 Q408 Q109 Q209 Q309 Q409 Q110 Q210 Q310 Financial Data Corporate Data Revenue (20) 0 247,689 284,194 291,132 267,557 286,629 288,737 253,862 252,257 294,906 301,112 337,216 345,713 426,895 430,731 252,670 190,125 220,267 246,948 263,796 268,826 268,826 261,444 Net Income (20) 18,089 20,879 24,199 26,408 22,703 28,884 29,857 23,132 23,635 30,623 26,038 28,965 27,004 30,128 47,979 1,437 -4,279 8,565 13,044 13,775 17,490 17,490 19,953 Line of Business Income Petroleum (21) 22,360 26,186 26,802 30,996 27,233 33,975 31,840 22,144 24,059 36,814 25,527 29,354 29,701 33,218 51,995 3,276 -205 10,180 15,410 19,303 22,132 22,132 23,629 Oil and Gas Production (16) 17,564 18,727 19,286 22,980 22,398 22,745 21,169 16,167 17,343 22,528 19,760 25,582 28,210 30,272 42,425 688 -3,721 10,071 14,585 21,498

6

FILE  

Office of Legacy Management (LM)

c&o--L>+/ c&o--L>+/ co.o-09 ~~Epq-J+~~jDU" 1 . [o( / 5-/-- 1, "I ' -i, [ . - -. j s: FILE :3r.jNER is} -------.- pas',: Current: -----__---_---__-------- ----____-_________________ Cwner ccntacted 0 yes 0 nag i+ yet,? date czntacted ----___--I__- Ty-;Pfz ,' F iTiC~CC2~j 1 iljbj AA-r-ti--=' ="L---- /8;' ; z.eseaf-ch & sevei apment EJ F' raducticx scale tssting rJ Pilot si-jle 0 ' jench Scale Fracess 0 Theoretical Studies 0 Samp:! e & haivsis 0 Fz-citity Tvpe 0 Manui artur i ng 0 University 3 Research *27ganizati.sn g Government Spensored Faci I i ty 0 other -~-q_-~ ----- i *c' rcd$srti an Di rposal /Storage T' /P!= I-IF rgfijTk#qfJ- -~L=-=--e---~----- 0 Prime Suacontractot- i f' urchass Order 0 Other infcrmatian

7

FIMS Data Validation Schedule FY 2010_090729.xls | Department...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

FIMS Data Validation Schedule FY 2010090729.xls FIMS Data Validation Schedule FY 2010090729.xls FIMS Data Validation Schedule FY 2010090729.xls More Documents & Publications...

8

Nevada Bureau of Mines and Geology Open-File Report 12-3 Data Tables and Graphs of Geothermal Power Production in Nevada,  

E-Print Network (OSTI)

This report summarizes statistics on geothermal power production in Nevada from initial plant construction in 1985 through 2011. Data are compiled on nameplate capacity, gross production, and net production by producing geothermal area. Graphs illustrate trends for individual areas and for Nevada overall. The data and graphs are in an Excel spreadsheet, which is also available online with this document, at

Lisa Shevenell; Jonathan G. Price; Ronald H. Hess

2012-01-01T23:59:59.000Z

9

graph drawing  

Science Conference Proceedings (OSTI)

... Layout Program (C). Graphviz: Graph Visualization Software (C), consisting of many graph drawing programs, viewers (C, Java, and TCL/TK), etc. ...

2013-11-18T23:59:59.000Z

10

eia912.xls  

U.S. Energy Information Administration (EIA) Indexed Site

Month Month 2 0 Address 2: City: State: Zip: - to meet the due date.) (Volume of gas in the reservoir that is in addition to the base gas.) Working Gas as of Friday 9:00 AM (Million Cubic Feet) Producing Region Complete and return form no later than 5:00 p.m. Eastern Standard Time on Monday. If this is a resubmission, enter an "X" in the box: EIA ID NUMBER: ATTN: EIA-912 Energy Information Administration, EI-45 U. S. Department of Energy (202) 586-2849 912 Company Name: oog.eia912@eia.gov Fax No.: Email: Ext: Form may be submitted using one of the following methods: Fax to: Address 1: Secure File Transfer: https://signon.eia.doe.gov/upload/notice912.jsp Questions? Email address: Comments: Please explain in this section any unusual data reports. For example, explain any change in working gas as a result of changes in the number or capacity

11

eia910.xls  

U.S. Energy Information Administration (EIA) Indexed Site

Address 2: Address 2: City: State: Zip: - 1. Report State (Enter one of the following States in the box): Georgia, New York, 2. To how many end-use customers did you sell natural gas? 3. 4. For companies reporting sales in all States except Georgia: 5. For companies reporting sales in Georgia: PART 2. SUBMISSION INFORMATION (Dollars) Do not report negative numbers or decimals. You may report in either Thousand cubic feet (Mcf) or in Therms. Indicate unit of measure by placing an "X" in the appropriate box. Commercial Residential Commercial Residential Form may be submitted using one of the following methods: Mail to: ATTN: EIA-910 (Dollars) Commercial Residential Mcf Call: Email address: (877) 800 - 5261 Secure File Transfer: https://signon.eia.doe.gov/upload/noticeoog.jsp

12

Attachment 5 Volume II Pricing Matrix.xls | Department of...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5 Volume II Pricing Matrix.xls&0; Attachment 5 Volume II Pricing Matrix.xls&0; Attachment 5 Volume II Pricing Matrix.xls&0; More Documents & Publications Attachment 6 Volume V...

13

Pressure Data Within BOP- XLS  

Energy.gov (U.S. Department of Energy (DOE))

This file describes the components within the BOP and the pressure readings taken during diagnostic operations on May 25.

14

xls  

U.S. Energy Information Administration (EIA)

a Includes refuse recovery. capacity data. b Marketed production. e Production of federal offshore natural gas along the c Includes lease condensate.

15

XLS  

U.S. Energy Information Administration (EIA)

Fig5 Short-Term Energy Outlook, November 2013 Natural Gas Prices (Dollars per thousand cubic feet) Month Residential Henry Hub Source: Short-Term Energy Outlook ...

16

Motion graphs  

Science Conference Proceedings (OSTI)

In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The ... Keywords: animation with constraints, motion capture, motion synthesis

Lucas Kovar; Michael Gleicher; Frdric Pighin

2002-07-01T23:59:59.000Z

17

New 2005 Survey.xls  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

filed in 2005 filed in 2005 2005 NEPA Case Dispositions Lead Defendant Cases Filed Injunctions - Remands Gov't Agency FERC 4 0 Judgment for defendant 94 Navy 1 1 Adverse dispositions: 101 NRC 0 0 TRO 1 DOI - BLM 12 4 Preliminary Injunction 18 - FWS 3 1 Permanent Injunction 7 - BuRec 3 0 Remand 23 - NPS 4 0 Dismissal w/ settlement 24 - BIA/NIGC 2 0 Dismissal w/o settlement 24 - MMS 1 1 Case pending, NEPA 204 - OSM 1 0 USDA - FS 50 26 - APHIS 3 1 DOC - NOAA 3 2 Basis for NEPA Dispositions Army - COE 8 4 Gov't Agency Army 1 0 Jurisdictional - P prevailed 2 DOT - FHWA 5 1 Jurisdictional - D prevailed 25 - FTA 2 0 NEPA - Not required 9 - FAA 3 0 NEPA - Is required 4 - MARAD 2 0 CE - Adequate 10 - SLSC 0 0 CE - Not Adequate 2 DOE 3 0 EA - Adequate* 24 EPA 2 0 EA - Not Adequate*

18

EI7223_Information Retrieval_101019.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7223_Information Retrieval_101019.xls Allgemeine Daten: Modulnummer: Modulbezeichnung (dt.): Modulbezeichnung (en.): Information Retrieval in High Dimensional Data Modulniveau: MSc Kürzel: Untertitel Semesterende: Modulbeschreibung Seite 1 von 4 #12;EI7223_Information Retrieval_101019.xls Beschreibung: Inhalt

Kuehnlenz, Kolja

19

EI7157_Molecular_Electronics.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7157_Molecular_Electronics.xls Allgemeine Daten: Modulnummer: EI7157 Modulbezeichnung (dt.): Molecular Electronics Modulbezeichnung (en.): Molecular Electronics Modulniveau: MSc Kürzel: Untertitel7157_Molecular_Electronics.xls Beschreibung: Inhalt: Introduction to organic chemistry. Molecular

Kuehnlenz, Kolja

20

EI7272_Molecular Electronics.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7272_Molecular Electronics.xls Allgemeine Daten: Modulnummer: EI7272 Modulbezeichnung (dt.): Molekulare Elektronik Modulbezeichnung (en.): Molecular Electronics Modulniveau: MSc Kürzel: Mol #12;EI7272_Molecular Electronics.xls Modulbeschreibung Beschreibung: Inhalt: 1) Introduction, history

Kuehnlenz, Kolja

Note: This page contains sample records for the topic "xls files graphs" 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

eia757b.xls  

U.S. Energy Information Administration (EIA) Indexed Site

Fax: (202) 586-1076 If any Plant Identification Data has changed since the last report, Secure File Transfer: Plant Name: Questions? Call: (877) 800-5261 Plant Address 1: Plant Address 2: City: State: County: Zip: - Plant Owner Companies (Top Three): 1 2 3 Operator Company: Processing Plant Operations Contact: Contact Name: Contact Name: Title: Title: Company: Company: Secondary Phone No.: Secondary Phone No.: Page 1 Comments: (To separate one comment from another, press ALT+ENTER) Ext: Ext: NATURAL GAS PROCESSING PLANT SURVEY Schedule B: Emergency Status Report Version No.: 2012.01

22

2011 Cost Symposium Agenda 4-28-11 web draft.xls | Department...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2011 Cost Symposium Agenda 4-28-11 web draft.xls 2011 Cost Symposium Agenda 4-28-11 web draft.xls 2011 Cost Symposium Agenda 4-28-11 web draft.xls More Documents & Publications...

23

2003 DOE IGCA Inventory Data for web.xls | Department of...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3 DOE IGCA Inventory Data for web.xls&0; 2003 DOE IGCA Inventory Data for web.xls&0; 2003 DOE IGCA Inventory Data for web.xls&0; More Documents & Publications...

24

New 2003 Survey.xls  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3 3 Lead Defendant Cases Filed Injunctions - Remands NEPA Case Dispositions - 2003 FERC 0 0 pre-2003 2003 All Navy 0 0 Judgment for defendant 46 3 49 NRC 1 0 TRO 2 2 4 DOI - BLM 15 1 Preliminary injunction 7 4 11 - FWS 2 3 Permanent injunction 5 2 7 - BuRec 11 0 Remand 14 2 16 - NPS 1 1 Dismissal w/ settlement 19 3 22 - BIA/NIGC 2 1 Dismissal w/o settlement 24 5 29 - MMS 0 0 Other action 23 10 33 - OSM 1 0 Pending 107 96 205 USDA - FS 66 14 - APHIS 3 0 DOC - NOAA 6 3 Army - COE 12 4 Plaintiffs Army 2 0 Public Interest groups 191 DOT - FHWA 6 2 Individual/Citizen assoc. 82 - FTA 2 0 State government 8 - FAA 3 1 Local government 16 - MARAD 1 0 Business groups 28 - FMCSA 1 0 Property owners/residents 5 DOE 1 2 Indian tribes 9 EPA 0 0 Combination plaintiffs* 42 HUD 1 0 * i.e. local government AND individuals;

25

New 2002 Survey.xls  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2 2 Lead Defendant Cases Filed Injunctions - Remands NEPA Case Dispositions - 2002 FERC 0 0 pre-2002 2002 All Navy 3 1 Judgment for defendant 33 16 49 NRC 0 0 TRO 1 1 2 DOI - BLM 18 1 Preliminary injunction 4 4 8 - FWS 12 2 Permanent injunction 11 8 19 - BuRec 2 0 Remand 12 3 15 - NPS 4 1 Dismissal w/ settlement 18 4 22 - BIA/NIGC 3 1 Dismissal w/o settlement 26 26 52 - MMS 0 0 Other action 36 17 53 - OSM 0 0 Pending 107 61 168 USDA - FS 40 14 - APHIS 0 0 DOC - NOAA 10 6 Army - COE 13 2 Plaintiffs Army 0 0 Public Interest groups 229 DOT - FHWA 10 5 Individual/Citizen assoc. 142 - FTA 7 2 State government 16 - FAA 16 3 Local government 50 - MARAD 0 0 Business groups 64 - FMCSA 1 0 Property owners/residents 19 DOE 4 1 Indian tribes 18 EPA 1 1 Combination plaintiffs* 84 HUD 1 0 * i.e. local government AND individuals;

26

New 2004 Survey.xls  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4 4 Lead Defendant Cases Filed Injunctions - Remands NEPA Case Dispositions - 2004 FERC 2 0 pre-2004 2004 All Navy 2 2 Judgment for defendant 42 8 50 NRC 2 0 TRO 2 2 4 DOI - BLM 19 5 Preliminary injunction 9 6 15 - FWS 5 0 Permanent injunction 6 1 7 - BuRec 1 0 Remand 17 0 17 - NPS 4 2 Dismissal w/ settlement 23 5 28 - BIA/NIGC 0 2 Dismissal w/o settlement 26 15 41 - MMS 0 0 Other action 0 0 0 - OSM 0 0 Pending 126 125 251 USDA - FS 76 12 - APHIS 3 0 DOC - NOAA 15 1 Army - COE 13 1 Plaintiffs Army 1 0 Public Interest groups 232 DOT - FHWA 11 2 Individual/Citizen assoc. 83 - FTA 0 0 State government 11 - FAA 2 1 Local government 21 - MARAD 0 0 Business groups 27 - SLSC 0 0 Property owners/residents 11 DOE 4 2 Indian tribes 13 EPA 6 0 Combination plaintiffs* 9 HUD 0 0 * i.e. local government AND individuals;

27

New 2001 Survey.xls  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1 1 Lead Defendant Cases Filed Injunctions - Remands NEPA Case Dispositions - 2001 FERC 0 0 pre-2001 2001 All Navy 2 1 Judgment for defendant 41 20 66 NRC 0 0 TRO 2 3 5 DOI - BLM 20 2 Preliminary injunction 4 5 6 - FWS 17 1 Permanent injunction 7 0 9 - BuRec 1 0 Remand 8 8 18 - NPS 7 2 Dismissal w/ settlement 16 8 24 - BIA/NIGC 3 0 Dismissal w/o settlement 23 23 41 - MMS 0 0 Other action 9 4 15 - OSM 0 0 Pending 135 USDA - FS 40 15 - APHIS 2 1 DOC - NOAA 8 3 Army - COE 7 2 Plaintiffs Army 0 0 Public Interest groups 175 DOT - FHWA 3 2 Individual/Citizen assoc. 95 - FTA 13 1 State government 11 - FAA 7 0 Local government 37 - MARAD 0 0 Business groups 52 - SLSC 0 0 Property owners/residents 15 DOE 2 0 Indian tribes 11 EPA 4 0 Combination plaintiffs* 63 HUD 0 0 * i.e. local government AND individuals;

28

FFATA sub reporting data model_draft_100715.xls | Department...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

data modeldraft100715.xls More Documents & Publications Policy Flash 2013-46 Awardee in STRIPES Microsoft Word - Policy Flash 2010-82 Attachment 1 Guide to Financial Assistance...

29

PDSF Utilization Graphs  

NLE Websites -- All DOE Office Websites (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

30

DOE Recovery Act Awardees The data contained within the .xls...  

Open Energy Info (EERE)

be updated weekly by the DOE.
2010-12-16T22:30:08Z 2011-01-03T16:54:34Z http:www.energy.govrecoverydocumentsrecoveryactfunding.xls I accessed this dataset from a public...

31

EI7203_Quantum_Nanoelectronics.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7203_Quantum_Nanoelectronics.xls Allgemeine Daten: Modulnummer: EI7203 Modulbezeichnung (dt.): Quantum Nanoelectronics Modulbezeichnung (en.): Quantum Nanoelectronics Modulniveau: MSc Kürzel Folgesemester: Ja Wiederholung auch am Semesterende: Nein Modulbeschreibung Seite 1 von 4 #12;EI7203_Quantum

Kuehnlenz, Kolja

32

EI7135_Industrielle_Energiewirtschaft.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7135_Industrielle_Energiewirtschaft.xls Allgemeine Daten: Modulnummer: EI7135 Modulbezeichnung (dt.): Industrielle Energiewirtschaft Modulbezeichnung (en.): Industrial Energy Economy Modulniveau Folgesemester: Wiederholung auch am Semesterende: Modulbeschreibung Seite 1 von 4 #12;EI7135_Industrielle_Energiewirtschaft

Kuehnlenz, Kolja

33

Graph sketcher: extending illustration to quantitative graphs  

Science Conference Proceedings (OSTI)

Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantitative concept diagrams (QCDs). Existing charting and illustration programs ... Keywords: charting, constraint-based layout, illustration, information visualization, planar map coloring, quantitative concept diagrams, snap-dragging

Robin Stewart; m.c. schraefel

2009-04-01T23:59:59.000Z

34

grid file  

Science Conference Proceedings (OSTI)

NIST. grid file. (data structure). Definition: A point access method which splits space into a nonperiodic grid. Each spatial ...

2013-08-23T23:59:59.000Z

35

Learning Graph Matching  

E-Print Network (OSTI)

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...

Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J

2008-01-01T23:59:59.000Z

36

File Systems  

NLE Websites -- All DOE Office Websites (Extended Search)

File Systems File Systems File Systems For a general description of the different file systems available on PDSF please see Eliza File Systems and Other File Systems. Below is a summary of how STAR uses the various systems: /common The STAR software is installed on /common. For 32sl44 it is under /common/star/star44 and for sl53 it is under /common/star/star53. In both cases the software consists primarily of a STAR-specific ROOT installation on which releases of the STAR libraries are built as shown on the Local STAR Libraries page. /eliza3, /eliza6, /eliza9, /eliza14, /eliza15, /eliza17 STAR has space on 6 elizas as shown in the table below. File System star space (TB) use eliza3 39 production eliza6 9 production eliza9 39 production eliza14 34 production, user space under /eliza14/star/pwg

37

Oil and Gas Recovery Data from the Riser Insertion Tub - XLS...  

NLE Websites -- All DOE Office Websites (Extended Search)

Recovery Data from the Riser Insertion Tub - XLS Oil and Gas Recovery Data from the Riser Insertion Tub - XLS Oil and Gas Recovery Data from the Riser Insertion Tube from May 17...

38

Oil and Gas Recovery Data from the Riser Insertion Tub - XLS...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

XLS Oil and Gas Recovery Data from the Riser Insertion Tub - XLS Oil and Gas Recovery Data from the Riser Insertion Tube from May 17 until the Riser Insertion Tube was disconnected...

39

FY 2007 Operating Plan for DOE--March 16, 2007.xls | Department...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Plan for DOE--March 16, 2007.xls FY 2007 Operating Plan for DOE--March 16, 2007.xls U.S Department of Energy 2007 operating plan by appropriation. FY 2007 Operating Plan for...

40

Attachment 4 Volume III Pricing Matrix for Phase-in Period.xls...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Attachment 4 Volume III Pricing Matrix for Phase-in Period.xls&0; Attachment 4 Volume III Pricing Matrix for Phase-in Period.xls&0; Attachment 4 Volume III Pricing Matrix for...

Note: This page contains sample records for the topic "xls files graphs" 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

Claw-free graphs and line graphs.  

E-Print Network (OSTI)

??The research of my dissertation is motivated by the conjecture ofThomassen that every 4-connected line graph is hamiltonian and by the conjecture ofTutte that every (more)

Shao, Yehong, 1976-

2005-01-01T23:59:59.000Z

42

Almost self-centered graphs  

E-Print Network (OSTI)

The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) graphs are introduced as the graphs with exactly two non-central vertices. The block structure of these graphs is described and constructions for generating such graphs are proposed. Embeddings of arbitrary graphs into ASC graphs are studied. In particular it is shown that any graph can be embedded into an ASC graph of prescribed radius. Embeddings into ASC graphs of radius two are studied in more detail. Embedding index of a graph G is introduced as the smallest number of vertices needed to add to G such that G is an induced subgraph of an ASC graph.

Sandi Klavzar; et al.

2009-01-01T23:59:59.000Z

43

File Formats  

NLE Websites -- All DOE Office Websites (Extended Search)

Home Page Home Page File Formats MODIS Product Subsets Output Data File Format Descriptions The MODIS product subsets for North America and Worldwide are available in several formats, which are described in the following text. MODIS Land Product ASCII Data Image Data Files in ASCII Grid Format QC-Filtered Data and Statistics Generated for this Request Land Cover Data in ASCII Grid Format Statistical Data for MODIS Land Products in Comma Separated Format Underlying BRDF Parameters Used in Generating this Request (available with Albedo MOD43B and MCD43B only) MODIS Land Product ASCII Data Description of File File Content: Data as read from MODIS Land Product HDF-EOS data files. These data are the starting point for deriving the other subset data products. Data Type: As indicated by Land Product Code (e.g., MOD15A2).

44

directed acyclic word graph  

Science Conference Proceedings (OSTI)

... and R. Verin, Direct Construction of Compact Directed Acyclic Word Graphs, 8th Annual Symposium, CPM 97, Aarhus, Denmark, 116-129, 1997. ...

2013-08-23T23:59:59.000Z

45

A Metadata-Rich File System  

Science Conference Proceedings (OSTI)

Despite continual improvements in the performance and reliability of large scale file systems, the management of file system metadata has changed little in the past decade. The mismatch between the size and complexity of large scale data stores and their ability to organize and query their metadata has led to a de facto standard in which raw data is stored in traditional file systems, while related, application-specific metadata is stored in relational databases. This separation of data and metadata requires considerable effort to maintain consistency and can result in complex, slow, and inflexible system operation. To address these problems, we have developed the Quasar File System (QFS), a metadata-rich file system in which files, metadata, and file relationships are all first class objects. In contrast to hierarchical file systems and relational databases, QFS defines a graph data model composed of files and their relationships. QFS includes Quasar, an XPATH-extended query language for searching the file system. Results from our QFS prototype show the effectiveness of this approach. Compared to the defacto standard, the QFS prototype shows superior ingest performance and comparable query performance on user metadata-intensive operations and superior performance on normal file metadata operations.

Ames, S; Gokhale, M B; Maltzahn, C

2009-01-07T23:59:59.000Z

46

Undirected Graphs maze exploration  

E-Print Network (OSTI)

and Adar, 2004 corporate e-mail #12;5 Power transmission grid of Western US Reference: Duncan Watts #12 The Internet as mapped by The Opte Project http://www.opte.org #12;8 Graph terminology #12;9 Some graph

Sedgewick, Robert

47

Detachments of Complete Graphs  

Science Conference Proceedings (OSTI)

A detachment of a graph $G$ is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. In this paper we consider the question of whether a graph $H$ is a detachment of some complete ...

Keith Edwards

2005-05-01T23:59:59.000Z

48

EI7203_Quantum_Nanoelectronics.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7203_Quantum_Nanoelectronics.xls Allgemeine Daten: Modulnummer: EI7203 Modulbezeichnung (dt.): Quantum Nanoelectronics Modulbezeichnung (en.): Modulniveau: MSc Kürzel: Untertitel: Semesterdauer: 1 Folgesemester: Ja Wiederholung auch am Semesterende: Nein Modulbeschreibung Seite 1 von 4 #12;EI7203_Quantum

Kuehnlenz, Kolja

49

Slicibility of rectangular graphs and floorplan optimization  

Science Conference Proceedings (OSTI)

Keywords: floorplanning, graph dualization, heuristic search, nonslicible floorplans, planar graphs, slicible floorplans, very large scale integration

Partha S. Dasgupta; Susmita Sur-Kolay

1997-04-01T23:59:59.000Z

50

A Semantic Graph Query Language  

Science Conference Proceedings (OSTI)

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

Kaplan, I L

2006-10-16T23:59:59.000Z

51

Crawling Online Social Graphs  

E-Print Network (OSTI)

Unbiased sampling of facebook, 2009. [9] A. Korolova, R.these users. For example, Facebook was ranked as the 4thsample (1M node) of the Facebook graph. The basic idea is

Ye, Shaozhi; Lang, Juan; Wu, S F

2010-01-01T23:59:59.000Z

52

IFC File Analyzer  

Science Conference Proceedings (OSTI)

... The IFC File Analyzer generates a spreadsheet from an IFC file. ... In the spreadsheet, a worksheet is created for each type of IFC entity in the file. ...

2013-08-12T23:59:59.000Z

53

Graph Transformations in Relational Databases  

E-Print Network (OSTI)

The theory of graph transformation [2] was originally developed as a generalization of Chomsky grammars from strings to graphs. Methods, techniques, and tools from the area of graph transformations have already been studied and applied in many fields of computer science such as formal language theory, pattern recognition and generation, compiler construction, software engineering, etc. Despite the large variety of existing graph transformation tools, the implementation of their graph transformation engine typically follows the same principle. In this respect, first a matching occurrence of the left-hand side (LHS) of the graph transformation rule is being found by some sophisticated graph pattern matching algorithm. Then the engine performs some local modifications to add or remove graph elements to the matching pattern, and the entire process starts all over again. Since graph pattern matching leads to the subgraph isomorphism problem that is known to be NPcomplete in general, this step is considered to be the most crucial in the overall performance of a graph transformation engine. Current tools (e.g., PROGRES [4]) use different efficient strategies for the graph pattern matching phase. However, I argue that the overall complexity of a graph transformation engine is not necessarily equal to the complexity of the graph pattern matching phase, especially for long transformation sequences.

Gergely Varr

2004-01-01T23:59:59.000Z

54

Analysis of multilevel graph partitioning  

Science Conference Proceedings (OSTI)

Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph partitions. However, there exists little theoretical analysis ...

George Karypis; Vipin Kumar

1995-12-01T23:59:59.000Z

55

Taxonomy-superimposed graph mining  

Science Conference Proceedings (OSTI)

New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a challenging task to mine for frequent patterns in this new graph model ...

Ali Cakmak; Gultekin Ozsoyoglu

2008-03-01T23:59:59.000Z

56

TO: FILE  

Office of Legacy Management (LM)

TO: FILE TO: FILE FROM: ~~~r&m--- SUBJECT: MEMORANDUM DATE +!~&j!?~ _______ SITE NAME: CITY: -,&a o~-,--,-,--,-_-,sT~TE:-~A- P OWNER(S) --~=c-L&& ----- -------- Cu-rc"t: B_eh& --------------_- Owner contacted 0 yes 0 no; if yes, dete contacted ------------- TYPE OF OPERATION ----------------- 0 Research & Development 6 0 Production scale testing Pilot Scale 0 Bench Scale Process 0 Theoretical Studies 0 Sample 84 Analysis Y Facility Type Bi Manufacturing University 0 Research Organization 0 0 Government Sponsored Facility 0 Other --------------------- 0 Production 0 Disposal/Storage TYPE OF CONTRACT -------------w-w 0 Prime 0 Subcontract&r 6 Purchase Order cl Other information (i.e., cost + fixed fee, unit price, time & material, etc) ___

57

TO: FILE  

Office of Legacy Management (LM)

TO: FILE TO: FILE D iev' c FROM: ---L----l!!--- MEMORANDUM k+=+ 7 DATE--- _-- ----_---- past: ---------- - -- .---1---------. &4 k WOdY Curr="t:----------------------- Owner contacted ,es *no; ' 0, -if yes, date contacted TYPE OF OPERATION ----------------- p Research & Dews1 opment q Production scale testing 0 Pilot Scale q Sample 84 Analysis B Production q Facility Type 0 Hanufacturinq 0 University 0 Research Organization c] Government Sponsored Facility q Other --------------------- ' IvP!LoE-c!EI~ncI fl Prime 0 Subcontractor 0 Purchase Order !B Other information (i.e., cost + fixed fee, unit price, PIEWUED FIEWMED GOVT GOVT CONTRACTOR CONTRRCTOR OWE!! LEASE_D O!!!NH LE_ASEE OWNED ---------- ~-~LE!3_SEI! % LANDS i u 0 BUILDINGS EQUIPMENT

58

Algorithms for string and graph layout  

E-Print Network (OSTI)

Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on ...

Newman, Alantha.

2004-01-01T23:59:59.000Z

59

Towards graph containment search and indexing  

Science Conference Proceedings (OSTI)

Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g ? D such that q contains g (q ? g). Due to the wide adoption of graph models, fast containment search ...

Chen Chen; Xifeng Yan; Philip S. Yu; Jiawei Han; Dong-Qing Zhang; Xiaohui Gu

2007-09-01T23:59:59.000Z

60

Temporal Representation in Semantic Graphs  

Science Conference Proceedings (OSTI)

A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

Levandoski, J J; Abdulla, G M

2007-08-07T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Errors in graph embedding algorithms  

Science Conference Proceedings (OSTI)

One major area of difficulty in developing an algorithm for embedding a graph on a surface is handling bridges which have more than one possible placement. This paper addresses a number of published algorithms where this has not been handled correctly. ... Keywords: Algorithm, Graph embedding, Graph genus, Torus

Wendy Myrvold; William Kocay

2011-03-01T23:59:59.000Z

62

Extremal graphs without 4-cycles  

Science Conference Proceedings (OSTI)

We prove an upper bound for the number of edges a C"4-free graph on q^2+q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Keywords: Extremal graph, Polarity, Projective plane

Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford

2013-05-01T23:59:59.000Z

63

Power domination in block graphs  

Science Conference Proceedings (OSTI)

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation ... Keywords: algorithm, block graphs, electric power system, power dominating set

Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao

2006-08-01T23:59:59.000Z

64

Graph theoretic approach to parallel gene assembly  

Science Conference Proceedings (OSTI)

We study parallel complexity of signed graphs motivated by the highly complex genetic recombination processes in ciliates. The molecular gene assembly operations have been modeled by operations of signed graphs, i.e., graphs where the vertices have a ... Keywords: Double-split graphs, Gene assembly, Local complement, Parallel assembly, Perfect matching, Signed graphs, Split graphs

Tero Harju; Chang Li; Ion Petre

2008-11-01T23:59:59.000Z

65

Data Files Monthly Natural Gas Gross Production Report  

U.S. Energy Information Administration (EIA) Indexed Site

XLS 4 Other Sources: Comparisons between EIA-914 estimates and other sources, Bcfd XLS 5 EIA-914 Response Rates: Production Weighted Response Rates by Area by Month, percent XLS...

66

Quantum chaos on discrete graphs  

E-Print Network (OSTI)

Adapting a method developed for the study of quantum chaos on {\\it quantum (metric)} graphs \\cite {KS}, spectral $\\zeta$ functions and trace formulae for {\\it discrete} Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of $\\zeta$ functions proposed originally by Ihara \\cite {Ihara}, and expanded by subsequent authors \\cite {Stark,Sunada}. Finally, a model of "classical dynamics" on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs \\cite {KS}.

Uzy Smilansky

2007-04-26T23:59:59.000Z

67

TO: FILE  

Office of Legacy Management (LM)

, , TO: FILE ---w-o----- SUBJECT: 1 CITY: STATE: fld -------------------------- OWNER(S) -------_ Past: _----------------------- curr,ent : --------------------______ Owner cnntakted 0 yes RI-IO; if yes, date contacted----- ~TYPE OF OPERATION .: ,. 0. Research & Development n Facility Type 0 Production scale testing 0 Pilot Scale 0 Manufacturing 0 Ben&i Scale Process 0 University 0 Theoretical Studies IJ Research Organizatian a 0 Government Sample & Analysis .' 0 Production 0. Disposal f Storage a Prime 0 Subcnntract& 0 Purchase Order cl Other inf brmation (i . e., cast + fixed fee, unit price, time & material, qtc) --_---- ~----~---~~~----_-----~~---~ Ccntract/Purch&se Order t). ~--~-~---~~~----_------~---- ---------------------------------

68

TO: FILE  

Office of Legacy Management (LM)

tlEtlORANDUtl tlEtlORANDUtl TO: FILE 311% /1 DATE-----------~------- FROM: P. %a- w-----------_____ SUBJECT: F,/;-;d&;- /3ec+.e I SITE ALTERNATE NAME: --~~~-~-;,.--_~~~~-~-------------NAHE:----------------- _____ CITY: -!%!2~-&&-~- _______ STATE: s.-c&- OWNER(S) _--_--__ Past: ------------------------ Current: I Owner contacted 0 yes --_--~~~--~~~~--~_~--~~-~~ 0 no; if ye., date contacted 1 I TYPE OF OPERATION ---------------__ q Research & Development 0 Production scale testing a Pilot scale 0 Bench Scale Process 0" Theoretical Studies Sample b Analysis 0 Production 0 Disposal/Storage @- Facility Type 0 Government Sponsored Facility W Clther --_Lp2+k-4;- --------------- TYPE OF CONTRACT -_------------__ a Prime 0 Subcontract&

69

TO: FILE  

Office of Legacy Management (LM)

if' if' /, SO -1 : . . ' - ,? \\?.. . . ..- ,- I, al. I, .I (. ,g \. ' \ ,, " ' tlEMOHANDUM TO: FILE FROH: (?.)-/ki' + SITE ALTERNATE ---..~..~.~, NAME: ;d QJA I. /O", JL Ir,, e> 1 :' - _____ ---_--- ---+w- __________ -Nan= __- _____ - _________ Owner cork&ted I-J yes [Bno; If yes, data con'tacted _----__-_ TYPE OF OPERATION ---~~~~~---~~--__ a Research & Development 11 Facility Type 0 Production scale testing 0 Pilot Scale 3 Bench Scale Process Theoretical Studies cl Sample 81 finalysis !-J e4nufacturing 0 University q Research Organization IJ Government Sponsored Facil it) 0 Other ------------_ 0 Production 0 Disposal /Storage TYPE OF CONTRCICT -_-~~~~----~-~-- ,& Prime [II Subcontractor 0 Purchase Order 0 Other information (i.e., ~7,s:

70

Graph Homomorphisms for Quantum Players  

E-Print Network (OSTI)

A homomorphism from a graph X to a graph Y is an adjacency preserving mapping f:V(X)->V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lovasz theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that other quantum graph parameters, such as quantum independence number, can differ from their classical counterparts. Finally, we show that quantum homomorphisms closely relate to zero-error channel capacity. In particular, we use quantum homomorphisms to construct graphs for which entanglement-assistance increases their one-shot zero-error capacity.

David E. Roberson; Laura Mancinska

2012-12-07T23:59:59.000Z

71

Games on Graphs  

E-Print Network (OSTI)

We introduce and study Maker-Breaker positional games on random graphs. Our goal is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of F in the unbiased (one-on-one) game played on the edges of the random graph G(n; p), for various target families F of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game, the Hamiltonian cycle game and the tree game. Particular attention is devoted to unbiased games, when b = 1. Next, we consider the planarity game and the k-coloring game on the complete graph on n vertices. In the planarity game the winning sets are all non-planar subgraphs, and in the k-coloring game the winning sets are all non-k-colorable subgraphs. For both of the games we look at a (1: b) biased game. We are interested in determining the largest bias b such that Maker wins the Maker-Breaker version of the game. On the other hand, we want to find the largest bias b such that Forcer wins the Avoider-Forcer version of the game. Finally, we deal with balanced online games on the random graph process. The game is played by a player called Painter. Edges in the random graph process are introduced two at a time. For each pair of edges Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid creating a monochromatic copy of a prescribed fixed graph H, for as long as possible. We study the threshold mH for the number of edges to be played to know that Painter almost surely will create a monochromatic copy of H, for H being a cycle, a path and a star.

Milos Stojakovic

2005-01-01T23:59:59.000Z

72

Design and Implementation of a Metadata-rich File System  

Science Conference Proceedings (OSTI)

Despite continual improvements in the performance and reliability of large scale file systems, the management of user-defined file system metadata has changed little in the past decade. The mismatch between the size and complexity of large scale data stores and their ability to organize and query their metadata has led to a de facto standard in which raw data is stored in traditional file systems, while related, application-specific metadata is stored in relational databases. This separation of data and semantic metadata requires considerable effort to maintain consistency and can result in complex, slow, and inflexible system operation. To address these problems, we have developed the Quasar File System (QFS), a metadata-rich file system in which files, user-defined attributes, and file relationships are all first class objects. In contrast to hierarchical file systems and relational databases, QFS defines a graph data model composed of files and their relationships. QFS incorporates Quasar, an XPATH-extended query language for searching the file system. Results from our QFS prototype show the effectiveness of this approach. Compared to the de facto standard, the QFS prototype shows superior ingest performance and comparable query performance on user metadata-intensive operations and superior performance on normal file metadata operations.

Ames, S; Gokhale, M B; Maltzahn, C

2010-01-19T23:59:59.000Z

73

TO: FILE  

Office of Legacy Management (LM)

' -1 1. ' -1 1. : . . , . . . "a7 MEMLlRANlJUtl TO: FILE FROM= -&k-k!!L-- l Owner-&ntacted 17 yes Current: ----- ---------- --__ -- -____ I If yes, data contacted ------------- TYPE OF OPERATION -------------____ IJ Research & Development cl Facility Type 0 Production scale testing Cl Pilot Scale a Bench Scale PrOCess 0 Theoretical Studies 0 Sample & Analysis Production 0 Disposal/Storage a Manuf actuiing , q University 0 Research Organizatian / IJ Government Sponsored Facility 0 Other I -------------------- 0 Prime 0 Subcantractk 0 Purchase Order 0 Other information (i.e., iost + fixed fee, unit price, , time & material, .$z) --e-L-- LL---------------------i---- Co"+act/Purchase Order # CONTRACTING PERIOD: __---------------- ----L'r'oll---- --------_-- ____________

74

TO: FILE  

Office of Legacy Management (LM)

pA.l4-l-j pA.l4-l-j TO: FILE I 4 MENORANDUM SUBJECT: aLwE?. .v --_---__ Past: Current: ----__-_____-----------~ -------------------_------ owner c:3ntacted q yes pm; if yes, date contacted ----------__- TYPE OF OPERATION ---_--__~~------_ 0 Research & Development 0 Production scale testing 0 Pilot 5cale 0 Bench Scale Process i Thearetical Studies Sample & Analysis 0 Producti on E Disposal/Storage Facility Type 0 Manufacturing 0 Uni verri ty 0 Research Organization 0 Government Sponsored Facility Cl Other &by-& e- -------- TYPE OF CONTRACT ~--_---_~_-----_ 0 Prime G Subcontractor *! Put-c!wse Order 0 Other information (i.e., cost + fixed fee, unit price, time & material, qtr) m--m--- -----------------_-------~~~ Contract/Purchase Order #

75

To: File  

Office of Legacy Management (LM)

iU i.1 ' iU i.1 ' i d1m1 To: File Fl-0lll: a. Wall0 Subject: FUSRAP review of the former Internationai Rare Metals site in Mt. Kisco New York. The former International Rare Metals Refinery in Mt. Eisco, NY began operations in the early 1940's. Throughout its operatic and in various correspondence it has also been known as "Pregs Mt. Ki sco Refinery" and most,recently, the Canadian Radium and Uranium Corporation site; During the Manhattan Engineer District (MED) era, the federal government through the MED, purchased uranium froni foreign sources, African ores and Canadian ores. The largest part of uranium in the early years were derived from the African ores. The contracts were only for the uranium in these ores. The agreements provided that all of the other valuable elements in

76

TO: FILE  

Office of Legacy Management (LM)

nEnoRANDUn nEnoRANDUn TO: FILE FR0f.t: ~L!S&km. ALTERNATE ---- -COME: ______ --~Z __________ I_v!E-!2E~_oEEeIIE!! p Research & Development 4 beq I I;om +obiylg 0 Production scale testing 0 Pilot Scale 0 ' Bench Scale Process i Theoretical Studies Sample & Analysis 0 Productiart Cl Disposal/Storage a Facility Type 0 Manufacturing 0 University 0 Research Organization 0 Government Sponsored Facility a Other --------------__----_ 0 VI Chic430 Other information (i.e., cost + fixed fee, unit price, time & material, etc) ------- Contract/R I) 7fo,-37+8 ----- ----- ------ ----- ________- __________-______--____ _C!?!!E3~_C12!E-E!!GE: -___~~~~~~-~---~~~~~~-~---- -__- -__ OWNERSHIP: AEC/UED AEC/UED GOVT GOUT co~TiacT0~ ~CONTRACTOR OWNEE LECISE_D EJE!2

77

Data & File Systems  

NLE Websites -- All DOE Office Websites (Extended Search)

Data Management Policies NERSC File Systems HPSS Data Archive Optimizing IO performance on the Lustre file system IO Formats Sharing Data Transferring Data Unix Groups at NERSC...

78

FILE MANAGEMENT MANUAL  

NLE Websites -- All DOE Office Websites (Extended Search)

6.5.2 (ZAP BAD POINTERS) : Appendices :1 Glossary of Important File-Management Terms :29 SPIRES Documentation * SPIRES File Management ***...

79

Euclid File Systems  

NLE Websites -- All DOE Office Websites (Extended Search)

Request Form Euclid File Systems Euclid has 3 kinds of file systems available to users: home directories, scratch directories and project directories, all provided by the NERSC...

80

Distributed large-scale natural graph factorization  

Science Conference Proceedings (OSTI)

Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internet. These graphs are massive, often containing hundreds of millions of nodes and billions of edges. While some theoretical models ... Keywords: asynchronous algorithms, distributed optimization, graph algorithms, graph factorization, large-scale machine learning, matrix factorization

Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, Alexander J. Smola

2013-05-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

On crossing numbers of geometric proximity graphs  

Science Conference Proceedings (OSTI)

Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, ... Keywords: Crossing number, Geometric graphs, Proximity graphs

Bernardo M. brego; Ruy Fabila-Monroy; Silvia Fernndez-Merchant; David Flores-Pealoza; Ferran Hurtado; Vera Sacristn; Maria Saumell

2011-05-01T23:59:59.000Z

82

A history of graph entropy measures  

Science Conference Proceedings (OSTI)

This survey seeks to describe methods for measuring the entropy of graphs and to demonstrate the wide applicability of entropy measures. Setting the scene with a review of classical measures for determining the structural information content of graphs, ... Keywords: Entropy, Graph complexity, Graph entropy, Graphs, Information inequalities, Information measures, Information theory, Structural complexity

Matthias Dehmer; Abbe Mowshowitz

2011-01-01T23:59:59.000Z

83

Energy of graphs and digraphs.  

E-Print Network (OSTI)

??The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the (more)

Jahanbakht, Nafiseh

2010-01-01T23:59:59.000Z

84

Linking SARAH and MadGraph using the UFO format  

E-Print Network (OSTI)

SARAH is a Mathematica package optimized for the fast, efficient and precise study of supersymmetric models beyond the MSSM: a new model can be defined in a short form and all vertices are derived. This allows SARAH to create model files for FeynArts/FormCalc, CalcHep/CompHep and WHIZARD/OMEGA. The newest version of SARAH now provides the possibility to create model files in the UFO format which is supported by MadGraph 5, MadAnalysis 5, GoSam, and soon by Herwig++. Furthermore, SARAH also calculates the mass matrices, RGEs and 1-loop corrections to the mass spectrum. This information is used to write source code for SPheno in order to create a precision spectrum generator for the given model. This spectrum-generator-generator functionality as well as the output of WHIZARD and CalcHep model files have seen further improvement in this version.

Staub, Florian

2012-01-01T23:59:59.000Z

85

Skewed graph partitioning  

Science Conference Proceedings (OSTI)

Graph partitioning is an important abstraction used in solving many scientific computing problems. Unfortunately, the standard partitioning model does not incorporate considerations that are important in many settings. We address this by describing a generalized partitioning model which incorporates the notion of partition skew and is applicable to a variety of problems. We then develop enhancements to several important partitioning algorithms necessary to solve the generalized partitioning problem. Finally we demonstrate the benefit of employing several of these generalized methods to static decomposition of parallel computing problems.

Hendrickson, B.; Leland, R. [Sandia National Labs., Albuquerque, NM (United States); Van Driessche, R. [Alcatel Telecom, Antwerp (Belgium)

1997-02-01T23:59:59.000Z

86

A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm  

Science Conference Proceedings (OSTI)

A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information ... Keywords: Borel Cayley graph, Cayley graph, Graph theory, Interconnection networks, Network modeling

Jaewook Yu; Eric Noel; K. Wendy Tang

2010-11-01T23:59:59.000Z

87

Clustering based on a near neighbor graph and a grid cell graph  

Science Conference Proceedings (OSTI)

This paper presents two novel graph-clustering algorithms, Clustering based on a Near Neighbor Graph (CNNG) and Clustering based on a Grid Cell Graph (CGCG). CNNG algorithm inspired by the idea of near neighbors is an improved graph-clustering method ... Keywords: Clustering, Grid Cell Graph, Grid cell, Near Neighbor Graph, Near neighbor point set

Xinquan Chen

2013-06-01T23:59:59.000Z

88

CENTRAL FILES  

Office of Legacy Management (LM)

/ .- / .- ~ _. ,- *-.* . . CENTRAL FILES +, a/ o(-t.z2-5 AlLO 1 Pab-FJr 3. 19% TYtxP REPaT To A&7bA cM.m rlmc)HA~ ON JANtJm 23, 1956 f. A. W~~~+Y, M.D. c. 1. 08huRann 8nd J. A. Hlaeririg ob3e8tilw of Trlpr in @ ttd~, (;rulw 2?), 1956, a ttip na nda to UM Crrrit &abw8tury, cword, Ohio. The purpow o? this trip u&a to aondwt the WMnd ti 8 #etia8 of indUrtF%al mgiene run~yr uhiah hre been Thwr8port ia 8 66mpondzLusofthe Amu4ll;rmtr forth&, rtsnyu@raaaderith~.~~M Alb8ugh, emamrud~~roft&~b8 Cnft UbOP&tOraJ'. Duaar&ptian of Trtpr The m88h&nlng oper8t1oM 8t the Alba ah6p lmm UlrrWarf tho# sf&&8mBthrrbrsrtbiefint~~#rru&. r%vo tUX!'lWt %&t&88, m (1) M8hb8 UthM, iOUr 4 th 5) urbthPW(3)dF%ll pSW888SUW8 ba-8

89

EI7153_Praktikum_Simulation_and_Characterization_of_Molecular_Devices.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7153_Praktikum_Simulation_and_Characterization_of_Molecular_Devices.xls Allgemeine Daten: Modulnummer: EI7153 Modulbezeichnung (dt.): Praktikum Simulation and Characterization of Molecular Devices Modulbezeichnung (en.): Praktikum Simulation and Characterization of Molecular Devices Modulniveau: MSc Kürzel

Kuehnlenz, Kolja

90

EI7154_Projektpraktikum_Design_of_Molecular_Circuits.xls Allgemeine Daten  

E-Print Network (OSTI)

EI7154_Projektpraktikum_Design_of_Molecular_Circuits.xls Allgemeine Daten: Modulnummer: EI7154 Modulbezeichnung (dt.): Projektpraktikum Design of Molecular Circuits Modulbezeichnung (en.): Projektpraktikum Design of Molecular Circuits Modulniveau: MSc Kürzel: Untertitel: Semesterdauer: 1 Semester Häufigkeit

Kuehnlenz, Kolja

91

Robust Hamiltonicity of Dirac graphs  

E-Print Network (OSTI)

A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac's theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very strong sense. First, we consider a random subgraph of a Dirac graph obtained by taking each edge independently with probability $p$, and prove that there exists a constant $C$ such that if $p \\ge C \\log n / n$, then a.a.s. the resulting random subgraph is still Hamiltonian. Second, we prove that if a $(1:b)$ Maker-Breaker game is played on a Dirac graph, then Maker can construct a Hamiltonian subgraph as long as the bias $b$ is at most $cn /\\log n$ for some absolute constant $c > 0$. Both of these results are tight up to a constant factor, and are proved under one general framework.

Krivelevich, Michael; Sudakov, Benny

2012-01-01T23:59:59.000Z

92

Quantum networks modelled by graphs  

Science Conference Proceedings (OSTI)

Quantum networks are often modelled using Schrdinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey

Pavel Exner; Olaf Post

2008-01-01T23:59:59.000Z

93

NERSC File Systems  

NLE Websites -- All DOE Office Websites (Extended Search)

Systems Systems NERSC File Systems Overview NERSC file systems can be divided into two categories: local and global. Local file systems are only accessible on a single platform, providing best performance; global file systems are accessible on multiple platforms, simplifying data sharing between platforms. File systems are configured for different purposes. On each machine you have access to at least three different file system Home: Permanent, relatively small storage for data like source code, shell scripts, etc. that you want to keep. This file system is not tuned for high performance from parallel jobs. Referenced by the environment variable $HOME. Scratch: Large, high-performance file system. Place your large data files in this file system for capacity and capability computing. Data is

94

On Generating Random Network Structures: Connected Graphs  

Science Conference Proceedings (OSTI)

are presented for random generation of connected graphs, sugraphs (sub- graphs on the ... a distribution and take it into account at estimation. Attainability is...

95

From quantum graphs to quantum random walks  

E-Print Network (OSTI)

We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.

Gregor Tanner

2005-04-29T23:59:59.000Z

96

Graph anomalies in cyber communications  

Science Conference Proceedings (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

97

Large File System Backup: NERSC Global File System Experience  

E-Print Network (OSTI)

Large File System Backup NERSC Global File System ExperienceNational Laboratory Abstract NERSCs Global File system (from all compute systems at NERSC, holds files and data from

Mokhtarani, Akbar

2008-01-01T23:59:59.000Z

98

CSV File Documentation: Consumption  

Gasoline and Diesel Fuel Update (EIA)

Consumption Consumption The State Energy Data System (SEDS) comma-separated value (CSV) files contain consumption estimates shown in the tables located on the SEDS website. There are four files that contain estimates for all states and years. Consumption in Physical Units contains the consumption estimates in physical units for all states; Consumption in Btu contains the consumption estimates in billion British thermal units (Btu) for all states. There are two data files for thermal conversion factors: the CSV file contains all of the conversion factors used to convert data between physical units and Btu for all states and the United States, and the Excel file shows the state-level conversion factors for coal and natural gas in six Excel spreadsheets. Zip files are also available for the large data files. In addition, there is a CSV file for each state, named

99

Dirac File Systems  

NLE Websites -- All DOE Office Websites (Extended Search)

http:help.nersc.gov consult@nersc.gov 1-800-66-NERSC, option 3 or 510-486-8611 Home For Users Computational Systems Dirac File storage File Storage Disk Quota...

100

Probe threshold and probe trivially perfect graphs  

Science Conference Proceedings (OSTI)

An undirected graph G=(V,E) is a probeC graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E^'@?NxN such that G^'=(V,E@?E^') is a C graph. In this article we investigate probe ... Keywords: 2-SAT, Graph class, Probe graphs, Probe interval, Probe threshold, Probe trivially perfect

Daniel Bayer; Van Bang Le; H. N. de Ridder

2009-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Standard interface file handbook  

SciTech Connect

This handbook documents many of the standard interface file formats that have been adopted by the US Department of Energy to facilitate communications between and portability of, various large reactor physics and radiation transport software packages. The emphasis is on those files needed for use of the VENTURE/PC diffusion-depletion code system. File structures, contents and some practical advice on use of the various files are provided.

Shapiro, A.; Huria, H.C. (Cincinnati Univ., OH (United States))

1992-10-01T23:59:59.000Z

102

Nested (2,r)-regular graphs and their network properties.  

E-Print Network (OSTI)

??A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph (more)

Brooks, Josh Daniel

2012-01-01T23:59:59.000Z

103

APPROXIMATING THE CHROMATIC NUMBER OF A GRAPH BY ...  

E-Print Network (OSTI)

Dec 16, 2005 ... ?(G) of a graph G. We introduce an operator ? mapping any graph parameter ?( G), nested between ...... On the Shannon capacity of a graph.

104

Time Series Graphs of Global and Hemispheric Temperature Anomalies...  

NLE Websites -- All DOE Office Websites (Extended Search)

Time Series Graphs of Global and Hemispheric Temperature Anomalies graphics Graph - Global and Hemispheric Annual Temperature Anomalies, 1850-2012 graphics Graph - Northern...

105

FFATA sub reporting data model_draft_100715.xls  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Requirements for FFATA Implementation - Data Model Requirements for FFATA Implementation - Data Model # GRANTS ELEMENT NAME GRANTS DEFINITION Sub-field (if applicable) Required (Y/N) Field Type Data Source: Primary Data Source: Secondary Awardee can flag for correction if derived from FAADS+ (Y/N) Notes to Federal agencies Note: This column will be removed after the agency comment period and will not appear in the final. 1 Federal Award Identifier Number (FAIN) The award number or other identifying number assigned by the Federal awarding agency, such as the federal grant number. Y Pre-populated Agency FAADS+ file N FAADS+ element name, FR.gov definition; no change to FAADS+ files required. 2 State Application Identifier (SAI) The state-assigned number for programs subject to state review in

106

Positional Games on Random Graphs  

E-Print Network (OSTI)

We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of in the unbiased game played on the edges of random graph G(n, p), for various target families of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game and the Hamiltonian cycle game.

Milos Stojakovic; Tibor Szabo

2005-01-01T23:59:59.000Z

107

1999 CBECS Public Use Files  

Gasoline and Diesel Fuel Update (EIA)

1999 Commercial Buildings Energy Consumption Survey Detailed Tables. If you need assistance viewing this page, please contact 202-586-8800. Energy Information Administration Home Page 1999 Commercial Buildings Energy Consumption Survey Detailed Tables. If you need assistance viewing this page, please contact 202-586-8800. Energy Information Administration Home Page Home > Commercial Buildings Home > CBECS Public Use Data > 1999 Files Updated: October 2002 DATA: How are these files used? Download all format codes (text file, 9 Kb) Download all layout files and format codes (PDF file, 373 Kb) Note: The following are all text files. Layout files range from 3 to 6 KB; data files range from 488 Kb to 1.16 MB. File 1: General Building Information and Energy End Uses (Last modified 10/1/01) Layout File Data File File 2: Building Activities, Special Measures of Size, and Multibuilding Facilities (Last modified 10/1/01) Layout File Data File

108

PDSF's Eliza File Systems  

NLE Websites -- All DOE Office Websites (Extended Search)

Eliza File Systems Eliza File Systems Eliza File Systems Storage at PDSF is organized by group and all partitions are exported to all the nodes in the cluster. Please note that files on these file systems are not backed up. It is the responsibility of users to back up their files themselves as necessary. Over the years at PDSF there have been incidents which resulted in a loss of data from disk, often related to aging hardware. Note that the way to display the SGE io units on the command line is "qconf -se global". Disk Vault Experiments SGE io units Disk Space (TB) Directories eliza1 Atlas 400 35 atlas eliza2 Atlas 200 35 atlas eliza5 Cuore, Kamland 400 34 cuore kamland eliza6 Alice, RNC, Star 400 34 alice rnc star eliza7 Dayabay 200 24 dayabay icecube

109

A discrete curvature on a planar graph  

E-Print Network (OSTI)

Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.

M. Lorente

2004-12-20T23:59:59.000Z

110

Graph coloring and related symmetric functions - CECM  

E-Print Network (OSTI)

metric functions), pa (the power sum symmetric functions), s~ (the Schur functions ), ..... It is true for line graphs (a special class of claw-free graphs) by a result of.

111

0-1 graph partitioning and image segmentation  

E-Print Network (OSTI)

Graph partitioning is the grouping of all the nodes in a graph into two or more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. ...

Goh, Chun Fan

2008-01-01T23:59:59.000Z

112

STEP File Analyzer  

Science Conference Proceedings (OSTI)

... The STEP File Analyzer is a software tool that generates a spreadsheet from a STEP (ISO 10303 STandard for Exchange of Product model data ...

2013-08-06T23:59:59.000Z

113

File:Keystone.pdf | Open Energy Information  

Open Energy Info (EERE)

File Edit History Facebook icon Twitter icon File:Keystone.pdf Jump to: navigation, search File File history File usage File:Keystone.pdf Size of this preview: 463 599...

114

Mining closed relational graphs with connectivity constraints  

Science Conference Proceedings (OSTI)

Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identifying highly associated groups and clusters. In this paper, we investigate ... Keywords: closed pattern, connectivity, graph

Xifeng Yan; X. Jasmine Zhou; Jiawei Han

2005-08-01T23:59:59.000Z

115

A Graph Analytical Approach for Topic Detection  

Science Conference Proceedings (OSTI)

Topic detection with large and noisy data collections such as social media must address both scalability and accuracy challenges. KeyGraph is an efficient method that improves on current solutions by considering keyword cooccurrence. We show that KeyGraph ... Keywords: KeyGraph-based Topic Detection, Topic detection, community detection, network analysis

Hassan Sayyadi, Louiqa Raschid

2013-12-01T23:59:59.000Z

116

Bipartite graph partitioning and data clustering  

Science Conference Proceedings (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 ... Keywords: bipartite graph, correspondence analysis, document clustering, graph partitioning, singular value decomposition, spectral relaxation

Hongyuan Zha; Xiaofeng He; Chris Ding; Horst Simon; Ming Gu

2001-10-01T23:59:59.000Z

117

Introducing complete graphs in molecular connectivity studies  

Science Conference Proceedings (OSTI)

The mathematical model of the molecular polarizability of fifty-four organic compounds, of the lattice enthalpy of twenty metal halides, and of the partition coefficient of twenty-five organic compounds has been used to test four different complete graph, ... Keywords: Mathematical model, algorithms, chemical graphs, complete graphs, core electrons, molecular connectivity, polarizability

Lionello Pogliani

2005-01-01T23:59:59.000Z

118

Graph partitioning via recurrent multivalued neural networks  

Science Conference Proceedings (OSTI)

In this work, the well-known Graph Partitioning (GP) problem for undirected weighted graphs has been studied from two points of view: maximizing (MaxCut) or minimizing (MinCut) the cost of the cut induced in the graph by the partition. An unified model, ...

Enrique Mrida-Casermeiro; Domingo Lpez-Rodrguez

2005-06-01T23:59:59.000Z

119

Drawing graphs nicely using simulated annealing  

Science Conference Proceedings (OSTI)

The paradigm of simulated annealing is applied to the problem of drawing graphs nicely. Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. ... Keywords: aesthetics, graph drawing, simulated annealing

Ron Davidson; David Harel

1996-10-01T23:59:59.000Z

120

Constrained Graph Optimization: Interdiction and Preservation Problems  

SciTech Connect

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

Note: This page contains sample records for the topic "xls files graphs" 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

File list | Open Energy Information  

Open Energy Info (EERE)

16 April 2013 Geothermal Cooling Towers.jpg (file) 690 KB Kyoung 1 11:01, 16 April 2013 Turbine.jpg (file) 530 KB Kyoung 1 23:27, 15 April 2013 Energy 101 GHP Video.png (file)...

122

----Google File System Windows IT  

E-Print Network (OSTI)

Essential ---- Google File System web Windows IT Google IT Google Google File System Google File System Datebase Google Google " " Goolge Goolge Google Google Goolge Google ()(,) Google ...... Google IT Google Google Google Google Google "Google " Google 10

123

Printer-Friendly Handbook Files  

Science Conference Proceedings (OSTI)

... Printer-Friendly Handbook Files. ... Please note that these pdf files are not updated as frequently as the html versions of the e-Handbook are. ...

2013-11-26T23:59:59.000Z

124

Final_Tech_Session_Schedule_and_Location.xls  

NLE Websites -- All DOE Office Websites (Extended Search)

Risk Assessment Issues Risk Assessment Issues HSE Screening Risk Assessment (SRA) for Geologic CO 2 Sequestration file#96 Curtis M. Oldenburg May 2-5, 2005, Hilton Alexandria Mark Center, Alexandria Virginia HSE Screening Risk Assessment (SRA) for Geologic CO 2 Sequestration Curtis M. Oldenburg Earth Sciences Division Fourth Annual Conference on Carbon Capture & Sequestration Alexandria, VA May 2-5, 2005 CO 2 Leakage Risk Motivates SRA Question to be addressed: From a choice of several potential sites, which site has the lowest Health, Safety, and Environmental (HSE) risk? Introduction Geologic Carbon Sequestration Screening HSE Risk Assessment Version 0.9 9/24/2004 C.M. Oldenburg (LBNL) We have developed a Screening Risk Assessment (SRA) tool for Health, Safety, and Environmental (HSE) risk assessment.

125

Happy Endings for Flip Graphs  

E-Print Network (OSTI)

Abstract. We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently. 1

unknown authors

2006-01-01T23:59:59.000Z

126

Happy Endings for Flip Graphs  

E-Print Network (OSTI)

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include intersections of lattices with convex sets, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.

David Eppstein

2007-01-01T23:59:59.000Z

127

Computing Information Value from RDF Graph Properties  

Science Conference Proceedings (OSTI)

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We compute information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.

al-Saffar, Sinan; Heileman, Gregory

2010-11-08T23:59:59.000Z

128

Carver File Systems  

NLE Websites -- All DOE Office Websites (Extended Search)

HOME. The absolute path to a home directory (e.g., u4joe) may change, but the value of HOME will always be correct. Please back up all important files on a regular...

129

Fixing file descriptor leaks  

E-Print Network (OSTI)

We design, implement and test a tool for eliminating file descriptor (FD) leaks in programs at run-time. Our tool monitors FD allocation and use. When the allocation of a new FD would fail because a process's entire pool ...

Dumitran, Octavian-Daniel

2007-01-01T23:59:59.000Z

130

API Requirements for Dynamic Graph Prediction  

SciTech Connect

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

131

Renewal-anomalous-heterogeneous files  

E-Print Network (OSTI)

Renewal-anomalous-heterogeneous files are solved. A simple file is made of Brownian hard spheres that diffuse stochastically in an effective 1D channel. Generally, Brownian files are heterogeneous: the spheres' diffusion coefficients are distributed and the initial spheres' density is non-uniform. In renewal-anomalous files, the distribution of waiting times for individual jumps is exponential as in Brownian files, yet obeys: {\\psi}_{\\alpha} (t)~t^(-1-{\\alpha}), 0renewal as all the particles attempt to jump at the same time. It is shown that the mean square displacement (MSD) in a renewal-anomalous-heterogeneous file, , obeys, ~[_{nrml}]^{\\alpha}, where _{nrml} is the MSD in the corresponding Brownian file. This scaling is an outcome of an exact relation (derived here) connecting probability density functions of Brownian files and renewal-anomalous files. It is also shown that non-renewal-anomalous files are slower than the corresponding renewal ones.

Ophir Flomenbom

2010-08-13T23:59:59.000Z

132

Mixture graph based semi-supervised dimensionality reduction  

Science Conference Proceedings (OSTI)

Graph structure is crucial to graph based dimensionality reduction. A mixture graph based semi-supervised dimensionality reduction (MGSSDR) method with pairwise constraints is proposed. MGSSDR first constructs multiple diverse graphs on different random ... Keywords: dimensionality reduction, mixture graph, noise, pairwise constraints

G. X. Yu; H. Peng; J. Wei; Q. L. Ma

2010-12-01T23:59:59.000Z

133

LINEAR INEQUALITIES AMONG GRAPH INVARIANTS: USING ...  

E-Print Network (OSTI)

[30] P. Fowler, P. Hansen, G. Caporossi, and A. Soncini, Polyenes with maximum homo-lumo gap. (variable neighborhood search for extremal graphs 7),...

134

Graph algorithms in the titan toolkit.  

Science Conference Proceedings (OSTI)

Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

McLendon, William Clarence, III; Wylie, Brian Neil

2009-10-01T23:59:59.000Z

135

A copositive programming approach to graph partitioning  

E-Print Network (OSTI)

Aug 3, 2005 ... the random graph we can determine OPTMC by inspection, see column 3. The last 4 columns .... completeness. Freeman, San Francisco, 1979.

136

Line graph explorer: scalable display of line graphs using Focus+Context  

Science Conference Proceedings (OSTI)

Scientific measurements are often depicted as line graphs. State-of-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity ... Keywords: Focus+Context, line graph

Robert Kincaid; Heidi Lam

2006-05-01T23:59:59.000Z

137

ELCAP Data Assembly and Conversion Project: Report on File Contents  

E-Print Network (OSTI)

................................................................................................................7 PNNL Data Files.........................................................................................................................................9 PNNL Site Files.SASLIB.XPT.....................................................................................................................................14 PNNL AVAX Files

138

Multithreaded Algorithms for Graph Coloring  

SciTech Connect

Graph algorithms are challenging to parallelize when high performance and scalability are primary goals. Low concurrency, poor data locality, irregular access pattern, and high data access to computation ratio are among the chief reasons for the challenge. The performance implication of these features is exasperated on distributed memory machines. More success is being achieved on shared-memory, multi-core architectures supporting multithreading. We consider a prototypical graph problem, coloring, and show how a greedy algorithm for solving it can be e*ectively parallelized on multithreaded architectures. We present in particular two di*erent parallel algorithms. The first relies on speculation and iteration, and is suitable for any shared-memory, multithreaded system. The second uses data ow principles and is targeted at the massively multithreaded Cray XMT system. We benchmark the algorithms on three di*erent platforms and demonstrate scalable runtime performance. In terms of quality of solution, both algorithms use nearly the same number of colors as the serial algorithm.

Catalyurek, Umit V.; Feo, John T.; Gebremedhin, Assefaw H.; Halappanavar, Mahantesh; Pothen, Alex

2012-10-21T23:59:59.000Z

139

Feature Tracking Using Reeb Graphs  

Science Conference Proceedings (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

140

Scalable modeling of real graphs using Kronecker multiplication  

Science Conference Proceedings (OSTI)

Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to use "Kronecker graphs", which naturally obey ...

Jure Leskovec; Christos Faloutsos

2007-06-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Generating random graphs with large girth  

Science Conference Proceedings (OSTI)

We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. For any constant k, ? ? 1/2k(k ...

Mohsen Bayati; Andrea Montanari; Amin Saberi

2009-01-01T23:59:59.000Z

142

Collaborative robotic instruction: A graph teaching experience  

Science Conference Proceedings (OSTI)

Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has ... Keywords: Face-to-face computer supported collaborative learning, Intelligent tutoring systems, Interactive learning environments, Robotic assisted teaching

Rubn Mitnik; Matas Recabarren; Miguel Nussbaum; Alvaro Soto

2009-09-01T23:59:59.000Z

143

Inflo: collaborative reasoning via open calculation graphs  

Science Conference Proceedings (OSTI)

Inflo is a web tool that introduces new ways to collaboratively construct and deconstruct logical arguments drawn as visual dataflow graphs. Inflo graphs are dynamic: nodes are logical propositions that can contain computations based on ... Keywords: collaboration, decision making, knowledge curation

Jonathan Lung; Steve Easterbrook

2012-02-01T23:59:59.000Z

144

Anonymizing bipartite graph data using safe groupings  

Science Conference Proceedings (OSTI)

Private data often come in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a large, sparse bipartite graph. As with tabular data, it is desirable to be able ... Keywords: Graph, Microdata, Privacy, Query answering

Graham Cormode; Divesh Srivastava; Ting Yu; Qing Zhang

2010-02-01T23:59:59.000Z

145

Expressing graph algorithms using generalized active messages  

Science Conference Proceedings (OSTI)

Recently, graph computation has emerged as an important class of high-performance computing application whose characteristics differ markedly from those of traditional, compute-bound, kernels. Libraries such as BLAS, LAPACK, and others have been successful ... Keywords: active messages, parallel graph algorithms, parallel programming models

Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine

2013-08-01T23:59:59.000Z

146

Improved call graph comparison using simulated annealing  

Science Conference Proceedings (OSTI)

The amount of suspicious binary executables submitted to Anti-Virus (AV) companies are in the order of tens of thousands per day. Current hash-based signature methods are easy to deceive and are inefficient for identifying known malware that have undergone ... Keywords: call graph, graph edit distance, malware, simulated annealing, static analysis

Orestis Kostakis; Joris Kinable; Hamed Mahmoudi; Kimmo Mustonen

2011-03-01T23:59:59.000Z

147

Graph mining: Laws, generators, and algorithms  

Science Conference Proceedings (OSTI)

How does the Web look? How could we tell an abnormal social network from a normal one? These and similar questions are important in many fields where the data can intuitively be cast as a graph; examples range from computer networks to sociology to biology ... Keywords: Generators, graphs, patterns, social networks

Deepayan Chakrabarti; Christos Faloutsos

2006-06-01T23:59:59.000Z

148

Quantum Algorithms for Graph Problems -- A Survey  

E-Print Network (OSTI)

In this survey we give an overview about important methods to construct quantum algorithms and quantum lower bounds for graph problems. We show how to use these methods, and we give a summary about the quantum complexity of the most important graph problems. At the end of our paper, we give some interesting questions in this research area.

Sebastian Drn

2006-01-01T23:59:59.000Z

149

Oriented unicyclic graphs with extremal skew energy  

E-Print Network (OSTI)

Let $\\G$ be an oriented graph of order $n$ and $\\a_1,\\a_2,..., \\a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\\G.$ The skew energy $\\displaystyle{\\cal E}_s(\\G)= \\sum_{i=1}^{n} |\\a_i|.$ In this paper, the oriented unicyclic graphs with minimal and maximal skew energy are determined.

Yaoping, Hou; Chongyan, Zhang

2011-01-01T23:59:59.000Z

150

Bond Graph Modeling Of Variable Structure Systems  

E-Print Network (OSTI)

The problem of describing variable structure models in a compact, object--oriented fashion is revisited and analyzed from the perspective of bond graph modeling. Traditionally, bond graphs have always been used to describe continuous-- time physical processes with a fixed structure. Yet, this paper shall demonstrate that bond graphs are equally suitable to describe variable structure models as fixed structure models. Moreover, a bond graph description of variable structure models can teach us a lot about the essential properties of variable structure models, properties that are not easily visible when other modeling approaches are taken. The paper discusses issues related to causality reassignment and conditional index changes as a consequence of switching in a physical system. Keywords: Bond graphs, variable structure system, computational causality, conditional index change, switching, object--oriented modeling, Dymola. INTRODUCTION When the causality strokes were added to the forme...

Franois E. Cellier; Martin Otter; Hilding Elmqvist

1995-01-01T23:59:59.000Z

151

Annual Energy Review - Energy Information Administration  

U.S. Energy Information Administration (EIA)

3.2 Value of Fossil Fuel Production, 1949 PDF XLS GRAPH: 3.3 Consumer Price Estimates for Energy by Source, 1970 PDF XLS GRAPH:

152

Description file for NLCD92 contiguous raster coverage file  

NLE Websites -- All DOE Office Websites (Extended Search)

Readme file for NLCD92 contiguous raster coverage file Abstract: This data set is one complete raster coverage of the USGS National Land Cover Data (NLCD). The NLCD is a 21-class...

153

A combinatorial construction of almost-ramanujan graphs using the zig-zag product  

Science Conference Proceedings (OSTI)

Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inherits its size from the large graph, its degree from the small graph ... Keywords: expander graphs, zig-zag product

Avraham Ben-Aroya; Amnon Ta-Shma

2008-05-01T23:59:59.000Z

154

PDSF Shells and Startup Files  

NLE Websites -- All DOE Office Websites (Extended Search)

Shells and Startup Files Shells and Startup Files PDSF Defined Environment When new users are added to the PDSF machines, the shell is set according to the user's request. You can...

155

OHA EIA CASES ARCHIVE FILE  

Energy.gov (U.S. Department of Energy (DOE))

This is a archive file of our EIA decisions, Please download this file to your local computer and use the build in adobe search feature. Individual cases are listed in the bookmark section of the...

156

OHA Whistleblower Cases Archive File  

Energy.gov (U.S. Department of Energy (DOE))

This is a archive file of our Whistleblower decisions, Please download this file to your local computer and use the build in adobe search feature. Individual cases are listed in the bookmark...

157

OHA Security Cases Archive File  

Energy.gov (U.S. Department of Energy (DOE))

This is a archive file of our Security decisions, Please download this file to your local computer and use the build in adobe search feature. Individual cases are listed in the bookmark section of...

158

OHA FOIA Cases Archive File  

Energy.gov (U.S. Department of Energy (DOE))

This is a archive file of our FOIA decisions, Please download this file to your local computer and use the build in adobe search feature. Individual cases are listed in the bookmark section of the...

159

OHA Misc Cases Archive File  

Energy.gov (U.S. Department of Energy (DOE))

This is a archive file of our Misc decisions, Please download this file to your local computer and use the build in adobe search feature. Individual cases are listed in the bookmark section of the...

160

The NERSC CAM README file  

NLE Websites -- All DOE Office Websites (Extended Search)

decomposition and communication layer Parallel Library for Grid Manipulations (PILGRIM), source and build files for which are located in camrootmodelsutilspilgrim....

Note: This page contains sample records for the topic "xls files graphs" 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

Bond graph modeling of centrifugal compressor system  

E-Print Network (OSTI)

system, active surge control. A novel method of modeling centrifugal compression systems for surge control purposes by using bond graphs is presented. By using the bond graph method, we get a simple description of compression systems based on physical phenomena and it is straight forward to get the dynamic equations. It is demonstrated that several active surge control methods can be represented by the same bond graph. It is also shown how methods for active surge control can be classified using energy flow in terms of upstream energy injection or downstream energy dissipation. A model of a compression system with recycle flow is derived in this work. 1.

Nur Uddin; Jan Tommy Gravdahl

2012-01-01T23:59:59.000Z

162

Edison File Storage and I/O  

NLE Websites -- All DOE Office Websites (Extended Search)

File Storage and IO File Storage and IO Disk Quota Change Request Form Edison File Systems The Edison system has 4 different file systems; they provide different levels of disk...

163

The Multilevel Grid File {A Dynamic Hierarchical Multidimensional File Structure  

E-Print Network (OSTI)

ABSTRACT: We present a new dynamic hashed file organization that solves most problems associated with the directory of the grid file proposed by Nievergelt et al. Our scheme is a multilevel extension of the grid file that supports multiattribute accesses to the file for exact-match, partialmatch, and range queries as well as graceful expansion and shrinkage of the file in a dynamic environment. This new file organization offers a number of advantages over the grid file such as compact representation of the directory, linear growth of the directory in the number of records, easy splitting and merging of the directory, efficient processing of partial-match queries, and finer granularity of the directory. Moreover, it provides a new concept, calledabshuct d, that can be employed in practical database applications. 1.

Kyu-young Whang; Ravi Krishnamurthy

1991-01-01T23:59:59.000Z

164

Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs  

E-Print Network (OSTI)

The oriented chromatic number of an oriented graph $\\vec G$ is the minimum order of an oriented graph $\\vev H$ such that $\\vec G$ admits a homomorphism to $\\vev H$. The oriented chromatic number of an undirected graph $G$ is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph $G$, defined as the minimum order of an oriented graph $\\vev U$ such that every orientation $\\vec G$ of $G$ admits a homomorphism to $\\vec U$. We give some properties of this parameter, derive some general upper bounds on the ordinary and upper oriented chromatic numbers of Cartesian, strong, direct and lexicographic products of graphs, and consider the particular case of products of paths.

Sopena, Eric

2010-01-01T23:59:59.000Z

165

Image segmentation by iterated region merging with localized graph cuts  

Science Conference Proceedings (OSTI)

This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide ... Keywords: Graph cuts, Image segmentation, Region merging

Bo Peng; Lei Zhang; David Zhang; Jian Yang

2011-10-01T23:59:59.000Z

166

The depleted hydrogen atoms in chemical graph theory  

Science Conference Proceedings (OSTI)

A new algorithm which explicitly describes the depleted hydrogen atoms is proposed for chemical graph computations, and especially for molecular connectivity model studies. The new algorithm continues to be centred on the concepts of complete graphs ... Keywords: General chemical graphs, complete graphs, hydrogen perturbation, molecular connectivity computations

Lionello Pogliani

2008-12-01T23:59:59.000Z

167

On the density of a graph and its blowup  

Science Conference Proceedings (OSTI)

It is well known that, of all graphs with edge-density p, the random graph G(n,p) contains the smallest density of copies of K"t","t, the complete bipartite graph of size 2t. Since K"t","t is a t-blowup of an edge, the following intriguing open question ... Keywords: Blowup, Graph density, Triangle density

Asaf Shapira; Raphael Yuster

2010-11-01T23:59:59.000Z

168

Theoretical underpinnings for maximal clique enumeration on perturbed graphs  

Science Conference Proceedings (OSTI)

The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing ... Keywords: Graph algorithms, Graph perturbation theory, Maximal clique enumeration, Uncertain and noisy data

William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova

2010-06-01T23:59:59.000Z

169

Northern Pass WLT Filing  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

September 12, 2013 Electronic filing September 12, 2013 Electronic filing Christopher Lawrence Office of Electricity Delivery and Energy Reliability (OE-20), U.S. Department of Energy, 1000 Independence Avenue, SW. Washington, DC 20585 Fax: (202) 586-8008 Christopher.Lawrence@hq.doe.gov Re: Petition by The Weeks Lancaster Trust to intervene in the matter of the Northern Pass Transmission LLC Application for a Presidential Permit (OE Docket No. PP-371) Dear Mr. Lawrence, Following is the petition by The Weeks Lancaster Trust LLC to intervene and comment in the matter of Northern Pass Transmission LLC's Application for a Presidential Permit (PP-371). In accordance with the Notice of Application for this proceeding (75FR 69990), we are also sending a hard copy to the address above. Please contact us by

170

MICROCOMP output file  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

O:\END\EPAC300.lc (file 1 of 19) O:\END\EPAC300.lc (file 1 of 19) S.L.C. 109TH CONGRESS REPORT " ! HOUSE OF REPRESENTATIVES SENATE 1st Session 109- ENERGY POLICY ACT OF 2005 , 2005.-Ordered to be printed , from the committee of conference, submitted the following CONFERENCE REPORT [To accompany H.R. 6] The committee of conference on the disagreeing votes of the two Houses on the amendment of the Senate to the bill (H.R. 6), to en- sure jobs for our future with secure, affordable, and reliable energy, having met, after full and free conference, have agreed to rec- ommend and do recommend to their respective Houses as follows: That the House recede from its disagreement to the amendment of the Senate and agree to the same with an amendment as fol- lows: In lieu of the matter proposed to be inserted by the Senate

171

MEMORANDUfl J: FILE DATE  

Office of Legacy Management (LM)

J: FILE DATE J: FILE DATE // //r /so -----------w------m FROM: 9. 34oyc -w--------v----- SUBJECT: D3 Bo;s CL&;C J mL-;+J; - Rcc cap 049 /'A :j$: &336;s L-.fh~ w-f L-1 ALE"nirTE __ ------------- --- ---_------------------ CITY: &u+M- - &. -w---v------ ---B-------w STATE: 0 h' -a---- OWNER(S) --pi::;- l>cl, b af.5 CA.-*>J CD Current: Gr;W i- ~U~&;P~ -------------,,' ,-,,,,-, Owner contacted 0 yes jg no; -------------------------- if yes, date contacted ------m------ TYPE OF OPERATION --w--w----------- & Research & Development a Facility Type 0 Production scale testing Cl Pilot Scale 0 Bench Scale Process 0 Theoretical Studies w Sample & Analysis 0 Manufacturing 0 University 0 Research Organization 0 Government Sponsored Facility

172

TO: FILE MEMORANDUM  

Office of Legacy Management (LM)

FILE FILE MEMORANDUM DATE +zljlk> - - - - ---_ _ _ ALTERNATE NAME: CITY: -!~Lh_-~~~bl--~--------STATE: --%&A --~~~~~~---~~~------__ a OWNE=t (!, ----L--- P a s t i awne~-;Pntacted ?? yes --~~~~~-----_------_______ ; i f y e s , d a t e c o n t a c t e d ----------___ TYPE O& OPERATION -----+--------- & Development cl Facility Type 0 D i spbsal/Storage 0 Ma,nuf acturing 0 U n i v e r s i t y 0 R e s e a r c h O r g a n i z a t i o n / 0 Government 0 O t h e r Sponsored Facility -------------------L- TYPE OF CONTRACT -----------_____ 0 Prime 0 S u b & t r a c t o r ??Purctase Order ? Other information (i.e., cost / + fixed fee, unit price, time & material, gtc:) ------- ! ---------------------------- ~ .Ccntract/Purchase O r d e r - - - - - - - - I, # --~~-~-_~~~~---- CONTRACTING PESIOD- i -------e------L---- .I --~-~~r~-~~-~~--- ______ ~--~--- OWNERSHIP:

173

Graph Invariants and Large Cycles - a Survey  

E-Print Network (OSTI)

Graph invariants are the best and single tools for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures (cycle structures, factors, colorings, coverings, and so on). In this survey paper we have attempted to bring together all direct (pure) relations between basic invariants of a graph and its large cycle structures, perhaps the most important cycle structures, namely Hamilton, longest, dominating and some generalized cycles including Hamilton and dominating cycles as special cases. These very few relations actually form a source (basis) from which nearly all possible hamiltonian results can be developed further based on generalized and extended invariants, extended list of path or cycle structures and additional structural limitations.

Nikoghosyan, Zh G

2010-01-01T23:59:59.000Z

174

Electronic tools for designing charts and graphs  

E-Print Network (OSTI)

This thesis explores the issues involved in designing an interactive chart and graph making system, especially tailored to the needs of the graphic designer. It defines a set of user interface requirements and describe the ...

Jones, Mary, M.S.V.S. Massachusetts Institute of Technology

1983-01-01T23:59:59.000Z

175

The Gram dimension of a graph  

E-Print Network (OSTI)

be a Gram representation of Xi and let U an orthogonal matrix mapping u. (1) j to u. (2) ...... On the Shannon capacity of a graph IEEE Trans. Inform. Th. IT-25:.

176

Continuous Time Group Discovery in Dynamic Graphs  

Science Conference Proceedings (OSTI)

With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.

Miller, K; Eliassi-Rad, T

2010-11-04T23:59:59.000Z

177

Semiregular Factorization of Simple Graphs A. J. W. Hilton  

E-Print Network (OSTI)

]. A (d, d + 1)-graph is said to be semiregular. An (r, r + 1)-factorization of a graph is a decomposition of the graph into edge-disjoint (r, r + 1)-factors. We discuss here the state of knowledge about (r, r +1)-factorizations of d-regular graphs and of (d, d + 1)-graphs. For r, s 0, let (r, s) be the least integer

Wojciechowski, Jerzy

178

Large File System Backup: NERSC Global File System Experience  

SciTech Connect

NERSC's Global File system (NGF), accessible from all compute systems at NERSC, holds files and data from many scientific projects. A full backup of this file system to our High Performance Storage System (HPSS) is performed periodically. Disk storage usage by projects at NERSC has grown seven fold over a two year period, from ~;;20TB in June 2006 to ~;;140 TB in June 2008. The latest full backup took about 13 days and more than 200 T10k tape cartridges (.5 TB capacity). Petabyte file systems are becoming a reality in the next few years and the existing utilities are already strained in handling backup tasks.

Mokhtarani, Akbar; Andrews, Matthew; Hick, Jason; Kramer, William

2008-10-23T23:59:59.000Z

179

Improving accessibility to statistical graphs: the iGraph-Lite system  

Science Conference Proceedings (OSTI)

Information is often presented in graphical form. Unfortunately, current assistive technologies such as screen readers are not well-equipped to handle these representations. To provide accessibility to graphs published in ``The Daily" (Statistics Canada's ... Keywords: accessibility (blind and visually impaired), natural language interaction, statistical graphs

Leo Ferres; Petro Verkhogliad; Gitte Lindgaard; Louis Boucher; Antoine Chretien; Martin Lachance

2007-10-01T23:59:59.000Z

180

MEMORANDUM TO: FILE  

Office of Legacy Management (LM)

3 3 MEMORANDUM TO: FILE FROM: D, h&Z *_ --------------__ SITE NA,,E: -------- CITY: -%+&6!? -------------------------- STATE: CT cr: 13 ------ WNERL_S, Past: -------_____-----_-_____ current: -----------------------~-- Owner contacted q yes q no; if yes, date contacted / TYPE OF OPERATION ----------------- J& Research & Development i \ 0 Production scale testing 0 Pilot Scale 0 Bench Scale Process i Theoretical Studies Sample & Analysis m Production e9 Facility Type p Manufacturing rJ University $ Research Organizat 0 Government Sponsor 0 Other I ------------ ,-, I I TFaLility Other information (i.e., cost + fixed fee, unit price, Contract/Purchase ~~~~---~~~_---~~~~---------- I OWNERSHiP: AEC/MED AECbED GOVT GOUT I CONTRACTOR CONTRACTOR

Note: This page contains sample records for the topic "xls files graphs" 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

MEHORANDUfl TO: FILE SUBJECT:  

Office of Legacy Management (LM)

MEHORANDUfl MEHORANDUfl TO: FILE ------_____ SUBJECT: OWNER (S) -----_-- Post:-------_-------_________ current: ---------_---------_______ Owner contacted 0 yes Qnna; if yes, date contacted -------_--___ TYPE OF OPERATION ~~~---~~_-----__- 0 Research & Develapment x Facility Type 0 Production scale testing 0 Pilot Scale 0 Bench Scale Pkoces;s i ,Theoretical Studies Sample & Analysis 0 Manufacturing 0 University 0 Research Drganizaticn 0 Government Sponsored Facility & other &ded-S~AWe-- c Production 0 Di cposal /Storage TYPE OF CONTRACT ---------------- 5 Prime 0 Q Subcontract& -$JJ$~~~$~~' ~~*' - T04' L Other information (i.e., cost + fixed fee, unit price, 0 Purchase Order time 81 material, qtr) ------- _----__------_---__--------- Cantract/Purkhaae Order #-@ -'

182

MEMORANDUM TO: FILE  

Office of Legacy Management (LM)

.f ! I I (' ii MEMORANDUM TO: FILE DATE 5 +/9! ----- ------------- FROM: D. Jxw+ a--------------- SUBJECT: E/;vlr;l~&~- fico -de+& Y&U- c . 6. %qo+y& + 3-r SITE NAME: c- G* ~.&-J&-& 4 fib+< ALTERNATE -------a----- _------------------------ NAME: ---------------------- CITY: &w;-&u; & ----------------------e-w- STATE: /+?# ------ OWNER(S) ---pi;;;- c * c. s&r--&&+ ------------ -- -------- Current: un W&e k Owner contacted 0 yes a no; ---w-------------------m-- if yes, date contacted -----a------- TYPE OF OPERATION ----------------- a Research 81 Development 0 Facility Type fl Production scale testing 0 Pilot Scale 0 Bench Scale Process 0 Theoretical Studies 0 Sample & Analysis 0 Production

183

MEIIORANDUM TO: FILE  

Office of Legacy Management (LM)

MEIIORANDUM MEIIORANDUM TO: FILE FROM: A. &/b~ ----------_----_ SUBJECT: TYPE OF OPERATION ~_~~_--~~_------_ q Research & Development 0 Production scale testing 0 Pilat Scale 0 Bench Scale Process 0 Theoretical Studies 0 Sample & Analysis q Facility Type 0 Manufacturing 0 University 0 Research Organization 0 Gavernment Sponsored Faci 1 i ty 0 Other ~~~~~~~-~~--_--___--- 0 Product: on a Disposal/Stiorage TYPE OF CONTRACT ------_----__--_ 0 Prime q Other information (i.e., cost 0 Subcontractor + fixed fee, unit price, U Purchase Order time & material, gtc) ------- -L-------------------------- .&ntr&/Purchase Order #-$&z a :~-_~~;;~~~-~~~~-~-~~bh~' ,~. CENTRACTING PERIOD: raj * ------------------------------------- OWNERSHIP: AEC/MED AEC/MED GOVT GOUT CONTRACTOR CONTRACToR

184

MEMORANDUM TO: FILE  

Office of Legacy Management (LM)

. . 8, +::.-., . MEMORANDUM TO: FILE FROM: A* d&k -------- SUBJECT: SITE NAME: ---------------i--__--____ if yes, date contacted --i---------- TYPE OF OPERATION ~-~_---_-~~~--__- 0 Research & Development 0 Production scale testing Cl Pilot Scale 0 Bench Scale Process i Theoretical Studies Sample & Analysis Cl Productian I3 Disposal /Storage Facility Type/ 0 Research Okganitation 0 Government~Spcnsored Facil$ty 0 Other ~~~~~~~--~-~~-_~~---- TYPE OF CONTRACT ~--_---_-~~----_ 0 Prime 0 Subcontract& 0 Purchase Order Cant.r&t/Purchase Order / I CI Other information (i.e., cost + fixed fee, unit pr~ice, time & material,.gtc) '~ ------- ---------------------------- CP!IE!!CIL~E-PSELgQ: rst4 ----------------------------- OWNERSHIP:

185

CONTAM Weather File Creator Help  

Science Conference Proceedings (OSTI)

... Then enter the start and end date for Daylight Savings Time. First Day of the Year. ... Converting an Energy Plus Weather File. ...

186

quFiles: the right file at the right time  

Science Conference Proceedings (OSTI)

A quFile is a unifying abstraction that simplifies data management by encapsulating different physical representations of the same logical data. Similar to a quBit (quantum bit), the particular representation of the logical data displayed by a quFile ...

Kaushik Veeraraghavan; Jason Flinn; Edmund B. Nightingale; Brian Noble

2010-02-01T23:59:59.000Z

187

Ion shaking in the 200 MeV XLS-ring  

Science Conference Proceedings (OSTI)

It has been shown that ions, trapped inside the beam`s potential, can be removed by the clearing electrodes when the amplitude of the ion oscillation is increased by vertically shaking the ions. We will report on a similar experiment in the 200 Mev XLS ring. The design of the ion clearing system for the ring and the first results obtained, were already reported. In the present series of experiments, RF voltage was applied on a pair of vertical strip-lines. The frequency was scanned in the range of the ion (from H{sub 2} to CO{sub 2}) bounce frequencies in the ring (1--10 MHz). The response of the beam size, vertical betatron tune and lifetime was studied.

Bozoki, E.; Kramer, S.L.

1992-12-31T23:59:59.000Z

188

Ion shaking in the 200 MeV XLS-ring  

Science Conference Proceedings (OSTI)

It has been shown that ions, trapped inside the beam's potential, can be removed by the clearing electrodes when the amplitude of the ion oscillation is increased by vertically shaking the ions. We will report on a similar experiment in the 200 Mev XLS ring. The design of the ion clearing system for the ring and the first results obtained, were already reported. In the present series of experiments, RF voltage was applied on a pair of vertical strip-lines. The frequency was scanned in the range of the ion (from H[sub 2] to CO[sub 2]) bounce frequencies in the ring (1--10 MHz). The response of the beam size, vertical betatron tune and lifetime was studied.

Bozoki, E.; Kramer, S.L.

1992-01-01T23:59:59.000Z

189

GRAPHS AND (Z2) k-ACTIONS  

E-Print Network (OSTI)

Abstract. Let (?, M n) be an effective smooth action of (Z2) k on an n-dimensional smooth closed connected manifold having a finite fixed set. One can associate to this action a regular graph of valency n. If the action is nonbounding one uses this graph to obtain a lower bound for the number of fixed points. Furthermore, this result is applied to a general nonbounding (Z2) k-action fixing a finite fixed set. With the help of graphs and the Kosniowski-Stong formula, up to cobordism all (Z2) k-actions fixing three isolated points (resp. four isolated points) are classified completely, and at the same time, the Smith problem for (Z2) k-actions fixing three isolated points (resp. four isolated points) is also solved. 1.

Zhi L

2005-01-01T23:59:59.000Z

190

Graph clustering with network structure indices  

E-Print Network (OSTI)

Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that they can be effective at discovering the latent groups or communities that are defined by the link structure of a graph. However, both approaches rely on prohibitively expensive computations, given the size of modern relational data sets. Network structure indices (NSIs) are a proven technique for indexing network structure and efficiently finding short paths. We show how incorporating NSIs into these graph clustering algorithms can overcome these complexity limitations. We also present promising quantitative and qualitative evaluations of the modified algorithms on synthetic and real data sets. 1.

Matthew J. Rattigan; Marc Maier; David Jensen

2007-01-01T23:59:59.000Z

191

Subgraphs of quasi-random oriented graphs  

E-Print Network (OSTI)

One cannot guarantee the presence of an oriented four-cycle in an oriented graph $D$ simply by demanding it has many edges, as an acyclic orientation of the complete graph on $n$ vertices has $\\binom{n}{2}$ edges -- the most possible -- but contains no oriented cycle. We show that a simple quasi-randomness condition on the orientation of $D$ does allow one to guarantee the presence of an oriented four-cycle. Significantly our results work even for sparse oriented graphs. Furthermore, we give examples which show that, in a sense, our result is best possible. We also prove a result concerning oriented six-cycles and a more general result in the case $D$ is dense. Finally, we raise a number of questions and conjectures related to these results.

Amini, Omid; Huc, Florian

2009-01-01T23:59:59.000Z

192

File and Data Repositories for CALPHAD and Beyond  

Science Conference Proceedings (OSTI)

Such a repository needs to include files with functional descriptions, data files used for refinement of the functional descriptions and auxiliary files. The files are ...

193

File:07TXBRECGeneratorCertification.pdf | Open Energy Information  

Open Energy Info (EERE)

TXBRECGeneratorCertification.pdf Jump to: navigation, search File File history File usage Metadata File:07TXBRECGeneratorCertification.pdf Size of this preview: 463 599 pixels....

194

File:03MTCEncroachmentOverview.pdf | Open Energy Information  

Open Energy Info (EERE)

MTCEncroachmentOverview.pdf Jump to: navigation, search File File history File usage File:03MTCEncroachmentOverview.pdf Size of this preview: 463 599 pixels. Other resolution:...

195

File:Federal Hydropower - Southeastern Power Administration.pdf...  

Open Energy Info (EERE)

Login | Sign Up Search File Edit History Facebook icon Twitter icon File:Federal Hydropower - Southeastern Power Administration.pdf Jump to: navigation, search File File...

196

MEMORQNDUM TO: FILE  

Office of Legacy Management (LM)

MEMORQNDUM MEMORQNDUM TO: FILE 7./27/S 7. DATE------------------ M LAU FROt+ ---~--e--------e SITE ALTERNATE NAME: Net b-0 c/i-w, fS ~?L~-----------------N~~E:____---___------------ -----------------+-- CITY:-K_2_EJ=as+ Gz+q s+, pQ~:'&-STATE: cd past:----------------------- Curre"t:-------------------------- Owner contacted 0 yes sno; if yes, date contacted _ TYPE OF OPERATION ~~----_~~~---~~-- B Research & Development 0 'Production scale testing 0 Pilot Scale 0 Bench Scale Process 0 Theoretical Studies q Sample 81 Analysis 0 Praduction 0 Disposal/Storage m Facility Type 0 rlanuf acturing rJ University a Research Organization 0 Sovernment Sponsored Facility U Other --~~~---_~--~-_~~~~-_ q Prime, B Subcontractor a Purchase Order 0 Other information (i.e., cost

197

TO: FILE DATE  

Office of Legacy Management (LM)

tlEi?ORANDUH tlEi?ORANDUH TO: FILE DATE FFtOil: c ----'- Y '%d 6- ----_----_ SUBJECT: SITE NAME: ----------STATE: Owner contacted 0 yes qno; if yes, date contacted ---------__-- TYPE OF OPERATION ----~_--_--~----_ &Research & Development @ Praduction scale testing. 0 Pilat Scale 0 Bench Scale Process a Theoretical Studies 0 Sample & Analysis tin Facility Type R Manufacturing IJ University 0 Research Organization IJ Gavernment Sponsored Facility 0 Other ----------------' --~- 0 Production E Disposal/Storage TYPE OF CONTRACT ~~_-~--_---_--__ P Prime 0 I Cl Subcontractor Other information (i.e., cost K Purchase Order jZM pati !& MC4 + fixed fee, unit price, time 81 material, etc) ---------------------_----~-- OWNERSHIP: AEC/MED AEC/MED GOVT GOVT

198

MEHORANDUM TO: FILE  

Office of Legacy Management (LM)

MEHORANDUM MEHORANDUM TO: FILE FR0t-t: -~+?!+-- SUBJECT: u - 5..7. am . . ALTERNATE W% : ---\L-&--~~+. ___- ____ S-fA-rE: t-4 ;5- ------ wJ!%RLSL " Past: ------------------------ Current: --~~---~---__~~~-------~-- Owner contacted 0 yes -glnos if yes, date cotitectad TYPE OF OPERATION ---------_----__- 0 Research & Development 0 Facility Type 0 Production scale testing 0 Pilot Scale 0 Bench Scale Process *I Theoretical Studies 0 Sample & kialysis 0 Production 0 Disposal /Storage IV!?LPExB?!IBfiEI 0 Uanuf ecturing 0 University 0 Research Organization IfJ ,"WW="""s, ---------------___--_ 0 Prims 0 Subcontractor 0 Purchase Order 0 Other information (i.e., cost + fixed fee, unit price, time 81 material, etc) ------- Contract/Purchase Order #

199

MEMORANDUM TO: FILE DATE  

Office of Legacy Management (LM)

-.. -.. 37qg: MEMORANDUM TO: FILE DATE =b-- FROM: ---L- _------__ u . SUBJECT: SITE ACl= ALTERNATE NAME: -_______-~-----------------NA~E:__( CITY:--~---------_-STATE:-~~ (2 OWNE!sI_SL f Past- L&cl= w ------------------- ----- Current- w buL.r - ------------ ownq cm-ltacted 0 yes @ "no; if yes, data cnntacte TYPE OF OPERATION -------------_~-~ q Research & Development 0 Production %.cale testing 0 Pilot Scale 0 Bench Scale Process 0 Theoretical Studies 0 Sample 84 Analysis 0 Production i2 Disposal/Storage 0 Facility T 0 Hanufac 0 Univerrj 0 .R esearc 0 Governm 14 Other 1 I lil IrJ y,/3 Prime 0 Other infcrkion Subcwkractbr (i.e., ?bst + fixed fee! &nit price, Cl Purchase Order time & mate

200

GlNTRM FILES  

Office of Legacy Management (LM)

: .; : .; GlNTRM FILES .- Red Rwtaaie!a .=?%A .-m JJullen mtoxges8ntuuo -006 .017 .olb J-m .021 .OLt .Ol2 *Jeta Lhh .029 .0X9 ,026 ~k~exwteethaae~oyeencloee~ttothxflcmrof bUckaide. After the deccxmdnatimpxcblarrrro mlved.the rt8tma dt&itO lo- &ctioacoilrpasdistuEeed. 1. . ,, -. . . ' The conparty visited 3~ciali.z.e~ ja the a.ppLicatica of Znductiw beat. The purpose of this trip wa s to advise on haaBh and safety measures for the preoceeptance testing of inductioo heat treating equipment procmed by NU3. Tim conclusims &am attaining to the health and safety hazards involved in the iaducti0n heat treating of uraaim mtal axe stated in amtber trip report (D. i. Plowers to J. A. Quigley. LLD,, 12/18/58). Based ca those comzlosions. ,tbe following recomandations were given .to Ajax-

Note: This page contains sample records for the topic "xls files graphs" 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

MEMORANDUM TO: FILE FROM:  

Office of Legacy Management (LM)

p' p' : , .; ' _ ' < 3.518 MEMORANDUM TO: FILE FROM: -Ye L&a --------e---e--- DATE 6j8/8 7 v---s -- ---------- SUBJECT: ;&l a+-b IA T~cornqm Q afib4 SITE NAME: CITY: & &&at leg co Current: ------------------------ Owner contacted 0 yes p no; if yem, date contacted --w---w------ TYPE OF OPERATION The T$SYI L-- Tj flmf ----------------- FResearch & Development a Facility 0 Production scale testing 0 Pilot Scale p Manufacturing 0 Bench Scale Process [3 University 0 Theoretical Studies 0 Research Organization 0 Sample t Analysis 0 Government Sponsored Facility 0 Other --------------------- 0 Production 0 Disposal/Storage TYPE OF CONTRACT ---------------- p Prim* tLl fo$q rJ WQ 0 Subcontractor 0 Purchase Order Cl Other information (i.e., cost

202

MEMORANDUrl TO: FILE  

Office of Legacy Management (LM)

MEMORANDUrl MEMORANDUrl TO: FILE FROM: 3. Lfwhle ---------------- ALTERNATE CITY: ---&!!!J&~~s__~- ________ STATE: --!?-c- (C&IO> OE!!EEL_S1 past: --rc;,b,&&~c! ---- current: --------- ---------- ---__-_ Owner contacted 0 yes g noi if yes, date contacted------ TYPE OF OPERATION ----------------- fl Research & Development 0 Production scale testing 0 Pilot Scale 0 Bench Scale Process p Theoretical Studies cl Sample s1 Analysis 0 Production 0 Disposal/Storage m Facility Type 0 tlanuf acturing p University 0 Research Organization 0 Government Sponsored Facility 0 Other --------------_______ B Prime AKC- cl. G&-Fo~~:~ q Other information (i.e., cost 0 Subcontractor + fixed fee, unit price, 0 Purchase Order C!2!LFSCII!!E-!33X!Z!:

203

HEMORANDUH TO: FILE DATE  

Office of Legacy Management (LM)

HEMORANDUH HEMORANDUH TO: FILE DATE 1123 lLjl ---WV-------------- FROM: P. s&w+ -------v-----s-- SUBJECT: lJ+ - e;& SITE NAME: LJo"zL - /L,' de Cd -J--h=- ALTERNATE l --e-e-- ------w------- ---,,,' ,m--, NAME: ---------------------- CITY: LL-pL~ ------------ ------------- STATE3 e--w-- OWNER tS) -----w-- Past I --k-!!.l~ -pa L . -v-----w------- Current: Owner contac?-ed 0 yes 0 no; if yes, I+Lff A zid;&m - -------------------------- date contacted ------B--m--- TYPE OF OPERATION ----------------- a Research 81 Development a Facility Type 0 Production scale testing 0 Pilot Scale 0 Bench Scale Procesr 0 Theoretical Studies 0 Sample & Analysis m Manuf acturinq 0 University 0 Research Organization 0 Government Sponrored Facility 0 Other

204

MEMORANDUM TO: FILE  

Office of Legacy Management (LM)

' ' a 7 > 3gI, q OH.I-r7.-I (jt' , ""7 MEMORANDUM TO: FILE FROM: ' 'Y OIL&i cz ,,,',, -------we- SUBJECT: SITE NAME: _____ CITY:-AQY&- --------------e----e-- OWNER(S) Owner contacted n yes =urr="t: ----- -Llz2-:---,-- -----___ &,&/4$- '1 :) ' if yes, data contacted ------------- TYPE OF OPERATION ----------------- a Research t Development lti- Facility Type 0 Production scale testing a Manufacturing 5 University 0 Research Organization 0 Government Sponsored Facility Cl Pilot Scale Cl Bench Scale Process : Theoretical Studies Sample SC Analysis 0 Production 0 Di 3posal /Storage TYPE OF CONTRACT -------------w-e BP rime 54, 1; cl Subcontractor a Purchase Order cs dL+f' d~ a 0 Other --------------------- Other information (i.e., cost

205

An empirical comparison of some approximate methods for graph coloring  

Science Conference Proceedings (OSTI)

The Graph Coloring Problem (GCP) is a classical NP-complete problem for which several approximate solution algorithms have been proposed: Brelaz algorithm, simulated annealing (SA), ant colony optimization (ACO). This paper reports empirical results ... Keywords: graph coloring, gravitational swarm

Israel Rebollo-Ruiz; Manuel Graa

2012-03-01T23:59:59.000Z

206

Sequoia tops Graph 500 list of 'big data' supercomputers  

NLE Websites -- All DOE Office Websites (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

207

Long alternating cycles in edge-colored complete graphs  

Science Conference Proceedings (OSTI)

Let Knc denote a complete graph on n vertices whose edges are colored in an arbitrary way. And let ?(Knc) denote the maximum number of edges of the same ... Keywords: alternating cycle, color degree, edge-colored graph

Hao Li; Guanghui Wang; Shan Zhou

2007-08-01T23:59:59.000Z

208

Using constraints to achieve stability in automatic graph layout algorithms  

Science Conference Proceedings (OSTI)

Automatic layout algorithms are commonly used when displaying graphs on the screen because they provide a nice drawing of the graph without user intervention. There are, however, a couple of disadvantages to automatic layout. Without user ...

Karl-Friedrich Bhringer; Frances Newbery Paulisch

1990-03-01T23:59:59.000Z

209

Efficient algorithms for graph all-matching and containment search.  

E-Print Network (OSTI)

??Recent advances in database research have shown the potential of graph in modelling complicated data. Graph data have pervaded many modern applications including bio-informatics, chem-informatics, (more)

Zhu, Gaoping

2012-01-01T23:59:59.000Z

210

The cost of monotonicity in distributed graph searching  

E-Print Network (OSTI)

are placed at a particular vertex of the graph, called the homebase. Moreover, this sequence of moves must is aiming at clearing the whole network. Given a graph G and a homebase v0 V (G), the search problem

Ilcinkas, David

211

The cost of monotonicity in distributed graph searching  

E-Print Network (OSTI)

of the graph, called the homebase. Moreover, this sequence of moves must satisfy that recontamination never network. Given a graph G and a homebase v0 V (G), the search problem consists in designing a distributed

Paris-Sud XI, Université de

212

FASTEST MIXING MARKOV CHAIN ON GRAPHS WITH SYMMETRIES  

E-Print Network (OSTI)

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of ...

Xiao, Lin

213

Computing maximum non-crossing matching in convex bipartite graphs  

Science Conference Proceedings (OSTI)

We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O (n logn ...

Danny Z. Chen; Xiaomin Liu; Haitao Wang

2012-05-01T23:59:59.000Z

214

File:Oregonshpodocumentationstandards.pdf | Open Energy Information  

Open Energy Info (EERE)

Oregonshpodocumentationstandards.pdf Oregonshpodocumentationstandards.pdf Jump to: navigation, search File File history File usage File:Oregonshpodocumentationstandards.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 31 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:37, 20 November 2012 Thumbnail for version as of 11:37, 20 November 2012 1,275 × 1,650 (31 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:Oregonshpodocumentationstandards.pdf&oldid=538466"

215

File:DIAsample.pdf | Open Energy Information  

Open Energy Info (EERE)

DIAsample.pdf DIAsample.pdf Jump to: navigation, search File File history File usage File:DIAsample.pdf Size of this preview: 776 × 600 pixels. Full resolution ‎(1,650 × 1,275 pixels, file size: 280 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:53, 2 August 2012 Thumbnail for version as of 15:53, 2 August 2012 1,650 × 1,275 (280 KB) Andbailey (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: Identify types of development and climate impacts that are country priorities Retrieved from "http://en.openei.org/w/index.php?title=File:DIAsample.pdf&oldid=501432

216

File:Installnot.pdf | Open Energy Information  

Open Energy Info (EERE)

Installnot.pdf Installnot.pdf Jump to: navigation, search File File history File usage File:Installnot.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 175 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 16:12, 13 November 2012 Thumbnail for version as of 16:12, 13 November 2012 1,275 × 1,650 (175 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:Installnot.pdf&oldid=536509"

217

File:Apschem.pdf | Open Energy Information  

Open Energy Info (EERE)

Apschem.pdf Apschem.pdf Jump to: navigation, search File File history File usage File:Apschem.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 105 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:25, 14 November 2012 Thumbnail for version as of 12:25, 14 November 2012 1,275 × 1,650 (105 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:Apschem.pdf&oldid=536777

218

File:20121127144736519.pdf | Open Energy Information  

Open Energy Info (EERE)

1127144736519.pdf 1127144736519.pdf Jump to: navigation, search File File history File usage File:20121127144736519.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 116 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:55, 27 November 2012 Thumbnail for version as of 15:55, 27 November 2012 1,275 × 1,650 (116 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:20121127144736519.pdf&oldid=53999

219

Help:Uploading Files | Open Energy Information  

Open Energy Info (EERE)

Uploading Files Uploading Files Jump to: navigation, search Click on the upload file link at the bottom of the page (NOTE: you must be logged in to have this option). Uploading tutorial.JPG Click on the "choose file" button to choose the file you would like to upload Uploading tutorial2.JPG Choose the file on your local drive that you would like to upload to OpenEI. Uploading tutorial3.JPG Click "upload file" to upload onto OpenEI Uploading tutorial4.JPG Finally, use the file name along with the instructions below to insert into the wikipage. Uploading tutorial5.JPG Links Link to description page If you put a colon (:) before File:, the image will not be embedded and the link will lead to the description page of the file. [[:File:Example.jpg]] [[:File:Example.jpg|Sunflowers]]

220

File:Install.pdf | Open Energy Information  

Open Energy Info (EERE)

Install.pdf Install.pdf Jump to: navigation, search File File history File usage File:Install.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 86 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 13:48, 1 November 2012 Thumbnail for version as of 13:48, 1 November 2012 1,275 × 1,650 (86 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:Install.pdf&oldid=53281

Note: This page contains sample records for the topic "xls files graphs" 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

A hybrid parallel genetic algorithm approach for graph coloring  

Science Conference Proceedings (OSTI)

Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is a well-known NP-hard problem. In this paper a new permutation ... Keywords: Graph coloring problem, message passing interface (MPI), migration model, parallel genetic algorithm, static wavelength assignment

S. N. Sivanandam; S. Sumathi; T. Hamsapriya

2005-08-01T23:59:59.000Z

222

THE OPERATOR FOR THE CHROMATIC NUMBER OF A GRAPH  

E-Print Network (OSTI)

We introduce an operator mapping any graph parameter ( ), nested between the stability number ...... Local chromatic number and Sperner capacity. ?ournal.

223

Hamiltonian Graphs and the Traveling Salesman Problem  

E-Print Network (OSTI)

A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. A new exact polynomial time algorithm for the traveling salesman problem (TSP) based on this new characterization is developed. We then define so called ordered weighted adjacency list for given weighted complete graph and proceed to the main result of the paper, namely, the exact algorithm based on utilization of ordered weighted adjacency list and the simple properties that any path or circuit must satisfy. This algorithm performs checking of sub-lists, containing (p-1) entries (edge pairs) for paths and p entries (edge pairs) for circuits, chosen from ordered adjacency list in a well defined sequence to determine exactly the shortest Hamiltonian path and shortest Hamiltonian circuit in a weighted complete graph of p vertices. The procedure has intrinsic advantage of landing on the desired solution in quickest possible time and even in worst case in polynomial time. A new characterization of shortest Hamiltonian tour for a weighted complete graph satisfying triangle inequality (i.e. for tours passing through every city on a realistic map of cities where cities can be taken as points on a Euclidean plane) is also proposed. Finally, we discuss a novel classical algorithm for unstructured search and its effect on any of the NP-Complete problems.

Dhananjay P. Mehendale

2007-04-27T23:59:59.000Z

224

Multilevel heuristic algorithm for graph partitioning  

Science Conference Proceedings (OSTI)

Many real applications involve optimisation problems where more than one objective has to be optimised at the same time. One of these kinds of problems is graph partitioning, that appears in applications such as VLSI design, data-mining, efficient disc ...

Raul Baos; Consolacin Gil; Julio Ortega; Francisco G. Montoya

2003-04-01T23:59:59.000Z

225

Exploiting graph properties of game trees  

Science Conference Proceedings (OSTI)

The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have concentrated on the traversal of trees, giving the field the name "game-tree ... Keywords: game playing, search

Aske Plaat; Jonathan Schaeffer; Wim Pijls; Arie de Bruin

1996-08-01T23:59:59.000Z

226

Suggesting friends using the implicit social graph  

Science Conference Proceedings (OSTI)

Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit ... Keywords: contact group clustering, implicit social graph, tie strength

Maayan Roth; Assaf Ben-David; David Deutscher; Guy Flysher; Ilan Horn; Ari Leichtberg; Naty Leiser; Yossi Matias; Ron Merom

2010-07-01T23:59:59.000Z

227

Graph clustering with network structure indices  

Science Conference Proceedings (OSTI)

Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that ...

Matthew J. Rattigan; Marc Maier; David Jensen

2007-06-01T23:59:59.000Z

228

Grid smoothing: a graph-based approach  

Science Conference Proceedings (OSTI)

In the past few years, mesh representation of images has attracted a lot of research interest due to its wide area of applications in image processing. In the mesh framework, an image is represented by a graph in which the nodes represent the pixels ... Keywords: content adaptative mesh, grid smoothing, image coding, non-linear optimisation

Guillaume Noel; Karim Djouani; Yskandar Hamam

2010-11-01T23:59:59.000Z

229

Graph grammars with string-regulated rewriting  

Science Conference Proceedings (OSTI)

Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to ... Keywords: Development, Expressive power, Genetic regulation, Graph grammars, Regulated rewriting

Daniel Lobo; Francisco J. Vico; Jrgen Dassow

2011-10-01T23:59:59.000Z

230

Computing role assignments of chordal graphs  

Science Conference Proceedings (OSTI)

In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1,...,k} called a role to each vertex of G such that any two vertices with the same role have ...

Pim Van't Hof; Danil Paulusma; Johan M. M. Van Rooij

2009-09-01T23:59:59.000Z

231

Diagnosability of star graphs with missing edges  

Science Conference Proceedings (OSTI)

In this paper, we study the system diagnosis on an n-dimensional star under the comparison model. Following the concept of local diagnosability [3], the strong local diagnosability property [7] is discussed; this property describes the equivalence of ... Keywords: Comparison diagnosis model, Extended star structure, Local diagnosability, MM* diagnosis model, Star graph, Strong local diagnosability property

Chieh-Feng Chiang; Guo-Huang Hsu; Lun-Min Shih; Jimmy J. M. Tan

2012-04-01T23:59:59.000Z

232

Quantum secret sharing with qudit graph states  

Science Conference Proceedings (OSTI)

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

Keet, Adrian; Fortescue, Ben; Sanders, Barry C. [Institute for Quantum Information Science, University of Calgary, Alberta, T2N 1N4 (Canada); Markham, Damian [LTCI-CNRS, Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)

2010-12-15T23:59:59.000Z

233

Quantum secret sharing with qudit graph states  

E-Print Network (OSTI)

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

Adrian Keet; Ben Fortescue; Damian Markham; Barry C. Sanders

2010-04-26T23:59:59.000Z

234

Hiroshi Ishikawa A Practical Introduction to Graph Cut  

E-Print Network (OSTI)

Technology Contents Overview / Brief history Energy minimization Graphs and their minimum cuts Energy Elevation map #12;History Probablistic methods (SA, ICM,...) have been used for energy minimization OR has Overview / Brief history Energy minimization Graphs and their minimum cuts Energy minimization via graph

Ishikawa, Hiroshi

235

A graph based method for faster display for distribution networks  

Science Conference Proceedings (OSTI)

This paper presents our logical display approach for Distribution Networks based on the concept of Microsoft graphs. We demonstrate that by using Microsoft graphs we do not have to redraw the circuits after each switching operation or after a change ... Keywords: algorithms, distribution, graphs, logical display, network systems

Mansoor Al-A'ali

2008-06-01T23:59:59.000Z

236

Kinetic and stationary point-set embeddability for plane graphs  

Science Conference Proceedings (OSTI)

We investigate a kinetic version of point-set embeddability. Given a plane graph G(V,E) where |V|=n, and a set P of n moving points where the trajectory of each point is an algebraic function of constant ... Keywords: kinetic algorithm, kinetic graph drawing, plane graph, point-set embeddability

Zahed Rahmati; Sue H. Whitesides; Valerie King

2012-09-01T23:59:59.000Z

237

Modeling molecular polarizabilities with graph-theoretical concepts  

Science Conference Proceedings (OSTI)

A model study of the molecular polarizabilities of a wide heterogeneous class of organic compounds was carried out. The model of this property was based on graph-theoretical molecular connectivity and pseudoconnectivity basis indices, including the corresponding ... Keywords: complete graphs, core electrons, graph-theoretical connectivity indices, molecular polarizabilities

Lionello Pogliani

2004-12-01T23:59:59.000Z

238

Discovering informative connection subgraphs in multi-relational graphs  

Science Conference Proceedings (OSTI)

Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper ... Keywords: multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery

Cartic Ramakrishnan; William H. Milnor; Matthew Perry; Amit P. Sheth

2005-12-01T23:59:59.000Z

239

Image segmentation using quadtree-based similarity graph and normalized cut  

Science Conference Proceedings (OSTI)

The graph cuts in image segmentation have been widely used in recent years because it regards the problem of image partitioning as a graph partitioning issue, a well-known problem in graph theory. The normalized cut approach uses spectral graph properties ... Keywords: graph partitioning, image segmentation, quadtree, spectral graph

Marco Antonio Garcia De Carvalho; Anselmo Castelo Branco Ferreira; Andr Luis Costa

2010-11-01T23:59:59.000Z

240

FILES- COOLING TOWER PLUME MODELING  

E-Print Network (OSTI)

Ladies and Gentlemen:? In the referenced letter, Progress Energy Carolinas, Inc. (PEC) noted that the input and output' files for the modeling analysis for cooling tower plumes would be provided under a separate cover. due to the requirements for native file submittal (see NRC RAI # 5.3.3.1-1 and PGN RAI # H-295). The purpose of this letter is to submit these calculation native files. The supplemental information contained in the files on the attached CD is provided to support the NRC's review of the Shearon Harris Nuclear Power Plant Units 2 and 3 (HAR) Environmental Report (ER), but does not comply with the requirements for electronic submission in the NRC Guidance Document. The NRC staff requested the files be submitted in their native formats, required for utilization in the software employed to support the ER development. As discussed with the NRC's environmental project manager responsible for review of the HAR ER, the data provided on the attached CD are of a nature that is not easily convertible to PDF output files. Furthermore, PEC understands that converting the information to PDF output files; would not serve the underlying purpose of the submittal; i.e., to provide the raw, unprocessed data to enable reviewers to evaluate software used in the HAR application. Enclosure 1 provides a list of folders with the requested data files that are included on the attached CD (Attachment 5.3.3.1-1 SACTI Native Files). If you have any further questions, or need additional information, please contact Bob Kitchen at

Garry D. Mi Er

2009-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

File:Bonnevillepowerfactsheet.pdf | Open Energy Information  

Open Energy Info (EERE)

Bonnevillepowerfactsheet.pdf Bonnevillepowerfactsheet.pdf Jump to: navigation, search File File history File usage Metadata File:Bonnevillepowerfactsheet.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 648 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:53, 10 July 2013 Thumbnail for version as of 15:53, 10 July 2013 1,275 × 1,650, 2 pages (648 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file:

242

File:Noaafactsheet.pdf | Open Energy Information  

Open Energy Info (EERE)

Noaafactsheet.pdf Noaafactsheet.pdf Jump to: navigation, search File File history File usage Metadata File:Noaafactsheet.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 551 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:55, 10 July 2013 Thumbnail for version as of 15:55, 10 July 2013 1,275 × 1,650, 2 pages (551 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: Federal Memorandum of Understanding for Hydropower/Participating

243

File:Npsfactsheet.pdf | Open Energy Information  

Open Energy Info (EERE)

Npsfactsheet.pdf Npsfactsheet.pdf Jump to: navigation, search File File history File usage Metadata File:Npsfactsheet.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 657 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:56, 10 July 2013 Thumbnail for version as of 15:56, 10 July 2013 1,275 × 1,650, 2 pages (657 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: Federal Memorandum of Understanding for Hydropower/Participating

244

Help:Managing files | Open Energy Information  

Open Energy Info (EERE)

Managing files Managing files Jump to: navigation, search If file uploads are enabled, you can upload certain types of files to the wiki. This is particularly useful for uploading images, which you want to place on an article, but you can also upload other types of files. Upload a file Prepare the file for upload. Make sure the file is exactly as you want it. In the sidebar, under "toolbox", click "upload file." Click "Browse" next to the "Source filename:" to locate the file on your computer (the name of the "browse" button depends on your web browser). Change the "Destination filename:" to something descriptive, if necessary. Fill in the "Summary," if necessary. Click the "Upload file" button.

245

File:Lucs.pdf | Open Energy Information  

Open Energy Info (EERE)

Lucs.pdf Lucs.pdf Jump to: navigation, search File File history File usage File:Lucs.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 111 KB, MIME type: application/pdf, 4 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:40, 19 November 2012 Thumbnail for version as of 15:40, 19 November 2012 1,275 × 1,650, 4 pages (111 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

246

File:Energydatabusfacthseet.pdf | Open Energy Information  

Open Energy Info (EERE)

Energydatabusfacthseet.pdf Energydatabusfacthseet.pdf Jump to: navigation, search File File history File usage Metadata File:Energydatabusfacthseet.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 385 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:59, 10 July 2013 Thumbnail for version as of 15:59, 10 July 2013 1,275 × 1,650, 2 pages (385 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 3 pages link to this file:

247

DOE FILE NO.  

Office of Legacy Management (LM)

DOE FILE NO. _ ffi~15970 ADMIN RCD _ COMM REF _ pRwm BttO" SVR.l!s.j tJF PLE7l:JJER Rf) TECHNICAL SERVICES DIVISION (TSD) BACKFIT (Documents dated prior to 1 November 1988) FUSRAP COMMUNICATIONS DISTRIBUTION DOEiORO TECHNICAL SERVICES DIVISION (CE·53) BECHTEL NATIONAL INC. - JOB 14501 RESPONSE TRACKING INFORMATION PRIMARY, I lOWED BY: (ORG) I (ORG) TARGET DATE I I CLOSING CCN COMPL DATE ( ( CLOSING REF I I lOWED BY: (ORG) I I I I ( (ORG) TARGET DATE I CLOSING CCN COMPL DATE CLOSING REF AFFECTED DOCUMENT _ ~~~=.k'£...,JUrE.......,"'"A.'-"-- TO _ _....I!1)o<..;J:...!!S'--'L'--- 'COMM DATE tll,I.1t'l'l ADDR CODE I IPJuCLOSES CCN WBS ....Id. iCU DL.::2.."'-- ......... J""I .... 5

248

EIA-411 Data File  

Gasoline and Diesel Fuel Update (EIA)

Form EIA-411 Database Form EIA-411 Database Form EIA-411 - “Coordinated Bulk Power Supply Program Report” Data Coverage and Data Quality Release Date: December 22, 2011 Next Release Date: November 2012 In 2008, the Form EIA-411 became a mandatory collection for all schedules except No. 7 (Transmission Outages) which will continue to be a voluntary filing. The Form EIA-411 collects information about regional electricity supply and demand projections for a five-year advance period and information on the transmission system and supporting facilities. Editing of the data is done by each of the various reliability regions. The data collected on this form are used by the U.S. Department of Energy to monitor the current status and trends of the electric power industry and to evaluate the future reliability of the industry. Each of the reliability regions of the North American Electric Reliability Corporation (NERC) is asked to submit Form EIA-411 after compiling data furnished by utilities and other electricity suppliers within their regions to NERC. NERC then compiles and coordinates these reports and provides the data to the Energy Information Administration.

249

StreamWorks - A system for Dynamic Graph Search  

Science Conference Proceedings (OSTI)

Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.

Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.

2013-06-11T23:59:59.000Z

250

Maker Can Construct a Sparse Graph on a Small Board  

E-Print Network (OSTI)

We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such that Maker can occupy a copy of G in the game on H.

Gebauer, Heidi

2010-01-01T23:59:59.000Z

251

Implementing Graph Pattern Queries on a Relational Database  

Science Conference Proceedings (OSTI)

When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.

Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R

2007-12-26T23:59:59.000Z

252

File:(PECC) Special Program on Climate Change SUMMARY (english...  

Open Energy Info (EERE)

Up Search File Edit History Facebook icon Twitter icon File:(PECC) Special Program on Climate Change SUMMARY (english).pdf Jump to: navigation, search File File history File...

253

A transactional flash file system for microcontrollers  

Science Conference Proceedings (OSTI)

We present a transactional file system for flash memory devices. The file system is designed for embedded microcontrollers that use an on-chip or on-board NOR flash device as a persistent file store. The file system provides atomicity to arbitrary sequences ...

Eran Gal; Sivan Toledo

2005-04-01T23:59:59.000Z

254

Visibility graph analysis of solar wind velocity  

E-Print Network (OSTI)

We analyze in situ measurements of solar wind velocity obtained by Advanced Composition Explorer (ACE) spacecraft and Helios spacecraft during the years 1998-2012 and 1975-1983 respectively. The data belong to mainly solar cycle 23 (1996-2008) and solar cycle 21 (1976-1986) respectively. We use Directed Horizontal Visibility graph (DHVg) algorithm and estimate a graph functional, namely, the degree distance (D) as the Kullback-Leibler divergence (KLD) argument to understand time irreversibility of solar wind time series. We estimate this degree distance irreversibility parameter for these time series at different phases of solar activity cycle. Irreversibility parameter is first established for known dynamical data and then applied for solar wind velocity time series. It is observed that irreversibility in solar wind velocity fluctuations show similar behaviour at 0.3 AU (Helios data) and 1 AU (ACE data). Moreover it changes over the different phases of solar activity cycle.

Suyal, Vinita; Singh, Harinder P

2013-01-01T23:59:59.000Z

255

File:Hydrofracking.pdf | Open Energy Information  

Open Energy Info (EERE)

Hydrofracking.pdf Hydrofracking.pdf Jump to: navigation, search File File history File usage File:Hydrofracking.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 704 KB, MIME type: application/pdf, 19 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:47, 9 February 2012 Thumbnail for version as of 15:47, 9 February 2012 1,275 × 1,650, 19 pages (704 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage

256

A Concatenational Graph Evolution Aging Model  

Science Conference Proceedings (OSTI)

Modeling the long-term face aging process is of great importance for face recognition and animation, but there is a lack of sufficient long-term face aging sequences for model learning. To address this problem, we propose a CONcatenational GRaph Evolution ... Keywords: Aging,Face,Active appearance model,Correlation,Computational modeling,Data models,Muscles,ANOVA,Face aging,aging model evaluation,long-term aging,short-term aging

Jinli Suo; Xilin Chen; Shiguang Shan; Wen Gao; Qionghai Dai

2012-11-01T23:59:59.000Z

257

Graph operations that are good for greedoids  

Science Conference Proceedings (OSTI)

S is a local maximum stable set of a graph G, and we write S@?@J(G), if the set S is a maximum stable set of the subgraph induced by S@?N(S), where N(S) is the neighborhood of S. In Levit and Mandrescu (2002) [5] we have proved that @J(G) is a greedoid ... Keywords: Corona, Greedoid, Local maximum stable set, Zykov sum

Vadim E. Levit; Eugen Mandrescu

2010-07-01T23:59:59.000Z

258

On a base exchange game on graphs  

E-Print Network (OSTI)

We consider the following maker-breaker game on a graph G that has a partition of the edge set E into two spanning trees E1 and E2. Initially the edges of E1 are purple and the edges of E2 blue. Maker and breaker move alternately. In a move of the maker a blue edge is coloured purple. The breaker then has to recolour a different edge blue in such a way that the purple and the blue edges are spanning trees again. The goal of the maker is to exchange all colours, i.e. to make E1 blue and E2 purple. We prove that a sufficient but not necessary condition for the breaker to win is that the graph contains an induced K4. Furthermore we characterize the structure of a partition of a wheel into two spanning trees and show that the maker wins on wheels Wn with n ? 4 and provide an example of a graph where, for some partitions, the maker wins, for some others, the breaker wins.

Stephan Dominique Andres; Winfried Hochstttler; Markus Merkel

2010-01-01T23:59:59.000Z

259

Important Filing Information | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Important Filing Information Important Filing Information Important Filing Information Filing Information The Office of Hearings and Appeals (OHA) encourages electronic filing of submissions, by e-mail or by telefax. OHA's e-mail address for filing submissions is OHA.filings@hq.doe.gov; the OHA telefax number is (202) 287-1415. Note, however, that because of signature issues, we may ask you to file a signed original of a document. We will send an acknowledgment (by letter or e-mail) upon our receipt of all principal pleadings. If you choose to file by regular mail, we caution that under governmental security procedures now in place, the U.S. Postal Service randomly selects items of first class mail addressed to OHA for screening at a facility outside of OHA, e.g. for irradiation of potentially hazardous materials.

260

The Prospero File System User's Manual  

E-Print Network (OSTI)

Introduction The Prospero file system is based on the Virtual System Model[1, 2, 3, 4]. It differs from traditional distributed file systems in several ways. In traditional file systems, the mapping of names to files is the same for all users. Prospero supports user centered naming: users construct their own view of the files that are accessible. The mapping from names to files is controlled by this view. Objects may be organized in multiple ways and the same object may may appear in different virtual systems, or even with multiple names in the same virtual system. Prospero provides several mechanisms to support customization. Among them are the union link and the filter. Directories can contain references to files and other directories that are stored on remote nodes. This allows distribution at a much finer level of granularity than is possible in traditional distributed file systems. 2 The Directory Mechanism In Prospero, the global file system consists of

B. Clifford Neuman

1991-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Modeling and Analysis of Time-Varying Graphs  

E-Print Network (OSTI)

We live in a world increasingly dominated by networks -- communications, social, information, biological etc. A central attribute of many of these networks is that they are dynamic, that is, they exhibit structural changes over time. While the practice of dynamic networks has proliferated, we lag behind in the fundamental, mathematical understanding of network dynamism. Existing research on time-varying graphs ranges from preliminary algorithmic studies (e.g., Ferreira's work on evolving graphs) to analysis of specific properties such as flooding time in dynamic random graphs. A popular model for studying dynamic graphs is a sequence of graphs arranged by increasing snapshots of time. In this paper, we study the fundamental property of reachability in a time-varying graph over time and characterize the latency with respect to two metrics, namely store-or-advance latency and cut-through latency. Instead of expected value analysis, we concentrate on characterizing the exact probability distribution of routing l...

Basu, Prithwish; Ramanathan, Ram; Johnson, Matthew P

2010-01-01T23:59:59.000Z

262

Strict inequalities for connective constants of transitive graphs  

E-Print Network (OSTI)

The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the group, and increases strictly when a non-trivial group element is declared to be a generator.

Geoffrey R. Grimmett; Zhongyang Li

2013-01-14T23:59:59.000Z

263

Monthly Energy Review - June 2001  

Gasoline and Diesel Fuel Update (EIA)

June June 28, 2001 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

264

Monthly Energy Review - April 2001  

Gasoline and Diesel Fuel Update (EIA)

April April 30, 2001 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

265

Monthly Energy Review - October 2000  

Gasoline and Diesel Fuel Update (EIA)

October October 25, 2000 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

266

Monthly Energy Review - September 2000  

Gasoline and Diesel Fuel Update (EIA)

September September 26, 2000 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy Info Disk" through the U.S. De- partment of Commerce at 1-800-STAT-USA. Also available are ASCII comma delimited data files at: http://www.eia.doe.gov/pub/energy.overview/ monthly.energy/current.mer. Timing of Release: MER data are normally released in the afternoon of the third-to-last workday of each month and are usually available electronically the following

267

Annual Energy Review - Energy Information Administration  

U.S. Energy Information Administration (EIA)

10.4 Biodiesel Overview, 2001 XLS CSV: INTERACTIVE: 10.5 Estimated Number of Alternative-Fueled Vehicles in Use and Fuel Consumption, 1992 PDF XLS GRAPH:

268

Coloring kk-free intersection graphs of geometric objects in the plane  

Science Conference Proceedings (OSTI)

The intersection graph of a collection C of sets is a graph on the vertex set C, in which C1,C2 ? C are joined by an edge if and only if C1 ? C2 ... Keywords: chromatic number, intersection graph, quasi-planar, string graph, topological graph

Jacob Fox; Jnos Pach

2008-06-01T23:59:59.000Z

269

An extended star graph: a proposal of a new network topology and its fundamental properties  

Science Conference Proceedings (OSTI)

In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families ... Keywords: Cayley graphs, degree four Cayley graphs, diameter, hypercubes, interconnection networks, network topology, routing algorithms, star graphs

Satoru Watanabe; Satoshi Okawa

2006-03-01T23:59:59.000Z

270

Graduated assignment algorithm for finding the common labelling of a set of graphs  

Science Conference Proceedings (OSTI)

In pattern recognition applications, it is useful to represent objects by attributed graphs considering their structural properties. Besides, some graph matching problems need a Common Labelling between vertices of a set of graphs. Computing this Common ... Keywords: graduated assignment, graph common labelling, inconsistent labelling, multiple graph matching, softassign

Albert Sol-Ribalta; Francesc Serratosa

2010-08-01T23:59:59.000Z

271

A Graph Theory Package for Maple - CECM - Simon Fraser University  

E-Print Network (OSTI)

{jfarr,mahdad,skhodada,mmonagan}@cecm.sfu.ca. Abstract. We present a new graph theory package for Maple. The package is presently intended for teaching ...

272

New Benchmark Instances for the Steiner Problem in Graphs  

E-Print Network (OSTI)

Sep 26, 2001 ... New Benchmark Instances for the Steiner Problem in Graphs. Isabel Rosseti ( rosseti ***at*** inf.puc-rio.br) Marcus Poggi de Arago (poggi...

273

GreenArrow - A New Graph Labeling Technique - Available ...  

Search PNNL. PNNL Home; About; Research; Publications; Jobs; News; Contacts; GreenArrow - A New Graph Labeling Technique. Battelle Number(s): ...

274

Joint Spectral Radius and Path-Complete Graph Lyapunov Functions  

E-Print Network (OSTI)

Nov 22, 2011 ... Abstract: We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is...

275

Finding good nearly balanced cuts in power law graphs  

E-Print Network (OSTI)

The green dots in figure 8-A represent cuts that were obtained using Spectral plus Swept Hyperplane .... Fast approximate energy minimization via graph cuts.

276

File:NREL-africa-glo.pdf | Open Energy Information  

Open Energy Info (EERE)

glo.pdf Jump to: navigation, search File File history File usage Africa - Annual Global Horizontal Solar Radiation (PDF) Size of this preview: 776 600 pixels. Full resolution...

277

File:09NVAStateEnvironmentalProcess.pdf | Open Energy Information  

Open Energy Info (EERE)

file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRRSection 9-NV-a - State Environmental...

278

File:NREL-camdirann.pdf | Open Energy Information  

Open Energy Info (EERE)

camdirann.pdf Jump to: navigation, search File File history File usage Central America - Annual Direct Normal Solar Radiation Size of this preview: 776 600 pixels. Full...

279

File:Cammetst 58.pdf | Open Energy Information  

Open Energy Info (EERE)

Cammetst 58.pdf Jump to: navigation, search File File history File usage Meteorology: map of Central America selected meteorological stations and elevation from NREL Size of this...

280

File:Bureauofreclamationfactsheet.pdf | Open Energy Information  

Open Energy Info (EERE)

Bureauofreclamationfactsheet.pdf Bureauofreclamationfactsheet.pdf Jump to: navigation, search File File history File usage Metadata File:Bureauofreclamationfactsheet.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 663 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:54, 10 July 2013 Thumbnail for version as of 15:54, 10 July 2013 1,275 × 1,650, 2 pages (663 KB) Graham7781 (Talk | contribs) 15:54, 10 July 2013 Thumbnail for version as of 15:54, 10 July 2013 1,275 × 1,650, 2 pages (663 KB) Graham7781 (Talk | contribs) You cannot overwrite this file.

Note: This page contains sample records for the topic "xls files graphs" 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

Global Scratch File System at NERSC  

NLE Websites -- All DOE Office Websites (Extended Search)

Scratch Scratch Global Scratch File System Overview The global scratch file system (or "global scratch") can be accessed by multiple NERSC systems. Its default quota is much larger than the Global Home quota, so it can be used to temporarily store large amounts of data. This file system is periodically purged. Platforms Using Global Scratch The global scratch file system is available on all NERSC systems except PDSF. Quotas Default global scratch quotas are 20 TB and 2,000,000 inodes. If you need more than that, fill out the Disk Quota Change Request Form. Purging Yes, files in global scratch file system are subject to purging. Backup No, Files in global scratch file system are not backed up. Environment Variable You can reference your personal scratch directory in global scratch as

282

OHA Product Efficiency Cases Archive File  

Energy.gov (U.S. Department of Energy (DOE))

This is a archive file of our Product Efficiency decisions, Please download this file to your local computer and use the build in adobe search feature. Individual cases are listed in the bookmark...

283

Network File System (NFS) version 4 Protocol  

Science Conference Proceedings (OSTI)

The Network File System (NFS) version 4 is a distributed filesystem protocol which owes heritage to NFS protocol version 2, RFC 1094, and version 3, RFC 1813. Unlike earlier versions, the NFS version 4 protocol supports traditional file access while ...

S. Shepler; B. Callaghan; D. Robinson; R. Thurlow; C. Beame; M. Eisler; D. Noveck

2003-04-01T23:59:59.000Z

284

Metadata Efficiency in Versioning File Systems  

Science Conference Proceedings (OSTI)

Versioning file systems retain earlier versions of modified files, allowing recovery from user mistakes or system corruption. Unfortunately, conventional versioning systems do not efficiently record large numbers of versions. In particular, versioned ...

Craig A. N. Soules; Garth R. Goodson; John D. Strunk; Gregory R. Ganger

2003-03-01T23:59:59.000Z

285

Metadata efficiency in versioning file systems  

Science Conference Proceedings (OSTI)

Versioning file systems retain earlier versions of modified files, allowing recovery from user mistakes or system corruption. Unfortunately, conventional versioning systems do not efficiently record large numbers of versions. In particular, versioned ...

Craig A. N. Soules; Garth R. Goodson; John D. Strunk; Gregory R. Ganger

2003-03-01T23:59:59.000Z

286

OHA Worker Appeal Cases Archive File  

Energy.gov (U.S. Department of Energy (DOE))

This is a archive file of our Worker Appeal decisions, Please download this file to your local computer and use the build in adobe search feature. Individual cases are listed in the bookmark...

287

DOE-2 Input File From WINDOW  

NLE Websites -- All DOE Office Websites (Extended Search)

an EnergyPlus input file from WINDOW 5 Last update: 12232008 01:54 PM Creating an EnergyPlus Input File for One Window In the WINDOW Window Library, which defines a complete...

288

DOE-2 Input File From WINDOW  

NLE Websites -- All DOE Office Websites (Extended Search)

a DOE2 input file from WINDOW 5 Last update: 02012008 01:19 PM Creating a DOE-2 Input File for One Window In the WINDOW Window Library, which defines a complete window including...

289

Enhancing graph production skills via programmed instruction: An experimental analysis of the effect of guided-practice on data-based graph production  

Science Conference Proceedings (OSTI)

A computer-based graphing simulator used tutorial modules to teach 61 undergraduate college students how to create cumulative graphs from sets of data. One group was required to complete the steps of constructing an appropriate graph within a computer-provided ... Keywords: Computer-based instruction, Graphing, Programmed instruction, Simulation

Darrel R. Davis

2011-09-01T23:59:59.000Z

290

Noisy evolution of graph-state entanglement  

Science Conference Proceedings (OSTI)

A general method for the study of the entanglement evolution of graph states under the action of Pauli maps was recently proposed in Cavalcanti et al. [Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds to the entanglement of the entire state as a function only of the state of a (typically) considerably smaller subsystem undergoing an effective noise process related to the original map. This provides a huge decrease in the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in detail and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit exemplary results for several different graphs and particular decoherence processes. The limitations of the method are also discussed.

Aolita, L.; Dhara, C. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); Cavalcanti, D. [Centre for Quantum Technologies, University of Singapore (Singapore); Chaves, R.; Davidovich, L. [Instituto de Fisica, Universidade Federal do Rio de Janeiro, Caixa Postal 68528, 21941-972 Rio de Janeiro, RJ (Brazil); Acin, A. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); ICREA-Institucio Catalana de Recerca i Estudis Avancats, Lluis Companys 23, E-08010 Barcelona (Spain)

2010-09-15T23:59:59.000Z

291

File:600.pdf | Open Energy Information  

Open Energy Info (EERE)

.pdf .pdf Jump to: navigation, search File File history File usage File:600.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 497 KB, MIME type: application/pdf, 7 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:53, 5 October 2012 Thumbnail for version as of 11:53, 5 October 2012 1,275 × 1,650, 7 pages (497 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:600.pdf&oldid=52071

292

File:Methane.pdf | Open Energy Information  

Open Energy Info (EERE)

Methane.pdf Methane.pdf Jump to: navigation, search File File history File usage File:Methane.pdf Size of this preview: 448 × 600 pixels. Go to page 1 2 3 4 5 Go! next page → next page → Full resolution ‎(1,218 × 1,630 pixels, file size: 929 KB, MIME type: application/pdf, 5 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:51, 9 February 2012 Thumbnail for version as of 15:51, 9 February 2012 1,218 × 1,630, 5 pages (929 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: Hydraulic Fracturing Retrieved from "http://en.openei.org/w/index.php?title=File:Methane.pdf&oldid=404017"

293

Rapid file system development using ptrace  

Science Conference Proceedings (OSTI)

Developing kernel-level file systems is a difficult task that requires a significant time investment. For experimental file systems, it is desirable to develop a prototype before investing the time required to develop a kernel-level file system. We have ...

Richard P. Spillane; Charles P. Wright; Gopalan Sivathanu; Erez Zadok

2007-06-01T23:59:59.000Z

294

Rapid file system development using ptrace  

Science Conference Proceedings (OSTI)

Developing kernel-level file systems is a difficult task that requires a significant time investment. For experimental file systems, it is desirable to develop a prototype before investing the time required to develop a kernel-level file system. We have ... Keywords: monitors, rapid prototyping

Richard P. Spillane; Charles P. Wright; Gopalan Sivathanu; Erez Zadok

2007-06-01T23:59:59.000Z

295

Extending ACID semantics to the file system  

Science Conference Proceedings (OSTI)

An organization's data is often its most valuable asset, but today's file systems provide few facilities to ensure its safety. Databases, on the other hand, have long provided transactions. Transactions are useful because they provide atomicity, consistency, ... Keywords: File system transactions, databases, file systems, ptrace monitors, recoverable memory

Charles P. Wright; Richard Spillane; Gopalan Sivathanu; Erez Zadok

2007-06-01T23:59:59.000Z

296

EntityAuthority: Semantically Enriched Graph-Based Authority Propagation  

E-Print Network (OSTI)

embedded in the text of Web pages, and to transform the page-level graph into a generalized data graph- ply be Page, InfoUnit, or richer concept names such as Person, Organization, etc., that can. Thus each node in the EWG corresponds to ei- ther a Web page or an information unit (InfoUnit for short

Pennsylvania, University of

297

On bounding the bandwidth of graphs with symmetry  

E-Print Network (OSTI)

transmission can be formulated as the bandwidth problem for the ... [6], the hypercube graph [23], the grid graph [7], the complete k-level t-ary tree [39], the .... The 'diag' operator maps an n n matrix to the n-vector given by its diagonal, while.

298

Cell-graph modeling of salivary gland morphology  

Science Conference Proceedings (OSTI)

Branching morphogenesis is a developmental process shared by many organs, including the submandibular salivary gland. During morphogenesis, cells within the gland undergo rearrangements to cause changes in the overall tissue morphology. This work presents ... Keywords: branching morphogenesis, cell-graphs, graph-mining, salivary gland

Cemal Cagatay Bilgin; Shayoni Ray; William P. Daley; Banu Baydil; Sharon J. Sequeira; Blent Yener; Melinda Larsen

2010-04-01T23:59:59.000Z

299

On the connectivity of extremal Ramsey graphs Andrew Beveridge  

E-Print Network (OSTI)

and Computer Science Macalester College Saint Paul, MN 55105 Oleg Pikhurko # Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 Received: 1 December 2006, Accepted: 31 October 2007 Abstract An (r, b)­graph is a graph that contains no clique of size r and no independent set

Pikhurko, Oleg

300

Commute-time convolution kernels for graph clustering  

Science Conference Proceedings (OSTI)

Commute time has proved to be a powerful attribute for clustering and characterising graph structure, and which is easily computed from the Laplacian spectrum. Moreover, commute time is robust to deletions of random edges and noisy edge weights. In this ... Keywords: commute times, convolution kernel, graph kernel, laplacian

Normawati A. Rahman; Edwin R. Hancock

2010-08-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Analyzing uncertainty in TG protection graphs with TG/MC  

Science Conference Proceedings (OSTI)

We introduce TG/MC, a Monte Carlo approach for evaluating the impact of uncertainty about vulnerabilities upon forecasts of security for a real-world system modeled by a protection graph. A TG/MC model defines a vulnerability as a potential change to ... Keywords: Monte Carlo, TG, Take-Grant, protection graph, security

James R. Conrad; Jim Alves-Foss; Sauchi Stephen Lee

2010-09-01T23:59:59.000Z

302

Exclusivity structures and graph representatives of local complementation orbits  

E-Print Network (OSTI)

We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\\'asz number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

Adan Cabello; Matthew G. Parker; Giannicola Scarpa; Simone Severini

2012-11-18T23:59:59.000Z

303

Detecting research topics via the correlation between graphs and texts  

Science Conference Proceedings (OSTI)

In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its utility for information navigation, trend analysis, and high-level description ... Keywords: citation graphs, correlation of text and links, graph mining, probabilistic measure, topic detection

Yookyung Jo; Carl Lagoze; C. Lee Giles

2007-08-01T23:59:59.000Z

304

Quantum graphs where back-scattering is prohibited  

E-Print Network (OSTI)

We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.

J. M. Harrison; U. Smilansky; B. Winn

2007-08-06T23:59:59.000Z

305

Quantum graphs: an introduction and a brief survey  

E-Print Network (OSTI)

The purpose of this text is to set up a few basic notions concerning quantum graphs, to indicate some areas addressed in the quantum graph research, and to provide some pointers to the literature. The pointers in many cases are secondary, i.e. they refer to other surveys.

Peter Kuchment

2008-02-23T23:59:59.000Z

306

Embedding of hypercubes into necklace, windmill and snake graphs  

Science Conference Proceedings (OSTI)

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs. Keywords: Congestion, Edge isoperimetric problem, Embedding, Hypercubes, Interconnection networks, Wirelength

Indra Rajasingh; Bharati Rajan; R. Sundara Rajan

2012-06-01T23:59:59.000Z

307

File:PoliticsofFracking.pdf | Open Energy Information  

Open Energy Info (EERE)

PoliticsofFracking.pdf Jump to: navigation, search File File history File usage File:PoliticsofFracking.pdf Size of this preview: 463 599 pixels. Other resolution: 464 600...

308

File:04UTAStateExplorationProcess.pdf | Open Energy Information  

Open Energy Info (EERE)

UTAStateExplorationProcess.pdf Jump to: navigation, search File File history File usage File:04UTAStateExplorationProcess.pdf Size of this preview: 463 599 pixels. Other...

309

On Characterizing Game-Perfect Graphs by Forbidden Induced Subgraphs  

E-Print Network (OSTI)

A graph G is called g-perfect if, for any induced subgraph H of G, the game chromatic number of H equals the clique number of H. A graph G is called g-col-perfect if, for any induced subgraph H of G, the game coloring number of H equals the clique number of H. In this paper we characterize the classes of g-perfect resp. g-col-perfect graphs by a set of forbidden induced subgraphs and explicitly. Moreover, we study similar notions for variants of the game chromatic number, namely B-perfect and [A, B]-perfect graphs, and for several variants of the game coloring number, and characterize the classes of these graphs.

Stephan Dominique Andres

2010-01-01T23:59:59.000Z

310

Horizontal Visibility graphs generated by type-II intermittency  

E-Print Network (OSTI)

In this contribution we study the onset of chaos via type-II intermittency within the framework of Horizontal Visibility graph theory. We construct graphs associated to time series generated by an iterated map close to a Neimark-Sacker bifurcation and study, both numerically and analytically, their main topological properties. We find well defined equivalences between the main statistical properties of intermittent series (scaling of laminar trends and Lyapunov exponent) and those of the resulting graphs, and accordingly construct a graph theoretical description of type-II intermittency. We finally recast this theory into a graph-theoretical renormalization group framework, and show that the fixed point structure of RG flow diagram separates regular, critical and chaotic dynamics.

ngel M. Nez; Jos Patricio Gmez; Lucas Lacasa

2013-10-02T23:59:59.000Z

311

An Experiment on Graph Analysis Methodologies for Scenarios  

Science Conference Proceedings (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

312

Application Filing Requirements for Natural Gas Pipeline Construction...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Application Filing Requirements for Natural Gas Pipeline Construction Projects (Wisconsin) Application Filing Requirements for Natural Gas Pipeline Construction Projects...

313

"Annual Electric Power Industry Report (EIA-861 data file)  

U.S. Energy Information Administration (EIA)

ELECTRICITY DETAILED SURVEY DATA FILES: Electric power sales, revenue, and energy efficiency Form EIA-861 detailed data files ...

314

Monthly Energy Review - March 2001  

Gasoline and Diesel Fuel Update (EIA)

98.00 98.00 per year (price subject to change without advance notice). Periodical postage paid at Washington, DC 20066-9998, and additional mailing offices. POSTMASTER: Send address changes to Monthly Energy Review, Energy Information Administration, EI-30, 1000 Independence Avenue, SW, Washington, DC 20585-0623. Printed with soy ink on recycled paper. Released for Printing: March 27, 2001 Electronic Access The Monthly Energy Review (MER) is available on the Energy Information Administration (EIA) website in a wide variety of formats at: http://www.eia.doe.gov/mer * Tables: ASCII text (TXT) and Portable Document Format (PDF) files. * Table Data Files: Excel (XLS) and Lotus (WK1). * Database Files (unrounded monthly data 1973 forward): Excel (XLS) files. * Graph pages, MER sections, and complete MER: PDF files. Complete MER PDF files are also available on the EIA "Energy

315

R:\\Test Library\\Inventory\\Inventory as of March 21.07.xls TEST LIBRARY INVENTORY AS OF MARCH 21, 2007  

E-Print Network (OSTI)

R:\\Test Library\\Inventory\\Inventory as of March 21.07.xls TEST LIBRARY INVENTORY AS OF MARCH 21 Complete test (box) Shelf #2 1 ASDS Asperger Syndrome Diagnostic Scale 2001 Complete test Drawer #1 1 AOIR Assessment of Interpersonal Relations 1993 Test - restricted Drawer #1 1 ADI-R Autism Diagnostic Interview

Saskatchewan, University of

316

TO: FILE FROM: I SUBJECT:  

Office of Legacy Management (LM)

TO: FILE TO: FILE FROM: I .- SUBJECT: 9EEEW Pos$:&&~ rk/ErvlK& @orzb Current: Lov?r_ &%2J*l&o3?fi; Owner contacted 0 yes &no; if yes, date contacted . TYPE OF OPERATION ----------------- q Research & Development @ Facility Type 0 Production scale testing 0 Pilot Scale & rlanuf acturing 0 Bench Scale Process 0 University 0 Theoretical Studies 0 Research Organizatil 0 Sample SC Analysis 0 Government Sponsarec 0 Other -------------_ q Production 0 Disposal /Storage TYPE CIF CONTRACT ~------_~-~----_ q Prime 0 0 Subcontract& Other information (i.e. 0 Purchase Order + fixed fee, unit prier time 81 material, t+tc:)-- ------------w-----z-. Contract/Purchase Order #-&)A (c& YJ c -7 / -t 4,&>~c-~7~7------ --- -7

317

File:Susquehannariver.pdf | Open Energy Information  

Open Energy Info (EERE)

Susquehannariver.pdf Susquehannariver.pdf Jump to: navigation, search File File history File usage File:Susquehannariver.pdf Size of this preview: 776 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 Go! next page → next page → Full resolution ‎(1,650 × 1,275 pixels, file size: 2.11 MB, MIME type: application/pdf, 24 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:56, 9 February 2012 Thumbnail for version as of 15:56, 9 February 2012 1,650 × 1,275, 24 pages (2.11 MB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file:

318

Instructions to CBECS 1992 Microdata Files  

Gasoline and Diesel Fuel Update (EIA)

2 Public Data 2 Public Data 1992 CBECS Public Use Data The 18 Public Use Data files of the 1992 Commercial Buildings Energy Consumption Survey (CBECS) data are available in ASCII (i.e. CE92F01T.TXT) and dBASE (CE92F01D.DBF) formats. These files contain the 1992 CBECS basic data including building characteristics, energy consumption and expenditures, and temperature data. The files can be accessed below. The data have been compressed into zip files with an extension of zip. After downloading the files, they should be placed in a separate directory and expanded by using a pkunzip program (also available below). Readme.TXT Information on the 1992 CBECS Public Use Data C920105T.ZIP and C920105D.ZIP contain the following files: File 1: CE92F01T.TXT General Building Information

319

SEDS CSV File Documentation: Price and Expenditure  

Gasoline and Diesel Fuel Update (EIA)

Prices and Expenditures Prices and Expenditures The State Energy Data System (SEDS) comma-separated value (CSV) files contain the price and expenditure estimates shown in the tables located on the SEDS website. There are three files that contain estimates for all states and years. Prices contains the price estimates for all states and Expenditures contains the expenditure estimates for all states. The third file, Adjusted Consumption for Expenditure Calculations contains adjusted consumption estimates used in calculating expenditures (see Appendix E below). Zip files are also available for the large data files. In addition, there is a CSV file for each state, named with the two-letter U.S. Postal Code listed in Appendix A, as well as a file for the United States.

320

Quantum query complexity of some graph problems  

E-Print Network (OSTI)

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Theta(n^{3/2}) in the matrix model and in Theta(sqrt{nm}) in the array model, while the complexity of Connectivity is also in Theta(n^{3/2}) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.

Christoph Durr; Mark Heiligman; Peter Hoyer; Mehdi Mhalla

2004-01-15T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Efficient broadcast on random geometric graphs  

Science Conference Proceedings (OSTI)

A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the critical value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).

Bradonjic, Milan [Los Alamos National Laboratory; Elsasser, Robert [UNIV OF PADERBORN; Friedrich, Tobias [INTERNATIONAL COMPUTER SCI.; Sauerwald, Thomas [INTERNATIONAL COMPUTER SCI.

2009-01-01T23:59:59.000Z

322

Splitting and Confirming Large File  

NLE Websites -- All DOE Office Websites (Extended Search)

Splitting and Confirming Large File Splitting and Confirming Large File Name: Bradley C. Status: Student Age: 16 Location: N/A Country: N/A Date: June 2003 Question: I just calculated one billion digits of pi on my PC, how do I confirm them? I cannot access them because the file size is 1.28 GB, my ram is only 512 MB, meaning none of my word processor's will touch it. Is it possible to split the document, somehow? Then how do I confirm the digits? Replies: Checking the correctness of large numbers -- transcendental numbers like 'pi', or a large prime -- is not easy because there are many sources of error that are difficult to detect, or track down. Some, but by no means all are: 1. How "good" (that is convergent) is the algorithm? If, for example the algorithm is some sort of infinite series, there is always a truncation error, because you cannot compute an infinite number of terms in a finite amount of time. The further out you go in the algorithm, the more significant these errors become.

323

A sequential growth dynamics for a directed acyclic dyadic graph  

E-Print Network (OSTI)

A model of discrete spacetime on a microscopic level is considered. It is a directed acyclic dyadic graph. This is the particular case of a causal set. The goal of this model is to describe particles as some repetitive symmetrical self-organized structures of the graph without any reference to continuous spacetime. The dynamics of the model is considered. This dynamics is stochastic sequential additions of new vertexes. Growth of the graph is a Markovian process. This dynamics is a consequence of a causality principle.

Alexey L. Krugly

2011-12-05T23:59:59.000Z

324

Nested cycles in large triangulations and crossing-critical graphs  

E-Print Network (OSTI)

We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this result to show that for each fixed positive integer $k$, there are only finitely many $k$-crossing-critical simple graphs of average degree at least six. Combined with the recent constructions of crossing-critical graphs given by Bokal, this settles the question of for which numbers $q>0$ there is an infinite family of $k$-crossing-critical simple graphs of average degree $q$.

Hernandez-Velez, Cesar; Thomas, Robin

2009-01-01T23:59:59.000Z

325

The Graph Laplacian and the Dynamics of Complex Networks  

SciTech Connect

In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

Thulasidasan, Sunil [Los Alamos National Laboratory

2012-06-11T23:59:59.000Z

326

File  

U.S. Energy Information Administration (EIA) Indexed Site

1,"Alabama","Alabama","Coke Plant","Railroad",71299 1,"Alabama","Alabama","Coke Plant","Railroad",71299 2013,1,"Alabama","Alabama","Coke Plant","Truck",87126 2013,1,"Alabama","Alabama","Electric Power Sector","Railroad",448583 2013,1,"Alabama","Alabama","Electric Power Sector","River",358269 2013,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Railroad",14493 2013,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Truck",267108 2013,1,"Alabama","Colorado","Electric Power Sector","Railroad",203781 2013,1,"Alabama","Illinois","Electric Power Sector","River",129358

327

File  

U.S. Energy Information Administration (EIA) Indexed Site

1,"Alabama","Alabama","Electric Power Sector","Railroad",800913 1,"Alabama","Alabama","Electric Power Sector","Railroad",800913 2012,1,"Alabama","Alabama","Coke Plant","Railroad",8914 2012,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Railroad",35029 2012,1,"Alabama","Alabama","Electric Power Sector","River",519184 2012,1,"Alabama","Alabama","Electric Power Sector","Truck",50499 2012,1,"Alabama","Alabama","Coke Plant","Truck",174999 2012,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Truck",240989 2012,1,"Alabama","Georgia","Industrial Plants Excluding Coke","Truck",419

328

File  

U.S. Energy Information Administration (EIA) Indexed Site

1,"Alabama","Alabama","Coke Plant","Railroad",8914 1,"Alabama","Alabama","Coke Plant","Railroad",8914 2012,1,"Alabama","Alabama","Coke Plant","Truck",174999 2012,1,"Alabama","Alabama","Electric Power Sector","Railroad",800913 2012,1,"Alabama","Alabama","Electric Power Sector","River",519184 2012,1,"Alabama","Alabama","Electric Power Sector","Truck",50499 2012,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Railroad",35029 2012,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Truck",240989 2012,1,"Alabama","Colorado","Electric Power Sector","Railroad",82497

329

File  

U.S. Energy Information Administration (EIA) Indexed Site

2,"Alabama","Alabama","Electric Power Sector","Railroad",495478 2,"Alabama","Alabama","Electric Power Sector","Railroad",495478 2013,2,"Alabama","Alabama","Coke Plant","Railroad",116028 2013,2,"Alabama","Alabama","Industrial Plants Excluding Coke","Railroad",26409 2013,2,"Alabama","Alabama","Electric Power Sector","River",511695 2013,2,"Alabama","Alabama","Industrial Plants Excluding Coke","River",1588 2013,2,"Alabama","Alabama","Electric Power Sector","Truck",58856 2013,2,"Alabama","Alabama","Coke Plant","Truck",94157 2013,2,"Alabama","Alabama","Industrial Plants Excluding Coke","Truck",272760

330

File  

U.S. Energy Information Administration (EIA) Indexed Site

1,"Alabama","Alabama","Electric Power Sector","Railroad",448583 1,"Alabama","Alabama","Electric Power Sector","Railroad",448583 2013,1,"Alabama","Alabama","Coke Plant","Railroad",71299 2013,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Railroad",14493 2013,1,"Alabama","Alabama","Electric Power Sector","River",358269 2013,1,"Alabama","Alabama","Coke Plant","Truck",87126 2013,1,"Alabama","Alabama","Industrial Plants Excluding Coke","Truck",267108 2013,1,"Alabama","Indiana","Coke Plant","Railroad",164223 2013,1,"Alabama","Kentucky","Industrial Plants Excluding Coke","River",6042

331

File  

U.S. Energy Information Administration (EIA) Indexed Site

4,"Alabama","Alabama","Electric Power Sector","Railroad",802677 4,"Alabama","Alabama","Electric Power Sector","Railroad",802677 2012,4,"Alabama","Alabama","Coke Plant","Railroad",17349 2012,4,"Alabama","Alabama","Industrial Plants Excluding Coke","Railroad",22271 2012,4,"Alabama","Alabama","Electric Power Sector","River",384071 2012,4,"Alabama","Alabama","Electric Power Sector","Truck",39426 2012,4,"Alabama","Alabama","Coke Plant","Truck",144411 2012,4,"Alabama","Alabama","Industrial Plants Excluding Coke","Truck",252085 2012,4,"Alabama","Georgia","Electric Power Sector","Truck",6

332

File  

U.S. Energy Information Administration (EIA) Indexed Site

2012,4,"Alabama","Alabama","Coke Plant","Truck",144411 2012,4,"Alabama","Alabama","Electric Power Sector","Railroad",802677 2012,4,"Alabama","Alabama","Electric Power...

333

File  

U.S. Energy Information Administration (EIA) Indexed Site

2013,2,"Alabama","Alabama","Coke Plant","Truck",94157 2013,2,"Alabama","Alabama","Electric Power Sector","Railroad",495478 2013,2,"Alabama","Alabama","Electric Power...

334

MEMORANDUM I TO: FILE DATE  

Office of Legacy Management (LM)

MEMORANDUM MEMORANDUM I TO: FILE DATE -----_-_- FaOM: ~~,~hkcid!,~- ' ALTERNATE CITY: I\ptw)a.yk --~---_--___-~--~---______ STATE: I current: ------------_------_-~~~~~ if yes, date contacted ____ TYPE OF OPERATION -_---_---------__ 0 Research & Development 6 Facility Type 0 Production scale testing 0 Pilat Scale 0 Bench Scale Process 0 Theoretical Studies Sample $ rraductian & Analysis a Manufacturing I 0 University I (1 Research Organization 0 Government Sponao&ed Facility 0 Cither I ----e------y-------- 0 Disposal/Storage TYPE OF CONTRACT --~_----~__~~~-- ' 0 Prime q Subcontract& q Purchase Order cl Other informatian (i.e., cost + fixed fee, unit pri'ce, time & material, qtc) ------- --------------------~------ Contract/Purchase Order #

335

A new framework for elimination-based data flow analysis using DJ graphs  

Science Conference Proceedings (OSTI)

Keywords: DJ graphs, Tarjan's interval, exhaustive and incremental data flow analysis, irreducible flowgraphs, reducible flowgraphs

Vugranam C. Sreedhar; Guang R. Gao; Yong-Fong Lee

1998-03-01T23:59:59.000Z

336

EIA-176 Electronic Filing System (EFS)  

Gasoline and Diesel Fuel Update (EIA)

EIA-176 Electronic Filing System (EFS) EIA-176 Electronic Filing System (EFS) Released: January 17, 2013 Background The Form EIA-176, "Annual Report of Natural and Supplemental Gas Supply and Disposition," is used to collect data on the supply and disposition of natural gas in the United States. These data are collected by the Energy Information Administration (EIA), U.S. Department of Energy (DOE), to fulfill its responsibilities for gathering and reporting energy data. Reporting on the Form EIA-176 is mandatory. Electronic Filing System The Form EIA-176 Electronic Filing System (EFS) provides respondents with an efficient and effective means for filing the form using a personal computer (PC). Respondents have a choice of submitting data via either secure file transfer or email. Hardware / Software Requirements

337

A graph-theoretic model of lexical syntactic acquisition  

Science Conference Proceedings (OSTI)

This paper presents a graph-theoretic model of the acquisition of lexical syntactic representations. The representations the model learns are non-categorical or graded. We propose a new evaluation methodology of syntactic acquisition in the framework ...

Hinrich Schtze; Michael Walsh

2008-10-01T23:59:59.000Z

338

Effective Graph Clustering for Path Queries in Digital Map Databases  

E-Print Network (OSTI)

In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evaluation indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs. 1 Introduction 1....

Yun-Wu Huang; Ning Jing; Elke A. Rundensteiner

1996-01-01T23:59:59.000Z

339

Chip-Firing and Rotor-Routing on Directed Graphs  

E-Print Network (OSTI)

We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing open problems.

Holroyd, Alexander E; Meszaros, Karola; Peres, Yuval; Propp, James; Wilson, David B

2008-01-01T23:59:59.000Z

340

Graph-Theoretic Techniques for Web Content Mining  

Science Conference Proceedings (OSTI)

Describing exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms, this book demonstrates and investigates these novel techniques through the domain of web content mining.

Adam Schenker; Horst Bunke; Mark Last; Abraham Kandel

2005-05-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Geometry of loop quantum gravity on a graph  

SciTech Connect

We discuss the meaning of geometrical constructions associated to loop quantum gravity states on a graph. In particular, we discuss the 'twisted geometries' and derive a simple relation between these and Regge geometries.

Rovelli, Carlo; Speziale, Simone [Centre de Physique Theorique, CNRS-Luminy Case 907, 13288 Marseille Cedex 09 (France)

2010-08-15T23:59:59.000Z

342

Investigation of bond graphs for nuclear reactor simulations  

E-Print Network (OSTI)

This work proposes a simple and effective approach to modeling multiphysics nuclear reactor problems using bond graphs. The conventional method of modeling the coupled multiphysics transients in nuclear reactors is operator ...

Sosnovsky, Eugeny

2010-01-01T23:59:59.000Z

343

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect

Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL; Groer, Christopher S [ORNL

2012-06-01T23:59:59.000Z

344

Modelling structured domains using description graphs and logic programming  

Science Conference Proceedings (OSTI)

Although OWL 2 is widely used to describe complex objects such as chemical molecules, it cannot represent structural' features of chemical entities (e.g., having a ring). A combination of rules and description graphs (DGs) has been proposed ...

Despoina Magka; Boris Motik; Ian Horrocks

2012-05-01T23:59:59.000Z

345

Interactive searching and visualization of patterns in attributed graphs  

Science Conference Proceedings (OSTI)

Searching for patterns in graphs and visualizing the search results is an active area of research with numerous applications. With the continual growth of database size, querying these databases often results in multiple solutions. Text-based systems ...

Pierre-Yves Koenig; Faraz Zaidi; Daniel Archambault

2010-05-01T23:59:59.000Z

346

Temporally Scalable Visual SLAM using a Reduced Pose Graph  

E-Print Network (OSTI)

In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...

Johannsson, Hordur

2012-05-25T23:59:59.000Z

347

Evaluated nuclear-data file for niobium  

SciTech Connect

A comprehensive evaluated nuclear-data file for elemental niobium is provided in the ENDF/B format. This file, extending over the energy range 10/sup -11/-20 MeV, is suitable for comprehensive neutronic calculations, particulary those dealing with fusion-energy systems. It also provides dosimetry information. Attention is given to the internal consistancy of the file, energy balance, and the quantitative specification of uncertainties. Comparisons are made with experimental data and previous evaluated files. The results of integral tests are described and remaining outstanding problem areas are cited. 107 refs.

Smith, A.B.; Smith, D.L.; Howerton, R.J.

1985-03-01T23:59:59.000Z

348

File:Drillinghandbook.pdf | Open Energy Information  

Open Energy Info (EERE)

source History View New Pages Recent Changes All Special Pages Semantic SearchQuerying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook...

349

Surveyor / Gadzooks File Systems | Argonne Leadership Computing...  

NLE Websites -- All DOE Office Websites (Extended Search)

IntrepidChallengerSurveyor Decommissioning of BGP Systems and Resources Introducing Challenger Quick Reference Guide System Overview Data Transfer Data Storage & File Systems...

350

Intrepid / Challenger / Eureka File Systems | Argonne Leadership...  

NLE Websites -- All DOE Office Websites (Extended Search)

IntrepidChallengerSurveyor Decommissioning of BGP Systems and Resources Introducing Challenger Quick Reference Guide System Overview Data Transfer Data Storage & File Systems...

351

1997 RECS Public Use Data Files Page  

U.S. Energy Information Administration (EIA)

Lights, Doors, Windows, and Insulation: Data File (Size - 917 kilobytes) Date Released: 11-22-99: Codebook (Size - 49 kilobytes) Date Released: 11-22-99 ...

352

T-647: PHP File Upload Bug May Let Remote Users Overwrite Files on the  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: PHP File Upload Bug May Let Remote Users Overwrite Files on 7: PHP File Upload Bug May Let Remote Users Overwrite Files on the Target System T-647: PHP File Upload Bug May Let Remote Users Overwrite Files on the Target System June 15, 2011 - 3:45pm Addthis PROBLEM: A vulnerability was reported in PHP. A remote user may be able to overwrite files on the target system. PLATFORM: PHP prior to 5.3.7 ABSTRACT: PHP is prone to a security-bypass vulnerability.Successful exploits will allow an attacker to delete files from the root directory, which may aid in further attacks. PHP 5.3.6 is vulnerable; other versions may also be affected. reference LINKS: PHP Security Notice PHP CVE-2011-2202 SecurityTracker Alert ID: 1025659 Secunia Advisory: SA44874 CVE-2011-2202 IMPACT ASSESSMENT: High Discussion: The vulnerability lies in the 'SAPI_POST_HANDLER_FUNC()' function in

353

On electric resistances for distance-regular graphs  

E-Print Network (OSTI)

We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper. Our main result, Theorem 4, shows(together with Corollary 3) that if distance is measured by the electric resistance between points then all points are close to being equidistant on a distance-regular graph with large valency. A number of auxiliary results are also presented.

Koolen, Jack; Park, Jongyook

2011-01-01T23:59:59.000Z

354

Confusability graphs for symmetric sets of quantum states  

E-Print Network (OSTI)

For a set of quantum states generated by the action of a group, we consider the graph obtained by considering two group elements adjacent whenever the corresponding states are non-orthogonal. We analyze the structure of the connected components of the graph and show two applications to the optimal estimation of an unknown group action and to the search for decoherence free subspaces of quantum channels with symmetry.

Giulio Chiribella; Yuxiang Yang

2013-01-07T23:59:59.000Z

355

Scalable methods for representing, characterizing, and generating large graphs.  

Science Conference Proceedings (OSTI)

Goal - design methods to characterize and identify a low dimensional representation of graphs. Impact - enabling predictive simulation; monitoring dynamics on graphs; and sampling and recovering network structure from limited observations. Areas to explore are: (1) Enabling technologies - develop novel algorithms and tailor existing ones for complex networks; (2) Modeling and generation - Identify the right parameters for graph representation and develop algorithms to compute these parameters and generate graphs from these parameters; and (3) Comparison - Given two graphs how do we tell they are similar? Some conclusions are: (1) A bad metric can make anything look good; (2) A metric that is based an edge-by edge prediction will suffer from the skewed distribution of present and absent edges; (3) The dominant signal is the sparsity, edges only add a noise on top of the signal, the real signal, structure of the graph is often lost behind the dominant signal; and (4) Proposed alternative: comparison based on carefully chosen set of features, it is more efficient, sensitive to selection of features, finding independent set of features is an important area, and keep an eye on us for some important results.

Grace, Matthew D.; Dunlavy, Daniel M. (Sandia National Laboratories, Albuquerque, NM); Ray, Jaideep; Pinar, Ali; Hendrickson, Bruce Alan (Sandia National Laboratories, Albuquerque, NM); Phillips, Cynthia Ann (Sandia National Laboratories, Albuquerque, NM); Kolda, Tamara Gibson

2010-07-01T23:59:59.000Z

356

Organizing and managing personal electronic files: A mechanical engineer's perspective  

Science Conference Proceedings (OSTI)

This article deals with the organization and management of the computer files handled by mechanical engineers on their personal computers. In engineering organizations, a wide variety of electronic files (documents) are necessary to support both business ... Keywords: Engineers, directory and file naming conventions, file sharing and file recognition and recall, information management

B. J. Hicks; A. Dong; R. Palmer; H. C. Mcalpine

2008-09-01T23:59:59.000Z

357

pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs  

Science Conference Proceedings (OSTI)

Detecting sequence homology between protein sequences is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting the homology between two protein sequences is relatively inexpensive, detecting pairwise homology for a large number of protein sequences can become computationally prohibitive for modern inputs, often requiring millions of CPU hours. Yet, there is currently no robust support to parallelize this kernel. In this paper, we identify the key characteristics that make this problemparticularly hard to parallelize, and then propose a new parallel algorithm that is suited for detecting homology on large data sets using distributed memory parallel computers. Our method, called pGraph, is a novel hybrid between the hierarchical multiple-master/worker model and producer-consumer model, and is designed to break the irregularities imposed by alignment computation and work generation. Experimental results show that pGraph achieves linear scaling on a 2,048 processor distributed memory cluster for a wide range of inputs ranging from as small as 20,000 sequences to 2,560,000 sequences. In addition to demonstrating strong scaling, we present an extensive report on the performance of the various system components and related parametric studies.

Wu, Changjun; Kalyanaraman, Anantharaman; Cannon, William R.

2012-09-15T23:59:59.000Z

358

Noncontiguous locking techniques for parallel file systems  

Science Conference Proceedings (OSTI)

Many parallel scientific applications use high-level I/O APIs that offer atomic I/O capabilities. Atomic I/O in current parallel file systems is often slow when multiple processes simultaneously access interleaved, shared files. Current atomic I/O solutions ...

Avery Ching; Wei-keng Liao; Alok Choudhary; Robert Ross; Lee Ward

2007-11-01T23:59:59.000Z

359

File:USFWSList.pdf | Open Energy Information  

Open Energy Info (EERE)

USFWSList.pdf USFWSList.pdf Jump to: navigation, search File File history File usage Metadata File:USFWSList.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 79 KB, MIME type: application/pdf, 5 pages) Summary US Fish and Wildlife Service Species List - Salt Wells Geothermal Drilling Project EA Licensing PD This file has been released into the public domain by the copyright holder, its copyright has expired, or it is ineligible for copyright. This applies worldwide. File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:43, 17 July 2013 Thumbnail for version as of 12:43, 17 July 2013 1,275 × 1,650, 5 pages (79 KB) Agentile (Talk | contribs) US Fish and Wildlife Service Species List - Salt Wells Geothermal Drilling Project EA

360

File:AEOearlyrelease.pdf | Open Energy Information  

Open Energy Info (EERE)

AEOearlyrelease.pdf AEOearlyrelease.pdf Jump to: navigation, search File File history File usage File:AEOearlyrelease.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 254 KB, MIME type: application/pdf, 12 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 13:37, 27 April 2011 Thumbnail for version as of 13:37, 27 April 2011 1,275 × 1,650, 12 pages (254 KB) Graham7781 (Talk | contribs) 15:18, 20 April 2011 Thumbnail for version as of 15:18, 20 April 2011 1,275 × 1,650, 12 pages (254 KB) Graham7781 (Talk | contribs) You cannot overwrite this file.

Note: This page contains sample records for the topic "xls files graphs" 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

LOGJAM: a scalable unified log file archiver  

Science Conference Proceedings (OSTI)

Log files are a necessary record of events on any system. However, as systems scale, so does the volume of data captured. To complicate matters, this data can be distributed across all nodes within the system. This creates challenges in ways to obtain ... Keywords: archiving, log files, system management

Nicholas P. Cardo

2011-11-01T23:59:59.000Z

362

Frugal storage for cloud file systems  

Science Conference Proceedings (OSTI)

Enterprises are moving their IT infrastructure to cloud service providers with the goal of saving costs and simplifying management overhead. One of the critical services for any enterprise is its file system, where users require real-time access to files. ... Keywords: caching, cloud computing, storage, storage cost

Krishna P.N. Puttaswamy; Thyaga Nandagopal; Murali Kodialam

2012-04-01T23:59:59.000Z

363

MEPleRANDUM TO: FILE  

Office of Legacy Management (LM)

MEPleRANDUM MEPleRANDUM ( TO: FILE , , ------ --------iS"I;=~:ta,,,-;onFa;tedl/~~-r*z .-+a~* & 0 no; TYV= OF CP==ATION ---=-------aY----- 0 8:esearch & Develoyent B Facility Type Q Other information

364

BEM~RANDu~~ TO: FILE  

Office of Legacy Management (LM)

BEM~RANDu~~ BEM~RANDu~~ TO: FILE FROM: a. Rq- -__-----_- -_--- SUBJECT: cl;-; nAC; a-.. & ~3 -+.e-&&& SITE NAHE: CITY: M; /L-)-J L ce --_--__---__-~_~~~_-~~~~~~ STATE: WE -----_ OWNER(S) ------_- Past: ------------------------ Current: --_----_--_--------------- Owner ctx-atacted 0 yes 0 no) if ye8, date contacted ---__-------- TYPE OF OPERATION -_-__--_--_--_--_ 0 Research & Development w Facility Type 0 Production scale testing 0 Pilot Scale 0 Manufacturing (3 Bench Scale Process 0 University i Theoretical Studies 0 Research Organization 0 Governments Spans red Facility Sample 84 Analysir W Other --L%%z!k------~~-~ A.- 0 Production & Jrccj- dx& 0 Disposal/Storage 0 Prime 0 Subcontract& 0 Purchase Order cl Other information (i.e., cost

365

MEMORANDU TO: FILE FHOM: SUBJECT:  

Office of Legacy Management (LM)

' .- _. I _ ' ' .- _. I _ ' 1.3 7 -3 , MEMORANDU TO: FILE FHOM: SUBJECT: Curre"t: Ll&k&&d ________ l- ; if yes, date contacted ___ 0 Production scale testing Cl Pilot Scale 0 Bench Scale Process 0 Theoretical Studies 0 Sample & Analysis 0 Production 0 Disposal /Storage TYPE OF CONTRACT --------------_- 0 Prime 13 Subcontract& 0 Purchase Order 0 Cl Facility Type 0 Manufacturing 0 University 0 Research Organization *i Government Sponsored Facility 0 Other --------------_-----_ Other information (i.e., cost + fixed fee, unit price, time & material, qtc) --------------------~~------ OWNERSHIP: AEC/UED AEWUED GOUT GOUT CONTRACTOR CONTRACTOR OWN!3 LEAS!32 @!NE_D LEEsE_n OWNED --_----___ --LEEEI) LANDS D 0 BUILDINGS EQUIPMENT : : cl 0

366

MEtlORANDUM TO: FILE  

Office of Legacy Management (LM)

\ \ MEtlORANDUM / TO: FILE "ATE--$ SUBJECT: ___ NfiME: ALTERNATE w-------- CITY:J!M ------------------ST~~=-i-!-~~- P Pest:-___----_____--______,__ Current: -----_-~~----~~~~~-------- Owner contacted 0 yes q no3 if yes, date contacted TYPE OF OPERATION ----------------- 0 Research & Development q Facility Type 0 Production scale testing 0 Pilot Scale q rlanuf ecturing 0 Bench Scale Process q University 0 Theor&i&l Studies 0 Research Organization 0 Sample & 'Anal*sis 0 Government Sponsored Facility M Other / -LLp&-+ ------- --- 0 Production ==~-++@L _ Cl Disposal/Storage d&&u IY!?~AELE!I~n_CI . - ~. .; 0 Prime 0 Subcontract& 0 Purchase Order 0 Other information (i.e., cost + fixed fee, unit price, time 84 material, etc)

367

Monthly Energy Review - Energy Information Administration  

U.S. Energy Information Administration (EIA)

Carbon Dioxide Emissions From Energy Consumption: 12.1 by Source: PDF XLS CSV GRAPH: 12.2 Residential Sector: PDF XLS CSV GRAPH: 12.3 Commercial Sector:

368

Core File Settings | Argonne Leadership Computing Facility  

NLE Websites -- All DOE Office Websites (Extended Search)

Core File Settings Core File Settings The following environment variables control core file creation and contents. Specify regular (non-script) jobs using the qsub argument --env (Note: two dashes). Specify script jobs (--mode script) using the --envs (Note: two dashes) or --exp_env (Note: two dashes) options of runjob. For additional information about setting environment variables in your job, visit http://www.alcf.anl.gov/user-guides/running-jobs#environment-variables. Generation The following environment variables control conditions of core file generation and naming: BG_COREDUMPONEXIT=1 Creates a core file when the application exits. This is useful when the application performed an exit() operation and the cause and location of the exit() is not known. BG_COREDUMPONERROR=1

369

File:08AKATransmission.pdf | Open Energy Information  

Open Energy Info (EERE)

AKATransmission.pdf AKATransmission.pdf Jump to: navigation, search File File history File usage File:08AKATransmission.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 24 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:01, 11 January 2013 Thumbnail for version as of 15:01, 11 January 2013 1,275 × 1,650 (24 KB) Dfitzger (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 8-AK-a - Transmission Retrieved from "http://en.openei.org/w/index.php?title=File:08AKATransmission.pdf&oldid=57856

370

File:Denver Basin.pdf | Open Energy Information  

Open Energy Info (EERE)

Basin.pdf Basin.pdf Jump to: navigation, search File File history File usage File:Denver Basin.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 625 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:00, 4 March 2013 Thumbnail for version as of 11:00, 4 March 2013 1,275 × 1,650 (625 KB) Alevine (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:Denver_Basin.pdf&oldid=5897

371

File:PublicNoticeApplicabilitytbl.pdf | Open Energy Information  

Open Energy Info (EERE)

PublicNoticeApplicabilitytbl.pdf PublicNoticeApplicabilitytbl.pdf Jump to: navigation, search File File history File usage Metadata File:PublicNoticeApplicabilitytbl.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 50 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:40, 14 June 2013 Thumbnail for version as of 15:40, 14 June 2013 1,275 × 1,650 (50 KB) Apalazzo (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Metadata This file contains additional information, probably added from the digital

372

File:06UTATransportation.pdf | Open Energy Information  

Open Energy Info (EERE)

UTATransportation.pdf UTATransportation.pdf Jump to: navigation, search File File history File usage File:06UTATransportation.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 29 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:16, 30 August 2012 Thumbnail for version as of 12:16, 30 August 2012 1,275 × 1,650 (29 KB) Jnorris (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 6-UT-a - Transportation Retrieved from "http://en.openei.org/w/index.php?title=File:06UTATransportation.pdf&oldid=509115

373

File:TCEQ-20425.pdf | Open Energy Information  

Open Energy Info (EERE)

20425.pdf 20425.pdf Jump to: navigation, search File File history File usage Metadata File:TCEQ-20425.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 19 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 09:13, 10 July 2013 Thumbnail for version as of 09:13, 10 July 2013 1,275 × 1,650 (19 KB) Abergfel (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Metadata This file contains additional information, probably added from the digital

374

File:GWS-31.pdf | Open Energy Information  

Open Energy Info (EERE)

pdf pdf Jump to: navigation, search File File history File usage Metadata File:GWS-31.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 126 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:48, 15 March 2013 Thumbnail for version as of 11:48, 15 March 2013 1,275 × 1,650, 2 pages (126 KB) Alevine (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Metadata This file contains additional information, probably added from the digital

375

File:03IDDIndustrialLease.pdf | Open Energy Information  

Open Energy Info (EERE)

IDDIndustrialLease.pdf IDDIndustrialLease.pdf Jump to: navigation, search File File history File usage File:03IDDIndustrialLease.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 24 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 18:37, 25 October 2012 Thumbnail for version as of 18:37, 25 October 2012 1,275 × 1,650 (24 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Flowcharts Retrieved from "http://en.openei.org/w/index.php?title=File:03IDDIndustrialLease.pdf&oldid=530956"

376

File:TCEQ-10202.pdf | Open Energy Information  

Open Energy Info (EERE)

02.pdf 02.pdf Jump to: navigation, search File File history File usage Metadata File:TCEQ-10202.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 29 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 09:15, 10 July 2013 Thumbnail for version as of 09:15, 10 July 2013 1,275 × 1,650 (29 KB) Abergfel (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Metadata This file contains additional information, probably added from the digital

377

File:ExpeditedReview.pdf | Open Energy Information  

Open Energy Info (EERE)

ExpeditedReview.pdf ExpeditedReview.pdf Jump to: navigation, search File File history File usage File:ExpeditedReview.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 64 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 18:20, 19 November 2012 Thumbnail for version as of 18:20, 19 November 2012 1,275 × 1,650 (64 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:ExpeditedReview.pdf&oldid=538274

378

File:Ger geothermal form 1.pdf | Open Energy Information  

Open Energy Info (EERE)

File File Edit History Facebook icon Twitter icon » File:Ger geothermal form 1.pdf Jump to: navigation, search File File history File usage Metadata File:Ger geothermal form 1.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 67 KB, MIME type: application/pdf, 3 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 10:26, 25 October 2013 Thumbnail for version as of 10:26, 25 October 2013 1,275 × 1,650, 3 pages (67 KB) Abergfel (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information)

379

File:TCEQ-10204.pdf | Open Energy Information  

Open Energy Info (EERE)

TCEQ-10204.pdf TCEQ-10204.pdf Jump to: navigation, search File File history File usage Metadata File:TCEQ-10204.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 79 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:07, 2 July 2013 Thumbnail for version as of 12:07, 2 July 2013 1,275 × 1,650 (79 KB) Abergfel (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Metadata This file contains additional information, probably added from the digital

380

File:03ORCEncroachment.pdf | Open Energy Information  

Open Energy Info (EERE)

ORCEncroachment.pdf ORCEncroachment.pdf Jump to: navigation, search File File history File usage File:03ORCEncroachment.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 11 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:59, 28 September 2012 Thumbnail for version as of 12:59, 28 September 2012 1,275 × 1,650 (11 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Flowcharts Retrieved from "http://en.openei.org/w/index.php?title=File:03ORCEncroachment.pdf&oldid=51882

Note: This page contains sample records for the topic "xls files graphs" 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

File:StandardProcess.pdf | Open Energy Information  

Open Energy Info (EERE)

StandardProcess.pdf StandardProcess.pdf Jump to: navigation, search File File history File usage File:StandardProcess.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 62 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 17:15, 19 November 2012 Thumbnail for version as of 17:15, 19 November 2012 1,275 × 1,650 (62 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from "http://en.openei.org/w/index.php?title=File:StandardProcess.pdf&oldid=538266

382

A dynamic adjustment strategy for file transformation in data grids  

Science Conference Proceedings (OSTI)

In this paper, we propose a dynamic file transfer scheme with coallocation architecture, called Dynamic Adjustment Strategy, a dynamic file transfer scheme with co-allocation architecture that reduce the file transfer times and improves the performance ...

Chao-Tung Yang; Shih-Yu Wang; Chun-Pin Fu

2007-09-01T23:59:59.000Z

383

Anatomy of a young giant component in the random graph  

E-Print Network (OSTI)

We provide a complete description of the giant component of the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ as soon as it emerges from the scaling window, i.e., for $p = (1+\\epsilon)/n$ where $\\epsilon^3 n \\to \\infty$ and $\\epsilon=o(1)$. Our description is particularly simple for $\\epsilon = o(n^{-1/4})$, where the giant component $C_1$ is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for $C_1$). Let $Z$ be normal with mean $\\frac23 \\epsilon^3 n$ and variance $\\epsilon^3 n$, and let $K$ be a random 3-regular graph on $2\\lfloor Z\\rfloor$ vertices. Replace each edge of $K$ by a path, where the path lengths are i.i.d. geometric with mean $1/\\epsilon$. Finally, attach an independent Poisson($1-\\epsilon$)-Galton-Watson tree to each vertex. A similar picture is obtained for larger $\\epsilon=o(1)$, in which case the random 3-regular graph is replaced by a random graph with $N_k$ vertices of degree $k$ for $k\\geq 3$, where $N_k$ has mean...

Ding, Jian; Lubetzky, Eyal; Peres, Yuval

2009-01-01T23:59:59.000Z

384

Department of Energy Files Motion to Withdraw Yucca Mountain...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Files Motion to Withdraw Yucca Mountain License Application Department of Energy Files Motion to Withdraw Yucca Mountain License Application March 3, 2010 - 12:00am Addthis...

385

Application Filing Requirements for Natural Gas Pipeline Construction...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

You are here Home Savings Application Filing Requirements for Natural Gas Pipeline Construction Projects (Wisconsin) Application Filing Requirements for Natural Gas...

386

T-656: Microsoft Office Visio DXF File Handling Arbitrary Code...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: Microsoft Office Visio DXF File Handling Arbitrary Code Execution Vulnerability T-656: Microsoft Office Visio DXF File Handling Arbitrary Code Execution Vulnerability June 28,...

387

PARS II CPP Upload Template File | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

File PARS II CPP Upload Template File DPMIS091110OECMCompleteProjectTemplate.zip More Documents & Publications Microsoft Word - PARS II CPP Upload Requirements.docx...

388

How Do You File A Whistleblower Complaint? | National Nuclear...  

National Nuclear Security Administration (NNSA)

Do You File A Whistleblower Complaint? Home > About Us > Our Operations > Management and Budget > Whistleblower Program > How Do You File A Whistleblower Complaint? How Do You...

389

DOE Releases Filing Instructions for Federal Risk Insurance for...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Filing Instructions for Federal Risk Insurance for New Nuclear Power Plants DOE Releases Filing Instructions for Federal Risk Insurance for New Nuclear Power Plants December 21,...

390

V-117: Symantec Enterprise Vault for File System Archiving Unquoted...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: Symantec Enterprise Vault for File System Archiving Unquoted Search Path Lets Local Users Gain Elevated Privileges V-117: Symantec Enterprise Vault for File System Archiving...

391

File:Mmpa.pdf | Open Energy Information  

Open Energy Info (EERE)

Mmpa.pdf Mmpa.pdf Jump to: navigation, search File File history File usage File:Mmpa.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 581 KB, MIME type: application/pdf, 113 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment

392

File:Handbook.pdf | Open Energy Information  

Open Energy Info (EERE)

Handbook.pdf Handbook.pdf Jump to: navigation, search File File history File usage File:Handbook.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 4.49 MB, MIME type: application/pdf, 93 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:57, 14 November 2012 Thumbnail for version as of 12:57, 14 November 2012 1,275 × 1,650, 93 pages (4.49 MB) Dklein2012 (Talk | contribs)

393

Transportation and Energy Use Data Files  

U.S. Energy Information Administration (EIA) Indexed Site

Data Files Data Files Transportation and Energy Use Data Files Data from the last two Residential Transportation Energy Consumption Surveys are available on-line. These data include fuel consumption and expenditures, vehicle-miles traveled, vehicle characteristics, and household characteristics from national samples of over 3,000 households. To protect respondent confidentiality, these data files do not contain any information which could be used to identify individual households. The lowest level of geographic detail provided is the Census Division (a grouping of 3 to 5 States.) 1994 RTECS Public Use Data 1991 RTECS Public Use Data 1994 RTECS Public Use Data The data from the 1994 RTECS is distributed in dBase and ASCII formats. The data in each set has been compressed using PKZIP. After downloading either the ASCII or dBase set, place the downloaded file in a separate directory and expand it using pkunzip. If you don't have pkunzip.exe, you can download that package here. PKUNZIP.EXE is in PKZ204g.exe. PKUNZIP.EXE is the only file you need, but the developers of the product have asked that the entire package be distributed and not the individual files. You can however find pkunzip.exe on several other Internet sites. If you download PKZ204g.exe to a separate directory, type PKZ204g and press ENTER.

394

File:Consultants.pdf | Open Energy Information  

Open Energy Info (EERE)

Consultants.pdf Consultants.pdf Jump to: navigation, search File File history File usage File:Consultants.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 454 KB, MIME type: application/pdf, 108 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:39, 20 November 2012 Thumbnail for version as of 11:39, 20 November 2012 1,275 × 1,650, 108 pages (454 KB) Dklein2012 (Talk | contribs)

395

File:Primer.pdf | Open Energy Information  

Open Energy Info (EERE)

Primer.pdf Primer.pdf Jump to: navigation, search File File history File usage File:Primer.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 5.11 MB, MIME type: application/pdf, 116 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment

396

File:Windyclassroom.pdf | Open Energy Information  

Open Energy Info (EERE)

source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook icon Twitter icon » File:Windyclassroom.pdf Jump to: navigation, search File File history File usage Metadata File:Windyclassroom.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 21.47 MB, MIME type:

397

File:Marcelluswatermgmt.pdf | Open Energy Information  

Open Energy Info (EERE)

Marcelluswatermgmt.pdf Marcelluswatermgmt.pdf Jump to: navigation, search File File history File usage File:Marcelluswatermgmt.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 1.91 MB, MIME type: application/pdf, 59 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:52, 9 February 2012 Thumbnail for version as of 15:52, 9 February 2012 1,275 × 1,650, 59 pages (1.91 MB) Graham7781 (Talk | contribs)

398

Mining Large Heterogeneous Graphs using Cray s Urika  

SciTech Connect

Pattern discovery and predictive modeling from seemingly related Big Data represented as massive, ad-hoc, heterogeneous networks (e.g., extremely large graphs with complex, possibly unknown structure) is an outstanding problem in many application domains. To address this problem, we are designing graph-mining algorithms capable of discovering relationship-patterns from such data and using those discovered patterns as features for classification and predictive modeling. Specifically, we are: (i) exploring statistical properties, mechanics and generative models of behavior patterns in heterogeneous information networks, (ii) developing novel, automated and scalable graph-pattern discovery algorithms and (iii) applying our relationship-analytics (data science + network science) expertise to domains spanning healthcare to homeland security.

Sukumar, Sreenivas R [ORNL] ORNL; Bond, Nathaniel A [ORNL] ORNL

2013-01-01T23:59:59.000Z

399

Weaving independently generated photons into an arbitrary graph state  

SciTech Connect

The controlled-Z (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

Lin, Qing [College of Information Science and Engineering, Huaqiao University (Xiamen), Xiamen 361021 (China); He, Bing [University of California, Merced, 5200 North Lake Road, Merced, California 95343 (United States); Institute for Quantum Information Science, University of Calgary, Alberta T2N 1N4 (Canada)

2011-12-15T23:59:59.000Z

400

Weaving independently generated photons into an arbitrary graph state  

E-Print Network (OSTI)

The controlled Z (CZ) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multi-partite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade CZ operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon to the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

Qing Lin; Bing He

2010-11-21T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Generalizing GraphPlan by Formulating Planning as a CSP  

E-Print Network (OSTI)

We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can be used to eliminate variables and add new constraints to the encoding. We show that our transformations uncover additional structure in the planning problem, structure that subsumes the structure uncovered by GRAPHPLAN planning graphs. We solve the CSP encoded planning problem by using standard CSP algorithms. Empirical evidence is presented to validate the effectiveness of this approach to solving planning problems, and to show that even a prototype implementation is more effective than standard GRAPHPLAN. Our prototype is even competitive with far more optimized planning graph based implementations. We also demonstrate that this approach can be more easily lifted to more complex types of planning than can planning graphs. In particular, we show that the approach can be easily extended to planning with resources.

Adriana Lopez; Fahiem Bacchus

2003-01-01T23:59:59.000Z

402

File:03UTCStateEncroachmentOverview.pdf | Open Energy Information  

Open Energy Info (EERE)

UTCStateEncroachmentOverview.pdf UTCStateEncroachmentOverview.pdf Jump to: navigation, search File File history File usage File:03UTCStateEncroachmentOverview.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 25 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:13, 30 August 2012 Thumbnail for version as of 11:13, 30 August 2012 1,275 × 1,650 (25 KB) Jnorris (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 3-UT-c - State Encroachment Overview

403

File:Notify98.pdf | Open Energy Information  

Open Energy Info (EERE)

Notify98.pdf Notify98.pdf Jump to: navigation, search File File history File usage File:Notify98.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 95 KB, MIME type: application/pdf, 5 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 17:18, 13 November 2012 Thumbnail for version as of 17:18, 13 November 2012 1,275 × 1,650, 5 pages (95 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

404

File:3-200-71.pdf | Open Energy Information  

Open Energy Info (EERE)

71.pdf 71.pdf Jump to: navigation, search File File history File usage File:3-200-71.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 737 KB, MIME type: application/pdf, 8 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 17:18, 16 October 2012 Thumbnail for version as of 17:18, 16 October 2012 1,275 × 1,650, 8 pages (737 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

405

File:06NVCDrinkingWaterPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

6NVCDrinkingWaterPermit.pdf 6NVCDrinkingWaterPermit.pdf Jump to: navigation, search File File history File usage File:06NVCDrinkingWaterPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 45 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:59, 15 October 2012 Thumbnail for version as of 15:59, 15 October 2012 1,275 × 1,650 (45 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 6-NV-c - Drinking Water Permit Retrieved from

406

File:06ORCDrinkingWaterPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

6ORCDrinkingWaterPermit.pdf 6ORCDrinkingWaterPermit.pdf Jump to: navigation, search File File history File usage File:06ORCDrinkingWaterPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 11 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:09, 28 September 2012 Thumbnail for version as of 12:09, 28 September 2012 1,275 × 1,650 (11 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 6-OR-c - Drinking Water Permit Retrieved from

407

File:AlaskaTitleVApplicationSubmittalInstructions.pdf | Open Energy  

Open Energy Info (EERE)

AlaskaTitleVApplicationSubmittalInstructions.pdf AlaskaTitleVApplicationSubmittalInstructions.pdf Jump to: navigation, search File File history File usage File:AlaskaTitleVApplicationSubmittalInstructions.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 20 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:34, 1 November 2012 Thumbnail for version as of 11:34, 1 November 2012 1,275 × 1,650 (20 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

408

File:01MTALandUseConsiderations.pdf | Open Energy Information  

Open Energy Info (EERE)

MTALandUseConsiderations.pdf MTALandUseConsiderations.pdf Jump to: navigation, search File File history File usage File:01MTALandUseConsiderations.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 10 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:01, 1 October 2012 Thumbnail for version as of 11:01, 1 October 2012 1,275 × 1,650 (10 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 1-MT-a - Land Use Considerations

409

File:03UTBStateEasementProcess.pdf | Open Energy Information  

Open Energy Info (EERE)

UTBStateEasementProcess.pdf UTBStateEasementProcess.pdf Jump to: navigation, search File File history File usage File:03UTBStateEasementProcess.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 27 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:13, 30 August 2012 Thumbnail for version as of 12:13, 30 August 2012 1,275 × 1,650 (27 KB) Jnorris (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 3-UT-b - State Easement Process

410

File:01ORALandUseConsiderations.pdf | Open Energy Information  

Open Energy Info (EERE)

1ORALandUseConsiderations.pdf 1ORALandUseConsiderations.pdf Jump to: navigation, search File File history File usage File:01ORALandUseConsiderations.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 11 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:52, 28 September 2012 Thumbnail for version as of 11:52, 28 September 2012 1,275 × 1,650 (11 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 1-OR-a - Land Use Considerations

411

File:01IDALandUseConsiderations.pdf | Open Energy Information  

Open Energy Info (EERE)

IDALandUseConsiderations.pdf IDALandUseConsiderations.pdf Jump to: navigation, search File File history File usage File:01IDALandUseConsiderations.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 25 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 17:23, 25 October 2012 Thumbnail for version as of 17:23, 25 October 2012 1,275 × 1,650 (25 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 1-ID-a - Land Use Considerations

412

File:Ors 358653 factsheet.pdf | Open Energy Information  

Open Energy Info (EERE)

Ors 358653 factsheet.pdf Ors 358653 factsheet.pdf Jump to: navigation, search File File history File usage File:Ors 358653 factsheet.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 25 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:32, 20 November 2012 Thumbnail for version as of 11:32, 20 November 2012 1,275 × 1,650, 2 pages (25 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

413

File:Utah Trans Siting.pdf | Open Energy Information  

Open Energy Info (EERE)

Trans Siting.pdf Trans Siting.pdf Jump to: navigation, search File File history File usage File:Utah Trans Siting.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 21 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:20, 13 November 2012 Thumbnail for version as of 15:20, 13 November 2012 1,275 × 1,650, 2 pages (21 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

414

File:Hrow-application-checklist.pdf | Open Energy Information  

Open Energy Info (EERE)

Hrow-application-checklist.pdf Hrow-application-checklist.pdf Jump to: navigation, search File File history File usage Metadata File:Hrow-application-checklist.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 106 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 13:44, 13 June 2013 Thumbnail for version as of 13:44, 13 June 2013 1,275 × 1,650, 2 pages (106 KB) Apalazzo (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

415

File:03MTEEncroachmentPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

MTEEncroachmentPermit.pdf MTEEncroachmentPermit.pdf Jump to: navigation, search File File history File usage File:03MTEEncroachmentPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 19 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:06, 1 October 2012 Thumbnail for version as of 12:06, 1 October 2012 1,275 × 1,650 (19 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 3-MT-e - Encroachment Permit

416

File:03NVBStateLandAccess.pdf | Open Energy Information  

Open Energy Info (EERE)

3NVBStateLandAccess.pdf 3NVBStateLandAccess.pdf Jump to: navigation, search File File history File usage File:03NVBStateLandAccess.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 11 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:11, 15 October 2012 Thumbnail for version as of 12:11, 15 October 2012 1,275 × 1,650 (11 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 3-NV-b - State Land Access Retrieved from

417

File:TCEQ-CoreDataForm.pdf | Open Energy Information  

Open Energy Info (EERE)

CoreDataForm.pdf CoreDataForm.pdf Jump to: navigation, search File File history File usage Metadata File:TCEQ-CoreDataForm.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 213 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 10:12, 14 June 2013 Thumbnail for version as of 10:12, 14 June 2013 1,275 × 1,650, 2 pages (213 KB) Apalazzo (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

418

File:App Geothermal PROSPECT.pdf | Open Energy Information  

Open Energy Info (EERE)

App Geothermal PROSPECT.pdf App Geothermal PROSPECT.pdf Jump to: navigation, search File File history File usage File:App Geothermal PROSPECT.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 124 KB, MIME type: application/pdf, 3 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 19:08, 16 November 2012 Thumbnail for version as of 19:08, 16 November 2012 1,275 × 1,650, 3 pages (124 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

419

File:Proof1.pdf | Open Energy Information  

Open Energy Info (EERE)

Proof1.pdf Proof1.pdf Jump to: navigation, search File File history File usage File:Proof1.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 79 KB, MIME type: application/pdf, 4 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:16, 14 November 2012 Thumbnail for version as of 12:16, 14 November 2012 1,275 × 1,650, 4 pages (79 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

420

File:40 CFR 143.pdf | Open Energy Information  

Open Energy Info (EERE)

pdf pdf Jump to: navigation, search File File history File usage File:40 CFR 143.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 166 KB, MIME type: application/pdf, 5 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 18:05, 29 October 2012 Thumbnail for version as of 18:05, 29 October 2012 1,275 × 1,650, 5 pages (166 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

Note: This page contains sample records for the topic "xls files graphs" 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

File:09IDAStateEnvironmentalProcess.pdf | Open Energy Information  

Open Energy Info (EERE)

09IDAStateEnvironmentalProcess.pdf 09IDAStateEnvironmentalProcess.pdf Jump to: navigation, search File File history File usage File:09IDAStateEnvironmentalProcess.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 13 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 14:19, 16 August 2012 Thumbnail for version as of 14:19, 16 August 2012 1,275 × 1,650 (13 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 9-ID-a - State Environmental Process

422

File:Mitigation report.pdf | Open Energy Information  

Open Energy Info (EERE)

report.pdf report.pdf Jump to: navigation, search File File history File usage File:Mitigation report.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 29 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:25, 20 November 2012 Thumbnail for version as of 15:25, 20 November 2012 1,275 × 1,650, 2 pages (29 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

423

File:Application procedures.pdf | Open Energy Information  

Open Energy Info (EERE)

procedures.pdf procedures.pdf Jump to: navigation, search File File history File usage File:Application procedures.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 27 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 14:06, 15 November 2012 Thumbnail for version as of 14:06, 15 November 2012 1,275 × 1,650, 2 pages (27 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

424

File:03CACEncroachmentPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

CACEncroachmentPermit.pdf CACEncroachmentPermit.pdf Jump to: navigation, search File File history File usage File:03CACEncroachmentPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 34 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:45, 19 November 2012 Thumbnail for version as of 12:45, 19 November 2012 1,275 × 1,650 (34 KB) Alevine (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 3-CA-c - Encroachment Permit

425

File:01AKALandUseConsiderations.pdf | Open Energy Information  

Open Energy Info (EERE)

01AKALandUseConsiderations.pdf 01AKALandUseConsiderations.pdf Jump to: navigation, search File File history File usage File:01AKALandUseConsiderations.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 10 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 09:46, 18 October 2012 Thumbnail for version as of 09:46, 18 October 2012 1,275 × 1,650 (10 KB) Jnorris (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 1-AK-a - Land Use Considerations

426

File:03UTFEncroachmentPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

UTFEncroachmentPermit.pdf UTFEncroachmentPermit.pdf Jump to: navigation, search File File history File usage File:03UTFEncroachmentPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 40 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 12:15, 30 August 2012 Thumbnail for version as of 12:15, 30 August 2012 1,275 × 1,650 (40 KB) Jnorris (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 3-UT-f - Encroachment Permit

427

File:(131112) Presentacion LAC LEDs.pdf | Open Energy Information  

Open Energy Info (EERE)

131112) Presentacion LAC LEDs.pdf 131112) Presentacion LAC LEDs.pdf Jump to: navigation, search File File history File usage File:(131112) Presentacion LAC LEDs.pdf Size of this preview: 800 × 600 pixels. Go to page 1 2 3 4 5 6 7 8 9 10 Go! next page → next page → Full resolution ‎(1,500 × 1,125 pixels, file size: 775 KB, MIME type: application/pdf, 10 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 14:15, 12 December 2012 Thumbnail for version as of 14:15, 12 December 2012 1,500 × 1,125, 10 pages (775 KB) Gjones (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file:

428

File:01HIALandUseConsiderations.pdf | Open Energy Information  

Open Energy Info (EERE)

HIALandUseConsiderations.pdf HIALandUseConsiderations.pdf Jump to: navigation, search File File history File usage File:01HIALandUseConsiderations.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 20 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 13:05, 23 October 2012 Thumbnail for version as of 13:05, 23 October 2012 1,275 × 1,650 (20 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 1-HI-a - Land Use Considerations

429

File:04AKBGeophysicalExplorationPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

AKBGeophysicalExplorationPermit.pdf AKBGeophysicalExplorationPermit.pdf Jump to: navigation, search File File history File usage File:04AKBGeophysicalExplorationPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 62 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:38, 6 August 2012 Thumbnail for version as of 11:38, 6 August 2012 1,275 × 1,650 (62 KB) Jnorris (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 2 pages link to this file: GRR/Flowcharts GRR/Section 4-AK-b - Geophysical Exploration Permit

430

File:1200CappFS.pdf | Open Energy Information  

Open Energy Info (EERE)

CappFS.pdf CappFS.pdf Jump to: navigation, search File File history File usage File:1200CappFS.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 173 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 17:00, 19 November 2012 Thumbnail for version as of 17:00, 19 November 2012 1,275 × 1,650, 2 pages (173 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

431

File:FrackingFacts.pdf | Open Energy Information  

Open Energy Info (EERE)

FrackingFacts.pdf FrackingFacts.pdf Jump to: navigation, search File File history File usage File:FrackingFacts.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 582 KB, MIME type: application/pdf, 7 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 16:06, 6 February 2012 Thumbnail for version as of 16:06, 6 February 2012 1,275 × 1,650, 7 pages (582 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file:

432

File:1200Capplicationf.pdf | Open Energy Information  

Open Energy Info (EERE)

1200Capplicationf.pdf 1200Capplicationf.pdf Jump to: navigation, search File File history File usage File:1200Capplicationf.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 233 KB, MIME type: application/pdf, 4 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:32, 19 November 2012 Thumbnail for version as of 15:32, 19 November 2012 1,275 × 1,650, 4 pages (233 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

433

File:08CADCAISOQueueClusterProcess.pdf | Open Energy Information  

Open Energy Info (EERE)

CADCAISOQueueClusterProcess.pdf CADCAISOQueueClusterProcess.pdf Jump to: navigation, search File File history File usage File:08CADCAISOQueueClusterProcess.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 46 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 10:37, 11 January 2013 Thumbnail for version as of 10:37, 11 January 2013 1,275 × 1,650 (46 KB) Alevine (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 8-CA-d - CAISO Queue Cluster Process

434

File:Div20.pdf | Open Energy Information  

Open Energy Info (EERE)

Div20.pdf Div20.pdf Jump to: navigation, search File File history File usage File:Div20.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 4 5 6 7 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 38 KB, MIME type: application/pdf, 7 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 17:45, 19 November 2012 Thumbnail for version as of 17:45, 19 November 2012 1,275 × 1,650, 7 pages (38 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file. Retrieved from

435

File:Stormwater faq.pdf | Open Energy Information  

Open Energy Info (EERE)

Stormwater faq.pdf Stormwater faq.pdf Jump to: navigation, search File File history File usage File:Stormwater faq.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 23 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 10:49, 13 November 2012 Thumbnail for version as of 10:49, 13 November 2012 1,275 × 1,650, 2 pages (23 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

436

File:LulApplicationForm.pdf | Open Energy Information  

Open Energy Info (EERE)

source source History View New Pages Recent Changes All Special Pages Semantic Search/Querying Get Involved Help Apps Datasets Community Login | Sign Up Search File Edit History Facebook icon Twitter icon » File:LulApplicationForm.pdf Jump to: navigation, search File File history File usage File:LulApplicationForm.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 57 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 17:20, 26 November 2012 Thumbnail for version as of 17:20, 26 November 2012 1,275 × 1,650 (57 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup

437

File:Breakout Session Guidance.pdf | Open Energy Information  

Open Energy Info (EERE)

Breakout Session Guidance.pdf Breakout Session Guidance.pdf Jump to: navigation, search File File history File usage File:Breakout Session Guidance.pdf Size of this preview: 800 × 600 pixels. Go to page 1 2 3 4 5 Go! next page → next page → Full resolution ‎(1,500 × 1,125 pixels, file size: 69 KB, MIME type: application/pdf, 5 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 10:01, 10 July 2012 Thumbnail for version as of 10:01, 10 July 2012 1,500 × 1,125, 5 pages (69 KB) Graham7781 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: Energy Data Initiative/Resources

438

File:06IDCDrinkingWaterPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

IDCDrinkingWaterPermit.pdf IDCDrinkingWaterPermit.pdf Jump to: navigation, search File File history File usage File:06IDCDrinkingWaterPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 24 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 08:14, 29 October 2012 Thumbnail for version as of 08:14, 29 October 2012 1,275 × 1,650 (24 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 6-ID-c - Drinking Water Permit Retrieved from

439

File:Leasing Easement Guidelines.pdf | Open Energy Information  

Open Energy Info (EERE)

Leasing Easement Guidelines.pdf Leasing Easement Guidelines.pdf Jump to: navigation, search File File history File usage Metadata File:Leasing Easement Guidelines.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 26 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:01, 20 June 2013 Thumbnail for version as of 11:01, 20 June 2013 1,275 × 1,650, 2 pages (26 KB) Apalazzo (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

440

File:App Geothermal.pdf | Open Energy Information  

Open Energy Info (EERE)

Geothermal.pdf Geothermal.pdf Jump to: navigation, search File File history File usage File:App Geothermal.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 112 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 20:07, 16 November 2012 Thumbnail for version as of 20:07, 16 November 2012 1,275 × 1,650, 2 pages (112 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

Note: This page contains sample records for the topic "xls files graphs" 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

File:06MTCDrinkingWaterPermit.pdf | Open Energy Information  

Open Energy Info (EERE)

MTCDrinkingWaterPermit.pdf MTCDrinkingWaterPermit.pdf Jump to: navigation, search File File history File usage File:06MTCDrinkingWaterPermit.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 11 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 11:11, 1 October 2012 Thumbnail for version as of 11:11, 1 October 2012 1,275 × 1,650 (11 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 6-MT-c - Drinking Water Permit Retrieved from

442

File:ApplicationtoAppropriate.pdf | Open Energy Information  

Open Energy Info (EERE)

ApplicationtoAppropriate.pdf ApplicationtoAppropriate.pdf Jump to: navigation, search File File history File usage File:ApplicationtoAppropriate.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 75 KB, MIME type: application/pdf, 3 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 18:12, 13 November 2012 Thumbnail for version as of 18:12, 13 November 2012 1,275 × 1,650, 3 pages (75 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

443

File:Invitation-English (2).pdf | Open Energy Information  

Open Energy Info (EERE)

Invitation-English (2).pdf Invitation-English (2).pdf Jump to: navigation, search File File history File usage File:Invitation-English (2).pdf Size of this preview: 321 × 598 pixels. Other resolution: 322 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,650 × 3,075 pixels, file size: 785 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 09:46, 26 July 2011 Thumbnail for version as of 09:46, 26 July 2011 1,650 × 3,075, 2 pages (785 KB) STobin (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following 5 pages link to this file:

444

File:ErosivityWaiverForm.pdf | Open Energy Information  

Open Energy Info (EERE)

ErosivityWaiverForm.pdf ErosivityWaiverForm.pdf Jump to: navigation, search File File history File usage File:ErosivityWaiverForm.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 11 KB, MIME type: application/pdf, 2 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 10:48, 13 November 2012 Thumbnail for version as of 10:48, 13 November 2012 1,275 × 1,650, 2 pages (11 KB) Dklein2012 (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

445

File:06AKATransportationOversizeOverweight.pdf | Open Energy Information  

Open Energy Info (EERE)

AKATransportationOversizeOverweight.pdf AKATransportationOversizeOverweight.pdf Jump to: navigation, search File File history File usage File:06AKATransportationOversizeOverweight.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Full resolution ‎(1,275 × 1,650 pixels, file size: 30 KB, MIME type: application/pdf) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 15:44, 6 August 2012 Thumbnail for version as of 15:44, 6 August 2012 1,275 × 1,650 (30 KB) Dfitzger (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage The following page links to this file: GRR/Section 6-AK-a - Transportation

446

File:Permit factsheet.pdf | Open Energy Information  

Open Energy Info (EERE)

Permit factsheet.pdf Permit factsheet.pdf Jump to: navigation, search File File history File usage Metadata File:Permit factsheet.pdf Size of this preview: 463 × 599 pixels. Other resolution: 464 × 600 pixels. Go to page 1 2 3 Go! next page → next page → Full resolution ‎(1,275 × 1,650 pixels, file size: 31 KB, MIME type: application/pdf, 3 pages) File history Click on a date/time to view the file as it appeared at that time. Date/Time Thumbnail Dimensions User Comment current 10:50, 12 June 2013 Thumbnail for version as of 10:50, 12 June 2013 1,275 × 1,650, 3 pages (31 KB) Apalazzo (Talk | contribs) You cannot overwrite this file. Edit this file using an external application (See the setup instructions for more information) File usage There are no pages that link to this file.

447

Transmission Access Charge Informational Filing  

E-Print Network (OSTI)

of any new Participating Transmission Owner (Participating TO) during the proceeding six months or (2) changes to Transmission Revenue Requirements of any of the Participating TOs. 1 Because the Access Charges are determined through a formula rate mechanism, these semi-annual adjustments take place automatically. In the enclosed informational filing, the ISO is providing notice regarding the updated Access Charges that reflect the charges that will be in effect beginning January 1, 2002 in accordance with the formula rate. The adjusted charges are based on the modified Transmission Revenue Requirements, both High Voltage and Low Voltage as a result of: (1) the Offer of Settlement accepted by the Commission in Pacific Gas & Electric Companys (PG&E) Docket No. ER01-66-000, (2) San Diego Gas and Electric Companys supplemental surcharge accepted, subject to refund, in Docket No. ER01-3074-000, and (3) the annual adjustment to the Transmission Revenue Balancing Account (TRBA) of the Participating TOs. 1 Capitalized terms not otherwise defined herein are defined in the Master Definitions

unknown authors

2001-01-01T23:59:59.000Z

448

Applying a Model Transformation Taxonomy to Graph Transformation Technology  

E-Print Network (OSTI)

A taxonomy of model transformations was introduced in [16]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best suited to carry out a particular model transformation activity. In this paper we apply the taxonomy to the technique of graph transformation, and we exemplify it by referring to four representative graph transformation tools. As a byproduct of our analysis, we discuss how well each of the considered tools carry out the activity of model transformation.

Tom Mens; Pieter Van Gorp; Dniel Varr; Gabor Karsai

2005-01-01T23:59:59.000Z

449

Create reports and graphs | ENERGY STAR Buildings & Plants  

NLE Websites -- All DOE Office Websites (Extended Search)

Create reports and graphs Create reports and graphs 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 Learn the benefits Get started Use Portfolio Manager The new ENERGY STAR Portfolio Manager How Portfolio Manager helps you save The benchmarking starter kit Identify your property type Enter data into Portfolio Manager The data quality checker How Portfolio Manager calculates metrics

450

Graph Based Modeling and Implementation with EER/GRAL  

E-Print Network (OSTI)

This paper gives a cohesive approach to modeling and implementation with graphs. This approach uses extended entity relationship (EER) diagrams supplemented with the Z-like constraint language GRAL. Due to the foundation of EER/GRAL on Z a common formal basis exists. EER/GRAL descriptions give conceptual models which can be implemented in a seamless manner by efficient data structures using the GraLab graph library. Descriptions of four medium size EER/GRAL-applications conclude the paper to demonstrate the usefulness of the approach in practice.

J. Ebert; A. Winter; P. Dahm; A. Franzke; R. Sttenbach

1996-01-01T23:59:59.000Z

451

PyDecay/GraphPhys: A Unified Language and Storage System for Particle Decay Process Descriptions  

SciTech Connect

To ease the tasks of Monte Carlo (MC) simulation and event reconstruction (i.e. inferring particle-decay events from experimental data) for long-term BaBar data preservation and analysis, the following software components have been designed: a language ('GraphPhys') for specifying decay processes, common to both simulation and data analysis, allowing arbitrary parameters on particles, decays, and entire processes; an automated visualization tool to show graphically what decays have been specified; and a searchable database storage mechanism for decay specifications. Unlike HepML, a proposed XML standard for HEP metadata, the specification language is designed not for data interchange between computer systems, but rather for direct manipulation by human beings as well as computers. The components are interoperable: the information parsed from files in the specification language can easily be rendered as an image by the visualization package, and conversion between decay representations was implemented. Several proof-of-concept command-line tools were built based on this framework. Applications include building easier and more efficient interfaces to existing analysis tools for current projects (e.g. BaBar/BESII), providing a framework for analyses in future experimental settings (e.g. LHC/SuperB), and outreach programs that involve giving students access to BaBar data and analysis tools to give them a hands-on feel for scientific analysis.

Dunietz, Jesse N.; /MIT /SLAC

2011-06-22T23:59:59.000Z

452

Global Home File System at NERSC  

NLE Websites -- All DOE Office Websites (Extended Search)

Home Home Global Home Filesystem Overview Global home directories (or "global homes") provide a convenient means for a user to have access to source files, input files, configuration files, etc., regardless of the platform the user is logged in to. Wherever possible, you should refer to your home directory using the environment variable $HOME. The absolute path to your home directory (e.g., /u4/elvis/) may change, but the value of $HOME will always be correct. For security reasons, you should never allow "world write" access to your $HOME directory or your $HOME/.ssh directory. NERSC scans for such security weakness, and, if detected, will change the permissions on your directories. Platforms Utilizing Global Home The Global Home file system is available on all NERSC systems except PDSF.

453

Adaptive file transfers for diverse environments  

Science Conference Proceedings (OSTI)

This paper presents dsync, a file transfer system that can dynamically adapt to a wide variety of environments. While many transfer systems work well in their specialized ontext, their performance comes at the cost of generality, and they perform poorly ...

Himabindu Pucha; Michael Kaminsky; David G. Andersen; Michael A. Kozuch

2008-06-01T23:59:59.000Z

454

Instructions to CBECS 1995 Microdata Files  

Gasoline and Diesel Fuel Update (EIA)

5 Files 5 Files WHAT IS CBECS? Please Note: These microdata files, which contain building characteristics, energy consumption and expenditures, and energy end-use estimates replace the 1995 CBECS buildings characteristics files that were at this site. As a result of editing the consumption and expenditures data, some of the original estimates of number of buildings and square footage by energy sources and energy end uses have changed. CBECS is a national sample survey that collects statistical information on the consumption of and expenditures for energy in U.S. commercial buildings along with data on energy-related characteristics of the buildings. CBECS is conducted by the Energy Information Administration of the U.S. Department of Energy. The first CBECS was conducted in 1979 and then

455

Property:File/Author | Open Energy Information  

Open Energy Info (EERE)

Author Author Jump to: navigation, search Property Name File/Author Property Type String Description Individual that created the original file. Note that this will often not be the same as the individual that uploads the file to OpenEI. Pages using the property "File/Author" Showing 25 pages using this property. (previous 25) (next 25) B Banglmetst 221.pdf + Donna Heimiller + BrazilTMYst 238.pdf + Donna Heimiller + C Cammetst 58.pdf + Donna Heimiller + China Chifeng 50m Wind Power.pdf + Donna Heimiller + China Enshi 50m Wind Power.pdf + Donna Heimiller + China Fuzhou 50m Wind Power.pdf + Donna Heimiller + China Guangzhou 50m Wind Power.pdf + Donna Heimiller + China Haikou 50m Wind Power.pdf + Donna Heimiller + China Hangzhou 50m Wind Power.pdf + Donna Heimiller +

456

CDIAC: NLCD92 single file coverage  

NLE Websites -- All DOE Office Websites (Extended Search)

Winzip (http:www.winzip.com) or Stuffit (http:www.stuffit.com) may be used to open .zip files. Due to the size limitation in earlier versions of these softwares, only Winzip...

457

CDIAC: NLCD2001 single file coverage  

NLE Websites -- All DOE Office Websites (Extended Search)

Winzip (http:www.winzip.com) or Stuffit (http:www.stuffit.com) may be used to open .zip files. Due to the size limitation in earlier versions of these softwares, only Winzip...

458

CDIAC: NLCD2001 single file coverage  

NLE Websites -- All DOE Office Websites (Extended Search)

metadata for this dataset corresponds to these regions and zones. The file allregions.zip contains a zipfile for each region shown in the graphic. These zipfiles are composed of...

459

Network assisted file system consistency checking  

E-Print Network (OSTI)

This thesis reports on the design and implementation of Network Assisted NFSCK (or NAN), an extension to NFSCK, a research project about checking file system consistency at NetApp. NFSCK requires disk space to store temporary ...

Zehender, Nicholas (Nicholas G.)

2011-01-01T23:59:59.000Z

460

Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory  

Science Conference Proceedings (OSTI)

Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted ...

Roger Pearce; Maya Gokhale; Nancy M. Amato

2010-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Graph of words embedding for molecular structure-activity relationship analysis  

Science Conference Proceedings (OSTI)

Structure-Activity relationship analysis aims at discovering chemical activity of molecular compounds based on their structure. In this article we make use of a particular graph representation of molecules and propose a new graph embedding procedure ...

Jaume Gibert; Ernest Valveny; Horst Bunke

2010-11-01T23:59:59.000Z

462

PTAS for maximum weight independent set problem with random weights in bounded degree graphs  

E-Print Network (OSTI)

Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polynomial time approximation algorithm exists ...

Gamarnik, David

463

File:Cwa-401-handbook-2010-interim.pdf | Open Energy Information  

Open Energy Info (EERE)

Login | Sign Up Search File Edit History Facebook icon Twitter icon File:Cwa-401-handbook-2010-interim.pdf Jump to: navigation, search File File history File usage Metadata...

464

Category:Map Files | Open Energy Information  

Open Energy Info (EERE)

image files, and where available, links to KMZ image files, and where available, links to KMZ sources used to generate the image files. Add.png Add a new Map File Subcategories This category has the following 4 subcategories, out of 4 total. M [×] Map Image Files‎ [×] Map PDF Files‎ N [×] NREL Map Files‎ 1 pages S [×] SWERA Map Files‎ Media in category "Map Files" The following 200 files are in this category, out of 1,687 total. (previous 200) (next 200) Australia-Solar-Map.png Australia-Solar-Map.png 55 KB Banglmetst 221.pdf Banglmetst 221.pdf 5.42 MB Black.Warrior.Basin usgs.map.pdf Black.Warrior.Basin us... 148 KB BOEMRE atlantic.OCS.multiple.use.map.2003.pdf BOEMRE atlantic.OCS.mu... 3.06 MB BOEMRE lease.platforms.santa.barb.map.5.2010.pdf BOEMRE lease.platforms... 1.41 MB BOEMRE OCS.oil.gas.2007-12.map.pdf

465

Bypass aware instruction scheduling for register file power reduction  

Science Conference Proceedings (OSTI)

Since register files suffer from some of the highest power densities within processors, designers have investigated several architectural strategies for register file power reduction, including "On Demand RF Read" where the register file is read only ... Keywords: architecture-sensitive compiler, bypass-sensitive, forwarding paths, operation table, power consumption, processor bypasses, register file, reservation table

Sanghyun Park; Aviral Shrivastava; Nikil Dutt; Alex Nicolau; Yunheung Paek; Eugene Earlie

2006-07-01T23:59:59.000Z

466

Steganographic information hiding that exploits a novel file system vulnerability  

Science Conference Proceedings (OSTI)

In this paper, we present DupeFile, a simple yet critical security vulnerability in numerous file systems. By exploiting DupeFile, adversary can store two or more files with the same name/path, with different contents, inside the same volume. ...

Avinash Srinivasan; Satish Kolli; Jie Wu

2013-08-01T23:59:59.000Z

467

Graph-based reference table construction to facilitate entity matching  

Science Conference Proceedings (OSTI)

Entity matching plays a crucial role in information integration among heterogeneous data sources, and numerous solutions have been developed. Entity resolution based on reference table has the benefits of high efficiency and being easy to update. In ... Keywords: Entity matching, Graph clustering, Reference table

Fangda Wang, Hongzhi Wang, Jianzhong Li, Hong Gao

2013-06-01T23:59:59.000Z

468

Tree/Graph Visualization CMSC 436/636  

E-Print Network (OSTI)

grid, transportation routes, trade, immigration ­ Connections: relationships, causality, citations, disease transmission vectors, #12;Hierarchical and Relational Data · Conceptually a graph · Key challenges · Distortion mapping Clustering · Group nodes into clusters · Use clusters for layout · Display appropriate

Rheingans, Penny

469

MML Inference of Decision Graphs with Multi-way Joins  

Science Conference Proceedings (OSTI)

A decision tree is a comprehensible representation that has been widely used in many machine learning domains. But in the area of supervised learning, decision trees have their limitations. Two notable problems are those of replication and fragmentation. ... Keywords: MDL, MML, decision graphs, decision trees, machine learning, minimum message length, probabilistic prediction, supervised learning

Peter J. Tan; David L. Dowe

2002-12-01T23:59:59.000Z

470

Nodal domains on graphs - How to count them and why?  

E-Print Network (OSTI)

The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.

Ram Band; Idan Oren; Uzy Smilansky

2007-11-21T23:59:59.000Z

471

Nodal domains on graphs - How to count them and why?  

E-Print Network (OSTI)

The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.

Band, Ram; Smilansky, Uzy

2007-01-01T23:59:59.000Z

472

An unified transition detection based on bipartite graph matching approach  

Science Conference Proceedings (OSTI)

This paper addresses transition detection which consists in identifying the boundary between consecutive shots. In this work, we propose an approach to cope with transition detection in which we define and use a new dissimilarity measure based on the ... Keywords: bipartite graph matching, cut, gradual transition

Zenilton Kleber Gonalves Do Patrocnio, Jr.; Silvio Jamil F. Guimares; Henrique Batista Da Silva; Kleber Jacques Ferreira De Souza

2010-11-01T23:59:59.000Z

473

Object oriented parallelisation of graph algorithms using parallel iterator  

Science Conference Proceedings (OSTI)

Multi-core machines are becoming widely used which, as a consequence, forces parallel computing to move from research labs to being adopted everywhere. Due to the fact that developing parallel code is a significantly complex process, the main focus of ... Keywords: graph algorithms, object oriented parallelisation, parallel computing, parallel iterator

Lama Akeila; Oliver Sinnen; Wafaa Humadi

2010-01-01T23:59:59.000Z

474

Simulation of an Electrical Substation Using the Bond Graph Technique  

Science Conference Proceedings (OSTI)

Simulation and especially computer simulation, is a basic tool since it enables engineers to understand how systems work without actually needing to see them. They can learn how they work in different circumstances and optimize their design with considerably ... Keywords: simulation, electrical substations, elements, electricity, bond graph

Gregorio Romero; Jesus Felez; Joaquin Maroto; Jose Manuel Mera

2008-04-01T23:59:59.000Z

475

Global Maker-Breaker games on sparse graphs  

E-Print Network (OSTI)

In this paper we consider Maker-Breaker games, played on the edges of sparse graphs. For a given graph property P we seek a graph (board of the game) with the smallest number of edges on which Maker can build a subgraph that satisfies P. In this paper we focus on global properties. We prove the following results: 1) for the positive minimum degree game, there is a winning board with n vertices and about 10n/7 edges, on the other hand, at least 11n/8 edges are required; 2) for the spanning k-connectivity game, there is a winning board with n vertices and (1+ok(1))kn edges; 3) for the Hamiltonicity game, there is a winning board of constant average degree; 4) for a tree T on n vertices of bounded maximum degree ?, there is a graph G on n vertices and at most f(?) n edges, on which Maker can construct a copy of T. We also discuss biased versions on these games and argue that the picture changes quite drastically there. 1

Dan Hefetz; Michael Krivelevich; Tibor Szab

2009-01-01T23:59:59.000Z

476

A Winning Strategy for the Ramsey Graph Game  

E-Print Network (OSTI)

We consider a "Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games. Keywords: Combinatorial Games, Algorithms on Graphs, Ramsey Theory 1 Introduction The Ramsey Graph Game, RG(n), on a complete graph on N vertices, KN , is considered. Two players, Maker (red) and Breaker (blue) alternately color the edges of KN . Maker is first to play, and the players color one edge per move. Maker wins the game if there is a red Kn . Breaker wins if there is no red Kn after all the N (N 0 1)=2 edges have been colored. Let R(n; n) denote the n-th Ramsey number, i.e., the smallest number R such that for every two-coloring of the edges of KR there exsist a monochromatic Kn ae KR . Maker has a simple winning strategy if N 2R(n; n). Note ...

Aleksandar Pekec

1995-01-01T23:59:59.000Z

477

Weighted graph comparison techniques for brain connectivity analysis  

Science Conference Proceedings (OSTI)

The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools. Based on an in-depth literature review and interviews with neuroscientists, we explore ... Keywords: brain connectivity analysis, brain connectivity visualization, graph comparison

Basak Alper; Benjamin Bach; Nathalie Henry Riche; Tobias Isenberg; Jean-Daniel Fekete

2013-04-01T23:59:59.000Z

478

Degenerate flag varieties: moment graphs and Schrder numbers  

Science Conference Proceedings (OSTI)

We study geometric and combinatorial properties of the degenerate flag varieties of type A. These varieties are acted upon by the automorphism group of a certain representation of a type A quiver, containing a maximal torus T. Using the group ... Keywords: Flag varieties, Moment graphs, Quiver Grassmannians, Schrder numbers

Giovanni Cerulli Irelli; Evgeny Feigin; Markus Reineke

2013-08-01T23:59:59.000Z

479

Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs  

E-Print Network (OSTI)

We use a randomised embedding method to prove that for all \\alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \\delta^+(G),\\delta^-(G)\\geq (3/8+\\alpha)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H\\"aggkvist and Thomason.

Kelly, Luke

2009-01-01T23:59:59.000Z

480

More on graph theoretic software watermarks: Implementation, analysis, and attacks  

Science Conference Proceedings (OSTI)

This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, ... Keywords: Software piracy protection, Software protection, Software watermarking, Surreptitious software

Christian Collberg; Andrew Huntwork; Edward Carter; Gregg Townsend; Michael Stepp

2009-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "xls files graphs" 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

Top-K nearest keyword search on large graphs  

Science Conference Proceedings (OSTI)

It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of top-k nearest keyword (k-NK) search. In a network G modeled as an undirected graph, each node is ...

Miao Qiao, Lu Qin, Hong Cheng, Jeffrey Xu Yu, Wentao Tian

2013-08-01T23:59:59.000Z

482

Component supervision by sensor placement on bond-graph model  

Science Conference Proceedings (OSTI)

The component supervision procedure consists of the comparison of the actual behaviour with the reference behaviour which describes the normal mode. The analytical redundancy has to find relations between known variables of the system. These relations ... Keywords: bond graphs, causal paths, modelling, sensors placement, supervision

M. Khemliche; B. Ould Bouamama; A. Khellaf; M. Mostefa

2005-03-01T23:59:59.000Z

483

STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT  

Science Conference Proceedings (OSTI)

Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective analytical method is to characterize the composition of a specimen based on user-defined patterns of texture and contrast formation. However, such a simple requirement demands an improved model for stability and robustness. Here, an interactive computational model is introduced for learning patterns of interest by example. The learned patterns bound an active contour model in which the traditional gradient descent optimization is replaced by the more efficient optimization of the graph cut methods. First, the energy function is defined according to the curve evolution. Next, a graph is constructed with weighted edges on the energy function and is optimized with the graph cut algorithm. As a result, the method combines the advantages of the level set method and graph cut algorithm, i.e.,"topological" invariance and computational efficiency. The technique is extended to the multi-phase segmentation problem; the method is validated on synthetic images and then applied to specimens imaged by transmission electron microscopy(TEM).

Chang, Hang; Auer, Manfred; Parvin, Bahram

2009-05-08T23:59:59.000Z

484

Efficient simulation of hybrid systems: A hybrid bond graph approach  

Science Conference Proceedings (OSTI)

Accurate and efficient simulations facilitate cost-effective design and analysis of large, complex, embedded systems, whose behaviors are typically hybrid, i.e. continuous behaviors interspersed with discrete mode changes. In this paper we present an ... Keywords: component-oriented modeling, dynamic causal assignment, hybrid bond graphs, modeling and simulation environments, simulation of hybrid systems

Indranil Roychoudhury; Matthew J Daigle; Gautam Biswas; Xenofon Koutsoukos

2011-06-01T23:59:59.000Z

485

Using graph-based program characterization for predictive modeling  

Science Conference Proceedings (OSTI)

Using machine learning has proven effective at choosing the right set of optimizations for a particular program. For machine learning techniques to be most effective, compiler writers have to develop expressive means of characterizing the program being ... Keywords: compiler optimization, graph-based program characterization, iterative compilation, machine learning, support vector machine

Eunjung Park; John Cavazos; Marco A. Alvarez

2012-03-01T23:59:59.000Z

486

Teaching graph algorithms to children of all ages  

Science Conference Proceedings (OSTI)

We report on our experiences in teaching graph theory and algorithms to school children, aged 5 to 17. Our objectives were to demonstrate that children can discover quite complex mathematical concepts, and are able to work with abstractions and use computation ... Keywords: abstraction, computational thinking, k-12 education, modelling, problem based learning

J. Paul Gibson

2012-07-01T23:59:59.000Z

487

On-Line Construction of Compact Directed Acyclic Word Graphs  

Science Conference Proceedings (OSTI)

A Compact Directed Acyclic Word Graph (CDAWG) is a space-efficient text indexing structure, that can be used in several different string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on-line algorithm ...

Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi

2001-07-01T23:59:59.000Z

488

Note: A note on power domination in grid graphs  

Science Conference Proceedings (OSTI)

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: Grid, Power domination

Michael Dorfling; Michael A. Henning

2006-04-01T23:59:59.000Z

489

A note on power domination in grid graphs  

Science Conference Proceedings (OSTI)

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: grid, power domination

Michael Dorfling; Michael A. Henning

2006-04-01T23:59:59.000Z

490

Graphical and incremental type inference: a graph transformation approach  

Science Conference Proceedings (OSTI)

We present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve ... Keywords: graphical language, process networks, type inference, type visualization

Silvia Clerici; Cristina Zoltan; Guillermo Prestigiacomo

2010-05-01T23:59:59.000Z

491

An extension of secure group communication using key graph  

Science Conference Proceedings (OSTI)

With the continuously emerging of Internet applications based on secure group communication, the design of secure group communication becomes an important Internet design topic. Group key management is important for secure group communication. Previous ... Keywords: Batch rekey, Group security, Key graph, Rekey

Zhang Jun; Zhou Yu; Ma Fanyuan; Gu Dawu; Bai Yingcai

2006-10-01T23:59:59.000Z

492

Exponential random graph modeling of communication networks to understand organizational crisis  

Science Conference Proceedings (OSTI)

In recent social network studies, exponential random graph models have been used comprehensively to model global social network structure as a function of their local features. In this study, we describe the exponential random graph models and demonstrate ... Keywords: email communications, exponential random graph models, organizational disintegration, p* models, social networks, statistical models for social networks

Jafar Hamra; Shahadat Uddin; Liaquat Hossain

2011-05-01T23:59:59.000Z

493

Green-Marl: a DSL for easy and efficient graph analysis  

Science Conference Proceedings (OSTI)

The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language ... Keywords: domain-specific language, graph, parallel programming

Sungpack Hong; Hassan Chafi; Edic Sedlar; Kunle Olukotun

2012-04-01T23:59:59.000Z

494

A multiobjective evolutionary programming framework for graph-based data mining  

Science Conference Proceedings (OSTI)

Subgraph mining is the process of identifying concepts describing interesting and repetitive subgraphs within graph-based data. The exponential number of possible subgraphs makes the problem very challenging. Existing methods apply a single-objective ... Keywords: Evolutionary multiobjective optimization, Frequent subgraph mining, Graph-based data mining, Multiobjective evolutionary programming, Multiobjective graph-based data mining, Pareto optimality

Prakash Shelokar, Arnaud Quirin, Scar CordN

2013-07-01T23:59:59.000Z

495

On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs  

Science Conference Proceedings (OSTI)

The maximal clique enumeration (MCE) problem can be used to find very tightly-coupled collections of objects inside a network or graph of relationships. However, when such networks are based on noisy or uncertain data, the solutions to the MCE problem ... Keywords: biological applications, graph algorithms, graph perturbation theory, maximal clique enumeration

William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova

2009-06-01T23:59:59.000Z

496

An event-based framework for characterizing the evolutionary behavior of interaction graphs  

Science Conference Proceedings (OSTI)

Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and mining these graphs. However, almost all of them have studied these graphs ... Keywords: Dynamic interaction networks, diffusion of innovations, evolutionary analysis

Sitaram Asur; Srinivasan Parthasarathy; Duygu Ucar

2009-11-01T23:59:59.000Z

497

Semi-automated derivation of conceptual neighborhood graphs of topological relations  

Science Conference Proceedings (OSTI)

Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph of topological relations, which shows all pairs of relations between ... Keywords: 9+-intersection, conceptual neighborhood graphs, conceptual neighbors, smooth transformation, topological relations

Yohei Kurata

2009-09-01T23:59:59.000Z

498

Cleaning random d-regular graphs with brushes using a degree-greedy algorithm  

Science Conference Proceedings (OSTI)

In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a differential equations method to find the (asymptotic) ... Keywords: cleaning process, degree--greedy algorithm, differential equations method, random d-regular graphs

Margaret-Ellen Messinger; Pawe? Pra?at; Richard J. Nowakowski; Nicholas Wormald

2007-08-01T23:59:59.000Z

499

Distributed computation of the knn graph for large high-dimensional point sets  

Science Conference Proceedings (OSTI)

High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) graphs. The knn graph of a data set is obtained by connecting each point ... Keywords: Approximate nearest neighbors, Distributed and parallel algorithms, Metric spaces, Nearest neighbors, Range queries, Robotics, knn graphs

Erion Plaku; Lydia E. Kavraki

2007-03-01T23:59:59.000Z

500

Shape prior model for media-adventitia border segmentation in IVUS using graph cut  

Science Conference Proceedings (OSTI)

We present a shape prior based graph cut method which does not require user initialisation. The shape prior is generalised from multiple training shapes, rather than using singular templates as priors. Weighted directed graph construction is used to ... Keywords: IVUS, graph cut, image segmentation, shape prior

Ehab Essa; Xianghua Xie; Igor Sazonov; Perumal Nithiarasu; Dave Smith

2012-10-01T23:59:59.000Z