No abstract

No abstract

An active area of research in computational science is the design of algorithms for solving the subgraph matching problem to find copies of a given template graph in a larger world graph. Prior works have largely addressed single-channel networks using a variety of approaches. We present a suite of filtering methods for subgraph isomorphisms for multiplex networks (with different types of edges between nodes and more than one edge within each channel type). We aim to understand the entire solution space rather than focusing on finding one isomorphism. Results are shown on several classes of datasets: (a) Sudoku puzzles mapped to the subgraph isomorphism problem, (b) Erd ős-R ényi multigraphs, (c) real-world datasets from Twitter and transportation networks, (d) synthetic data created for the DARPA MAA program.

Appliance energy-efficiency programs are a central component of many countries' energypolicy portfolios. A major barrier to optimal implementation of these programs is lack of data to determine market baselines, assess the potential for cost-effective energy savings, and track markets over time to evaluate and verify program impacts. To address this gap, we have developed the International Database of Efficient Appliances (IDEA), a suite of software tools that automatically gathers data that is currently dispersed across various online sources and compiles it into a unified repository of information on efficiency, price, and features for a diversity of appliances and devices in markets around the world. In this article we describe the framework and functionality of IDEA, and we demonstrate its power as a resource for research and policy development related to appliance energy efficiency. Using IDEA data for refrigerators in China and India, we assess the potential for cost-effective energy savings within each market by computing robust indicators that can also be easily compared across different appliances and markets. We find that significant cost-effective savings are available on both markets. We discuss implications for the development of future energy-efficiency deployment programs.

The randomized Kaczmarz (RK) method is an iterative method for approximating the leastsquares solution of large linear systems of equations. The standard RK method uses sequential updates, making parallel computation difficult. Here, we study a parallel version of RK where a weighted average of independent updates is used. We analyze the convergence of RK with averaging and demonstrate its performance empirically. We show that as the number of threads increases, the rate of convergence improves and the convergence horizon for inconsistent systems decreases.