Dynamic bandwidth allocation for quality-of-service over Ethernet PONs

Ethernet-based passive optical network (EPON) technology is being considered as a promising solution for next-generation broadband access networks due to the convergence of low-cost Ethernet equipment and low-cost fiber infrastructures. A major feature for this new architecture is the use of a shared transmission media between all users; hence, medium access control arbitration mechanisms are essential for the successful implementation of EPON: i.e., to ensure a contention-free transmission and provide end users with equal access to the shared media. We propose to use the multipoint control protocol defined by the IEEE 802.3ah task force to arbitrate the transmission of different users, and we present different dynamic bandwidth allocation (DBA) algorithms to allocate bandwidths effectively and fairly between end users. These DBA algorithms are also augmented to support differentiated services, a crucial requirement for a converged broadband access network with heterogeneous traffic. We show that queueing delays under strict bandwidth allocation algorithms result in an unexpected behavior for certain traffic classes, and we suggest the use of DBA with appropriate local queue management to alleviate this inappropriate behavior. We conduct detailed simulation experiments to study the performance and validate the effectiveness of the proposed protocols.     

BATCH SEQUENCING

Consider the single machine scheduling problem where there are a number of part types to be processed. A part type is defined as follows: Two parts are of the same part type if the machine does not require a setup in between the processing of these parts. The problem investigated in this paper is to find a sequence of batches of parts (if there are any) where all the requirements for parts are met. A heuristic and an exact algorithm are developed, and computational analysis is performed to measure the performance of the heuristic. The time complexity function of the heuristic is O(n²), and the exact algorithm runs in polynomial time given a fixed upper bound on the number of setups.     

Sexualities, technologies, and the teaching of writing: A critical overview

In this introduction to a special issue of Computers and Composition, the authors critically review current literature on computer-assisted writing pedagogies that grapple with issues of sexuality. Although this body of work is small, it points to provocative ways to develop our students’ critical and rhetorical sensibilities about the constructions of sexuality in our culture. Further, such work innovatively addresses the place of networked communication technologies in the interrogation of such constructions. The authors conclude with both an introduction of the work in this special issue that addresses the intersection of sexuality studies and computer-assisted writing studies and with a call for additional work in this field.     

Determination of gas dispersion in vapor extraction of heavy oil and bitumen

In this work, a mathematical model is developed and simulated to determine gas dispersion along with solubility during the vapor extraction (Vapex) of live oil from a laboratory scale physical model. The physical model is a rectangular block of homogenous porous medium saturated with heavy oil and bitumen. At a given temperature and pressure, the block is initially exposed on its side to a solvent gas, which diffuses into the medium and gets absorbed. The absorption of gas reduces the viscosity of heavy oil and bitumen causing it to drain under gravity. The low-viscosity “live oil” is produced at the bottom of the porous block. The production of live oil with time is accompanied by the shrinkage of oil in the block as well as its increased exposure to gas from top. These phenomena of Vapex are described by the mathematical model, which is used to calculate live oil production with various values of gas solubility and dispersion. Their optimal values are determined for the vapor extraction of Cold Lake bitumen with butane by matching calculated live oil production with its experimental values published earlier.     

Specimen preparation and image processing and analysis techniques for automated quantification of concrete microcracks and voids

Specimen preparation and image processing/analysis techniques were developed for use in automated quantitative microstructural investigation of concrete, focusing on concrete microcracks and voids. Different specimen preparation techniques were developed for use in fluorescent and scanning electron microscopy (SEM) of concrete; then techniques produce a sharp contrast between microcracks/voids and the body of concrete. The image processing/analysis techniques developed specifically for use with concrete address the following usages: automatic threshold; development of intersecting microcracks/voids and connected voids; distinction of microcracks form voids based on geometric attributes; and noise filtration.     

A parametric interpolator with confined chord errors, acceleration and deceleration for NC machining

Parametric interpolation has many advantages over linear interpolation in machining curves. Real time parametric interpolation research so far has addressed achieving a uniform feed rate, confined chord errors and jerk limited trajectory planning. However, simultaneous consideration of confined chord errors that respect the acceleration and deceleration capabilities of the machine has not been attempted. In this paper, the offline detection of feed rate sensitive corners is proposed. The velocity profile in these zones is planned so that chord errors are satisfied while simultaneously accommodating the machine's acceleration and deceleration limits. Outside the zone of the feed rate sensitive corners, the feed rate is planned using the Taylor approximation. Simulation results indicate that the offline detection of feed rate sensitive corners improves parametric interpolation. For real time interpolation, the parametric curve information can be augmented with the detected feed rate sensitive corners that are stored in 2×2 matrices.     

A quantitative analysis of the effectiveness of laparascopy and endoscopy virtual reality simulators

The increasing use of virtual reality (VR) simulators in surgical training makes it imperative that definitive studies be performed to assess their training effectiveness. Indeed in this paper we report the meta-analysis of the efficacy of virtual reality simulators in (1) the transference of skills from the simulator training environment to the operating room and (2) their ability to discriminate between the experience levels of its users. The task completion time and the error score were the two study outcomes collated and analyzed in this meta-analysis. Sixteen studies were identified from a computer-based literature search (1996-2004). The meta-analysis of the random-effects model (because of the heterogeneity of the data) revealed that training on virtual reality simulators did lessen the time taken to complete a given surgical task as also clearly differentiate between the experienced and the novice trainees. Meta-analytic studies such as the one reported here would be very helpful in the planning and setting up of surgical training programs and for the establishment of reference ‘learning curves’ for a specific simulator and surgical task. If any such programs already exist they can then indicate the improvements to be made in the simulator used such as providing for more variety in their case scenarios based on the state and/or rate of learning of the trainee.     

Determination of optimal feedback terminal controllers for general boundary conditions using generating functions

Given a nonlinear system and a performance index to be minimized, we present a general approach to expressing the finite time optimal feedback control law applicable to different types of boundary conditions. Starting from the necessary conditions for optimality represented by a Hamiltonian system, we solve the Hamilton-Jacobi equation for a generating function for a specific canonical transformation. This enables us to obtain the optimal feedback control for fundamentally different sets of boundary conditions only using a series of algebraic manipulations and partial differentiations. Furthermore, the proposed approach reveals an insight that the optimal cost functions for a given dynamical system can be decomposed into a single generating function that is only a function of the dynamics plus a term representing the boundary conditions. This result is formalized as a theorem. The whole procedure provides an advantage over methods rooted in dynamic programming, which require one to solve the Hamilton-Jacobi-Bellman equation repetitively for each type of boundary condition. The cost of this favorable versatility is doubling the dimension of the partial differential equation to be solved.