National Library of Energy BETA

Sample records for management service graph

  1. Generating Reports & Graphs in Portfolio Manager | Department...

    Energy Savers [EERE]

    Generating Reports & Graphs in Portfolio Manager Generating Reports & Graphs in Portfolio Manager This presentation, given through the DOE's Technical Assitance Program (TAP),...

  2. University Services Management Services

    E-Print Network [OSTI]

    into a consolidated data-center and server support team that lowered support costs and reduced or eliminated is that the University be known as much for its service and business innovation as for its high quality research innovative services to assist the units we serve to achieve their goals in a manner consistent with the world

  3. Facilities Management Services Policy

    E-Print Network [OSTI]

    , central heating and chilled water plants, buildings HVAC, plumbing and electrical and emergency back/exterior finishes (e.g., signage, paint, floor coverings) x Distribution and Mail Services x Fleet Management x

  4. Service management solutions White paper

    E-Print Network [OSTI]

    an end-to-end service perspective. · Service management platform is built on IBM Tivoli Change to help align operations with business context and enable customers to manage change. Tivoli CCMDBService management solutions White paper Netcool + Tivoli: delivering service management innovation

  5. Research Data Management: Tools & Services

    E-Print Network [OSTI]

    Tsang, Daniel C

    2013-01-01

    Research Data Management Tools & Services Daniel C.Data Librarian, UCI Libraries Research Data Management Manyand provide stewardship for research data generated by

  6. GE Energy Management Ancillary Services

    E-Print Network [OSTI]

    GE Energy Management Ancillary Services Definitions and Capability Study Part 2, Tasks 3-4, Final Online Wind Plants & Frequency Responsive Load Reserves

  7. GE Energy Management Ancillary Services

    E-Print Network [OSTI]

    GE Energy Management Ancillary Services Definitions and Capability Study Part 1, Tasks 1-2, FinalRose Michael O'Connor Sundar Venkataraman Revision 1 Date: 12/19/2012 #12;Ancillary Services Definitions.................................................................................................................... 7 3.1 Task 1: Identify and define ancillary services needed for integration of new generation

  8. Update on Service Management project

    ScienceCinema (OSTI)

    None

    2011-04-25

    GS and IT Service Management project status meeting -------------------------------------------------------------------------- Distribution: Sigurd Lettow, Frederic Hemmer, Thomas Pettersson, David Foster, Matti Tiirakari, GS⁢ Service Providers When and where: Thursday 2nd September at 10:00-11:30 in IFiltration Plant (222-R-001) Dear All, We would like to inform you about progress made on different topics like the Service Catalogue, the new Service Management Tool and the Service Desk. We would also like to present the plan for when we hope to "go live" and what this will mean for all of you running and providing services today. We will need your active support and help in the coming months to make this happen. GS⁢ Service Management Teams Reinoud Martens, Mats Moller

  9. INTEGRATING PROJECT MANAGEMENT APPLICATIONS AS WEB SERVICES

    E-Print Network [OSTI]

    Stanford University

    INTEGRATING PROJECT MANAGEMENT APPLICATIONS AS WEB SERVICES Jinxing Cheng1 , Kincho H. Law2 of distributed software applications as Web services. Specifically, information modeling for project management applications as Web services. Specifically, information modeling for project management applications

  10. EWEB- Energy Management Services Rebate

    Broader source: Energy.gov [DOE]

    The Eugene Water & Electric Board (EWEB) offers cash incentives and low interest loans to businesses as part of the Energy Management Services program for the installation of solar domestic,...

  11. Nutrient Management TrainingNutrient Management Training for Technical Service Providersfor Technical Service Providers

    E-Print Network [OSTI]

    Nutrient Management TrainingNutrient Management Training for Technical Service Providersfor Management Planning Technical Guidance.Management Planning Technical Guidance. Manure and Wastewater Handling Nutrient ManagementNutrient Management ­­ Record KeepingRecord Keeping ­­ Feed ManagementFeed Management

  12. Management of Support Services Activities

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    1991-05-17

    To provide the policy, procedures, and responsibilities for the management of support services contracts with the Department of Energy (DOE). Cancels DOE O 4200.3B dated 10-3-85. Chg 1 dated 3-26-92. Canceled by DOE O 4200.3D dated 8-31-92.

  13. Case Management - HPMC Occupational Health Services

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

    Influenza Immunization Program Medical Exam Scheduling Medical Exams Return to Work Case Management Risk Communication Walk-In Medical Services Worksite Visits Case Management...

  14. Repository Services for Research Data Management 

    E-Print Network [OSTI]

    Uribe, Luis Martinez

    2008-07-31

    Repository Services for Research Data Management - findings from interviews and workshop to capture Oxford researchers' requirements for services to help them manage their data...Presentation given at the Edinburgh Repository Fringe 2008 conference...

  15. An Enhanced Graph-Oriented Approach for Change Management in Distributed Biomedical Ontologies and Linked Data

    E-Print Network [OSTI]

    Haarslev, Volker

    An Enhanced Graph-Oriented Approach for Change Management in Distributed Biomedical Ontologies of the most challenging issues in ontology change management is keeping ontologies consistent when changes occur. Generally most of the existing change management approaches have been faced with the following

  16. Risk Management Department of Human Resource Services

    E-Print Network [OSTI]

    de Lijser, Peter

    Risk Management Department of Human Resource Services Workers' Compensation Update INJURY to identify and address potential safety hazards. It also assists Risk Management staff determine in a timely manager or supervisor will contact Risk Management to arrange transportation. An employee who needs

  17. Risk Management Department of Human Resource Services

    E-Print Network [OSTI]

    de Lijser, Peter

    Risk Management Department of Human Resource Services Workers' Compensation Update RETURN TO WORK or supervisor upon returning to work. The manager or supervisor should fax a copy of the release to Risk, the University's Workers' Compensation Program Manager, at extension 2824 or visit the Risk Management Website

  18. Copyright: CGI Europe -Certis Service & Network ManagementService & Network Management

    E-Print Network [OSTI]

    Abu-Rgheff, Mosa Ali

    #12;Copyright: CGI Europe - Certis Service & Network ManagementService & Network Management IntroductionIntroduction Peter.Fellows@certis.co.uk #12;Copyright: CGI Europe - Certis ContentContent l: CGI Europe - Certis Service ExpectationsService Expectations Wire-line Cellular Data Connection

  19. Information Management Services (IMS) VPN Connection (Windows)

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    Information Management Services (IMS) VPN Connection (Windows) 1. Verify there is an active (Junos Pulse) 12-5-2014 #12;Information Management Services (IMS) 6. Select Run, Allow, or Yes when prompted. 7. A successful connection will load a page with Use Instruction, Log-Out Instructions

  20. Risk Management Department of Human Resource Services

    E-Print Network [OSTI]

    de Lijser, Peter

    Risk Management Department of Human Resource Services Workers' Compensation Update WORKERS and are available by contacting the Risk Management department. Please do not add this form to any packets kept' COMPENSATION PHARMACY BENEFIT MANAGEMENT PROGRAM The California State University system has partnered

  1. REAL-TIME DATA SERVICES MANAGEMENT TRANSPORTATION

    E-Print Network [OSTI]

    Fisher, Kathleen

    Digital Signage · Automate software delivery · Manage power/heat consumption · Predictive service · Demand response Industrial Equipment1 2 3 4 5 6 CONNECTED MEDICAL DEVICES Medical asset status management ASSET MANAGEMENT Agriculture · Oil flow · Well pressure · Status of pump · Remote Maintenance

  2. Psm Nature Power Service Management Formerly Umweltkontor Renewable...

    Open Energy Info (EERE)

    Psm Nature Power Service Management Formerly Umweltkontor Renewable Energy AG Jump to: navigation, search Name: psm Nature Power Service & Management (Formerly Umweltkontor...

  3. Adaptive Resource Management Schemes for Web Services 

    E-Print Network [OSTI]

    Lee, Heung Ki

    2011-02-22

    MANAGEMENT SCHEMES FOR WEB SERVICES A Dissertation by HEUNG KI LEE Submitted to the O?ce of Graduate Studies of Texas A&M University in partial fulflllment of the requirements for the degree of DOCTOR OF PHILOSOPHY December 2009 Major Subject: Computer...: Chair of Committee, Eun Jung Kim Committee Members, Riccardo Bettati Rabi N. Mahapatra Deepa Kundur Ki Hwan Yum Head of Department, Valerie E. Taylor December 2009 Major Subject: Computer Science iii ABSTRACT Adaptive Resource Management Schemes for Web...

  4. Department of Environmental Health & Safety Risk Management Services

    E-Print Network [OSTI]

    Machel, Hans

    Department of Environmental Health & Safety Risk Management Services 3-107 Research Transition of Insurance Policy Standards Department of Management Services Protective Services Management & Risk Management & Risk Assessment Office Resource Planning Tel: 780.248.1147 Tel: 780.492.5050 Tel: 780

  5. Using Manager Self Service Reporting and Location Changes

    E-Print Network [OSTI]

    Leistikow, Bruce N.

    Using Manager Self Service Reporting and Location Changes Note: For staff employees, the new supervisor must have a manager or supervisory title. For academic employees, the new supervisor will be the administrator of record and must have eHR access. To use Manager Self Service: click on the Manager Self Service

  6. Management of Support Services Contract Activity

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    1985-10-03

    To provide the policy, procedures, and responsibilities for the management of support service contracts within the Department of Energy (DOE). Cancels 4200.3A dated 4-5-83. Change 1 Errata Sheet dated 6-27-89. Canceled by DOE O 4200.3C dated 5-17-91.

  7. Management of Support Services Contract Activity

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    1992-08-31

    To provide the policy, procedures, and responsibilities for the management of support services contracts within the Department of Energy (DOE). Cancels DOE O 4200.3C dated 5-17-91. Canceled by DOE N 1321.140 dated 5-20-94.

  8. Service management solutions To support your IT objectives

    E-Print Network [OSTI]

    IT integrate incident, problem, change and release management. Two key components of these solutions -- IBMService management solutions To support your IT objectives management tasks. Consequently, service levels and the effectiveness of asset management suffer. Without accurate, complete, reliable data from

  9. Policy and Contract Management for Semantic Web Services 

    E-Print Network [OSTI]

    Uszok, A; Bradshaw, J M; Jeffers, R; Johnson, M; Tate, Austin; Dalton, J; Aitken, Stuart

    This paper summarizes our efforts to develop capabilities for policy and contract management for Semantic Web Services applications. KAoS services and tools allow for the specification, management, analyzes, disclosure and enforcement of policies...

  10. WILDLAND FIRE SERVICES CENTER FOR ENVIRONMENTAL MANAGEMENT OF MILITARY LANDS

    E-Print Network [OSTI]

    products and services to assist military land managers and range operations personnel in protecting against is already in place. Fire Management Planning CEMML provides high quality fire management planning adviceWILDLAND FIRE SERVICES CENTER FOR ENVIRONMENTAL MANAGEMENT OF MILITARY LANDS CEMML | 1490 Campus

  11. Managing for ocean biodiversity to sustain marine ecosystem services

    E-Print Network [OSTI]

    Palumbi, Stephen R.; Sandifer, Paul A.; Allan, J. David; Beck, Michael W.; Fautin, Daphne G.; Fogarty, Michael J.; Halpern, Benjamin S.; Incze, Lewis S.; Leong, Jo-Ann C.; Norse, Elliott; Stachowicz, John J.; Wall, Diana H.

    2009-05-01

    Managing a complex ecosystem to balance delivery of all of its services is at the heart of ecosystem-based management. But how can this balance be accomplished amidst the conflicting demands of stakeholders, managers, and policy makers? In marine...

  12. TSpaces Services Suite: Automating the Development and Management of Web Services

    E-Print Network [OSTI]

    Fontoura, Marcus F.

    TSpaces Services Suite: Automating the Development and Management of Web Services Marcus Fontoura Page Mill Road Palo Alto, CA 94304 yuhong.xiong@hp.com ABSTRACT Web services allow authorized entities and implemented an infrastructure and a set of tools to simplify the development and management of Web services

  13. Semantic Management of Web Services Daniel Oberle1

    E-Print Network [OSTI]

    Staab, Steffen

    Semantic Management of Web Services Daniel Oberle1 , Steffen Lamparter1 , Andreas Eberhart2, staab@uni-koblenz.de Abstract. We present semantic management of Web Services as a paradigm that is located between the two extremes of current Web Services standards descrip- tions and tools, which we

  14. A Managerial Community of Web Services for Management of Communities of Web Services

    E-Print Network [OSTI]

    Bentahar, Jamal

    A Managerial Community of Web Services for Management of Communities of Web Services Abdelghani@ciise.concordia.ca Abstract -- Nowadays, Web services are considered as new and attracting distributed approach of application/services integration over the Internet. As the number of Web Services is exponentially growing and expected to do so

  15. A Change Management Framework for Service Oriented Enterprises

    E-Print Network [OSTI]

    Rosenberg, Florian

    A Change Management Framework for Service Oriented Enterprises Salman Akram1 Athman Bouguettaya2@cs.rit.edu3 We propose a change management framework for Service-Oriented Enterprise (SOEs). We present, respectively. We propose an automatic change management framework that is based on the above Petri net models

  16. Web-Based Services for Building Energy Management - WEBE 

    E-Print Network [OSTI]

    Paiho, S.; Pietilainen, J.; Ala-Juusela, M.

    2004-01-01

    Nowadays, internet can be accessed anywhere, and www-based applications are widespread. Utilizing internet also for energy management and commissioning purposes will be a future trend. A web-based service for building energy management, called Web...

  17. Management Services for Performance Verification in Broadband Multi-Service Networks

    E-Print Network [OSTI]

    Griffin, David

    Management Services for Performance Verification in Broadband Multi-Service Networks Panos Georgatsos1 , David Griffin2 Abstract This paper presents a practical management system for performance monitoring and network performance verification to support the larger goals of performance management systems

  18. Centrifuge: Integrated Lease Management and Partitioning for Cloud Services

    E-Print Network [OSTI]

    Adya, Atul

    Centrifuge: Integrated Lease Management and Partitioning for Cloud Services Atul Adya , John datacenter lease managers. This paper presents Centrifuge, a datacenter lease manager that solves this problem by integrating parti- tioning and lease management. Centrifuge consists of a set of libraries

  19. Web Service Offerings Language (WSOL) and Web Service Composition Management (WSCM)

    E-Print Network [OSTI]

    1 Web Service Offerings Language (WSOL) and Web Service Composition Management (WSCM) Vladimir {vladimir, bernie, babak, kpatel, weima}@sce.carleton.ca ABSTRACT Our research on Web Services is organized into two related projects. First, we develop Web Service Offerings Lan- guage (WSOL) for formal

  20. Top Five Service Recommendations February 2013 1 IT Service Management Board

    E-Print Network [OSTI]

    Queitsch, Christine

    Top Five Service Recommendations February 2013 1 IT Service Management Board Top Five Service Kelli Trosvig in autumn 2012. The SMB was charged with creating, by February 2013, a "top five list presented to Kelli Trosvig on February 26, 2013. The top five service recommendations are: 1. Teaching

  1. March 26, 2013 IT Service Manager Tips & Tricks

    E-Print Network [OSTI]

    Ottino, Julio M.

    Manager Archive. 3. Enter terms and values that reference your ticket (e.g. Interaction ID, Incident ID home page Tip 5: Use Global Issues only for P1 and P2 level incidents Tip 6: Search archived HP Service-down select IT Service Manager. 5. Refine your search using keywords. * Use "AND" or "OR" when searching

  2. Secure Authentication and Session State Management for Web Services

    E-Print Network [OSTI]

    Young, R. Michael

    Lehman 0 Secure Authentication and Session State Management for Web Services Clay Lehman CSC 499: Honors Thesis Supervised by: Dr. R. Michael Young #12;Lehman 1 1. Introduction Web services protocol. In a web service, the server invokes a function based on the message sent from the client

  3. Web Service Access Management for Integration with Agent Systems

    E-Print Network [OSTI]

    Web Service Access Management for Integration with Agent Systems B.J. Overeinder, P.D. Verkaik, from the perspective of agent systems (and not as is gen- erally the case by web service providers). Mediating between web service requests from (virtual) organizations of agents, the web ser- vice gateway

  4. Frameworks for Business-driven Service Level Management

    E-Print Network [OSTI]

    Frameworks for Business-driven Service Level Management A Criteria-based Comparison of ITIL-driven IT Management: the IT Infrastructure Library (ITIL) with its SLM reference process and the NGOSS SLA Management a realistic IT scenario. These criteria are applied to ITIL and NGOSS in order to elaborate possible areas

  5. Analysis of Assembly 264 - Amended: Pediatric Asthma Self-Management Training and Education Services for Children at High Risk

    E-Print Network [OSTI]

    California Health Benefits Review Program (CHBRP)

    2006-01-01

    self-management and education services was obtained from theManagement Training and Education Services for Children atManagement Training and Education Services for Children at

  6. V-014: Cisco Prime Data Center Network Manager JBoss RMI Services...

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

    4: Cisco Prime Data Center Network Manager JBoss RMI Services Let Remote Users Execute Arbitrary Commands V-014: Cisco Prime Data Center Network Manager JBoss RMI Services Let...

  7. V-146: HP Service Manager Bugs Permit Cross-Site Scripting and...

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

    Cross-Site Scripting and Information Disclosure Attacks PLATFORM: Service Manager v9.31 Web Tier ABSTRACT: Two vulnerabilities were reported in HP Service Manager REFERENCE LINKS:...

  8. Strategic Asset Management Plan 2006 -2011 Prepared by Director, Asset Management Services

    E-Print Network [OSTI]

    Wapstra, Erik

    Strategic Asset Management Plan 2006 - 2011 Prepared by Director, Asset Management Services ­Strategic Asset Management Plan 2006-11 Table of Contents Executive Summary 3 1 Introduction 5 1.1 Purpose of the Strategic Asset Management Plan ................................................... 5 1.2 Background

  9. A Policy Manager for Enterprise Service Management Mani Subramanian, Minaxi Gupta

    E-Print Network [OSTI]

    Gupta, Minaxi

    A Policy Manager for Enterprise Service Management Mani Subramanian, Minaxi Gupta College choices and a real-time Policy Manager is needed to make the right choice. Another example is the use information and execute transactions in a hurry from any geographic location. A Policy Manager that keeps

  10. Page 1 of 3 Acquisition Services Management (ASM) Division

    E-Print Network [OSTI]

    Page 1 of 3 Acquisition Services Management (ASM) Division Subcontracts, ASM-SUB P.O. Box 1663 within the benchmark codes require numbers of MPI ranks which are not practical on a single node

  11. Agreement for Energy Conservation and Demand Side Management Services Template

    Broader source: Energy.gov [DOE]

    Document features a template agreement between a U.S. Federal agency and a utility company for the implementation of energy conservation measures (ECMs) and demand side management (DSM) services.

  12. Analysis of Assembly Bill 264: Pediatric Asthma Self-Management Training and Education Services

    E-Print Network [OSTI]

    California Health Benefits Review Program (CHBRP)

    2006-01-01

    management training and education services. In estimatingmanagement training and education services in Knox-Keenemanagement training and education services in California

  13. Ubiquitous Computing Environment for Project Management Services , Jinxing Cheng2

    E-Print Network [OSTI]

    Wiederhold, Gio

    1 Ubiquitous Computing Environment for Project Management Services David Liu1 , Jinxing Cheng2 for the development of a ubiquitous computing environment for distributed engineering services. Two fundamental issues communication technologies make ubiquitous computing possible. We will soon have an interconnected web of small

  14. Soil Conservation Service Landscape Resource Management1

    E-Print Network [OSTI]

    , and disposal of water; animal husbandry; fish and wild- life management; recreation; community development derelict land. In either case, SCS recognizes its role in improving environmental quality through

  15. MANAGING OPERATIONS AND SERVICES (10061, MGTK 511-110)

    E-Print Network [OSTI]

    Diestel, Geoff

    -based competition, and quality improvement. Operations management involves the integration of numerous activities1 MANAGING OPERATIONS AND SERVICES (10061, MGTK 511-110) SYLLABUS, SPRING 2015 MEETING TIME, cost or quality. Most now agree that world class performance in operations is essential for competitive

  16. Overload Management as a Fundamental Service Design Primitive

    E-Print Network [OSTI]

    , databases, di- rectory services, and file servers all require some form of over- load management, though few are not necessarily backed by massive data centers which can grow to meet capacity. Despite the importance of load management, few systems di- rectly address this problem, treating it as an issue of capacity planning rather

  17. An Architecture for Managing Virtual Circuit and Virtual Path Services on ATM Networks

    E-Print Network [OSTI]

    Columbia University

    1 An Architecture for Managing Virtual Circuit and Virtual Path Services on ATM Networks Abstract management architecture that provides the services and is instrumented for network management purposes service monitor- ing and control functions. The network management architecture proposes complete managed

  18. SEMF -Service Evolution Management Framework Martin Treiber, Hong-Linh Truong, Schahram Dustdar

    E-Print Network [OSTI]

    Dustdar, Schahram

    ,truong,dustdar}@infosys.tuwien.ac.at Abstract With the growing popularity of Web services, an increas- ing number of Web services have been integrated into and used by complex service oriented systems. As a result, the management of Web services has gained more importance as Web services management systems can provide useful service information

  19. Modeling and Simulation of Nuclear Medicine Patient Service Management in DEVS

    E-Print Network [OSTI]

    Ntaimo, Lewis

    knowledge) DEVS simulation model for nuclear medicine patient service management. The model representsModeling and Simulation of Nuclear Medicine Patient Service Management in DEVS Eduardo P departments. Furthermore, the characteristics of patient and resource management in nuclear medicine make

  20. Active Connection Management in Internet Services Mike Y. Chen and Eric Brewer

    E-Print Network [OSTI]

    California at Berkeley, University of

    services to manage load- balancing switches dynamically to control how client connections are mappedActive Connection Management in Internet Services Mike Y. Chen and Eric Brewer Computer Science connection management architecture for clustered Internet services called Active Connection Management (ACM

  1. Load Balancing in Broadband Multi-Service Networks: A Management Perspective

    E-Print Network [OSTI]

    Griffin, David

    66/1 Load Balancing in Broadband Multi-Service Networks: A Management Perspective Panos Georgatsos1 nodes may be managed by a TMN system, by virtue of a management service called Load Balancing the objectives of the proposed Load Balancing management service. 1. Introduction The essential target of future

  2. Home Energy Management as a Service over Networking Platforms

    E-Print Network [OSTI]

    Al Faruque, Mohammad Abdullah

    pattern, for instance, the U.S. state of California mandated Zero Net Energy buildings by 2020 Zero Net Energy (ZNE) buildings by 2020 [2]. Also, the U.S. Department of Energy (DOE) BuildingHome Energy Management as a Service over Networking Platforms Korosh Vatanparvar, Quan Chau

  3. Supporting service management data composition in grid environments

    E-Print Network [OSTI]

    monitoring architecture to the grid environment. For this purpose, the Relational Grid Monitoring, Monitoring, Service Management 1. Motivation The emerging grid environments make use of a multitude in [3] to grid environments. The aim is to facilitate deployment of well established grid monitoring

  4. Supporting service management data composition in grid environments

    E-Print Network [OSTI]

    ­ vice monitoring architecture to the grid environment. For this purpose, the Relational Grid Monitoring, Monitoring, Service Management 1. Motivation The emerging grid environments make use of a multitude in [3] to grid environments. The aim is to facilitate deployment of well established grid monitoring

  5. Acquisition Services Management (ASM) Division Subcontracts, ASM-SUB

    E-Print Network [OSTI]

    Acquisition Services Management (ASM) Division Subcontracts, ASM-SUB P.O. Box 1663, Mail Stop D447-trace of itself while running. Question/Issue 3 This question is on the three codes described in the Trinity Capability Improvement codes on the Cielo system is shown at different node counts. What is the memory

  6. Acquisition Services Management (ASM) Division Subcontracts, ASM-SUB

    E-Print Network [OSTI]

    Acquisition Services Management (ASM) Division Subcontracts, ASM-SUB P.O. Box 1663, Mail Stop D447 that the 'Base case' shall be run with "no OpenMP" threads or "any existing APIs in the codes which exploit SNAP, or MILC codes without using the OpenMP enabling compiler flag. I can provide details of the code

  7. ENVIRONMENTAL COMPLIANCE SERVICES CENTER FOR ENVIRONMENTAL MANAGEMENT OF MILITARY LANDS

    E-Print Network [OSTI]

    ENVIRONMENTAL COMPLIANCE SERVICES CENTER FOR ENVIRONMENTAL MANAGEMENT OF MILITARY LANDS CEMML@cemml.colostate.edu | http://www.cemml.colostate.edu Environmental compliance and pollution prevention are critical aspects of any successful environmental program. The Center provides technical support in these key areas. CEMML

  8. Graph500 [1] Graph500

    E-Print Network [OSTI]

    ab cBFSd ab 64 64 cBFSd bKernel 1c 14 Web VLSI Graph500 [1] Graph500 Top 500 Graph (Compressed Sparse Row)CSC (Compressed SparseColumn)cBFS BFSBFSdBFS BFS 1 5 2-2 BFS Graph500 OpenMP MPICrayExpand CQ C CQ CQPREDNQ CQ FoldPRED FoldCQCQ Fold CQ Fold Expand (R-1)fold(C-1) 2 3 Graph500 3 Graph

  9. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: May 2006

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: May viewing of sensitive information. Maintain system logging. Maintain up-to-date Health Science Center

  10. Analysis of Forest Service Wildland Fire Management Expenditures: An Update1

    E-Print Network [OSTI]

    Standiford, Richard B.

    Analysis of Forest Service Wildland Fire Management Expenditures: An Update1 Ervin G. Schuster2 Abstract Soaring expenditures for fire management in the USDA Forest Service have caused substantial. This report contains analysis of most Forest Service fire management expenditures between fiscal years 1970

  11. Generalized Performance Management of Multi-Class Real-Time Imprecise Data Services

    E-Print Network [OSTI]

    Son, Sang H.

    for performance guarantees. In this paper we propose an approach for managing the quality of service of realGeneralized Performance Management of Multi-Class Real-Time Imprecise Data Services Mehdi Amirijoo@isy.liu.se Abstract The intricacy of real-time data service management in- creases mainly due to the emergence

  12. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000 Section 5.5 Information Management Client Support Services Revised: December 2009 Policy 5.5.6 Long Distance Service Responsibility: Vice President and Chief Information Officer Page 1

  13. University of Leicester -Estates (Operations) -Service Level Statement Estates and Facilities Management Division

    E-Print Network [OSTI]

    Banaji,. Murad

    and Facilities Management Division (Operations) Service Level Statement Postal Services a) Aim To provideUniversity of Leicester - Estates (Operations) - Service Level Statement Feb 2015 Estates and partner organisations by ensuring that the EFMD staff provide a customer focussed, quality service

  14. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Production Services Responsibility: Vice President and Chief Information Officer TELEVISION PRODUCTION in support of the missions of the Health Science Center for administration, faculty, staff and students

  15. South Carolina Department of Archives and History Archives and Records Management Service Area

    E-Print Network [OSTI]

    Kunkle, Tom

    South Carolina Department of Archives and History Archives and Records Management Service Area 1919 Blanding Street, Columbia South Carolina 29201 General Records Retention Schedules for Data Processing

  16. U-168: EMC Documentum Information Rights Management Server Bugs Let Remote Authenticated Users Deny Service

    Broader source: Energy.gov [DOE]

    Two vulnerabilities were reported in EMC Documentum Information Rights Management Server. A remote authenticated user can cause denial of service conditions.

  17. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services scanned. #12;HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management and Development Responsibility: Vice President and Chief Information Officer Page 1 of 2 EDUCATIONAL RESEARCH

  18. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: December 2005

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services the confidentiality, integrity and availability of Health Science Center electronic information resources. Policy and vulnerabilities #12;HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management

  19. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2002

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services the protection of all Health Science Center information resources with respect to privacy, unauthorized to both centralized and decentralized Health Science Center information resources must be managed

  20. Managing prisons using a ‘business-like approach: a case study of the Scottish Prison Service 

    E-Print Network [OSTI]

    Sangkhanate, Assanee

    2012-06-26

    The primary aim of this research is to examine the extent which prison management has been influenced by New Public Management (NPM). Much has been written about the growing influence of NPM on public services like health, ...

  1. Abstract--As IT service providers are adoptingmore compre-hensive approachestowardsIT Service Management (ITSM), they

    E-Print Network [OSTI]

    TOM), no equivalent for the more general process frameworks of ITIL and ISO/IEC 20000 is in sight. This paper compliant to ISO/IEC 20000 requirements and ITIL recommendations. Index Terms--IT Service Management, Information Model, SID, ITIL, ISO/IEC 20000 I. INTRODUCTION HEefficient delivery of high quality IT services

  2. A general framework for routing management in multi-service ATM

    E-Print Network [OSTI]

    Griffin, David

    . Keywords ATM, TMN, load balancing, performance management, route design, routing, routing management, VPCA general framework for routing management in multi-service ATM networks P. Georgatsos Algosystems This paper presents a framework for routing management in ATM networks supporting guaranteed quality

  3. RFID Asset Management Solution with Cloud Computation Service

    E-Print Network [OSTI]

    Chattopadhyay, Arunabh

    2012-01-01

    Gadh, “Web based RFID asset management solution establishedLos Angeles RFID Asset Management Solution with CloudTHE DISSERTATION RFID Asset Management Solution with Cloud

  4. SQLGraph: An Efficient Relational-Based Property Graph , Achille Fokoue

    E-Print Network [OSTI]

    Cortes, Corinna

    [Database Management]: Systems General Terms Property graphs; Gremlin Keywords Property graphs; Relational Storage; Gremlin 1. INTRODUCTION There is increased interest in graph data management re- cently, fueled literature has been on RDF data management (e.g., [39, 18, 27, 24, 6, 25, 16]). Much of this work targets

  5. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000 Section 5.5 Information Management Client Support Services Revised: December 2009 Policy 5.5.1 Mission Responsibility: Vice President and Chief Information Officer Page 1 of 1 MISSION

  6. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000 Section 5.5 Information Management Client Support Services Revised: July 2010 Policy 5.5.7 University-Owned Mobile Telephone Usage Policies Responsibility: Vice President and Chief Information Officer

  7. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000 Section 5.5 Information Management Client Support Services Revised: December 2009 and Chief Information Officer Page 1 of 1 PERSONAL MOBILE TELEPHONE EXPENSE REIMBURSEMENT POLICIES Policy

  8. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services and Activities Responsibility: Vice President and Chief Information Officer Page 1 of 2 RESPONSIBILITIES of the Information Management and Services (IMS) accounts. Preparation of the IMS "Annual Financial Report" and other

  9. Graph Theory

    SciTech Connect (OSTI)

    Sanfilippo, Antonio P.

    2005-12-27

    Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for the representation of grammar formalisms.

  10. CiCS Development Portfolio Overview Information Services is a constantly changing area, and CiCS therefore has to not only manage and maintain our

    E-Print Network [OSTI]

    Martin, Stephen John

    CS therefore has to not only manage and maintain our services, but also organise the many significant changes management CiCS Development Portfolio ­ Overview: Page 1 of 2 Change the Services Portfolio Management (Projects/developments & Benefits) Run the Services Service Management New/Changed Services Strategic

  11. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services University Materials Responsibility: Vice President and Chief Information Officer COPYRIGHTED UNIVERSITY Materials"). All materials produced by the Health Science Center faculty, staff, and students using Health

  12. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2002

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Science Center staff members delegated with the responsibility of responding to: a. Information security approve CIRT membership as recommended by the Health Science Center Information Security Council. 3

  13. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: October 2004

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services the protection of and continued availability of all Health Science Center, including UT Medicine, information that may contain Health Science Center and UT Medicine critical information. Accountability Violations

  14. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: July 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services, must use the Health Science Center Information Security approved malware protection software Information Security monitoring practices as defined in #12;HEALTH SCIENCE CENTER HANDBOOK OF OPERATING

  15. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: October 2004

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    , performance, financial, or health records, etc. 3. Personnel Information: institutional and departmental government. d. information or data collected would violate the confidentiality of sources or subjectsHEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services

  16. Service bulletin inventory management and modeling for aerospace parts in customer service organization

    E-Print Network [OSTI]

    Pardede, Erna K. (Erna Kertasasmita)

    2013-01-01

    The Customer Service department of United Technology Corporation (UTC) Aerospace System is primarily responsible for providing spare parts, repair services, training, and technical support for products that UTC Aerospace ...

  17. Implementing TMN-like Management Services in a TINA Compliant Architecture

    E-Print Network [OSTI]

    Griffin, David

    Implementing TMN-like Management Services in a TINA Compliant Architecture: A Case Study Abstract TINA aims to provide an architecture to enable telecommunications networks to support the flex in an integrated fashion. While the specifications in the TINA Service Architecture are well advanced, network

  18. Economic Incentives of Providing Network Security Services Journal of Information Technology Management 1

    E-Print Network [OSTI]

    Chen, Li-Chiou

    Economic Incentives of Providing Network Security Services Journal of Information Technology Management 1 THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE Li in the economic incentives inherent in providing the defenses as well as uncertainty in current defenses. We

  19. Managing Sustainable Demand-side Infrastructure for Power System Ancillary Services

    E-Print Network [OSTI]

    Victoria, University of

    Managing Sustainable Demand-side Infrastructure for Power System Ancillary Services by Simon Sustainable Demand-side Infrastructure for Power System Ancillary Services by Simon Christopher Parkinson B highly-distributed sustainable demand- side infrastructure, in the form of heat pumps, electric vehicles

  20. 5-Week Weight Management Class - HPMC Occupational Health Services

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

    5-Week Weight Management Class Health Education & Wellness Downloads & Patient Materials Health & Productivity Health Calculators & Logs Health Coaching Health Fairs and Screenings...

  1. NNSA recognizes Knight's service to Nuclear Materials Management...

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

    in the issuance of DOE Order 410.2, Management of Nuclear Materials, and developing training modules and supplemental guidance documents to assist sites across the DOE...

  2. MANAGING OPERATIONS AND SERVICES (80352, MGTK 511-115) SYLLABUS, FALL 2014

    E-Print Network [OSTI]

    Diestel, Geoff

    -based competition, and quality improvement. Operations management involves the integration of numerous activities1 MANAGING OPERATIONS AND SERVICES (80352, MGTK 511-115) SYLLABUS, FALL 2014 MEETING TIME, cost or quality. Most now agree that world class performance in operations is essential for competitive

  3. Dynamic Power Management in a Mobile Multimedia System with Guaranteed Quality-of-Service*

    E-Print Network [OSTI]

    Qiu, Qinru

    Dynamic Power Management in a Mobile Multimedia System with Guaranteed Quality-of-Service* Qinru address the problem of dynamic power management in a distributed multimedia system with a required quality Qiu, Qing Wu, and Massoud Pedram Department of Electrical Engineering-Systems University of Southern

  4. A Service-Oriented Architecture for Electric Power Transmission System Asset Management

    E-Print Network [OSTI]

    Honavar, Vasant

    A Service-Oriented Architecture for Electric Power Transmission System Asset Management Jyotishman,tua,honavar,jdm}@iastate.edu Abstract. In electric power transmission systems, the assets include transmis- sion lines, transformers number of distributed, autonomously managed, capital-intensive as- sets. Such assets include power plants

  5. Flood Plain Management Services Program U.S. ARMY CORPS OF ENGINEERS BUILDING STRONG

    E-Print Network [OSTI]

    US Army Corps of Engineers

    Flood Plain Management Services Program U.S. ARMY CORPS OF ENGINEERS BUILDING STRONG® ® People that live and work in the flood plain need to know about the flood hazard and the actions that they can take to reduce property damage and to prevent the loss of life caused by flooding. The Flood Plain Management

  6. Robust Quality Management for Differentiated Imprecise Data Services Mehdi Amirijoo, Jorgen Hansson

    E-Print Network [OSTI]

    Robust Quality Management for Differentiated Imprecise Data Services Mehdi Amirijoo, J knowledge of the workload. In this paper we propose an approach, based on feedback control, for manag- ing-0208758, and ISIS (Information Systems for Indus- trial Control and Supervision). data needs

  7. Job Title Refugee Medical Case Manager Employer/ Agency YMCA International Services

    E-Print Network [OSTI]

    Azevedo, Ricardo

    Job Title Refugee Medical Case Manager Employer/ Agency YMCA International Services Job Description The Refugee Medical Case Manager will primarily be responsible for connecting clients to the following, automobile liability insurance, and a vehicle. - Fluency in a relevant refugee language (Arabic, Nepali

  8. ENVIRONMENTAL PLANNING / NEPA SERVICES CENTER FOR ENVIRONMENTAL MANAGEMENT OF MILITARY LANDS

    E-Print Network [OSTI]

    ENVIRONMENTAL PLANNING / NEPA SERVICES CENTER FOR ENVIRONMENTAL MANAGEMENT OF MILITARY LANDS CEMML@cemml.colostate.edu | http://www.cemml.colostate.edu Effective environmental planning and management of military and testing. The Center develops environmental planning documents for installations to incorporate

  9. Trust-based Service Management for Social Internet of Things Systems

    E-Print Network [OSTI]

    Cao, Yong

    Trust-based Service Management for Social Internet of Things Systems Ing-Ray Chen, Fenye Bao, and Jia Guo Abstract-- A social Internet of Things (IoT) system can be viewed as a mix of traditional peer-- Trust management, Internet of things, social networking, performance analysis, adaptive control

  10. KAoS Policy Management for Semantic Web Services 

    E-Print Network [OSTI]

    Uszok, A; Bradshaw, J M; Jeffers, R; Johnson, M; Tate, Austin; Dalton, J; Aitken, Stuart

    2004-01-01

    capabilities (www.swsi.org). These new capabilities should more fully harness Web Services' power through explicit representations of Web resources' underlying semantics and the development of an intelligent Web infrastructure that can fully exploit them...

  11. Food service establishment wastewater characterization and management practice evaluation 

    E-Print Network [OSTI]

    Garza, Octavio Armando

    2006-04-12

    Food service establishments that use onsite wastewater treatment systems are experiencing hydraulic and organic overloading of pretreatment systems and/or drain fields. Design guidelines for these systems are typically provided in State regulations...

  12. QoS-Assured Service Composition in Managed Service Overlay Networks Xiaohui Gu, Klara Nahrstedt Rong N. Chang, Christopher Ward

    E-Print Network [OSTI]

    Nahrstedt, Klara

    Network (SON) SON Access Domain Service Provider: XXX.com service instance X service instance Y service

  13. Energy Management Services for the Industrial Market Segment at TVA 

    E-Print Network [OSTI]

    Hamby, R. E.; Knight, V. R.

    1984-01-01

    The Tennessee Valley Authority has provided energy management surveys (EMSs) to commercial and industrial power consumers since 1979. A significant number of EMSs have been performed to a variety of industry types and sizes. As in all developmental...

  14. TITLE: Guidelines for Scheduled Work Management Flow within ITS Information Technology Services Standards, Practices and Policies (SP&Ps)

    E-Print Network [OSTI]

    Hamburger, Peter

    TITLE: Guidelines for Scheduled Work Management Flow within ITS Information Technology Services _________ Mike Kanning _________ Cynthia Elick _________ Summary: Policy describes how IT Services manages Schedule, monitored for progress and customers kept informed. 4.0 Practice 4.1 Scheduled Work Management

  15. Managing Rangelands for Multiple Ecosystem Services, K. Tate, UC Davis

    E-Print Network [OSTI]

    Tate, Kenneth

    Services from Rangelands Livestock Production Diversity Habitat Climate Regulation Clean and Safe Water & Hydrologic Function Riparian areas no longer considered "sacrifice areas" to optimize forage harvest. #12;Safe Water to Drink and Irrigate Water and produce to tens of millions #12;Grassland Birds ­ In Decline

  16. Fiscal Year 2014 Priorities Business Services Business Management

    E-Print Network [OSTI]

    Pittendrigh, Barry

    Projections for all sources with commitments against them Long term projection for college Communicate/review team in the unit while providing a robust control environment Present a creative, positive accountability and ethical conduct. Know and communicate your unit's financial health Actively manage unspent

  17. Name Title S1 Process Team Division Caitlin Angus Deputy Enrolment Manager Enrolment planning support Enrolments Student Client Services

    E-Print Network [OSTI]

    Liley, David

    Name Title S1 Process Team Division Caitlin Angus Deputy Enrolment Manager Enrolment planning Officer Results, Student Progress Progression - Wantirna Student Admin Services Justine Bell Results

  18. Utilization Graphs

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAbout /Two0 -Using supercritical carbon dioxide as aGraphs

  19. WORKERS' COMPENSATION CLAIMS PROGRAM Managed by the Office of Risk Management/Claims Services

    E-Print Network [OSTI]

    WORKERS' COMPENSATION CLAIMS PROGRAM Managed by the Office of Risk Management and needs medical a en on, the University (through his/her supervisor, the Office of Risk Management, and the Department of Labor & Industries un l the Industrial Injury claim is closed. No one knows their own job

  20. University Budget System Reports Training Guide Prepared by Budget Management and Fiscal Services

    E-Print Network [OSTI]

    1 University Budget System Reports Training Guide Prepared by Budget Management and Fiscal Services with forecasted dollars needed to fiscal year-end and revenue collected. This system can report the data to detailed transaction information for year-to-date revenue and year-to-date expenditures. UBUD

  1. How Service Science Management and Engineering (SSME) Can Evolve to an Academic Discipline

    E-Print Network [OSTI]

    Perros, Harry

    .net} 2 Computer Science Department, NC State University, Raleigh, NC 27695, USA Email. Industry is aware of the important role of Service Science Management and Engineering (SSME) in the modern that integrates aspects of established fields such as computer science, operations research, engineering

  2. Service Science, Management and Engineering Curricula and Research at NC State University

    E-Print Network [OSTI]

    Perros, Harry

    _allen@ncsu.edu (919) 515-6941 Harry Perros Professor, Department of Computer Science, NC State University Raleigh, NC1 Service Science, Management and Engineering Curricula and Research at NC State University Steven and Computer Engineering, NC State University Raleigh, NC 27695-7911 candice@ncsu.edu (919) 515-7357 Michael

  3. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003 Section 5.8 Information Security Revised: January 2012 Policy 5.8.13 Security Monitoring Responsibility: Chief Information Security Officer Page 1 of 2 SECURITY MONITORING Policy

  4. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2002

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2002 Section 5.8 Information Security Revised: May 2011 Policy 5.8.1 Information Security Function Responsibility: Chief Information Security Officer Page 1 of 1 INFORMATION SECURITY FUNCTION

  5. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services sensitive Health Science Center information, particularly confidential/high risk data, administrator access of information on computers connected to the Health Science Center network is the responsibility of the user

  6. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Science Center enterprise information security architecture, any incidents of possible misuse.8.10, "Acceptable Use of Information Resources Policy", of the HOP, #12;HEALTH SCIENCE CENTER HANDBOOK OF OPERATING

  7. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services the Health Science Center's information resources and computer network. See the Handbook of Operating Effective: June 2000 Section 5.8 Information Security Revised: May 2014 Policy 5.8.12 Portable Computing

  8. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003 Section 5.8 Information Security Revised: September 2014 Policy 5.8.10 Information Resources Acceptable Use and Security Policy Responsibility: Chief Information Security Officer Page 1 of 6

  9. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2002

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services of Information Security incidents at the UT Health Science Center at San Antonio (Health Science Center with the Health Science Center. Policy Definition An information security incident is an unplanned event affecting

  10. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services of Texas Responsibility: Vice President and Chief Information Officer Page 1 of 1 TELECONFERENCE NETWORK in the health sciences in support of the missions of the Health Science Center. The role of Teleconference

  11. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: September 2004

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: September 2004 Section 5.8 Information Security Revised: March 2012 Policy 5.8.2 Definitions Responsibility: Chief Information Security Officer Page 1 of 5 DEFINITIONS Definitions ACCESS CONTROL EXECUTIVE

  12. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services; · the Health Science Center information the third-party provider should have access to; · how Health Science, destruction or disposal of Health Science Center information in the third-party provider's possession

  13. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: December 2005

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services by the Information Security Office (ISO). Risk assessments will be conducted on any entity within the Health Science or organizational assets. #12;HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information

  14. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: September 2002

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Science Center, and: the distribution of critical information, security-related patches/updates, virus, Chair, or Director. #12;HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information

  15. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: October 2004

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Science Center information or applications) remains on the media or device. For common rotating magnetic to transferring it to the Health Science Center Warehouse. Additionally, the Information System owner must tag

  16. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services to allow them to properly protect Health Science Center information resources. In the case of contractors Effective: June 2003 Section 5.8 Information Security Revised: March 2012 Policy 5.8.17 Information Security

  17. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services PROTECTION OF INFORMATION RESOURCES Policy Information resources are an asset of the Health Science Center is prohibited. Use of the Health Science Center information resources is intended to support authorized research

  18. FLEET SERVICES -FACILTIES MANAGEMENT -UNIVERSITY OF CALIFORNIA, SAN DIEGO UNIVERSITY VEHICLE USE AUTHORIZATION FORM

    E-Print Network [OSTI]

    Russell, Lynn

    FLEET SERVICES - FACILTIES MANAGEMENT - UNIVERSITY OF CALIFORNIA, SAN DIEGO UNIVERSITY VEHICLE USE/destination________________________________________________________ ____________________________________________________________________________ Undersigned fully understands and acknowledges that the vehicle released pursuant to this authorization shall driver states that he/she has a valid driver's license for the vehicle being operated. Damage related

  19. Tackling the Loss of Control: Standards-based Conjoint Management of Security Requirements for Cloud Services

    E-Print Network [OSTI]

    Schneider, Jean-Guy

    .versteeg@ca.com Abstract--The loss of control over information assets is a major security and privacy concern in the Cloud manage security requirements for a Cloud service following the ISO 27001 standard for infor- mation approach is demonstrated with an example scenario. Keywords-cloud computing, cloud computing security

  20. MGT 511-115 Managing Operations and Services Instructor: Dr. David Geigle

    E-Print Network [OSTI]

    Diestel, Geoff

    of concepts, models and methods used to effectively manage the manufacturing and/or service operations of for location sites. d) Explain how a production pull system works. e) Summarize important attributes of a lean planning between manufacturing, logistics, and marketing. b) Identify the different purposes for keeping

  1. Knowledge Network: An Information Repository with Services for Managing Concurrent Engineering Design

    E-Print Network [OSTI]

    Fox, Mark S.

    Knowledge Network: An Information Repository with Services for Managing Concurrent Engineering design engineers. The KAD system centers on a knowledge network that stores design knowledge and provides are constructing a Knowledge Aided Design (KAD) system for supporting concurrent engineering design and enhancing

  2. Assessing Patient Case Management Services with Adult Congenital Heart Disease Sensed Data

    E-Print Network [OSTI]

    Roussos, George

    1 Assessing Patient Case Management Services with Adult Congenital Heart Disease Sensed Data · Clinicians: Doctors & Nurses 7 How do Patients use Panaceia-iTV? Follow a treatment plan that includes-iTV Pilot Sites Brompton Hospital, London Adult Congenital Heart Center, Congenital Heart Disease Patients

  3. Managing the Cost, Energy Consumption, and Carbon Footprint of Internet Services

    E-Print Network [OSTI]

    Bianchini, Ricardo

    or "green" energy. This paper introduces a general, optimization-based framework for enabling multi-data-center services to manage their brown en- ergy consumption and leverage green energy, while respecting their SLAs. "green" or renewable energy.) We argue that placing caps on the brown energy consumption of data centers

  4. Managing the Cost, Energy Consumption, and Carbon Footprint of Internet Services

    E-Print Network [OSTI]

    Singh, Jaswinder Pal

    that enable multi-data-center services to manage their brown energy consumption and leverage green energy by carbon-intensive means as "brown" energy, in contrast with "green" or renewable energy.) We argue. Governments may impose Kyoto-style cap- and-trade schemes to curb carbon emissions and promote green energy

  5. Self Managed Security Cell, a security model for the Internet of Things and Services

    E-Print Network [OSTI]

    de Leusse, Pierre; Dimitrakos, Theo; Nair, Srijith K; 10.1109/AFIN.2009.15

    2012-01-01

    The Internet of Things and Services is a rapidly growing concept that illustrates that the ever increasing amount of physical items of our daily life which become addressable through a network could be made more easily manageable and usable through the use of Services. This surge of exposed resources along with the level of privacy and value of the information they hold, together with the increase of their usage make for an augmentation in the number of the security threats and violation attempts that existing security systems do not appear robust enough to address. In this paper, the authors underline this increase in risk and identify the requirements for resources to be more resilient in this type of environment while keeping an important level of flexibility. In addition, the authors propose an architectural model of Self Managed Security Cell, which leverages on current knowledge in large scale security systems, information management and autonomous systems.

  6. Approved Module Information for BM3381, 2014/5 Module Title/Name: Services Marketing Management Module Code: BM3381

    E-Print Network [OSTI]

    Neirotti, Juan Pablo

    Approved Module Information for BM3381, 2014/5 Module Title/Name: Services Marketing Management Marketing is essential Module Dependancies Pre-requisites: Principles of Services Marketing (BM2249). Co. To help students understand the application of services marketing theories and concepts to real business

  7. Management support services to the Office of Utility Technologies. Final technical report

    SciTech Connect (OSTI)

    Not Available

    1993-12-16

    The Office of Utility Technologies works cooperatively with industry and the utility sector to realize the market potential for energy efficiency and renewable energy technologies. Under this contract, BNF has provided management support services for OUT R&D activities for the following Program offices: (1) Office of Energy Management; (2) Office of Solar Energy Conversion; (3) Office of Renewable Energy Conversion; and (4) Deputy Assistant Secretary. During the period between 4/17/91 and 9/17/93, BNF furnished the necessary personnel, equipment, materials, facilities and travel required to provide management support services for each of the above Program Offices. From 9/18/93 to 12/17/93, BNF has been involved in closeout activities, including final product deliverables. Research efforts that have been supported in these Program Offices are: (1) for Energy Management -- Advanced Utility Concepts Division; Utility Systems Division; Integrated Planning; (2) for Solar Energy Conversion -- Photovoltaics Division; Solar Thermal and Biomass Power Division; (3) for Renewable Energy Conversion -- Geothermal Division; Wind, Hydroelectric and Ocean Systems Division; (4) for the Deputy Assistant Secretary -- support as required by the Supporting Staff. This final report contains summaries of the work accomplished for each of the Program Offices listed above.

  8. Supplemental Requirements for the Use of Management and Operating or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C., Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2005-10-19

    The Notice supplements review and approval requirements of DOE O 350.2A, Use of Management and Operating (M&O) or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C., Area, dated 10-29-03.

  9. Methods of visualizing graphs

    DOE Patents [OSTI]

    Wong, Pak C. (Richland, WA); Mackey, Patrick S. (Kennewick, WA); Perrine, Kenneth A. (Richland, WA); Foote, Harlan P. (Richland, WA); Thomas, James J. (Richland, WA)

    2008-12-23

    Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.

  10. Developing Effective Continuous On-Line Monitoring Technologies to Manage Service Degradation of Nuclear Power Plants

    SciTech Connect (OSTI)

    Meyer, Ryan M.; Ramuhalli, Pradeep; Bond, Leonard J.; Cumblidge, Stephen E.

    2011-09-30

    Recently, there has been increased interest in using prognostics (i.e, remaining useful life (RUL) prediction) for managing and mitigating aging effects in service-degraded passive nuclear power reactor components. A vital part of this philosophy is the development of tools for detecting and monitoring service-induced degradation. Experience with in-service degradation has shown that rapidly-growing cracks, including several varieties of stress corrosion cracks (SCCs), can grow through a pipe in less than one fuel outage cycle after they initiate. Periodic inspection has limited effectiveness at detecting and managing such degradation requiring a more versatile monitoring philosophy. Acoustic emission testing (AET) and guided wave ultrasonic testing (GUT) are related technologies with potential for on-line monitoring applications. However, harsh operating conditions within NPPs inhibit the widespread implementation of both technologies. For AET, another hurdle is the attenuation of passive degradation signals as they travel though large components, relegating AET to targeted applications. GUT is further hindered by the complexity of GUT signatures limiting its application to the inspection of simple components. The development of sensors that are robust and inexpensive is key to expanding the use of AET and GUT for degradation monitoring in NPPs and improving overall effectiveness. Meanwhile, the effectiveness of AET and GUT in NPPs can be enhanced through thoughtful application of tandem AET-GUT techniques.

  11. 12/8/2004 Copyright 2004 by Benjamin Grosof. All Rights Reserved E-Services Knowledge Management

    E-Print Network [OSTI]

    12/8/2004 Copyright 2004 by Benjamin Grosof. All Rights Reserved E-Services Knowledge Management.J. Watson Research Center, Hawthorne, NY, USA, Dec. 8, 2004 Hosts: Hoi Chan and Richard Goodwin Benjamin Grosof MIT Sloan School of Management Information Technologies group http://ebusiness.mit.edu/bgrosof #12;12/8/2004

  12. ITIL frameworks to ITD Company for improving capabilities in service management

    E-Print Network [OSTI]

    Nguyen, Phuc V

    2011-01-01

    IT operates in dynamic environments with the need always to change and adapt. There is a need to improve performance. Many gaps were found when we conduct the IT audit and we tried to seek to close gaps in capabilities. One way to the close these gaps is the adoption of good practices in wide industry use. There are several sources for good practices including public frameworks and standards such as ITIL, COBIT, CMMI, eSCM-SP, PRINCE2, ISO 9000, ISO/IEC 20000 and ISO/IEC 27001, etc. The paper propose ITIL frameworks to ITD Company for improving capabilities in service management.

  13. Graphs, matrices, and the GraphBLAS: Seven good reasons

    SciTech Connect (OSTI)

    Kepner, Jeremy; Bader, David; Buluç, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

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

  14. Graphs, matrices, and the GraphBLAS: Seven good reasons

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Kepner, Jeremy; Bader, David; Buluç, Ayd?n; Gilbert, John; Mattson, Timothy; Meyerhenke, Henning

    2015-01-01

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

  15. Dismantling sparse random graphs

    E-Print Network [OSTI]

    Janson, Svante

    2007-01-01

    We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).

  16. Graph Generator Survey

    SciTech Connect (OSTI)

    Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W

    2013-12-01

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

  17. Spectral Graph Theory

    E-Print Network [OSTI]

    *D. J. Kelleher

    2011-09-30

    Spectral Graph Theory. *D. J. Kelleher2. 2Department of Mathematics. University of Connecticut. UConn— SIGMA Seminar — Fall 2011. D. J. Kelleher. Spectral ...

  18. Vacuum Energy in Quantum Graphs 

    E-Print Network [OSTI]

    Wilson, Justin

    2007-07-14

    We calculate the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent mathematical interest as a functional carrying information about the eigenvalue spectrum of a system. A quantum graph is a metric graph...

  19. A study in the application of energy management at a table service restaurant

    SciTech Connect (OSTI)

    Balmer, A.; Nodolf, K.M.

    1985-01-01

    This paper describes a study of the application of energy management including electric demand limit control in a 6656 ft/sup 2/ table service restaurant located in Minneapolis, which contained 30 tons of rooftop air conditioning, a 74 kW electric dishwasher, and natural gas space heating. Strategies were developed for applying demand-limit and time-of-day controls on rooftop air-conditioning units, refrigeration equipment, ventilation equipment, and a dishwasher electric booster heater. This study was conducted over a one-year period using a week-on/week-off test procedure in which the energy management controls were in operation alternately for one week and then manually disconnected for the following week. This testing method was chosen to reduce the effects of changes in the business operating procedures, changes in the connected electrical loads and irregularities in the climate that tend to distort results based on a year-to-year comparison. Extensive instrumentation was installed to monitor the operation of controlled loads, the impact on the space temperature, the operation of overrides and limit controls on critical loads, peak electric demand, and total energy consumption. The study demonstrated that electric demand charges were reduced 19.7% and that electric energy usage charges were reduced 8.7%. The total annual savings was $2440 which represented a 13% savings on the total energy bill and a 48% return-on-investment on a system installed cost of $5083.

  20. Switching Graphs Jan Friso Groote

    E-Print Network [OSTI]

    Groote, Jan Friso

    Switching Graphs Jan Friso Groote J.F.Groote@tue.nl Bas Ploeger S.C.W.Ploeger@tue.nl Department The Netherlands Abstract Switching graphs are graphs containing switches. By using boolean functions called switch settings, these switches can be put in a fixed direction to obtain an ordinary graph. For many problems

  1. Graph Automatic Semigroups Rachael Carey

    E-Print Network [OSTI]

    St Andrews, University of

    Graph Automatic Semigroups Rachael Carey NBSAN St Andrews 22/04/2015 Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Regular languages An alphabet is a set of symbols.The elements are accepted by finite state automata. Rachael Carey NBSAN St Andrews Graph Automatic Semigroups #12;Graph

  2. A Characterization of Seymour Graphs

    E-Print Network [OSTI]

    Kostochka, Alexandr V.

    A Characterization of Seymour Graphs A. A. Ageev and A. V. Kostochka,* INSTITUTE OF MATHEMATICS undirected graph G is called a Seymour graph if the maximum number of edge disjoint T-cuts is equal to be subfamilies of Seymour graphs (Seymour J. Comb. Theory B 49 (1990), 189­222; Proc. London Math. Soc. Ser. (3

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

    E-Print Network [OSTI]

    Lee, Kwang Jun

    2006-10-30

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

  4. MGT 511-115 Managing Operations and Services Instructor: Dr. E. Gordon DeMeritt, MBA, Ph.D.

    E-Print Network [OSTI]

    Diestel, Geoff

    A study of concepts, models and methods used to effectively manage the manufacturing and/or service) Explain how a production pull system works. b) Summarize important attributes of a lean supply chain) Describe sales and operations planning between manufacturing, logistics, and marketing. Week 12, Chapter

  5. Tenant Guidelines National Park Service and the U.S. Department of Energy, Federal Energy Management Program

    E-Print Network [OSTI]

    Diamond, Richard

    Management Program for Energy-Efficient Renovation of Buildings at the Presidio of San Francisco #12Tenant Guidelines National Park Service and the U.S. Department of Energy, Federal Energy;Guidelines for Energy Efficiency at the Presidio of San Francisco Acknowledgments This document was prepared

  6. A Graph Bottleneck Inequality

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2008-01-01

    For a weighted multidigraph, let $f_{ij}$ be the total weight of spanning converging forests that have vertex $i$ in a tree converging to $j$. We prove that $f_{ij}f_{jk}=f_{ik}f_{jj}$ if and only if every directed path from $i$ to $k$ contains $j$ (a graph bottleneck equality). Otherwise, $f_{ij}f_{jk}inequality). In a companion paper, this inequality provides the foundation for the construction of a new family of graph distances by ensuring the fulfillment of the triangle inequality. This stems from the fact that the graph bottleneck inequality is a multiplicative analogue of the triangle inequality for proximities.

  7. Graph similarity and matching

    E-Print Network [OSTI]

    Zager, Laura (Laura A.)

    2005-01-01

    Measures of graph similarity have a broad array of applications, including comparing chemical structures, navigating complex networks like the World Wide Web, and more recently, analyzing different kinds of biological data. ...

  8. Graph Grammars Matilde Marcolli

    E-Print Network [OSTI]

    Marcolli, Matilde

    to computer science, Lecture Notes in Computer Science, Vol. 532, Springer, 1990. G. Rozenberg, Handbook Grammars H. Ehrig, K. Ehrig, U. Prange, G. Taentzer, Fundamentals of algebraic graph transformation. New

  9. An Experiment on Graph Analysis Methodologies for Scenarios

    SciTech Connect (OSTI)

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

    2005-09-30

    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.

  10. Chattopadhyay, A.; Prabhu, B.S.; Gadh, R.; , "Web based RFID asset management solution established on cloud services," RFID-Technologies and Applications (RFID-

    E-Print Network [OSTI]

    California at Los Angeles, University of

    ://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6068652&isnum ber=6068591 #12;Web based RFID Asset Management Solution established on Cloud Services and a cloud based web service supported by a web based user interface, eliminating the role of the former of the RFID reader based Reader Resident Application and the Reader Web Service for both large scale tag

  11. Operations Management oversees all activities directly related to making a product or providing a service. This functional area is responsible for

    E-Print Network [OSTI]

    Calgary, University of

    are produced forecast future demand for goods and services manage logistics and supply chains (the movement of materials, equipment, energy, information, and human skills into goods and services that satisfy customer dynamic sectors such as energy, transportation, financial services, and manufacturing. This is an area

  12. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    & Web Services Responsibility: Vice President and Chief Information Officer MULTIMEDIA & WEB SERVICES Responsibilities Multimedia & Web Services provides products, services and expertise in the following areas of Graphics, Photography, Web Design and programming in support of the missions of the Health Science Center

  13. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2003

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    ). · No extension or retransmission of computer network services by installation of a router, switch, hub, wireless

  14. Services

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory ofDidDevelopment Top Scientific Impact SinceService and Repair

  15. Session I--Communication of GIS Data in Fire Management--Boykin and others USDA Forest Service Gen. Tech. Rep. PSW-GTR-189. 2008. 209

    E-Print Network [OSTI]

    Session I-- Communication of GIS Data in Fire Management--Boykin and others USDA Forest Service Gen. Tech. Rep. PSW-GTR-189. 2008. 209 Communication and Implementation of GIS Data in Fire Management Remotely sensed data and Geographical Information Systems (GIS) can be an effective tool in fire management

  16. Procedure for Managing Account Information at Parking Online 1. Go to Parking Services webpage at http://www.uaf.edu/parking.

    E-Print Network [OSTI]

    Ickert-Bond, Steffi

    Procedure for Managing Account Information at Parking Online 1. Go to Parking Services webpage Add an Address and fill in asterisked information and select Submit Manage Your Email Addresses Select Add an Address and fill in asterisked information and select Submit Manage Your Vehicles Select

  17. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    Effective: June 2000 Section 5.4 Educational Media Resources Revised: March 2006 Policy 5.4.2 Service from production divisions may be initiated by submitting the Educational Media Resources Service will be recorded on the Educational Media Resources Service Request Authorization; a copy will be returned

  18. Phylogenetic Toric Varieties on Graphs 

    E-Print Network [OSTI]

    Buczynska, Weronika J.

    2010-10-12

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

  19. Open Graphs and Computational Reasoning 

    E-Print Network [OSTI]

    Dixon, Lucas; Ross, Duncan; Aleks, Kissinger

    2010-01-01

    We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface ...

  20. Subdominant pseudoultrametric on graphs

    SciTech Connect (OSTI)

    Dovgoshei, A A; Petrov, E A

    2013-08-31

    Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)?R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k?2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.

  1. Temporal Representation in Semantic Graphs

    SciTech Connect (OSTI)

    Levandoski, J J; Abdulla, G M

    2007-08-07

    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.

  2. Self-testing graph states

    E-Print Network [OSTI]

    Matthew McKague

    2010-10-11

    We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.

  3. Geometry of graph varieties

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2003-01-01

    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 355, Number 10, Pages 4151{4169 S 0002-9947(03)03321-X Article electronically published on May 15, 2003 GEOMETRY OF GRAPH VARIETIES JEREMY L. MARTIN Abstract. A picture P of a graph G =(V...;E) consists of a point P(v)foreach vertex v2V and a line P(e)foreachedgee2E, all lying in the projective plane over a eld k and subject to containment conditions corresponding to incidence in G.Agraph variety is an algebraic set whose points parametrize...

  4. 226 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 9, NO. 3, SEPTEMBER 2012 Mobility Management in Wireless Mesh Networks

    E-Print Network [OSTI]

    Cao, Yong

    forwarding schemes, as well as traditional tunnel- based location management schemes. Index Terms has one or more gateways that are special MRs connected to the Internet. The set of MRs forms

  5. Ramsey Minimal Graphs Bela Bollobas

    E-Print Network [OSTI]

    Kohayakawa, Yoshiharu

    Ramsey Minimal Graphs B´ela Bollob´as Department of Mathematical Sciences University of Memphis of the edges of contains a red copy of G or a blue copy of H. A pair of graphs (G, H) is said to be Ramsey- connected graph that does not contain induced cycles of length at least , then the pair (Ck , H) is Ramsey

  6. Densities in graphs and matroids 

    E-Print Network [OSTI]

    Kannan, Lavanya

    2009-05-15

    Certain graphs can be described by the distribution of the edges in its subgraphs. For example, a cycle C is a graph that satisfies |E(H)| |V (H)| < |E(C)| |V (C)| = 1 for all non-trivial subgraphs of C. Similarly, a tree T is a graph that satisfies...

  7. Establishing an inventory management process to meet high customer service levels in a vaccines organization

    E-Print Network [OSTI]

    Wonsowicz, Johanna Christine

    2010-01-01

    Inventory management is a complex aspect of Supply Chain Management that is frequently discussed and debated due to the fact that it has a high impact on customer satisfaction as well as financial performance. This thesis ...

  8. Moving Core Services to the Edge in NGNs for Reducing Managed Infrastructure Size

    E-Print Network [OSTI]

    Amir, Yair

    % for CAPEX, while OPEX remains fairly stable due to network management and energy costs. At the same time we

  9. HEALTH SCIENCE CENTER HANDBOOK OF OPERATING PROCEDURES Chapter 5 Information Management & Services Effective: June 2000

    E-Print Network [OSTI]

    Nicholson, Bruce J.

    & Web Services provides interactive multimedia production, medical illustration, Web design by visiting our Web site at: http://ims.uthscsa.edu/ Page 1 of 1 #12;

  10. Amplifying Real Estate Value through Energy & Water Management: From ESCO to "Energy Services Partner"

    E-Print Network [OSTI]

    Mills, Evan

    2004-01-01

    Service Companies among Real Estate Investment Trusts. ”Investor Returns: The Real Estate Sector. ” InnovestAmplifying Real Estate Value through Energy & Water

  11. The Hartree Centre's on-demand high performance computing (HPC) service, enCORE, managed by channel partners OCF, has enabled

    E-Print Network [OSTI]

    The Hartree Centre's on-demand high performance computing (HPC) service, enCORE, managed by channel that create insights and value using high performance computing, big data analytics, simulation and modelling

  12. Quantum chaos on discrete graphs

    E-Print Network [OSTI]

    Uzy Smilansky

    2007-04-26

    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}.

  13. Future personal attributes and job competencies needed by the Texas Department of State Health Services (DSHS), state hospital section, registered nurse managers: a Delphi study 

    E-Print Network [OSTI]

    Harrison, Joseph, Jr.

    2005-11-01

    -1 FUTURE PERSONAL ATTRIBUTES AND JOB COMPETENCIES NEEDED BY THE TEXAS DEPARTMENT OF STATE HEALTH SERVICES (DSHS), STATE HOSPITAL SECTION, REGISTERED NURSE MANAGERS: A DELPHI STUDY A Dissertation by JOSEPH HARRISON, JR. Submitted to the Office of Graduate... ? 2005 JOSEPH HARRISON, JR. ALL RIGHTS RESERVED FUTURE PERSONAL ATTRIBUTES AND JOB COMPETENCIES NEEDED BY THE TEXAS DEPARTMENT OF STATE HEALTH SERVICES (DSHS), STATE HOSPITAL SECTION, REGISTERED NURSE MANAGERS: A DELPHI STUDY A Dissertation...

  14. Congestion pricing applications to manage high temporal demand for public services and their relevance to air space management

    E-Print Network [OSTI]

    Hoffman, Karla

    carbon emissions, and creating new urban living spaces. We next examine other applications of congestion and their relevance to air space management Karla Hoffman a,n , Frank Berardino b , George Hunter c a George Mason, and peak use of energy resources. The paper ends with a proposal for a two-staged approach

  15. Quality Services: Solid Wastes, Parts 370-376: Hazardous Waste Management System (New York)

    Broader source: Energy.gov [DOE]

    These regulations prescribe the management of hazardous waste facilities in New York State. They identify and list different types of hazardous wastes and describe standards for generators,...

  16. The University of Texas at Austin Management of UTnet Wireless Access Policy Office of the Chief Information Officer Written By: Information Technology Services

    E-Print Network [OSTI]

    Patzek, Tadeusz W.

    The University of Texas at Austin Management of UTnet Wireless Access Policy Office of the Chief Information Officer Written By: Information Technology Services ­ Networking;Information Security Office Document Version: Approved Last Edited: 3/4/2011 1 Management of UTnet Wireless Access Policy 1

  17. Finite Prime Distance Graphs and 2-Odd Graphs Joshua D. Laison, Colin Starr, and Andrea Walker

    E-Print Network [OSTI]

    Laison, Josh

    that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper, Vinogradov's Theorem, and Ramar´e's Theorem, respectively; and we show that Dutch windmill graphs and paper

  18. 603USDA Forest Service Gen. Tech. Rep. PSW-GTR-160. 1997. Management of California Oak

    E-Print Network [OSTI]

    dynamics of the natural resource system. Effects on natural resource systems are typically valued in terms in evaluating alternative oak woodland policy actions. The management of natural resources is the topic of numerous academic journals, and hundreds of books and popular articles. Natural resource management has

  19. The graph bottleneck identity

    E-Print Network [OSTI]

    Chebotarev, Pavel

    2010-01-01

    A matrix $S=(s_{ij})_{n\\times n}$ is said to determine a \\emph{transitional measure} for a digraph $\\Gamma$ on $n$ vertices if for all $i,j,k\\in\\{1,...,n\\},$ the \\emph{transition inequality} $s_{ij}s_{jk}\\le s_{ik}s_{jj}$ holds and reduces to the equality (called the \\emph{graph bottleneck identity}) if and only if every path in $\\Gamma$ from $i$ to $k$ contains $j$. We show that every positive transitional measure produces a distance by means of a logarithmic transformation. Moreover, the resulting distance $d(\\cdot,\\cdot)$ is \\emph{graph-geodetic}, that is, $d(i,j)+d(j,k)=d(i,k)$ holds if and only if every path from $i$ to $k$ contains $j$. Five types of matrices that determine transitional measures for a strong digraph are considered, namely, the matrices of path weights, connection reliabilities, route weights, and the weights of in-forests and out-forests. The results obtained have undirected counterparts. In [P. Chebotarev, A family of graph distances generalizing both the shortest-path and the resistan...

  20. Audit Report on Management Controls over the Use of Service Contracts at the Office of River Protection

    SciTech Connect (OSTI)

    None

    2009-04-01

    The Department of Energy's (Department) Office of River Protection (ORP) is responsible for the storage, treatment, and disposal of over 53 million gallons of highly radioactive waste from over 40 years of plutonium production at the Hanford Site. Because of the diversity, complexity, and large scope of its mission, coupled with its small staff, ORP told us that it has found it necessary to engage in service contracts to obtain consulting services, technical expertise, and support staff. Federal policy generally permits contractors to perform a wide range of support service activities, including, in most situations, the drafting of Government documents subject to the review and approval of Federal employees. Federal policy issued by the Office of Management and Budget, however, prohibits contractors from drafting agency responses to Congressional inquiries and reports issued by the Office of Inspector General and Government Accountability Office (GAO) because they are so closely related to the public interest and provide the appearance of private influence. To provide a majority of its needed services, ORP issued a Blanket Purchase Agreement to Project Assistance Corporation (PAC) in 2003. Through the Blanket Purchase Agreement, ORP acquired services in the areas of project management, risk assessment, program assessment, quality assurance, safety, cost and schedule estimating, budgeting and finance, and engineering. PAC has, in turn, subcontracted with various other firms to obtain some of the services needed by ORP. From 2005 to 2008, the total annual cost for the contract with PAC had grown from $4.7 million to $9.2 million. Because of the extent of the services provided and growing costs of the contract, we conducted this review to determine whether ORP appropriately administered its contract with the Project Assistance Corporation. Our review disclosed that, in some instances, ORP had not appropriately administered all work performed under the PAC contract. Specifically, ORP allowed PAC employees to perform work that was inherently governmental and created situations where a potential conflict of interest occurred. Specifically: (1) ORP assigned PAC employees responsibility for providing information and responses to Congressional inquiries and reports issued by the GAO and the Department of Energy's Office of Inspector General (OIG); and (2) PAC employees were also allowed to perform functions that created potential conflicts of interest. ORP permitted PAC employees, for example, to develop statements of work and approve funding of work to be performed under PAC's own contract. We concluded that these problems occurred, at least in part, because ORP had not established controls necessary to effectively administer the PAC contract. Federal procurement regulations recommended that agencies provide additional management controls over contractors whose work has the potential to influence the action of government officials. ORP, however, had not implemented the controls specifically recommended in Federal policy guidance for administering contracts, including: (1) Performing conflict of interest reviews; and (2) Separating contractor and Department employees either physically or organizationally. By not effectively administering its contract with PAC, ORP increased the risk that decisions based on work performed by the contractor may not have been made in the best interests of the Department. For example, ORP increased the risk that approved work would be unnecessary or too costly. As we also recently noted in our report on 'Management Challenges at the Department of Energy' (DOE/IG-0808, December 2008), contract administration issues such as those discussed in this report remain a significant vulnerability. Continued efforts to improve this area are vitally important since the risk that contractors receive payments for unallowable costs could also increase as the Department expands its contracting activities under the American Recovery and Reinvestment Act. To its credit, however, ORP has recognized that there are weakn

  1. Adventures in Graph Ramsey Theory /

    E-Print Network [OSTI]

    Parrish, Andrew T.

    2013-01-01

    1.1 Additive Ramsey theory . . . . . . . . . . .3.1 Large Ramsey . . . . . . . . . . . . . . .additive- and graph-Ramsey theory 1.3 The compactness

  2. Office of Inspector General audit report on aircraft and air service management programs

    SciTech Connect (OSTI)

    NONE

    1999-01-01

    The Department of Energy`s (DOE) Albuquerque Operations Office (Albuquerque) owns seven aircraft that support defense programs, research and development efforts, emergency response programs, and official travel of Government and contractor employees. An Office of Inspector General (OIG) report, issued in 1994, identified concerns with Albuquerque`s cost for air service. Since that report, there have been reductions in cost and personnel indicating changes in air service requirements. This audit was conducted to determine (1) whether costs to operate Albuquerque`s aircraft were excessive and (2) if individual aircraft in the fleet were justified.

  3. Business Services | Jefferson Lab

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

    products and services that support the lab's overall mission. Managing the lab's vendor process is the Procurement & Services department. The department is dedicated to the...

  4. Laplacian spectral characterization of products of complete graphs with trees, unicyclic graphs, and bicyclic graphs

    E-Print Network [OSTI]

    Wang, Suijie

    2010-01-01

    In this paper, we give a Laplacian characterization of the product of the complete graphs $K_m$ with trees, unicyclic graphs, and bicyclic graphs. More precisely, let $G$ be a connected graph with at most two independent cycles. If $G$ is neither $C_{6}$ nor $\\Theta_{3,2,5}$ and determined by its Laplacain spectrum, then the product $G\\times K_{m}$ is also a graph determined by its Laplacian spectrum. In addition, we find the cosepctral graphs of $C_{6}\\times K_{m}$ and $\\Theta_{3,2,5}\\times K_{m}$, where the case $m=1$ is shown in Figure \\ref{F1} and \\ref{F2}.

  5. Share this with To learn more about SAP Application Management Services,

    E-Print Network [OSTI]

    Fisher, Kathleen

    . Built around fixed costs and timelines, this offering jumpstarts your SAP projects and quickly moves you manner Product Brief Potential Benefits · Fast and efficient access to SAP systems and infrastructure Services for SAP Jumpstart your SAP projects with a rapid, flexible infrastructure at a predictable price

  6. Graph Algorithms in the Internet Age

    E-Print Network [OSTI]

    Stanton, Isabelle Lesley

    2012-01-01

    5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1

  7. Chromatic scheduling of dynamic data-graph computations

    E-Print Network [OSTI]

    Kaler, Tim (Tim F. S.)

    2013-01-01

    Data-graph computations are a parallel-programming model popularized by programming systems such as Pregel, GraphLab, PowerGraph, and GraphChi. A fundamental issue in parallelizing data-graph computations is the avoidance ...

  8. Constrained Ramsey Numbers of Graphs

    E-Print Network [OSTI]

    Jiang, Tao

    Constrained Ramsey Numbers of Graphs Robert E. Jamison,1 Tao Jiang,2* and Alan C. H. Ling3 1-like trees. � 2002 Wiley Periodicals, Inc. J Graph Theory 42: 1­16, 2003 Keywords: Ramsey; monochromatic edges have the same color and rainbow iff all of its edges have different colors. In classical Ramsey

  9. Managing Application Level Quality of Service through TOMTEN R. De Silva**

    E-Print Network [OSTI]

    Landfeldt, Bjorn

    : the application, the communication sub-system and the network. Application flexibility is provided by allowing With the growth of mobile computing, users will have simultaneous access to multiple overlaid networks, each Of Transmissions for the ENd-user), a framework for managing resources in both this type of environment as well

  10. Access this brochure and other information Management (OTM), our services, and much

    E-Print Network [OSTI]

    Lee, Dongwon

    : 113 Technology Center Building University Park, PA 16802 Phone: 814-865-6227 email: otm@psu.edu The goal of the new approach to the management of intellectual property ("IP") in industry-spon- sored research agreements is to give Penn State re- searchers and their industry counter parts the op- portunity

  11. Recent Developments in the Management of Cameco Corporation's Fuel Services Division Waste - 13144

    SciTech Connect (OSTI)

    Smith, Thomas P.

    2013-07-01

    Cameco Corporation is a world leader in uranium production. Headquartered in Saskatoon, Saskatchewan our operations provide 16% of the world uranium mine production and we have approximately 435 million pounds of proven and probable uranium reserves. Cameco mining operations are located in Saskatchewan, Wyoming, Nebraska and Kazakhstan. Cameco is also a major supplier of uranium processing services required to produce fuel for the generation of clean energy. These operations are based in Blind River, Cobourg and Port Hope, Ontario and are collectively referred to as the Fuel Services Division. The Fuel Services Division produces uranium trioxide from uranium ore concentrate at the Blind River Refinery. Cameco produces uranium hexafluoride and uranium dioxide at the Port Hope Conversion Facility. Cameco operates a fuel manufacturing facility in Port Hope, Ontario and a metal fabrication facility located in Cobourg, Ontario. The company manufactures fuel bundles utilized in the Candu reactors. Cameco's Fuel Services Division produces several types of low-level radioactively contaminated wastes. Internal processing capabilities at both the Blind River Refinery and Port Hope Conversion Facility are extensive and allow for the recycling of several types of waste. Notwithstanding these capabilities there are certain wastes that are not amenable to the internal processing capabilities and must be disposed of appropriately. Disposal options for low-level radioactively contaminated wastes in Canada are limited primarily due to cost considerations. In recent years, Cameco has started to ship marginally contaminated wastes (<500 ppm uranium) to the United States for disposal in an appropriate landfill. The landfill is owned by US Ecology Incorporated and is located near Grand View, Idaho 70 miles southeast of Boise in the Owyhee Desert. The facility treats and disposes hazardous waste, non-hazardous industrial waste and low-activity radioactive material. The site's arid climate, deep groundwater and favourable geology help ensure permanent waste isolation. Combined with a state of the art multi-layer landfill liner system, the Grand View facility represents an ideal choice to minimize environmental liability. Marginally contaminated wastes from operations within the Fuel Services Division are typically loaded into PacTec IP-2 rated Intermediary Bulk Containers and then transported by road to a nearby rail siding. The Intermediary Bulk Containers are then loaded in US Ecology owned gondola rail-cars. The gondolas are then transported via Canadian Pacific and Union Pacific railroads to the US Ecology Rail Transfer facility located in Mayfield, Idaho. The Intermediary Bulk Containers are unloaded into trucks for transport to the disposal facility located approximately 32 miles away. (authors)

  12. Random rectangular Graphs

    E-Print Network [OSTI]

    Estrada, Ernesto

    2015-01-01

    A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square \\left[0,1\\right]^{2}. The topological properties, such as connectivity, average degree, average path length and clustering, of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b=1/a, and the radius r used to connect the nodes. When a=1 we recover the RGG, and when a\\rightarrow\\infty the very elongated rectangle generated resembles a one-dimensional RGG. We provided computational and analytical evidence that the topological properties of the RRG differ significantly from those of the RGG. The connectivity of the RRG depends not only on the number of nodes as in the case of the RGG, but also on the side length of the rectangle. As the rectangle is more elongated the critical radius for connectivity increases following first a power-law an...

  13. INFORMATION TECHNOLOGY SERVICES CRM Self Service Training

    E-Print Network [OSTI]

    INFORMATION TECHNOLOGY SERVICES CRM Self Service Training Adding a Case Service Management Technology Services | its.fsu.edu | 2 #12;4. Select a Case Type 5. Select a Category that describes | Information Technology Services | its.fsu.edu | 3 #12;

  14. A History of the Environmental Management Advisory Board: 20 Years of Service and Partnership - 13219

    SciTech Connect (OSTI)

    Ellis, Kristen; Schmitt, Elizabeth

    2013-07-01

    The Environmental Management Advisory Board (EMAB or Board) was chartered under the Federal Advisory Committee Act (FACA) in 1992 to provide the Assistant Secretary for Environmental Management (EM) with independent and external advice, information, and recommendations on corporate issues relating to accelerated site clean-up and risk reduction throughout the EM complex. Over the course of the past 20 years, the composition and focus of the Board have varied widely to address the changing needs of the program. EMAB began as the Environmental Restoration and Waste Management Advisory Committee, formed to provide advice on an EM Programmatic Environmental Impact Statement. In 1994, the Board was restructured to function more as an executive-level, limited member advisory board whose membership provides insight of leading industry experts and the viewpoints of representatives from critical stakeholder constituencies. Throughout the 20 years of its existence, EMAB has covered a wide variety of topics and produced nearly 200 recommendations. These recommendations have resulted in several policy changes and improvements within EM. Most recently, EMAB has been credited for its contribution to the EM Energy Park Initiative, forerunner of the DOE Asset Revitalization Initiative; creation of the EM Offices of Communications and External Affairs; improvement of acquisition and project management strategies and culture; and several recommendations related to the Waste Treatment Plant and the tank waste programs at Hanford and the Savannah River Site. The wealth of experience and knowledge the Assistant Secretary can leverage through utilization of the Board continues to support fulfillment of EM's mission. In commemoration of EMAB's 20. anniversary, this paper will provide further context for the evolution of the Board, the role FACA plays in its administration, and a look at the members' current objectives and EM's expectations for the future. (authors)

  15. Amplifying Real Estate Value through Energy&WaterManagement: From ESCO to 'Energy Services Partner'

    SciTech Connect (OSTI)

    Mills, Evan

    2004-06-08

    The energy service company (ESCO) business model could become significantly more effective by integrating the energy-efficiency purveyor and their capital into the underlying building ownership and operation partnership, rather than the current model in which the ESCO remains an outsider with higher transaction costs and limited interest and participation in the value created by the cost savings. Resource conservation advocates rarely use the language of real estate to articulate the cost effectiveness of capital improvements aimed at reducing utility costs in commercial and residential income properties. Conventional methods that rely on rarefied academic notions of simple payback time or a narrow definition of return on investment fail to capture a significant component of the true market value created by virtue of reduced operating expenses. Improvements in energy and water efficiency can increase the fundamental profitability of real estate investments by raising Net Operating Income (NOI), and hence returns during the holding period, and, ultimately, proceeds at time of sale. We introduce the concept of an Energy Services Partner, who takes an equity interest in a real estate partnership in exchange for providing the expertise and capital required to reduce utility operating costs. Profit to all partners increases considerably as a result. This approach would also help to address a crisis facing ESCOs today stemming from their considerable liabilities (through guaranteed savings) and negligible offsetting assets.

  16. Contagious Sets in Random Graphs Uriel Feige

    E-Print Network [OSTI]

    Contagious Sets in Random Graphs Uriel Feige Michael Krivelevich Daniel Reichman August 10, 2014. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random graph G := G(n, p

  17. A Study on Set-Graphs

    E-Print Network [OSTI]

    Johan Kok; K. P. Chithra; N. K. Sudev; C. Susanth

    2015-04-09

    A \\textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of primitive holes incident on the vertex $v$. In this paper, we introduce the notion of set-graphs and study the properties and characteristics of set-graphs. We also check the primitive hole number and primitive degree of set-graphs. Interesting introductory results on the nature of order of set-graphs, degree of the vertices corresponding to subsets of equal cardinality, the number of largest complete subgraphs in a set-graph etc. are discussed in this study. A recursive formula to determine the primitive hole number of a set-graph is also derived in this paper.

  18. Rainbow Connection Number of Graph Power and Graph Products

    E-Print Network [OSTI]

    Basavaraju, Manu; Rajendraprasad, Deepak; Ramaswamy, Arunselvan

    2011-01-01

    Rainbow connection number, $rc(G)$, of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. In this paper we study the rainbow connection number with respect to three important graph product operations (cartesian product, lexicographic product and strong product) and the operation of graph powering. More specifically we show the following: (Here, $r(G)$ denotes the radius of $G$, an obvious lower bound for $rc(G)$) (1.) For a connected graph $G$, let $G^{k}$ be the k-th power of $G$. We show that for $k \\ge 2$, $r(G^{k}) \\le rc(G^{k}) \\le 2r(G^{k}) + 1$. The upper bound is tight up to an additive constant of 1. (2.) For two-connected, non-trivial graphs $G$ and $H$, let $G \\Box H$ be the Cartesian Product of $G$ and $H$. We show that $r(G \\Box H) \\le rc(G \\Box H)$ $\\le$ $2r(G \\Box H)$. The bound is tight. (3.) For two graphs $G$ and $H$ such that $G$ is a connected, non-trivia...

  19. EIS-0442: Reauthorization of Permits, Maintenance, and Vegetation Management on Western Area Power Administration Transmission Lines on Forest Service Lands, Colorado, Nebraska, and Utah

    Broader source: Energy.gov [DOE]

    This EIS is being prepared jointly by DOE’s Western Area Power Administration and the U.S. Forest Service. The EIS evaluates the potential environmental impacts of Western’s proposed changes to vegetation management along its transmission line rights-of-way on National Forest System lands in Colorado, Utah, and Nebraska.

  20. 334 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 8, NO. 4, DECEMBER 2011 Phoenix: A Weight-Based Network Coordinate

    E-Print Network [OSTI]

    Fu, Xiaoming

    334 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 8, NO. 4, DECEMBER 2011 Phoenix with Euclidean distance based NC systems. In this paper, we propose an NC system, so-called Phoenix, which is based on the matrix factorization model. Phoenix introduces a weight to each reference NC and trusts

  1. 38 Chapteri - Functions and Graphs

    E-Print Network [OSTI]

    a) Predict the pollution in 2007, 2010, and 2020. b) Graph the function over the interval [0, 50]. At most, how many y-intercepts can a function have? Explain.

  2. Approximate Graph Products Marc Hellmutha

    E-Print Network [OSTI]

    Stadler, Peter F.

    Approximate Graph Products Marc Hellmutha , Wilfried Imrichb , Werner Kl¨ocklb , Peter F. Stadlera or fingers) can vary independently of other traits, or Email addresses: marc@bioinf.uni-leipzig.de (Marc

  3. Doing time : inducing temporal graphs

    E-Print Network [OSTI]

    Bramsen, Philip James

    2006-01-01

    We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The ...

  4. Analysis of Assembly 264 - Amended: Pediatric Asthma Self-Management Training and Education Services for Children at High Risk

    E-Print Network [OSTI]

    California Health Benefits Review Program (CHBRP)

    2006-01-01

    cover services. Seven trials assessed group classes providedcover services. Seven trials assessed group classes providedclasses provided to groups of five to seven children and

  5. Use of Management and Operating or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C., Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2003-10-29

    To establish policies and procedures for management of DOE, including NNSA, Management and Operating (M&O) and other facility management contractor employees assigned to the Washington, D.C., area. Cancels DOE O 350.2.

  6. Use of Management and Operating or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C. Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2015-05-18

    The Order establishes policies and procedures for managing DOE and NNSA management and operating (M&O) contractors and other facility management contractor employees assigned to the Washington, D.C., area.

  7. INFORMATION TECHNOLOGY SERVICES CRM Self Service Training

    E-Print Network [OSTI]

    INFORMATION TECHNOLOGY SERVICES CRM Self Service Training Editing a Case Service Management showing the case details Florida State University | Information Technology Services | its.fsu.edu | 2 #12 the Notes and Attachments tab. A new window will open Florida State University | Information Technology

  8. Some algorithmic results in graph imbeddings 

    E-Print Network [OSTI]

    Joshi, Sanjay

    1990-01-01

    , is constructed by: 1. joining vertez us in graph G to vertez vr in H by an edge b, and 8. joining vertez uq in graph G to vertez vq in H by an edge V. The figure 2. 2 on the following page shows the double bar amalgamation of graphs Gq and Gq. We select a... vertex pair (un u2) in the graph Gq which are connected by an edge and similar vertex pair (vr, vq) on the graph Gz. The connecting bars b and b' join these two graphs at the selected vertices. 93 From the previous lemmas we can now prove, the mair...

  9. North Carolina/Minerals Management Service technical workshop on Manteo Unit exploration held on February 4--5, 1998

    SciTech Connect (OSTI)

    Vigil, D.L.

    1998-05-01

    The US Department of Interior`s Minerals Management Service (MMS) has the responsibility of regulating exploration and development by the oil and gas industry on the US Outer Continental Shelf (OCS). There is an area of active leases approximately 45 miles east-northeast of Cape Hatteras, North Carolina, referred to as the Manteo Unit. Chevron U.S.A. may propose to drill a single exploratory well in either Block 467 or 510 of the Manteo Unit with a specially outfitted drilling rig. To review environmental and socioeconomic information known, and needed, on the Manteo Unit, a workshop was conducted of February 4--5, 1998, with the North Carolina Department of Environment and Natural Resources (DENR). The objectives of the workshop were to review the state of knowledge for drilling a single exploratory well in either Block 467 or 510; share scientific information obtained since 1990; distinguish between exploration and development activities; share information on drilling technology and industry experience operating in similar physical environments; address scientific concerns regarding the potential impacts of OCS drilling on biological resources; and address concerns regarding onshore (social and economic) impacts from OCS drilling.

  10. Exploring the Graph of Graphs: Network Evolution and Centrality Distances

    E-Print Network [OSTI]

    Pignolet, Yvonne Anne; Schmid, Stefan; Tredan, Gilles

    2015-01-01

    The topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks. However, surprisingly little is known today about models to compare complex graphs, and quantitatively measure their similarity and dynamics. In the past a variety of node centralities, i.e., functions which assign values to nodes to represent their importance in the graph. Based on such centralities we propose a natural similarity measure for complex networks: the centrality distance $d_C$, the difference between two graphs with respect to a given node centrality $C$. Centrality distances can take the specific roles of the different nodes in the network into account, and have many interesting applications. As a case study, we investigate the evolution of networks with respect to centrality distances and their approximations based on closeness, betweenness, pagerank, clustering and degree cen...

  11. Detecting Tampering in Random Graphs

    E-Print Network [OSTI]

    Pinsky, Ross G

    2012-01-01

    Let $\\mathcal{G}_n=(V_n,E_n)$ be a growing sequence of deterministic finite graphs, with $V_n$ denoting the vertices and $E_n$ denoting the edges. Consider the random graph $\\mathcal{G}_n(p_n)=(V_n, E_n(p_n))$ obtained by including any given edge with probability $p_n$, independent of other edges, and let $P_n^{p_n}$ denote the corresponding probability measure on $\\mathcal{G}_n$. Now tamper with the random graph in some regular way. For example, if $\\mathcal{G}_n$ is the complete graph on $n$ vertices, so that $\\mathcal{G}_n(p_n)$ is the Erdos-Renyi graph, then one might tamper with it by disconnecting all the edges of a randomly chosen vertex, or by adding all the edges of a randomly chosen Hamiltonian path from $\\mathcal{G}_n$, or by adding all the edges of a randomly chosen clique of order $k_n$ from $\\mathcal{G}_n$. Denote the resulting induced measure on $\\mathcal{G}_n$ by $P_n^{p_n,\\text{tamper}}$. The tampering is called \\it detectable\\rm\\ if $\\lim_{n\\to\\infty}||P_n^{p_n,\\text{tamper}}-P_n^{p_n}||_{\\t...

  12. On the Recognition of Four-Directional Orthogonal Ray Graphs

    E-Print Network [OSTI]

    Felsner, Stefan

    class of graphs is also known as grid intersection graphs (GIG), see [9]. The recognition of GIGs is NP

  13. Scale and differentiation in services : using information technologies to manage customer experiences at Harrah's Entertainment and other companies

    E-Print Network [OSTI]

    Mansharamani, Vikram, 1974-

    2007-01-01

    This dissertation is focused on the topic of service innovation and explores economies of scale and strategic differentiation in services via an inductive field-based case study of the world's largest casino gaming company, ...

  14. Decidability, Behavioural Equivalences and Infinite Transition Graphs 

    E-Print Network [OSTI]

    Hüttel, Hans

    This thesis studies behavioural equivalences on labelled infinite transition graphs and the role that they can play in the context of modal logics and notions from language theory. A natural class of such infinite graphs ...

  15. Optimization in Geometric Graphs: Complexity and Approximation 

    E-Print Network [OSTI]

    Kahruman-Anderoglu, Sera

    2011-02-22

    We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop ...

  16. Cops and Robber on Circulant Graphs

    E-Print Network [OSTI]

    Bonato, Anthony

    Edward Island #12;Cops and Robber Played on a finite, simple graph Cops have perfect information TwoCops and Robber on Circulant Graphs Shannon Fitzpatrick John Paul Larkin University of Prince

  17. management

    National Nuclear Security Administration (NNSA)

    5%2A en Management and Budget http:www.nnsa.energy.govaboutusouroperationsmanagementandbudget

  18. Use of Management and Operating or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C. Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2011-05-31

    To establish policies and procedures for management of Department of Energy (DOE), including National Nuclear Security Administration (NNSA), management and operating (M&O) and other facility management contractor employees assigned to the Washington, D.C. area. Supersedes DOE O 350.2A

  19. Minimal Spanning Trees with Conflict Graphs

    E-Print Network [OSTI]

    symmetric conflict relations by means of an undirected conflict graph, where ..... International Symposium on Mathematical Foundations of Computer. Science ...

  20. Some problems in Graph Ramsey Theory

    E-Print Network [OSTI]

    Grinshpun, Andrey Vadim

    2015-01-01

    A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs ...

  1. Semester Thesis Virus Inoculation on Social Graphs -

    E-Print Network [OSTI]

    Schmid, Stefan

    Semester Thesis Virus Inoculation on Social Graphs - The Friendship Factor Dominic Meier meierdo introduce friendship between neighbors while looking at a virus inoculation game which is played and in the star graph. #12;Virus Inoculation on Social Graphs - The Windfall of Friendship page 2 1 Introduction

  2. Effecting Parallel Graph Eigensolvers Through Library Composition

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    is not possible in general. Conventional linear algebra libraries cannot operate on graph data types. Likewise exploitation of this duality. Graph libraries and matrix libraries use different data types, and despiteEffecting Parallel Graph Eigensolvers Through Library Composition Alex Breuer, Peter Gottschling

  3. A heuristic algorithm for graph isomorphism 

    E-Print Network [OSTI]

    Torres Navarro, Luz

    1999-01-01

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

  4. The Joys of Graph Transformation Arend Rensink

    E-Print Network [OSTI]

    Rensink, Arend

    The Joys of Graph Transformation Arend Rensink Department of Computer Science, University of Twente, the things being changed are graphs. A fundamental assumption in studying such changes, the handbook [21] is a 1 #12;Figure 1: Two graphs with a matching good source); rather, we want to illustrate

  5. Director, Information Technology Services Office

    Broader source: Energy.gov [DOE]

    The mission of the information Technologies Services Office is to provide effective corporate management leadership to proactively identify and manage business system efficiency improvements and to...

  6. Facilities Management Services Policy

    E-Print Network [OSTI]

    to perform the work in accordance with FM standards, Building Codes, mandated Energy & Greening State and other consultants to prepare plans, program documents, life-cycle cost studies, energy analysis, code

  7. Facilities Management Services Policy

    E-Print Network [OSTI]

    Energy & Greening State Government requirements, and Health and Safety Regulations established by State and other consultants to prepare plans, program documents, life-cycle cost studies, energy analysis, code

  8. MANUFACTURING & SERVICE OPERATIONS MANAGEMENT

    E-Print Network [OSTI]

    Whitt, Ward

    ; employee turnover; churn; agent job satisfaction; compensation; autonomy; stress; stochastic models sat- isfaction, as evidenced by high turnover, referred to as churn (Cleveland and Hash 2004). There is good reason to believe that churn can be reduced (reten- tion can be increased) by increasing employee

  9. MANUFACTURING & SERVICE OPERATIONS MANAGEMENT

    E-Print Network [OSTI]

    Chiang, Wei-yu Kevin

    an upstream firm, as a result of charging a wholesale price above the marginal cost, induces its intermediary Dynamics and Channel Efficiency in Durable Product Pricing and Distribution Wei-yu Kevin Chiang College the single-period vertical price interaction in a manufacturer­retailer dyad to a multi- period setting

  10. Inf-2101 -Algoritmer Graph Search

    E-Print Network [OSTI]

    Bongo, Lars Ailo

    Inf-2101 - Algoritmer Graph Search John Markus Bjørndalen 2010-09-02 Some foils are adapted from the book and the book's homepage. John Markus Bjørndalen () Inf-2101 - Algoritmer 2010-09-02 1 / 25 #12 John Markus Bjørndalen () Inf-2101 - Algoritmer 2010-09-02 2 / 25 #12;Breadth-first search Depth

  11. STUDENT HEALTH MEDICAL SERVICES

    E-Print Network [OSTI]

    Huang, Haiying

    Ver 2.0 09/2012 ANNEX H STUDENT HEALTH & MEDICAL SERVICES #12;Ver 2.0 09/2012 H-i APPROVAL & IMPLEMENTATION Annex H Student Health & Medical Services This emergency management plan is hereby approved. ______________________________ ________________________ Robert Blum Date Director of Health Services Marie Bannister Date Director of Mental Health Services

  12. PROJECT MANAGEMENT Professional Organizations

    E-Print Network [OSTI]

    Acton, Scott

    PROJECT MANAGEMENT Professional Organizations: Association of Collegiate Computing Services) Project Management Institute (PMI) Events & Training: UVA Local Support Partners (LSP) program training Project Management Institute webinars Project Management Institute events Scrum Alliance events Learning

  13. Classification ofAttributes and Behavior in Risk Management Using Bayesian Networks

    E-Print Network [OSTI]

    Akl, Robert

    Classification ofAttributes and Behavior in Risk Management Using Bayesian Networks Ram Dantu path from the root to the end node suitable vulnerability analysis and risk management strategies-Attack Graphs, Behavior, Risk Management and risk management with these graph transitions. For many years

  14. Facebook Twitter LinkedIn Online Social Service

    E-Print Network [OSTI]

    Hung, Shih-Hao

    ­­ Facebook Twitter LinkedIn Online Social Service Social Network node edge graph corpus Facebook relational time-evolving Social Network Analysis, SNA Small Data Big Data 1960 1990 2000 Facebook Twitter 2014 Facebook 8 Application Programming Interface, API crawler Big Graph Data Mining Big Data Google

  15. Int. J. Business Process Integration and Management, Vol. 2, No. 1, 2007 9 Service adaptation through trace inspection

    E-Print Network [OSTI]

    Brogi, Antonio

    of Pisa, Pisa, 56127, Italy E-mail: popescu@di.unipi.it *Corresponding author Abstract: Service at the University of Pisa, Italy. His research interests include coordination and adaptation of software services. Razvan Popescu is pursuing PhD at the University of Pisa, working on aggregation and adaptation of (web

  16. MyLibrary@LANL: proximity and semi-metric networks for a collaborative and recommender web service.

    SciTech Connect (OSTI)

    Rocha, L. M. [Indiana Univ., Bloomington, IN (United States). School of Informatics and Cognitive Science Program; Simas, T. [Indiana Univ., Bloomington, IN (United States). School of Informatics and Cognitive Science Program; Rechtsteiner, A. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States). Modeling, Algorithms, and Informatics Group (CCS-3); DiGiacomo, M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States). Research Library; Luce, R. E. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States). Research Library

    2005-01-01

    We describe a network approach to building recommendation systems for a WWW service. We employ two different types of weighted graphs in our analysis and development: Proximity graphs, a type of Fuzzy Graphs based on a co-occurrence probability, and semi-metric distance graphs, which do not observe the triangle inequality of Euclidean distances. Both types of graphs are used to develop intelligent recommendation and collaboration systems for the MyLibrary@LANL web service, a user-centered front-end to the Los Alamos National Laboratory's (LANL) digital library collections and WWW resources.

  17. Lamplighter groups, de Bruijn graphs, spider-web graphs and their spectra

    E-Print Network [OSTI]

    Rostislav Grigorchuk; Paul-Henry Leemann; Tatiana Nagnibeda

    2015-05-05

    We describe the infinite family of spider-web graphs $S_{k,M,N }$, $k \\geq 2$, $M \\geq 1$ and $N \\geq 0$, studied in physical literature as tensor products of well-known de Brujin graphs $B_{k,N}$ and cyclic graphs $C_M$ and show that these graphs are Schreier graphs of the lamplighter groups $L_k = Z/kZ \\wr Z$. This allows us to compute their spectra and to identify the infinite limit of $S_{k,M,N}$, as $N, M \\to\\infty$, with the Cayley graph of the lamplighter group $L_k$.

  18. Service Level Agreement/Specification

    E-Print Network [OSTI]

    Flynn, E. Victor

    Service Level Agreement/Specification For Maintenance and Associated Risk Management Services Team c. Contract Labour 4. REACTIVE MAINTENANCE 5. ESTATE DATA REQUIREMENTS 6. ESTATE EMERGENCY. RISK MANAGEMENT a. General b. Scope of Service c. Statement of Intent Service Level Agreement 2007 Vers

  19. ORGANIZATION CHART FACILITIES SERVICES

    E-Print Network [OSTI]

    Maxwell, Bruce D.

    & Refrigeration Campus Maintenance --Supervisor-- Tom Pike Environmental Services --Manager-- EJ Hook Operations HVAC Maintenance Maintenance Supervisor II Maintenance Engineer Repair Maintenance Heating, Ventilation Grounds Grounds Supervisor Groundskeepers Irrigation Manager Equipment Operator (Seasonal) Work Control

  20. Facilities Operations, Planning, and Engineering Services

    E-Print Network [OSTI]

    McLaughlin, Richard M.

    Facilities Operations, Planning, and Design Engineering Services Energy Management & Water Reception Campus Maintenance Housing Support Life Safety Services HVAC Energy Management Controls Campus Grounds Maintenance Carolina North Forest Management Stormwater Maintenance In-house Landscape

  1. Analysis of Assembly 264 - Amended: Pediatric Asthma Self-Management Training and Education Services for Children at High Risk

    E-Print Network [OSTI]

    California Health Benefits Review Program (CHBRP)

    2006-01-01

    nurse*, meta analysis, multicenter study, outcome*, patient education , pediatricnurse$, meta analysis, multicenter study, outcome$, patient education , pediatricnurse-managed program for children with chronic asthma. Journal of Pediatric

  2. Supply Management Specialist

    Broader source: Energy.gov [DOE]

    This position is located in the Logistics Management organization (NSL), Supply Chain Services (NS), Chief Administrative Office (N). NSL manages the warehousing of materials; the investment...

  3. Inf-2101 -Algoritmer Graph Search

    E-Print Network [OSTI]

    Bongo, Lars Ailo

    Inf-2101 - Algoritmer Graph Search John Markus Bjørndalen 2011-09-01 Some foils are adapted from the book and the book's homepage. John Markus Bjørndalen () Inf-2101 - Algoritmer 2011-09-01 1 / 16 #12 in the maze. Foil from Sedgewick/Wayne John Markus Bjørndalen () Inf-2101 - Algoritmer 2011-09-01 2 / 16 #12

  4. ON RAMSEY MINIMAL GRAPHS V. R ODL AND M. SIGGERS

    E-Print Network [OSTI]

    Siggers, Mark H.

    ON RAMSEY MINIMAL GRAPHS V. R ¨ODL AND M. SIGGERS Abstract. A graph G is r-ramsey on at most n vertices, each of which is r-ramsey-minimal with respect to the complete graph Kk. Furthermore of graph theory is determining the ramsey number for a graph H. This is the minimum number n such that any

  5. A Characterization of Seymour Graphs A. A. Ageev

    E-Print Network [OSTI]

    Szigeti, Zoltán

    A Characterization of Seymour Graphs A. A. Ageev , A. V. Kostochka and Z. Szigeti Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4

  6. Models of random graph hierarchies

    E-Print Network [OSTI]

    Paluch, Robert; Holyst, Janusz

    2015-01-01

    We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in the LRGH model clusters of size $1$ stop participating in further steps. We find that in both models the number of nodes at a given hierarchy level $h$ decreases approximately exponentially with $h$. The height of the hierarchy $H$, i.e. the number of all hierarchy levels, increases logarithmically with the system size $N$, i.e. with the number of nodes at the first level. The height $H$ decreases monotonically with the conne...

  7. Risk Management, Mar 2012 Risk Management

    E-Print Network [OSTI]

    Risk Management, Mar 2012 Risk Management Conditions of Volunteer Service (Please send completed form to the Office of Risk Management) riskmanagement@uoregon.edu Fax: 541-346-7008 As a volunteer Tort Claims Act, ORS 30.260-300, and Oregon Department of Administrative Services Risk Management

  8. The Energy Services Provider as Corporate Engineer: A Partnership in Developing a Productive, Sustainable Energy Management Program 

    E-Print Network [OSTI]

    Imel, M.; Gromacki, M.

    2007-01-01

    . Burns & McDonnell (BMcD) is a large, multi-disciplined engineering firm with design-build and energy services capabilities. The firms have worked in the past on process design, environmental, and construction projects....

  9. Counting matchings in irregular bipartite graphs

    E-Print Network [OSTI]

    Marc Lelarge

    2015-07-16

    We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem. It extends the recent work of Csikv\\'ari done for regular and bi-regular bipartite graphs. Moreover, our lower bounds are order optimal as they are attained for a sequence of $2$-lifts of the original graph. We then extend our results to permaments and subpermanents sums. For permanents, we are able to recover the lower bound of Schrijver recently proved by Gurvits using stable polynomials. We provide new lower bounds for subpermanents sums. Our proof borrows ideas from the theory of local weak convergence of graphs, statistical physics and covers of graphs.

  10. Fast generation of sparse random kernel graphs

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo

    2015-09-10

    The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore »at most ?(n(logn)˛). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less

  11. Graphs in machine learning: an introduction

    E-Print Network [OSTI]

    Latouche, Pierre

    2015-01-01

    Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper, we give an introduction to some methods relying on graphs for learning. This includes both unsupervised and supervised methods. Unsupervised learning algorithms usually aim at visualising graphs in latent spaces and/or clustering the nodes. Both focus on extracting knowledge from graph topologies. While most existing techniques are only applicable to static graphs, where edges do not evolve through time, recent developments have shown that they could be extended to deal with evolving networks. In a supervised context, one generally aims at inferring labels or numerical values attached to nodes using both the graph and, when they are available, node characteristics. Balancing the two sources of information can be challenging, especially as they can disagree locally or globall...

  12. Discussiones Mathematicae Graph Theory 34 (2014) 287307

    E-Print Network [OSTI]

    Al Hanbali, Ahmad

    2014-01-01

    FOR TRACEABILITY OF BLOCK-CHAINS Binlong Lia,b1, Hajo Broersmab and Shenggui Zhanga2 a Department of Applied at least n-1 in G. A block-chain is a graph whose block graph is a path, i.e., it is either a P1, P2, every traceable graph is a block-chain, but the reverse does not hold. In this paper we characterize all

  13. Maximum Estrada Index of Bicyclic Graphs

    E-Print Network [OSTI]

    Wang, Long; Wang, Yi

    2012-01-01

    Let $G$ be a simple graph of order $n$, let $\\lambda_1(G),\\lambda_2(G),...,\\lambda_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\\sum_{i=1}^{n}e^{\\lambda_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.

  14. Spectral statistics of nearly unidirectional quantum graphs

    E-Print Network [OSTI]

    Maram Akila; Boris Gutkin

    2015-08-19

    The energy levels of a quantum graph with time reversal symmetry and unidirectional classical dynamics are doubly degenerate and obey the spectral statistics of the Gaussian Unitary Ensemble. These degeneracies, however, are lifted when the unidirectionality is broken in one of the graph's vertices by a singular perturbation. Based on a Random Matrix model we derive an analytic expression for the nearest neighbour distribution between energy levels of such systems. As we demonstrate the result agrees excellently with the actual statistics for graphs with a uniform distribution of eigenfunctions. Yet, it exhibits quite substantial deviations for classes of graphs which show strong scarring.

  15. Generation of graph-state streams

    E-Print Network [OSTI]

    Daniel Ballester; Jaeyoon Cho; M. S. Kim

    2010-12-08

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

  16. Nuclear reactor multiphysics via bond graph formalism

    E-Print Network [OSTI]

    Sosnovsky, Eugeny

    2014-01-01

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

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

    E-Print Network [OSTI]

    Zaslavsky, Thomas

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

  18. Use of Management and Operating Contractor and National Laboratory Employees for Services in the D.C. Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    1997-03-05

    This Notice provides requirements for Headquarters use of employees from Management and Operating (M&O) contractors and National Laboratories and establishes limitations on payments to those employees whose assignments to Headquarters exceed 365 days.

  19. Automatic data for applied railway management : passenger demand, service quality measurement, and tactical planning on the London Overground Network

    E-Print Network [OSTI]

    Frumin, Michael S

    2010-01-01

    The broad goal of this thesis is to demonstrate the potential positive impacts of applying automatic data to the management and tactical planning of a modern urban railway. Tactical planning is taken here to mean the set ...

  20. Office of Classroom Management 2011 Annual Report

    E-Print Network [OSTI]

    Ciocan-Fontanine, Ionut

    Office of Classroom Management 2011 Annual Report Office of Classroom Management · Academic Support Director, Office of Classroom Management Charts/graphs Table of Contents 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Office of Classroom Management 2011 Annual Report #12;1 2011 OCM Annual Report OCM's functions Scheduling

  1. [4] H. Okamura and P. D. Seymour. Multicommodity Flow in Planar Graphs. In J. Combin. Theory Ser. B, 31:75--81, 1981.

    E-Print Network [OSTI]

    Khanna, Sanjeev

    [4] H. Okamura and P. D. Seymour. Multicommodity Flow in Planar Graphs. In J. Combin. Theory Ser. B Management, 1990. [6] A. Schrijver, P. Seymour and P. Winkler. The Ring Loading Problem. In SIAM J. Discrete

  2. Star graphs and Seba billiards

    E-Print Network [OSTI]

    G. Berkolaiko; E. B. Bogomolny; J. P. Keating

    2000-10-26

    We derive an exact expression for the two-point correlation function for quantum star graphs in the limit as the number of bonds tends to infinity. This turns out to be identical to the corresponding result for certain Seba billiards in the semiclassical limit. Reasons for this are discussed. The formula we derive is also shown to be equivalent to a series expansion for the form factor - the Fourier transform of the two-point correlation function - previously calculated using periodic orbit theory.

  3. Automated Services Management over Virtualization Traditional Data Centers (DCs) use static allocation of resources to ensure satisfaction of

    E-Print Network [OSTI]

    Krause, Rolf

    . In the context of the RESERVOIR FP7 project, USI is working with first-class industrial partners (IBM, SAP, Sun demand or in worst-case environment conditions (over-provisioning). Virtualization allows system services and compositions could increase development costs and eventually break existing systems in case

  4. A matrix representation of graphs and its spectrum as a graph invariant

    E-Print Network [OSTI]

    David Emms; Edwin R. Hancock; Simone Severini; Richard C. Wilson

    2006-04-05

    We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases, we compute the spectrum explicitly and show that it is determined by the spectrum of the adjacency matrix of the original graph. We then show by computation that the isomorphism classes of many known families of strongly regular graphs (up to 64 vertices) are characterized by the spectrum of this matrix. We conjecture that this is always the case for strongly regular graphs and we show that the conjecture is not valid for general graphs. We verify that the smallest regular graphs which are not distinguished with our method are on 14 vertices.

  5. Ramsey Minimal Graphs B ela Bollob as

    E-Print Network [OSTI]

    Kohayakawa, Yoshiharu

    Ramsey Minimal Graphs B#19;ela Bollob#19;as #3; Department of Mathematical Sciences University to be Ramsey-in#12;nite if there are in#12;nitely many minimal graphs for which we have ! (G; H). Let ` #21; 4 `, then the pair (C k ; H) is Ramsey- in#12;nite for any k #21; `, where C k denotes the cycle of length k

  6. Diagonal Ramsey Numbers in Multipartite Graphs

    E-Print Network [OSTI]

    van Vuuren, Jan H.

    Diagonal Ramsey Numbers in Multipartite Graphs AP Burger , PJP Grobler , EH Stipp & JH van Vuuren September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised by assuming definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds are established

  7. Induced Graph Ramsey Theory Marcus Schaefer

    E-Print Network [OSTI]

    Schaefer, Marcus

    Induced Graph Ramsey Theory Marcus Schaefer School of CTI DePaul University 243 South Wabash Avenue for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families (path on four vertices). The proof is a standard Ramsey theory argu­ ment: fix one vertex u of the K 5

  8. Diagonal Ramsey Numbers in Multipartite Graphs

    E-Print Network [OSTI]

    van Vuuren, Jan H.

    Diagonal Ramsey Numbers in Multipartite Graphs AP Burger + , PJP Grobler # , EH Stipp # & JH van Vuuren # September 17, 2003 Abstract The notion of a graph theoretic Ramsey number is generalised as in the classical definition. Some small multipartite Ramsey numbers are found, while upper and lower bounds

  9. DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier

    E-Print Network [OSTI]

    Pellier, Damien

    DISTRIBUTED PLANNING THROUGH GRAPH MERGING Damien Pellier Universit´e Paris Descartes, Laboratoire.pellier@parisdescartes.fr Keywords: distributed problem solving, cooperation, coordination, multi-agent planning, planning graphs technics. Abstract: In this paper, we introduce a generic and fresh model for distributed planning called

  10. On the spectra of simplicial rook graphs

    E-Print Network [OSTI]

    Martin, Jeremy L.; Wagner, Jennifer D.

    2014-05-05

    The \\emph{simplicial rook graph} $\\SR(d,n)$ is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove...

  11. Small Alliances in Graphs Rodolfo Carvajal1

    E-Print Network [OSTI]

    Rapaport, Iván

    Small Alliances in Graphs Rodolfo Carvajal1 , Mart´in Matamala1,2 , Ivan Rapaport1,2 , and Nicolas is a (strong defensive) alliance of G if every node in S has at least as many neighbors in S than in V \\S typically belong to small alliances. Despite the fact that finding the smallest alliance in a graph is NP

  12. ACL HLT 2011 TextGraphs-6

    E-Print Network [OSTI]

    Proceedings of the Workshop 23 June, 2011 Portland, Oregon, USA #12;Production and Manufacturing by Omnipress of related graph-based methods. This workshop series is aimed at fostering an exchange of ideas, thanks also to the special theme of this year in the area of machine learning, i.e. Graphs in Structured

  13. Clustering attributed graphs: models, measures and methods

    E-Print Network [OSTI]

    Bothorel, Cecile; Magnani, Matteo; Micenkova, Barbora

    2015-01-01

    Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on graphs without attributes, with the notable exception of edge weights. However, these models only provide a partial representation of real social systems, that are thus often described using node attributes, representing features of the actors, and edge attributes, representing different kinds of relationships among them. We refer to these models as attributed graphs. Consequently, existing graph clustering methods have been recently extended to deal with node and edge attributes. This article is a literature survey on this topic, organizing and presenting recent research results in a uniform way, characterizing the main existing clustering methods and highlighting their conceptual differences. We also cover the important topic of clustering evaluation and identify current open ...

  14. Graph Mining Meets the Semantic Web

    SciTech Connect (OSTI)

    Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

    2015-01-01

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

  15. USDA Forest Service Gen. Tech. Rep. PSW-GTR-198. 2005. 123 Management of Ponderosa Pine Nutrition

    E-Print Network [OSTI]

    Through Fertilization 1 Mariann T. Garrison-Johnston2 , Terry M. Shaw2 , Peter G. Mika2 and Leonard R to the establishment of a region-wide Seedling Establishment study (Moore and Mika 1997, Garrison and others 1@uidaho.edu, ljohnson@uidaho.edu) #12;Management of ponderosa pine nutrition--Garrison-Johnston, Shaw, Mika and Johnson

  16. Client Services Team Member, Student Union & Event Services JOB SUMMARY

    E-Print Network [OSTI]

    Walker, Lawrence R.

    of the Student Union, SUES operations, policies, and procedures in order to ensure smooth operations within the Client Services Manager in recording equipment inventory, building maintenance needs, and event issues from the Client Services Manager, Setup Manager, and Event Operations Coordinator. · Enforce building

  17. Policy on change management 1 Current Revision: 12/2012 Policy on change management

    E-Print Network [OSTI]

    Hammack, Richard

    Documents VCU Technology Services Change Management System (httpPolicy on change management 1 Current Revision: 12/2012 Policy on change management Advancement Services manages and records all changes to applications and vendor systems supported

  18. Department of Psychology, University of Melbourne Introduction to graph theory

    E-Print Network [OSTI]

    ©Department of Psychology, University of Melbourne Introduction to graph theory Graphs Size and weak components Centrality for directed graphs Some special directed graphs ©Department of Psychology,6),(6,7)} 4 5 6 7 #12;©Department of Psychology, University of Melbourne Size and order The size of G

  19. Minimal comparability completions of arbitrary graphs Pinar Heggernes

    E-Print Network [OSTI]

    Heggernes, Pinar

    Minimal comparability completions of arbitrary graphs Pinar Heggernes Federico Mancini Charis for which completion of arbitrary graphs can be achieved through such a vertex incremental approach. 1 to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing

  20. Vienna Graph Template Library Version 1.0

    E-Print Network [OSTI]

    Neumaier, Arnold

    .1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVienna Graph Template Library Version 1.0 Reference Manual Hermann Schichl University of Vienna.2.14 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3 Vienna Graph

  1. DIMACS Technical Report 200337 Perfect interval filament graphs

    E-Print Network [OSTI]

    DIMACS Technical Report 2003­37 Perfect interval filament graphs by Fanica GAVRIL 1 DIMACS, Rutgers are disjoint, their curves do not intersect; FI={ f i | iÎI} is a family of interval filaments and its intersection graph is an interval filament graph. The interval filament graphs contain the polygon

  2. What Energy Functions Can Be Minimized via Graph Cuts?

    E-Print Network [OSTI]

    Field, David

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

  3. Information inequalities and Generalized Graph Entropies

    E-Print Network [OSTI]

    Sivakumar, Lavanya

    2012-01-01

    In this article, we discuss the problem of establishing relations between information measures assessed for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the R\\'{e}nyi entropy have been considered for this study. Our main results involve establishing formal relationship, in the form of implicit inequalities, between these two kinds of measures when defined for graphs. Further, we also state and prove inequalities connecting the classical partition-based graph entropies and the functional-based entropy measures. In addition, several explicit inequalities are derived for special classes of graphs.

  4. Werner Trobin, May 26, 2004 The Boost Graph Library -p. 1/48 The Boost Graph Library

    E-Print Network [OSTI]

    Werner Trobin, May 26, 2004 The Boost Graph Library - p. 1/48 The Boost Graph Library Generic Library Design Werner Trobin #12;Introduction The Boost Graph Library Demo References Werner Trobin, May 26, 2004 The Boost Graph Library - p. 2/48 Outline I Introduction to Boost I The Boost

  5. The Use of ITIL for Process Optimisation in the IT Service Centre of Harz University, exemplified in the Release Management Process

    E-Print Network [OSTI]

    Scheruhn, Hans-Juergen; Habel, Thomas

    2007-01-01

    This paper details the use of the IT Infrastructure Library Framework (ITIL) for optimising process workflows in the IT Service Centre of Harz University in Wernigerode, Germany, exemplified by the Release Management Process. It is described, how, during the course of a special ITIL project, the As-Is-Status of the various original processes was documented as part of the process life cycle and then transformed in the To-Be-Status, according to the ITIL Best Practice Framework. It is also shown, how the ITIL framework fits into the four-layered-process model, that could be derived from interviews with the universities IT support staff, and how the various modified processes interconnect with each other to form a value chain. The paper highlights the final results of the project and gives an outlook on the future use of ITIL as a business modelling tool in the IT Service Centre of Harz University. It is currently being considered, whether the process model developed during the project could be used as a referen...

  6. Quick Guide: Utility Energy Services Contracting (Fact Sheet)

    SciTech Connect (OSTI)

    Not Available

    2009-07-01

    Summarized guide to conducting Federal energy management projects through utility energy services contracts.

  7. SCALABLE REACHABILITY INDEXING FOR VERY LARGE GRAPHS

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 iii #12;3. GRAIL: Scalable Reachability Index for Large Graphs . . . . . . . . . . . . . 36 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.3 GRAIL Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3.3.1 Index GRAIL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.1 Topological Level Filter

  8. Fault-tolerant dynamic task graph scheduling

    SciTech Connect (OSTI)

    Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal; Agrawal, Gagan

    2014-11-16

    In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space and time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.

  9. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

    2011-05-24

    May 24, 2011 ... the rectangular grid graph Pn × Pm (i.e. the Cartesian product of the paths Pn and Pm) is min{n, m} [6] ...... Ars Combinatoria, 47:147-152, 1997.

  10. Projective representations from quantum enhanced graph symmetries

    E-Print Network [OSTI]

    2015-03-11

    Presently, we will label the edges of a graph by elements of a group ...... (a) Read off the matrix ? by putting the G label of a vertex onto the diagonal in the place.

  11. Densities of Minor-Closed Graph Families

    E-Print Network [OSTI]

    Eppstein, David

    2010-01-01

    N. Robertson and P. D. Seymour. Graph Minors. XX. Wagner’sChudnovsky, B. Reed, and P. Seymour. The edge-density for KReferences [1] N. Alon, P. Seymour, and R. Thomas. A

  12. Information Management Software Services SAP Migrations Service

    E-Print Network [OSTI]

    , customers worldwide have maximized their SAP systems by providing a streamlined migration path to DB2Assessment Prepare SAP migration project plan templates before the project starts to allow extra time to define the order in which your SAP landscape(s) and systems are migrated. Once the migration assessment phase

  13. The AmeriFlux Data Activity and Data System: An Evolving Collection of Data Management Techniques, Tools, Products and Services

    SciTech Connect (OSTI)

    Boden, Thomas A; Krassovski, Misha B; Yang, Bai

    2013-01-01

    The Carbon Dioxide Information Analysis Center (CDIAC) at Oak Ridge National Laboratory (ORNL), USA has provided scientific data management support for the U.S. Department of Energy and international climate change science since 1982. Over this period, climate change science has expanded from research focusing on basic understanding of geochemical cycles, particularly the carbon cycle, to integrated research addressing climate change impacts, vulnerability, adaptation, and mitigation. Interests in climate change data and information worldwide have grown remarkably and, as a result, so have demands and expectations for CDIAC s data systems. To meet the growing demands, CDIAC s strategy has been to design flexible data systems using proven technologies blended with new, evolving technologies and standards. CDIAC development teams are multidisciplinary and include computer science and information technology expertise, but also scientific expertise necessary to address data quality and documentation issues and to identify data products and system capabilities needed by climate change scientists. CDIAC has learned there is rarely a single commercial tool or product readily available to satisfy long-term scientific data system requirements (i.e., one size does not fit all and the breadth and diversity of environmental data are often too complex for easy use with commercial products) and typically deploys a variety of tools and data products in an effort to provide credible data freely to users worldwide. Like many scientific data management applications, CDIAC s data systems are highly customized to satisfy specific scientific usage requirements (e.g., developing data products specific for model use) but are also designed to be flexible and interoperable to take advantage of new software engineering techniques, standards (e.g., metadata standards) and tools and to support future Earth system data efforts (e.g., ocean acidification). CDIAC has provided data management support for numerous long-term measurement projects crucial to climate change science. One current example is the AmeriFlux measurement network. AmeriFlux provides continuous measurements from forests, grasslands, wetlands, and croplands in North, Central, and South America and offers important insight about carbon cycling in terrestrial ecosystems. We share our approaches in satisfying the challenges of delivering AmeriFlux data worldwide to benefit others with similar challenges handling climate change data, further heighten awareness and use of an outstanding ecological data resource, and highlight expanded software engineering applications being used for climate change measurement data.

  14. Graph representation of protein free energy landscape

    SciTech Connect (OSTI)

    Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong; Han, Li

    2013-11-14

    The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.

  15. Towards Autonomic Processes and Services Schahram Dustdar

    E-Print Network [OSTI]

    Dustdar, Schahram

    Towards Autonomic Processes and Services Schahram Dustdar Distributed Systems Group Institute "service- oriented". For example, telecommunications, financial services, healthcare, logistics, just composition and business process design and management relevant at all? Why is it not enough to use workflow

  16. HEALTH SERVICES ADMINISTRATION Professional Organizations

    E-Print Network [OSTI]

    Acton, Scott

    HEALTH SERVICES ADMINISTRATION Professional Organizations: Coding: American Academy of Professional Coders (AAPC) American Academy of Professional Coders (AAPC) Charlottesville Chapter Administration Association of Healthcare Administrative Management (AAHAM) Healthcare Financial Management Association (HFMA

  17. Business Services Strategic Plan

    E-Print Network [OSTI]

    Pittendrigh, Barry

    Business Services Strategic Plan Updated September 2008 New Synergies: Launching Tomorrow's Leaders. Facilitate implementation of the University Strategic Plan 2. Analyze, plan, and manage University finances, processes, and contracts in global and strategic partnerships 3. Review existing capital financing plans

  18. Random key graphs can have many more triangles than Erdos-Renyi graphs

    E-Print Network [OSTI]

    Yagan, Osman

    , and in the First Workshop on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC 2009), Chennai (India), December 2009. O. Yagan was with the Department of Electrical and Computer is now with Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University

  19. Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS

    E-Print Network [OSTI]

    Fondements et Applications, Université Paris 7

    Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS Optimal Black Hole Search blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous blocking and destroying any mobile agent entering it. Motivations : Site which is destroyed or dangerous

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

    E-Print Network [OSTI]

    Wu, David

    1 Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs Lehigh University Bethlehem, Pennsylvania Abstract Automatic generation and selection of assembly plans is a problem of great practical importance with many significant cost implications. In this paper, we focus

  1. Agreement Template for Energy Conservation and Demand Side Management...

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

    Agreement Template for Energy Conservation and Demand Side Management Services Agreement Template for Energy Conservation and Demand Side Management Services Template agreement...

  2. Agreement for Energy Conservation and Demand Side Management...

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

    Agreement for Energy Conservation and Demand Side Management Services Template Agreement for Energy Conservation and Demand Side Management Services Template Document features a...

  3. "Load Management Systems for Component-based Middleware"

    E-Print Network [OSTI]

    Murphy, John

    "Load Management Systems for Component-based Middleware" Octavian Ciuhandu, B.E. Masters Management Services Characteristics . . . . . 26 3.3.2 Load Management Services Classification . . . . . . 28 3.3.3 Load Management Services Requirements . . . . . 30 3.3.4 Load Management Services Components

  4. Outline of the talk Statistics on Graphs, Exponential Formula and

    E-Print Network [OSTI]

    Poinsot, Laurent

    Outline of the talk Statistics on Graphs, Exponential Formula and Combinatorial Physics G and Complexity" Laurent Poinsot Statistics on Graphs, Exponential Formula and Combinatorial Physics #12;Exponential Formula : Informal Version Ingredients for the exponential formula Partial commutative monoids

  5. A New Combinatorial Approach for Sparse Graph Problems

    E-Print Network [OSTI]

    Blelloch, Guy E.

    A New Combinatorial Approach for Sparse Graph Problems Guy E. Blelloch, Virginia Vassilevska- totic improvement over O(mn) for all pairs least common ancestors on directed acyclic graphs. 1

  6. INFORMATION TECHNOLOGY SERVICES CRM Agent Training

    E-Print Network [OSTI]

    McQuade, D. Tyler

    INFORMATION TECHNOLOGY SERVICES CRM Agent Training Assigning an agent to a case Service Management case, select the case number. INFORMATION TECHNOLOGY SERVICES #12;3 5. When the case page has opened TECHNOLOGY SERVICES #12;4 7. Select the appropriate provider group. INFORMATION TECHNOLOGY SERVICES #12;5 8

  7. On the topology of graph picture spaces

    E-Print Network [OSTI]

    Martin, Jeremy L.

    2005-03-01

    V and edges E. The d-dimensional picture space Xd(G) is de ned as the projective algebraic set whose points are pictures of G in complex projective d-space Pd = PdC. A picture P consists of a point P(v) 2 Pd for each vertex v of G and a line P...(e) for each edge e, subject to the conditions P(v) 2 P(e) whenever v is an endpoint of e. Two fundamental operations of graph theory are deletion and contraction: given a graph G and an edge e, we may delete e to form a graph G e, or identify the end- points...

  8. MadGraph 5 : Going Beyond

    E-Print Network [OSTI]

    Johan Alwall; Michel Herquet; Fabio Maltoni; Olivier Mattelaer; Tim Stelzer

    2011-06-02

    MadGraph 5 is the new version of the MadGraph matrix element generator, written in the Python programming language. It implements a number of new, efficient algorithms that provide improved performance and functionality in all aspects of the program. It features a new user interface, several new output formats including C++ process libraries for Pythia 8, and full compatibility with FeynRules for new physics models implementation, allowing for event generation for any model that can be written in the form of a Lagrangian. MadGraph 5 builds on the same philosophy as the previous versions, and its design allows it to be used as a collaborative platform where theoretical, phenomenological and simulation projects can be developed and then distributed to the high-energy community. We describe the ideas and the most important developments of the code and illustrate its capabilities through a few simple phenomenological examples.

  9. Energy, Data Management, Reporting

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

    Electric Sustainability Services 2014 4 - - How are you currently managing your energy data? Is your energy data collected manually, and stored in a spreadsheet? Is...

  10. ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS

    E-Print Network [OSTI]

    Siggers, Mark H.

    ON HIGHLY RAMSEY INFINITE GRAPHS M. H. SIGGERS Abstract. We show that, for k 3, there exists that are 2-ramsey-minimal for the odd cycle C2k+1. 1. Introduction A graph G is r-ramsey for a graph H if any r-colouring of the edges of G yields a monochromatic copy of the graph H. G is r-ramsey

  11. A Note on Ramsey Size-Linear Graphs

    E-Print Network [OSTI]

    Simonovits, MiklĂłs

    A Note on Ramsey Size-Linear Graphs P.N. Balister,1 R.H. Schelp,1 and M. Simonovits1,2 1 DEPARTMENT is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every

  12. Evaluating Graph Coloring on Pascal Grosset, Peihong Zhu, Shusen Liu,

    E-Print Network [OSTI]

    Hall, Mary W.

    any relevant related works for graph coloring on GPUs · Main inspiration: o Gebremedhin and Manne o (G

  13. Discrete Lagrangian Systems on Graphs. Symplecto-Topological Properties

    E-Print Network [OSTI]

    S. P. Novikov; A. S. Schwarz

    2000-04-11

    Discrete Lagrangian Systems on graphs are considered. Vector-valued closed differential 2-form on the space of solutions is constructed. This form takes values in the first homology group of the graph. This construction generalizes the Symplectic Wronskian for the linear self-adjoint operators on graphs found in 1997 by the first author and used for the needs of the Scattering Theory for graphs with tails

  14. 1st Graph Searching in Canada (GRASCan) Workshop

    E-Print Network [OSTI]

    Bonato, Anthony

    Fitzpatrick, University of Prince Edward Island Cops and Robber on Circulant Graphs 11:30 - 12:00 Kieka

  15. CAREER SERVICES University of Pennsylvania

    E-Print Network [OSTI]

    Plotkin, Joshua B.

    Masters in Technology Management Program. Manufacturing and technology continue to be the top sectors Master's students, excluding students in the Executive Masters of Technology and Management program Manufacturing 44 Technology 31 Financial Services 21 Education 17 Services (Consulting, Construction) 5 in each

  16. DRAFT - DOE O 350.2C, Use of Management and Operating or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C. Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    The Order establishes policies and procedures for managing DOE and NNSA management and operating (M&O) contractors and other facility management contractor employees assigned to the Washington, D.C., area.

  17. Enabling better water management

    E-Print Network [OSTI]

    Greenslade, Diana

    CASE STUDY Enabling better water management Seasonal Streamflow Forecast Service influencing water decisions Water management decisions made with confidence Using the Bureau's streamflow forecasting, ACTEW Water confidently removed temporary water restrictions after the millennium drought. Millennium drought

  18. Efficient Integration of Web Services in Ambient-aware Sensor Network Applications1

    E-Print Network [OSTI]

    Koutsoukos, Xenofon D.

    Efficient Integration of Web Services in Ambient-aware Sensor Network Applications1 Isaac Amundson discovery and access of Web services. Sensor network applications are realized as graphs of modular sensor nodes, as well as a Web service, is used to illustrate the approach. Our results demonstrate

  19. VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis

    E-Print Network [OSTI]

    VACUUM ENERGY IN QUANTUM GRAPHS A Senior Honors Thesis by JUSTIN HOWARD WILSON Submitted ABSTRACT Vacuum Energy in Quantum Graphs. (April 2007) Justin Howard Wilson Department of Physics the vacuum energy in quantum graphs. Vacuum energy arose in quantum physics but has an independent

  20. Problems of Distance-Regular Graphs Hiroshi Suzuki

    E-Print Network [OSTI]

    Xi, Changchang

    ­328. [14] H. Suzuki, The Terwilliger algebra associated with a set of vertices in a distance-regular graph, J. Alg. Combin. 22 (2005), 5-38. [15] P. Terwilliger, Distance-regular graphs and (s, c, a, k)-graphs, J. Combin. Th. (B) 34 (1983), 151­164. [16] P. Terwilliger, A new inequality for distance

  1. Realization of some local unitary operations by graph switching

    E-Print Network [OSTI]

    Supriyo Dutta; Bibhas Adhikari; Subhashish Banerjee

    2015-02-27

    In this work we implement a graph theoretical realization of local unitary transformations, implemented by single qubit Pauli gates, by adapting techniques of graph switching. This leads to the concept of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single qubit Pauli and Hadamard gates.

  2. The case against specialized graph analytics engines University of Wisconsin

    E-Print Network [OSTI]

    Willett, Rebecca

    the performance perspec- tive. We present Grail ­ a syntactic layer for querying graph in a vertex-centric way compare Grail to GraphLab and Giraph, and examine the performance implications of using Grail, showing.e. Grail) that presents such a syntactic mapping layer. We present how graph analytics queries using

  3. GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    GRAIL: Scalable Reachability Index for Large Graphs Hilmi Yildirim Rensselaer Polytechnic large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear

  4. A Visualization System for Correctness Proofs of Graph Algorithms

    E-Print Network [OSTI]

    Metaxas, Takis

    A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm

  5. A Static Analysis Technique for Graph Transformation Systems

    E-Print Network [OSTI]

    Baldan, Paolo

    A Static Analysis Technique for Graph Transformation Systems Paolo Baldan, Andrea Corradini,andrea,koenigb}@di.unipi.it Abstract. In this paper we introduce a static analysis technique for graph transformation systems. We in a direct and intuitive way. Graph Transformation Systems (GTSs) [18] add to the static description given

  6. Making arbitrary graphs transitively orientable: Minimal comparability completions

    E-Print Network [OSTI]

    Papadopoulos, Charis

    Making arbitrary graphs transitively orientable: Minimal comparability completions Pinar Heggernes to an arbitrary graph is called a comparability completion of the input graph. Unfortunately, computing a comparability completion with the minimum number of added edges (called a minimum completion) is an NP

  7. VGTL (Vienna Graph Template Library) Version 1.1

    E-Print Network [OSTI]

    Schichl, Hermann

    .1 Vienna Graph Template Library Modules Here is a list of all modules: Classes and types for external useVGTL (Vienna Graph Template Library) Version 1.1 Reference Manual Hermann Schichl University June 2003 #12;CONTENTS 1 Contents 1 Introduction 1 2 Vienna Graph Template Library Module Index 2 3

  8. The power graph of a group Peter J. Cameron

    E-Print Network [OSTI]

    Burton, Geoffrey R.

    ; graphs are much looser. For example, there are only five different groups with eight elementsThe power graph of a group Peter J. Cameron Queen Mary, University of London LTCC Open Day, 8 January 2010 Groups and graphs A group is an algebraic structure: a set with a bi- nary operation

  9. Multivariate Graphs in Software Engineering and A. Telea2

    E-Print Network [OSTI]

    Telea, Alexandru C.

    Multivariate Graphs in Software Engineering S. Diehl1 and A. Telea2 1 Department of Computer, the Netherlands Abstract. Multivariate networks, or graphs, are an essential element of various activities. In this chapter, we present the specific context in which multivariate graphs occur in software engineering

  10. Cellular Algebras and Graph Invariants Based on Quantum Walks

    E-Print Network [OSTI]

    Jamie Smith

    2011-03-01

    We consider two graph invariants inspired by quantum walks- one in continuous time and one in discrete time. We will associate a matrix algebra called a cellular algebra with every graph. We show that, if the cellular algebras of two graphs have a similar structure, then they are not distinguished by either of the proposed invariants.

  11. On Sum--Connectivity Index of Bicyclic Graphs

    E-Print Network [OSTI]

    Du, Zhibin

    2009-01-01

    We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\\le m\\le \\lfloor\\frac{n}{2}\\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\\ge 5$ vertices. The extremal graphs are characterized.

  12. Bicycles and Left-Right Tours in Locally Finite Graphs

    E-Print Network [OSTI]

    Diestel, Reinhard

    Bicycles and Left-Right Tours in Locally Finite Graphs von Melanie Win Myint, M. S. Dem Department-Right Tours 29 6 LRTs Generate the Bicycle Space 43 7 The ABL Planarity Criterion 53 8 Pedestrian Graphs 69 bicycles and some other concepts they relate to, such as left- right tours and pedestrian graphs

  13. Large Mesh Deformation Using the Volumetric Graph Laplacian

    E-Print Network [OSTI]

    Kazhdan, Michael

    Large Mesh Deformation Using the Volumetric Graph Laplacian Kun Zhou1 Jin Huang2 John Snyder3 Related Work Deformation on Volumetric Graphs Deformation from 2D curves Results Conclusions #12;11/21/2007 Bhaskar Kishore 3 Outline Introduction Related Work Deformation on Volumetric Graphs Deformation from

  14. Collection Management Policy Mission Statement

    E-Print Network [OSTI]

    Abrahams, I. David

    Collection Management Policy Mission Statement: To provide an efficient and effective service care, document supply, stock management, and logistical planning and relegation of the Library Management Policy ..................................3 2. Acquisition of Content

  15. Semantic Web Services Christoph Bussler

    E-Print Network [OSTI]

    Semantic Web Services Christoph Bussler Oracle Corporation The 12th International World Wide Web Conference Budapest, Hungary, May 23rd, 2003 #12;Semantic (Web Services) Christoph Bussler Oracle Corporation(WS) = workflow management ++ S(WS) = [ your current web services prototype ] Ignored experience in a field

  16. M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security

    E-Print Network [OSTI]

    M&Ms4Graphs: Multi-scale, Multi-dimensional Graph Analytics Tools for Cyber-Security Objective We-of-Networks Framework for Cyber Security." IEEE Intelligence and Security Informatics, 2013. 2. "Towards a Multiscale. "Statistical and Hierarchical Graph Analysis for Cyber Security." SIAM Conference on Discrete Mathematics

  17. CPM: A Graph Pattern Matching Kernel with Diffusion for Accurate Graph Classification

    E-Print Network [OSTI]

    Kansas, University of

    (the Molecular Library Initiative project) that aims to determine and publicize the biological activ chemical structure data sets and have compared our methods to all major graph kernel functions that we know

  18. Three Theorems Regarding Testing Graph Properties*

    E-Print Network [OSTI]

    Trevisan, Luca

    Three Theorems Regarding Testing Graph Properties* Oded Goldreich,1, Luca Trevisan2 1 Department-mail: luca@eecs.berkeley.edu Received 9 December 2001; accepted 18 September 2002 DOI 10.1002/rsa.10078 ABSTRACT: Property testing is a relaxation of decision problems in which it is required to distinguish YES

  19. Graph Coloring with Quantum Heuristics Alex Fabrikant

    E-Print Network [OSTI]

    Fabrikant, Alex

    empirically with small graphs near a phase transition in search performance. It im- proves on two prior and physical phase transitions [4, 23, 19], which has led to new heuristics for conventional machines [12, 8 a conventional machine eval- uates just one. Hence one might expect high performance for problems having a rapid

  20. Understanding Design Patterns with Design Rationale Graphs

    E-Print Network [OSTI]

    Baniassad, Elisa

    Understanding Design Patterns with Design Rationale Graphs Elisa Baniassad and Gail C. Murphy christa.schwanninger@mchp.siemens.de ABSTRACT A Design Pattern presents a proven solution to a common design problem using a combination of informal text, diagrams, and examples. Often, to suitably describe

  1. Parsimonious Flooding in Dynamic Graphs Herv Baumann

    E-Print Network [OSTI]

    Fondements et Applications, Université Paris 7

    Parsimonious Flooding in Dynamic Graphs Hervé Baumann University Paris Diderot herve bounds on their flooding time -- flooding is the basic mechanism in which every node becoming aware. In this paper, we establish tight bounds on the complexity of flooding for all possible birth rates and death

  2. Spectral statistics for scaling quantum graphs

    E-Print Network [OSTI]

    Yu. Dabaghian

    2006-08-09

    The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $\\delta k_{n}=k_{n}-\\bar k_{n}$, and the nearest neighbor separations, $s_{n}=k_{n}-k_{n-1}$.

  3. Expander Graph Arguments for Message Passing Algorithms

    E-Print Network [OSTI]

    Burshtein, David

    Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually

  4. Minimum Spanning Trees weighted graph API

    E-Print Network [OSTI]

    Wu, Xiaolin

    on the complete graph on V vertices. #12;4 MST Origin Otakar Boruvka (1926). · Electrical Power Company of Western Moravia in Brno. · Most economical construction of electrical power network. · Concrete engineering;5 Applications MST is fundamental problem with diverse applications. · Network design. telephone, electrical

  5. Atomic Representations of Rank 2 Graph Algebras

    E-Print Network [OSTI]

    Davidson, Ken

    Atomic Representations of Rank 2 Graph Algebras Kenneth R. Davidson a , Stephen C. Power b , Dilian University, Lancaster LA1 4YF, U.K. Abstract We provide a detailed analysis of atomic -representations- posed into a direct sum or direct integral of irreducible atomic representations. The building blocks

  6. Solving the Graph Isomorphism Problem with a Quantum Annealer

    E-Print Network [OSTI]

    Itay Hen; A. P. Young

    2012-08-08

    We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs (SRG's). We also show that our method is applicable, within certain limitations, to currently available quantum hardware such as "D-Wave One".

  7. Graph processing platforms at scale: practices and experiences

    SciTech Connect (OSTI)

    Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C; Sukumar, Sreenivas R; Ganesh, Gautam

    2015-01-01

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

  8. Frequent Subgraph Discovery in Large Attributed Streaming Graphs

    SciTech Connect (OSTI)

    Ray, Abhik; Holder, Larry; Choudhury, Sutanay

    2014-08-13

    The problem of finding frequent subgraphs in large dynamic graphs has so far only consid- ered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend itself well to real time processing of real world graphs like social networks or internet traffic which consist of a stream of nodes and edges. In this paper we propose an algorithm that discovers the frequent subgraphs present in a graph represented by a stream of labeled nodes and edges. Our algorithm is efficient and consists of tunable parameters that can be tuned by the user to get interesting patterns from various kinds of graph data. In our model updates to the graph arrive in the form of batches which contain new nodes and edges. Our algorithm con- tinuously reports the frequent subgraphs that are estimated to be found in the entire graph as each batch arrives. We evaluate our system using 5 large dynamic graph datasets: the Hetrec 2011 challenge data, Twitter, DBLP and two synthetic. We evaluate our approach against two popular large graph miners, i.e., SUBDUE and GERM. Our experimental re- sults show that we can find the same frequent subgraphs as a non-incremental approach applied to snapshot graphs, and in less time.

  9. Transportation and Program Management Services

    Office of Environmental Management (EM)

    SNF Shipments UWNR- 1 cask AECL- 1 cask MIT- 1 cask ANL- 1 cask FRR Shipments via NWSC: Germany- 2 casks T k 1 k Sweden- 1 cask UARR- 1 cask GA- 3 casks Support Activities...

  10. Line graphs e contrazioni: un approccio rigoroso alla space syntax

    E-Print Network [OSTI]

    D'Autilia, Roberto

    2015-01-01

    The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of a given primary graph. By means of the line graph algorithms, a system of labels defined on the edges of the primary graph is transformed into a system of labels on the vertices of the line graph. The contraction of adjacent edges with the same label allows to build a more general graph than those generated with the methods of the space syntax. By means of the functions implemented in Mathematica is therefore possible to redefine the space syntax on any system of urban quantities (labels) and reproduce the results of the axial lines as a special case. As an example is discussed a possible application of the method to the urban noise analysis.

  11. Director of IT Services Project Office

    E-Print Network [OSTI]

    Birmingham, University of

    Who we are Quality Yvonne O'Byrne Facilities Management John Owen Networks John Turnbull Customer IT Support Nick Foley Heather Behan Network operations Cabling and wireless network Directory and authentication Voice & mobile services Project management services Project office Process analysis IT Service

  12. Project Final Report UBC LBS Project Services1 Project Final Report UBC LBS Project Services2

    E-Print Network [OSTI]

    is used as a foundation for all development, land use, and transportation activities at UBC. LBS Project Services is a fee-for-service provider of development, design, and project management servicesProject Final Report UBC LBS Project Services1 #12;Project Final Report UBC LBS Project Services2

  13. Student Services Student Services

    E-Print Network [OSTI]

    /Pacific American awareness and education. Resources include: · Academic support programs · Connections with community · Educational and cultural programs/resources · Student organization support · Student leadership in collaboration that maximizes the use of resources and services across the Division, across campus

  14. Notice of Intent to Revise DOE O 350.2B, Use of Management and Operating or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C., Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2015-03-20

    The objective of this revision is to incorporate a more performance based risk management approach into the oversight and management of these assignments. The revision will result in a reduction of DOE requirements, increased delegation of management responsibilities to sponsoring program organizations, elimination of reporting requirements and institutionalizing DOE-wide cost constraints for contractor domestic assignments. Approved 3-20-15.

  15. Notice of Intent to Revise DOE O 350.2B, Use of Management and Operating or Other Facility Management Contractor Employees for Services to DOE in the Washington, D.C., Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    The objective of this revision is to incorporate a more performance based risk management approach into the oversight and management of these assignments. The revision will result in a reduction of DOE requirements, increased delegation of management responsibilities to sponsoring program organizations, elimination of reporting requirements and institutionalizing DOE-wide cost constraints for contractor domestic assignments. Approved 3-20-15.

  16. Local semicircle law for random regular graphs

    E-Print Network [OSTI]

    Roland Bauerschmidt; Antti Knowles; Horng-Tzer Yau

    2015-05-26

    We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by Wigner's semicircle law, down to the optimal scale given by the typical eigenvalue spacing (up to a logarithmic correction). Aside from well-known consequences for the local eigenvalue distribution, this result implies the complete delocalization of all eigenvectors.

  17. Approximating the minimum clique cover and other hard problems in subtree filament graphs

    E-Print Network [OSTI]

    Stewart, Lorna

    Approximating the minimum clique cover and other hard problems in subtree filament graphs J. Mark Keil Lorna Stewart March 20, 2006 Abstract Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament

  18. A Characterization of Seymour Graphs A. A. Ageev A. V. Kostochka Z. Szigeti y

    E-Print Network [OSTI]

    Ageev, Alexandr

    A Characterization of Seymour Graphs A. A. Ageev #3; A. V. Kostochka #3; Z. Szigeti y Abstract Following Gerards [1] we say that a connected undirected graph G is a Seymour graph if the maximum number). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour [4][5], Gerards [1

  19. INFORMATION TECHNOLOGY SERVICES CRM Agent Training

    E-Print Network [OSTI]

    McQuade, D. Tyler

    INFORMATION TECHNOLOGY SERVICES CRM Agent Training Adding and Emailing a Note Service Management field INFORMATION TECHNOLOGY SERVICES #12;3 6. In the Note Information box, select from the Visibility INFORMATION TECHNOLOGY SERVICES #12;4 11. Select Save Case 12. When the Note has been saved, the following

  20. INFORMATION TECHNOLOGY SERVICES CRM Agent Training

    E-Print Network [OSTI]

    McQuade, D. Tyler

    INFORMATION TECHNOLOGY SERVICES CRM Agent Training Running Statistical Queries Service Management Center Queries, enter "fsu_" into the search field and select Search. INFORMATION TECHNOLOGY SERVICES #12. INFORMATION TECHNOLOGY SERVICES #12;4 6. Select the Query you would like to run by selecting how you would

  1. INFORMATION TECHNOLOGY SERVICES CRM Agent Training

    E-Print Network [OSTI]

    McQuade, D. Tyler

    INFORMATION TECHNOLOGY SERVICES CRM Agent Training Creating a Case Service Management Deployment Request. An agent can change the INFORMATION TECHNOLOGY SERVICES #12;3 type to reflect the type of case of the provider group field. INFORMATION TECHNOLOGY SERVICES #12;4 Selecting the magnifying glass will open

  2. Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics

    E-Print Network [OSTI]

    Nitin Saxena; Simone Severini; Igor Shparlinski

    2007-03-26

    The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a circulant graph, is periodic if and only if all eigenvalues of the graph are integers (that is, the graph is integral). Motivated by this observation, we focus on relevant properties of integral circulant graphs. Specifically, we bound the number of vertices of integral circulant graphs in terms of their degree, characterize bipartiteness and give exact bounds for their diameter. Additionally, we prove that circulant graphs with odd order do not allow perfect state transfer.

  3. PROCEEDINGS OF 1976 SUMMER WORKSHOP ON AN ENERGY EXTENSION SERVICE

    E-Print Network [OSTI]

    Authors, Various

    2010-01-01

    Waste Management Board Department of Consumer Affairs Department of General Services (including State Architect) Department of Food and

  4. Corporate Human Resources Information Services (CHIRS) PIA, Office...

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

    System PIA, National Nuclear Services Administration Integrated Safety Management Workshop Registration, PIA, Idaho National Laboratory Occupational Medicine - Assistant...

  5. Corporate Human Resources Information Services (CHIRS) PIA, Office...

    Energy Savers [EERE]

    Nuclear Services Administration Integrated Safety Management Workshop Registration, PIA, Idaho National Laboratory Occupational Medicine - Assistant PIA, Idaho National Laboratory...

  6. Large induced forests in sparse graphs , Dhruv Mubayi

    E-Print Network [OSTI]

    Shamir, Ron

    (G) of G. Given a graph G, let NG(v) or simply N(v) denote the set of neighbors of vertex v. For sets

  7. On the Adequacy of Program Dependence Graphs for Representing Programs

    E-Print Network [OSTI]

    Reps, Thomas W.

    introduced by Kuck as an intermediate program representation well suited for performing optimizations are strongly equivalent. 1. Introduction Program dependence graphs were introduced by Kuck as an intermediate

  8. Computing the Stretch of an Embedded Graph Sergio Cabello

    E-Print Network [OSTI]

    Cabello, Sergio

    . GIG/11/E023. 1 #12;Here, len() denotes the number of edges in and a cycle is a closed walk in a graph

  9. ON THE GAUSS MAP OF MINIMAL GRAPHS Daoud Bshouty, Dept ...

    E-Print Network [OSTI]

    1910-70-82

    Technology, 3200 Haifa, Israel, and Allen Weitsman, Dept. of Mathematics, Purdue University, W. Lafayette, IN 47907. Abstract. We consider graphs of solutions ...

  10. Quasiperiodic graphs: structural design, scaling and entropic properties

    E-Print Network [OSTI]

    Bartolo Luque; Fernando J. Ballesteros; Ángel M. Núńez; Alberto Robledo

    2012-03-16

    A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions represented by the Farey tree is inherited by their associated graphs. We are able to establish, via Renormalization Group (RG) theory, the architecture of the quasiperiodic graphs produced by irrational winding numbers with pure periodic continued fraction. And finally, we demonstrate that the RG fixed-point degree distributions are recovered via optimization of a suitably defined graph entropy.

  11. Stochastic processes on graphs with cycles : geometric and variational approaches

    E-Print Network [OSTI]

    Wainwright, Martin J. (Martin James), 1973-

    2002-01-01

    Stochastic processes defined on graphs arise in a tremendous variety of fields, including statistical physics, signal processing, computer vision, artificial intelligence, and information theory. The formalism of graphical ...

  12. Emergency Care Management with Location-Aware Services Shih-wei Lee* , Shao-you Cheng*, Jane Yung-jen Hsu*, Polly Huangt, Chuang-wen You*

    E-Print Network [OSTI]

    Huang, Polly

    . system proactively to infer event notifications for remind- The statistical data shows that NTU Hospital, location- finding patients, hospital assets (e.g. sickbeds, pumps, or aware services for indoor

  13. 55USDA Forest Service Gen. Tech. Rep. PSW-GTR-158. 1995. FARSITE: A Fire Area Simulator for Fire Managers1

    E-Print Network [OSTI]

    be an accustomed means to bring fire growth modeling technology to management applications. The FARSITE model the transfer of fire growth modeling technology to user applications. Personal computers are now commonplace Managers1 Mark A. Finney2 Abstract: A fire growth model (FARSITE) has been developed for use on personal

  14. Tina Wakolbinger is the Professor of Supply Chain Services and Networks and the Head of the Research Institute for Supply Chain Management at the

    E-Print Network [OSTI]

    Nagurney, Anna

    of the Research Institute for Supply Chain Management at the Vienna University of Economics and Business (WU in Management Science, in May 2007. Prior to joining WU, she was an Assistant Professor at the Fogelman College Research, the Annals of Operations Research, and Naval Research Logistics. February 19, 2013 ISOM Room 306

  15. 327USDA Forest Service Gen.Tech.Rep. PSW-GTR-166. 1998. Effective management of forest resources requires access to current and consistent geospatial information

    E-Print Network [OSTI]

    to effective management of natural resources. Data from various remote sensing instruments make a substantial managers and the public. Geospatial information describing our land and natural resources comes from many, standards, and guidelines. Introduction Geospatial information about land and natural resources is essential

  16. Policy Flash 2015-28- New GSA Strategic Sourcing Vehicle for Print Management Services available for Department of Energy (DOE) Wide Use

    Broader source: Energy.gov [DOE]

    The Office of Headquarters Procurement Services awarded a Blanket Purchase Agreement (BPA) (BPA Number DE-MA0011379) to Ricoh USA, Inc. of Malvern, PA on May 4, 2015. The BPA is for purchasing, leasing and maintenance services of Multi-Functional Devices (MFDs). This is a GSA Federal Strategic Sourcing Initiative (FSSI) Vehicle that has been awarded by DOE in support of DOE’s strategic sourcing initiative.

  17. course web site Note: For all homework assignments, when graphs and plots are

    E-Print Network [OSTI]

    Palmeri, Thomas

    PSY318! Week 4 #12;course web site #12;Note: For all homework assignments, when graphs and plots web site is a simple example of some Matlab code for creating line and bar graphs: Graph

  18. The structure of claw-free graphs Maria Chudnovsky and Paul Seymour

    E-Print Network [OSTI]

    Chudnovsky, Maria

    The structure of claw-free graphs Maria Chudnovsky and Paul Seymour Abstract A graph is claw a graph G is prismatic if for every triangle T of G, every vertex of G #12;2 M. Chudnovsky & P. Seymour

  19. Swansea University, Information Services & Systems

    E-Print Network [OSTI]

    Martin, Ralph R.

    Swansea University, Information Services & Systems Information and Digital Literacy Strategy and interpreting information in their subject areas. Our students need the skills to manage an information University need information and digital literacy skills so that they can maximise their opportunities

  20. 3D Graph Visualization with the Oculus Rift Virtual Graph Reality

    E-Print Network [OSTI]

    Wismath, Stephen

    stereo experi- ence with head tracking and display of appropriate left and right eye information The low on the effectiveness of head-mounted VR systems vs. fish tank VR noted that the hardware suffered from latency- braries permit its use as the main engine for creating the virtual (graph) world. Head tracking

  1. TextGraphs-5 2010 Workshop on Graph-based Methods

    E-Print Network [OSTI]

    Proceedings of the Workshop 16 July 2010 Uppsala University Uppsala, Sweden #12;Production and Manufacturing-based methods. This workshop is aimed at fostering an exchange of ideas by facilitating a discussion about both-theoretical methods for text processing tasks, this year we invited papers on a special theme "Graph Methods

  2. Request to Cancel Department of Energy (DOE) Order 350.2B, Use of Management and Operating or other Facility Management Contractor Employees for Services to DOE in the Washington D.C. Area

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2015-11-23

    DOE is canceling this directive and its associated DOE-wide mandated requirements in recognition of Departmental management and oversight improvements of Headquarters sponsored assignments to the Washington D.C. area and opting to implement as program specific risk based management approach to these actions.

  3. Business Services Strategic Plan

    E-Print Network [OSTI]

    Pittendrigh, Barry

    Business Services Strategic Plan 2008-2014 New Synergies: Launching Tomorrow's Leaders Discovery implementation of the University Strategic Plan Analyze, plan, and manage University finances, processes, and contracts in global and strategic partnerships Review existing capital financing plans and the process

  4. Parking & Transportation Services Sustainability &

    E-Print Network [OSTI]

    Minnesota, University of

    : 2011 #12;As a long-time leader in the areas of waste abatement, pollution reduction, energy management Metro Commuter Services Infinity Award ­ in recognition of alternative transportation programs. · 1996 to maintaining impressive and viable alternative transportation programs. TRANSPORTATION SYSTEM DESIGNS

  5. Forest Service Research Note

    E-Print Network [OSTI]

    management problems, such as Planning-Programing-Budgeting, will require automated procedures to col- lect in terms of products and services and alter- native methods of producing them . The out- puts from PPBS- semble forest data up to an economic limit of about 50,000 lines of map data at an average cost of 0

  6. Graph Transformation and Intuitionistic Linear Logic

    E-Print Network [OSTI]

    Ulidowski, Irek

    ; } } CISA ­ p. #12;L1 L2 x y pt t L3 pt pt nx L1 L2 x y pt t L3 pt pt nx pt nx pt nx l[0] NULLx x y L1 L3L1y x L2 pt pt nx L3 L2 y nxpt pt pointer cell nx pt INITIAL STATE TYPE GRAPH RULE 1 RULE 2 CISA ­ p. #12;ILL representation Definitions ptlist(x, l) pt(x, Hd(l)) list(l) list(h#l) nx(h, Hd(l)) list

  7. Spectral properties of magnetic chain graphs

    E-Print Network [OSTI]

    Pavel Exner; Stepan Manko

    2015-07-02

    We discuss spectral properties of a charged quantum particle confined to a chain graph consisting of an infinite array of rings under influence of a magnetic field assuming a $\\delta$-coupling at the points where the rings touch. We start with the situation when the system has a translational symmetry and analyze spectral consequences of perturbations of various kind, such as a local change of the magnetic field, of the coupling constant, or of a ring circumference. A particular attention is paid to weak perturbations, both local and periodic; for the latter we prove a version of Saxon-Hutner conjecture.

  8. Perceptions of livestock producers, forage producers, wildlife managers, and forage-based service providers concerning extension and technology-transfer activities in south Texas and northeast Mexico 

    E-Print Network [OSTI]

    Folsom, Wendy Ann

    2001-01-01

    The purpose of this bi-national study was to determine the type, nature, and extent of existing extension and technology-transfer activities provided to livestock producers, forage producers, and wildlife managers in south ...

  9. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks

    E-Print Network [OSTI]

    Schindelhauer, Christian

    a distributed, localized and resource-efficient algorithm for constructing the HL graph. We have implemented introduced and analyzed by Meyer auf der Heide et al. 2004. This graph can be used as a topology for wireless networks with variable trans- mission ranges. In this paper we present a distributed, localized

  10. SPATIAL POINT PROCESSES AND GRAPH BASED STATISTICAL FEATURES

    E-Print Network [OSTI]

    Jyväskylä, University of

    2010 2000 Mathematics Subject Classification. 60G55, 62-07, 62M30. ISSN 1457-9235 #12;SPATIAL POINT Classification. 60G55, 62-07, 62M30. 1 #12;Spatial point processes and graph based statistical features Tuomas library has been developed for the computation of the graph-based summaries. Keywords: Spatial point

  11. On the concurrent semantics of Algebraic Graph Grammars #

    E-Print Network [OSTI]

    Baldan, Paolo

    â??a di Pisa, Italy baldan@dsi.unive.it andrea@di.unipi.it Abstract. Graph grammars are a powerful model. These semantics have served as basis for the development of a variety of modelling and verification techniques graph transformation systems as an alternative model of concurrency, extending Petri nets. The basic

  12. Generalized Graph Products for Network Design and Analysis

    E-Print Network [OSTI]

    Roughan, Matthew

    Generalized Graph Products for Network Design and Analysis Eric Parsonage, Hung X. Nguyen, Rhys--Network design, as it is currently practiced, involves putting devices together to create a network. However as a whole object. In this paper we develop generalized graph products that allow the mathematical design

  13. The Generic Graph Component Library Dr. Dobb's Journal September 2000

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    by Jeremy G. Siek and Andrew Lumsdaine). The most important aspect of designing the library was to defineThe Generic Graph Component Library Dr. Dobb's Journal September 2000 Generic programming for graph.nd.edu, and lumsg@lsc.nd.edu, respectively. The Standard Template Library has established a solid foundation

  14. Rapidly mixing Markov chains for dismantleable constraint graphs

    E-Print Network [OSTI]

    Dyer, Martin

    Rapidly mixing Markov chains for dismantleable constraint graphs Martin Dyer Mark Jerrum Eric adjacency. Brightwell and Winkler introduced the notion of dismantleable constraint graph to characterize proportional to vVG ((v)). We prove, for each dismantleable H, that there exist positive constant fugacities

  15. Statistical Inference on Graphs Gerard BIAU # and Kevin BLEAKLEY

    E-Print Network [OSTI]

    Biau, GĂ©rard

    to reconstruct networks have been proposed and tested so far, ranging from Bayesian or Petri networks applications including communication networks and systems biology, we propose a general model for studying deals with problems that have a graph (or network) structure. In this context an (undirected) graph

  16. SGor: Trust graph based onion routing Peng Zhou a,

    E-Print Network [OSTI]

    Ives, Zachary G.

    routers pose a serious threat to existing onion routing networks (e.g., the Tor network [14]). To thwartSGor: Trust graph based onion routing Peng Zhou a, , Xiapu Luo a , Ang Chen b,1 , Rocky K.C. Chang August 2013 Available online 24 August 2013 Keywords: Trust graph Anonymity Onion routing a b s t r a c

  17. Graph Ramsey Theory and the Polynomial Hierarchy Marcus Schaefer

    E-Print Network [OSTI]

    Schaefer, Marcus

    Graph Ramsey Theory and the Polynomial Hierarchy Marcus Schaefer School of CTI DePaul University In the Ramsey theory of graphs F # (G, H) means that for every way of coloring the edges of F red and blue F, a priori, that such a number even exists. Frank Ramsey [Ram30, GRS90] showed in 1930 that the number

  18. Planar Ramsey Numbers for Small Graphs Andrzej Dudek

    E-Print Network [OSTI]

    Ruciñski, Andrzej

    Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Adam Mickiewicz University Pozna´n, Poland Abstract Given two graphs G1 and G2, the planar Ramsey a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been deter

  19. Querying RDF Data from a Graph Database Perspective

    E-Print Network [OSTI]

    Baeza-Yates, Ricardo

    }@dcc.uchile.cl Agenda · Motivations, Problem and Proposal · Database Models · Graph Database Models · RDF as data model of data model with inherent graph structure. · Database models and query languages should support its that a query language for RDF should provide. Database Models Data structures Operators and Query Language

  20. Priority Algorithms for Graph Optimization Problems Allan Borodin

    E-Print Network [OSTI]

    Larsen, Kim Skak

    Priority Algorithms for Graph Optimization Problems Allan Borodin University of Toronto bor of priority or "greedy-like" algorithms as initiated in [10] and as extended to graph theoretic problems, there are several natural input formulations for a given problem and we show that priority algorithm bounds

  1. Critical behavior in inhomogeneous random graphs Remco van der Hofstad

    E-Print Network [OSTI]

    Hofstad, Remco van der

    Critical behavior in inhomogeneous random graphs Remco van der Hofstad June 10, 2010 Abstract We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. The edge probabilities are moderated by vertex weights

  2. Generating Fast Code from Concurrent Program Dependence Graphs

    E-Print Network [OSTI]

    such synchronous concurrent specifications. Starting from a concurrent program dependence graph generated fromGenerating Fast Code from Concurrent Program Dependence Graphs Jia Zeng Cristian Soviani Stephen A, this approach can be unpredictable and difficult to debug. Synchronous concurrency, in which a sys- tem marches

  3. Grid Intersection Graphs and Order Dimension Steven Chaplick

    E-Print Network [OSTI]

    Felsner, Stefan

    in Figure 2. A grid intersection graph (GIG) is an intersection graph of horizontal and vertical segments intersects, some authors prefer to call this class pure-GIG. If G admits a grid Supported by ESF Euro Structures' (GRK 1408) 1 #12;bipartite permutation Stick 3-DORG UGIGStabGIG GIG 4-DORG SegRay 2-DORG Bip

  4. GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS

    E-Print Network [OSTI]

    Craciun, Gheorghe

    GRAPH THEORETIC APPROACHES TO INJECTIVITY IN CHEMICAL REACTION SYSTEMS MURAD BANAJI AND GHEORGHE algebraic and graph theoretic conditions for injectivity of chemical reaction systems. After developing the possibility of multiple equilibria in the systems in question. Key words. Chemical reactions; Injectivity; SR

  5. The Parallel BGL: A Generic Library for Distributed Graph Computations

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    ] and written in a style similar to the C++ Standard Template Library (STL) [38, 46], 1 #12;data types providedThe Parallel BGL: A Generic Library for Distributed Graph Computations Douglas Gregor and Andrew,lums}@osl.iu.edu Abstract This paper presents the Parallel BGL, a generic C++ library for distributed graph computation

  6. An Experimental Comparison of Pregel-like Graph Processing Systems

    E-Print Network [OSTI]

    Daudjee, Khuzaima

    Attribution- NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this li- cense, visit http://creativecommons.org/licenses/by-nc Apache Hama [2], Apache Giraph [1], Catch the Wind (CatchW) [34], GPS [32], GraphLab [28] (which now incorporates PowerGraph [18]), and Mizan [23]. The relative performance characteristics of such systems

  7. Linear-Time Algorithms for Proportional Contact Graph Representations

    E-Print Network [OSTI]

    Kobourov, Stephen G.

    Linear-Time Algorithms for Proportional Contact Graph Representations Technical Report CS-2011. In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional to a given weight, and edges are represented by adjacencies between the corresponding pairs

  8. On global offensive k-alliances in graphs

    E-Print Network [OSTI]

    Bermudo, Sergio; Sigarreta, Jose M; Yero, Ismael G

    2008-01-01

    We investigate the relationship between global offensive $k$-alliances and some characteristic sets of a graph including $r$-dependent sets and $\\tau$-dominating sets. As a consequence of the study, we obtain bounds on the global offensive $k$-alliance number in terms of several parameters of the graph.

  9. Scalability Analysis of Partitioning Strategies for Finite Element Graphs. \\Lambda

    E-Print Network [OSTI]

    Kumar, Vipin

    Scalability Analysis of Partitioning Strategies for Finite Element Graphs. \\Lambda Grama Y. Ananth Y. Grama ananth@cs:umn:edu Abstract Issues of partitioning Finite Element Graphs are central for implementing the Finite Element Method (FEM). Parallel formulations of finite element techniques require

  10. Bicyclic graphs with exactly two main signless Laplacian eigenvalues

    E-Print Network [OSTI]

    Huang, He

    2012-01-01

    A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.

  11. Universal random semi-directed graphs Anthony Bonato

    E-Print Network [OSTI]

    Bonato, Anthony

    , are of smaller order than the order of the graph). For example, power laws and the small world prop- erty have. Abstract Motivated by models for real-world networks such as the web graph, we consider digraphs formed by adding new vertices joined to a fixed constant m number of existing vertices of prescribed type. We

  12. Statistical Selection of Congruent Subspaces for Mining Attributed Graphs

    E-Print Network [OSTI]

    Antwerpen, Universiteit

    Statistical Selection of Congruent Subspaces for Mining Attributed Graphs Patricia Iglesias S (KIT), Germany University of Antwerp, Belgium {patricia.iglesias, emmanuel.mueller, fabian.laforet, fabian.keller, klemens.boehm}@kit.edu Abstract--Current mining algorithms for attributed graphs exploit

  13. Unicyclic graphs with large energy Eric Ould Dadah Andriantiana 1

    E-Print Network [OSTI]

    Wagner, Stephan

    Unicyclic graphs with large energy Eric Ould Dadah Andriantiana 1 and Stephan Wagner 2 Department Abstract We study the energy (i.e., the sum of the absolute values of all eigenvalues) of so- called on the largest and second-largest energy of a unicyclic graph due to Caporossi, Cvetkovi´c, Gutman and Hansen

  14. Waste generator services implementation plan

    SciTech Connect (OSTI)

    Mousseau, J.; Magleby, M.; Litus, M.

    1998-04-01

    Recurring waste management noncompliance problems have spurred a fundamental site-wide process revision to characterize and disposition wastes at the Idaho National Engineering and Environmental Laboratory. The reengineered method, termed Waste Generator Services, will streamline the waste acceptance process and provide waste generators comprehensive waste management services through a single, accountable organization to manage and disposition wastes in a timely, cost-effective, and compliant manner. This report outlines the strategy for implementing Waste Generator Services across the INEEL. It documents the culmination of efforts worked by the LMITCO Environmental Management Compliance Reengineering project team since October 1997. These efforts have included defining problems associated with the INEEL waste management process; identifying commercial best management practices; completing a review of DOE Complex-wide waste management training requirements; and involving others through an Integrated Process Team approach to provide recommendations on process flow, funding/charging mechanisms, and WGS organization. The report defines the work that will be performed by Waste Generator Services, the organization and resources, the waste acceptance process flow, the funding approach, methods for measuring performance, and the implementation schedule and approach. Field deployment will occur first at the Idaho Chemical Processing Plant in June 1998. Beginning in Fiscal Year 1999, Waste Generator Services will be deployed at the other major INEEL facilities in a phased approach, with implementation completed by March 1999.

  15. Indigenous Services Services for Students

    E-Print Network [OSTI]

    Sinnamon, Gordon J.

    STUDENT SERVICES Indigenous Services Services for Students with Disabilities Learning Skills Distance Studies Continuing Studies Student Success CentreLEARNING SERVICES TEACH ING& DEVELOPM E NTCENTRE collaborative and student- focused efforts make a difference. John Doerksen Vice-Provost (Academic Programs

  16. Performance Auditing of Energy Management Programs 

    E-Print Network [OSTI]

    White, J. A.

    1988-01-01

    conservation remains an effective way to reduce operating costs without cutting services. This paper describes a review process that can be used by managers and engineers to improve an organization's overall energy management program. This energy management...

  17. Workforce Management Office (WFMO) Functional Statements WORKFORCE MANAGEMENT OFFICE

    E-Print Network [OSTI]

    May 2014 Workforce Management Office (WFMO) ­ Functional Statements WORKFORCE MANAGEMENT OFFICE The Workforce Management Office (WFMO) is the servicing Human Resource Organization for NOAA and is the principal contact point with the Department of Commerce (DOC) Office of Human Resources Management. WFMO

  18. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

    L. Aolita; D. Cavalcanti; R. Chaves; C. Dhara; L. Davidovich; A. Acin

    2011-03-29

    A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details 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.

  19. Adiabatic graph-state quantum computation

    E-Print Network [OSTI]

    Bobby Antonio; Damian Markham; Janet Anders

    2014-12-19

    Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with \\emph{gflow} can be converted into an adiabatically driven holonomic computation, which we call \\emph{adiabatic graph-state quantum computation} (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of $\\dot{H}$ as well as the degree of $H$, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated.

  20. International energy indicators. [Statistical tables and graphs

    SciTech Connect (OSTI)

    Bauer, E.K. (ed.)

    1980-05-01

    International statistical tables and graphs are given for the following: (1) Iran - Crude Oil Capacity, Production and Shut-in, June 1974-April 1980; (2) Saudi Arabia - Crude Oil Capacity, Production, and Shut-in, March 1974-Apr 1980; (3) OPEC (Ex-Iran and Saudi Arabia) - Capacity, Production and Shut-in, June 1974-March 1980; (4) Non-OPEC Free World and US Production of Crude Oil, January 1973-February 1980; (5) Oil Stocks - Free World, US, Japan, and Europe (Landed, 1973-1st Quarter, 1980); (6) Petroleum Consumption by Industrial Countries, January 1973-December 1979; (7) USSR Crude Oil Production and Exports, January 1974-April 1980; and (8) Free World and US Nuclear Generation Capacity, January 1973-March 1980. Similar statistical tables and graphs included for the United States include: (1) Imports of Crude Oil and Products, January 1973-April 1980; (2) Landed Cost of Saudi Oil in Current and 1974 Dollars, April 1974-January 1980; (3) US Trade in Coal, January 1973-March 1980; (4) Summary of US Merchandise Trade, 1976-March 1980; and (5) US Energy/GNP Ratio, 1947 to 1979.

  1. Component evolution in general random intersection graphs

    SciTech Connect (OSTI)

    Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Hengartner, Nick [Los Alamos National Laboratory; Percus, Allon G [CLAREMONT GRADUATE UNIV.

    2010-01-01

    We analyze component evolution in general random intersection graphs (RIGs) and give conditions on existence and uniqueness of the giant component. Our techniques generalize the existing methods for analysis on component evolution in RIGs. That is, we analyze survival and extinction properties of a dependent, inhomogeneous Galton-Watson branching process on general RIGs. Our analysis relies on bounding the branching processes and inherits the fundamental concepts from the study on component evolution in Erdos-Renyi graphs. The main challenge becomes from the underlying structure of RIGs, when the number of offsprings follows a binomial distribution with a different number of nodes and different rate at each step during the evolution. RIGs can be interpreted as a model for large randomly formed non-metric data sets. Besides the mathematical analysis on component evolution, which we provide in this work, we perceive RIGs as an important random structure which has already found applications in social networks, epidemic networks, blog readership, or wireless sensor networks.

  2. WORK FOR UGA FOOD SERVICES

    E-Print Network [OSTI]

    Arnold, Jonathan

    A STUDENT MANAGEMENT PROGRAM THAT ALLOWS MOTIVATED STUDENTS TO GET REAL MANAGEMENT EXPERIENCE BEFORE GOING SERVICES, YOUR BASIC JOB IS ALWAYS THE SAME: SERVE OUR CUSTOMERS A QUALITY PRODUCT IN A CLEAN, SAFE, AND FRIENDLY ENVIRONMENT. STUDENT EMPLOYEES DO MANY DIFFERENT TASKS WITHIN OUR OPERATIONS TO SERVE OUR

  3. Basic Services, Low-Income Settlements and the Local State: How Collectively-Organized Initiatives Redress Inequalities

    E-Print Network [OSTI]

    Pierce, Gregory Scott

    2015-01-01

    door to door solid waste management and water service. Inprivatization of solid waste management. The HMWSSB has alsoresponsibility for solid waste management in the slum, but

  4. A Conceptual Framework & Monitoring System for Rangeland Ecosystem Goods, Services & Processes Adaptive Management Cycle. Adapted from Williams, B. K., R. C. Szaro, and C. D. Shapiro. 2007. Adaptive Management: The U.S.

    E-Print Network [OSTI]

    Wyoming, University of

    the economic system, they are transported, and usually transformed or combined with other goods and services by prices in market transactions or revealed by other human behaviors. Using prices derived from market). Non-market values may be estimated by methods such as travel cost or contingent valuation

  5. Office of Information Management

    Broader source: Energy.gov [DOE]

    The Office of Information Management provides a broad range of information technology services in support of the Associate Under Secretary for the Office of Environment, Health, Safety and Security (AU).

  6. Configuration Change Management

    E-Print Network [OSTI]

    Yoder, Nathaniel

    2012-05-11

    shown that if a company does not continue to innovate, whether it is products or services, it will not be able to remain successful. This philosophy is extremely important with design engineering companies. If managed correctly, change can be a...

  7. Online, Data Driven Learning Approaches in Operations Management Problems

    E-Print Network [OSTI]

    Ramamurthy, Vivek

    2012-01-01

    quality of service implications of arrival rate forecast errors. In contrast, operations managementquality of service implications of arrival- rate forecast errors. In contrast, operations management

  8. Energy Models for Drawing Signed Graphs Anne-Marie Kermarrec and Afshin Moin

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    by proposing a dual energy model for graphs containing uniquely negative edges, and combining it linearly

  9. A characterization of K2,4-minor-free graphs M. N. Ellingham1

    E-Print Network [OSTI]

    Ellingham, Mark

    A characterization of K2,4-minor-free graphs M. N. Ellingham1 Emily A. Marshall1,2 Department structural characterization of K2,4-minor-free graphs. The 3-connected K2,4- minor-free graphs consist many forbidden minors. So characterizations of graphs without one or two specific minors form natural

  10. The Generic Graph Component Library LieQuan Lee Jeremy G. Siek Andrew Lumsdaine

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    The Generic Graph Component Library Lie­Quan Lee Jeremy G. Siek Andrew Lumsdaine Laboratory In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data struc­ tures and graph algorithms. Following the theme of the Standard Template Library (STL

  11. 2-Source Dispersers for no(1) Entropy, and Ramsey Graphs Beating

    E-Print Network [OSTI]

    Shaltiel, Ronen

    2-Source Dispersers for no(1) Entropy, and Ramsey Graphs Beating the Frankl-Wilson Construction of a bipartite graph, this gives an explicit construction of a bipartite K-Ramsey graph of 2N vertices [BKS+ 05]. As a corollary, we get a construction of a 22log1-0 n (non bipartite) Ramsey graph of 2n

  12. Online Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B. Kinnersley,

    E-Print Network [OSTI]

    West, Douglas B.

    On­line Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B. Abstract When graph Ramsey theory is viewed as a game, ``Painter'' 2­colors the edges of a graph presented­line degree Ramsey number š R# (G) is the least k such that Builder wins (G, H) when H is the class of graphs

  13. On-line Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B. Kinnersley,

    E-Print Network [OSTI]

    West, Douglas B.

    On-line Ramsey Theory for Bounded Degree Graphs Jane Butterfield, Tracy Grauman, William B When graph Ramsey theory is viewed as a game, "Painter" 2-colors the edges of a graph presented-line degree Ramsey number °R(G) is the least k such that Builder wins (G, H) when H is the class of graphs

  14. Constructing Ramsey graphs from small probability spaces IBM Almaden Research Center

    E-Print Network [OSTI]

    Naor, Moni

    Constructing Ramsey graphs from small probability spaces Moni Naor IBM Almaden Research Center 650 Harry Road San­Jose CA 95120 naor@almaden.ibm.com Abstract The problem of explicitly constructing Ramsey of all graphs in a distribution that is known to have mostly Ramsey graphs. Keywords: Ramsey Graphs

  15. Constructing Ramsey graphs from small probability spaces IBM Almaden Research Center

    E-Print Network [OSTI]

    Naor, Moni

    Constructing Ramsey graphs from small probability spaces Moni Naor IBM Almaden Research Center 650 Harry Road San-Jose CA 95120 naor@almaden.ibm.com Abstract The problem of explicitly constructing Ramsey of all graphs in a distribution that is known to have mostly Ramsey graphs. Keywords: Ramsey Graphs

  16. A Graph-Based Data Model and its Ramifications Mark Levene and George Loizou

    E-Print Network [OSTI]

    Levene, Mark

    A Graph-Based Data Model and its Ramifications Mark Levene and George Loizou Abstract- Currently candidate for for- malising hypertext. We then compare it with other graph-based data models and with set-based as a paradigm for graph-based data modelling, we show how to bridge the gap between graph-based and set-based

  17. Interactive Visualization of Genealogical Graphs Michael J. McGuffin Ravin Balakrishnan

    E-Print Network [OSTI]

    Toronto, University of

    Interactive Visualization of Genealogical Graphs Michael J. McGuffin Ravin Balakrishnan Department of visualizing "family trees", or genealogi- cal graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs can be difficult to draw. This motivates some novel

  18. Poisonous Plant Management

    E-Print Network [OSTI]

    McGinty, Allan

    1985-01-01

    range specialist, The Texas A&M University System . 2 DIAGNOSING POISONOOS PLANT PROBLEMS Accurate diagnosis of poisonous plant problems can be extremely difficult. Many cases of livestock poisoning by plants have been improperly diagnosed... Agricultural Extension Service ~-P~,IJ& H~iN!/ P~,IJ&--------------- poisonous Plant ___ Management_ ..... Texas Agricultural Extension Service. The Texas A&M University System. College Station, Texas POISONO(]S PLANT MANAGEMENT Allan McGinty* Poisonous...

  19. The Incidence Hopf Algebra of Graphs

    E-Print Network [OSTI]

    Humpert, Brandon; Martin, Jeremy L.

    2012-05-03

    ), unit u(1) = K 0 , comultiplication ?(G) = ? T?V (G) G|T ?G|T , and counit #3;(G) = { 1 if n(G) = 0, 0 if n(G) > 0. The graph algebra is commutative and cocommutative; in particular, its character group X(G) is abelian. As proved by Schmitt [Sch94, (12.1...) counts the number of k-colorings of G such that every color-induced subgraph is H-free. As an extreme example, if G = H , then P?G(G; k) = k n(G) ? k, because the non-G-free colorings are precisely those using only one color. If H = Km,1, then Pm(G; k...

  20. Bicyclic graphs with maximal revised Szeged index

    E-Print Network [OSTI]

    Li, Xueliang

    2011-01-01

    The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. Hansen used the AutoGraphiX and made the following conjecture about the revised Szeged index for a connected bicyclic graph $G$ of order $n \\geq 6$:

  1. The normalized Laplacian spectrum of subdivisions of a graph

    E-Print Network [OSTI]

    Pinchen Xie; Zhongzhi Zhang; Francesc Comellas

    2015-10-07

    Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on some relevant dynamical aspects, in particular those related to random walks. In this paper, we give the spectra of the normalized Laplacian of iterated subdivisions of simple connected graphs. As an example of application of these results we find the exact values of their multiplicative degree-Kirchhoff index, Kemeny's constant and number of spanning trees.

  2. ENERGY MANAGEMENT OPERATIONAL PROCEDURE MANUAL

    E-Print Network [OSTI]

    Harman, Neal.A.

    ENERGY MANAGEMENT OPERATIONAL PROCEDURE MANUAL Swansea University Estates Services Singleton Park Swansea SA2 8PP Tel 01792 295819 Fax 01792 295820 #12;Swansea University Energy Management Operational Procedural Manual Estates Services April 2008 rev 1 Created on 4/15/2008 4:23:00 PM - 2 - Contents 1. Energy

  3. Scalable Triadic Analysis of Large-Scale Graphs: Multi-Core vs. Multi-Processor vs. Multi-Threaded Shared Memory Architectures

    SciTech Connect (OSTI)

    Chin, George; Marquez, Andres; Choudhury, Sutanay; Feo, John T.

    2012-09-01

    Triadic analysis encompasses a useful set of graph mining methods that is centered on the concept of a triad, which is a subgraph of three nodes and the configuration of directed edges across the nodes. Such methods are often applied in the social sciences as well as many other diverse fields. Triadic methods commonly operate on a triad census that counts the number of triads of every possible edge configuration in a graph. Like other graph algorithms, triadic census algorithms do not scale well when graphs reach tens of millions to billions of nodes. To enable the triadic analysis of large-scale graphs, we developed and optimized a triad census algorithm to efficiently execute on shared memory architectures. We will retrace the development and evolution of a parallel triad census algorithm. Over the course of several versions, we continually adapted the code’s data structures and program logic to expose more opportunities to exploit parallelism on shared memory that would translate into improved computational performance. We will recall the critical steps and modifications that occurred during code development and optimization. Furthermore, we will compare the performances of triad census algorithm versions on three specific systems: Cray XMT, HP Superdome, and AMD multi-core NUMA machine. These three systems have shared memory architectures but with markedly different hardware capabilities to manage parallelism.

  4. Probabilistic Flooding for Efficient Information Dissemination in Random Graph

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

    Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies 1 & Telecommunications, Athens, Greece Abstract Probabilistic flooding has been frequently considered as a suitable) flooding approaches that are used to disseminate globally information in unstructured peer

  5. Cell-Graph Mining for Breast Tissue Modelling and Classification

    E-Print Network [OSTI]

    Bystroff, Chris

    metrics for tissue characteriza- tion and classification. We segmented the digital images of histopaCell-Graph Mining for Breast Tissue Modelling and Classification C.C¸ agatay Bilgin a, C¸ igdem

  6. Support graph preconditioning for elliptic finite element problems 

    E-Print Network [OSTI]

    Wang, Meiqiu

    2009-05-15

    A relatively new preconditioning technique called support graph preconditioning has many merits over the traditional incomplete factorization based methods. A major limitation of this technique is that it is applicable to ...

  7. Technology Portfolio Planning by Weighted Graph Analysis of System Architectures

    E-Print Network [OSTI]

    de Weck, Olivier L.

    Technology Portfolio Planning by Weighted Graph Analysis of System Architectures Peter Davison architecture selection and technology investment decisions will constrain the system to certain regions architectures, with a view to enabling robustness to technology portfolio realization and later architectural

  8. Temporally Scalable Visual SLAM using a Reduced Pose Graph

    E-Print Network [OSTI]

    Johannsson, Hordur

    2012-05-25

    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 ...

  9. Scalable Parallel Algorithms for Massive Scale-free Graphs 

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05

    Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage “Big Data” to answer next-generation scientific questions. New techniques are required to process large ...

  10. On Graphs that are not PCGs Stephane Durocher1

    E-Print Network [OSTI]

    Durocher, Stephane

    the graph classes that arise from using the intervals [0, dmax] (LPG) and [dmin, ] (mLPG). They proved LPG, mLPG and PCG are similar to the leaf powers and their variants, which have been extensively

  11. Temporally scalable visual SLAM using a reduced pose graph

    E-Print Network [OSTI]

    Johannsson, Hordur

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

  12. Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics

    E-Print Network [OSTI]

    Sven Gnutzmann; Uzy Smilansky

    2006-12-15

    During the last years quantum graphs have become a paradigm of quantum chaos with applications from spectral statistics to chaotic scattering and wave function statistics. In the first part of this review we give a detailed introduction to the spectral theory of quantum graphs and discuss exact trace formulae for the spectrum and the quantum-to-classical correspondence. The second part of this review is devoted to the spectral statistics of quantum graphs as an application to quantum chaos. Especially, we summarise recent developments on the spectral statistics of generic large quantum graphs based on two approaches: the periodic-orbit approach and the supersymmetry approach. The latter provides a condition and a proof for universal spectral statistics as predicted by random-matrix theory.

  13. Generalized Domination in Graphs with Applications in Wireless Networks 

    E-Print Network [OSTI]

    Sung, Je Sang

    2013-12-10

    The objective of this research is to study practical generalization of domination in graphs and explore the theoretical and computational aspects of models arising in the design of wireless networks. For the construction of a virtual backbone of a...

  14. Spectral problems of optical waveguides and quantum graphs 

    E-Print Network [OSTI]

    Ong, Beng Seong

    2006-10-30

    In this dissertation, we consider some spectral problems of optical waveguide and quantum graph theories. We study spectral problems that arise when considerating optical waveguides in photonic band-gap (PBG) materials. Specifically, we address...

  15. Graph Coloring on a Coarse Grained Multiprocessor (extended abstract)

    E-Print Network [OSTI]

    Gebremedhin, Assefaw Hadish

    Graph Coloring on a Coarse Grained Multiprocessor (extended abstract) Assefaw Hadish Gebremedhin1 Allwright et al. (1995). However, in a recent result, Gebremedhin and Manne (1999a, 1999b) present

  16. Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1,

    E-Print Network [OSTI]

    Manne, Fredrik

    Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1, , Fredrik Manne2 , and Tom Woods2 1. Gebremedhin, Fredrik Manne, and Tom Woods However, in practice greedy sequential coloring heuristics have been

  17. SEMANTICS OF PROGRAM REPRESENTATION GRAPHS G. RAMALINGAM and THOMAS REPS

    E-Print Network [OSTI]

    Reps, Thomas W.

    dependence graphs (PDGs) [Kuck81, Ferr87, Horw89]. They have also been used in a new algorithm for merging representation in various appli­ cations such as vectorization, parallelization [Kuck81], and merging program

  18. Bond graph models of electromechanical systems. The AC generator case

    E-Print Network [OSTI]

    Batlle, Carles

    Bond graph models of electromechanical systems. The AC generator case Carles Batlle Department. After reviewing electromechanical energy conversion and torque gener- ation, the core element present in any electromechanical system is introduced, and the corresponding electrical and mechanical ports

  19. Parallel Algorithms for Graph Optimization using Tree Decompositions

    SciTech Connect (OSTI)

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

    2012-06-01

    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.

  20. Computing the stability number of a graph via semidefinite and ...

    E-Print Network [OSTI]

    2006-04-27

    then the vertices of G can be numbered so that E(G8) ? E(G ). Thus G8 is the smallest graph G such that ?(1)(G) > ?(G) = 3. We can extend the above reasoning ...

  1. APPROXIMATING SPECTRAL INVARIANTS OF HARPER OPERATORS ON GRAPHS II

    E-Print Network [OSTI]

    Schick, Thomas

    APPROXIMATING SPECTRAL INVARIANTS OF HARPER OPERATORS ON GRAPHS II VARGHESE MATHAI, THOMAS SCHICK;2 VARGHESE MATHAI, THOMAS SCHICK, AND STUART YATES subset E+ of these edges in which each combinatorial edge

  2. Efficient graphlet kernels for large graph comparison Nino Shervashidze

    E-Print Network [OSTI]

    Mehlhorn, Kurt

    Efficient graphlet kernels for large graph comparison Nino Shervashidze MPI for Biological such as gSpan (Yan & Han, 2003) have been developed for this task, which use el- egant data structures

  3. Automated Inclusive Design Heuristics Generation with Graph Mining 

    E-Print Network [OSTI]

    Sangelkar, Shraddha Chandrakant

    2013-08-01

    from existing inclusive products. Formalization results show that, the rate of rule generation decreases as more products are added to the dataset. The automated method is particularly helpful in the developmental stages of graph mining applications...

  4. Local computation algorithms for graphs of non-constant degrees

    E-Print Network [OSTI]

    Yodpinyanee, Anak

    2014-01-01

    In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time ...

  5. Predictive Mutual Cuts in Graphs: Learning in Bioinformatics

    E-Print Network [OSTI]

    . De Moor K.U. Leuven, ESAT, SCD/SISTA, Kasteelpark Arenberg 10, B-3001, Leuven, Belgium Recent work (mutual graph cuts). Specifically, the problem of mining for correspondances between mi- croarray

  6. Requirements on Quality Specification Posed by Service Orientation

    E-Print Network [OSTI]

    of service management, the technical term Quality of Service (QoS) is now perceived in its original sense: Operations and Management (DSOM 2004), 1-14, Springer, IFIP/IEEE, Davis, CA, USA, November, 2004. #12;theRequirements on Quality Specification Posed by Service Orientation Markus Garschhammer and Harald

  7. A note on light geometric graphs Eyal Ackerman

    E-Print Network [OSTI]

    Fox, Jacob

    A note on light geometric graphs Eyal Ackerman Jacob Fox Rom Pinchasi March 19, 2012 Abstract Let G be a geometric graph on n vertices in general position in the plane. We say that G is k-light if no edge e of G than k edges of G. We extend the previous result in [1] and with a shorter argument show that every k-light

  8. Comprehensive Irrigation Management 

    E-Print Network [OSTI]

    Cook, K.

    2011-01-01

    ? Disconnect with conservation investments & sustainable water savings ? High turnover rates among property managers and landscape contractors ? Economic pressures on operating expense to maintain system integrity Result: Devalued service with zero... consumption ? Soil characteristics ? Environmental conditions ? Landscape cultural practices ? Irrigation system performance Comprehensive Irrigation Management ? Restoration of antiquated irrigation systems ? Implementation of new control...

  9. Copying Maple graphs into Word Once you create a graph with Maple, you can copy and paste it into Word pretty

    E-Print Network [OSTI]

    Zirbel, Craig L.

    Copying Maple graphs into Word Once you create a graph with Maple, you can copy and paste it into Word pretty easily. However, you might be unhappy with the result, if it looks like this: This image to get the image into Word in a better way. Below are two Maple graphs. On a Macintosh, you can click

  10. Network Management Network Management

    E-Print Network [OSTI]

    Giaccone, Paolo

    Network Management Pag. 1 Network Management Network management and QoS provisioning - 1Andrea of this license visit: http://creativecommons.org/licenses/by-nc- /3 0/ Network management and QoS provisioning ­ Chapter 9, Network Management, of the book Jim Kurose, Keith Ross, Computer Networking, A Top Down

  11. Management Plan Management Plan

    E-Print Network [OSTI]

    Management Plan Management Plan "Management and restoration programs for native salmonids have communities" J. Lichatowich et al. 1998. A Conceptual Foundation for the Management of Native Salmonids in the Deschutes River. The Management Plan consists of five elements described in the Council's program: 1

  12. Noisy entanglement evolution for graph states

    E-Print Network [OSTI]

    Aolita, L; Chaves, R; Dhara, C; Davidovich, L; Acin, A

    2010-01-01

    A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the entanglement of the entire state as a function only of the state of a considerably-smaller subsystem, which undergoes an effective noise process. This provides a huge simplification on the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in details 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 ...

  13. Quantum Vacuum Energy in Graphs and Billiards

    E-Print Network [OSTI]

    L. Kaplan

    2011-01-03

    The vacuum (Casimir) energy in quantum field theory is a problem relevant both to new nanotechnology devices and to dark energy in cosmology. The crucial question is the dependence of the energy on the system geometry under study. Despite much progress since the first prediction of the Casimir effect in 1948 and its subsequent experimental verification in simple geometries, even the sign of the force in nontrivial situations is still a matter of controversy. Mathematically, vacuum energy fits squarely into the spectral theory of second-order self-adjoint elliptic linear differential operators. Specifically, one promising approach is based on the small-t asymptotics of the cylinder kernel e^(-t sqrt(H)), where H is the self-adjoint operator under study. In contrast with the well-studied heat kernel e^(-tH), the cylinder kernel depends in a non-local way on the geometry of the problem. We discuss some results by the Louisiana-Oklahoma-Texas collaboration on vacuum energy in model systems, including quantum graphs and two-dimensional cavities. The results may shed light on general questions, including the relationship between vacuum energy and periodic or closed classical orbits, and the contribution to vacuum energy of boundaries, edges, and corners.

  14. Alliance free sets in Cartesian product graphs

    E-Print Network [OSTI]

    Yero, Ismael G; Bermudo, Sergio

    2011-01-01

    Let $G=(V,E)$ be a graph. For a non-empty subset of vertices $S\\subseteq V$, and vertex $v\\in V$, let $\\delta_S(v)=|\\{u\\in S:uv\\in E\\}|$ denote the cardinality of the set of neighbors of $v$ in $S$, and let $\\bar{S}=V-S$. Consider the following condition: {equation}\\label{alliancecondition} \\delta_S(v)\\ge \\delta_{\\bar{S}}(v)+k, \\{equation} which states that a vertex $v$ has at least $k$ more neighbors in $S$ than it has in $\\bar{S}$. A set $S\\subseteq V$ that satisfies Condition (\\ref{alliancecondition}) for every vertex $v \\in S$ is called a \\emph{defensive} $k$-\\emph{alliance}; for every vertex $v$ in the neighborhood of $S$ is called an \\emph{offensive} $k$-\\emph{alliance}. A subset of vertices $S\\subseteq V$, is a \\emph{powerful} $k$-\\emph{alliance} if it is both a defensive $k$-alliance and an offensive $(k +2)$-alliance. Moreover, a subset $X\\subset V$ is a defensive (an offensive or a powerful) $k$-alliance free set if $X$ does not contain any defensive (offensive or powerful, respectively) $k$-allianc...

  15. Engineering Service Products: The Case of Mass-Customizing Service Agreements for Heavy Equipment

    E-Print Network [OSTI]

    Hsu, Cheng

    Technology and Management, 2005. 1 #12;ABSTRACT Service agreements are one-of-a-kind, and commit the service pronounced in the Information Technology (IT) industry and the IT-based non-manufacturing service sector they need. We submit that the mass customization model of manufacturing can help solve the problem; however

  16. Requirements for Web Service Composition Babak Esfandiari, Vladimir Tosic

    E-Print Network [OSTI]

    Requirements for Web Service Composition Management Babak Esfandiari, Vladimir Tosic { babak Language) Web services [Cer02] can be used for providing services to end users, the true power of Web Service technologies is leveraged through compositions (orchestrations and choreographies [Pel03]) of Web

  17. Maui Smart Grid Demonstration Project Managing Distribution System Resources for Improved Service Quality and Reliability, Transmission Congestion Relief, and Grid Support Functions

    SciTech Connect (OSTI)

    none,

    2014-09-30

    The Maui Smart Grid Project (MSGP) is under the leadership of the Hawaii Natural Energy Institute (HNEI) of the University of Hawaii at Manoa. The project team includes Maui Electric Company, Ltd. (MECO), Hawaiian Electric Company, Inc. (HECO), Sentech (a division of SRA International, Inc.), Silver Spring Networks (SSN), Alstom Grid, Maui Economic Development Board (MEDB), University of Hawaii-Maui College (UHMC), and the County of Maui. MSGP was supported by the U.S. Department of Energy (DOE) under Cooperative Agreement Number DE-FC26-08NT02871, with approximately 50% co-funding supplied by MECO. The project was designed to develop and demonstrate an integrated monitoring, communications, database, applications, and decision support solution that aggregates renewable energy (RE), other distributed generation (DG), energy storage, and demand response technologies in a distribution system to achieve both distribution and transmission-level benefits. The application of these new technologies and procedures will increase MECO’s visibility into system conditions, with the expected benefits of enabling more renewable energy resources to be integrated into the grid, improving service quality, increasing overall reliability of the power system, and ultimately reducing costs to both MECO and its customers.

  18. RESTful Web Services at BNL

    SciTech Connect (OSTI)

    Casella, R.

    2011-06-14

    RESTful (REpresentational State Transfer) web services are an alternative implementation to SOAP/RPC web services in a client/server model. BNLs IT Division has started deploying RESTful Web Services for enterprise data retrieval and manipulation. Data is currently used by system administrators for tracking configuration information and as it is expanded will be used by Cyber Security for vulnerability management and as an aid to cyber investigations. This talk will describe the implementation and outstanding issues as well as some of the reasons for choosing RESTful over SOAP/RPC and future directions.

  19. Coiled tubing; Operations and services

    SciTech Connect (OSTI)

    Sas-Jaworsky, A. II )

    1991-12-01

    This article outlines the minimum safety requirements that should be considered for onshore and offshore oil well service operations with coiled tubing equipment. These guidelines comply with Minerals Management Service (MMS) regulations issued on May 31, 1988, for offshore work. Where specific MMS regulations are sited, the regulation reference, Incident of Non-Compliance (INC), number is provided. These guidelines can be used by operators and contractors, and although U.S. offshore operations are emphasized, they are applicable wherever coiled tubing services are used.

  20. Green's function approach for quantum graphs: an overview

    E-Print Network [OSTI]

    Fabiano M. Andrade; Alexandre G. M. Schmidt; Eduardo Vicentini; Bin K. Cheng; Marcos G. E. da Luz

    2016-01-05

    Here we review the many interesting aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. Such approach is particularly interesting because $G$ can be written as a sum over classical-like paths, where local quantum effects are taking into account through the scattering matrix amplitudes (basically, transmission and reflection coefficients) defined on each one of the graph vertices. So, the {\\em exact} $G$ has the functional form of a generalized semiclassical formula, which through different calculation techniques (addressed in details here) always can be cast into a closed analytic expression. This allows to solve exactly arbitrary large (although finite) graphs in a recursive and fast way. Using the Green's function method, we survey many properties for open and closed quantum graphs, like scattering solutions for the former and eigenspectrum and eigenstates for the latter, also addressing quasi-bound states. Concrete examples, like cube, binary trees and Sierpi\\'nski-like, topologies are considered. Along the work, possible distinct applications using the Green's function methods for quantum graphs are outlined.