Inhibition of sulfide on the simultaneous removal of nitrate and p‐cresol by a denitrifying sludge

BACKGROUND: Many industrial discharges, such as those generated from petrochemical refineries, contain large amounts of sulfurous, nitrogenous and organic contaminants. Denitrification has emerged as a suitable technology for the simultaneous removal of these pollutants in a single reactor unit; however, more evidence is demanded to clarify the limitations of denitrification on the simultaneous removal of sulfide and phenolic contaminants and to optimize the biological process. The aim of this study was to evaluate the capacity of a denitrifying sludge to simultaneously convert sulfide and p‐cresol via denitrification. RESULTS: Sulfide was the preferred electron donor over p‐cresol, imposing a 5 h lag phase (required for complete sulfide removal) on organotrophic denitrification. Addition of sulfide (20 mg S^2? L^?1) to p‐cresol‐amended denitrifying cultures also decreased the reduction rate of nitrate and nitrite, as well as the production rate of nitrogen gas. Nitrite reduction rate was the most affected step by sulfide, decreasing from 35 to 21 mg N (g VSS d)^?1. A synergistic inhibitory effect of nitrate and sulfide was also observed on nitrite reduction. Despite the effects of sulfide on the respiratory rates monitored, complete removal of nitrate, sulfide and p‐cresol could be achieved after 48 h of incubation. CONCLUSION: Our results suggest that simultaneous removal of sulfide and p‐cresol could be achieved in denitrifying reactors, but a large hydraulic residence time may be required to sustain an efficient process due to inhibitory effects of sulfide. Copyright © 2008 Society of Chemical Industry     

Nonparametric Analysis of the Order-Statistic Model in Software Reliability

In the literature on statistical inference in software reliability, the assumptions of parametric models and random sampling of bugs have been pervasive. We argue that both assumptions are problematic, the first because of robustness concerns and the second due to logical and practical difficulties. These considerations motivate the approach taken in this paper. We propose a nonparametric software reliability model based on the order-statistic paradigm. The objective of the work is to estimate, from data on discovery times observed within a type I censoring framework, both the underlying distribution F from which discovery times are generated and N, the unknown number of bugs in the software. The estimates are used to predict the next time to failure. The approach makes use of Bayesian nonparametric inference methods, in particular, the beta-Stacy process. The proposed methodology is illustrated on both real and simulated data     

Development of a predictive model for polymer/solvent diffusion coefficient calculations

A new calculation procedure for free‐volume parameters is considered in this work by using viscosity prediction methods and the Levenberg‐Marquardt calculation scheme. All parameters used in the Vrentas–Duda free‐volume theory can be estimated from pure component properties. The prediction results are compared with experimental data for some polymer/solvent systems. The diffusion coefficient calculated by Vrentas–Duda theory can be used in the modeling of membrane separation processes. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Lifetime Measurements on a High-Reliability RF-MEMS Contact Switch

Radio frequency microelectromechanical systems (RF MEMS) cantilever contact switches have been tested for lifetime. The mean cycles-to-failure measured on an ensemble of switches was 430 billion switch cycles. The longest lifetime exhibited without degradation of the switch was 914 billion switch cycles. The devices were switched at 20 kHz with an incident RF frequency of 10 GHz and an incident RF power of 20 dBm. Testing was performed continuously over a period of approximately 18 months. The switches were operated in a cold-switched mode.     

Mapping of Trellises Associated with General Encoders onto High-Performance VLSI Architectures

A rate 1/n binary generic convolutional encoder is a shift-register circuit where the inputs are information bits and the outputs are blocks of n bits generated as linear combinations on the appropriate shift register contents. The decoding of the outputs of a convolutional encoder can be carried out by the well-known Viterbi algorithm. The communication pattern of the Viterbi Algorithm is given as a graph, called trellis, associated to the state diagram of the corresponding encoder. In this paper we present a methodology that permits the efficient mapping of the Viterbi algorithm onto a column of an arbitrary number of processors. This is done through the representation of the data flow by using mathematical operators which present an inmediate hardware projection. A single operator string has been obtained to represent a generic encoder through the study of the data flow of free-forward encoders and feed-back encoders. The formal model developed is employed for the partitioning of the computations among an arbitrary number of processors in such a way that the data are recirculated opimizing the use of the processors and the communications. As a result, we obtain a highly regular and modular architecture suitable for VLSI implementation.     

Optimization techniques for curved path computing

Participating media with an inhomogeneous index of refraction make light follow curved paths. Simulating this in a global illumination environment has usually been neglected due to the complexity of the calculations involved, sacrificing accurate physical simulations for efficient visual results. This paper aims to simulate non-linear media in a more reasonable time than previous works without losing physical correctness. Accuracy is achieved by solving the Eikonal equation of geometrical optics, which describes the path followed by a light beam that traverses a non-linear medium. This equation is used in the context of a photon mapping extension.     

Land‐use dynamic discovery based on heterogeneous mobility sources

Nowadays, cities are the most relevant type of human settlement and their population has been endlessly growing for decades. At the same time, we are witnessing an explosion of digital data that capture many different aspects and details of city life. This allows detecting human mobility patterns in urban areas with more detail than ever before. In this context, based on the fusion of mobility data from different and heterogeneous sources, such as public transport, transport‐network connectivity and Online Social Networks, this study puts forward a novel approach to uncover the actual land use of a city. Unlike previous solutions, our work avoids a time‐invariant approach and it considers the temporal factor based on the assumption that urban areas are not used by citizens all the time in the same manner. We have tested our solution in two different cities showing high accuracy rates.     

GPU accelerated waterpixel algorithm for superpixel segmentation of hyperspectral images

The Journal of Supercomputing - The high computational cost of the superpixel segmentation algorithms for hyperspectral remote sensing images makes them ideal candidates for parallel computation....     

A panoramic view and swot analysis of artificial intelligence for achieving the sustainable development goals by 2030: progress and prospects

Applied Intelligence - The17 Sustainable Development Goals (SDGs) established by the United Nations Agenda 2030 constitute a global blueprint agenda and instrument for peace and prosperity...     

Algorithms for processing the group K nearest-neighbor query on distributed frameworks

Distributed and Parallel Databases - Given two datasets of points (called Query and Training), the Group (K) Nearest-Neighbor (GKNN) query retrieves (K) points of the Training with the smallest sum...