297,426 research outputs found
Wireless local area network planning: an overview
When planning a wireless local area network, there are design issues that need to be considered. In this paper, the fundamentals of planning a wireless local area network are introduced and discussed to highlight the requirements involved. Network constraints, as their relevance to wireless network design is investigated. The paper concludes with an overview of wireless network planning solutions including commercial and free software, and an introduction to the authorâs research
Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) Network
Because of their effectiveness in broad practical applications, LSTM networks
have received a wealth of coverage in scientific journals, technical blogs, and
implementation guides. However, in most articles, the inference formulas for
the LSTM network and its parent, RNN, are stated axiomatically, while the
training formulas are omitted altogether. In addition, the technique of
"unrolling" an RNN is routinely presented without justification throughout the
literature. The goal of this paper is to explain the essential RNN and LSTM
fundamentals in a single document. Drawing from concepts in signal processing,
we formally derive the canonical RNN formulation from differential equations.
We then propose and prove a precise statement, which yields the RNN unrolling
technique. We also review the difficulties with training the standard RNN and
address them by transforming the RNN into the "Vanilla LSTM" network through a
series of logical arguments. We provide all equations pertaining to the LSTM
system together with detailed descriptions of its constituent entities. Albeit
unconventional, our choice of notation and the method for presenting the LSTM
system emphasizes ease of understanding. As part of the analysis, we identify
new opportunities to enrich the LSTM system and incorporate these extensions
into the Vanilla LSTM network, producing the most general LSTM variant to date.
The target reader has already been exposed to RNNs and LSTM networks through
numerous available resources and is open to an alternative pedagogical
approach. A Machine Learning practitioner seeking guidance for implementing our
new augmented LSTM model in software for experimentation and research will find
the insights and derivations in this tutorial valuable as well.Comment: 43 pages, 10 figures, 78 reference
Construction algorithm for network error-correcting codes attaining the Singleton bound
We give a centralized deterministic algorithm for constructing linear network
error-correcting codes that attain the Singleton bound of network
error-correcting codes. The proposed algorithm is based on the algorithm by
Jaggi et al. We give estimates on the time complexity and the required symbol
size of the proposed algorithm. We also estimate the probability of a random
choice of local encoding vectors by all intermediate nodes giving a network
error-correcting codes attaining the Singleton bound. We also clarify the
relationship between the robust network coding and the network error-correcting
codes with known locations of errors.Comment: To appear in IEICE Trans. Fundamentals
(http://ietfec.oxfordjournals.org/), vol. E90-A, no. 9, Sept. 2007. LaTeX2e,
7 pages, using ieice.cls and pstricks.sty. Version 4 adds randomized
construction of network error-correcting codes, comparisons of the proposed
methods to the existing methods, additional explanations in the proo
Explaining Nineteenth-Century Bilateralism: Economic and Political Determinants of the Cobden-Chevalier Network
This study investigates the empirical determinants of the treaty network of the 1860s and 1870s. It makes use of three central theories about the determinants of PTA formation, considering economic fundamentals from neoclassical and ânewâ trade theory, political-economy variables, and international interaction due to trade diversion fears (dependence of later PTAs on former). These possible determinants are operationalized using a newly constructed dataset for bilateral cooperation and non-cooperation among 13 European Countries and the US. The results of logistic regression analysis show that the treaty network can be explained by a combination of âpureâ welfare-oriented economic theory with political economy and international interaction models.Cobden-Chevalier Network, Bilateralism
Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
An interrelation between a topological design of network and efficient
algorithm on it is important for its applications to communication or
transportation systems. In this paper, we propose a design principle for a
reliable routing in a store-carry-forward manner based on autonomously moving
message-ferries on a special structure of fractal-like network, which consists
of a self-similar tiling of equilateral triangles. As a collective adaptive
mechanism, the routing is realized by a relay of cyclic message-ferries
corresponded to a concatenation of the triangle cycles and using some good
properties of the network structure. It is recoverable for local accidents in
the hierarchical network structure. Moreover, the design principle is
theoretically supported with a calculation method for the optimal service rates
of message-ferries derived from a tandem queue model for stochastic processes
on a chain of edges in the network. These results obtained from a combination
of complex network science and computer science will be useful for developing a
resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of
Collective Adaptive Systems) at The 9th IEEE International Conference on
SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201
Lagrangian Flow Network approach to an open flow model
Concepts and tools from network theory, the so-called Lagrangian Flow Network
framework, have been successfully used to obtain a coarse-grained description
of transport by closed fluid flows. Here we explore the application of this
methodology to open chaotic flows, and check it with numerical results for a
model open flow, namely a jet with a localized wave perturbation. We find that
network nodes with high values of out-degree and of finite-time entropy in the
forward-in-time direction identify the location of the chaotic saddle and its
stable manifold, whereas nodes with high in-degree and backwards finite-time
entropy highlight the location of the saddle and its unstable manifold. The
cyclic clustering coefficient, associated to the presence of periodic orbits,
takes non-vanishing values at the location of the saddle itself.Comment: 7 pages, 3 figures. To appear in European Physical Journal Special
Topics, Topical Issue on "Recent Advances in Nonlinear Dynamics and Complex
Structures: Fundamentals and Applications
Nonlinear prediction of Malaysian exchange rate with monetary fundamentals
This paper compares one-step-ahead out-of-sample predictions on Malaysian Ringgit-US Dollar exchange rate using the generalized regression neural network for a range of forecasting horizons from 1991M3 to 2008M8. We find that the monetary fundamentals are significant in explaining the dynamics of Malaysian exchange rate in a longer forecast horizon as the performance of monetary exchange rate models outperformed the random walk benchmark model. The results also revealed that Malaysian exchange rate market provides profitable short-term arbitrage opportunities with lagged observations, and the integration of autoregressive terms into the monetary exchange rate models enhanced the out-of-sample forecasting performance.Autoregressive, monetary model, neural network, random walk
Diffusion of Behavior and Equilibrium Properties in Network Games
Situations in which agentsâ choices depend on choices of those in close proximity, be it social or geographic, are ubiquitous. Selecting a new computer platform, signing a political petition, or even catching the flu are examples in which social interactions have a significant role. While some behaviors or states propagate and explode within the population (e.g., Windows OS, the HIV virus) others do not (e.g., certain computer viruses). Our goal in this paper is twofold. First, we provide a general dynamic model in which agentsâ choices depend on the underlying social network of connections. Second, we show the usefulness of the model in determining when a given behavior expands within a population or disappears as a function of the environmentâs fundamentals.
We study a framework in which agents face a choice between two actions, 0 and 1 (e.g., whether to pursue a certain level of education, switch to Linux OS, etc.). Agents are linked through a social network, and an agentâs payoffs from each action depend on the number of neighbors she has and her neighborsâ choices. The diffusion process is defined so that at each period, each agent best responds to the actions taken by her neighbors in the previous period, assuming that her neighbors follow the population distribution of actions (a mean-field approximation). Steady states correspond to equilibria of the static game. Under some simple conditions, equilibria take one of two forms. Some are stable, so that a slight perturbation to any such equilibrium would lead the diffusion process to converge back to that equilibrium point. Other equilibria are unstable, so that a slight change in the distribution of actions leads to a new distribution of actions and eventually to a stable steady state. We call such equilibria tipping points. We analyze how the environmentâs fundamentals (cost distribution, payoffs, and network structure) affect the set of equilibria, and characterize the adoption patterns within the network.
The paper relates to recent work on network games and network diffusion, including work by Stephen Morris (2000); Pastor-Satorras and Vespignani (2000); Mark E. J. Newman (2002); Dunia LĂłpez-Pintado (2004); Jackson and Brian W. Rogers (2007); Jackson and Yariv (2005); and Andrea Galeotti et al. (2005, henceforth GGJVY). Its contribution is in characterizing diffusion of strategic behavior and analyzing the stability properties of equilibria, and employing methods that allow us to make comparisons across general network structures and settings. Given that social networks differ substantially and systematically in structure across settings (e.g., ethnic groups, professions, etc.), understanding the implications of social structure on diffusion is an important undertaking for a diverse set of applications
Fundamentals of the network neutrality debates
The Network Neutrality debate is a complicated one because of the dramatic impact of networks, mainly the Internet, on peopleâs lives. Therefore, concepts like innovation, decentralized networks, social and political aspects need to be analyzed to have a better understanding of the fundamentals of the debate
- âŠ