text:
Office of Scientific and Technical Information
Science Conference Proceedings (OSTI)
... C++). More information. Journal of Combinatorics dynamic surveys DS8 and DS9 are a bibliography and glossary of graphs. ...
Transportation and Program Management Services | Department of...
Energy.gov (U.S. Department of Energy (DOE)) Indexed Site
and Program Management Services Transportation and Program Management Services Overview of Secured Transportation Services (STS) Transportation and Program Management Services More...
Federal Energy Management Program: Services
NLE Websites -- All DOE Office Websites (Extended Search)
Services to Services to someone by E-mail Share Federal Energy Management Program: Services on Facebook Tweet about Federal Energy Management Program: Services on Twitter Bookmark Federal Energy Management Program: Services on Google Bookmark Federal Energy Management Program: Services on Delicious Rank Federal Energy Management Program: Services on Digg Find More places to share Federal Energy Management Program: Services on AddThis.com... Project Assistance Training Outreach Services The Federal Energy Management Program (FEMP) offers specialized services through: Technical and Project Assistance: Find resources for technical assistance and information about FEMP calls for projects. Training: Look up FEMP-produced live and on-demand courses, workshops, and webinars. Outreach: Get information about awards and campaigns that motivate energy-
Federal Energy Management Program: Energy Service Companies
Service Companies to someone by E-mail Share Federal Energy Management Program: Energy Service Companies on Facebook Tweet about Federal Energy Management Program: Energy Service...
Security Services Management (Section B)
To take the next step in information security, Security Services Management provides a comprehensive approach to managing people, process, and technology through the sound application of metrics. This book demonstrates how to develop a balanced strategy ...
James S. Tiller
University Services Facilities Management
E-Print Network (OSTI)
Loughlin is the practice area leader for Network Automation and Analytics with the IBM Global Business Services, Energy by leveraging all of the benefits of automation and digitization. Mark Welch and Kieran McLoughlin, IBM Global Business Services www.UtilitiesProject.com/10744 CHAPTER are being made by utilities in automation, remote
Weiblen, George D
Graph-based reasoning in collaborative knowledge management for industrial maintenance
Capitalization and sharing of lessons learned play an essential role in managing the activities of industrial systems. This is particularly the case for the maintenance management, especially for distributed systems often associated with collaborative ... Keywords: Case-based reasoning, Conceptual graph rule, Experience feedback, Expert knowledge, Fleet considerations, Maintenance management
Bernard Kamsu-Foguem, Daniel Noyes
Transportation and Program Management Services
Atlanta, Georgia Atlanta, Georgia Transportation and Program Management Services Secured Transportation Services, LLC Founded: December, 2003 ff Staff: 7 Experience: Over 145 years combined experience in Nuclear Transportation, Security, HP & Operations Services Transportation The largest Transportation Coordinators of Spent Nuclear Fuel in North America On-Site, Hands-On Assistance (Before & During both Loading & Transport) P d A i t (W iti d/ R i ) Procedure Assistance (Writing and/or Review) Package Handling, Loading Services Certificate of Compliance and Competent Authority Reviews & Requests Carrier Coordination (Empty Packages & Equipment, Loaded, & Returns) Vessel Charters, Special Trains, Dedicated Exclusive Use Trucks p
A Fuzzy Graph-Based Model for Selecting Knowledge Management Tools in Innovation Processes
The evolution of organization, management, and production processes is moving towards more complexity every day. An improvement of the performance by the recovery and reuse of resources can be reached by going beyond traditional boundaries and by enforcing ... Keywords: Conflict Resolution, Fuzzy Linguistic Aggregation, Graph Theory, Knowledge Management, Process Innovation
Kouroush Jenab; Ahmad R. Sarfaraz
Federal Energy Management Program: General Services Administration -
General Services General Services Administration - Suitland, Maryland to someone by E-mail Share Federal Energy Management Program: General Services Administration - Suitland, Maryland on Facebook Tweet about Federal Energy Management Program: General Services Administration - Suitland, Maryland on Twitter Bookmark Federal Energy Management Program: General Services Administration - Suitland, Maryland on Google Bookmark Federal Energy Management Program: General Services Administration - Suitland, Maryland on Delicious Rank Federal Energy Management Program: General Services Administration - Suitland, Maryland on Digg Find More places to share Federal Energy Management Program: General Services Administration - Suitland, Maryland on AddThis.com... Energy-Efficient Products
Information Management, Analytics & Optimization Services IMS System Maintenance Service Offering
Information Management, Analytics & Optimization Services IMS System Maintenance Service Offering The IMS System Maintenance Review offering is a special service offering from the IMS laboratory Technical Specialist group. Complex IMS systems require periodic maintenance, coupled with a specific testing process
Management of high availability services using virtualization.
??This thesis examines the use of virtualization in management of high availability services using open source tools. The services are hosted in virtual machines, which� (more)
Braastad, Espen
An Interdisciplinary Perspective on IT Services Management and Service Science
The increasing importance of information technology (IT) services in the global economy prompts researchers in the field of information systems (IS) to give special attention to the foundations of managerial and technical knowledge in this emerging arena ... Keywords: Cloud Computing, Economics, Is, It Services, Literature Survey, Marketing, Operations, Research Directions, Service Science, Services Management, Services-Oriented Systems, System Science
Indranil Bardhan; Haluk Demirkan; P. Kannan; Robert Kauffman; Ryan Sougstad
Product management in software as a service
Software product management within Software as a Service is key domain of interest given the recent advances in Cloud Computing. This thesis explores the product management challenges within this domain. It makes a ...
Rajasekharan, Karthikeyan
Approach to Service Management in SOA Space Approach to Service Management In SOA Space
SOA Management covers the Management and Monitoring of applications, services, processes, middleware, infrastructure, and software tools in accordance with the business goals. Managing SOA is a multi-faced task, as it covers IT Management and Business Service Management. Service management can be classified into two areas (i) Runtime (ii) Design time. Some of the activities involved in runtime may trigger activities in design time. Design time activities are part of the service development and maintenance lifecycle. The majority of the service management aspects concentrate on Registry, Repository, Metamodel, Configurability, Policy Management and Enforcement, and Operational aspects of service infrastructure. This paper consolidates the management of SOA at different layers and the various challenges that are faced for SOA management.
Gopala Krishna Behara; Srikanth Inaganti
Create reports and graphs | ENERGY STAR Buildings & Plants
Create reports and graphs Create reports and graphs Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing buildings Commercial new construction Industrial energy management Small business Service providers Service and product providers Verify applications for ENERGY STAR certification Design commercial buildings Energy efficiency program administrators Commercial and industrial program sponsors Associations State and local governments Federal agencies Tools and resources Training In this section Learn the benefits Get started Use Portfolio Manager The new ENERGY STAR Portfolio Manager How Portfolio Manager helps you save The benchmarking starter kit Identify your property type Enter data into Portfolio Manager The data quality checker How Portfolio Manager calculates metrics
Security Event and Log Management Service
Security Event and Log Management Service: Comprehensive, Cost-effective Approach to Enhance Network Security and Security Data Management IBM Global Technology Services December 2007 #12;Executive Summary The economics of network security have changed. The high cost and complexity inherent in the use
Improving employment services management using IPA technique
This study is intended to build a management mechanism that continuously improves Public Employment Services (PESs), using the Importance-Performance Analysis (IPA). First of all, experts were consulted to create indicators and questionnaires for the ... Keywords: Employment service, Importance-Performance Analysis, Management mechanism, Quality indicator
Chi-Cheng Chang
An approach for managing web services changes
The dynamic environment where organisations and providers live imposes a gradually evolving of their services to meet new needs, technological changes and requirements of these users. Therefore, the evolution of web services becomes necessary because ... Keywords: adaptation rules, behaviour evolution, change management, change operators, change process, web services
Maamar Khater; Mimoun Malki
Energy Management Services LLC | Open Energy Information
Open Energy Info (EERE)
Energy Management Services LLC Energy Management Services LLC Jump to: navigation, search Name Energy Management Services LLC Place Encinitas, California Zip CA. 92024 Sector Services Product Energy Management Services, Inc coordinates consumers and natural gas supplyers. It also offers marketing and financing consultation. Coordinates 33.045436°, -117.292518° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":33.045436,"lon":-117.292518,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}
Alert-Driven E-Service Management
Process management technology has recently been employed not only within businesses but also in provision of E-services over the Internet. Urgent requests and critical messages in these systems (referred to as alerts) should be delivered and handled ...
Dickson K. W. Chiu; Benny W. C. Kwok; Ray L. S. Wong; S. C. Cheung; Eleanna Kafeza
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
facilitate the Federal Government's implementation of sound, cost-effective energy management and investment practices to enhance the nation's energy security and...
Use web services to exchange data with Portfolio Manager | ENERGY...
Service and product providers Use web services to exchange data with Portfolio Manager Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and...
Diversity Management and Office of International Services Staff
Diversity Management and Office of International Services Staff Chief Human Resources Officer Robert Lincoln Manager Diversity Office and Office of International Services Shirley...
Resource Management Services: Land Use, Part 505: Coastal Erosion...
5: Coastal Erosion Management (New York) Resource Management Services: Land Use, Part 505: Coastal Erosion Management (New York) Eligibility Agricultural Commercial Construction...
Guidelines for Energy Management for Service and Product Providers...
Guidelines for Energy Management for Service and Product Providers Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing...
Categorical Exclusion Determinations: Environmental Management Consolidated Business Service Center
Energy.gov (U.S. Department of Energy (DOE))
Categorical Exclusion Determinations issued by Environmental Management Consolidated Business Service Center.
Federal Energy Management Program: Financing for Utility Energy Service
Financing for Financing for Utility Energy Service Contracts to someone by E-mail Share Federal Energy Management Program: Financing for Utility Energy Service Contracts on Facebook Tweet about Federal Energy Management Program: Financing for Utility Energy Service Contracts on Twitter Bookmark Federal Energy Management Program: Financing for Utility Energy Service Contracts on Google Bookmark Federal Energy Management Program: Financing for Utility Energy Service Contracts on Delicious Rank Federal Energy Management Program: Financing for Utility Energy Service Contracts on Digg Find More places to share Federal Energy Management Program: Financing for Utility Energy Service Contracts on AddThis.com... Energy Savings Performance Contracts ENABLE Utility Energy Service Contracts
Federal Energy Management Program: Resources on Utility Energy Service
Resources on Resources on Utility Energy Service Contracts to someone by E-mail Share Federal Energy Management Program: Resources on Utility Energy Service Contracts on Facebook Tweet about Federal Energy Management Program: Resources on Utility Energy Service Contracts on Twitter Bookmark Federal Energy Management Program: Resources on Utility Energy Service Contracts on Google Bookmark Federal Energy Management Program: Resources on Utility Energy Service Contracts on Delicious Rank Federal Energy Management Program: Resources on Utility Energy Service Contracts on Digg Find More places to share Federal Energy Management Program: Resources on Utility Energy Service Contracts on AddThis.com... Energy Savings Performance Contracts ENABLE Utility Energy Service Contracts
Federal Energy Management Program: Utility Energy Service Contract Case
Utility Energy Utility Energy Service Contract Case Studies to someone by E-mail Share Federal Energy Management Program: Utility Energy Service Contract Case Studies on Facebook Tweet about Federal Energy Management Program: Utility Energy Service Contract Case Studies on Twitter Bookmark Federal Energy Management Program: Utility Energy Service Contract Case Studies on Google Bookmark Federal Energy Management Program: Utility Energy Service Contract Case Studies on Delicious Rank Federal Energy Management Program: Utility Energy Service Contract Case Studies on Digg Find More places to share Federal Energy Management Program: Utility Energy Service Contract Case Studies on AddThis.com... Energy Savings Performance Contracts ENABLE Utility Energy Service Contracts Types of Contracts
Federal Energy Management Program: Qualified List of Energy Service
Qualified List of Qualified List of Energy Service Companies to someone by E-mail Share Federal Energy Management Program: Qualified List of Energy Service Companies on Facebook Tweet about Federal Energy Management Program: Qualified List of Energy Service Companies on Twitter Bookmark Federal Energy Management Program: Qualified List of Energy Service Companies on Google Bookmark Federal Energy Management Program: Qualified List of Energy Service Companies on Delicious Rank Federal Energy Management Program: Qualified List of Energy Service Companies on Digg Find More places to share Federal Energy Management Program: Qualified List of Energy Service Companies on AddThis.com... Energy Savings Performance Contracts Assistance & Contacts Resources Laws & Regulations Energy Service Companies
Federal Energy Management Program: National Park Service - Yellowstone
National Park National Park Service - Yellowstone National Park, Wyoming to someone by E-mail Share Federal Energy Management Program: National Park Service - Yellowstone National Park, Wyoming on Facebook Tweet about Federal Energy Management Program: National Park Service - Yellowstone National Park, Wyoming on Twitter Bookmark Federal Energy Management Program: National Park Service - Yellowstone National Park, Wyoming on Google Bookmark Federal Energy Management Program: National Park Service - Yellowstone National Park, Wyoming on Delicious Rank Federal Energy Management Program: National Park Service - Yellowstone National Park, Wyoming on Digg Find More places to share Federal Energy Management Program: National Park Service - Yellowstone National Park, Wyoming on
Federal Energy Management Program: National Park Service - San Miguel
National Park National Park Service - San Miguel Island, California to someone by E-mail Share Federal Energy Management Program: National Park Service - San Miguel Island, California on Facebook Tweet about Federal Energy Management Program: National Park Service - San Miguel Island, California on Twitter Bookmark Federal Energy Management Program: National Park Service - San Miguel Island, California on Google Bookmark Federal Energy Management Program: National Park Service - San Miguel Island, California on Delicious Rank Federal Energy Management Program: National Park Service - San Miguel Island, California on Digg Find More places to share Federal Energy Management Program: National Park Service - San Miguel Island, California on AddThis.com... Energy-Efficient Products
Federal Energy Management Program: Utility Energy Service Contracts
Contracts to someone by E-mail Contracts to someone by E-mail Share Federal Energy Management Program: Utility Energy Service Contracts on Facebook Tweet about Federal Energy Management Program: Utility Energy Service Contracts on Twitter Bookmark Federal Energy Management Program: Utility Energy Service Contracts on Google Bookmark Federal Energy Management Program: Utility Energy Service Contracts on Delicious Rank Federal Energy Management Program: Utility Energy Service Contracts on Digg Find More places to share Federal Energy Management Program: Utility Energy Service Contracts on AddThis.com... Energy Savings Performance Contracts ENABLE Utility Energy Service Contracts Types of Contracts Laws & Regulations Best Practices Federal Utility Partnership Working Group Partnership Meetings
Federal Energy Management Program: National Park Service - Chickasaw,
National Park National Park Service - Chickasaw, Oklahoma to someone by E-mail Share Federal Energy Management Program: National Park Service - Chickasaw, Oklahoma on Facebook Tweet about Federal Energy Management Program: National Park Service - Chickasaw, Oklahoma on Twitter Bookmark Federal Energy Management Program: National Park Service - Chickasaw, Oklahoma on Google Bookmark Federal Energy Management Program: National Park Service - Chickasaw, Oklahoma on Delicious Rank Federal Energy Management Program: National Park Service - Chickasaw, Oklahoma on Digg Find More places to share Federal Energy Management Program: National Park Service - Chickasaw, Oklahoma on AddThis.com... Energy-Efficient Products Technology Deployment Renewable Energy Federal Requirements Renewable Resources & Technologies
Managing multi-priority services in ubiquitous computing applications
Applications in ubiquitous computing environments are expected to have different priorities, memory and real-time requirements. Given a home gateway with a set of running services, we need to terminate some of the existing services to allow a more ... Keywords: home networks, internet appliances, memory management, multi-priority services, service management, service replacement, simulation, smart homes, smart spaces, ubiquitous computing
Ibrahim Kamel; Mohamed Saad; Sanaa A. Muhaureq
Texas Wildlife Damage Management Service Table of Contents
Texas Wildlife Damage Management Service Table of Contents i TEXAS WILDLIFE DAMAGE MANAGMENT.............................................................................................................................. 2 #12;Texas Wildlife Damage Management Service, Texas A&M University System Page 1 TEXAS WILDLIFE-651-2880 firstname.lastname@example.com #12;Texas Wildlife Damage Management Service, Texas A&M University System Page
Wilkins, Neal
Federal Energy Management Program: ESPC ENABLE Energy Service...
Energy Service Company Options to someone by E-mail Share Federal Energy Management Program: ESPC ENABLE Energy Service Company Options on Facebook Tweet about Federal Energy...
Memorandum regarding Definition for Demand Side Management Services
MEMORANDUM TO: Mary Anne Sullivan FROM: Larry Oliver SUBJECT: Definition for Demand Side Management Services In consultation with the Director of the Federal Energy Management...
Management Staff | Central Fabrication Services | Brookhaven National
Management Staff Management Staff Al Farland Al Farland Central Fabrication Services General Supervisor Welding, Sheet Metal, and Maintenance Metal Work Supervisor Al Farland joined the Laboratory in 1978 with over 20 years of experience in the metal fabrication industry. Al worked on the floor before becoming a supervisor and is familiar and responsible for the Central Fabrication Services group. Phone: (631) 344-8462 Fax: (631) 344-7208 Email: email@example.com Kevin Campbell Kevin Campbell Machine Shop Supervisor Kevin Campbell came to the Laboratory in 2008 as a programmer/planner/estimator and has since been promoted to Machine Shop Supervisor. Kevin is responsible for Machine shop operations. Phone: (631) 344-3498 Fax: (631) 344-7208 Email: email@example.com Chris Manning Chris Manning
Graph-Based Software Design for Managing Complexity and Enabling Concurrency in Multiphysics PDE Software
Multiphysics simulation software is plagued by complexity stemming from nonlinearly coupled systems of Partial Differential Equations (PDEs). Such software typically supports many models, which may require different transport equations, constitutive ... Keywords: Scientific computing, multiphysics, object-oriented design, task graph
Patrick K. Notz; Roger P. Pawlowski; James C. Sutherland
A generic architecture for autonomic service and network management
As the Internet evolves into an all-IP communication infrastructure, a key issue to consider is that of creating and managing IP-based services with efficient resource utilization in a scalable, flexible, and automatic way. In this paper, we present ... Keywords: Autonomic service management, Bandwidth sharing, DiffServ/MPLS networks, Quality of service, Service level agreement
Yu Cheng; Ramy Farha; Myung Sup Kim; Alberto Leon-Garcia; James Won-Ki Hong
Service Providers That Exchange Data with Portfolio Manager via Web
Service Providers That Exchange Data with Portfolio Manager via Service Providers That Exchange Data with Portfolio Manager via Web Services Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing buildings Commercial new construction Industrial energy management Small business Service providers Service and product providers Verify applications for ENERGY STAR certification Design commercial buildings Energy efficiency program administrators Commercial and industrial program sponsors Associations State and local governments Federal agencies Tools and resources Training Service Providers That Exchange Data with Portfolio Manager via Web Services The companies listed below use EPA's Portfolio Manager web services to deliver ENERGY STAR energy performance scores and metrics as part of their
graph drawing
... Layout Program (C). Graphviz: Graph Visualization Software (C), consisting of many graph drawing programs, viewers (C, Java, and TCL/TK), etc. ...
Deploying and managing Web services: issues, solutions, and directions
Web services are expected to be the key technology in enabling the next installment of the Web in the form of the Service Web. In this paradigm shift, Web services would be treated as first-class ... Keywords: Interoperability, Service-oriented computing, Web service management system
Qi Yu; Xumin Liu; Athman Bouguettaya; Brahim Medjahed
Federal Energy Management Program: Types of Utility Energy Service
Types of Utility Types of Utility Energy Service Contracts to someone by E-mail Share Federal Energy Management Program: Types of Utility Energy Service Contracts on Facebook Tweet about Federal Energy Management Program: Types of Utility Energy Service Contracts on Twitter Bookmark Federal Energy Management Program: Types of Utility Energy Service Contracts on Google Bookmark Federal Energy Management Program: Types of Utility Energy Service Contracts on Delicious Rank Federal Energy Management Program: Types of Utility Energy Service Contracts on Digg Find More places to share Federal Energy Management Program: Types of Utility Energy Service Contracts on AddThis.com... Energy Savings Performance Contracts ENABLE Utility Energy Service Contracts Types of Contracts Laws & Regulations
Exploiting Service Usage Information for Optimizing Server Resource Management
It is often difficult to tune the performance of modern component-based Internet services because: (1) component middleware are complex software systems that expose several independently tuned server resource management mechanisms; (2) session-oriented ... Keywords: Internet application, client behavior, component middleware, optimization, quality-of-service, server resource management, service usage information
Alexander Totok; Vijay Karamcheti
Communities of Web service registries: Construction and management
The last few years have seen a democratization in the use of Internet technologies, mainly Web services, for electronic B2B transactions. This has triggered an increase in the number of companies' Web service registries. In this paper, we propose to ... Keywords: Communities of registries, Managing communities of registries, Organization of Web service registries, Service oriented computing
Mohamed Sellami; Olfa Bouchaala; Walid Gaaloul; Samir Tata
Citizens and Service Channels: Channel Choice and Channel Management Implications
The arrival of electronic channels in the 1990s has had a huge impact on governmental service delivery. The new channels have led to many new opportunities to improve public service delivery, not only in terms of citizen satisfaction, but also in cost ... Keywords: Channel Behavior, Channel Choice, Channel Usage, Multi-Channel Management, Public Service Delivery, Service Channels, e-Government
Willem Pieterson
Federal Energy Management Program: Utility Energy Service Contracts Laws
Contracts Laws and Regulations to someone by E-mail Contracts Laws and Regulations to someone by E-mail Share Federal Energy Management Program: Utility Energy Service Contracts Laws and Regulations on Facebook Tweet about Federal Energy Management Program: Utility Energy Service Contracts Laws and Regulations on Twitter Bookmark Federal Energy Management Program: Utility Energy Service Contracts Laws and Regulations on Google Bookmark Federal Energy Management Program: Utility Energy Service Contracts Laws and Regulations on Delicious Rank Federal Energy Management Program: Utility Energy Service Contracts Laws and Regulations on Digg Find More places to share Federal Energy Management Program: Utility Energy Service Contracts Laws and Regulations on AddThis.com... Energy Savings Performance Contracts ENABLE
Priority-Oriented Architecture Service Management on OSGi Home-service Platform
Open Service Gateway initiative (OSGi) platforms integrate a variety of reusable applications and resources, packing them into bundles. These deployed services, which are offered by service providers, can expediently manage home appliances. However, ... Keywords: Management system, OSGi, QoS, Smart home
Sheng-Tzong Cheng, Chih-Lun Chou, Gwo-Jiun Horng
(OMB) guidance on reporting to the Federal Energy Management Program and OMB. Utility energy service contracts (UESCs) offer Federal agencies an effective means to implement...
Federal Energy Management Program: Utility Energy Service Contract...
Contacts For more information about utility energy service contracts, contact: David McAndrew Federal Energy Management Program 202-586-7722 Karen Thomas National Renewable Energy...
EWEB - Energy Management Services Loan | Department of Energy
Loan EWEB - Energy Management Services Loan < Back Eligibility Commercial Savings Category Heating & Cooling Solar Swimming Pool Heaters Water Heating Maximum Rebate Not specified...
EWEB - Energy Management Services Rebate | Department of Energy
Rebate EWEB - Energy Management Services Rebate < Back Eligibility Commercial Multi-Family Residential Savings Category Heating & Cooling Solar Swimming Pool Heaters Water Heating...
Resource Management Services: Water Regulation, Part 605: Applications...
5: Applications for Diversion or Use of Water for Purposes Other Than Hydro-Electric Power Projects (New York) Resource Management Services: Water Regulation, Part 605:...
Information Management, Analytics & Optimization Services IMS Security Health Check Service Offering
Offering The IMS Security Health Check is a special service offering from the IMS Laboratory TechnicalInformation Management, Analytics & Optimization Services IMS Security Health Check Service two to three weeks after the conclusion of the on-site visit. · Service from the IMS Laboratory
Information Management, Analytics & Optimization Services IMS System High Availability Health Check Service Offering
Information Management, Analytics & Optimization Services IMS System High Availability Health Check Service Offering The IMS System High Availability Health Check is a special service offering from the IMS Laboratory Technical Specialist Group will be happy to help. Visit our website at: ibm.com/software/data/services
Information Management, Analytics & Optimization Services IMS Application Health Check Service Offering
Offering The IMS Application Health Check is a special service offering from the IMS laboratory TechnicalInformation Management, Analytics & Optimization Services IMS Application Health Check Service, and possible enhancements to · Service from the IMS Laboratory Technical Specialist group · Get to know
Service Companies Energy service companies (ESCOs) develop, install, and fund projects designed to improve energy efficiency and reduce operation and maintenance costs in their...
An integrated approach to process and service management
Any enterprise exists to create and capture value, and much of this value is created through processes and services. Given the heavy dependency of processes on information and IT, the chief information officer (CIO) has a key role to play in ensuring ... Keywords: Information strategy, Information systems, Process management, Service management
Forbes Gibb; Steven Buchanan; Sameer Shah
March 26, 2013 IT Service Manager Tips & Tricks
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
Chisholm, Rex L.
Department of Environmental Health & Safety Risk Management Services
Department of Environmental Health & Safety Risk Management Services November 2009 Version 1 receive health & safety training specific to the hazards present in the lab. Where a laboratory or core of Environmental Health & Safety Risk Management Services November 2009 Version 1 January 2012 Version 2
Machel, Hans
Web-Based Services for Building Energy Management - WEBE
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 WebE, was developed at VTT. It is a modular and integrated service including several energy-related modules. This paper describes the main features of the WebE service modules. Also the system structure is briefly discussed.
Paiho, S.; Pietilainen, J.; Ala-Juusela, M.
Proactive key management protocol for multicast services
A group key management is essential scheme guaranteeing data confidentiality in multicast. To provide the strict secrecy in group communication, the rekeying delay has to be minimized. In this paper, we propose a new group key management protocol, called ...
Dong-Hyun Je; Seung-Woo Seo
Motion graphs
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The ... Keywords: animation with constraints, motion capture, motion synthesis
Lucas Kovar; Michael Gleicher; Fr�d�ric Pighin
Optimized HVAC Management Service to Enhance Demand Response
Optimized HVAC Management Service to Enhance Demand Response Speaker(s): John Steinberg Date: August 18, 2011 - 12:00pm Location: 90-4133 Seminar HostPoint of Contact: Janie Page...
Service and Network Management Interworking in Future Wireless Systems
The need for seamless communications in future wireless networks imposes the development of distributed management systems, in which we can distinguish between different business entities, the Service and Network Providers. Such a highly dynamic environment ...
V. Tountopoulos; Vera Stavroulaki; Panagiotis Demestichas; Nikolas Mitrou; Michael E. Theologou
Management of real-time streaming data grid services
We discuss the architectural and management support for real time data stream applications, both in terms of lower level messaging and higher level service, filter and session structures. In our approach, messaging systems act as a Grid substrate that ...
Geoffrey Fox; Galip Aydin; Harshawardhan Gadgil; Shrideep Pallickara; Marlon Pierce; Wenjun Wu
V-014: Cisco Prime Data Center Network Manager JBoss RMI Services...
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...
U-238: HP Service Manager Input Validation Flaw Permits Cross...
9.21, 9.30 ABSTRACT: Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers...
Enabling petascale science : data management, troubleshooting and scalable science services.
SciTech Connect
The Center for Enabling Distributed Petascale Science is developing serviced to enable researchers to manage large, distributed datasets. The center projects focus on three areas: tools for reliable placement of data, issues involving failure detection and failure diagnosis in distributed systems, and scalable services that process requests to access data.
Baranovski, A.; Beattie, K.; Bharathi, S.; Boverhof, J.; Bresnahan, J.; Chervenak, A.; Foster, I.; Freeman, T.; Gunter, D.; Keahey, K.; Kesselman, C.; Kettimuthu, R.; Leroy, N.; Link, M.; Livny, M.; Madduri, R.; Oleynik, G.; Pearlman, L.; Schuler, R.; Tierney, B. (Mathematics and Computer Science); (FNAL); (Univ. of Southern California); (Univ. of Chicago); (LBNL); (Univ. of Wisconsin)
Towards Autonomic Communication Mechanisms for Service Composability Management
The Autonomic Communication Forum dedicates itself to leverage innovative mechanisms in order to provide new levels of integrated autonomicity to a future self-managed networks and network elements. Current trends in networking technologies are applying ... Keywords: Autonomic Communication, Service Composability Management
Thomas Magedanz; Jos� A. Lozano; Florian Schreiner; Fabricio Gouveia; Juan M. Gonz�lez
Electronic collection management and electronic information services
As the life cycle of information products has become increasingly digital from �cradle to grave�, the nature of electronic information management has dramatically changed. These changes have brought new strategies and methods as well as new ...
Gladys Cotter; Bonnie Carroll; Gail Hodge; Andrea Japzon
WASTE MANAGEMENT ENVIRONMENTAL SERVICES, INC. WASTE MANAGEMENT ENVIRONMENTAL SERVICES, INC. FOR AN ADVANCE WAIVER OF DOMESTIC AND FOREIGN INVENTION RIGHTS UNDER EG&G IDAHO, INC. SUBCONTRACT NO. EGG-C93-170221, W(A)-93-005, CH-0757 Under this subcontract, Waste Management Environmental Services, Inc. (WMES) will demonstrate key technical features of its proposed Idaho National Engineering Laboratory (INEL) Pit-9 remediation program. Pit-9 is an area in the Radioactive Waste Management Complex at the INEL containing radioactive and hazardous materials in the form of toxic metals and organic materials, including plutonium and americium. Specifically, the subject subcontract is directed toward a Proof-of-Process (POP) demonstration program intended to provide EG&G Idaho, Inc. (EG&G) with additional information that it will use in the
Service-oriented technology and management: Perspectives on research and practice for the coming decade
Service-oriented technologies and management have gained attention in the past few years, promising a way to create the basis for agility so that companies can deliver new, more flexible business processes that harness the value of the services approach ... Keywords: Business processes, Economic analysis, IT management, Research directions, Service paradigm, Service-oriented architecture, Service-oriented technology and management, Thought leadership
Haluk Demirkan; Robert J. Kauffman; Jamshid A. Vayghan; Hans-Georg Fill; Dimitris Karagiannis; Paul P. Maglio
Optimized HVAC Management Service to Enhance Demand Response Optimized HVAC Management Service to Enhance Demand Response Speaker(s): John Steinberg Date: August 18, 2011 - 12:00pm Location: 90-4133 Seminar Host/Point of Contact: Janie Page Many utilities are investing vast sums deploying smart meters to customers, some of whom remain stubbornly opposed to those deployments, in large part because they remain unmoved by the claimed benefits. EcoFactor has developed a thermostat management service that delivers (and quantifies) significant energy savings for consumers and a number of additional benefits to other players in the energy value chain. It does so without relying on consumers to modify behavior, study energy information displays, or even pay attention to their energy use. EcoFactor also significantly boosts DR yield while it increases occupant comfort. It can identify HVAC
Quality Services: Solid Wastes, Part 360: Solid Waste Management Facilities
0: Solid Waste Management 0: Solid Waste Management Facilities (New York) Quality Services: Solid Wastes, Part 360: Solid Waste Management Facilities (New York) < Back Eligibility Agricultural Commercial Fuel Distributor Industrial Institutional Investor-Owned Utility Multi-Family Residential Municipal/Public Utility Rural Electric Cooperative Transportation Utility Program Info State New York Program Type Environmental Regulations Provider NY Department of Environmental Conservation These regulations apply to all solid wastes with the exception of hazardous or radioactive waste. Proposed solid waste processing facilities are required to obtain permits prior to construction, and the regulations provide details about permitting, construction, registration, and operation requirements. The regulations contain specific guidance for land
Resource Management Services: Land Use, Part 505: Coastal Erosion
5: Coastal Erosion 5: Coastal Erosion Management (New York) Resource Management Services: Land Use, Part 505: Coastal Erosion Management (New York) < Back Eligibility Agricultural Commercial Construction Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State New York Program Type Siting and Permitting Provider NY Department of Environmental Conservation
An Autonomic Service Architecture for Self-Managing Grid Applications
architecture, adaptive data streaming. I. INTRODUCTION he goal of the Grid concept is to enable a new and geographically distributed elements and resources; (2) Dynamism: Grid environments are continuously changingAn Autonomic Service Architecture for Self- Managing Grid Applications Hua Liu, Viraj Bhat, Manish
Parashar, Manish
Development of power facility management services using RFID/USN
In the electric power industry, there are many research projects to stabilise the power and increase the efficiency using ubiquitous technology. Many power utilities control and supervise the transmission line of energy to avoid power failures. In this ... Keywords: #, 47, RFID, RFID&, USN, cable joint, electric power industry, power facility management, radio frequency identification, service framework, ubiquitous sensor networks, wireless networks
Young-Il Kim; Jae-Ju Song; Jin-Ho Shin; Bong-Jae Yi; Hoon Choi
Modeling and analysis of mobility management state of packet-switched (PS) services in GPRS
There has been an increasing demand for wireless data services due to the popularity of Internet services and circuit-switched (CS) systems are not appropriate for accommodating bursty data traffic. The wireless data services can be efficiently supported ... Keywords: General Packet Radio Service, Location update, Mobile station state management, Mobility management, Packet-switched services, Paging
Yun Won Chung; Ho Young Hwang; Dan Keun Sung
Combining a Multithreaded Scene Graph System with a Tiled Display Environment
This case study highlights the technical challenges of creating an application that uses a multithreaded scene graph toolkit for rendering and uses a software environment for management of tiled display systems. Scene graph toolkits simplify and streamline graphics applications by providing data management and rendering services. Software for tiled display environments typically performs device and event management by opening windows on displays, by gathering and processing input device events, and by orchestrating the execution of application rendering code. These environments serve double-duty as frameworks for creating parallel rendering applications. We explore technical issues related to interfacing scene graph systems with software that manages tiled projection systems in the context of an implementation, and formulate suggestions for the future growth of such systems.
Frank, R; Bethel, W
Management of Bureaucrats and Public Service Delivery: Evidence from the Nigerian Civil Service �
We study how the management practices under which public sector bureaucrats operate, correlate to the quantity and quality of public services delivered. We do so in a developing country context, exploiting data from the Nigerian Civil Service linking public sector organizations to the individual projects they are responsible for. For each of 4700 projects, we have hand coded independent engineering assessments of each project�s completion rate and delivered quality. We supplement this information with a survey we conducted to elicit management practices for bureaucrats in each of the 63 civil service organizations responsible for these projects, following the approach of Bloom and Van Reenen [2007]. We �nd management practices related to autonomy signi�cantly increase project completion rates and project quality; management practices related to performance-based incentives signi�cantly decrease project completion rates and project quality. We then document: (i) how the impacts of autonomy vary by project and organizational characteristics following Aghion and Tirole [1997]; (ii) whether the negative impacts of performance related management practices are driven by issues related to project complexity/multi-tasking, and bureaucrats
Imran Rasul; Daniel Rogger; Tom Crossley
June 2013Management of Bureaucrats and Public Service Delivery: Evidence from the Nigerian Civil Service �
Nigerian Civil Service; Imran Rasul A; Daniel Rogger B; Imran Rasul; Daniel Rogger
Utility Energy Service Contracts Utility Energy Service Contracts Many helpful resources about utility energy service contracts (UESCs) are available. Also see Case Studies. Training The Federal Energy Management Program (FEMP) offers an ongoing series of workshops and webinars to train Federal agencies on how to implement UESC projects. Visit the FEMP events calendar for upcoming training opportunities. UESC Virtual Center of Expertise The Virtual Center of Expertise helps Federal agencies and utilities significantly streamline the UESC implementation process and access the resources and expertise needed to overcome project barriers. The center provides project teams with FEMP points of contact and maintains a list of agency, utility, and financing experts willing to assist their peers with project implementation based on their own experiences. The center also offers sample documents and templates necessary for UESC implementation. These resources are made available to help promote the benefits of implementing a UESC project.
Resource Management Services, Part 609: Reclassification of Waters (New
Services, Part 609: Reclassification of Waters Services, Part 609: Reclassification of Waters (New York) Resource Management Services, Part 609: Reclassification of Waters (New York) < Back Eligibility Commercial Investor-Owned Utility Municipal/Public Utility Tribal Government Utility Savings Category Water Buying & Making Electricity Home Weatherization Program Info State New York Program Type Siting and Permitting Provider NY Department of Environmental Conservation These regulations provide procedures to propose a reclassification of State waters for permitting purposes. Requests must address the factual basis for reclassification, including the size, depth, surface area covered, volume, direction and rate of flow, stream gradient and temperature of the water; character of the district bordering said waters and its suitability for
Use web services to exchange data with Portfolio Manager | ENERGY STAR
Service and product providers Service and product providers » Use web services to exchange data with Portfolio Manager Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing buildings Commercial new construction Industrial energy management Small business Service providers Service and product providers Verify applications for ENERGY STAR certification Design commercial buildings Energy efficiency program administrators Commercial and industrial program sponsors Associations State and local governments Federal agencies Tools and resources Training In this section How can ENERGY STAR help your business? Get started Help your clients improve energy performance with ENERGY STAR Earn recognition for your company Use web services to exchange data with Portfolio Manager
Psm Nature Power Service Management Formerly Umweltkontor Renewable Energy
Psm Nature Power Service Management Formerly Umweltkontor Renewable Energy Psm Nature Power Service Management Formerly Umweltkontor Renewable Energy AG Jump to: navigation, search Name psm Nature Power Service & Management (Formerly Umweltkontor Renewable Energy AG) Place Erkelenz, Germany Zip 41812 Sector Biofuels, Hydro, Solar, Wind energy Product Founded as a wind project developer, expanded into solar, hydro, marine and biofuels sectors, until insolvency in 2004. Coordinates 51.078949°, 6.317715° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":51.078949,"lon":6.317715,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}
Integrating service discovery with routing and session management for ad-hoc networks
In this paper, we propose GSR: a new routing and session management protocol for ad-hoc networks as an integral part of a service discovery infrastructure. Traditional approaches place routing at a layer below service discovery. While this distinction ... Keywords: Ad-hoc networks, Routing, Service discovery, Service-centric routing, Session management
Dipanjan Chakraborty; Anupam Joshi; Yelena Yesha
T-581: Novell Access Manager Java Double Literal Denial of Service
81: Novell Access Manager Java Double Literal Denial of Service 81: Novell Access Manager Java Double Literal Denial of Service Vulnerability T-581: Novell Access Manager Java Double Literal Denial of Service Vulnerability March 17, 2011 - 3:05pm Addthis PROBLEM: Novell has acknowledged a vulnerability in Novell Access Manager, which can be exploited by malicious people to cause a DoS (Denial of Service). PLATFORM: Novell Access Manager 3.1 Linux Access Gateway Novell Access Manager 3.1 Access Administration Novell Access Manager 3.1 SSLVPN Server Novell Access Manager 3.1 Windows Novell Identity Server Novell Access Manager 3.1 Linux Novell Identity Server Novell Access Manager 3.1 Java Agents ABSTRACT: Novell Access Manager Java Double Literal Denial of Service Vulnerability. reference LINKS: Secunia Advisory: SA43769 CVE-2010-4476
Energy Management Program at Atlanta Postal Service Distribution Center
The US Postal Service operates more than 38,000 post offices across the country and spends $350 million annually on utilities (1). Driven by President Clinton's 1999 Executive Order that mandates a 35 percent reduction in federal energy consumption by 2010, the Postal Service is aggressively pursuing energy savings (2). One long-range approach initiated in the Atlanta area is the implementation of MSE 2000, a structured management system for energy. MSE 2000 emphasizes training, development of standard operating procedures, energy monitoring, and team-based problem solving. Implementation activity at the Atlanta Bulk Mail Facility has included a gap analysis, selection of an implementation team, and initial training. During the first quarter of 2001, the energy manual, energy system work procedures and instructions, and energy team training will be completed. This will put the facility on target for formal registration of the management system in the third quarter of 2001. Improved operating and maintenance practices are expected to reduce energy usage by 5-10 percent, and the formal management system will help sustain the savings.
Brown, M.
An agent-based approach for component management in service-oriented architectures
Recently, many service providers have introduced service-oriented architecture systems. Loosely coupled components which offer a service, can depend on other components to fulfill users' service requests. This relationship, as well as the relationship ... Keywords: component management, contracts, service-oriented architectures, software agents
Igor Ljubi; Mario Kusek; Gordan Jezic; Darko Huljenic; Sasa Desic
An architecture for policy-based security management for distributed multimedia services
In this paper, I will describe my Ph.D. research work on a multi level architecture to manage security for distributed multimedia services through the use of policies. Keywords: policy-driven management, security management, security policies
Sandrine Duflos; Brigitte Kervella; Eric Horlait
V-146: HP Service Manager Bugs Permit Cross-Site Scripting and Information
6: HP Service Manager Bugs Permit Cross-Site Scripting and 6: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks V-146: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks May 1, 2013 - 12:43am Addthis PROBLEM: HP Service Manager Bugs Permit 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: HP Document ID: c03748875 SecurityTracker Alert ID: 1028496 CVE-2012-5222 CVE-2013-2321 IMPACT ASSESSMENT: Medium DISCUSSION: A remote user can obtain potentially sensitive information [CVE-2012-5222]. Service Manager Web Tier does not properly filter HTML code from user-supplied input before displaying the input [CVE-2013-2321]. A remote
Federal Energy Management Program: U.S. Department of Energy Energy Service
U.S. Department of U.S. Department of Energy Energy Service Companies to someone by E-mail Share Federal Energy Management Program: U.S. Department of Energy Energy Service Companies on Facebook Tweet about Federal Energy Management Program: U.S. Department of Energy Energy Service Companies on Twitter Bookmark Federal Energy Management Program: U.S. Department of Energy Energy Service Companies on Google Bookmark Federal Energy Management Program: U.S. Department of Energy Energy Service Companies on Delicious Rank Federal Energy Management Program: U.S. Department of Energy Energy Service Companies on Digg Find More places to share Federal Energy Management Program: U.S. Department of Energy Energy Service Companies on AddThis.com... Energy Savings Performance Contracts Assistance & Contacts
U-238: HP Service Manager Input Validation Flaw Permits Cross-Site
38: HP Service Manager Input Validation Flaw Permits Cross-Site 38: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks August 17, 2012 - 7:00am Addthis PROBLEM: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 7.11, 9.21, 9.30 ABSTRACT: Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers to inject arbitrary web script or HTML via unspecified vectors. REFERENCE LINKS: www2.hp.com http://www.securitytracker.com/id/1027399 CVE-2012-3251 IMPACT ASSESSMENT: Moderate Discussion: A vulnerability was reported in HP Service Manager. A remote user can conduct cross-site scripting attacks. The software does not properly filter
Federal Energy Management Program: U.S. Fish and Wildlife Service -
U.S. Fish and U.S. Fish and Wildlife Service - Shepherdstown, West Virginia to someone by E-mail Share Federal Energy Management Program: U.S. Fish and Wildlife Service - Shepherdstown, West Virginia on Facebook Tweet about Federal Energy Management Program: U.S. Fish and Wildlife Service - Shepherdstown, West Virginia on Twitter Bookmark Federal Energy Management Program: U.S. Fish and Wildlife Service - Shepherdstown, West Virginia on Google Bookmark Federal Energy Management Program: U.S. Fish and Wildlife Service - Shepherdstown, West Virginia on Delicious Rank Federal Energy Management Program: U.S. Fish and Wildlife Service - Shepherdstown, West Virginia on Digg Find More places to share Federal Energy Management Program: U.S. Fish and Wildlife Service - Shepherdstown, West Virginia on AddThis.com...
8: HP Service Manager Input Validation Flaw Permits Cross-Site 8: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks August 17, 2012 - 7:00am Addthis PROBLEM: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 7.11, 9.21, 9.30 ABSTRACT: Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers to inject arbitrary web script or HTML via unspecified vectors. REFERENCE LINKS: www2.hp.com http://www.securitytracker.com/id/1027399 CVE-2012-3251 IMPACT ASSESSMENT: Moderate Discussion: A vulnerability was reported in HP Service Manager. A remote user can conduct cross-site scripting attacks. The software does not properly filter
Federal Energy Management Program: U.S. Postal Service - Rancho Mirage,
Postal Postal Service - Rancho Mirage, California to someone by E-mail Share Federal Energy Management Program: U.S. Postal Service - Rancho Mirage, California on Facebook Tweet about Federal Energy Management Program: U.S. Postal Service - Rancho Mirage, California on Twitter Bookmark Federal Energy Management Program: U.S. Postal Service - Rancho Mirage, California on Google Bookmark Federal Energy Management Program: U.S. Postal Service - Rancho Mirage, California on Delicious Rank Federal Energy Management Program: U.S. Postal Service - Rancho Mirage, California on Digg Find More places to share Federal Energy Management Program: U.S. Postal Service - Rancho Mirage, California on AddThis.com... Energy-Efficient Products Technology Deployment Renewable Energy Federal Requirements
Design and implementation of time management service for IEEE 1516 HLA/RTI
With the development of time management service of Run-Time Infrastructure (RTI), it is necessary to consider an efficient design approach and an algorithm of Greatest Available Logical Time (GALT) computation. However, many time management services ... Keywords: GALT calculation algorithm, HLA, IEEE 1516, RTI, modular design, time management
Jeong Hee Hong; Jae Hyun Kim; Tag Gon Kim
PDSF Utilization Graphs
Graphs Graphs Utilization Graphs This page contains a series of graphs that use data from the PDSF batch scheduler (SGE) to show the utilization of the cluster over the past 24 hours. The graphs were generated with RRDTool and are updated approximately every 15 minutes. This graph shows the aggregate cluster CPU availablity and usage according to sgeload: 24 hour rolling usage graph (click to see long term averages) This graph shows the number of jobs being run by each group: Rolling 24 Running Jobs by Group (click to see long term averages) This is the same graph as above weighted by the clockspeed (GHz) of the node used for the job: Rolling 24 Running Jobs by Group (click to see long term averages) This graph show the number of pending jobs by group: Rolling 24 Pending Jobs
V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain
8: HP Service Manager Unspecified Flaw Lets Remote Users Gain 8: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access August 15, 2013 - 1:30am Addthis PROBLEM: A potential security vulnerability has been identified with HP Service Manager. The vulnerability could be exploited to allow remote unauthenticated access and elevation of privilege. PLATFORM: HP Service Manager v9.31, v9.30, v9.21, v7.11, v6.2.8 ABSTRACT: The vulnerabilities are reported in versions 9.31 and prior. REFERENCE LINKS: SecurityTracker Alert ID: 1028912 CVE-2013-4808 IMPACT ASSESSMENT: High DISCUSSION: A vulnerability was reported in HP Service Manager. A remote user can gain unauthorized access on the target system. IMPACT: User access via network
Contracts Laws and Regulations Contracts Laws and Regulations UESC: Enabling Documents For a compilation of UESC enabling regulations and guidance, read UESC: Enabling Documents. This document is the primary reference for Federal agencies and utility partners conducting UESC projects. The Energy Policy Act (EPAct) of 1992 authorizes and encourages Federal agencies to participate in utility energy efficiency programs. Legislation authorizing utility energy service contracts (UESCs) is outlined below, along with legal opinions outlining the use of UESCs by Federal agencies. Laws and Regulations 42 USC Section 8256 (Energy Policy Act of 1992): Incentives for Federal agencies, legislation addressing contracts, the Federal Energy Efficiency Fund, utility incentive programs, and the Financial Incentive Program for Facility Energy Managers.
Resource Management Services: Water Regulation, Part 605: Applications for
5: 5: Applications for Diversion or Use of Water for Purposes Other Than Hydro-Electric Power Projects (New York) Resource Management Services: Water Regulation, Part 605: Applications for Diversion or Use of Water for Purposes Other Than Hydro-Electric Power Projects (New York) < Back Eligibility Agricultural Commercial Industrial Investor-Owned Utility Municipal/Public Utility Rural Electric Cooperative Tribal Government Utility Savings Category Buying & Making Electricity Program Info State New York Program Type Siting and Permitting Provider NY Department of Environmental Conservation These rules apply to all applications for a license or a permit to take, divert, appropriate or otherwise use the waters of the State, except applications for hydro-electric power projects. Applications are reviewed
Managing resources in times of uncertain funding| AIDS services organizations in crisis.
?? The purpose of the study was to explore how AIDS service organizations located in a large Middle Atlantic state managed their programs with uncertain� (more)
Gatson, Dianne
The National Park Service and the use of geographic information systems (GIS) for cultural resource management.
??The National Park Service plays a central role in managing cultural resources in the United States and has served as a leader in the the� (more)
Gardner, Bennett Rowan
Food service establishment wastewater characterization and management practice evaluation
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 and based on residential hydraulic applications. For the purposes of this research, hydraulic loading indicates the daily flow of water directed to the wastewater system. Organic loading refers to the composition of the wastewater as quantified by five-day biochemical oxygen demand (BOD5), total fats, oils and greases (FOG), and total suspended solids (TSS). The first part of this study included an analysis of the central tendencies of analytical data of four wastewater parameters from 28 restaurants representing a broad spectrum of restaurant types. Field sampling consisted of two sets of grab samples collected from each restaurant for six consecutive days at approximately the same time each day. These sets were collected approximately two weeks apart. The numerical data included BOD5, FOG, and TSS. The fourth parameter evaluated was daily flow. Data exploration and statistical analyses of the numerical data from the 28 restaurants was performed with the standard gamma probability distribution model in ExcelTM and used to determine inferences of the analytical data. The analysis shows higher hydraulic and organic values for restaurant wastewater than residential wastewater. The second part of the study included a statistical analysis of restaurant management practices and primary cuisine types and their influence on BOD5, FOG, TSS, and daily flow to determine if management practices and/or cuisine types may be influencing wastewater composition and flow. A self-reporting survey was utilized to collect management practice and cuisine type information. Survey response information and analytical data were entered into an ExcelTM spreadsheet and subsequently incorporated into SASTM statistical software for statistical analysis. Analysis indicated that the number of seats in a restaurant, use of self-serve salad bars, and primary cuisine types are statistically significant indicators of wastewater characteristics.
Garza, Octavio Armando
Graph sketcher: extending illustration to quantitative graphs
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantitative concept diagrams (QCDs). Existing charting and illustration programs ... Keywords: charting, constraint-based layout, illustration, information visualization, planar map coloring, quantitative concept diagrams, snap-dragging
Robin Stewart; m.c. schraefel
XML-enabled workflow management for e-services across heterogeneous platforms
Advanced e-services require efficient, flexible, and easy-to-use workflow technology that integrates well with mainstream Internet technologies such as XML and Web servers. This paper discusses an XML-enabled architecture for distributed workflow management ... Keywords: Business processes, Information system interoperability, Internet e-services, Workflow management, XML/XSL
German Shegalov; Michael Gillmann; Gerhard Weikum
Two-layered metadata service model in grid environment
The primary problem of data management in grid environment is how to effectively organise the geographical distributed storage devices to support the collaborative data operations. This paper focuses on how to resolve the above problem and presents a ... Keywords: data grid, data management, grid computing, metadata replication, metadata service models, replica metadata, sparse strongly connected graph
Muzhou Xiong; Hai Jin; Song Wu
T-725: Cisco Unified Service Monitor and Cisco Unified Operations Manager
T-725: Cisco Unified Service Monitor and Cisco Unified Operations T-725: Cisco Unified Service Monitor and Cisco Unified Operations Manager Remote Code Execution Vulnerabilitiry Code T-725: Cisco Unified Service Monitor and Cisco Unified Operations Manager Remote Code Execution Vulnerabilitiry Code September 23, 2011 - 9:00am Addthis PROBLEM: Cisco Unified Service Monitor and Cisco Unified Operations Manager Remote Code Execution Vulnerabilitiry Code. PLATFORM: Cisco Unified Service Monitor prior to version 8.6 Cisco Unified Operations Manager prior to version 8.6 CiscoWorks LAN Management Solution software releases 3.1, 3.2, and 4.0. ABSTRACT: Successful exploitation of these vulnerabilities could allow an unauthenticated, remote attacker to execute arbitrary code on affected servers. reference LINKS: Cisco Security Advisory 113173
V-014: Cisco Prime Data Center Network Manager JBoss RMI Services Let
14: Cisco Prime Data Center Network Manager JBoss RMI Services 14: 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 Remote Users Execute Arbitrary Commands November 1, 2012 - 6:00am Addthis PROBLEM: Cisco Prime Data Center Network Manager JBoss RMI Services Let Remote Users Execute Arbitrary Commands PLATFORM: All Cisco Prime Data Center Network Manager releases prior to release 6.1(1), for both the Microsoft Windows and Linux platforms, are affected by this vulnerability. ABSTRACT: A vulnerability was reported in Cisco Prime Data Center Network Manager. REFERENCE LINKS: Cisco Advisory ID: cisco-sa-20121031-dcnm SecurityTracker Alert ID: 1027712 CVE-2012-5417 IMPACT ASSESSMENT: High DISCUSSION: The vulnerability exists because JBoss Application Server Remote Method
Federal Energy Management Program: Qualified List of Energy Service...
Federal Energy Management Program Search Search Help Federal Energy Management Program HOME ABOUT THE PROGRAM PROGRAM AREAS LAWS & REGULATIONS INFORMATION RESOURCES PROJECT FUNDING...
Federal Energy Management Program: ESPC ENABLE Energy Service Company
ENABLE Energy Service Company Options ENABLE Energy Service Company Options Become an ESPC ENABLE Program ESCO These resources offer information related to becoming an ESPC ENABLE program ESCO: Applying for the DOE Qualified List of Energy Service Companies GSA Schedules GSA Advantage Vendor Start-Up Kit GSA Schedules News and Training GSA Eligibility to Use GSA Sources of Supply and Services Energy Savings Performance Contract (ESPC) ENABLE projects use General Services Administration (GSA) Federal Supply Schedule 84, SIN 246-53 to select a qualified Energy Services Company (ESCO). The ESCO is required to go through a two-step qualification process to become an eligible ESPC ENABLE or Schedule 84 service provider. The two-step process includes first, becoming Department of Energy (DOE)- qualified and second, being awarded a contract under the GSA Schedule.
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...
Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J
The design of an autonomic communication element to manage future internet services
Future Internet services will have vastly different requirements than the current Internet. Manageability, which has been largely ignored, will have the dual role of controlling capital and operational expenditures as well as enabling agile reorganization ... Keywords: FOCALE, autonomic architecture, autonomic element, business driven, device management, future internet, management
John Strassner; Sung-Su Kim; James Won-Ki Hong
Service bulletin inventory management and modeling for aerospace parts in customer service organization
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 ...
Pardede, Erna K. (Erna Kertasasmita)
Claw-free graphs and line graphs.
??The research of my dissertation is motivated by the conjecture ofThomassen that every 4-connected line graph is hamiltonian and by the conjecture ofTutte that every� (more)
Shao, Yehong, 1976-
Almost self-centered graphs
The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) graphs are introduced as the graphs with exactly two non-central vertices. The block structure of these graphs is described and constructions for generating such graphs are proposed. Embeddings of arbitrary graphs into ASC graphs are studied. In particular it is shown that any graph can be embedded into an ASC graph of prescribed radius. Embeddings into ASC graphs of radius two are studied in more detail. Embedding index of a graph G is introduced as the smallest number of vertices needed to add to G such that G is an induced subgraph of an ASC graph.
Sandi Klavzar; et al.
and their partnering utilities can request on-site FEMP partnership meetings and utility energy service contract (UESC) training. FEMP experts will train partnership meeting...
Service design for Chinese restaurant management in Finland.
??The main objective of the thesis is focused on understanding the service and operation model of Chinese restaurants in Finland, identifying the gaps between the� (more)
Yang, Yan
Meetings on AddThis.com... Energy Savings Performance Contracts ENABLE Utility Energy Service Contracts Types of Contracts Laws & Regulations Getting the Best Value...
ENVIRONMENT, HEALTH & SAFETY Risk Management Services, University of Alberta
of contracted testing (air quality) Biosafety Provide technical expertise and support to ensure a safe working Management Plan and ACM database management Chemical Safety Management Occupational Hygiene evaluations e.g. noise, chemical exposures, etc Air quality assessments. Laboratory Audits WHMIS / Chemical Spill
Types of Utility Energy Service Contracts Types of Utility Energy Service Contracts Several types of contracts are used as utility energy service contracts (UESCs). Many agency sites procure electricity services under a contract with the local utility, and most of these contracts have provisions that can also cover energy efficiency projects. Agencies not covered by such agreements may enter contracts with the utility for the sole purpose of implementing energy projects. Agency staff will want to first find out whether their facility is already covered under a UESC. Using an existing contract that is familiar to the agency and the utility is typically the most expeditious means of getting projects done. Areawide Contracts Areawide contracts (AWCs) are blanket contracts, which are essentially indefinite-delivery, indefinite-quantity (IDIQ) contracts for public utility services. The contract outlines general terms and conditions and authorizes any agency in the utility's service territory to place delivery orders for services offered under the contract. The order describes the details and technical specifications for the energy efficiency project or other services to be delivered.
Distributed wide-area traffic management for cloud services
The performance of interactive cloud services depends heavily on which data centers handle client requests, and which wide-area paths carry traffic. While making these decisions, cloud service providers also need to weigh operational considerations like ... Keywords: joint optimization, multi-homed routing, request mapping
Srinivas Narayana; Joe Wenjie Jiang; Jennifer Rexford; Mung Chiang
Procuring Architectural and Engineering Services for Energy Efficiency and Sustainability (Book), Federal Energy Management Program (FEMP)
Procuring Architectural Procuring Architectural and Engineering Services for Energy Efficiency and Sustainability A Resource Guide for Federal Construction Project Managers U.S. Department of Energy Energy Efficiency and Renewable Energy Federal Energy Management Program FEDERAL ENERGY MANAGEMENT PROGRAM Procuring Architectural and Engineering Services for Energy Efficiency and Sustainability: A Resource Guide for Federal Construction Project Managers NOTICE This report was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, appa-
directed acyclic word graph
... and R. Verin, Direct Construction of Compact Directed Acyclic Word Graphs, 8th Annual Symposium, CPM 97, Aarhus, Denmark, 116-129, 1997. ...
Supply Side Management Kit: Service for Energy Suppliers and Process Industry Customers
The Supply Side Management Kit highlights proposed EPRI's services for energy suppliers and process industries in the supply side area. With the onset of electricity deregulation, process industry customers are increasingly looking at reducing energy costs on the supply of energy. The new environment has created significant opportunities for cost-effective purchase, management, generation, utilization, and sale of energy for process industries. This kit discusses the services offered by EPRI to meet its ...
U-201: HP System Management Homepage Bugs Let Remote Users Deny Service |
1: HP System Management Homepage Bugs Let Remote Users Deny 1: HP System Management Homepage Bugs Let Remote Users Deny Service U-201: HP System Management Homepage Bugs Let Remote Users Deny Service June 28, 2012 - 7:00am Addthis PROBLEM: A vulnerability was reported in HP System Management Homepage. PLATFORM: Version(s): prior to 7.1.1 ABSTRACT: The vulnerabilities could be exploited remotely resulting in unauthorized access, disclosure of information, data modification, Denial of Service (DoS), and execution of arbitrary code. Reference links: Original Advisory Security Tracker ID 1027209 CVE-2012-2012, CVE-2012-2013, CVE-2012-2014 CVE-2012-2015, CVE-2012-2016 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP System Management Homepage. A remote authenticated user can gain elevated privileges. A remote authenticated
Distributed Management of High-Layer Protocols and Network Services through a Programmable Agent-Based Architecture
This paper proposes an architecture for distributed management of upper layer protocols and network services called Trace. Based on the IETF Script MIB, the architecture provides mechanisms for the delegation of management tasks to mid-level managers, ...
Luciano Paschoal Gaspary; Luis Felipe Balbinot; Roberto Storch; Fabricio Wendt; Liane M. Rockenbach Tarouco
Opportunities for knowledge management tools in clinical genetic services
This study aims to characterize the challenges in utilizing genetic information in health care and to identify opportunities for genetics knowledge management. Taking a grounded theory approach, we conducted semi-structured interviews with 48 New Zealand ... Keywords: clinical decision support systems, human genetics, knowledge management
Yulong Gu, Jim Warren, Karen Day
Knowledge Management in Locating the Patient in an Emergency Medical Service in Italy
This study examines an Emergency Medical Service in order to analyze the composite set of activities and instruments directed at locating the patient. The good management of information about the location of the emergency is highly relevant for a reliable ... Keywords: control room, emergency calls, ethnography, ethnomethodology, knowledge management, technology blending
Fabio Dovigo; Ilaria Redaelli
Undirected Graphs maze exploration
and Adar, 2004 corporate e-mail #12;5 Power transmission grid of Western US Reference: Duncan Watts #12 The Internet as mapped by The Opte Project http://www.opte.org #12;8 Graph terminology #12;9 Some graph
Sedgewick, Robert
Detachments of Complete Graphs
A detachment of a graph $G$ is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. In this paper we consider the question of whether a graph $H$ is a detachment of some complete ...
Keith Edwards
IBM Global Business Services Supply Chain Management Executive Report
and services to customers. To meet customers' business intelligence needs, the Teradata Purpose-Built Platform-driven business intelligence. In addition to price and performance, customers can benefit from an operating.teradata.com. Teradata is a trademark or registered trademark of Teradata Corporation in the United States and other
Proposal of service management system for multimedia network environment
In a multimedia network environment, the network connection is required to support real-time data transmission and flexible architecture. IEEE 1394, a high performance serial bus that guarantees real-time streaming and supports Plug & Play, would be ... Keywords: IEEE 1394, multimedia network, network configuration, plug & play, service discovery
Atsunobu Takagi; Takahiro Koita; Kenya Sato
A self-managing wide-area data streaming service
Efficient and robust data streaming services are a critical requirement of emerging Grid applications, which are based on seamless interactions and coupling between geographically distributed application components. Furthermore the dynamism of Grid ... Keywords: Autonomic computing, Grid computing, Model based online control, Scientific data streaming
Viraj Bhat; Manish Parashar; Hua Liu; Nagarajan Kandasamy; Mohit Khandekar; Scott Klasky; Sherif Abdelwahed
Slicibility of rectangular graphs and floorplan optimization
Keywords: floorplanning, graph dualization, heuristic search, nonslicible floorplans, planar graphs, slicible floorplans, very large scale integration
Partha S. Dasgupta; Susmita Sur-Kolay
GJMF - a composable service-oriented grid job management framework
There exists a number of grid infrastructures in production use for a wide range of scientific applications. However, due to the complexities inherent to construction of distributed computing environments, many grid tools and applications remain tied ... Keywords: Grid computing, Grid ecosystem, Grid job management
Per-Olov �Stberg; Erik Elmroth
An Equal Opportunity Employer / Operated by Los Alamos National Security, LLC for the U.S. Department of Energy's NNSA Acquisition Services Management Division
.S. Department of Energy's NNSA Acquisition Services Management Division Subcontracts Group (ASM-DEP) Post Office
A Semantic Graph Query Language
Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.
Kaplan, I L
Crawling Online Social Graphs
Unbiased sampling of facebook,� 2009. [9] A. Korolova, R.these users. For example, Facebook was ranked as the 4thsample (1M node) of the Facebook graph. The basic idea is
Ye, Shaozhi; Lang, Juan; Wu, S F
Contracts and management services site support program plan WBS 6.10.14
Contracts and Management Services is recognized as the central focal point for programs having company or sitewide application in pursuit of the Hanford Missions`s financial and operational objectives. Contracts and Management Services actively pursues cost savings and operational efficiencies through: Management Standards by ensuring all employees have an accessible, integrated system of clear, complete, accurate, timely, and useful management control policies and procedures; Contract Reform by restructuring the contract, organization, and cost accounting systems to refocus Hanford contract activities on output products; Systems and Operations Evaluation by directing the Cost Reduction program, Great Ideas, and Span of Management activities; Program Administration by enforcing conditions of Accountability (whether DEAR-based or FAR-based) for WHC, BCSR, ICF KH, and BHI; Contract Performance activities; chairing the WHC Cost Reduction Review Board; and analyzing companywide Performance Measures; Data Standards and Administration by establishing and directing the company data management program; giving direction to the major RL programs and mission areas for implementation of cost-effective and efficient data management practices; directing all operations, application, and interfaces contained within the Hanford PeopleCore System; directing accomplishment and delivery of TPA data management milestones; and directing the sitewide data management processes for Data Standards and the Data Directory.
Knoll, J.M. Jr.
Strategic Energy Management Plan: General Services Administration, Region 10, Northwest/Arctic Region
the mission of the General Services the mission of the General Services Administration is to help federal agencies better serve the public by offering, at best value, superior workplaces and expert solutions, acquisition services, and management policies. our vision as staff of GSA's Northwest/Arctic Region is to serve as strategic real estate advisors who provide superior, sustainable workspace solutions that exceed customer expectations, enhance worker productivity, and reflect our understanding of client needs while providing environmental leadership within the communities we serve. our core values are "SAIL ON" which stands for Support, Accountability, Integrity, Loyalty and trust, Ownership/commitment, and Nurture a fun workplace. i table of contents
Chapter 5, "License Renewal and Aging Management for Continued Service
As of August 2011, there were 104 commercial nuclear power reactors licensed to operate in 31 states in the United States. Initial operating licenses in the United States are granted for a period of 40 years. In order to help assure an adequate energy supply, the USNRC has established a timely license renewal process and clear requirements that are needed to ensure safe plant operation for an extended plant life. The principals of license renewal and the basic requirements that address license renewal are identified as well as additional sources of guidance that can be utilized as part of the license renewal process. Aging management program inspections and operating experience related to the concrete and steel containment structures are provided. Finally, several lessons learned are provided based on containment operating experience.
Naus, Dan J [ORNL] [ORNL
Reference architecture, metamodel, and modeling principles for architectural knowledge management in information technology services
Capturing and sharing design knowledge such as architectural decisions is becoming increasingly important in firms providing professional Information Technology (IT) services such as enterprise application development and strategic outsourcing. Methods, ... Keywords: Architectural decisions, Architectural principles, DSL, Knowledge management, Model-driven engineering, Outsourcing, SOA, Workflow
Olaf Zimmermann; Christoph Miksovic; Jochen M. K�Ster
Distributed web-based management framework for ambient reconfigurable services in the intelligent environment
Existing and emerging technologies in the areas of mobile computing, wireless communications/ networking, sensor and control devices, context awareness, user interfaces, etc., provide the ground for the support of human activities in a certain space. ... Keywords: ambient intelligence, context awareness, intelligent environment, service management
V. Stavroulaki; K. Demestichas; E. Adamopoulou; P. Demestichas
Graph Transformations in Relational Databases
The theory of graph transformation [2] was originally developed as a generalization of Chomsky grammars from strings to graphs. Methods, techniques, and tools from the area of graph transformations have already been studied and applied in many fields of computer science such as formal language theory, pattern recognition and generation, compiler construction, software engineering, etc. Despite the large variety of existing graph transformation tools, the implementation of their graph transformation engine typically follows the same principle. In this respect, first a matching occurrence of the left-hand side (LHS) of the graph transformation rule is being found by some sophisticated graph pattern matching algorithm. Then the engine performs some local modifications to add or remove graph elements to the matching pattern, and the entire process starts all over again. Since graph pattern matching leads to the subgraph isomorphism problem that is known to be NPcomplete in general, this step is considered to be the most crucial in the overall performance of a graph transformation engine. Current tools (e.g., PROGRES [4]) use different efficient strategies for the graph pattern matching phase. However, I argue that the overall complexity of a graph transformation engine is not necessarily equal to the complexity of the graph pattern matching phase, especially for long transformation sequences.
Gergely Varr�
Analysis of multilevel graph partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph partitions. However, there exists little theoretical analysis ...
George Karypis; Vipin Kumar
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a challenging task to mine for frequent patterns in this new graph model ...
Ali Cakmak; Gultekin Ozsoyoglu
Towards graph containment search and indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g ? D such that q contains g (q ? g). Due to the wide adoption of graph models, fast containment search ...
Chen Chen; Xifeng Yan; Philip S. Yu; Jiawei Han; Dong-Qing Zhang; Xiaohui Gu
Algorithms for string and graph layout
Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on ...
Newman, Alantha.
An Experiment on Graph Analysis Methodologies for Scenarios
Visual graph representations are increasingly used to represent, display, and explore scenarios and the structure of organizations. The graph representations of scenarios are readily understood, and commercial software is available to create and manage these representations. The purpose of the research presented in this paper is to explore whether these graph representations support quantitative assessments of the underlying scenarios. The underlying structure of the scenarios is the information that is being targeted in the experiment and the extent to which the scenarios are similar in content. An experiment was designed that incorporated both the contents of the scenarios and analysts� graph representations of the scenarios. The scenarios� content was represented graphically by analysts, and both the structure and the semantics of the graph representation were attempted to be used to understand the content. The structure information was not found to be discriminating for the content of the scenarios in this experiment; but, the semantic information was discriminating.
Brothers, Alan J.; Whitney, Paul D.; Wolf, Katherine E.; Kuchar, Olga A.; Chin, George
Temporal Representation in Semantic Graphs
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Levandoski, J J; Abdulla, G M
The web-based graphic service request system for facility management of apartments
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 as a pragmatic solution to the limitations of current computerized maintenance management system (CMMS) processes. Service request process in CMMS was developed as text-based, so that it is hard for ordinary tenants to use. Therefore, when tenants have a problem in a facility, they prefer calling in service requests or going to the office instead of using the internet service request application. In practice, work orders and records are often misplaced - resulting in lower efficiency and customer satisfaction. This may be overcome by a system that states information digitally and provides a web-based Graphic Service Request (WGSR) interface. The interface allow customers to report environmental problems in the facility, trace their work order progress, view schedules for maintenance, and provide feedback for service online. The WGSR system is an end-user point-and-click graphical interface that allows residents to request service by selecting a problem fixture on a floor plan image. By using HTML image map tags and combination of location, part, and types of problem identification number, the resident's input produces a text-based problem report for Facility Management (FM) departments that allows them to service requests on the fly. To solve the complexity and inefficiency issues of CMMS, the user interface for the WGRS system consists of a perspective drawing or isometric drawing of each unit's plan. An empirical test of the system and post-task survey was conducted to determine the efficiency and usefulness of the system. The analysis of the results shows the system to be efficient and convenient in several fields, including comprehensibility, navigability, simplicity, clarity, compatibility, and graphic appeal. This result shows that residents prefer to use the WGSR system and could reduce the effort needed to make and receive service request phone calls and input information into a database. The labor and time for daily work could be saved to recognize problems correctly and set the right schedule so that this could be used for preventive work and project work.
Lee, Kwang Jun
Errors in graph embedding algorithms
One major area of difficulty in developing an algorithm for embedding a graph on a surface is handling bridges which have more than one possible placement. This paper addresses a number of published algorithms where this has not been handled correctly. ... Keywords: Algorithm, Graph embedding, Graph genus, Torus
Wendy Myrvold; William Kocay
Extremal graphs without 4-cycles
We prove an upper bound for the number of edges a C"4-free graph on q^2+q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Keywords: Extremal graph, Polarity, Projective plane
Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford
Power domination in block graphs
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation ... Keywords: algorithm, block graphs, electric power system, power dominating set
Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao
Graph theoretic approach to parallel gene assembly
We study parallel complexity of signed graphs motivated by the highly complex genetic recombination processes in ciliates. The molecular gene assembly operations have been modeled by operations of signed graphs, i.e., graphs where the vertices have a ... Keywords: Double-split graphs, Gene assembly, Local complement, Parallel assembly, Perfect matching, Signed graphs, Split graphs
Tero Harju; Chang Li; Ion Petre
Services Services Services Overview ECS Audio/Video Conferencing Fasterdata IPv6 Network Network Performance Tools (perfSONAR) ESnet OID Registry PGP Key Service Virtual Circuits (OSCARS) DOE Grids Service Transition Contact Us Technical Assistance: 1 800-33-ESnet (Inside the US) 1 800-333-7638 (Inside the US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: firstname.lastname@example.com Provide Web Site Feedback: firstname.lastname@example.com Services ESnet provides interoperable, effective, reliable, and high performance network communications infrastructure, and certain collaboration services, in support of the Office of Science (SC)'s large-scale, collaborative science programs. ESnet provides users with high bandwidth access to DOE sites and DOE's primary science collaborators including Research and
GAO-05-274 Contract Management: Opportunities to Improve Surveillance on Department of Defense Service Contracts
Secretary of Defense Secretary of Defense March 2005 CONTRACT MANAGEMENT Opportunities to Improve Surveillance on Department of Defense Service Contracts GAO-05-274 What GAO Found United States Government Accountability Office Why GAO Did This Study Highlights Accountability Integrity Reliability www.gao.gov/cgi-bin/getrpt?GAO-05-274. To view the full product, including the scope and methodology, click on the link above. For more information, contact David E. Cooper at (617) 788-0555 or firstname.lastname@example.com. Highlights of GAO-05-274, a report to the Secretary of Defense March 2005 CONTRACT MANAGEMENT Opportunities to Improve Surveillance on Department of Defense Service Contracts Surveillance varied on the 90 contracts we reviewed. Surveillance was insufficient on 26 of the contracts we reviewed but was sufficient on
Electronic Sigunatures: How to Mitigate the Risk of Commercial Managements Services
GSA GSA March 3, 2005 Dear CIO Member : On December 20, 2004, the Office of Management and Budget (OMB) issued memorandum M-05-05 "Electronic Signatures : How to Mitigate the Risk of Commercial Managed Services ." This technical supplement provides additional information on the Shared Service Provider Program prescribed for agency use in the OMB memorandum . Definitions and Scope "Electronic signature" used in M-05-05 refers to technology used for identity assurance in addition to the act of affixing a legal signature to a document . The scope of these memos is limited to Public Key Infrastructure (PKI), a cryptographically based "signature" solution . Specifically, these memos cover the deployment of PKI digital certificates to Federal employees and contractor staff on
Quantum chaos on discrete graphs
Adapting a method developed for the study of quantum chaos on {\\it quantum (metric)} graphs \\cite {KS}, spectral $\\zeta$ functions and trace formulae for {\\it discrete} Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of $\\zeta$ functions proposed originally by Ihara \\cite {Ihara}, and expanded by subsequent authors \\cite {Stark,Sunada}. Finally, a model of "classical dynamics" on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs \\cite {KS}.
Uzy Smilansky
Resource Management Services: Land Use, Part 501: Use of Flood Control
Services: Land Use, Part 501: Use of Flood Services: Land Use, Part 501: Use of Flood Control Lands (New York) Resource Management Services: Land Use, Part 501: Use of Flood Control Lands (New York) < Back Eligibility Agricultural Commercial Construction Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State New York Program Type Siting and Permitting Provider
Games on Graphs
We introduce and study Maker-Breaker positional games on random graphs. Our goal is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of F in the unbiased (one-on-one) game played on the edges of the random graph G(n; p), for various target families F of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game, the Hamiltonian cycle game and the tree game. Particular attention is devoted to unbiased games, when b = 1. Next, we consider the planarity game and the k-coloring game on the complete graph on n vertices. In the planarity game the winning sets are all non-planar subgraphs, and in the k-coloring game the winning sets are all non-k-colorable subgraphs. For both of the games we look at a (1: b) biased game. We are interested in determining the largest bias b such that Maker wins the Maker-Breaker version of the game. On the other hand, we want to find the largest bias b such that Forcer wins the Avoider-Forcer version of the game. Finally, we deal with balanced online games on the random graph process. The game is played by a player called Painter. Edges in the random graph process are introduced two at a time. For each pair of edges Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid creating a monochromatic copy of a prescribed fixed graph H, for as long as possible. We study the threshold mH for the number of edges to be played to know that Painter almost surely will create a monochromatic copy of H, for H being a cycle, a path and a star.
Milos Stojakovic
Graph Homomorphisms for Quantum Players
A homomorphism from a graph X to a graph Y is an adjacency preserving mapping f:V(X)->V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lovasz theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that other quantum graph parameters, such as quantum independence number, can differ from their classical counterparts. Finally, we show that quantum homomorphisms closely relate to zero-error channel capacity. In particular, we use quantum homomorphisms to construct graphs for which entanglement-assistance increases their one-shot zero-error capacity.
David E. Roberson; Laura Mancinska
The Human Capital Office offers benefit, new employee orientation and some learning & development related services to all DOE employees. Additionally the Office supplies employee and labor...
Management support services to the Office of Utility Technologies. Final technical report
DOE Green Energy (OSTI)
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.
Not Available
Quality Services: Solid Wastes, Parts 370-376: Hazardous Waste Management
Parts 370-376: Hazardous Waste Parts 370-376: Hazardous Waste Management System (New York) Quality Services: Solid Wastes, Parts 370-376: Hazardous Waste Management System (New York) < Back Eligibility Commercial Fed. Government Industrial Investor-Owned Utility Local Government Municipal/Public Utility Rural Electric Cooperative Schools State/Provincial Govt Tribal Government Utility Program Info State New York Program Type Safety and Operational Guidelines Provider NY Department of Environmental Conservation 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, transporters, as well as treatment, storage and disposal facilities. The regulations also define specific types
Implementation Design Document UNC Distributed Graph Service
. Shackelford The University of North Carolina at Chapel Hill Department of Computer Science CB#3175, Sitterson
North Carolina at Chapel Hill, University of
Requirements Document UNC Distributed Graph Service
Application of e-Governance to Civil Service Management of Bangladesh: Does it Bring Efficiency and Effectiveness?
The effective civil service management is a dynamic process in developed and developing countries of the world. It plays a predominant role for bringing about social change and development whereas e-Governance is the transitional media for initiating ...
Mohammad Hamiduzzaman
Enhancing E-Service Collaboration with Enforcement and Relationship Management: A Methodology from Requirements to Event Driven Realization
In a business-to-business B2B e-service environment, cross-organizational collaboration is important for attaining the interoperability of business processes and their proper enactment. The authors find that B2B collaboration can be divided into multiple ... Keywords: B2B, Collaboration, E-Service, ECA-Rules, Enactment, Exception Detection, Exception Handling, Meta-Modeling, Process Management, Requirement Engineering, UML, Web Services
Dickson K.W. Chiu; Shing-Chi Cheung; Sven Till; Lalita Narupiyakul; Patrick C.K. Hung
Energy of graphs and digraphs.
??The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the� (more)
Jahanbakht, Nafiseh
Distributed large-scale natural graph factorization
Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internet. These graphs are massive, often containing hundreds of millions of nodes and billions of edges. While some theoretical models ... Keywords: asynchronous algorithms, distributed optimization, graph algorithms, graph factorization, large-scale machine learning, matrix factorization
Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, Alexander J. Smola
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, ... Keywords: Crossing number, Geometric graphs, Proximity graphs
Bernardo M. �brego; Ruy Fabila-Monroy; Silvia Fern�ndez-Merchant; David Flores-Pe�aloza; Ferran Hurtado; Vera Sacrist�n; Maria Saumell
A history of graph entropy measures
This survey seeks to describe methods for measuring the entropy of graphs and to demonstrate the wide applicability of entropy measures. Setting the scene with a review of classical measures for determining the structural information content of graphs, ... Keywords: Entropy, Graph complexity, Graph entropy, Graphs, Information inequalities, Information measures, Information theory, Structural complexity
Matthias Dehmer; Abbe Mowshowitz
Skewed graph partitioning
Graph partitioning is an important abstraction used in solving many scientific computing problems. Unfortunately, the standard partitioning model does not incorporate considerations that are important in many settings. We address this by describing a generalized partitioning model which incorporates the notion of partition skew and is applicable to a variety of problems. We then develop enhancements to several important partitioning algorithms necessary to solve the generalized partitioning problem. Finally we demonstrate the benefit of employing several of these generalized methods to static decomposition of parallel computing problems.
Hendrickson, B.; Leland, R. [Sandia National Labs., Albuquerque, NM (United States); Van Driessche, R. [Alcatel Telecom, Antwerp (Belgium)
Resource Management Services, Part 608: Use and Protection of Waters (New
8: Use and Protection of 8: Use and Protection of Waters (New York) Resource Management Services, Part 608: Use and Protection of Waters (New York) < Back Eligibility Agricultural Commercial Construction Fed. Government Fuel Distributor General Public/Consumer Industrial Installer/Contractor Institutional Investor-Owned Utility Local Government Low-Income Residential Multi-Family Residential Municipal/Public Utility Nonprofit Residential Retail Supplier Rural Electric Cooperative Schools State/Provincial Govt Systems Integrator Transportation Tribal Government Utility Savings Category Alternative Fuel Vehicles Hydrogen & Fuel Cells Buying & Making Electricity Water Home Weatherization Solar Wind Program Info State New York Program Type Environmental Regulations Provider NY Department of Environmental Conservation
Combining Mobile XMPP Entities and Cloud Services for Collaborative Post-Disaster Management in Hybrid Network Environments
Crises such as the Fukushima incident in Japan showed the demand for flexible and easy-to-use monitoring and communication systems to support post-disaster management (i.e. the organization of actions in the follow-up of disasters), especially when critical ... Keywords: XMPP, cloud services, collaboration, mDNS, post-disaster management
Ronny Klauck; Michael Kirsche
A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm
A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information ... Keywords: Borel Cayley graph, Cayley graph, Graph theory, Interconnection networks, Network modeling
Jaewook Yu; Eric Noel; K. Wendy Tang
Clustering based on a near neighbor graph and a grid cell graph
This paper presents two novel graph-clustering algorithms, Clustering based on a Near Neighbor Graph (CNNG) and Clustering based on a Grid Cell Graph (CGCG). CNNG algorithm inspired by the idea of near neighbors is an improved graph-clustering method ... Keywords: Clustering, Grid Cell Graph, Grid cell, Near Neighbor Graph, Near neighbor point set
Xinquan Chen
Amplifying Real Estate Value through Energy & Water Management: From ESCO to "Energy Services Partner"
Market Opportunities for Energy Service Companies among Realthe concept of an �Energy Services Partner�, who takes anproposition for how Energy Service Companies (ESCOs) could
Mills, Evan
Robust Hamiltonicity of Dirac graphs
A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac's theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very strong sense. First, we consider a random subgraph of a Dirac graph obtained by taking each edge independently with probability $p$, and prove that there exists a constant $C$ such that if $p \\ge C \\log n / n$, then a.a.s. the resulting random subgraph is still Hamiltonian. Second, we prove that if a $(1:b)$ Maker-Breaker game is played on a Dirac graph, then Maker can construct a Hamiltonian subgraph as long as the bias $b$ is at most $cn /\\log n$ for some absolute constant $c > 0$. Both of these results are tight up to a constant factor, and are proved under one general framework.
Krivelevich, Michael; Sudakov, Benny
Quantum networks modelled by graphs
Quantum networks are often modelled using Schr�dinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey
Pavel Exner; Olaf Post
On Generating Random Network Structures: Connected Graphs
are presented for random generation of connected graphs, sugraphs (sub- graphs on the ... a distribution and take it into account at estimation. Attainability is�...
From quantum graphs to quantum random walks
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
Gregor Tanner
TVA nuclear power: Management of the nuclear program through personal services contracts
Mr. Steven White, a retired admiral, is serving as manager of the TVA Office of Nuclear Power. GAO previously concluded that Mr. White's retention under contractual arrangements constituted the improper use of a personal services contract and represented a circumvention of the statutory ceiling on salary payments to TVA employees. This report finds that Mr. White's rate of pay is within the range of the salaries paid by a sample of nonfederal utilities to their top executives and is over two and a half times the average salary paid to executives who hold positions which appear to have responsibility for managing the utilities' power or nuclear power operations. GAO also found that (1) TVA's Office of Nuclear Power has employed an additional 25 persons since 1986 under arrangements similar to the employing arrangements of Mr. White and (2) TVA's Nuclear Safety Review staff no longer reports directly to the TVA Board of Directors and General Manager. It has relocated from Knoxville, Tennessee to Chattanooga, Tennessee.
Towards Standardized and Automated Fault Management and Service Provisioning for NGNs
The IP Multimedia Subsystem (IMS), already widely recognized as a fundamental core component of Next Generation Networks (NGNs), enables proliferation of a huge variety of value added services. Simultaneous to the emergence of triple play services there ... Keywords: IP Multimedia Subsystem, New Generation Operations Systems and Software, Service Oriented Architectures, Service assurance, Service fulfillment, Service provisioning
Niklas Blum; Piotr Jacak; Florian Schreiner; Dragos Vingarzan; Peter Weik
An Equal Opportunity Employer / Operated by Los Alamos National Security, LLC for the U.S. Department of Energy's NNSA Acquisition Services Management Division CMRR Project Date: November 30, 2011
.S. Department of Energy's NNSA Acquisition Services Management Division CMRR Project Date: November 30, 2011
Resource Management Services: Mineral Resources, Parts 550-559 (New York) |
Mineral Resources, Parts 550-559 (New Mineral Resources, Parts 550-559 (New York) Resource Management Services: Mineral Resources, Parts 550-559 (New York) < Back Eligibility Commercial Construction Industrial Investor-Owned Utility Municipal/Public Utility Tribal Government Utility Program Info State New York Program Type Environmental Regulations Provider NY Department of Environmental Conservation This section establishes a Bureau of Mineral Resources within the Department of Environmental Conservation, which has the authority to regulate the exploration and mining for oil and gas resources in New York State. The regulations include permitting and reporting requirements for exploration or production well drilling or deepening, well spacing, drilling practices, well plugging and abandonment, secondary recovery and
To inform the Commission that the staff plans to remove the General Services Administration (GSA) Watertown, MA property from the Site Decommissioning Management Plan (SDMP) as it meets the radiological criteria for unrestricted use in 10 CFR 20.1402. BACKGROUND: The GSA property is located in Watertown, Middlesex County, MA, approximately 13 kilometers (8 miles) west of Boston. It was a parcel of the former Watertown Arsenal used by the U.S. Army for depleted uranium (DU) munition operations authorized under Atomic Energy Commission (AEC) License No. SUB-238. From 1955-1966, an area northeast of the Arsenal site (now identified as the GSA property) was designated for stabilization of DU scrap from Arsenal activities. Operations involved igniting DU fragments at a specific site location (�burn pit�) to reduce volume, packaging the material in waste containers, and preparing shipments for offsite disposal. Contamination of soil resulted from spillage of the DU fragments and burned
William D. Travers
EIS-0442: Forest Service Reauthorization of Transmission Lines on Forest Service Lands in Colorado, Utah and Nebraska for Routine Maintenance Practices including Changes in Vegetation Management
Draft Environmental Impact Statement: Comment Period Ends 10/12/13This 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.
Graph anomalies in cyber communications
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
A study in the application of energy management at a table service restaurant
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.
Balmer, A.; Nodolf, K.M.
Analysis of Assembly Bill 264: Pediatric Asthma Self-Management Training and Education Services
self-management training and education programs assessed inasthma self-management training and education programs haveAsthma self-management training and education programs have
California Health Benefits Review Program (CHBRP)
An extension of secure group communication using key graph
With the continuously emerging of Internet applications based on secure group communication, the design of secure group communication becomes an important Internet design topic. Group key management is important for secure group communication. Previous ... Keywords: Batch rekey, Group security, Key graph, Rekey
Zhang Jun; Zhou Yu; Ma Fanyuan; Gu Dawu; Bai Yingcai
Probe threshold and probe trivially perfect graphs
An undirected graph G=(V,E) is a probeC graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E^'@?NxN such that G^'=(V,E@?E^') is a C graph. In this article we investigate probe ... Keywords: 2-SAT, Graph class, Probe graphs, Probe interval, Probe threshold, Probe trivially perfect
Daniel Bayer; Van Bang Le; H. N. de Ridder
DOE FEMP/U. S. Forest Service, Bureau of Land Management Collaborative...
service voltage * Number of service drops * No. of electric meters * Distance to closest substation * Power Quality problems? * Momentary Power Outages? * Sustained Power Outages?...
DOE Hanford request for services for HANDI 2000 business management system
This work includes services provided by PHMC which are defined by DOE-RL with support from FDH Accounting. Services include: Site wide information system support; Site infrastructure including occupancy; Utilities; Fleet services; Printing and reproduction services; Training; Supplies and material, etc.
Wilson, D.
Dec 16, 2005 ... ?(G) of a graph G. We introduce an operator ? mapping any graph parameter ?( G), nested between ...... On the Shannon capacity of a graph.
Time Series Graphs of Global and Hemispheric Temperature Anomalies...
Time Series Graphs of Global and Hemispheric Temperature Anomalies graphics Graph - Global and Hemispheric Annual Temperature Anomalies, 1850-2012 graphics Graph - Northern...
Nested (2,r)-regular graphs and their network properties.
??A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph� (more)
Brooks, Josh Daniel
Efficient Technical and Organizational Measures for Privacy-aware Campus Identity Management and Service Integration
: Figure 3, taken from Novell's web-based management front end, iManager, shows the various stages, which.g. by system administrators, within own programs and scripts to automate certain management batch tasks
Establishing an inventory management process to meet high customer service levels in a vaccines organization.
??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� (more)
Wonsowicz, Johanna Christine
Positional Games on Random Graphs
We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability pF for the existence of Maker's strategy to claim a member of in the unbiased game played on the edges of random graph G(n, p), for various target families of winning sets. More generally, for each probability above this threshold we study the smallest bias b such that Maker wins the (1: b) biased game. We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game and the Hamiltonian cycle game.
Milos Stojakovic; Tibor Szabo
Inter-organizational Emergency Medical Services: Case Study of Rural Wireless Deployment and Management
Over the last two decades, use of mobile communications for emergency services (e.g. 911) has grown exponentially. This rise of mobile networks has increased reliance on new private and public partnerships to deliver these time critical services. Drawing ... Keywords: E-911 policy, complex systems, emergency medical services, emergency response systems, inter-organizational systems, mobile communications, wireless networks
Thomas A. Horan; Benjamin Schooley
Student, Faculty, & StaFF Support active directory: Centralized directory service used to manage
Management System (uMcontent): Web content management system, which supports the design and maintenance): Relational database management system that offers data compression and disaster recovery functions data and accounts management eresearch: Electronic research database systems with web-based forms and tools
Amin, S. Massoud
A discrete curvature on a planar graph
Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.
M. Lorente
Graph coloring and related symmetric functions - CECM
metric functions), pa (the power sum symmetric functions), s~ (the Schur functions ), ..... It is true for line graphs (a special class of claw-free graphs) by a result of.
0-1 graph partitioning and image segmentation
Graph partitioning is the grouping of all the nodes in a graph into two or more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. ...
Goh, Chun Fan
Graph partitioning via recurrent multivalued neural networks
In this work, the well-known Graph Partitioning (GP) problem for undirected weighted graphs has been studied from two points of view: maximizing (MaxCut) or minimizing (MinCut) the cost of the cut induced in the graph by the partition. An unified model, ...
Enrique M�rida-Casermeiro; Domingo L�pez-Rodr�guez
A Graph Analytical Approach for Topic Detection
Topic detection with large and noisy data collections such as social media must address both scalability and accuracy challenges. KeyGraph is an efficient method that improves on current solutions by considering keyword cooccurrence. We show that KeyGraph ... Keywords: KeyGraph-based Topic Detection, Topic detection, community detection, network analysis
Hassan Sayyadi, Louiqa Raschid
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identifying highly associated groups and clusters. In this paper, we investigate ... Keywords: closed pattern, connectivity, graph
Xifeng Yan; X. Jasmine Zhou; Jiawei Han
Introducing complete graphs in molecular connectivity studies
The mathematical model of the molecular polarizability of fifty-four organic compounds, of the lattice enthalpy of twenty metal halides, and of the partition coefficient of twenty-five organic compounds has been used to test four different complete graph, ... Keywords: Mathematical model, algorithms, chemical graphs, complete graphs, core electrons, molecular connectivity, polarizability
Lionello Pogliani
Bipartite graph partitioning and data clustering
Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender ... Keywords: bipartite graph, correspondence analysis, document clustering, graph partitioning, singular value decomposition, spectral relaxation
Hongyuan Zha; Xiaofeng He; Chris Ding; Horst Simon; Ming Gu
Drawing graphs nicely using simulated annealing
The paradigm of simulated annealing is applied to the problem of drawing graphs �nicely.� Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. ... Keywords: aesthetics, graph drawing, simulated annealing
Ron Davidson; David Harel
An Equal Opportunity Employer / Operated by Los Alamos National Security, LLC for the U.S. Department of Energy's NNSA Acquisition Services Management Division CMRR Project Date: 11/28/2011
.S. Department of Energy's NNSA Acquisition Services Management Division CMRR Project Date: 11/28/2011 Los
An Equal Opportunity Employer / Operated by Los Alamos National Security, LLC for the U.S. Department of Energy's NNSA Acquisition Services Management Division CMRR Project Date: 12/8/2011
.S. Department of Energy's NNSA Acquisition Services Management Division CMRR Project Date: 12/8/2011 Los
Establishing an inventory management process to meet high customer service levels in a vaccines organization
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 ...
An intelligent buffer management approach for GFR services in IP/ATM internetworks
In ATM networks, the Guaranteed Frame Rate (GFR) service has been proposed to accommodate non-real-time traffic with packet size not exceeding a maximum length, such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput at ... Keywords: FIFO scheduling, Guaranteed frame rate, TCP/IP, Virtual push-out
Pi-Chung Wang; Chia-Tai Chan; Yaw-Chung Chen
Constrained Graph Optimization: Interdiction and Preservation Problems
The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.
Schild, Aaron V [Los Alamos National Laboratory
Performance Based Service Acquisition Toolkit | Department of...
Services Performance Based Service Acquisition Toolkit Performance Based Service Acquisition Toolkit Aviation Management Green Leases Executive Secretariat Energy Reduction at...
Happy Endings for Flip Graphs
Abstract. We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently. 1
unknown authors
We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include intersections of lattices with convex sets, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.
David Eppstein
The managed entry of new drugs into a National Health Service: a case study for Malta.
??The research question was to determine if it is possible to develop a systematic approach to the managed entry of new drugs into a National� (more)
Bonanno, Patricia Vella
self-management training and education programs assessed inmanagement training and education programs have a patternmanagement training and education programs have favorable
U.S. Navy ships food service divisions: moderning inventory management .
??The Navy's current inventory management procedures for receipt, inventory, stowage, and issue of provisions onboard ships have remained relatively unchanged for decades. Culinary Specialists are� (more)
James, Robert J.
Examining Issues of Cost, Target Populations, and Collaborative Implementation of Medication Therapy Management Services Interventions
inter-organizational collaborations for community health. [organizational and community context: a framework for building evidence on dissemination and implementation in healthhealth services is strongly influenced by the organizational
Ling, Deborah S.
SNAP: A Protocol for Negotiating Service Level Agreements and Coordinating Resource Management in Distributed Systems
A fundamental problem in distributed computing is to map activities such as computation or data transfer onto resources that meet requirements for performance, cost, security, or other quality of service metrics. The creation of such mappings requires ...
Karl Czajkowski; Ian T. Foster; Carl Kesselman; Volker Sander; Steven Tuecke
Specifications for and Design of an Electric Service Plan Portfolio Management System
Changes in the structure and technology of the electric power industry will ultimately lead to profound changes in the electric service plans that are offered to customers. Given the value of electricity to state and local economies, the design and mix of the electric service plans offered by electricity utilities and competitive retailers may have large impacts on both direct stakeholders and the overall economy. For customers and utilities to benefit from these changes, it is essential that they ...
Computing Information Value from RDF Graph Properties
Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We compute information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.
al-Saffar, Sinan; Heileman, Gregory
The Energy Services Provider as Corporate Engineer: A Partnership in Developing a Productive, Sustainable Energy Management Program
Industrial facilities can be large consumers of energy and have significant environmental aspects or impacts. Sustainable management of energy use and the environment is a growing concern for most industrial companies. Effective energy management can lower operating costs, improve profits, and contribute to a company�s progress in eco-efficiency and environmental responsibility. It is often difficult for a company to hire or designate the required person or team to focus on developing an effective energy management program. Developing such a program in an industrial environment can require abroad spectrum of experience and expertise. This paper provides an overview of a unique partnership between an industrial firm and an engineering firm that provides energy services. Cook Composites and Polymers Co. (CCP) is a world leader in the production and distribution of gel coat, composite polyester resins, coatings resins, dispersions, and emulsions. CCP operates at 12 locations in the United States. 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.
Imel, M.; Gromacki, M.
Safety & Emergency Management
Coordination Management andor Coordination of APS Site WorkServices Safety & Emergency Management Database Maintenance Personnel Safety & Emergency Management Area...
Power management in energy harvesting embedded systems with discrete service levels
Power management has been a critical issue in the design of embedded systems due to the limited power supply. To prolong the lifetime, energy minimization has been studied under performance constraints in the past decade. The emerging embedded systems ... Keywords: embedded systems, energy harvesting systems, power management, reward maximization, solar cells
Clemens Moser; Jian-Jia Chen; Lothar Thiele
API Requirements for Dynamic Graph Prediction
Given a large-scale time-evolving multi-modal and multi-relational complex network (a.k.a., a large-scale dynamic semantic graph), we want to implement algorithms that discover patterns of activities on the graph and learn predictive models of those discovered patterns. This document outlines the application programming interface (API) requirements for fast prototyping of feature extraction, learning, and prediction algorithms on large dynamic semantic graphs. Since our algorithms must operate on large-scale dynamic semantic graphs, we have chosen to use the graph API developed in the CASC Complex Networks Project. This API is supported on the back end by a semantic graph database (developed by Scott Kohn and his team). The advantages of using this API are (i) we have full-control of its development and (ii) the current API meets almost all of the requirements outlined in this document.
Gallagher, B; Eliassi-Rad, T
Audit Report on Management Controls over the Use of Service Contracts at the Office of River Protection
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
A copositive programming approach to graph partitioning
Aug 3, 2005 ... the random graph we can determine OPTMC by inspection, see column 3. The last 4 columns .... completeness. Freeman, San Francisco, 1979.
[30] P. Fowler, P. Hansen, G. Caporossi, and A. Soncini, Polyenes with maximum homo-lumo gap. (variable neighborhood search for extremal graphs 7),�...
Graph algorithms in the titan toolkit.
Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.
McLendon, William Clarence, III; Wylie, Brian Neil
Mixture graph based semi-supervised dimensionality reduction
Graph structure is crucial to graph based dimensionality reduction. A mixture graph based semi-supervised dimensionality reduction (MGSSDR) method with pairwise constraints is proposed. MGSSDR first constructs multiple diverse graphs on different random ... Keywords: dimensionality reduction, mixture graph, noise, pairwise constraints
G. X. Yu; H. Peng; J. Wei; Q. L. Ma
A Self-Managing Wide-Area Data Streaming Service using Model-based Online Control
-latency robust data streaming between the corresponding distributed components. For example, a typical Grid-- Efficient and robust data streaming services are a critical requirement of emerging Grid applications, which for wide-area high-performance distributed computing. As Grid technologies and testbeds mature
Flexible spectrum management for mobile broadband services: How does it vary across advanced and emerging markets?
Demand for wireless data and Internet services are expected to grow exponentially, both in advanced and emerging markets in the near future. While advanced countries have often used centralized planning and coordination methodology to forecast and allocate ... Keywords: Cognitive radios, Economies of scale, Inefficient spectrum allocation, Multi SIMs, Secondary spectrum market, Spectrum sharing, Spectrum trading, System dynamics
Varadharajan Sridhar; Thomas Casey; Heikki H�Mm�Inen
Managing the Cost, Energy Consumption, and Carbon Footprint of Internet Services
enough to be useful even in the absence of brown energy caps, different electricity prices, or green ser- vice and realistic data on energy and carbon offset prices (gathered from various sources distribution based on hourly electricity prices to reduce the energy cost of Internet services [3]. We
Martonosi, Margaret
Line graph explorer: scalable display of line graphs using Focus+Context
Scientific measurements are often depicted as line graphs. State-of-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundreds to thousands of such graphs. Despite the increasing volume and ubiquity ... Keywords: Focus+Context, line graph
Robert Kincaid; Heidi Lam
Multithreaded Algorithms for Graph Coloring
Graph algorithms are challenging to parallelize when high performance and scalability are primary goals. Low concurrency, poor data locality, irregular access pattern, and high data access to computation ratio are among the chief reasons for the challenge. The performance implication of these features is exasperated on distributed memory machines. More success is being achieved on shared-memory, multi-core architectures supporting multithreading. We consider a prototypical graph problem, coloring, and show how a greedy algorithm for solving it can be e*ectively parallelized on multithreaded architectures. We present in particular two di*erent parallel algorithms. The first relies on speculation and iteration, and is suitable for any shared-memory, multithreaded system. The second uses data ow principles and is targeted at the massively multithreaded Cray XMT system. We benchmark the algorithms on three di*erent platforms and demonstrate scalable runtime performance. In terms of quality of solution, both algorithms use nearly the same number of colors as the serial algorithm.
Catalyurek, Umit V.; Feo, John T.; Gebremedhin, Assefaw H.; Halappanavar, Mahantesh; Pothen, Alex
Feature Tracking Using Reeb Graphs
Tracking features and exploring their temporal dynamics can aid scientists in identifying interesting time intervals in a simulation and serve as basis for performing quantitative analyses of temporal phenomena. In this paper, we develop a novel approach for tracking subsets of isosurfaces, such as burning regions in simulated flames, which are defined as areas of high fuel consumption on a temperature isosurface. Tracking such regions as they merge and split over time can provide important insights into the impact of turbulence on the combustion process. However, the convoluted nature of the temperature isosurface and its rapid movement make this analysis particularly challenging. Our approach tracks burning regions by extracting a temperature isovolume from the four-dimensional space-time temperature field. It then obtains isosurfaces for the original simulation time steps and labels individual connected 'burning' regions based on the local fuel consumption value. Based on this information, a boundary surface between burning and non-burning regions is constructed. The Reeb graph of this boundary surface is the tracking graph for burning regions.
Weber, Gunther H.; Bremer, Peer-Timo; Day, Marcus S.; Bell, John B.; Pascucci, Valerio
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to use "Kronecker graphs", which naturally obey ...
Jure Leskovec; Christos Faloutsos
HRTM 362. Food Service Management 3 cr. Purchasing, cost control, sanitation, nutrition and other managerial con-
Experience 1-6 cr. Field experience (internship) for Hotel, Restaurant, and Tourism Man- agement Program. Hospitality and Tourism Research and Applications 3 cr. An overview of research techniques utilized by today. Prereq- uisites: HRTM 421 and HRTM 422. HRTM 431. Hotel Facilities Management 3 cr. Analysis of systems
Castillo, Steven P.
Cutting the energy bills of Internet Service Providers and telecoms through power management: An impact analysis
The energy consumption of the Information and Communication Technology (ICT) sector has been increasing recently; this sector is estimated to account for 2% of the total energy consumption. An even more aggressively increasing trend is the volume of ... Keywords: Energy saving, Green networking, Impact model, Power management
Raffaele Bolla; Roberto Bruschi; Alessandro Carrega; Franco Davoli; Diego Suino; Constantinos Vassilakis; Anastasios Zafeiropoulos
Collaborative robotic instruction: A graph teaching experience
Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has ... Keywords: Face-to-face computer supported collaborative learning, Intelligent tutoring systems, Interactive learning environments, Robotic assisted teaching
Rub�n Mitnik; Mat�as Recabarren; Miguel Nussbaum; Alvaro Soto
Inflo: collaborative reasoning via open calculation graphs
Inflo is a web tool that introduces new ways to collaboratively construct and deconstruct logical arguments drawn as visual dataflow graphs. Inflo graphs are dynamic: nodes are logical propositions that can contain computations based on ... Keywords: collaboration, decision making, knowledge curation
Jonathan Lung; Steve Easterbrook
Anonymizing bipartite graph data using safe groupings
Private data often come in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a large, sparse bipartite graph. As with tabular data, it is desirable to be able ... Keywords: Graph, Microdata, Privacy, Query answering
Graham Cormode; Divesh Srivastava; Ting Yu; Qing Zhang
Expressing graph algorithms using generalized active messages
Recently, graph computation has emerged as an important class of high-performance computing application whose characteristics differ markedly from those of traditional, compute-bound, kernels. Libraries such as BLAS, LAPACK, and others have been successful ... Keywords: active messages, parallel graph algorithms, parallel programming models
Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine
Improved call graph comparison using simulated annealing
The amount of suspicious binary executables submitted to Anti-Virus (AV) companies are in the order of tens of thousands per day. Current hash-based signature methods are easy to deceive and are inefficient for identifying known malware that have undergone ... Keywords: call graph, graph edit distance, malware, simulated annealing, static analysis
Orestis Kostakis; Joris Kinable; Hamed Mahmoudi; Kimmo Mustonen
Graph mining: Laws, generators, and algorithms
How does the Web look? How could we tell an abnormal social network from a normal one? These and similar questions are important in many fields where the data can intuitively be cast as a graph; examples range from computer networks to sociology to biology ... Keywords: Generators, graphs, patterns, social networks
Deepayan Chakrabarti; Christos Faloutsos
Generating random graphs with large girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. For any constant k, ? ? 1/2k(k ...
Mohsen Bayati; Andrea Montanari; Amin Saberi
Quantum Algorithms for Graph Problems -- A Survey
In this survey we give an overview about important methods to construct quantum algorithms and quantum lower bounds for graph problems. We show how to use these methods, and we give a summary about the quantum complexity of the most important graph problems. At the end of our paper, we give some interesting questions in this research area.
Sebastian D�rn
Oriented unicyclic graphs with extremal skew energy
Let $\\G$ be an oriented graph of order $n$ and $\\a_1,\\a_2,..., \\a_n$ denote all the eigenvalues of the skew-adjacency matrix of $\\G.$ The skew energy $\\displaystyle{\\cal E}_s(\\G)= \\sum_{i=1}^{n} |\\a_i|.$ In this paper, the oriented unicyclic graphs with minimal and maximal skew energy are determined.
Yaoping, Hou; Chongyan, Zhang
Bond Graph Modeling Of Variable Structure Systems
The problem of describing variable structure models in a compact, object--oriented fashion is revisited and analyzed from the perspective of bond graph modeling. Traditionally, bond graphs have always been used to describe continuous-- time physical processes with a fixed structure. Yet, this paper shall demonstrate that bond graphs are equally suitable to describe variable structure models as fixed structure models. Moreover, a bond graph description of variable structure models can teach us a lot about the essential properties of variable structure models, properties that are not easily visible when other modeling approaches are taken. The paper discusses issues related to causality reassignment and conditional index changes as a consequence of switching in a physical system. Keywords: Bond graphs, variable structure system, computational causality, conditional index change, switching, object--oriented modeling, Dymola. INTRODUCTION When the causality strokes were added to the forme...
Fran�ois E. Cellier; Martin Otter; Hilding Elmqvist
Development of a Modelling and Simulation Method Comparison and Selection Framework for Health Services Management
were car- ried out with local and national level health care man- agers to investigate their responses in depth. At the end of the project (after iterative revision of the tool), the national level health care manager at the NHS Institute of Innovation... and modelling in aerospace and the military Distributed Simulation, Discrete Event Simulation, System Dynamics, Real Time Simulation, Monte Carlo Simulation, Agent Based Simulation, War Gaming, Hybrid Simulation, Inverse Simulation, Petri-net, Markovian Model...
Jun, Gyuchan T; Morris, Zoe; Eldabi, Tillal; Harper, Paul; Naseer, Aisha; Patel, Brijesh; Clarkson, John P
NE-Rank: A Novel Graph-Based Keyphrase Extraction in Twitter
The massive growth of the micro-blogging service Twitter has shed the light on the challenging problem of summarizing a collection of large number of tweets. This paper attempts to extract topical key phrases that would represent topics in tweets. Due ... Keywords: Keyphrase Extraction, Graph-based Ranking, Hashtag, Twitter, PageRank, TextRank, NE-Rank
Abdelghani Bellaachia; Mohammed Al-Dhelaan
A combinatorial construction of almost-ramanujan graphs using the zig-zag product
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inherits its size from the large graph, its degree from the small graph ... Keywords: expander graphs, zig-zag product
Avraham Ben-Aroya; Amnon Ta-Shma
Written Statement of David Huizenga Senior Advisor for Environmental Management United States Department of Energy Before the Subcommittee on Strategic Forces Armed Services Committee United States Senate (May 8, 2013)
Senior Advisor David Huizenga represented the Department of Energy�s (DOE) Office of Environmental Management (EM) before the Subcommittee on Strategic Forces Armed Services Committee United States...
Written Statement of David Huizenga Senior Advisor for Environmental Management United States Department of Energy Before the Subcommittee on Strategic Forces Armed Services Committee United States House of Representatives (May 9, 2013)
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
Directives, Delegations, and Requirements
To establish policies and procedures for management of Department of Energy (DOE), including National Nuclear Security Administration (NNSA), management and ...
Office of Environmental Management | Department of Energy
Office of Environmental Management (EM)
Environmental Management Search form Search Office of Environmental Management Services Waste Management Site & Facility Restoration Program Management Communication & Engagement...
Bond graph modeling of centrifugal compressor system
system, active surge control. A novel method of modeling centrifugal compression systems for surge control purposes by using bond graphs is presented. By using the bond graph method, we get a simple description of compression systems based on physical phenomena and it is straight forward to get the dynamic equations. It is demonstrated that several active surge control methods can be represented by the same bond graph. It is also shown how methods for active surge control can be classified using energy flow in terms of upstream energy injection or downstream energy dissipation. A model of a compression system with recycle flow is derived in this work. 1.
Nur Uddin; Jan Tommy Gravdahl
Analysis of Assembly 264 - Amended: Pediatric Asthma Self-Management Training and Education Services for Children at High Risk
self-management training and education programs assessed inself-management training and education programs exhibit aAsthma self-management training and education programs have
Avoiding and Managing Interruptions of Electric Service Under an Interruptible Contract or Tariff
Many large industrial consumers of electricity purchase power through special interruptible contracts or curtailable tariffs. Historically, the number of actual interruptions has been very small -many interruptible consumers have never been required to curtail their usage, and may be assuming that interruptions will never occur. This situation is largely due to the glut of electric generating capacity that exists today in the United States -generally speaking, there is enough generation available to serve all firm customers and all interruptible customers most of the time. However, this glut will likely disappear in the next few years, meaning that interruptible consumers will be required to suffer more interruptions in the near term. Industrials subject to these interruptions should work now toward mitigating the possibility of interruptions and planning their operations so that interruptions can be avoided or sustained with minimal impact. This paper describes methods available to avoid and manage interruptions.
Evans, G. W.
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph $\\vec G$ is the minimum order of an oriented graph $\\vev H$ such that $\\vec G$ admits a homomorphism to $\\vev H$. The oriented chromatic number of an undirected graph $G$ is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph $G$, defined as the minimum order of an oriented graph $\\vev U$ such that every orientation $\\vec G$ of $G$ admits a homomorphism to $\\vec U$. We give some properties of this parameter, derive some general upper bounds on the ordinary and upper oriented chromatic numbers of Cartesian, strong, direct and lexicographic products of graphs, and consider the particular case of products of paths.
Sopena, Eric
Image segmentation by iterated region merging with localized graph cuts
This paper presents an iterated region merging-based graph cuts algorithm which is a novel extension of the standard graph cuts algorithm. Graph cuts addresses segmentation in an optimization framework and finds a globally optimal solution to a wide ... Keywords: Graph cuts, Image segmentation, Region merging
Bo Peng; Lei Zhang; David Zhang; Jian Yang
The depleted hydrogen atoms in chemical graph theory
A new algorithm which explicitly describes the depleted hydrogen atoms is proposed for chemical graph computations, and especially for molecular connectivity model studies. The new algorithm continues to be centred on the concepts of complete graphs ... Keywords: General chemical graphs, complete graphs, hydrogen perturbation, molecular connectivity computations
On the density of a graph and its blowup
It is well known that, of all graphs with edge-density p, the random graph G(n,p) contains the smallest density of copies of K"t","t, the complete bipartite graph of size 2t. Since K"t","t is a t-blowup of an edge, the following intriguing open question ... Keywords: Blowup, Graph density, Triangle density
Asaf Shapira; Raphael Yuster
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing ... Keywords: Graph algorithms, Graph perturbation theory, Maximal clique enumeration, Uncertain and noisy data
William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova
Graph Invariants and Large Cycles - a Survey
Graph invariants are the best and single tools for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures (cycle structures, factors, colorings, coverings, and so on). In this survey paper we have attempted to bring together all direct (pure) relations between basic invariants of a graph and its large cycle structures, perhaps the most important cycle structures, namely Hamilton, longest, dominating and some generalized cycles including Hamilton and dominating cycles as special cases. These very few relations actually form a source (basis) from which nearly all possible hamiltonian results can be developed further based on generalized and extended invariants, extended list of path or cycle structures and additional structural limitations.
Nikoghosyan, Zh G
Electronic tools for designing charts and graphs
This thesis explores the issues involved in designing an interactive chart and graph making system, especially tailored to the needs of the graphic designer. It defines a set of user interface requirements and describe the ...
Jones, Mary, M.S.V.S. Massachusetts Institute of Technology
The Gram dimension of a graph
be a Gram representation of Xi and let U an orthogonal matrix mapping u. (1) j to u. (2) ...... On the Shannon capacity of a graph IEEE Trans. Inform. Th. IT-25:.
Continuous Time Group Discovery in Dynamic Graphs
With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.
Miller, K; Eliassi-Rad, T
EIS-0442: Reauthorization of Permits, Maintenance, and Vegetation Management on Western Area Power Administration Transmission Lines on Forest Service Lands, Colorado, Nebraska, and Utah
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.
Heat-ray: combating identity snowball attacks using machinelearning, combinatorial optimization and attack graphs
As computers have become ever more interconnected, the complexity of security configuration has exploded. Management tools have not kept pace, and we show that this has made identity snowball attacks into a critical danger. Identity snowball attacks ... Keywords: access control, attack graph, authentication, combinatorial optimization, identity snowball, machine learning, sparsest cut, support vector machine
John Dunagan; Alice X. Zheng; Daniel R. Simon
Semiregular Factorization of Simple Graphs A. J. W. Hilton
]. A (d, d + 1)-graph is said to be semiregular. An (r, r + 1)-factorization of a graph is a decomposition of the graph into edge-disjoint (r, r + 1)-factors. We discuss here the state of knowledge about (r, r +1)-factorizations of d-regular graphs and of (d, d + 1)-graphs. For r, s 0, let (r, s) be the least integer
Wojciechowski, Jerzy
Environmental Management Waste Management Facility (EMWMF) at...
Skip to main content Energy.gov Office of Environmental Management Search form Search Office of Environmental Management Services Waste Management Site & Facility Restoration...
Using Energy Information Systems (EIS): A Guidebook for the U.S. Postal Service
energy management Load profiles Load duration curves 4.specified time period. Load Profiles � Time series graphs ofelectricity demand. Load profiles for different time periods
Foster, Dale; Hough, Ben; Barbose, Galen; Golove, William; Goldman, Charles
Improving accessibility to statistical graphs: the iGraph-Lite system
Information is often presented in graphical form. Unfortunately, current assistive technologies such as screen readers are not well-equipped to handle these representations. To provide accessibility to graphs published in ``The Daily" (Statistics Canada's ... Keywords: accessibility (blind and visually impaired), natural language interaction, statistical graphs
Leo Ferres; Petro Verkhogliad; Gitte Lindgaard; Louis Boucher; Antoine Chretien; Martin Lachance
Service and product providers | ENERGY STAR
Facility owners and managers Existing buildings Commercial new construction Industrial energy management Small business Service providers Service and product providers Verify...
Operation and Maintenance Service Contracts | ENERGY STAR
Industrial service and product providers | ENERGY STAR
Scale and differentiation in services : using information technologies to manage customer experiences at Harrah's Entertainment and other companies
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, ...
Mansharamani, Vikram, 1974-
GRAPHS AND (Z2) k-ACTIONS
Abstract. Let (?, M n) be an effective smooth action of (Z2) k on an n-dimensional smooth closed connected manifold having a finite fixed set. One can associate to this action a regular graph of valency n. If the action is nonbounding one uses this graph to obtain a lower bound for the number of fixed points. Furthermore, this result is applied to a general nonbounding (Z2) k-action fixing a finite fixed set. With the help of graphs and the Kosniowski-Stong formula, up to cobordism all (Z2) k-actions fixing three isolated points (resp. four isolated points) are classified completely, and at the same time, the Smith problem for (Z2) k-actions fixing three isolated points (resp. four isolated points) is also solved. 1.
Zhi L �
Subgraphs of quasi-random oriented graphs
One cannot guarantee the presence of an oriented four-cycle in an oriented graph $D$ simply by demanding it has many edges, as an acyclic orientation of the complete graph on $n$ vertices has $\\binom{n}{2}$ edges -- the most possible -- but contains no oriented cycle. We show that a simple quasi-randomness condition on the orientation of $D$ does allow one to guarantee the presence of an oriented four-cycle. Significantly our results work even for sparse oriented graphs. Furthermore, we give examples which show that, in a sense, our result is best possible. We also prove a result concerning oriented six-cycles and a more general result in the case $D$ is dense. Finally, we raise a number of questions and conjectures related to these results.
Amini, Omid; Huc, Florian
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that they can be effective at discovering the latent groups or communities that are defined by the link structure of a graph. However, both approaches rely on prohibitively expensive computations, given the size of modern relational data sets. Network structure indices (NSIs) are a proven technique for indexing network structure and efficiently finding short paths. We show how incorporating NSIs into these graph clustering algorithms can overcome these complexity limitations. We also present promising quantitative and qualitative evaluations of the modified algorithms on synthetic and real data sets. 1.
Matthew J. Rattigan; Marc Maier; David Jensen
Service Contracts
Guidelines for Obtaining Guidelines for Obtaining Best-Practice Contracts for Commercial Buildings Operation and Maintenance Service Contracts Prepared with funding from the U.S. EPA December 1997 PECI Acknowledgements Special thanks to the following people for their ongoing contributions and careful review of the document: Byron Courts, Director of Engineering Services, and Dave Rabon, Chief Engineer, Melvin Mark Pete Degan, Director of Customer Marketing, Landis/Staefa David Fanning, HVAC Coordinator, EXPRESS Bil Pletz, Facility Manager, Intel Mike Sanislow, Service Channel Development Leader, Honeywell Home and Building Karl Stum, Director of Technical Services, PECI Tom Walton, President, United Service Alliance For additional copies of this guidebook, contact: Portland Energy Conservation Inc. (PECI)
Sequoia tops Graph 500 list of 'big data' supercomputers
ATL062113_graph ATL062113_graph 06/21/2013 The Livermore Lab's Sequoia supercomputer topped the biannual Graph 500 list of the world's fastest systems for "big data" this week. The Graph 500 benchmark measures the speed with which a supercomputer can "connect the dots" within a massive set of data. Sequoia traversed 15,363 connections per second. Sequoia tops Graph 500 list of 'big data' supercomputers Donald B Johnston, LLNL, (925) 423-4902, firstname.lastname@example.com LLNL's 20 petaflops Sequoia supercomputer has retained its No. 1 ranking on the Graph 500 list, a measure of a system's ability to conduct analytic calculations -- finding the proverbial needle in the haystack. An IBM Blue Gene Q system, Sequoia was able to traverse 15,363 giga edges per second on a scale of 40 graph (a graph with 2^40 vertices). The new
An empirical comparison of some approximate methods for graph coloring
The Graph Coloring Problem (GCP) is a classical NP-complete problem for which several approximate solution algorithms have been proposed: Brelaz algorithm, simulated annealing (SA), ant colony optimization (ACO). This paper reports empirical results ... Keywords: graph coloring, gravitational swarm
Israel Rebollo-Ruiz; Manuel Gra�a
Using constraints to achieve stability in automatic graph layout algorithms
Automatic layout algorithms are commonly used when displaying graphs on the screen because they provide a �nice� drawing of the graph without user intervention. There are, however, a couple of disadvantages to automatic layout. Without user ...
Karl-Friedrich B�hringer; Frances Newbery Paulisch
Efficient algorithms for graph all-matching and containment search.
??Recent advances in database research have shown the potential of graph in modelling complicated data. Graph data have pervaded many modern applications including bio-informatics, chem-informatics,� (more)
Zhu, Gaoping
Long alternating cycles in edge-colored complete graphs
Let Knc denote a complete graph on n vertices whose edges are colored in an arbitrary way. And let ?(Knc) denote the maximum number of edges of the same ... Keywords: alternating cycle, color degree, edge-colored graph
Hao Li; Guanghui Wang; Shan Zhou
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of ...
Xiao, Lin
Computing maximum non-crossing matching in convex bipartite graphs
We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O (n logn ...
Danny Z. Chen; Xiaomin Liu; Haitao Wang
The cost of monotonicity in distributed graph searching
are placed at a particular vertex of the graph, called the homebase. Moreover, this sequence of moves must is aiming at clearing the whole network. Given a graph G and a homebase v0 V (G), the search problem
Ilcinkas, David
of the graph, called the homebase. Moreover, this sequence of moves must satisfy that recontamination never network. Given a graph G and a homebase v0 V (G), the search problem consists in designing a distributed
Paris-Sud XI, Université de
A hybrid parallel genetic algorithm approach for graph coloring
Graph-Coloring problem (GCP) deals with assigning labels (colors) to the vertices of a graph such that adjacent vertices do not get the same color. Coloring a graph with minimum number of colors is a well-known NP-hard problem. In this paper a new permutation ... Keywords: Graph coloring problem, message passing interface (MPI), migration model, parallel genetic algorithm, static wavelength assignment
S. N. Sivanandam; S. Sumathi; T. Hamsapriya
We introduce an operator � mapping any graph parameter �( ), nested between the stability number ...... Local chromatic number and Sperner capacity. ?ournal.
DOE Jobs Online (Hiring Manager), Office of Human Capitol Management...
of Human Capitol Management Innovation and Solutions More Documents & Publications MOX Services Unclassified Information System PIA, National Nuclear Services Administration...
Before the Senate Homeland Security and Governmental Affairs Subcommittee on Federal Financial Management, Government Information, Federal Services and International Security
Subject: Cutting the Federal Government's Energy Bill: An Examination of the Sustainable Federal Government Executive Order 13524 By: Richard Kidd, Program Manager Federal Energy Management Program, Office of Energy Efficiency and Renewable Energy
Hamiltonian Graphs and the Traveling Salesman Problem
A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. A new exact polynomial time algorithm for the traveling salesman problem (TSP) based on this new characterization is developed. We then define so called ordered weighted adjacency list for given weighted complete graph and proceed to the main result of the paper, namely, the exact algorithm based on utilization of ordered weighted adjacency list and the simple properties that any path or circuit must satisfy. This algorithm performs checking of sub-lists, containing (p-1) entries (edge pairs) for paths and p entries (edge pairs) for circuits, chosen from ordered adjacency list in a well defined sequence to determine exactly the shortest Hamiltonian path and shortest Hamiltonian circuit in a weighted complete graph of p vertices. The procedure has intrinsic advantage of landing on the desired solution in quickest possible time and even in worst case in polynomial time. A new characterization of shortest Hamiltonian tour for a weighted complete graph satisfying triangle inequality (i.e. for tours passing through every city on a realistic map of cities where cities can be taken as points on a Euclidean plane) is also proposed. Finally, we discuss a novel classical algorithm for unstructured search and its effect on any of the NP-Complete problems.
Dhananjay P. Mehendale
Multilevel heuristic algorithm for graph partitioning
Many real applications involve optimisation problems where more than one objective has to be optimised at the same time. One of these kinds of problems is graph partitioning, that appears in applications such as VLSI design, data-mining, efficient disc ...
Raul Ba�os; Consolaci�n Gil; Julio Ortega; Francisco G. Montoya
Suggesting friends using the implicit social graph
Although users of online communication tools rarely categorize their contacts into groups such as "family", "co-workers", or "jogging buddies", they nonetheless implicitly cluster contacts, by virtue of their interactions with them, forming implicit ... Keywords: contact group clustering, implicit social graph, tie strength
Maayan Roth; Assaf Ben-David; David Deutscher; Guy Flysher; Ilan Horn; Ari Leichtberg; Naty Leiser; Yossi Matias; Ron Merom
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan-Newman method based on edge betweenness centrality. We show that ...
Grid smoothing: a graph-based approach
In the past few years, mesh representation of images has attracted a lot of research interest due to its wide area of applications in image processing. In the mesh framework, an image is represented by a graph in which the nodes represent the pixels ... Keywords: content adaptative mesh, grid smoothing, image coding, non-linear optimisation
Guillaume Noel; Karim Djouani; Yskandar Hamam
Computing role assignments of chordal graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1,...,k} called a role to each vertex of G such that any two vertices with the same role have ...
Pim Van't Hof; Dani�l Paulusma; Johan M. M. Van Rooij
Exploiting graph properties of game trees
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have concentrated on the traversal of trees, giving the field the name "game-tree ... Keywords: game playing, search
Aske Plaat; Jonathan Schaeffer; Wim Pijls; Arie de Bruin
Quantum secret sharing with qudit graph states
We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.
Keet, Adrian; Fortescue, Ben; Sanders, Barry C. [Institute for Quantum Information Science, University of Calgary, Alberta, T2N 1N4 (Canada); Markham, Damian [LTCI-CNRS, Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)
Adrian Keet; Ben Fortescue; Damian Markham; Barry C. Sanders
Diagnosability of star graphs with missing edges
In this paper, we study the system diagnosis on an n-dimensional star under the comparison model. Following the concept of local diagnosability [3], the strong local diagnosability property [7] is discussed; this property describes the equivalence of ... Keywords: Comparison diagnosis model, Extended star structure, Local diagnosability, MM* diagnosis model, Star graph, Strong local diagnosability property
Chieh-Feng Chiang; Guo-Huang Hsu; Lun-Min Shih; Jimmy J. M. Tan
Graph grammars with string-regulated rewriting
Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to ... Keywords: Development, Expressive power, Genetic regulation, Graph grammars, Regulated rewriting
Daniel Lobo; Francisco J. Vico; J�rgen Dassow
Kinetic and stationary point-set embeddability for plane graphs
We investigate a kinetic version of point-set embeddability. Given a plane graph G(V,E) where |V|=n, and a set P of n moving points where the trajectory of each point is an algebraic function of constant ... Keywords: kinetic algorithm, kinetic graph drawing, plane graph, point-set embeddability
Zahed Rahmati; Sue H. Whitesides; Valerie King
A graph based method for faster display for distribution networks
This paper presents our logical display approach for Distribution Networks based on the concept of Microsoft graphs. We demonstrate that by using Microsoft graphs we do not have to redraw the circuits after each switching operation or after a change ... Keywords: algorithms, distribution, graphs, logical display, network systems
Mansoor Al-A'ali
Hiroshi Ishikawa A Practical Introduction to Graph Cut
Technology Contents Overview / Brief history Energy minimization Graphs and their minimum cuts Energy Elevation map #12;History Probablistic methods (SA, ICM,...) have been used for energy minimization OR has Overview / Brief history Energy minimization Graphs and their minimum cuts Energy minimization via graph
Ishikawa, Hiroshi
Modeling molecular polarizabilities with graph-theoretical concepts
A model study of the molecular polarizabilities of a wide heterogeneous class of organic compounds was carried out. The model of this property was based on graph-theoretical molecular connectivity and pseudoconnectivity basis indices, including the corresponding ... Keywords: complete graphs, core electrons, graph-theoretical connectivity indices, molecular polarizabilities
Discovering informative connection subgraphs in multi-relational graphs
Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper ... Keywords: multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery
Cartic Ramakrishnan; William H. Milnor; Matthew Perry; Amit P. Sheth
Traffic scheduling mechanism based on graph theory for Power Saving mode of IEEE 802.11 distributed coordinator function
In IEEE 802.11 Power Saving (PS) mode specified for Independent Basic Service Set (IBSS), mobile stations announce their pending data packets within Announcement Traffic Indication Message (ATIM) window immediately after the reception ... Keywords: IEEE 80211, MAC protocol, ad hoc networks, distributed coordinator, energy efficiency, graph theory, medium access control, power saving, power-efficient, time synchronisation function, traffic scheduling
M. H. Ye; C. T. Lau; A. B. Premkumar
Categorical Exclusion Determinations: Environmental Management...
Consolidated Business Service Center Categorical Exclusion Determinations: Environmental Management Consolidated Business Service Center Categorical Exclusion Determinations issued...
Image segmentation using quadtree-based similarity graph and normalized cut
The graph cuts in image segmentation have been widely used in recent years because it regards the problem of image partitioning as a graph partitioning issue, a well-known problem in graph theory. The normalized cut approach uses spectral graph properties ... Keywords: graph partitioning, image segmentation, quadtree, spectral graph
Marco Antonio Garcia De Carvalho; Anselmo Castelo Branco Ferreira; Andr� Luis Costa
Engage upper management | ENERGY STAR
Industrial energy management | ENERGY STAR
Maker Can Construct a Sparse Graph on a Small Board
We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H. Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such that Maker can occupy a copy of G in the game on H.
Gebauer, Heidi
StreamWorks - A system for Dynamic Graph Search
Acting on time-critical events by processing ever growing social media, news or cyber data streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Mining and searching for subgraph patterns in a continuous setting requires an efficient approach to incremental graph search. The goal of our work is to enable real-time search capabilities for graph databases. This demonstration will present a dynamic graph query system that leverages the structural and semantic characteristics of the underlying multi-relational graph.
Choudhury, Sutanay; Holder, Larry; Chin, George; Ray, Abhik; Beus, Sherman J.; Feo, John T.
Implementing Graph Pattern Queries on a Relational Database
When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.
Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R
self-management training and education programs assessed inmanagement training and education programs exhibit a patternmanagement training and education programs have favorable
Visibility graph analysis of solar wind velocity
We analyze in situ measurements of solar wind velocity obtained by Advanced Composition Explorer (ACE) spacecraft and Helios spacecraft during the years 1998-2012 and 1975-1983 respectively. The data belong to mainly solar cycle 23 (1996-2008) and solar cycle 21 (1976-1986) respectively. We use Directed Horizontal Visibility graph (DHVg) algorithm and estimate a graph functional, namely, the degree distance (D) as the Kullback-Leibler divergence (KLD) argument to understand time irreversibility of solar wind time series. We estimate this degree distance irreversibility parameter for these time series at different phases of solar activity cycle. Irreversibility parameter is first established for known dynamical data and then applied for solar wind velocity time series. It is observed that irreversibility in solar wind velocity fluctuations show similar behaviour at 0.3 AU (Helios data) and 1 AU (ACE data). Moreover it changes over the different phases of solar activity cycle.
Suyal, Vinita; Singh, Harinder P
A Concatenational Graph Evolution Aging Model
Modeling the long-term face aging process is of great importance for face recognition and animation, but there is a lack of sufficient long-term face aging sequences for model learning. To address this problem, we propose a CONcatenational GRaph Evolution ... Keywords: Aging,Face,Active appearance model,Correlation,Computational modeling,Data models,Muscles,ANOVA,Face aging,aging model evaluation,long-term aging,short-term aging
Jinli Suo; Xilin Chen; Shiguang Shan; Wen Gao; Qionghai Dai
Graph operations that are good for greedoids
S is a local maximum stable set of a graph G, and we write S@?@J(G), if the set S is a maximum stable set of the subgraph induced by S@?N(S), where N(S) is the neighborhood of S. In Levit and Mandrescu (2002) [5] we have proved that @J(G) is a greedoid ... Keywords: Corona, Greedoid, Local maximum stable set, Zykov sum
Vadim E. Levit; Eugen Mandrescu
On a base exchange game on graphs
We consider the following maker-breaker game on a graph G that has a partition of the edge set E into two spanning trees E1 and E2. Initially the edges of E1 are purple and the edges of E2 blue. Maker and breaker move alternately. In a move of the maker a blue edge is coloured purple. The breaker then has to recolour a different edge blue in such a way that the purple and the blue edges are spanning trees again. The goal of the maker is to exchange all colours, i.e. to make E1 blue and E2 purple. We prove that a sufficient but not necessary condition for the breaker to win is that the graph contains an induced K4. Furthermore we characterize the structure of a partition of a wheel into two spanning trees and show that the maker wins on wheels Wn with n ? 4 and provide an example of a graph where, for some partitions, the maker wins, for some others, the breaker wins.
Stephan Dominique Andres; Winfried Hochst�ttler; Markus Merkel
NSLS Services
Services NSLS Services Computing Services Lab Space Libraries Postal Services Procurement Repair & Equipment Services Shipping Procedures Storage User Accounts Workshop Procedures...
Modeling and Analysis of Time-Varying Graphs
We live in a world increasingly dominated by networks -- communications, social, information, biological etc. A central attribute of many of these networks is that they are dynamic, that is, they exhibit structural changes over time. While the practice of dynamic networks has proliferated, we lag behind in the fundamental, mathematical understanding of network dynamism. Existing research on time-varying graphs ranges from preliminary algorithmic studies (e.g., Ferreira's work on evolving graphs) to analysis of specific properties such as flooding time in dynamic random graphs. A popular model for studying dynamic graphs is a sequence of graphs arranged by increasing snapshots of time. In this paper, we study the fundamental property of reachability in a time-varying graph over time and characterize the latency with respect to two metrics, namely store-or-advance latency and cut-through latency. Instead of expected value analysis, we concentrate on characterizing the exact probability distribution of routing l...
Basu, Prithwish; Ramanathan, Ram; Johnson, Matthew P
Strict inequalities for connective constants of transitive graphs
The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the group, and increases strictly when a non-trivial group element is declared to be a generator.
Geoffrey R. Grimmett; Zhongyang Li
SERVICES Purpose
This Management Memo calls on all state agencies operating state motor vehicles to make every effort to �Flex Your Power at the Pump, � and lower fuel costs for the State of California through vigorous compliance with the preventative maintenance standards identified in this management memo and in the Automobile Record, Standard (STD.) 271. Background Public Resources Code 25722 mandates the state reduce petroleum consumption of its vehicle fleet to the maximum extent practicable including improved preventative maintenance. State Administrative Manual Section (SAM) 4101 establishes the need to comply with minimum preventative maintenance standards listed in the Automobile Maintenance Record, STD. 271. This includes prescribed services and mechanical inspections that promote state vehicle efficiency and achieve optimum fuel mileage. SAM Section 3687.1 prohibits the purchase of premium grade gasoline for state vehicles. And, directs state drivers to make fuel purchases at lower priced self-service pumps whenever possible.
Manual Sections
Service and product provider's marketing toolkit | ENERGY STAR
SPP marketing flyer for energy information services | ENERGY...
ENERGY STAR sales tools for service and product providers | ENERGY...
Service and Product Provider Press Release Template | ENERGY...
DOE Awards Task Order Modification for Support Services to Office...
Modification for Support Services to Office of Environmental Management DOE Awards Task Order Modification for Support Services to Office of Environmental Management March 11, 2013...
DOE Awards Small Business Contract for Support, Planning Services...
Support, Planning Services to Office of Environmental Management DOE Awards Small Business Contract for Support, Planning Services to Office of Environmental Management February 1,...
A Graph Theory Package for Maple - CECM - Simon Fraser University
{jfarr,mahdad,skhodada,firstname.lastname@example.com. Abstract. We present a new graph theory package for Maple. The package is presently intended for teaching �...
New Benchmark Instances for the Steiner Problem in Graphs
Sep 26, 2001 ... New Benchmark Instances for the Steiner Problem in Graphs. Isabel Rosseti ( rosseti ***at*** inf.puc-rio.br) Marcus Poggi de Arag�o (poggi�...
Finding good nearly balanced cuts in power law graphs
The green dots in figure 8-A represent cuts that were obtained using Spectral plus Swept Hyperplane .... Fast approximate energy minimization via graph cuts.
GreenArrow� - A New Graph Labeling Technique - Available ...
Search PNNL. PNNL Home; About; Research; Publications; Jobs; News; Contacts; GreenArrow� - A New Graph Labeling Technique. Battelle Number(s): ...
Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
Nov 22, 2011 ... Abstract: We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is�...
Coloring kk-free intersection graphs of geometric objects in the plane
The intersection graph of a collection C of sets is a graph on the vertex set C, in which C1,C2 ? C are joined by an edge if and only if C1 ? C2 ... Keywords: chromatic number, intersection graph, quasi-planar, string graph, topological graph
Jacob Fox; J�nos Pach
An extended star graph: a proposal of a new network topology and its fundamental properties
In the past years, various network architectures for parallel computers have been proposed, for example, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families ... Keywords: Cayley graphs, degree four Cayley graphs, diameter, hypercubes, interconnection networks, network topology, routing algorithms, star graphs
Satoru Watanabe; Satoshi Okawa
Graduated assignment algorithm for finding the common labelling of a set of graphs
In pattern recognition applications, it is useful to represent objects by attributed graphs considering their structural properties. Besides, some graph matching problems need a Common Labelling between vertices of a set of graphs. Computing this Common ... Keywords: graduated assignment, graph common labelling, inconsistent labelling, multiple graph matching, softassign
Albert Sol�-Ribalta; Francesc Serratosa
Management Training for Pathology Residents: A Regional Approach
RFI, RFP) Maintenance Supply management Contract services (Record maintenance, risk management * RFI indicates request
Wagar, E A
Management Solution
MEMO: Request for proposal for Computer-Aided Facilities and Maintenance Management application software; professional services; development services for interfaces to Financial Management and Human Resources systems; configuration, test, train, maintenance and support services to implement and maintain a CAFM Solution for the California Administrative Office of the Courts, the Trial Courts, the Appellate Courts and the Judicial Council, known as �The AOC Group.� You are invited to review and respond to the attached Request for Proposal (�RFP�):
Rfp Number Isdcafm
Noisy evolution of graph-state entanglement
A general method for the study of the entanglement evolution of graph states under the action of Pauli maps was recently proposed in Cavalcanti et al. [Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds to the entanglement of the entire state as a function only of the state of a (typically) considerably smaller subsystem undergoing an effective noise process related to the original map. This provides a huge decrease in the size of the matrices involved in the calculation of entanglement in these systems. In the present paper we elaborate on this method in detail and generalize it to other natural situations not described by Pauli maps. Specifically, for Pauli maps we introduce an explicit formula for the characterization of the resulting effective noise. Beyond Pauli maps, we show that the same ideas can be applied to the case of thermal reservoirs at arbitrary temperature. In the latter case, we discuss how to optimize the bounds as a function of the noise strength. We illustrate our ideas with explicit exemplary results for several different graphs and particular decoherence processes. The limitations of the method are also discussed.
Aolita, L.; Dhara, C. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); Cavalcanti, D. [Centre for Quantum Technologies, University of Singapore (Singapore); Chaves, R.; Davidovich, L. [Instituto de Fisica, Universidade Federal do Rio de Janeiro, Caixa Postal 68528, 21941-972 Rio de Janeiro, RJ (Brazil); Acin, A. [ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, E-08860 Castelldefels, Barcelona (Spain); ICREA-Institucio Catalana de Recerca i Estudis Avancats, Lluis Companys 23, E-08010 Barcelona (Spain)
Enhancing graph production skills via programmed instruction: An experimental analysis of the effect of guided-practice on data-based graph production
A computer-based graphing simulator used tutorial modules to teach 61 undergraduate college students how to create cumulative graphs from sets of data. One group was required to complete the steps of constructing an appropriate graph within a computer-provided ... Keywords: Computer-based instruction, Graphing, Programmed instruction, Simulation
Darrel R. Davis
Product Service Codes Description: Product Service Codes used at Headquarters Proc Services
Codes Codes Description: Product Service Codes used at Headquarters Proc Services Filters: Date Signed only show values between '10/01/2006' and '09/30/2007', Contracting Agency ID show only ('8900'), Contracting Office ID show only ('00001') Contracting Agency ID: 8900, Contracting Office ID: 00001 Product or Service Code Product or Service Description Actions Action Obligation D399 OTHER ADP & TELECOMMUNICATIONS SVCS 285 $131,825,633 R799 OTHER MANAGEMENT SUPPORT SERVICES 239 $128,006,080 R408 PROGRAM MANAGEMENT/SUPPOR T SERVICES 278 $59,852,844 S206 GUARD SERVICES 11 $26,628,827 B546 STUDY/SECURITY (PHYSICAL & PERSONAL 11 $22,187,799 AD26 SERVICES (MANAGEMENT/SUPPO RT) 56 $21,689,198 R499 OTHER PROFESSIONAL SERVICES 153 $17,482,267 D301 ADP FACILITY MANAGEMENT 28 $16,265,159 R425 ENGINEERING AND
Maintenance and Veg Management
Functions Infrastructure projects Interconnection OASIS OATT Reauthorization of Transmission Line Permits, Maintenance and Vegetation Management on Forest Service Lands...
EntityAuthority: Semantically Enriched Graph-Based Authority Propagation
embedded in the text of Web pages, and to transform the page-level graph into a generalized data graph- ply be Page, InfoUnit, or richer concept names such as Person, Organization, etc., that can. Thus each node in the EWG corresponds to ei- ther a Web page or an information unit (InfoUnit for short
Pennsylvania, University of
On bounding the bandwidth of graphs with symmetry
transmission can be formulated as the bandwidth problem for the ... [6], the hypercube graph [23], the grid graph [7], the complete k-level t-ary tree [39], the .... The 'diag' operator maps an n � n matrix to the n-vector given by its diagonal, while.
Embedding of hypercubes into necklace, windmill and snake graphs
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs. Keywords: Congestion, Edge isoperimetric problem, Embedding, Hypercubes, Interconnection networks, Wirelength
Indra Rajasingh; Bharati Rajan; R. Sundara Rajan
On the connectivity of extremal Ramsey graphs Andrew Beveridge
and Computer Science Macalester College Saint Paul, MN 55105 Oleg Pikhurko # Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 Received: 1 December 2006, Accepted: 31 October 2007 Abstract An (r, b)graph is a graph that contains no clique of size r and no independent set
Pikhurko, Oleg
Commute-time convolution kernels for graph clustering
Commute time has proved to be a powerful attribute for clustering and characterising graph structure, and which is easily computed from the Laplacian spectrum. Moreover, commute time is robust to deletions of random edges and noisy edge weights. In this ... Keywords: commute times, convolution kernel, graph kernel, laplacian
Normawati A. Rahman; Edwin R. Hancock
Analyzing uncertainty in TG protection graphs with TG/MC
We introduce TG/MC, a Monte Carlo approach for evaluating the impact of uncertainty about vulnerabilities upon forecasts of security for a real-world system modeled by a protection graph. A TG/MC model defines a vulnerability as a potential change to ... Keywords: Monte Carlo, TG, Take-Grant, protection graph, security
James R. Conrad; Jim Alves-Foss; Sauchi Stephen Lee
Cell-graph modeling of salivary gland morphology
Branching morphogenesis is a developmental process shared by many organs, including the submandibular salivary gland. During morphogenesis, cells within the gland undergo rearrangements to cause changes in the overall tissue morphology. This work presents ... Keywords: branching morphogenesis, cell-graphs, graph-mining, salivary gland
Cemal Cagatay Bilgin; Shayoni Ray; William P. Daley; Banu Baydil; Sharon J. Sequeira; B�lent Yener; Melinda Larsen
Exclusivity structures and graph representatives of local complementation orbits
We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\\'asz number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.
Adan Cabello; Matthew G. Parker; Giannicola Scarpa; Simone Severini
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its utility for information navigation, trend analysis, and high-level description ... Keywords: citation graphs, correlation of text and links, graph mining, probabilistic measure, topic detection
Yookyung Jo; Carl Lagoze; C. Lee Giles
Quantum graphs where back-scattering is prohibited
We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.
J. M. Harrison; U. Smilansky; B. Winn
Quantum graphs: an introduction and a brief survey
The purpose of this text is to set up a few basic notions concerning quantum graphs, to indicate some areas addressed in the quantum graph research, and to provide some pointers to the literature. The pointers in many cases are secondary, i.e. they refer to other surveys.
Peter Kuchment
Joint Environmental Management System (EMS) Declaration of Conformance...
Services Environmental Management System Joint Environmental Management System (EMS) Declaration of Conformance Joint Environmental Management System (EMS) Declaration of...
On Characterizing Game-Perfect Graphs by Forbidden Induced Subgraphs
A graph G is called g-perfect if, for any induced subgraph H of G, the game chromatic number of H equals the clique number of H. A graph G is called g-col-perfect if, for any induced subgraph H of G, the game coloring number of H equals the clique number of H. In this paper we characterize the classes of g-perfect resp. g-col-perfect graphs by a set of forbidden induced subgraphs and explicitly. Moreover, we study similar notions for variants of the game chromatic number, namely B-perfect and [A, B]-perfect graphs, and for several variants of the game coloring number, and characterize the classes of these graphs.
Stephan Dominique Andres
Horizontal Visibility graphs generated by type-II intermittency
In this contribution we study the onset of chaos via type-II intermittency within the framework of Horizontal Visibility graph theory. We construct graphs associated to time series generated by an iterated map close to a Neimark-Sacker bifurcation and study, both numerically and analytically, their main topological properties. We find well defined equivalences between the main statistical properties of intermittent series (scaling of laminar trends and Lyapunov exponent) and those of the resulting graphs, and accordingly construct a graph theoretical description of type-II intermittency. We finally recast this theory into a graph-theoretical renormalization group framework, and show that the fixed point structure of RG flow diagram separates regular, critical and chaotic dynamics.
�ngel M. N��ez; Jos� Patricio G�mez; Lucas Lacasa
Services | Department of Energy
Services Services Services Waste Management EM is dedicated to safely disposing of waste and seeks cost effective and environmentally responsible project execution methods. Read more Site & Facility Restoration EM provides integration, planning and analysis for all soil and groundwater remediation, deactivation and decommissioning (D&D) and facility engineering. This work includes sustainability projects to ensure that these activities are completed efficiently and effectively, reducing significant risks and life-cycle schedules and costs in the D&D program. Read more Program Management EM provides program management support with the goal of continuously improving performance. Read more Communication & Engagement EM provides clear, timely, and consistent communication on the mission and
Annual Planning Summaries: Environmental Management-Consolidated...
Environmental Management-Consolidated Business Service Center (EM-CBC) Annual Planning Summaries: Environmental Management-Consolidated Business Service Center (EM-CBC) Document(s)...
Archives and History Office: Services
Services Services See our What Can I Do to Help Preserve SLAC's History? brochure (print and fold into thirds) What should you keep? We provide guidance and assistance in managing...
Development Methods for Web Services
Services, such as location services for GSM, fleet-management (e.g. taxi-companies), maps, hotel reservations, holiday planning, ticket booking etc. The chosen implementa- tion will include optional utility
NSLS Services | Postal Services
Postal Services Postal Services U.S. Postal Service BNL has a full-service U.S. Postal Service Office (Upton branch) located in Staff Services, Building 179, x2539. BNL Mail Service Mail is delivered and picked up twice a day from each building on site. Users should leave internal lab mail (brown envelopes, no stamps needed) and U.S. Mail (regular envelopes, stamps required) in the outgoing mail boxes at NSLS mail stop 725A, located in the lobby by the elevator. Receiving Mail During regular working hours, packages and other special deliveries are brought to the Stockroom while regular mail is taken to the mailstops around the building. Each beam port is assigned a mail slot at NSLS mail stop 725A near the elevator in the lobby. The beamline number should be on all mail addressed to users. Mail to users should be addressed as follows
Quantum query complexity of some graph problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Theta(n^{3/2}) in the matrix model and in Theta(sqrt{nm}) in the array model, while the complexity of Connectivity is also in Theta(n^{3/2}) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.
Christoph Durr; Mark Heiligman; Peter Hoyer; Mehdi Mhalla
Efficient broadcast on random geometric graphs
A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the critical value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).
Bradonjic, Milan [Los Alamos National Laboratory; Elsasser, Robert [UNIV OF PADERBORN; Friedrich, Tobias [INTERNATIONAL COMPUTER SCI.; Sauerwald, Thomas [INTERNATIONAL COMPUTER SCI.
The AmeriFlux Data Activity and Data System: An Evolving Collection of Data Management Techniques, Tools, Products and Services
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.
Boden, Thomas A [ORNL; Krassovski, Misha B [ORNL; Yang, Bai [ORNL
Internal Audit Services
Internal Audit Services Internal Audit Services Berkeley Lab Internal Audit Services Internal Audit Services Berkeley Lab Contacts Organizational Chart IAS Search Staff Only Lab Search Phone Book A-Z Index Privacy and Security Notice "Internal Auditing is an independent, objective assurance and consulting activity designed to add value and improve an organization's operations. It helps an organization accomplish its objectives by bringing a systematic, disciplined approach to evaluate and improve the effectiveness of risk management, control and governance processes." The Institute of Internal Auditors Standards for the Professional Practice of Internal Auditing About IAS | Audit Committee | Audit Planning | Ethics & Investigations | External Audit Coordination Advisory Services | Other Relevant Audit Links | Contacts | Organizational
Exhibitor Services Kit
Nov 9, 2009 ... company's look and image, attracts business and shows off your most important assets. ...... On-site supervisors with dedicated floor managers ...... Wireless Service (Enterprise) includes one (1) 256Kbps shared Ethernet�...
Corporate Human Resources Information Services (CHIRS) PIA, Office...
Services Administration iManage Strategic Integrated Procurement Enterprise System (STRIPES) PIA, Office of Procurement and Assistance Management Integrated Safety Management...
Quick Guide: Utility Energy Services Contracting (Fact Sheet)
Summarized guide to conducting Federal energy management projects through utility energy services contracts.
DOE Grids Service Transition
DOE Grids Service Transition DOE Grids Service Transition Services Overview ECS Audio/Video Conferencing Fasterdata IPv6 Network Network Performance Tools (perfSONAR) ESnet OID Registry PGP Key Service Virtual Circuits (OSCARS) DOE Grids Service Transition Contact Us Technical Assistance: 1 800-33-ESnet (Inside the US) 1 800-333-7638 (Inside the US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: email@example.com Provide Web Site Feedback: email@example.com DOE Grids Service Transition Background ESnet has decided to transition support and management for the certificate services provided by the DOE Grids public key infrastructure (PKI) to the Open Sciences Grid (OSG). OSG and ESnet provide service to many of the same user communities, and have long been collaborators in the areas of identity
Facilities Services and Environmental Health and Safety
Facilities Services and Environmental Health and Safety Laboratory Ventilation Management Program Guidance Document Facilities Services and Environmental Health and Safety This group is comprised of support staff from Facilities Services and Environmental Health and Safety who make observations
Pawlowski, Wojtek
Research has indicated that, depending upon driver and passenger characteristics, passengers can have either a positive or negative influence upon driver behaviour. In conclusion to a recent study investigating the roles that passengers can play to influence, positively and negatively, driver behaviour, Regan and Mitsopoulos (2001) recommended, among other things, that the principles of Crew Resource Management (CRM) training may increase passengers � ability to positively influence driver behaviour and also drivers � ability to accept constructive feedback. The present study investigated the potential application of CRM training within young driver training in the Australian Capital Territory (ACT). This involved a literature review, an analysis of the differences between the driving and aviation domains, an analysis of the team-based activities and the knowledge, skills and attitudes required during driving to perform those activities, consultation with CRM experts from the aviation and medicine domains and the conduct of six focus groups involving young learner drivers, provisional licence drivers and course teachers. The findings indicate that CRM training as part of young driver training in the ACT is a viable concept to pursue. The application of CRM training within young driver training has potential to significantly enhance the positive and reduce the negative effects of passengers on young driver behaviour, and thus the safety of young drivers and passengers alike. The outcomes of this study formed the basis for a set of recommendations for the development of a young driver CRM training program in the ACT.
Young Drivers; Eve Mitsopoulos; Michael Regan; Janet Anderson; Paul Salmon; Jessica Edquist; Ii Report Documentation Page
A sequential growth dynamics for a directed acyclic dyadic graph
A model of discrete spacetime on a microscopic level is considered. It is a directed acyclic dyadic graph. This is the particular case of a causal set. The goal of this model is to describe particles as some repetitive symmetrical self-organized structures of the graph without any reference to continuous spacetime. The dynamics of the model is considered. This dynamics is stochastic sequential additions of new vertexes. Growth of the graph is a Markovian process. This dynamics is a consequence of a causality principle.
Alexey L. Krugly
Nested cycles in large triangulations and crossing-critical graphs
We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this result to show that for each fixed positive integer $k$, there are only finitely many $k$-crossing-critical simple graphs of average degree at least six. Combined with the recent constructions of crossing-critical graphs given by Bokal, this settles the question of for which numbers $q>0$ there is an infinite family of $k$-crossing-critical simple graphs of average degree $q$.
Hernandez-Velez, Cesar; Thomas, Robin
The Graph Laplacian and the Dynamics of Complex Networks
In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.
Thulasidasan, Sunil [Los Alamos National Laboratory
A new framework for elimination-based data flow analysis using DJ graphs
Keywords: DJ graphs, Tarjan's interval, exhaustive and incremental data flow analysis, irreducible flowgraphs, reducible flowgraphs
Vugranam C. Sreedhar; Guang R. Gao; Yong-Fong Lee
A graph-theoretic model of lexical syntactic acquisition
This paper presents a graph-theoretic model of the acquisition of lexical syntactic representations. The representations the model learns are non-categorical or graded. We propose a new evaluation methodology of syntactic acquisition in the framework ...
Hinrich Sch�tze; Michael Walsh
Geometry of loop quantum gravity on a graph
We discuss the meaning of geometrical constructions associated to loop quantum gravity states on a graph. In particular, we discuss the 'twisted geometries' and derive a simple relation between these and Regge geometries.
Rovelli, Carlo; Speziale, Simone [Centre de Physique Theorique, CNRS-Luminy Case 907, 13288 Marseille Cedex 09 (France)
Investigation of bond graphs for nuclear reactor simulations
This work proposes a simple and effective approach to modeling multiphysics nuclear reactor problems using bond graphs. The conventional method of modeling the coupled multiphysics transients in nuclear reactors is operator ...
Sosnovsky, Eugeny
Chip-Firing and Rotor-Routing on Directed Graphs
We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing open problems.
Holroyd, Alexander E; Meszaros, Karola; Peres, Yuval; Propp, James; Wilson, David B
Graph-Theoretic Techniques for Web Content Mining
Describing exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms, this book demonstrates and investigates these novel techniques through the domain of web content mining.
Adam Schenker; Horst Bunke; Mark Last; Abraham Kandel
Parallel Algorithms for Graph Optimization using Tree Decompositions
Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.
Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL; Groer, Christopher S [ORNL
Effective Graph Clustering for Path Queries in Digital Map Databases
In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evaluation indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs. 1 Introduction 1....
Yun-Wu Huang; Ning Jing; Elke A. Rundensteiner
Interactive searching and visualization of patterns in attributed graphs
Searching for patterns in graphs and visualizing the search results is an active area of research with numerous applications. With the continual growth of database size, querying these databases often results in multiple solutions. Text-based systems ...
Pierre-Yves Koenig; Faraz Zaidi; Daniel Archambault
Modelling structured domains using description graphs and logic programming
Although OWL 2 is widely used to describe complex objects such as chemical molecules, it cannot represent �structural' features of chemical entities (e.g., having a ring). A combination of rules and description graphs (DGs) has been proposed ...
Despoina Magka; Boris Motik; Ian Horrocks
Temporally Scalable Visual SLAM using a Reduced Pose Graph
In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...
Johannsson, Hordur
Work Manager
A real-time control system has been developed and deployed nationally to support BT�s work management programme. This paper traces the history, system architecture, development, deployment and service aspects of this very large programme. Many ...
G. J. Garwood
Home Office Expenses Submitted by Fluor Federal Services, Inc., on Savannah River Nuclear Solutions, LLC's U.S. Department of Energy Management & Operating (M&O) Contract No. DE-AC09-08SR22470
Home Office Expenses Submitted by Fluor Home Office Expenses Submitted by Fluor Federal Services, Inc., on Savannah River Nuclear Solutions, LLC's U.S. Department of Energy Management & Operating (M&O) Contract No. DE-AC09-08SR22470 OAS-L-13-08 April 2013 Department of Energy Washington, DC 20585 April 19, 2013 MEMORANDUM FOR THE MANAGER, SAVANNAH RIVER OPERATIONS OFFICE FROM: Rickey R. Hass Deputy Inspector General for Audits and Inspections Office of Inspector General SUBJECT: INFORMATION: Audit Report on "Home Office Expenses Submitted by Fluor Federal Services, Inc., on Savannah River Nuclear Solutions, LLC's U.S. Department of Energy Management & Operating (M&O) Contract No. DE-AC09-08SR22470" BACKGROUND The attached report presents the results of an audit of home office expenses submitted by Fluor
On electric resistances for distance-regular graphs
We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper. Our main result, Theorem 4, shows(together with Corollary 3) that if distance is measured by the electric resistance between points then all points are close to being equidistant on a distance-regular graph with large valency. A number of auxiliary results are also presented.
Koolen, Jack; Park, Jongyook
Confusability graphs for symmetric sets of quantum states
For a set of quantum states generated by the action of a group, we consider the graph obtained by considering two group elements adjacent whenever the corresponding states are non-orthogonal. We analyze the structure of the connected components of the graph and show two applications to the optimal estimation of an unknown group action and to the search for decoherence free subspaces of quantum channels with symmetry.
Giulio Chiribella; Yuxiang Yang
MANAGES Version 3.2
MANAGESsimplifies management of environmental data collected at coal ash management facilities, manufactured gas plant sites, and other locations where these data are regularly collected. MANAGESis a database software customized for management and interpretation of water quality, soil quality, and waste characterization data. It provides a variety of builtreports and graphs for displaying data, comparisons to regulatory limits, trend analyses, and statistical evaluation. The comprehensive statistical pac...
Scalable methods for representing, characterizing, and generating large graphs.
Goal - design methods to characterize and identify a low dimensional representation of graphs. Impact - enabling predictive simulation; monitoring dynamics on graphs; and sampling and recovering network structure from limited observations. Areas to explore are: (1) Enabling technologies - develop novel algorithms and tailor existing ones for complex networks; (2) Modeling and generation - Identify the right parameters for graph representation and develop algorithms to compute these parameters and generate graphs from these parameters; and (3) Comparison - Given two graphs how do we tell they are similar? Some conclusions are: (1) A bad metric can make anything look good; (2) A metric that is based an edge-by edge prediction will suffer from the skewed distribution of present and absent edges; (3) The dominant signal is the sparsity, edges only add a noise on top of the signal, the real signal, structure of the graph is often lost behind the dominant signal; and (4) Proposed alternative: comparison based on carefully chosen set of features, it is more efficient, sensitive to selection of features, finding independent set of features is an important area, and keep an eye on us for some important results.
Grace, Matthew D.; Dunlavy, Daniel M. (Sandia National Laboratories, Albuquerque, NM); Ray, Jaideep; Pinar, Ali; Hendrickson, Bruce Alan (Sandia National Laboratories, Albuquerque, NM); Phillips, Cynthia Ann (Sandia National Laboratories, Albuquerque, NM); Kolda, Tamara Gibson
uRbAn: A Multipath Routing based Architecture with Energy and Mobility Management for Quality of Service Support in Mobile Ad hoc Networks
Designing a wireless node that supports quality of service (QoS) in a mobile ad hoc network is a challenging task. In this paper, we propose an architecture of a wireless node that may be used to form a mobile ad hoc network that supports QoS. We discuss the core functionalities required for such a node and how those functionalities can be incorporated. A feature of our architecture is that the node has the ability to utilize multiple paths, if available, for the provision of QoS. However, in the absence of multiple paths it can utilize the resources provided by a single path between the source and the destination. We follow a modular approach where each module is expanded iteratively. We compare the features of our architecture with the existing architectures proposed in the literature. Our architecture has provisions of energy and mobility management and it can be customized to design a system-on-chip (SoC).
Abbas, Ash Mohammad
Environmental Management Root Cause Analysis Corrective Action...
Office of Environmental Management (EM) Organization Chart |...
Utility Energy Service Contracts - Lessons Learned
Service Contracts-Lessons Learned Service Contracts-Lessons Learned Utility Energy Services Contracts Lessons Learned Water Conservation Negotiating Financing Lowering Finance Rates Utility Energy Service Contracts-Lessons Learned 2 -- FEDERAL ENERGY MANAGEMENT PROGRAM Contents Introduction .............................................................................................................................................................................3 Financing Utility Energy Services Contracts ..........................................................................................................................3 Understanding Financing Factors ...........................................................................................................................................3
pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs
Detecting sequence homology between protein sequences is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting the homology between two protein sequences is relatively inexpensive, detecting pairwise homology for a large number of protein sequences can become computationally prohibitive for modern inputs, often requiring millions of CPU hours. Yet, there is currently no robust support to parallelize this kernel. In this paper, we identify the key characteristics that make this problemparticularly hard to parallelize, and then propose a new parallel algorithm that is suited for detecting homology on large data sets using distributed memory parallel computers. Our method, called pGraph, is a novel hybrid between the hierarchical multiple-master/worker model and producer-consumer model, and is designed to break the irregularities imposed by alignment computation and work generation. Experimental results show that pGraph achieves linear scaling on a 2,048 processor distributed memory cluster for a wide range of inputs ranging from as small as 20,000 sequences to 2,560,000 sequences. In addition to demonstrating strong scaling, we present an extensive report on the performance of the various system components and related parametric studies.
Wu, Changjun; Kalyanaraman, Anantharaman; Cannon, William R.
Managing Radiation Emergencies: Prehospital Guidance
Guidance for Prehospital Emergency Services Guidance for Hospital Medical Management Procedure Demonstration How do you manage emergencies? Guidance for Prehospital Emergency...
A novel approach for service performance analysis and forecast
This research establishes a predictive model to forecast the impact on service performance for changes to the underlying activities of the service's components. It deduces a relational model between a service's performance, its application component ... Keywords: ART - average response time, QoS - quality of service, SLA - service level agreement, SLM - service level management, SOA - service oriented architecture
Sid Kargupta; Sue Black
Transportation Services | Staff Services
Transportation Services Transportation Services The BNL Transportation Office, located at 20 Brookhaven Avenue, Building 400A, is available to assist BNL employees, guests and visitors with transportation needs in support of Laboratory programs. The hours of operation are 8:30 AM - 5:00 PM Monday through Friday. To contact the Transportation Office call (631) 344-2535. Stony Brook Parking Passes The Transportation Office has a limited number of parking passes for the three (3) parking garages at Stony Brook University. The passes are available to and are intended for use by BNL employees/scientific staff on official business only. Passes may be used at the Administration, University Hospital and Health Services Center garages on the Stony Brook campus when visiting SBU on official business.
Functional Series 500 Management Services
... Violations of this section must be enforced in accordance with ADS 568, National Security Information and Counterintelligence Security Program. ...
FacilitiesManagement Field Services
at Cass in the movie Stinkhorn. Fig.1 Fig.2 Fig.4 Fig.3 Microhydro power generation on a single modern household scale. Adam Fuller, PhD candidate Mechanical Engineering University of Canterbury. Microhydro
Hickman, Mark
Anatomy of a young giant component in the random graph
We provide a complete description of the giant component of the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ as soon as it emerges from the scaling window, i.e., for $p = (1+\\epsilon)/n$ where $\\epsilon^3 n \\to \\infty$ and $\\epsilon=o(1)$. Our description is particularly simple for $\\epsilon = o(n^{-1/4})$, where the giant component $C_1$ is contiguous with the following model (i.e., every graph property that holds with high probability for this model also holds w.h.p. for $C_1$). Let $Z$ be normal with mean $\\frac23 \\epsilon^3 n$ and variance $\\epsilon^3 n$, and let $K$ be a random 3-regular graph on $2\\lfloor Z\\rfloor$ vertices. Replace each edge of $K$ by a path, where the path lengths are i.i.d. geometric with mean $1/\\epsilon$. Finally, attach an independent Poisson($1-\\epsilon$)-Galton-Watson tree to each vertex. A similar picture is obtained for larger $\\epsilon=o(1)$, in which case the random 3-regular graph is replaced by a random graph with $N_k$ vertices of degree $k$ for $k\\geq 3$, where $N_k$ has mean...
Ding, Jian; Lubetzky, Eyal; Peres, Yuval
Distributed service composition
In this paper we explore the use of action systems for distributed service composition. Distributed systems can be composed out of a basic computation and a set of services. Even though this way of designing a system out of components helps in managing the derivation task, formal description techniques are needed due to the complexity of distributed systems. We propose a method where services, or features as they are often called, are speci ed in isolation by the service provider. The services when available are used by clients in a distributed manner. Reasoning about the services and their interactions with each other and with the basic computation of the clients is carried out within the re nement calculus. To exemplify the proposed methodology we study feature composition and feature interaction in telecommunications software.
Joost N. Kok; Kaisa Sere
Mining Large Heterogeneous Graphs using Cray s Urika
Pattern discovery and predictive modeling from seemingly related Big Data represented as massive, ad-hoc, heterogeneous networks (e.g., extremely large graphs with complex, possibly unknown structure) is an outstanding problem in many application domains. To address this problem, we are designing graph-mining algorithms capable of discovering relationship-patterns from such data and using those discovered patterns as features for classification and predictive modeling. Specifically, we are: (i) exploring statistical properties, mechanics and generative models of behavior patterns in heterogeneous information networks, (ii) developing novel, automated and scalable graph-pattern discovery algorithms and (iii) applying our relationship-analytics (data science + network science) expertise to domains spanning healthcare to homeland security.
Sukumar, Sreenivas R [ORNL] ORNL; Bond, Nathaniel A [ORNL] ORNL
Weaving independently generated photons into an arbitrary graph state
The controlled-Z (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.
Lin, Qing [College of Information Science and Engineering, Huaqiao University (Xiamen), Xiamen 361021 (China); He, Bing [University of California, Merced, 5200 North Lake Road, Merced, California 95343 (United States); Institute for Quantum Information Science, University of Calgary, Alberta T2N 1N4 (Canada)
The controlled Z (CZ) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multi-partite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade CZ operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon to the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.
Qing Lin; Bing He
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can be used to eliminate variables and add new constraints to the encoding. We show that our transformations uncover additional structure in the planning problem, structure that subsumes the structure uncovered by GRAPHPLAN planning graphs. We solve the CSP encoded planning problem by using standard CSP algorithms. Empirical evidence is presented to validate the effectiveness of this approach to solving planning problems, and to show that even a prototype implementation is more effective than standard GRAPHPLAN. Our prototype is even competitive with far more optimized planning graph based implementations. We also demonstrate that this approach can be more easily lifted to more complex types of planning than can planning graphs. In particular, we show that the approach can be easily extended to planning with resources.
Adriana Lopez; Fahiem Bacchus
GSH Group Inc. and Stellar Management: SPP Success Story | ENERGY...
Energy Management Assessment Matrix for Small Companies | ENERGY...
NSLS Services | Repair & Equipment Services
Repair & Equipment Services Repair & Equipment Services Cleaning Facility (BNL Central Shops) Solvent cleaning of vacuum parts and leak checking service is also available. Work is billed to each user via a BNL ILR. Contact the NSLS Building Manager to arrange for any of these services. Electronics Repair Limited repairs for electronic equipment are available from an outside contractor through the Control Room. Contact Control Room Supervisor Randy Church (x2550 or x2736, pager 5310). Shipping memos are filled out on the web, and pick ups are on Fridays. Come to the Control Room for assistance. The user should call the contractor on the day before scheduled pickups to alert the contractor of the pickup. Items to be repaired should be left in the Control Room with the completed shipping memo. Costs are charged to the
EIS-0442: Forest Service Reauthorization of Transmission Lines...
Utah and Nebraska for Routine Maintenance Practices including Changes in Vegetation Management EIS-0442: Forest Service Reauthorization of Transmission Lines on Forest Service...
Applying a Model Transformation Taxonomy to Graph Transformation Technology
A taxonomy of model transformations was introduced in [16]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best suited to carry out a particular model transformation activity. In this paper we apply the taxonomy to the technique of graph transformation, and we exemplify it by referring to four representative graph transformation tools. As a byproduct of our analysis, we discuss how well each of the considered tools carry out the activity of model transformation.
Tom Mens; Pieter Van Gorp; D�niel Varr�; Gabor Karsai
Graph Based Modeling and Implementation with EER/GRAL
This paper gives a cohesive approach to modeling and implementation with graphs. This approach uses extended entity relationship (EER) diagrams supplemented with the Z-like constraint language GRAL. Due to the foundation of EER/GRAL on Z a common formal basis exists. EER/GRAL descriptions give conceptual models which can be implemented in a seamless manner by efficient data structures using the GraLab graph library. Descriptions of four medium size EER/GRAL-applications conclude the paper to demonstrate the usefulness of the approach in practice.
J. Ebert; A. Winter; P. Dahm; A. Franzke; R. S�ttenbach
Services Services Services SERVICES OF THE OFFICE OF THE GENERAL COUNSEL The Office of the General Counsel is responsible for providing legal advice, counsel, and support to the Secretary, Deputy Secretary, and all Departmental elements, except the National Nuclear Security Administration and the Federal Energy Regulatory Commission. This Office assures that the Department operates in compliance with all pertinent laws and regulations. The Immediate Office of the General Counsel directs, manages, and supervises all activities assigned to the General Counsel, including the following offices: Litigation & Enforcement (GC-30) The Deputy General Counsel for Litigation and Enforcement directs, manages, supervises and coordinates the activities and functions assigned to the following Assistant General Counsels responsible for:
Recruitment Services
IAEA Recruitment Services Personal History Form (PHF) and Job Opportunities IAEA Employment Benefits Relevant Publications and Brochures Interview Process This service is provided...
Copy Service, Production Services
Copy Service Copy Service Copying in color or black-and-white from hard copy or electronic files. Paper size up to 13" x 19" in a variety of stocks and colors. Larger Documents (up to 36" wide and 100" long) can be reproduced in Black & White from prints or files and can be saved in a variety of electronic format Variable Data Printing - personalized document production Tab Printing Forms CD/DVD Duplication CD/DVD direct printing Binding Collate documents, insert tab dividers, punch holes for binding Stapling documents up to 1 inch thick Spiral, adhesive and perfect binding. Hard covers also available upon request Folding & Mailing Print and apply mailing addresses and labels Machine fold documents and insert into envelopes for mailing Laminate printed items up to 35" wide.
Building & Site Services Coordination
FAQs FAQs Conference Center and APS Site Activity Coordination Management and/or Coordination of APS Site Work/Services Safety & Emergency Management Database Maintenance Personnel Building and Site Services Coordination "We're at the End of our Pagers" The mission of the Building & Site Services Coordination is to efficiently manage and minimize the impact of APS building and site activities and to provide optimal support to APS staff and users in all 400 buildings and areas. FAQs Conference Center and APS Site Activity Coordination Locations Reservations Setups Visits & Tours Management and/or Coordination of APS Site Work/Services Work Entry Clearances Utility Shutdowns Telephone System Rigging Stockroom Office Furniture Installation Safety & Emergency Management
Service Buildings
U.S. Energy Information Administration (EIA) Indexed Site
Service Service Characteristics by Activity... Service Service buildings are those in which some type of service is provided, other than food service or retail sales of goods. Basic Characteristics [ See also: Equipment | Activity Subcategories | Energy Use ] Service Buildings... Most service buildings were small, with almost ninety percent between 1,001 and 10,000 square feet. Tables: Buildings and Size Data by Basic Characteristics Establishment, Employment, and Age Data by Characteristics Number of Service Buildings by Predominant Building Size Category Figure showing number of service buildings by size. If you need assistance viewing this page, please contact 202-586-8800. Equipment Table: Buildings, Size, and Age Data by Equipment Types Predominant Heating Equipment Types in Service Buildings
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted ...
Roger Pearce; Maya Gokhale; Nancy M. Amato
Graph of words embedding for molecular structure-activity relationship analysis
Structure-Activity relationship analysis aims at discovering chemical activity of molecular compounds based on their structure. In this article we make use of a particular graph representation of molecules and propose a new graph embedding procedure ...
Jaume Gibert; Ernest Valveny; Horst Bunke
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polynomial time approximation algorithm exists ...
Gamarnik, David
An Energy Services Initiative
The parent company of a large electric utility has launched a new unregulated subsidiary that provides a portfolio of value-added, beyond-the-meter energy services. These services are designed to meet the specific needs of customers and to better position the company to meet the challenges of a more competitive operating environment. The energy services initiative integrates a variety of hardware-based solutions to meet a customer's energy management, high voltage distribution, information, and power quality needs. The subsidiary will continually search the horizon for emerging technologies to enhance its ability to deliver comprehensive and customized energy solutions. The approach to marketing these services supplements the electric utility's core competencies with services and expertise provided by trade allies and performance partners.
Beasley, R. C.; Tipton, J. K.; Ehmer, R. C.
Graph-based reference table construction to facilitate entity matching
Entity matching plays a crucial role in information integration among heterogeneous data sources, and numerous solutions have been developed. Entity resolution based on reference table has the benefits of high efficiency and being easy to update. In ... Keywords: Entity matching, Graph clustering, Reference table
Fangda Wang, Hongzhi Wang, Jianzhong Li, Hong Gao
Tree/Graph Visualization CMSC 436/636
grid, transportation routes, trade, immigration Connections: relationships, causality, citations, disease transmission vectors, #12;Hierarchical and Relational Data · Conceptually a graph · Key challenges · Distortion mapping Clustering · Group nodes into clusters · Use clusters for layout · Display appropriate
Rheingans, Penny
Degenerate flag varieties: moment graphs and Schr�der numbers
We study geometric and combinatorial properties of the degenerate flag varieties of type A. These varieties are acted upon by the automorphism group of a certain representation of a type A quiver, containing a maximal torus T. Using the group ... Keywords: Flag varieties, Moment graphs, Quiver Grassmannians, Schr�der numbers
Giovanni Cerulli Irelli; Evgeny Feigin; Markus Reineke
Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs
We use a randomised embedding method to prove that for all \\alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \\delta^+(G),\\delta^-(G)\\geq (3/8+\\alpha)|G| contains every possible orientation of a Hamilton cycle. This confirms a conjecture of H\\"aggkvist and Thomason.
Kelly, Luke
Simulation of an Electrical Substation Using the Bond Graph Technique
Simulation and especially computer simulation, is a basic tool since it enables engineers to understand how systems work without actually needing to see them. They can learn how they work in different circumstances and optimize their design with considerably ... Keywords: simulation, electrical substations, elements, electricity, bond graph
Gregorio Romero; Jesus Felez; Joaquin Maroto; Jose Manuel Mera
Global Maker-Breaker games on sparse graphs
In this paper we consider Maker-Breaker games, played on the edges of sparse graphs. For a given graph property P we seek a graph (board of the game) with the smallest number of edges on which Maker can build a subgraph that satisfies P. In this paper we focus on global properties. We prove the following results: 1) for the positive minimum degree game, there is a winning board with n vertices and about 10n/7 edges, on the other hand, at least 11n/8 edges are required; 2) for the spanning k-connectivity game, there is a winning board with n vertices and (1+ok(1))kn edges; 3) for the Hamiltonicity game, there is a winning board of constant average degree; 4) for a tree T on n vertices of bounded maximum degree ?, there is a graph G on n vertices and at most f(?) � n edges, on which Maker can construct a copy of T. We also discuss biased versions on these games and argue that the picture changes quite drastically there. 1
Dan Hefetz; Michael Krivelevich; Tibor Szab�
A Winning Strategy for the Ramsey Graph Game
We consider a "Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for Maker requiring at most (n 0 3)2 n01 + n + 1 moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games. Keywords: Combinatorial Games, Algorithms on Graphs, Ramsey Theory 1 Introduction The Ramsey Graph Game, RG(n), on a complete graph on N vertices, KN , is considered. Two players, Maker (red) and Breaker (blue) alternately color the edges of KN . Maker is first to play, and the players color one edge per move. Maker wins the game if there is a red Kn . Breaker wins if there is no red Kn after all the N (N 0 1)=2 edges have been colored. Let R(n; n) denote the n-th Ramsey number, i.e., the smallest number R such that for every two-coloring of the edges of KR there exsist a monochromatic Kn ae KR . Maker has a simple winning strategy if N 2R(n; n). Note ...
Aleksandar Pekec
Weighted graph comparison techniques for brain connectivity analysis
The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools. Based on an in-depth literature review and interviews with neuroscientists, we explore ... Keywords: brain connectivity analysis, brain connectivity visualization, graph comparison
Basak Alper; Benjamin Bach; Nathalie Henry Riche; Tobias Isenberg; Jean-Daniel Fekete
Nodal domains on graphs - How to count them and why?
The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.
Ram Band; Idan Oren; Uzy Smilansky
Band, Ram; Smilansky, Uzy
An unified transition detection based on bipartite graph matching approach
This paper addresses transition detection which consists in identifying the boundary between consecutive shots. In this work, we propose an approach to cope with transition detection in which we define and use a new dissimilarity measure based on the ... Keywords: bipartite graph matching, cut, gradual transition
Zenilton Kleber Gon�alves Do Patroc�nio, Jr.; Silvio Jamil F. Guimar�es; Henrique Batista Da Silva; Kleber Jacques Ferreira De Souza
Object oriented parallelisation of graph algorithms using parallel iterator
Multi-core machines are becoming widely used which, as a consequence, forces parallel computing to move from research labs to being adopted everywhere. Due to the fact that developing parallel code is a significantly complex process, the main focus of ... Keywords: graph algorithms, object oriented parallelisation, parallel computing, parallel iterator
Lama Akeila; Oliver Sinnen; Wafaa Humadi
Efficient simulation of hybrid systems: A hybrid bond graph approach
Accurate and efficient simulations facilitate cost-effective design and analysis of large, complex, embedded systems, whose behaviors are typically hybrid, i.e. continuous behaviors interspersed with discrete mode changes. In this paper we present an ... Keywords: component-oriented modeling, dynamic causal assignment, hybrid bond graphs, modeling and simulation environments, simulation of hybrid systems
Indranil Roychoudhury; Matthew J Daigle; Gautam Biswas; Xenofon Koutsoukos
More on graph theoretic software watermarks: Implementation, analysis, and attacks
This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, ... Keywords: Software piracy protection, Software protection, Software watermarking, Surreptitious software
Christian Collberg; Andrew Huntwork; Edward Carter; Gregg Townsend; Michael Stepp
Top-K nearest keyword search on large graphs
It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of top-k nearest keyword (k-NK) search. In a network G modeled as an undirected graph, each node is ...
Miao Qiao, Lu Qin, Hong Cheng, Jeffrey Xu Yu, Wentao Tian
MML Inference of Decision Graphs with Multi-way Joins
A decision tree is a comprehensible representation that has been widely used in many machine learning domains. But in the area of supervised learning, decision trees have their limitations. Two notable problems are those of replication and fragmentation. ... Keywords: MDL, MML, decision graphs, decision trees, machine learning, minimum message length, probabilistic prediction, supervised learning
Peter J. Tan; David L. Dowe
Using graph-based program characterization for predictive modeling
Using machine learning has proven effective at choosing the right set of optimizations for a particular program. For machine learning techniques to be most effective, compiler writers have to develop expressive means of characterizing the program being ... Keywords: compiler optimization, graph-based program characterization, iterative compilation, machine learning, support vector machine
Eunjung Park; John Cavazos; Marco A. Alvarez
Teaching graph algorithms to children of all ages
We report on our experiences in teaching graph theory and algorithms to school children, aged 5 to 17. Our objectives were to demonstrate that children can discover quite complex mathematical concepts, and are able to work with abstractions and use computation ... Keywords: abstraction, computational thinking, k-12 education, modelling, problem based learning
J. Paul Gibson
Component supervision by sensor placement on bond-graph model
The component supervision procedure consists of the comparison of the actual behaviour with the reference behaviour which describes the normal mode. The analytical redundancy has to find relations between known variables of the system. These relations ... Keywords: bond graphs, causal paths, modelling, sensors placement, supervision
M. Khemliche; B. Ould Bouamama; A. Khellaf; M. Mostefa�
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective analytical method is to characterize the composition of a specimen based on user-defined patterns of texture and contrast formation. However, such a simple requirement demands an improved model for stability and robustness. Here, an interactive computational model is introduced for learning patterns of interest by example. The learned patterns bound an active contour model in which the traditional gradient descent optimization is replaced by the more efficient optimization of the graph cut methods. First, the energy function is defined according to the curve evolution. Next, a graph is constructed with weighted edges on the energy function and is optimized with the graph cut algorithm. As a result, the method combines the advantages of the level set method and graph cut algorithm, i.e.,"topological" invariance and computational efficiency. The technique is extended to the multi-phase segmentation problem; the method is validated on synthetic images and then applied to specimens imaged by transmission electron microscopy(TEM).
Chang, Hang; Auer, Manfred; Parvin, Bahram
On-Line Construction of Compact Directed Acyclic Word Graphs
A Compact Directed Acyclic Word Graph (CDAWG) is a space-efficient text indexing structure, that can be used in several different string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on-line algorithm ...
Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi
Note: A note on power domination in grid graphs
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: Grid, Power domination
Michael Dorfling; Michael A. Henning
A note on power domination in grid graphs
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graphs (see [T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, ... Keywords: grid, power domination
Graphical and incremental type inference: a graph transformation approach
We present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve ... Keywords: graphical language, process networks, type inference, type visualization
Silvia Clerici; Cristina Zoltan; Guillermo Prestigiacomo
Semi-automated derivation of conceptual neighborhood graphs of topological relations
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph of topological relations, which shows all pairs of relations between ... Keywords: 9+-intersection, conceptual neighborhood graphs, conceptual neighbors, smooth transformation, topological relations
Yohei Kurata
Cleaning random d-regular graphs with brushes using a degree-greedy algorithm
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a differential equations method to find the (asymptotic) ... Keywords: cleaning process, degree--greedy algorithm, differential equations method, random d-regular graphs
Margaret-Ellen Messinger; Pawe? Pra?at; Richard J. Nowakowski; Nicholas Wormald
Green-Marl: a DSL for easy and efficient graph analysis
The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level language ... Keywords: domain-specific language, graph, parallel programming
Sungpack Hong; Hassan Chafi; Edic Sedlar; Kunle Olukotun
A multiobjective evolutionary programming framework for graph-based data mining
Subgraph mining is the process of identifying concepts describing interesting and repetitive subgraphs within graph-based data. The exponential number of possible subgraphs makes the problem very challenging. Existing methods apply a single-objective ... Keywords: Evolutionary multiobjective optimization, Frequent subgraph mining, Graph-based data mining, Multiobjective evolutionary programming, Multiobjective graph-based data mining, Pareto optimality
Prakash Shelokar, Arnaud Quirin, �Scar Cord�N
On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs
The maximal clique enumeration (MCE) problem can be used to find very tightly-coupled collections of objects inside a network or graph of relationships. However, when such networks are based on noisy or uncertain data, the solutions to the MCE problem ... Keywords: biological applications, graph algorithms, graph perturbation theory, maximal clique enumeration
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and mining these graphs. However, almost all of them have studied these graphs ... Keywords: Dynamic interaction networks, diffusion of innovations, evolutionary analysis
Sitaram Asur; Srinivasan Parthasarathy; Duygu Ucar
Shape prior model for media-adventitia border segmentation in IVUS using graph cut
We present a shape prior based graph cut method which does not require user initialisation. The shape prior is generalised from multiple training shapes, rather than using singular templates as priors. Weighted directed graph construction is used to ... Keywords: IVUS, graph cut, image segmentation, shape prior
Ehab Essa; Xianghua Xie; Igor Sazonov; Perumal Nithiarasu; Dave Smith
Exponential random graph modeling of communication networks to understand organizational crisis
In recent social network studies, exponential random graph models have been used comprehensively to model global social network structure as a function of their local features. In this study, we describe the exponential random graph models and demonstrate ... Keywords: email communications, exponential random graph models, organizational disintegration, p* models, social networks, statistical models for social networks
Jafar Hamra; Shahadat Uddin; Liaquat Hossain
CLAW-FREE 3-CONNECTED P11-FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there ex- ist non-hamiltonian 3-connected claw-free graphs without induced copies of P12
Pfender, Florian
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) graphs. The knn graph of a data set is obtained by connecting each point ... Keywords: Approximate nearest neighbors, Distributed and parallel algorithms, Metric spaces, Nearest neighbors, Range queries, Robotics, knn graphs
Erion Plaku; Lydia E. Kavraki
Product Service Codes @ Headquarters Description: Product Services Codes used at Headquartes Procurement Services
Codes @ Headquarters Codes @ Headquarters Description: Product Services Codes used at Headquartes Procurement Services Filters: Signed Date only show values between , Contracting Agency ID only show values equal to '8900', Contracting Office ID only show values equal to '00001', Modification Number only show values equal to '0', Date Signed only show values between '05/01/2011' and '04/30/2012', Last Modified Date only show values between Contracting Agency ID: 8900, Contracting Office ID: 00001 Product or Service Code Product or Service Description Ultimate Contract Value R499 OTHER PROFESSIONAL SERVICES $48,396,439.74 7 R499 SUPPORT- PROFESSIONAL: OTHER $13,156,938.09 16 7030 ADP SOFTWARE $5,745,993.02 81 R408 PROGRAM MANAGEMENT/SUPPOR T SERVICES $5,343,000.00 5 AD26 SERVICES (MANAGEMENT/SUPPO
Find an ENERGY STAR service and product provider | ENERGY STAR
Find an ENERGY STAR service and product provider Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing buildings Commercial...
Find rebates, incentives, and financing services for energy projects...
Find rebates, incentives, and financing services for energy projects Secondary menu About us Press room Contact Us Portfolio Manager Login Facility owners and managers Existing...
Toward Secure Services from Untrusted Developers
We present a secure service prototype built from untrusted,contributed code.The service manages private data for a variety of different users, anduser programs frequently require access to other users' private data.However, ...
Brodsky, Micah
The Science of NOAA's Operational Hydrologic Ensemble Forecast Service
NOAA's National Weather Service (NWS) is implementing a short- to long-range Hydrologic Ensemble Forecast Service (HEFS). The HEFS addresses the need to quantify uncertainty in hydrologic forecasts for flood risk management, water supply management, ...
Julie Demargne; Limin Wu; Satish Regonda; James Brown; Haksu Lee; Minxue He; Dong-Jun Seo; Robert Hartman; Henry D. Herr; Mark Fresch; John Schaake; Yuejian Zhu
Managing Business Customer Satisfaction with an Eye Toward the Bottom Line: Results from the San Antonio City Public Service Oversample of the C/I BASICS� Study
The goal of the national commercial/industrial BASICS project is to help electric distribution utilities make resource allocation decisions that optimize business customer satisfaction while minimizing costs. In addition to the national effort, San Antonio City Public Service (CPS) sponsored an oversample in their service territory of the national BASICS study to better understand how CPS commercial and industrial customers differ from national business customers. This report discusses the results of the...
Federal Energy Management Program: Water Efficiency Evaluation...
Service Contracts to someone by E-mail Share Federal Energy Management Program: Water Efficiency Evaluation Service Contracts on Facebook Tweet about Federal Energy...
Copy Services | Department of Energy
Copy Services Copy Services Copy Services The Copier Management Team is here to make sure your copier needs are met. Our products and services include: Acquisition of New and Replacement Copiers Copier Maintenance/Repairs Copier Relocation Monthly Working Capital Fund Billing Reports Copier supplies Other services include needs assessment analysis to determine workload and most appropriate equipment to: Perform acquisition activities on behalf of program customers. Negotiation of equipment trade-in allowance where applicable. Arrange for delivery and installation of newly purchased equipment. Coordinate training for key operators and users on newly acquired equipment. Establish annual maintenance agreements with vendors (including negotiation of most cost-effective terms and conditions).
Recipients: 2001 TMS Distinguished Service Award
Recipients: 2001 TMS Distinguished Service Award ... He was senior research staff and manager of basic energy science, materials sciences (1953-1990) and�...
Office of Human Resource Services (HC-30)
This organization provides a full range of human capital management (HCM) operational functions, employee work life programs, workforce service delivery, and day-to-day operational support for...
Smart Grid Applications Using Sensor Web Services .
??Sensor network web services have recently emerged as promising tools to provide remote management, data collection and querying capabilities for sensor networks. They can be� (more)
Asad, Omar
FY 2012 Budget Hearing Testimony before the Senate Armed Services...
Senate Armed Services Committee, Subcommittee on Strategic Forces | National Nuclear Security Administration Our Mission Managing the Stockpile Preventing Proliferation Powering...
Office of Information Technology University of Minnesota 1 The intent of this document is to describe Moodle course management services provided by the
management system. Instructors can create course websites that include text, multimedia learning resources information, visit the Change Management website. Scheduled Maintenance Moodle has time reserved for scheduled maintenance windows is published on the System Status page. Should maintenance be required outside
Elastic service availability: utility framework and optimal provisioning
Service availability is one of the most closely scrutinized metrics in offering network services. It is important to cost- effectively provision a managed and differentiated network with various service availability guarantees under a unified platform. ...
Dahai Xu; Ying Li; Mung Chiang; A. Calderbank
Contracting for Support Services | Department of Energy
Guidance Guidance » Contracting for Support Services Contracting for Support Services What you need to know as a Federal Employee The Department of Energy, like most Federal agencies, spends a significant amount of its contracting budget on support services. While these contracts fulfill continuing and essential needs of the Department, this type of contracting arrangement can present unique situations that require special diligence on the part of Federal employees to ensure that applicable statutes, regulations, and management practices are followed. Contracts for support services cover a wide range of areas and may include: - Maintenance, overhaul, repair and servicing of equipment. - Housekeeping services. - Advisory and assistance services. - Transportation services.
Services Services Services The responsibilities of stakeholder relations are achieved through public outreach to and input from those individuals, groups, host communities, and other entities in the public and private sectors that are interested in or affected by any of the U.S. Department of Energy's (DOE or Department's) activities and decisions. Stakeholder Relations Information from Office of Legacy Management (LM) record holdings are shared with LM stakeholders following several formal request processes. Freedom of Information Act (FOIA) and Privacy Act Employees Occupational Illness Compensation Program Act (EEOICPA) Public Document Request DOE is the fourth-largest federal land manager, conducting its mission at 50 major sites on 2.4 million acres across the country. LM will act as a
Orientable embeddings and orientable cycle double covers of projective-planar graphs
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected projective-planar cubic graph has a closed 2-cell embedding in some orientable surface. The three main ingredients of the proof are (1) a surgical method to convert nonorientable embeddings into orientable embeddings; (2) a reduction for 4-cycles for orientable closed 2-cell embeddings, or orientable cycle double covers, of cubic graphs; and (3) a structural result for projective-planar embeddings of cubic graphs. We deduce that every 2-edge-connected projective-planar graph (not necessarily cubic) has an orientable cycle double cover.
Ellingham, M N
Combinatorial Information Theoretical Measurement of the Semantic Significance of Semantic Graph Motifs
Given an arbitrary semantic graph data set, perhaps one lacking in explicit ontological information, we wish to first identify its significant semantic structures, and then measure the extent of their significance. Casting a semantic graph dataset as an edge-labeled, directed graph, this task can be built on the ability to mine frequent {\\em labeled} subgraphs in edge-labeled, directed graphs. We begin by considering the fundamentals of the enumerative combinatorics of subgraph motif structures in edge-labeled directed graphs. We identify its frequent labeled, directed subgraph motif patterns, and measure the significance of the resulting motifs by the information gain relative to the expected value of the motif based on the empirical frequency distribution of the link types which compose them, assuming indpendence. We illustrate the method on a small test graph, and discuss results obtained for small linear motifs (link type bigrams and trigrams) in a larger graph structure.
Joslyn, Cliff A.; al-Saffar, Sinan; Haglin, David J.; Holder, Larry
LDRD final report : first application of geospatial semantic graphs to SAR image data.
Modeling geospatial information with semantic graphs enables search for sites of interest based on relationships between features, without requiring strong a priori models of feature shape or other intrinsic properties. Geospatial semantic graphs can be constructed from raw sensor data with suitable preprocessing to obtain a discretized representation. This report describes initial work toward extending geospatial semantic graphs to include temporal information, and initial results applying semantic graph techniques to SAR image data. We describe an efficient graph structure that includes geospatial and temporal information, which is designed to support simultaneous spatial and temporal search queries. We also report a preliminary implementation of feature recognition, semantic graph modeling, and graph search based on input SAR data. The report concludes with lessons learned and suggestions for future improvements.
Brost, Randolph C.; McLendon, William Clarence,
Continuous Control in Buildings with Bond Graphs
Global warming caused by CO2 emissions as a result of energy consumption, shows its growing effects on the average temperatures worldwide. Office buildings are responsible for a major share of the 40% of the energy consumption of the built environment. We look at a way to minimize the environmental load of office buildings and at the same moment improve indoor air quality and comfort for the occupants of offices. Therefore the end-users behavior of building occupants needs to be taken into account. New design approaches are needed to implement the behavior of occupants of buildings. Improvement of the energy consumption is made possible by agent-based systems for energy management in buildings. Human-in-the-loop Technology: a technology to implement user behavior is developed. By starting from the human perspective and use available and new technology, the outcome was focused on the ability to provide improved individual comfort for the end user. As the end-users become more important within energy infrastructure of buildings, the focus is on the occupant and therefore a bottom-up design approach has been developed. In the final article an example on the level of workplace will be presented.
Zeiler, W.
Production Services
Occupational Safety and Health (OSH) management system, a vital part of an Integrated Safety Management (ISM) program. We are committed to achieving OHSAS registration for all...
Mailing Services
Mailing Services Mailing Services Use the form below to add your name to the Depleted UF6 Mailing List. First Name: Last Name: Organization: Address: City: State: Postal Code:...
FY 2010 Service Contract Inventory Analysis
0 Service Contract Inventory Analysis 0 Service Contract Inventory Analysis Department of Energy Office of Procurement & Assistance Management Strategic Programs Division (MA-622) January 2012 (REVISED) FY2010 Service Contract Inventory Analysis Department of Energy Contents Page Section 1: Background 1 Section 2: Analysis and Findings 3 Section 3: Next Steps 5 FY2010 Service Contract Inventory Analysis Department of Energy 1 Section 1: Background Section 743 of Division C of the FY 2010 Consolidated Appropriations Act, P.L. 111-117, requires civilian agencies to prepare an annual inventory of their service contracts. The Office of Management and Budget's (OMB) November 5, 2010 and December 19, 2012 Memorandums entitled, "Service Contract