Revisiting the need for formal education in visualization.

Defining visualization education is still a work in progress. Visualization education is not just a subject within computer science. Computer scientists are not always the appropriate choice to teach visualization courses on their own. Visualization is not just mastering a set of concepts but acquiring skills. Student should learn by doing, either using one tool or a variety of tools, depending on the course's focus.     

Optimal solutions for a dynamic bandwidth allocation scheme in high-speed networks

In this paper, we investigate the problem of determining the optimal bandwidth allocation for a Dynamic Bandwidth Allocation Scheme (DBAS). The objective is to minimize the total amount of bandwidth required to satisfy the Quality of Service (QoS) requirements of all traffic streams. It is shown that when the performance functions satisfy a certain number of conditions, there exists a unique optimal bandwidth allocation such that, for each traffic stream, either its QoS is just satisfied or its QoS is over-satisfied and it is allocated zero bandwidth. Such an allocation is said to be efficient. It is also shown that there exists a unique efficient allocation in the entire feasible region. An iterative algorithm is developed to compute the efficient allocation employing its special properties. Numerical examples are presented to demonstrate how the algorithm works. Future extensions of this work are also discussed.Partially supported by NSERC of Canada through grants OGP14020 and STRIN-200.     

Reliability and performance analysis of time – space – time switching networks with multiple separated space switches

Since electronic switching systems usually require very strict reliability requirements as well as good performance objectives, we need to jointly analyse the performance and reliability of switching systems. In this paper, we compare conventional time–space–time switches with single space switches with those with multiple separated space switches, from the viewpoints of reliability and performance. We consider time–space–time switching networks which consist of N incoming time switches, i.e. one NxN space switch, two (N/2)x(N/2) space switches, and four (N/4)x(N/4) space switches. We introduce a Markov reliability model to study the effect of failures and analyse the reliability and performance of three different types of switching networks in terms of average blocking probability and the mean time to unreliable operation, as we vary the offered traffic. As a result, T–S–T switching networks with multiple separated space switches exhibit better performance and reliability than those with single space switches.     

Self-aligned offset gated poly-Si TFTs with a floating sub-gate

We have fabricated a self-aligned offset-gated poly-Si thin film transistor (TFT) by employing a novel photoresist reflow process. The gate structure of the new device is consisted of two unique patterns: A main-gate and a sub-gate. The new fabrication method extends the gate-oxide over the offset region. With the assistance of the sub-gate and reflowed photoresist a self-aligned offset region is successfully obtained due to the offset oxide acting as an implantation mask. The poly-Si TFT with symmetrical offsets is easily fabricated and the new method does not require any additional offset mask step. Compared with the misaligned offset gated poly-Si TFTs, excellent symmetric electrical characteristics are obtained