Utilization of self-injection Fabry–Perot laser diode for long-reach WDM-PON

In this investigation we propose and demonstrate a wavelength widely tunable laser source employing a self-injected Fabry–Perot laser diode (FP-LD) for long-reach wavelength-division-multiplexed passive optical network (WDM-PON). By using a tunable bandpass filter and an optical circulator inside the gain cavity, a stable and single-longitudinal-mode (SLM) laser output is achieved. Besides, the proposed laser sources are directly modulated at 2.5 Gb/s for both downlink and uplink transmissions of 85 km single mode fiber (SMF) in PON without dispersion compensation.     

Scheduled WiFi using distributed contention in WLANs: algorithms,experiments, and case-studies

The ubiquitous adoption of WiFi introduces large diversity in types of application requirements and topological characteristics. Consequently, considerable attention is being devoted to making WiFi networks controllable without compromising their scalability. However, the main MAC protocol of WiFi, distributed coordination function (DCF), is a contention-based protocol using random backoff. Thus, operating under DCF, the access of channel is hard to control and nonpredictable. In order to provide controllability of channel access in WiFi, we propose Rhythm, a MAC protocol that achieves scheduled WiFi efficiently using distributed contention. By achieving scheduled WiFi, channel access can be controlled by manipulating the schedule decision. We evaluate the performance of Rhythm through analysis, experiments, and case-studies.     

Designing the morphology of ceria particles by precursor complexes

Ceria-based materials are widely used as catalysts, catalyst supports and electrolytes in many industrial applications. The morphological requirements of ceria particles vary depending on their applications. Here we show that complex morphologies of ceria particles can be achieved by using precursor complexes in the spray pyrolysis (SP) method. Three precursor complexes have been investigated: the complex of cerium acetate hydrate (CeA) and cerium nitrate hydrate (CeN); CeA and cerium ammonium nitrate (CeAN); and CeN and CeAN. Our results suggest that the morphological formation mechanism is highly correlated with the factors of precursor solubilities, solvent evaporation rates and precursor melting temperatures.     

Finite-horizon scheduling of radar dwells with online template construction

Timing constraints for radar tasks are usually specified in terms of the minimum and maximum temporal distance between successive radar dwells. We utilize the idea of feasible intervals for dealing with the temporal distance constraints. In order to increase the freedom that the scheduler can offer a high-level resource manager, we introduce a technique for nesting and interleaving dwells online while accounting for the energy constraint that radar systems need to satisfy. Further, in radar systems, the task set changes frequently and we advocate the use of finite horizon scheduling in order to avoid the pessimism inherent in schedulers that assume a task will execute forever. The combination of feasible intervals and online dwell packing allows modular schedule updates whereby portions of a schedule can be altered without affecting the entire schedule, hence reducing the complexity of the scheduler. Through extensive simulations we validate our claims of providing greater scheduling flexibility without compromising on performance when compared with earlier work based on templates constructed offline. We also evaluate the impact of two parameters in our scheduling approach: the template length (or the extent of dwell nesting and interleaving) and the length of the finite horizon. Sathish Gopalakrishnan is a visting scholar in the Department of Computer Science, University of Illinois at Urbana-Champaign, where he defended his Ph.D. thesis in December 2005. He received an M.S. in Applied Mathematics from the University of Illinois in 2004 and a B.E. in Computer Science and Engineering from the University of Madras in 1999. Sathish’s research interests concern real-time and embedded systems, and the design of large-scale reliable systems. He received the best student paper award for his work on radar dwell scheduling at the Real-Time Systems Symposium 2004. Marco Caccamo graduated in computer engineering from the University of Pisa in 1997 and received the Ph.D. degree in computer engineering from the Scuola Superiore S. Anna in 2002. He is an Assistant Professor of the Department of Computer Science at the University of Illinois. His research interests include real-time operating systems, real-time scheduling and resource management, wireless sensor networks, and quality of service control in next generation digital infrastructures. He is recipient of the NSF CAREER Award (2003). He is a member of ACM and IEEE. Chi-Sheng Shih is currently an assistant professor at the Graduate Institute of Networking and Multimedia and Department of Computer Science and Information Engineering at National Taiwan University since February 2004. He received the B.S. in Engineering Science and M.S. in Computer Science from National Cheng Kung University in 1993 and 1995, respectively. In 2003, he received his Ph.D. in Computer Science from the University of Illinois at Urbana-Champaign. His main research interests are embedded systems, hardware/software codesign, real-time systems, and database systems. Specifically, his main research interests focus on real-time operating systems, real-time scheduling theory, embedded software, and software/hardware co-design for system-on-a-chip. Chang-Gun Lee received the B.S., M.S. and Ph.D. degrees in computer engineering from Seoul National University, Korea, in 1991, 1993 and 1998, respectively. He is currently an Assistant Professor in the Department of Electrical Engineering, Ohio State University, Columbus. Previously, he was a Research Scientist in the Department of Computer Science, University of Illinois at Urbana-Champaign from March 2000 to July 2002 and a Research Engineer in the Advanced Telecomm. Research Lab., LG Information & Communications, Ltd. from March 1998 to February 2000. His current research interests include real-time systems, complex embedded systems, QoS management, and wireless ad-hoc networks. Chang-Gun Lee is a member of the IEEE Computer Society. Lui Sha graduated with the Ph.D. degree from Carnegie-Mellon University in 1985. He was a Member and then a Senior Member of Technical Staff at Software Engineering Institute (SEI) from 1986 to 1998. Since Fall 1998, he has been a Professor of Computer Science at the University of Illinois at Urbana Champaign, and a Visiting Scientist of the SEI. He was the Chair of IEEE Real Time Systems Technical Committee from 1999 to 2000, and has served on its Executive Committee since 2001. He was a member of National Academy of Science’s study group on Software Dependability and Certification from 2004 to 2005, and is an IEEE Distinguished Visitor (2005 to 2007). Lui Sha is a Fellow of the IEEE and the ACM.     

