理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到知识库 数学 Network相关记录55条 . 查询时间(0.884 秒)
The paper presents a novel hydraulic fracturing model for the characterization and simulation of the complex fracture network in shale gas reservoirs. We go beyond the existing method that uses planar...
Given a target variable and observational data, we propose a sequential learning approach for discovering direct cause and effect variables of the target under the causal network frame-work. In the ap...
We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the...
The inclusion-exclusion formula (IEF) is a fundamental tool for evaluating network reliability with known minimal paths or minimal cuts. However, the formula contains many pairs of terms which cancel....
Abstract: The rigorous linking of exact stochastic models to mean-field approximations is studied. Starting from the differential equation point of view the stochastic model is identified by its Kolmo...
Abstract: We propose a class of random scale-free spatial networks with nested community structures and analyze Reed-Frost epidemics with community related independent transmissions. We show that the ...
Synchrony is one of the most common dynamical states emerging on networks. The speed of convergence towards synchrony provides a fundamental collective time scale for synchronizing systems. Here we st...
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 ...
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...
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.
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.
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]...
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...
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...
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...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...