Photocatalytic degradation of methyl tert‐butyl ether (MTBE) in contaminated water by ZnO nanoparticles

BACKGROUND: Over the past several decades methyl tert‐butyl ether (MTBE) as additive to gasoline, intended to either boost ratings of fuel or to reduce air pollution, has been accepted worldwide. Since MTBE has high water solubility, the occurrence of fuel spills or leaks from underground storage tanks or transferring pipeline has led to the contamination of natural waters. In this study the degradation of aqueous MTBE at relatively high concentrations was investigated by a UV‐visible/ZnO/H₂O₂ photocatalytic process. The effects of important operational parameters such as pH, amount of H₂O₂, catalyst loading and irradiation time were also investigated. Concentration of MTBE and intermediates such as tert‐butyl formate and tert‐butyl alcohol were measured. RESULTS: Time required for complete degradation increased from 20 to 150 min when the initial concentration was increased from 10 to 500 mg L^?1. The first‐order rate constants for degradation of MTBE were estimated to be 0.183–0.022 min^?1 as the concentration increased from 10 to 500 mg L^?1. Study of the overall mineralization monitored by total organic carbon analysis showed that at an initial concentration of 100 mg L^?1 MTBE complete mineralization was obtained after 100 min under UV‐visible/ZnO/H₂O₂ photocatalysis. CONCLUSION: The data presented in this paper clearly indicated that UV‐visible/ZnO/O₂ as an advanced oxidation process provides an efficient treatment alternative for the remediation of MTBE‐contaminated waters. Copyright © 2008 Society of Chemical Industry     

An FEC scheme combined with weighted scheduling to reduce multicast packet loss in IPTV over PON

Congestion is one of the most important challenges in optical networks. In a Passive Optical Network (PON), the Optical Line Terminal (OLT) is a bottleneck and congestion prone. In this paper, a framework is proposed with Forward Error Correction (FEC) at the IP layer combined with Weighted Round Robin (WRR) at the scheduling level to overcome packet-loss due to congestion in the OLT in order to achieve efficient video multicasting over PON. In the FEC scheme, Reed-Solomon (RS(n,k)) with erasure coding is used, where (n−k) erroneous symbols per n symbol blocks can be corrected. In our framework, an Internet Protocol TeleVision (IPTV) service provider uses the mentioned RS coding and generates redundant packets from regular IPTV packets in such a way that an Optical Network Unit (ONU) can recover lost packets from received packets, thus resulting in a better video quality. Simulation results show that using the proposed framework, an ONU can recover many lost packets and achieve better video quality under different traffic loads for its users. For instance, the proposed method can reduce packet loss rate by almost 55% and 10% under traffic load 0.9, respectively, compared with the Round Robin (RR) and WRR methods under symmetric traffic load. When High Receivers Queue (HRQ) traffic (i.e., traffic received by many users) is twice Low Receivers Queue (LRQ) traffic (i.e., traffic received by a small number of users), this reduction is almost 86% and 30% under traffic load 0.9. Finally, when LRQ traffic is twice HRQ traffic, the reduction in packet loss rate is almost 70% and 91% at traffic load 0.5.     

Implementing a one-bit reversible full adder using quantum-dot cellular automata

Quantum-dot cellular automata (QCA) technique is one of the emerging and promising nanotechnologies. It has considerable advantages versus CMOS technology in various aspects such as extremely low power dissipation, high operating frequency and small size. In this paper, designing of a one-bit full adder is investigated using a QCA implementation of Toffoli and Fredkin gates. Then, a full adder design with reversible QCA1 gates is proposed regarding to overhead and power savings. Our proposed full adder design is more preferable when considering both circuit area and speed. The proposed design uses only two QCA1 gates and maximizes the circuit density and focuses on a layout of the circuit which is minimal in using QCA cells.     

Low-power high-speed interconnection networks in NOC using multi-valued current-mode techniques

With the fast developments and growth of electronic applications and a great demand for increasing the speed of processors, VLSI circuits and on-chip interconnections the ＂Networks-On-Chip＂ （NOC） is the best solution for ＂System-On-Chip＂ （SOC）. The most fundamental part of networks On-Chip is the On-Chip interconnection. The model presented in this article describes the method of sending data on On-Chip interconnection by using a current-mode multi-valued logic instead of voltage-mode in order to increase speed and reduce the number of interconnection wires.     

Controlled gates for multi-level quantum computation

Multi-level (ML) quantum logic can potentially reduce the number of inputs/outputs or quantum cells in a quantum circuit which is a limitation in current quantum technology. In this paper we propose theorems about ML-quantum and reversible logic circuits. New efficient implementations for some basic controlled ML-quantum logic gates, such as three-qudit controlled NOT, Cycle, and Self Shift gates are proposed. We also propose lemmas about r-level quantum arrays and the number of required gates for an arbitrary n-qudit ML gate. An equivalent definition of quantum cost (QC) of binary quantum gates for ML-quantum gates is introduced and QC of controlled quantum gates is calculated.     

