ROLE OF COMPOSITION ON THE VISCOSITY AND SHEAR STRESS TEMPERATURE BEHAVIOUR OF SOME LUBE OIL BASE STOCKS

Lubricating oil base stocks differ greatly in their chemical composition and consequently in their physical properties and applications. Influence of waxes and various hydrocarbon type constituents viz saturates and aromatic components on the viscosity and shear stress as a function of temperature in different lube oil base stocks has been studied in the present paper.     

Increasing channel capacity and range on urban optical analogAM-VSB CATV systems

It is often desirable to increase the capacity and the covered distance in lightwave TV systems. For doing so, the conventional CATV channel set-usually placed within the 50 to 550 MHz frequency range-may be up-shifted, by means of a subcarrier, to a low microwave frequency range, typically located at 2 GHz. Next, this shifted spectrum directly modulates a laser diode, in the analog AM mode. It is shown that this up-shift procedure may dislodge a number of nonlinear distortion components from the useful TV band. Consequently, the system effective optical modulation index may be increased, allowing for an expansion in the channel capacity or covered distance. This enlarged capacity or distance may compensate for the modest price increase concerning the up-shift equipment. All the performance evaluations presented here were carried out with a rigorous numerical model, and assuming the lightwave systems used the economical AM-VSB format     

Digital dancing

The author considers how a dance community has evolved in cyberspace. The emergence of the World Wide Web has led to an upsurge of creative exploration by dance artists as they discover, in ever-increasing numbers, this new technology's potential. The pervasiveness of information and communications technologies has produced new levels of thought, new concepts, and new types of human interaction. The author discusses the Cassandra Project performance which uses a videoconferencing system over the Internet. Computer networks connecting performers in real time with other performers and audiences at remote sites allow for text, dance and music to serve as improvisational material during the performance     

Effect of preparation method on the dispersion and activity of V2O5–Al2O3 catalysts

Al2O3-supported 12 wt% V2O5 catalysts were prepared by physically grinding both the oxides (solid–solid wetting) and by wet impregnation techniques. The physical mixtures (PM) were treated under two different conditions – calcination in the presence of dry oxygen and wet oxygen. The catalysts were characterized by x-ray diffraction, scanning electron microscopy, electron spin resonance and oxygen and carbon dioxide chemisorptions. Vanadia dispersion of the physical mixture calcined in the presence of wet oxygen was found to be very similar to that of the V2O5/Al2O3 catalyst prepared by the standard impregnation method. Methanol partial oxidation activities of these catalysts were also comparable. This revised version was published online in November 2006 with corrections to the Cover Date.     

Efficient performance analysis of asynchronous cellular CDMA overRayleigh-fading channels

The bit error rate (BER) analysis of a direct-sequence code-division multiple-access (DS-CDMA) cellular system over a Rayleigh-fading channel often results in complicated expressions even though the Gaussian approximation is applied. A combined probability density function (pdf) approach for the forward link and a mean-method technique for the reverse link are proposed to significantly reduce the computational complexity. The simplified BER expressions are derived and yield accurate results     

Performance analysis of an improved MMSE multiuser receiver formismatched delay channels

Motivated by the fact that time delays in a practical direct-sequence code-division multiple-access (DS-CDMA) system can never be perfectly estimated, an improved minimum-mean squared-error (MMSE)-based receiver is proposed and analyzed. Via the simple assumption of a probability distribution for the delay estimation errors, the proposed receiver can achieve a performance superior to that of the conventional MMSE (CMMSE) receiver. The performances of this improved receiver and the CMMSE receiver are compared in terms of the mean squared error (MSE), probability of error, and asymptotic multiuser efficiency (AME). As the original definition of AME does not consider mismatched channels, the behavior of three single-user receivers bearing imperfect delay estimation is also investigated. These single-user receivers are employed to define a more appropriate AME. Finally, an efficient update mechanism to accommodate dynamic channel statistics, and thus practical implementation, is proposed     

Buffering packetised data: an examination of the crossover effect

Buffer analysis has traditionally relied heavily on the use of traffic models with short range (exponentially decaying) autocorrelation, e.g. Poisson and Markov modulated Poisson processes. Recent literature has suggested the presence of traffic with slowly (hyperbolically) decaying autocorrelation functions; these sources collectively and individually seem to be exhibiting the phenomenon of long range dependence (LRD). Furthermore, it has been claimed that this sort of traffic may exhibit behaviour, when buffered, that is advantageous in that a smaller buffer may be required than would be the case with non-LRD traffic. This phenomenon has been named the crossover effect, and the authors quantify its relevance to ATM networking, using simulation studies of a homogenous mix of chaotic sources. These show that there is a crossover effect, but the key finding is that this effect is much nearer to a buffer length of zero than was predicted by previous theoretical studies, actually occurring at a value so low that it has no practical significance     

A Markovian Extension of Valiant′s Learning Model

An "Occam algorithm" learning model maintains a tentative hypothesis consistent with past observations and, when a new observation is inconsistent with the current hypothesis, updates to the next-simplest hypothesis consistent with all observations. In previous work, observations were assumed to be stochastically independent. This paper initiates study of such models under weaker Markovian assumptions on the observations, In the special case where the sequence of hypotheses satisfies a monotonicity condition, it is shown that the number of mistakes in classifying the first t observations is O(√t log 1/π_i), where π_i is the stationary probability of the initial state, i, of the Markov chain.     

On Deciding Readiness and Failure Equivalences for Processes

In this paper, we study the complexity of deciding readiness and failure equivalences for finite state processes and recursively defined processes specified by normed context-free grammars (CFGs) in Greibach normal form (GNF). The results are as follows: (1) Readiness and failure equivalences for processes specified by normed GNF CFGs are both undecidable. For this class of processes, the regularity problem with respect to failure or readiness equivalence is also undecidable. Moreover, all these undecidability results hold even for locally unary processes. In the unary case, these problems become decidable. In fact, they are Π^p₂-complete, We also show that with respect to bisimulation equivalence, the regularity for processes specified by normed GNF CFGs is NL-complete. (2) Readiness and failure equivalences for finite state processes are PSPACE-complete. This holds even for locally unary finite state processes. These two equivalences are co-NP-complete for unary finite state processes. Further, for acyclic finite state processes, readiness and failure equivalences are co-NP-complete and they are NL-complete in the unary case. (3) For finite tree processes, we show that finite trace, readiness, and failure equivalences are all L-complete. Further, the results remain true for the unary case. Our results provide a complete characterization of the computational complexity of deciding readiness and failure equivalences for several important classes of processes.