The main goal of a congestion avoidance algorithm is to maximize throughput and minimize delay (Jain & Ramakrishnan 1988). While TCP Reno achieves high throughput, it tends to consume all of the bu er space at the bottleneck router, causing large delays. In this paper we propose a simple scheme that modi es TCP Reno's congestion avoidance algorithm by throttling back the opening of the congesti...

The bottleneck in a production-inventory network is commonly taken to be the facility that most limits flow through the network and thus the most highly utilized facility. A further connotation of “bottleneck,” however, is the facility that most constrains system-wide performance or the facility at which additional resources would have the greatest impact. Adopting this broader sense of the ter...

This paper presents an algorithm for nding parallel elimination orders for Gaussian elimination Viewing a system of equations as a graph the algorithm can be applied directly to interval graphs and chordal graphs For general graphs the algorithm can be used to paral lelize the order produced by some other heuristic such as minimum degree In this case the algorithm is ap plied to the chordal com...

In this paper, we analyzed parasitic coupling capacitance coming from dummy metal fill and its impact on timing. Based on the modeling, we proposed two approaches to minimize the timing impact from dummy metal fill. The first approach applies more spacing between critical nets and metal fill, while the second approach leverages the shielding effects of reference nets. Experimental results show ...

Recent advances in polymer solar cell (PSC) performance have resulted from compressing the bandgap to enhance the short-circuit current while lowering the highest occupied molecular orbital to increase the open-circuit voltage. Nevertheless, PSC power conversion efficiencies are still constrained by low fill factors, typically below 70%. Here, we report PSCs with exceptionally high fill factors...

The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + knm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fillin in time O(2O( √ k log k) + knm). ...

A typical first step of a direct solver for linear system Mx = b is reordering of symmetric matrix M to improve execution time and space requirements of the solution process. In this work, we propose a novel nesteddissection-based ordering approach that utilizes hypergraph partitioning. Our approach is based on formulation of graph partitioning by vertex separator (GPVS) problem as a hypergraph...

an important goal in endodontic treatment. To achieve this goal, the root canal filling must seal the pulp space both apically and laterally to prevent further apical irritation from incomplete elimination of bacterial products.1 In the past, the adequacy of root canal filling procedure was primarily based on its vertical appearance on the dental radiograph and whether the material had reached ...

the evaluation of the edge effects of forest roads on ecosystem is very useful to understand changes from forest road. with this regard, in this research the effect of main forest road construction on regeneration and biodiversity of established trees in edge of forest road was investigated at 35 m distance into forest area. an existing 10 years old road segment, with same physiographic propert...