Exact and Heuristic Methods for Network Completion for Time-Varying Genetic Networks
نویسندگان
چکیده
منابع مشابه
Exact and Heuristic Methods for Network Completion for Time-Varying Genetic Networks
Robustness in biological networks can be regarded as an important feature of living systems. A system maintains its functions against internal and external perturbations, leading to topological changes in the network with varying delays. To understand the flexibility of biological networks, we propose a novel approach to analyze time-dependent networks, based on the framework of network complet...
متن کاملFuzzy completion time for alternative stochastic networks
In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...
متن کاملfuzzy completion time for alternative stochastic networks
in this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. in other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. first, an analytical approach is proposed to simplify the structure of network. then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (tfn). this paper com...
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولOn Polynomial Time Methods for Exact Low Rank Tensor Completion
In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. We show that a gradient descent algorithm with initial value obtained from a spectral method can, in particular , reconstruct a d × d × d tensor of multilinear ranks (r, r, r) with high probability from as few as O(r 7/2 d 3/2 log 7/2 d + r 7 d log 6 d) e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioMed Research International
سال: 2014
ISSN: 2314-6133,2314-6141
DOI: 10.1155/2014/684014