LTPS circuit integration for system‐on‐glass LCDs

Abstract— A 3.5‐in. QVGA‐formatted driving‐circuit fully integrated LCD has been developed using low‐temperature poly‐Si (LTPS) technology. This display module, in which no external ICs are required, integrates all the driving circuits for a six‐bit RGB digital interface with an LTPS device called a “FASt LDD TFT” and achieves a high‐quality image, narrow frame width, and low power consumption. The LTPS process, device, and circuit technologies developed for system‐on‐glass LCD discussed. The development phase of LTPS circuit integration for system‐on‐glass LCDs is also reviewed.     

The effect of previous experience with information and communication technologies on performance in a Web-based learning program

The purpose of the present study was to analyze the influence of previous experience with information and communication technology (ICT) tools on performance in a Web-based course. Online activity was logged. Specifically, total activities carried out and five online activity measures were computed. One hundred and twenty university undergraduates participated in a Web-based course designed to train personnel trainers to apply ICT in training processes. Before starting the study, participants filled out a questionnaire designed to assess their frequency using ICT tools. At the end of the study, participants were asked to complete a questionnaire in order to collect information about their learning experience and their assessment of the virtual environment. Results suggest that previous experience significantly influences how people organize their online activities, but not the quantity of work carried out. Participants with more experience in the use of Internet tools, organize their work in the virtual classroom using less time and visiting fewer pages in each session. Previous experience did not influence the assessment of the virtual classroom as a training tool, since participants with both high and low previous experience gave extremely positive feedback on their Web-based learning experience.     

Piezoelectric ceramic disks with thickness-graded material properties

A system of two-dimensional, first-order equations for electroded piezoelectric crystal plates with general symmetry and thickness-graded material properties recently was deduced from the three-dimensional equations of linear piezoelectricity. These equations are simplified for the two limiting cases of thickness-graded piezoelectric properties, i.e., the homogeneous plate and bimorph of piezoelectric ceramics. Closed-form solutions are obtained from these reduced equations for the flexural and thickness-shear vibrations and static response of bimorph disks as well as for the extensional and thickness-stretch vibrations of homogeneous disks. Frequency spectra and modes are computed and examined. Resonance frequencies for both homogeneous and bimorph disks of PZT-857 are computed and measured. The comparison of the results shows that the agreement is close.     

A New Class of Depth-Size Optimal Parallel Prefix Circuits

Given n values x₁, x₂, ... ,x_n and an associative binary operation o, the prefix problem is to compute x₁ox₂o··· ox_i, 1in. Many combinational circuits for solving the prefix problem, called prefix circuits, have been designed. It has been proved that the size s(D(n)) and the depth d(D(n)) of an n-input prefix circuit D(n) satisfy the inequality d(D(n))+s(D(n))2n–2; thus, a prefix circuit is depth-size optimal if d(D(n))+s(D(n))=2n–2. In this paper, we construct a new depth-size optimal prefix circuit SL(n). In addition, we can build depth-size optimal prefix circuits whose depth can be any integer between d(SL(n)) and n–1. SL(n) has the same maximum fan-out lgn+1 as Snir's SN(n), but the depth of SL(n) is smaller; thus, SL(n) is faster. Compared with another optimal prefix circuit LYD(n), d(LYD(n))+2d(SL(n))d(LYD(n)). However, LYD(n) may have a fan-out of at most 2 lgn–2, and the fan-out of LYD(n) is greater than that of SL(n) for almost all n12. Because an operation node with greater fan-out occupies more chip area and is slower in VLSI implementation, in most cases, SL(n) needs less area and may be faster than LYD(n). Moreover, it is much easier to design SL(n) than LYD(n).     

Sentences over Integral Domains and Their Computational Complexities

LetRbe a Hilbertian domain and letKbe its fraction field. Letψ(x₁, …, x_n, y) be a quantifier free arithmetical formula overR. We may also takeψ(x₁, …, x_n, y) to be an arithmetical formula overK[x₁, …, x_n] and write it asψ(y). In this paper we show that ifRhas enough non-units and x₁…x_n y ψ(x₁, …, x_n, y), called an ⁿ  sentence, is true inR, then y ψ(y) is true inK[x₁, …, x_n]. Also, ifR=K[T], whereKis an infinite integral domain andx₁…x_n y ψ(x₁, …, x_n, y)is true inR, then y ψ(y) is true inR[x₁, …, x_n]. These results are applied to find the upper and lower bounds of the time complexities of various decision problems on diophantine equations with parameters and arithmetical sentences. Some of the results are: 1. The decision problem of sentences and diophantine equations with parameters over the ring of integers of a global field are co-NP-complete. 2. The decision problem of sentences over the ring of integers of a global field is NP-complete. 3. LetKbe an infinite domain, the time complexities of the decision problems of equations with parameters and sentences over the polynomial ringK[t] are polynomial time reducible to factoring polynomials overK. 4. The decision problem of sentences over all algebraic integer rings is in P. 5. The decision problem of sentences over all integral domains with characteristic 0 is in P. 6. The time complexity of the decision problem of sentences over all integral domains is polynomial time reducible to factoring integers overZand factoring polynomials over finite fields.