Removal of organic contaminants from wastewater using the electrodialytic process

Pharmaceuticals and personal care products (PPCPs) are widely used on a daily basis. After their usage they reach the wastewater treatment plants (WWTPs). These compounds have different physico-chemical characteristics, which makes them difficult to completely remove in the WWTPs, througth conventional treatments. Currently, there is no legislation regarding PPCPs thresholds in effluent discharge. But, even at vestigial concentrations, these compounds enclose environmental risks due to, e.g., endocrine disruption potential. There is a need of alternative techniques for their removal in WWTPs. The main goal of this work was to assess the use of electrodialytic (ED) process to remove PPCPs from the effluent to be discharged. A two-compartment ED cell was used testing (i) the effluent position in the cell (anode and cathode compartment); (ii) the use of anion (AEM) and cation exchange membrane (CEM); (iii) the treatment period (6, 12 and 24 hours); (iv) effluent recirculation and current steps; (v) the feasibility of sequential treatments. Phosphorus (P) removal from effluent and energetic costs associated to the process were also evaluated. Five PPCPs were studied – caffeine (CAF), bisphenol A (BPA), 17 β-estradiol (E2), ethinyl estradiol (EE2) and oxybenzone (MBPh). The ED process showed to be effective in the removal when effluent is in the anode compartment. Oxidation is suggested to be the main removal process, which was between 88 and 96%, for all the compounds, in 6 hours. Nevertheless, the presence of intermediates and/or by-products was also observed in some cases. Effluent recirculation should have a retention time in the ED cell big enough to promote removal whereas the current steps (effluent in anode compartment) slightly increased removal efficiencies (higher than 80% for all PPCPs). The sequential set of ED treatment (effluent in anode compartment) showed to be effective during both periods with a removal percentage between 80 and 95% and 73 to 88% in the case of AEM and CEM, respectively. Again, the main removal process is strongly suggested to be oxidation in the anode compartment. However, there was an increase of BOD5 and COD, which might be explained by effluent spiking, these parameters limiting the effluent discharge. From these treatments, the use of AEM, enhanced the P removal from effluent to minimize risk of eutrophication. Energetic costs of the best set-up (6 hours) are approximately 0,8€/m3 of wastewater, a value considered low, attending to the prices of other treatment processes.

Dynamics of a class of ODEs more general than almost periodic

A temporally global solution, if it exists, of a nonautonomous ordinary differential equation need not be periodic, almost periodic or almost automorphic when the forcing term is periodic, almost periodic or almost automorphic, respectively. An alternative class of functions extending periodic and almost periodic functions which has the property that a bounded temporally global solution solution of a nonautonomous ordinary differential equation belongs to this class when the forcing term does is introduced here. Specifically, the class of functions consists of uniformly continuous functions, defined on the real line and taking values in a Banach space, which have pre-compact ranges. Besides periodic and almost periodic functions, this class also includes many nonrecurrent functions. Assuming a hyperbolic structure for the unperturbed linear equation and certain properties for the linear and nonlinear parts, the existence of a special bounded entire solution, as well the existence of stable and unstable manifolds of this solution are established. Moreover, it is shown that this solution and these manifolds inherit the temporal behaviour of the vector field equation. In the stable case it is shown that this special solution is the pullback attractor of the system. A class of infinite dimensional examples involving a linear operator consisting of a time independent part which generates a C(0)-semigroup plus a small time dependent part is presented and applied to systems of coupled heat and beam equations. (C) 2010 Elsevier Ltd. All rights reserved.

A simulation tool for transient stability analysis on vector computers

This paper deals with transient stability analysis based on time domain simulation on vector processing. This approach requires the solution of a set of differential equations in conjunction of another set of algebraic equations. The solution of the algebraic equations has presented a scalar as sequential set of tasks, and the solution of these equations, on vector computers, has required much more investigations to speedup the simulations. Therefore, the main objective of this paper has been to present methods to solve the algebraic equations using vector processing. The results, using a GRAY computer, have shown that on-line transient stability assessment is feasible.

Analyzing the n→π* Electronic Transition of Formaldehyde in Water. A Sequential Monte Carlo/Time-Dependent Density Functional Theory

The n→π* absorption transition of formaldehyde in water is analyzed using combined and sequential classical Monte Carlo (MC) simulations and quantum mechanics (QM) calculations. MC simulations generate the liquid solute-solvent structures for subsequent QM calculations. Using time-dependent density functional theory in a localized set of gaussian basis functions (TD-DFT/6-311++G(d,p)) calculations are made on statistically relevant configurations to obtain the average solvatochromic shift. All results presented here use the electrostatic embedding of the solvent. The statistically converged average result obtained of 2300 cm-1 is compared to previous theoretical results available. Analysis is made of the effective dipole moment of the hydrogen-bonded shell and how it could be held responsible for the polarization of the solvent molecules in the outer solvation shells.

