1,721,256 research outputs found
Construction of a necroptosis-related lncRNA signature to predict the prognosis and immune microenvironment of IDH1 wild-type GBM
No full text<p><a href="https://zenodo.org/api/files/3b61d9b7-5c0c-4f49-acae-5ec3c5294b1e/Original%20data-Construction%20of%20a%20necroptosis-related%20lncRNA%20signature.zip">Original data</a>:Construction of a necroptosis-related lncRNA signature to predict the prognosis and immune microenvironment of IDH1 wild-type GBM.</p>
Enhancing Differentiable Architecture Search: A Study on Small Number of Cell Blocks in the Search Stage, and Important Branches-based Cells Selection
No full textIn recent years, differentiable neural architecture search (DARTS) method has attracted a lot of attention. This method has been proposed to reduce the search cost incurred when using reinforcement learning and evolutionary search strategies. Although several studies have been carried out to improve its performance, most of these existing methods share some common limitations: They use a stack of five to eight cells during the search process to find only two distinct cells. The usage of several cells significantly increases the computation cost of the search process. In this paper, to reduce the search time, we propose to decouple the structure of the architecture used during the search of optimal pair of cells from the final architecture by using only one normal and one reduction cells search architecture during the search stage and the same architecture structure as DARTS during the evaluation stage. We also address the stability and performance drop trade-off by inserting additional residual connection in parallel with every normal cell block. Additionally, adding A convolution skip connection to the evaluation architecture has been shown to improve the performance. Finally, we investigated the effect of searching optimal cell's operation from highly performing branches in the internal structure of every cell. Extensive experiments showed that the proposed method significantly reduces the search cost while achieving promising results on ImageNet, CIFAR-10, and CIFAR-100 compared to existing state-of-the-art methods on DARTS search space
Probabilistic burstiness-curve-based connection control for real-time multimedia services in ATM networks
No full textIn this paper we present a method to establish realtime connections with guaranteed quality of service (QOS), based on a per-session probabilistic burstiness curve (PBC), Under two distinctive service disciplines, rate proportional processor sharing and fixed rate processor sharing, we derive useful probabilistic bounds on per-session end-to-end loss which is caused by either buffer overflow in the path or excessive delay to the destination, One remarkable feature of the bounding solutions is that they are solely determined by the PBC of each session itself, independent of the network environment and other connections, To improve network resource utilization, our method is extended to allow statistical sharing of buffer resources, The admission control scheme presented in this paper has a great flexibility in connection management since bandwidth and buffer allocations can be adaptively adjusted among incoming and existing sessions according to present network resource availability. We also present a novel method to compute the PBC of multimedia traffic based on the measurement of two important statistics (rate histogram and power spectrum), Our study of MPEG/JPEG video sequences reveals the fundamental interrelationship among the PBC, the traffic statistics, and the QOS guarantee, and also provides many engineering aspects of the PBC approach to real-time multimedia services in ATM networks.
Deterministic packet marking for max-min flow control
No full textThis letter proposes a deterministic packet marking scheme that estimates the maximum link price on a communication path. The proposed scheme is simple and W-compatible because it uses two-bit Explicit Congestion Notification (ECN) field and IP identification (IPid) field in the standard IP header for the estimation. Through simulations using real IP packet traces, we show that our scheme indeed works as designed with small estimation errors, and thus enables existing max-min flow control algorithms to serve their purpose without the need of separate out-of-band control packets to carry link prices.
A distributed utility max-min flow control algorithm
No full textA fair allocation of utility (application-layer performance) is essential in providing QoS (Quality of Service) guarantee. However, there have been few researches in the literature of utility-fair network resource allocation scheme. In this paper, we propose a distributed utility max-min flow control algorithm which accommodates application diversity in that it does not require the concavity of utility functions, and is scalable in that it does not require any per-flow operation in the network. The algorithm is proved to be convergent under the assumption that there exists a single bottleneck link and the communication delay between any two links in the network is bounded. Although the convergence of the algorithm is analyzed only for the case of a single bottleneck link, we show through simulations that the proposed algorithm works as designed for the case of multiple bottleneck links as well. (c) 2005 Elsevier B.V. All rights reserved.
TCP-friendly flow control of wireless multimedia using ECN marking
No full textIn a wireless network packet losses can be caused not only by network congestion but also by unreliable error-prone wireless links. Therefore, flow control schemes which use packet loss as a congestion measure cannot be directly applicable to a wireless network because there is no way to distinguish congestion losses from wireless losses. In this paper, we extend the so-called TCP-friendly flow control scheme, which was originally developed for the flow control of multimedia flows in a wired IP network environment, to a wireless environment. The main idea behind our scheme is that by using explicit congestion notification (ECN) marking in conjunction with random early detection (RED) queue management scheme intelligently, it is possible that not only the degree of network congestion is notified to multimedia sources explicitly in the form of ECN-marked packet probability but also wireless losses are hidden from multimedia sources. We calculate TCP-friendly rate based on ECN-marked packet probability instead of packet loss probability, thereby effectively eliminating the effect of wireless losses in flow control and thus preventing throughput degradation of multimedia flows travelling through wireless links. In addition, we refine the well-known TCP throughput model which establishes TCP-friendliness of multimedia flows in a way that the refined model provides more accurate throughput estimate of a TCP flow particularly when the number of TCP flows sharing a bottleneck link increases. Through extensive simulations, we show that the proposed scheme indeed improves the quality of the delivered video significantly while maintaining TCP-friendliness in a wireless environment for the case of wireless MPEG-4 video. (C) 2004 Elsevier B.V. All rights reserved.
DESIGN OF A CLOS GUIDANCE LAW VIA FEEDBACK LINEARIZATION
No full textThis paper describes an application of the recently developed feedback linearization technique to the design of a new command to line-of-sight (CLOS) guidance law for short-range surface-to-air missiles. The key idea Hes in converting the three-dimensional CLOS guidance problem to the tracking problem of a time-varying nonlinear system. Our result may shed new light on the role of the feedforward acceleration terms used in the conventional CLOS guidance laws. Through computer simulation, we investigate the effect of the dynamics or the ground tracker and the autopilot on the guidance performance of our new CLOS guidance law.
- …
