Ozonation of CI Reactive Black 5 using rotating packed bed and stirred tank reactor

This study investigates the ozonation of CI Reactive Black 5 (RB5) by using the rotating packed bed (RPB) and completely stirred tank reactor (CSTR) as ozone contactors. The RPB, which provides high gravitational force by adjusting the rotational speed, was employed as a novel ozone contactor. The same ozone dosage was separately introduced into either the RPB or the CSTR for the investigation, while the experimental solution was continuously circulated within the apparatus consisting of the RPB and CSTR. The decolorization and mineralization efficiencies of RB5 in the course of ozonation are compared for these two methods. Moreover, the dissolved and off‐gas ozone concentrations were simultaneously monitored for the further analysis. As a result, the ozone mass transfer rate per unit volume of the RPB was significantly higher because of its higher mass transfer coefficient and gas–liquid concentration driving force. Furthermore, ozonation kinetics was found to be independent of the gravitational magnitude of an ozone gas–liquid contactor. Therefore, the results suggest employing RPBs as ozone‐contacting devices with the advantage of volume reduction. The experimental results, which can be used for further modeling of the ozonation process in the RPB, also show the requirement of correct design for the RPB. Consequently, the present study is useful for the understanding of practical application of RPBs. Copyright © 2004 Society of Chemical Industry     

The maximum bit rates of soliton communication systems with lumpedamplifiers and filters in different distances

The maximum bit rate of a soliton communication system with lumped amplifiers and optical filters is considered. When the dispersion of the fiber varies from one amplifier spacing to another amplifier spacing, the maximum bit rate is significantly reduced. To overcome the effect, the amplitude of the soliton is amplified so that it is still the average soliton corresponding to the fiber dispersion for an amplifier spacing. Thus, the maximum bit rate is only slightly less than that without the dispersion variations. For a given distance, the maximum bit rate limited by the stability and soliton interaction is obtained. The result is compared with that limited by the Gordon-Haus effect. For shorter transmission distance, the maximum bit rate is limited by the stability and soliton interaction. For longer transmission distance, the maximum bit rate is limited by the Gordon-Haus effect     

Target differentiation with simple infrared sensors using statistical pattern recognition techniques

This study compares the performances of various statistical pattern recognition techniques for the differentiation of commonly encountered features in indoor environments, possibly with different surface properties, using simple infrared (IR) sensors. The intensity measurements obtained from such sensors are highly dependent on the location, geometry, and surface properties of the reflecting feature in a way that cannot be represented by a simple analytical relationship, therefore complicating the differentiation process. We construct feature vectors based on the parameters of angular IR intensity scans from different targets to determine their geometry and/or surface type. Mixture of normals classifier with three components correctly differentiates three types of geometries with different surface properties, resulting in the best performance (100%) in geometry differentiation. Parametric differentiation correctly identifies six different surface types of the same planar geometry, resulting in the best surface differentiation rate (100%). However, this rate is not maintained with the inclusion of more surfaces. The results indicate that the geometrical properties of the targets are more distinctive than their surface properties, and surface recognition is the limiting factor in differentiation. The results demonstrate that simple IR sensors, when coupled with appropriate processing and recognition techniques, can be used to extract substantially more information than such devices are commonly employed for.     

A Non-Line-of-Sight mitigation localization algorithm for sensor networks using clustering analysis

Non-Line-of-Sight propagation of wireless signal has an impact on measured distances in range-based localization and will bias the final localization results. A new localization algorithm is proposed in this paper to mitigate Non-Line-of-Sight errors when there are more than enough anchor nodes deployed around the node to be located. This algorithm utilizes multi-round clustering analysis to filter the pre-located estimators which derive from all possible subsets of measured distances. In each round, the method density-based spatial clustering of applications with noise is adopted. Simulations show that the proposed algorithm can effectively improve localization accuracy not only when the measured distances with Non-Line-of-Sight error are minor but also under the condition that all of them suffer random Non-Line-of-Sight error.     

Telerobot-enabled HUB-CI model for collaborative lifecycle management of design and prototyping

The HUB-CI model is investigated in a telerobotic system in a client/server network to manage the lifecycle of engineering design and prototyping. The purpose of this platform is to support collaborative engineering design and proof of concept to enhance distributed team collaboration and resource utilization. The suggested platform is exemplified in two collaboration support tools and a physical prototyping platform. Structured Co-Insight Management is developed to support innovative idea exchanges and the consensus decision-making during the design process. Conflict/error detection management helps preventing conflicts and errors during the lifecycle of design and development. Physical collaboration over the network occurs when a team controls the telerobot operation during prototyping and testing in design cycles. A pilot system is implemented with a group project for the design of an electronic circuit (including both hardware and software designs). The functional assessment method is used to compare this platform to other collaborative design tools. The system presented offers unique qualitative advantages as an integrated collaboration support system.     

Adsorption and desorption kinetics of hydrocarbons in FCC catalysts studied using a tapered element oscillating microbalance (TEOM). Part 2: numerical simulations

The factors affecting the adsorption and desorption kinetics in a TEOM are reviewed in detail with particular attention given to the assumptions required to obtain physical transport parameters from the data. Two models are presented to simulate TEOM adsorption data in the case that concentration differences down the catalyst bed can be neglected, as is appropriate when the amount of catalyst used is small, the carrier gas flowrate is large, and/or the adsorbate partial pressure is low. In the first model, the effective diffusion coefficient, D_e, is taken to be constant. In the second model, the effective diffusion coefficient is assumed to obey the Darken equation, D_e=D₀/(1−θ). The TEOM results obtained on n-hexane, n heptane, n-octane, toluene and p-xylene on a commercial FCC catalyst and on pure rare-earth exchanged zeolite Y under non-reacting conditions (373-) are analysed in detail. It is found that intracrystalline diffusion is not the limiting factor affecting the overall rates of adsorption and desorption for the systems studied. Instead, it is the transport of molecules between the adsorbed and vapour phases at the edge of zeolite crystallites that is the limiting transport step affecting the overall kinetics. For the FCC catalyst, the limiting step is the transport of molecules at the zeolite-matrix interface rather than, say, the matrix-vapour interface. Local rate constants for the desorption of the hydrocarbons at the rate-controlling interface have been obtained.     

Locally linear discriminant embedding: An efficient method for face recognition

In this paper an efficient feature extraction method named as locally linear discriminant embedding (LLDE) is proposed for face recognition. It is well known that a point can be linearly reconstructed by its neighbors and the reconstruction weights are under the sum-to-one constraint in the classical locally linear embedding (LLE). So the constrained weights obey an important symmetry: for any particular data point, they are invariant to rotations, rescalings and translations. The latter two are introduced to the proposed method to strengthen the classification ability of the original LLE. The data with different class labels are translated by the corresponding vectors and those belonging to the same class are translated by the same vector. In order to cluster the data with the same label closer, they are also rescaled to some extent. So after translation and rescaling, the discriminability of the data will be improved significantly. The proposed method is compared with some related feature extraction methods such as maximum margin criterion (MMC), as well as other supervised manifold learning-based approaches, for example ensemble unified LLE and linear discriminant analysis (En-ULLELDA), locally linear discriminant analysis (LLDA). Experimental results on Yale and CMU PIE face databases convince us that the proposed method provides a better representation of the class information and obtains much higher recognition accuracies.     

Web proxy cache replacement scheme based on back-propagation neural network

Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions.