Minimum Fill-in is a fundamental and classical problem arising in sparse matrix computations. In terms of graphs it can be formulated as a problem of finding a triangulation of a given graph with the minimum number of edges. By the classical result of Rose, Tarjan, Lueker, and Ohtsuki from 1976, an inclusion minimal triangulation of a graph can be found in polynomial time but, as it was shown b...

Mine fill is the material placed underground to fill the voids created by mining excavations. It provides overall large scale ground stabilization while allowing localized pillar recovery. In addition to providing a working floor or back, mine fill has the potential to reduce subsidence and minimize dilution. Mine fill is essential to cut and fill, benching and sublevel stoping mining methods. ...

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 buuer space at the bottleneck router, causing large delays. In this paper we propose a simple scheme that modiies TCP Reno's congestion avoidance algorithm by throttling back the opening of the congesti...

A dual mechanical port machine (DMPM) is used as an electrically variable transmission (EVT) in hybrid electric vehicle (HEV). In the conventional HEV, this machine is replaced by a planetary gearbox and two electric machines and makes this structure simpler. This paper presents field oriented control (FOC) for DMPM. For HEV application, drive efficiency and wide operating speed range are impor...

This paper presents an exponentially stabilizing boundary control for the microvia fill process. The control accounts for the mass balance of the copper ions in the electrolyte and for the surface mass balance of the deposition-blocking additives, both modeled with a diffusion mass transfer model in a shape changing domain. With simulations based on real-world data, it is shown that by applying...