Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Congestion presents a significant challenge in ad hoc networks due to their unstructured and distributed nature. In most congestion detection schemes for such networks, the affected node itself detects whether it is congested or not. The detection approach proposed in this paper performs detection with information estimators from neighbouring uncongested nodes that may be able to relieve the congestion...
It is recognized that systems are the most complicated entities in abstract, physical, information, cognitive, brain, and social worlds across a wide range of science and engineering disciplines. This paper presents a theory of distributed system topologies and adaptive fusion mechanisms. It reveals that structural and functional relations play a centric role in system behavior modeling. A special...
The celebrated Time Hierarchy Theorem for Turing machines states, informally, that more problems can be solved given more time. The extent to which a time hierarchy-type theorem holds in the classic distributed LOCAL model has been open for many years. In particular, it is consistent with previous results that all natural problems in the LOCAL model can be classified according to a small constant...
A Bike Sharing System (BSS) may be modeled as a graph with two node types: stations with finite bike inventory subject to time-varying demand and intersections to represent the underlying transportation network. Mobile agents (replenishment trucks) travel on the arcs of the graph to reset station inventories and make routing decisions at intersections. One-way rides create inventory imbalances across...
Named Data Networking (NDN) is a promising solution to the explosion of multimedia traffic on the Internet. NDN shifts the paradigm of host-centric approach to name-based approach, allowing the retrieval of contents solely by their name. To support this, NDN has caching as one of its main feature. Seen as a critical aspect to maximize its potential, caching in NDN has invited a lot of researches related...
Graphs are a key form of Big Data. Although graph computing technology has been studied extensively in recent years, it remains a grand challenge to process large-scale graphs efficiently. Computation on a graph is to propagate and update the vertex values systematically. Both its complexity and parallelism are affected mainly by the algorithm's value propagating pattern. Efficient graph computing...
We present a simple, highly modularized network architecture for image classification. Our network is constructed by repeating a building block that aggregates a set of transformations with the same topology. Our simple design results in a homogeneous, multi-branch architecture that has only a few hyper-parameters to set. This strategy exposes a new dimension, which we call cardinality (the size of...
In this paper we study the modeling and control of an interleaved DC-DC multilevel topology that exhibits a high-voltage gain and a minimum ripple point design. In this configuration, the current ripple cancelation point can be arbitrarily defined according to a desired specification, which represents an advantage with respect to classical topologies whose minimum ripple point is constrained (e.g...
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for network dynamics...
Can we optimally attack networks (in terms of disrupting the ability of the nodes in the network from communicating) when the network topology is unknown? In this paper, we show that it is not always possible to do so when the network topology is unknown a priori. Specifically, we develop multi armed bandit-based techniques that enable the attacker to learn the best network attack strategies and also...
Software-Defined Networking (SDN), as a new network paradigm, has the advantages of centralizing control and global visibility over the whole network. However, security issues remain to be a significant concern and impede SDN from being widely adopted. The most straightforward approach to mitigate the threat from malicious OpenFlow applications (OF app) is using permission set for controlling access...
Telecommunication networks have been designed and deployed with over-provisioning and redundancy of resources to cope with traffic load during peak hours and quickly recover from failure. However, most of these resources are underutilized and in most of the time idle but consuming full energy. With the growing concern of energy waste and greenhouse gases (GHG), the network design principles tend to...
Devices running on Wireless Sensor Networks (WSNs) generally have limited energy resources, which makes it important to design energy-aware algorithms. Capacitated Minimum Spanning Tree (CMST) algorithms can be designed for finding energy-aware routing paths and for load-balancing among sub-trees connected to the sink device. Despite being studied extensively in central settings, there has not been...
Novel sufficient conditions for well-posedness and stability of spatially interconnected systems with finite extent are proposed. Existing conditions for space-invariant interconnected systems do in general not guarantee these properties for finite-extent systems. Rather than using a model based on the spatial shift operator, here the system is represented as a network of (not necessarily identical)...
Compressed sensing (CS) enables significant reduction of MR acquisition time with performance guarantee. However, computational complexity of CS is usually expensive. To address this, here we propose a novel deep residual learning algorithm to reconstruct MR images from sparsely sampled k-space data. In particular, based on the observation that coherent aliasing artifacts from downsampled data has...
High performance embedded applications are developed using system-on-chips (SoCs) which in turn include silicon intensive, integrated application processors. These SoCs integrate multi-core processor (i.e., ARM Cortex9 or A15) with variety of memory interface controllers, communication interface controllers and special purpose accelerators. Traditionally bus matrix is used for integrating these intellectual...
Complexity is a double-edged sword for learning algorithms when the number of available samples for training in relation to the dimension of the feature space is small. This is because simple models do not sufficiently capture the nuances of the data set, while complex models overfit. While remedies such as regularization and dimensionality reduction exist, they themselves can suffer from overfitting...
The classification of graphs is a key challenge within many scientific fields using graphs to represent data and is an active area of research. Graph classification can be critical in identifying and labelling unknown graphs within a dataset and has seen application across many scientific fields. Graph classification poses two distinct problems: the classification of elements within a graph and the...
Software-defined networking (SDN) empowers network operators with more flexibility to program their networks. With SDN, network management moves from codifying functionality in terms of low-level device configurations to building virtualized software entities that facilitate network management and debugging. By separating the complexity of state distribution from network specification, SDN provides...
Phylogenetic supertrees synthesize a set of phylogenetic trees carrying overlapping taxa set, preferably with the consensus topologies of individual taxa subsets. Supertree construction is an NP-hard problem, and the methods based on decomposition and synthesis of fixed size subtree topologies (such as triplets or quartets) are the most popular. Time and space complexities of these methods, however,...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.