Prevention in underground construction with sequential excavation method

This paper aims to describe the Sequential Excavation Method, used for excava-tion in underground works, as well as the related risks and preventive measures. This method has characteristics that differentiate it from other tunnelling techniques: it uses a larger number of workers and equipment; it has a high concurrency of tasks with various workers and equip-ment quite exposed to hazards; and it uses many potentially aggressive chemicals. Firstly, it is given a broad overview of this issue. Afterwards, it will be presented the results of a survey to a sample of experienced technicians, aimed at gauging the relevance of a set of guidelines relat-ing to the design and work phases, applicable to the domestic market and prepared following technical visits to works abroad.

Sequential estimation of multipath MIMO-OFDM channels

Wireless “MIMO” systems, employing multiple transmit and receive antennas, promise a significant increase of channel capacity, while orthogonal frequency-division multiplexing (OFDM) is attracting a good deal of attention due to its robustness to multipath fading. Thus, the combination of both techniques is an attractive proposition for radio transmission. The goal of this paper is the description and analysis of a new and novel pilot-aided estimator of multipath block-fading channels. Typical models leading to estimation algorithms assume the number of multipath components and delays to be constant (and often known), while their amplitudes are allowed to vary with time. Our estimator is focused instead on the more realistic assumption that the number of channel taps is also unknown and varies with time following a known probabilistic model. The estimation problem arising from these assumptions is solved using Random-Set Theory (RST), whereby one regards the multipath-channel response as a single set-valued random entity.Within this framework, Bayesian recursive equations determine the evolution with time of the channel estimator. Due to the lack of a closed form for the solution of Bayesian equations, a (Rao–Blackwellized) particle filter (RBPF) implementation ofthe channel estimator is advocated. Since the resulting estimator exhibits a complexity which grows exponentially with the number of multipath components, a simplified version is also introduced. Simulation results describing the performance of our channel estimator demonstrate its effectiveness.

Sequential estimation of time-varying multipath channel for MIMO-OFDM systems

In this paper, we introduce a pilot-aided multipath channel estimator for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. Typical estimation algorithms assume the number of multipath components and delays to be known and constant, while theiramplitudes may vary in time. In this work, we focus on the more realistic assumption that also the number of channel taps is unknown and time-varying. The estimation problem arising from this assumption is solved using Random Set Theory (RST), which is a probability theory of finite sets. Due to the lack of a closed form of the optimal filter, a Rao-Blackwellized Particle Filter (RBPF) implementation of the channel estimator is derived. Simulation results demonstrate the estimator effectiveness.

Valuation bubbles and sequential bubbles

Price bubbles in an Arrow-Debreu valuation equilibrium in infinite-timeeconomy are a manifestation of lack of countable additivity of valuationof assets. In contrast, known examples of price bubbles in sequentialequilibrium in infinite time cannot be attributed to the lack of countableadditivity of valuation. In this paper we develop a theory of valuation ofassets in sequential markets (with no uncertainty) and study the nature ofprice bubbles in light of this theory. We consider an operator, calledpayoff pricing functional, that maps a sequence of payoffs to the minimumcost of an asset holding strategy that generates it. We show that thepayoff pricing functional is linear and countably additive on the set ofpositive payoffs if and only if there is no Ponzi scheme, and providedthat there is no restriction on long positions in the assets. In the knownexamples of equilibrium price bubbles in sequential markets valuation islinear and countably additive. The presence of a price bubble indicatesthat the asset's dividends can be purchased in sequential markers at acost lower than the asset's price. We also present examples of equilibriumprice bubbles in which valuation is nonlinear but not countably additive.

Sequential decisions in allocation problems

