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     

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.     

Supervisory control of modular systems with global specification languages

The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synthesized for each module separately and the supervisory control consists of the parallel composition of the modular supervisory controls. The general case of the specification that is indecomposable and not necessarily contained in the plant language, which is often the case in practice, is considered. The usual assumption that all shared events are controllable is relaxed by introducing two new structural conditions relying on the global mutual controllability condition. The novel concept used as a sufficient structural condition is strong global mutual controllability. The main result uses a weaker condition called global mutual controllability together with local consistency of the specification. An example illustrates the approach.     

Control of frictional dynamics of a one-dimensional particle array

Control of frictional forces is required in many applications of tribology. While the problem is approached by chemical means traditionally, a recent approach was proposed to control the system mechanically to tune frictional responses. We design feedback control laws for a one-dimensional particle array sliding on a surface subject to friction. The Frenkel-Kontorova model describing the dynamics is a nonlinear interconnected system and the accessible control elements are average quantities only. We prove local stability of equilibrium points of the un-controlled system in the presence of linear and nonlinear particle interactions, respectively. We then formulate a tracking control problem, whose control objective is for the average system to reach a designated targeted velocity using accessible elements. Sufficient stabilization conditions are explicitly derived for the closed-loop error systems using the Lyapunov theory based methods. Simulation results show satisfactory performances. The results can be applied to other physical systems whose dynamics is described by the Frenkel-Kontorova model.     

Relational attention-based Markov logic network for visual navigation

The Journal of Supercomputing - We argue the agent’s low generalization problem for searching target object in challenging visual navigation could be solved by "how" and...     

Syntax–Aware graph convolutional network for the recognition of chinese implicit inter-sentence relations

The Journal of Supercomputing - In the literature, most previous studies on English implicit inter-sentence relation recognition only focused on semantic interactions, which could not exploit the...     

Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.     

Multi-level hierarchical interface-based supervisory control

Hierarchical Interface-Based Supervisory Control employs interfaces that allow properties of a monolithic system to be verified through local analysis. By avoiding the need to verify properties globally, significant computational savings can be achieved. In this paper we provide local requirements for a multi-level architecture employing command-pair type interfaces. This multi-level architecture allows for a greater reduction in complexity and improved reconfigurability over the two-level case that has been previously studied since it allows the global system to be partitioned into smaller modules. This paper also provides results for synthesizing supervisors in the multi-level architecture that are locally maximally permissive with respect to a given specification and set of interfaces.     

An improved method for voice pathology detection by means of a HMM-based feature space transformation

This paper presents new a feature transformation technique applied to improve the screening accuracy for the automatic detection of pathological voices. The statistical transformation is based on Hidden Markov Models, obtaining a transformation and classification stage simultaneously and adjusting the parameters of the model with a criterion that minimizes the classification error. The original feature vectors are built up using classic short-term noise parameters and mel-frequency cepstral coefficients. With respect to conventional approaches found in the literature of automatic detection of pathological voices, the proposed feature space transformation technique demonstrates a significant improvement of the performance with no addition of new features to the original input space. In view of the results, it is expected that this technique could provide good results in other areas such as speaker verification and/or identification.