A hybrid capacitive pressure and temperature sensor fabricated by adhesive bonding technique for harsh environment of kraft pulp digesters

We have developed a compensated capacitive pressure and temperature sensor for kraft pulp digesters (pH 13.5, temperatures 25–175°C reaching a local maximum of 180°C and pressures up to 2 MPa). The gauge capacitive pressure sensor was fabricated by bonding silicon and Pyrex chips using a high temperature, low viscosity UV (ultraviolent) adhesive as the gap-controlling layer and heat curing adhesive as the bonding agent. A simple chip bonding technique, involving insertion of the adhesive into the gap between two chips was developed. A platinum thin-film wire was patterned on top of a silicon chip to form a resistance temperature detector (RTD) with a nominal resistance of 1,500 Ω. A silicon dioxide layer and a thin layer of Parylene were deposited to passivate the pressure sensor diaphragm and the sensors were embedded into epoxy for protection against the caustic environment in kraft digesters. The sensors were tested up to 2 MPa and 170°C in an environment chamber. The maximum thermal error of ±1% (absolute value of ±20 kPa) full scale output (FSO) and an average sensitivity of 0.554 fF/kPa were measured. Parylene-coated silicon chips were tested for a full kraft pulping cycle with no signs of corrosion.     

A genetic programming model to generate risk-adjusted technical trading rules in stock markets

Technical trading rules can be generated from historical data for decision making in stock markets. Genetic programming (GP) as an artificial intelligence technique is a valuable method to automatically generate such technical trading rules. In this paper, GP has been applied for generating risk-adjusted trading rules on individual stocks. Among many risk measures in the literature, conditional Sharpe ratio has been selected for this study because it uses conditional value at risk (CVaR) as an optimal coherent risk measure. In our proposed GP model, binary trading rules have been also extended to more realistic rules which are called trinary rules using three signals of buy, sell and no trade. Additionally we have included transaction costs, dividend and splits in our GP model for calculating more accurate returns in the generated rules. Our proposed model has been applied for 10 Iranian companies listed in Tehran Stock Exchange (TSE). The numerical results showed that our extended GP model could generate profitable trading rules in comparison with buy and hold strategy especially in the case of risk adjusted basis.     

Analysis and forecasting of IPO underpricing

Probability of withdrawal is a feature of initial public offering (IPOs), which can be an important parameter in decisions of investors and issuers. Considering the probability of offering withdrawal facilitates more precise estimation of underpricing. In this paper, the effective factors on probability of IPO withdrawal and underpricing in Tehran Stock Exchange have been characterized using regression, and then neural network is applied to estimate the probability of IPO withdrawal and underpricing. To evaluate the performance of our applied method, fuzzy regression is employed and compared with neural network. According to the obtained empirical results, neural network demonstrates better accuracy than fuzzy regression. The results indicate that there is a meaningful relationship between underpricing and probability of withdrawal, and the probability of IPO withdrawal plays an important role in precise evaluation of underpricing.     

A fast and noise resilient cluster-based anomaly detection

Clustering, while systematically applied in anomaly detection, has a direct impact on the accuracy of the detection methods. Existing cluster-based anomaly detection methods are mainly based on spherical shape clustering. In this paper, we focus on arbitrary shape clustering methods to increase the accuracy of the anomaly detection. However, since the main drawback of arbitrary shape clustering is its high memory complexity, we propose to summarize clusters first. For this, we design an algorithm, called Summarization based on Gaussian Mixture Model (SGMM), to summarize clusters and represent them as Gaussian Mixture Models (GMMs). After GMMs are constructed, incoming new samples are presented to the GMMs, and their membership values are calculated, based on which the new samples are labeled as “normal” or “anomaly.” Additionally, to address the issue of noise in the data, instead of labeling samples individually, they are clustered first, and then each cluster is labeled collectively. For this, we present a new approach, called Collective Probabilistic Anomaly Detection (CPAD), in which, the distance of the incoming new samples and the existing SGMMs is calculated, and then the new cluster is labeled the same as of the closest cluster. To measure the distance of two GMM-based clusters, we propose a modified version of the Kullback–Libner measure. We run several experiments to evaluate the performances of the proposed SGMM and CPAD methods and compare them against some of the well-known algorithms including ABACUS, local outlier factor (LOF), and one-class support vector machine (SVM). The performance of SGMM is compared with ABACUS using Dunn and DB metrics, and the results indicate that the SGMM performs superior in terms of summarizing clusters. Moreover, the proposed CPAD method is compared with the LOF and one-class SVM considering the performance criteria of (a) false alarm rate, (b) detection rate, and (c) memory efficiency. The experimental results show that the CPAD method is noise resilient, memory efficient, and its accuracy is higher than the other methods.