Mitigation of Crystallization Fouling in a Single Heated Tube Using Projectiles of Different Sizes and Hardness

Fouling of heat exchangers is a prevalent operating drawback in many process industries. Efficient chemical inhibitors have predominantly been used for many years to combat deposit formation. Nevertheless, new stringent environmental legislations limit their utilization. On-line mitigation techniques, such as propulsion of projectiles at different injection rates, can also be utilized, which can, in turn, minimize the need for chemical inhibitors. Nevertheless, the experimental data are scarce and nonconclusive. In this experimental study, two spherical-type projectiles of different sizes and hardness have been used to clean the inner surface of a single heated tube that was subjected to the deposition of calcium sulfate. Projectiles were then introduced at different injection rate of every 2, 5, 10, 15, and 30 min. The experimental results show that (i) the projectiles would expedite initial nucleation of crystals even if they are soft and easy to propel inside the tube; (ii) fouling can only be mitigated if the projectiles exert a shear force such that the corresponding removal rate is greater than the net rate of the deposition; and finally (iii) harder projectiles with larger surface contact area are more efficient in cleaning the surface compared to those that are softer.     

基于SVM的维吾尔文文本分类研究

文本自动分类技术在提高文本信息利用的有效性和准确性上具有重要的现实意义和广阔的应用前景。随着Internet上维吾尔文信息的迅速发展,维吾尔文文本分类成为处理和组织这些大量文本数据的关键技术。研究维吾尔文文本分类相关技术和方法,针对维吾尔文文本在向量空间模型表示下的高维性,本文采用词干提取和χ2统计量相结合的方法对表示空间进行降维。采用SVM算法构造了维吾尔文文本分类器。针对维吾尔文文本分类语料进行的实验结果表明,SVM分类器的MacroF1值达到了84.6%,明显好于kNN方法。     

Residual generation with unknown input observer for linear systems in the presence of unmatched uncertainties

Journal of Mechanical Science and Technology - In this paper, we deal with residual vector generation for fault detection problems in linear systems via unknown input observer (UIO) when the...     

WO3 nano-ribbons: their phase transformation from tungstite (WO3·H2O) to tungsten oxide (WO3)

Tungsten oxide (WO₃) nano-ribbons (NRs) were obtained by annealing tungstite (WO₃·H₂O) NRs. The latter was synthesized below room temperature using a simple, environmentally benign, and low cost aging treatment of precursors made by adding hydrochloric acid to diluted sodium tungstate solutions (Na₂WO₄·2H₂O). WO₃ generates significant interests and is being used in a growing variety of applications. It is therefore important to identify suitable methods of production and better understand its properties. The phase transformation was observed to be initiated between 200 and 300 ^°C, and the crystallographic structure of the NRs changed from orthorhombic WO₃·H₂O to monoclinic WO₃. It was rigorously studied by annealing a series of samples ex situ in ambient air up to 800 ^°C and characterizing them afterward. A temperature-dependent Raman spectroscopy study was performed on tungstite NRs between minus 180 and 700 ^°C. Also, in situ heating experiments in the transmission electron microscope allowed for the direct observation of the phase transformation. Powder X-ray diffraction, electron diffraction, electron energy-loss spectroscopy, and X-ray photoelectron spectroscopy were employed to characterize precisely this transformation.     

Synthesis of nano-structured La0.8Ba0.2MnO3 perovskite via a mechano-thermal route

In this study, barium-doped lanthanum manganite, La_0.8Ba_0.2MnO₃, was synthesized via a mechano-thermal route employing high energy ball milling and subsequent heat treatment. The structural evolution, morphology and thermal behaviour of the powders were evaluated using XRD, FESEM, and DTA/TGA, respectively. DTA/TGA results showed that the calcination temperature of the carbonates significantly decreased by increasing the milling time. The results revealed that single phase perovskite was formed at 900 °C in a milled sample for 2 h and this temperature decreased to 600 °C by increasing the milling time to 30 h. The mean crystallite size also decreased from 32 to 20 nm by increasing the milling time from 2 to 30 h. The reaction sequence of La_0.8Ba_0.2MnO₃ formation via the mechano-thermal route is proposed using XRD and DTA/TGA results. FESEM micrographs showed that the mean particle size of the perovskite phase is increased slightly from 30 to 40 nm by increasing the heat treatment temperature from 600 to 900 °C.     

FPGA based fast and high-throughput 2-slow retiming 128-bit AES encryption algorithm

This paper presents a high throughput digital design of the 128-bit Advanced Encryption Standard (AES) algorithm based on the 2-slow retiming technique on FPGA. The C-slow retiming is a well-known optimization and high performance technique. It can enhance designs with feedback loops and automatically rebalances the registers in the design. The C-slow retiming can break the critical path of the design into finer pieces to improve the throughput of the design. The complexity of the C-slow retiming on FPGA is to find the best register allocation in the data path of the design so that by increasing the number of registers, relocation of the registers to balance the AES architecture be in the best mode, and the critical path be optimally pipelined and improved. In this paper, architecture of the AES algorithm is implemented in the gate level by high-speed and breakable structures that are desirable for the 2-slow retiming. The Mix-columns transformation is implemented based on multiplication by constants 2 and 3 modules with combinational logic circuits. This work has been successfully verified and synthesized using Xilinx ISE 11 byVirtex-5, XC5VLX85 FPGA. The proposed implementation achieves a high throughput of 86 Gb/s and high maximum operation frequency of 671.524 MHz whereas the highest throughput and the highest operation frequency reported in the literature are 73.737 Gb/s and 576.07 MHz, respectively.     

Review: the latest advances in biomedical applications of chitosan hydrogel as a powerful natural structure with eye-catching biological properties

Journal of Materials Science - Chitosan is one of the natural cationic polymers with unique properties such as non-toxicity, biodegradability, biocompatibility, environmentally friendly that has...     

Efficient multisecret sharing scheme using new proposed computational security model

A multisecret sharing (MSS) is a method for sharing a set of secrets among some participants. They can recover each of these secrets without endangering the other secrets. Two kinds of security models have been proposed for MSS schemes. These models are categorized into 2 types. The first security model is unconditional security. This approach decreases the efficiency of MSS schemes. Therefore, the second type of security, which is more relaxed, appeared. This approach is called computational security. In this paper, with 2 examples, we will show that the current definition of computational security does not satisfy all of our expectations from a secure MSS scheme. In fact, in these examples, recovering a secret leaks information to the other secrets while these schemes are considered secure in view of the computational security. After determining the shortcomings of the current security definition, we propose a new definition for computational security and present an MSS scheme that enjoys rigorous proof of security in terms of the new definition. In addition, a complete comparison in terms of share size, number of public values, and required operations for recovering a secret between our scheme and previous schemes indicates that the presented scheme is efficient.     

A Code Assignment Algorithm for Nonblocking OVSF Codes in WCDMA

OVSF codes are used as channelization codes in WCDMA. Due to code blocking property of OVSF codes, the bandwidth available in the system is severely limited. Code reassignments mitigate the impact of the blocking property at the expense of causing delays and decreasing the throughput of the system. Nonblocking OVSF (NOVSF) codes have been proposed to alleviate the adverse effect of code reassignments. This paper presents a code assignment algorithm for NOVSF codes, which does not require any code reassignments. Simulation results show that NOVSF codes achieve better throughput than OVSF codes, even though code reassignments are allowed in the assignments of OVSF codes.