We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

From the Publisher: 
The accessible presentation of this book gives both a general view of the entire computer vision enterprise and also offers sufficient detail to be able to build useful applications. Users learn techniques that have proven to be useful by first-hand experience and a wide range of mathematical methods. A CD-ROM with every copy of the text contains source code for programming practice, color images, and illustrative movies. Comprehensive and up-to-date, this book includes essential topics that either reflect practical significance or are of theoretical importance. Topics are discussed in substantial and increasing depth. Application surveys describe numerous important application areas such as image based rendering and digital libraries. Many important algorithms broken down and illustrated in pseudo code. Appropriate for use by engineers as a comprehensive reference to the computer vision enterprise.

Computer vision : a modern approach = 计算机视觉 : 一种现代的方法

Influence of extreme weather and climate change on the resilience of power systems: Impacts and possible mitigation strategies

Short-term load forecasting is an essential instrument in power system planning, operation, and control. Many operating decisions are based on load forecasts, such as dispatch scheduling of generating capacity, reliability analysis, and maintenance planning for the generators. Overestimation of electricity demand will cause a conservative operation, which leads to the start-up of too many units or excessive energy purchase, thereby supplying an unnecessary level of reserve. On the other hand, underestimation may result in a risky operation, with insufficient preparation of spinning reserve, causing the system to operate in a vulnerable region to the disturbance. In this paper, semi-parametric additive models are proposed to estimate the relationships between demand and the driver variables. Specifically, the inputs for these models are calendar variables, lagged actual demand observations, and historical and forecast temperature traces for one or more sites in the target power system. In addition to point forecasts, prediction intervals are also estimated using a modified bootstrap method suitable for the complex seasonality seen in electricity demand data. The proposed methodology has been used to forecast the half-hourly electricity demand for up to seven days ahead for power systems in the Australian National Electricity Market. The performance of the methodology is validated via out-of-sample experiments with real data from the power system, as well as through on-site implementation by the system operator.

/pdf/short-term-load-forecasting-based-on-a-semi-parametric-4pkbxprv30.pdf

Short-Term Load Forecasting Based on a Semi-Parametric Additive Model

Publications are essential for scientific communication. Access to publications is provided by conventional libraries, digital libraries operated by learned societies or commercial publishers, and a huge number of web sites maintained by the scientists themselves or their institutions. Comprehensive meta-indices for this increasing number of information sources are missing for most areas of science. The DBLP Computer Science Bibliography of the University of Trier has grown from a very specialized small collection of bibliographic information to a major part of the infrastructure used by thousands of computer scientists. This short paper first reports the history of DBLP and sketches the very simple software behind the service. The most time-consuming task for the maintainers of DBLP may be viewed as a special instance of the authority control problem; how to normalize different spellings of person names. The third section of the paper discusses some details of this problem which might be an interesting research issue for the information retrieval community.

The DBLP Computer Science bibliography: Evolution, research issues, perspectives

Weather information is an important factor in load forecasting models. Typically, load forecasting models are constructed and tested using actual weather readings. However, online operation of load forecasting models requires the use of weather forecasts, with associated weather forecast errors. These weather forecast errors inevitably lead to a degradation in model performance. This is an important factor in load forecasting but has not been widely examined in the literature. The main aim of this paper is to present a novel technique for minimizing the consequences of this degradation. In addition, a supplementary technique is proposed to model weather forecast errors to reflect current accuracy. The proposed technique utilizes a combination of forecasts from several load forecasting models (sub-models). The parameter estimation may thus be split into two parts: sub-model and combination parameter estimation. It is shown that the lowest PMSE corresponds to training the sub-models with actual weather but training the combiner with forecast weather.

/pdf/on-the-influence-of-weather-forecast-errors-in-short-term-1b7sruq3tp.pdf

On the Influence of Weather Forecast Errors in Short-Term Load Forecasting Models

Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant to the study of Internet topologies, such as the generation of synthetic topologies to represent the Internet's AS topology. We derive a new metric that enables exactly such a structural comparison: the weighted spectral distribution. We then apply this metric to three aspects of the study of the Internet's AS topology. i) We use it to quantify the effect of changing the mixing properties of a simple synthetic network generator. ii) We use this quantitative understanding to examine the evolution of the Internet's AS topology over approximately seven years, finding that the distinction between the Internet core and periphery has blurred over time. iii) We use the metric to derive optimal parameterizations of several widely used AS topology generators with respect to a large-scale measurement of the real AS topology.

/pdf/weighted-spectral-distribution-for-internet-topology-5ahvh8icb5.pdf

Weighted spectral distribution for internet topology analysis: theory and applications

Social Network Analysis has become an impor- tant methodological tool for advancing our understanding of human and animal group behaviour. However, research- ers tend to rely on arbitrary distance and time measures when defining 'contacts' or 'associations' between individ- uals based on preliminary observation. Otherwise, criteria are chosen on the basis of the communication range of sensor devices (e.g. bluetooth communication ranges) or the sampling frequencies of collection devices (e.g. Global Positioning System devices). Thus, researchers lack an established protocol for determining both relevant associa- tion distances and minimum sampling rates required to accurately represent the network structure under investiga- tion. In this paper, we demonstrate how researchers can use experimental and statistical methods to establish spatial and temporal association patterns and thus correctly characterise social networks in both time and space. To do this, we first perform a mixing experiment with Merino sheep (Ovis aries) and use a community detection algorithm that allows us to identify the spatial and temporal distance at which we can best identify clusters of previously familiar sheep. This turns out to be within 2-3 m of each other for at least 3 min. We then calculate the network graph entropy rate—a measure of ease of spreading of information (e.g. a disease) in a network—to determine the minimum sampling rate required to capture the variability observed in our sheep networks during distinct activity phases. Our results indicate the need for sampling intervals of less than a minute apart. The tools that we employ are versatile and could be applied to a wide range of species and social network datasets, thus allowing an increase in both the accuracy and efficiency of data collection when exploring spatial association patterns in gregarious species.

https://www.jstor.org/stable/info/41414626

Determining association networks in social animals: Choosing spatial-temporal criteria and sampling rates

24-h electrical load data—a sequential or partitioned time series?

We introduce and study the spectral evolution model, which characterizes the growth of large networks in terms of the eigenvalue decomposition of their adjacency matrices: In large networks, changes over time result in a change of a graph's spectrum, leaving the eigenvectors unchanged. We validate this hypothesis for several large social, collaboration, authorship, rating, citation, communication and tagging networks, covering unipartite, bipartite, signed and unsigned graphs. Following these observations, we introduce a link prediction algorithm based on the extrapolation of a network's spectral evolution. This new link prediction method generalizes several common graph kernels that can be expressed as spectral transformations. In contrast to these graph kernels, the spectral extrapolation algorithm does not make assumptions about specific growth patterns beyond the spectral evolution model. We thus show that it performs particularly well for networks with irregular, but spectral, growth patterns.

Damien Fay

Papers

On the Influence of Weather Forecast Errors in Short-Term Load Forecasting Models

Weighted spectral distribution for internet topology analysis: theory and applications

Determining association networks in social animals: Choosing spatial-temporal criteria and sampling rates

24-h electrical load data—a sequential or partitioned time series?

Network growth and the spectral evolution model