搜索结果: 106-120 共查到“知识库 理学 Network”相关记录300条 . 查询时间(0.054 秒)
Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows
Compress-and-Forward Scheme Relay Network Approximate Optimality Connection Algebraic Flows
2011/1/17
We study a wireless relay network, with a single source and a single destination.Our main result is to show that an appropriate compress-and-forward scheme supports essentially the same reliable data ...
SNEED: Enhancing Network Security Services Using Network Coding and Joint Capacity
Network Security Services Network Coding Joint Capacity
2011/3/3
Traditional network security protocols depend mainly on developing cryptographic schemes and on using biometric methods. These have led to several network security protocols that are unbreakable based...
On meager function spaces, network character and meager convergence in topological spaces
network character meager convergent sequence meager filter meager space
2011/1/20
For a non-isolated point x of a topological space X let nw (x) be the smallest cardinality of a family N of infinite subsets of X such that each neighborhood O(x) X of x contains a set N 2 N.
Multiple tunnel effect for dispersive waves on a star-shaped network: an explicit formula for the spectral representation
networks spectral theory resolvent generalized eigenfunctions functional calculus
2011/1/21
We consider the Klein-Gordon equation on a star-shaped network composed of n half-axes connected at their origins. We add a potential which is constant but different on each branch.
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols
Quantum Network Coding Schemes Classical Nonlinear Protocols
2011/3/3
The k-pair problem in network coding theory asks to send k messages simultaneously between k
source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622–633]...
Delay-Aware Cross-Layer Design for Network Utility Maximization in Multi-hop Networks
Delay-Aware Cross-Layer Network Utility Maximization Multi-hop Networks
2011/1/19
We investigate the problem of designing delay-aware joint flow control, routing, and scheduling algorithms in general multi-hop networks for maximizing network utilization. Since
the end-to-end delay...
Network reconstruction from random phase-resetting
Network reconstruction random phase-resetting
2010/12/28
We propose a novel method of reconstructing the topology and interaction functions for a general oscillator network. An ensemble of initial phases and the corresponding instantaneous frequencies is co...
A New Noncoherent Decoder for Wireless Network Coding
New Noncoherent Decoder Wireless Network Coding
2011/3/1
This work deals with the decoding aspect of wireless network coding in the canonical two-way relay channel where two senders exchange messages via a common relay and they receive the mixture of two me...
Network MIMO with Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation and Reduced-Complexity Scheduling
Linear Zero-Forcing Beamforming Large System Analysis Impact of Channel Estimation Reduced-Complexity Scheduling
2011/2/21
We consider the downlink of a multi-cell system with multi-antenna base stations and single-antenna user terminals, arbitrary base station cooperation clusters, distance-dependent propagation pathloss...
Towards a Better Understanding of Large Scale Network Models
Better Understanding Large Scale Network Models
2011/3/4
Connectivity and capacity are two fundamental properties of wireless multi-hop networks. The scalability of these properties has been a primary concern for which asymptotic analysis is a useful tool.
Multiple-access Network Information-flow and Correction Codes
Multiple-access Network Information-flow Correction Codes
2011/1/17
This work considers the multiple-access multicast error-correction scenario over a packetized network with z malicious edge adversaries.
We examine the use of the mathematics of category theory in the description of quantum states
by tensor networks. This approach enables the development of a categorical framework allowing a
solution...
Network topology and collapse of collective stable chaos
Network topology collapse of collective stable chaos
2010/12/28
Collective stable chaos consists of the persistence of disordered patterns in dynamical spatiotem-poral systems possessing a negative maximum Lyapunov exponent. We analyze the role of the topology of ...
A new algorithm for minimum path in a network
Network optimization Shortest path Minimum path Path labeling algorithm
2010/11/1
A new algorithm namely, path labeling algorithm for finding the minimum path from a specified node to other nodes in a network having crisp or imprecise weights is introduced. The proposed algorithm i...
Enhancing neural-network performance via assortativity
Enhancing neural-network performance via assortativity
2011/1/5
The performance of attractor neural networks has been shown to depend crucially on the heterogeneity of the underlying topology. We take this analysis a step further by examining the effect of degree-...