[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player

Sequential decisions in allocation problems

[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player

JPEG standard uniform quantization error modeling with applications to sequential and progressive operation modes

In this paper we propose a method for computing JPEG quantization matrices for a given mean square error or PSNR. Then, we employ our method to compute JPEG standard progressive operation mode definition scripts using a quantization approach. Therefore, it is no longer necessary to use a trial and error procedure to obtain a desired PSNR and/or definition script, reducing cost. Firstly, we establish a relationship between a Laplacian source and its uniform quantization error. We apply this model to the coefficients obtained in the discrete cosine transform stage of the JPEG standard. Then, an image may be compressed using the JPEG standard under a global MSE (or PSNR) constraint and a set of local constraints determined by the JPEG standard and visual criteria. Secondly, we study the JPEG standard progressive operation mode from a quantization based approach. A relationship between the measured image quality at a given stage of the coding process and a quantization matrix is found. Thus, the definition script construction problem can be reduced to a quantization problem. Simulations show that our method generates better quantization matrices than the classical method based on scaling the JPEG default quantization matrix. The estimation of PSNR has usually an error smaller than 1 dB. This figure decreases for high PSNR values. Definition scripts may be generated avoiding an excessive number of stages and removing small stages that do not contribute during the decoding process with a noticeable image quality improvement.

A Sequential Allocation Problem: The Asymptotic Distribution of Resources

In this paper we consider a sequential allocation problem with n individuals. The first individual can consume any amount of some endowment leaving the remaining for the second individual, and so on. Motivated by the limitations associated with the cooperative or non-cooperative solutions we propose a new approach. We establish some axioms that should be satisfied, representativeness, impartiality, etc. The result is a unique asymptotic allocation rule. It is shown for n = 2; 3; 4; and a claim is made for general n. We show that it satisfies a set of desirable properties. Key words: Sequential allocation rule, River sharing problem, Cooperative and non-cooperative games, Dictator and ultimatum games. JEL classification: C79, D63, D74.

Sequential Machine learning Approaches for Portfolio Management

Cette thèse envisage un ensemble de méthodes permettant aux algorithmes d'apprentissage statistique de mieux traiter la nature séquentielle des problèmes de gestion de portefeuilles financiers. Nous débutons par une considération du problème général de la composition d'algorithmes d'apprentissage devant gérer des tâches séquentielles, en particulier celui de la mise-à-jour efficace des ensembles d'apprentissage dans un cadre de validation séquentielle. Nous énumérons les desiderata que des primitives de composition doivent satisfaire, et faisons ressortir la difficulté de les atteindre de façon rigoureuse et efficace. Nous poursuivons en présentant un ensemble d'algorithmes qui atteignent ces objectifs et présentons une étude de cas d'un système complexe de prise de décision financière utilisant ces techniques. Nous décrivons ensuite une méthode générale permettant de transformer un problème de décision séquentielle non-Markovien en un problème d'apprentissage supervisé en employant un algorithme de recherche basé sur les K meilleurs chemins. Nous traitons d'une application en gestion de portefeuille où nous entraînons un algorithme d'apprentissage à optimiser directement un ratio de Sharpe (ou autre critère non-additif incorporant une aversion au risque). Nous illustrons l'approche par une étude expérimentale approfondie, proposant une architecture de réseaux de neurones spécialisée à la gestion de portefeuille et la comparant à plusieurs alternatives. Finalement, nous introduisons une représentation fonctionnelle de séries chronologiques permettant à des prévisions d'être effectuées sur un horizon variable, tout en utilisant un ensemble informationnel révélé de manière progressive. L'approche est basée sur l'utilisation des processus Gaussiens, lesquels fournissent une matrice de covariance complète entre tous les points pour lesquels une prévision est demandée. Cette information est utilisée à bon escient par un algorithme qui transige activement des écarts de cours (price spreads) entre des contrats à terme sur commodités. L'approche proposée produit, hors échantillon, un rendement ajusté pour le risque significatif, après frais de transactions, sur un portefeuille de 30 actifs.

Welfare criteria from choice: the sequential solution

We study the problem of deriving a complete welfare ordering from a choice function. Under the sequential solution, the best alternative is the alternative chosen from the universal set; the second best is the one chosen when the best alternative is removed; and so on. We show that this is the only completion of Bernheim and Rangel's (2009) welfare relation that satisfies two natural axioms: neutrality, which ensures that the names of the alternatives are welfare-irrelevant; and persistence, which stipulates that every choice function between two welfare-identical choice functions must exhibit the same welfare ordering.

Nonlinear set-membership estimation: a support vector machine approach

In this paper a support vector machine (SVM) approach for characterizing the feasible parameter set (FPS) in non-linear set-membership estimation problems is presented. It iteratively solves a regression problem from which an approximation of the boundary of the FPS can be determined. To guarantee convergence to the boundary the procedure includes a no-derivative line search and for an appropriate coverage of points on the FPS boundary it is suggested to start with a sequential box pavement procedure. The SVM approach is illustrated on a simple sine and exponential model with two parameters and an agro-forestry simulation model.