Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFrom local averaging to emergent global behaviors: the fundamental role of network interconnections
69
0
0.0
(
0
)
Added by
Giacomo Como
Publication date
2015
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Distributed averaging is one of the simplest and most studied network dynamics. Its applications range from cooperative inference in sensor networks, to robot formation, to opinion dynamics. A number of fundamental results and examples scattered through the literature are gathered here and originally presented, emphasizing the deep interplay between the network interconnection structure and the emergent global behavior.
rate research
Read More
Network motifs are overrepresented interconnection patterns found in real-world networks. What functional advantages may they offer for building complex systems? We show that most network motifs emerge from interconnections patterns that best exploit the intrinsic stability characteristics of individual nodes. This feature is observed at different scales in a network, from nodes to modules, suggesting an efficient mechanism to stably build complex systems.
In this paper, we tackle the accurate and consistent Structure from Motion (SfM) problem, in particular camera registration, far exceeding the memory of a single computer in parallel. Different from the previous methods which drastically simplify the parameters of SfM and sacrifice the accuracy of the final reconstruction, we try to preserve the connectivities among cameras by proposing a camera clustering algorithm to divide a large SfM problem into smaller sub-problems in terms of camera clusters with overlapping. We then exploit a hybrid formulation that applies the relative poses from local incremental SfM into a global motion averaging framework and produce accurate and consistent global camera poses. Our scalable formulation in terms of camera clusters is highly applicable to the whole SfM pipeline including track generation, local SfM, 3D point triangulation and bundle adjustment. We are even able to reconstruct the camera poses of a city-scale data-set containing more than one million high-resolution images with superior accuracy and robustness evaluated on benchmark, Internet, and sequential data-sets.
Network reconstruction is the first step towards understanding, diagnosing and controlling the dynamics of complex networked systems. It allows us to infer properties of the interaction matrix, which characterizes how nodes in a system directly interact with each other. Despite a decade of extensive studies, network reconstruction remains an outstanding challenge. The fundamental limitations governing which properties of the interaction matrix (e.g., adjacency pattern, sign pattern and degree sequence) can be inferred from given temporal data of individual nodes remain unknown. Here we rigorously derive necessary conditions to reconstruct any property of the interaction matrix. These conditions characterize how uncertain can we be about the coupling functions that characterize the interactions between nodes, and how informative does the measured temporal data need to be; rendering two classes of fundamental limitations of network reconstruction. Counterintuitively, we find that reconstructing any property of the interaction matrix is generically as difficult as reconstructing the interaction matrix itself, requiring equally informative temporal data. Revealing these fundamental limitations shed light on the design of better network reconstruction algorithms, which offer practical improvements over existing methods.
We develop methods to efficiently reconstruct the topology and line parameters of a power grid from the measurement of nodal variables. We propose two compressed sensing algorithms that minimize the amount of necessary measurement resources by exploiting network sparsity, symmetry of connections and potential prior knowledge about the connectivity. The algorithms are reciprocal to established state estimation methods, where nodal variables are estimated from few measurements given the network structure. Hence, they enable an advanced grid monitoring where both state and structure of a grid are subject to uncertainties or missing information.
With the recent interest in net-zero sustainability for commercial buildings, integration of photovoltaic (PV) assets becomes even more important. This integration remains a challenge due to high solar variability and uncertainty in the prediction of PV output. Most existing methods predict PV output using either local power/weather history or global weather forecasts, thereby ignoring either the impending global phenomena or the relevant local characteristics, respectively. This work proposes to leverage weather data from both local weather history and global forecasts based on time series modeling with exogenous inputs. The proposed model results in eighteen hour ahead forecasts with a mean accuracy of $approx$ 80% and uses data from the National Ocean and Atmospheric Administrations (NOAA) High-Resolution Rapid Refresh (HRRR) model.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
