Algorithm, PARIS

Solvent Selection. Solvent selection is often conducted in early design of chemical processes. A method to match desirable solvent properties (solubility parameters, for example) while simultaneously avoiding undesirable environmental impacts (persistence, toxicity, volatility, etc.) would improve design performance. PARIS II is a program combining such solvent design characteristics. Solvent composition is manipulated by a search algorithm aided by a library of routines with the latest fluid property prediction techniques, and by another... 

Cantu-Paz E (1998) A survey of parallel genetic algorithms. In Calculateurs paralleles, reseaux et systems repartis, vol 10. Hermes, Paris, pp 141-171... 

The dula analysis was performed uccortling io relerence 109. To determine Ihe smooth pari of ihe background subiracictl spectrum, a modified smoothing spline algorithm was used. The EXAFS Xlk) functions were multiplied with k1 and Fourier filtered in the ranges 1.40- .50 A for the bromine F.XAI S spectra and 1.00- .40 A for the magnesium EXAFS spectra. 

The PARIS II algorithm initially searches its database of pure chemicals, along with the information provided by the environmental/toxicological impact database and the UNIFAC library, for a single chemical that can meet all of the requirements. If one or more adequate replacements are found, PARIS II displays them in ranked order and compares the properties of each to those of the solvent to be replaced. 

J. FrdBl, J. Gerlach T. Kropf (1996), An Efficient Algorithm for Real-Time Model Checking, in In Proceedings of the European Design and Test Conference , IEEE Computer Society Press, Paris, France, pp. 15-21. 

Deb, K., Agrawal, S., Pratab, A., Me-yarivan, T. 2000, A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization NSGA-II. Parallel Problem Solving from Nature VI Conference, Paris, France, 2000, pp. 849-858. 

K, O Brien, M, Rahmouni, and A. Jerraya. DLS a scheduling algorithm for high-level synthesis in VHDL. Proc. Europ. Design Automation Conf., Paris, Prance, Feb 1993. 

R.D. Lonsdale, "An algorithm for solving thermal-hydraulic equations in complex geometries The ASTEC code", in Proceedings of International Topical Meeting on Advances in Reactor Physics, Mathematics and Computation, pp. 1653-1664, Paris, France, 27-30 April, 1987. 

Master Thesis, Engineering Sciences, Ecole Centrale, Paris Pot A (2006) Planning and routing algorithms for multi-skill contact centers. Doctoral dissertation. Department of Mathematics, Vrije Univesity, Amsterdam... 

Abry, P. (1997) Ondelettes et mrbulence. Multiresolutions, algorithmes de decomposition, invariance d echelles, Diderot Editeur, Paris. 

BIE 93] Bielinski P., Methode de validation formelle, implantation VLSI d un algorithme de code correcteur d erreur et validation formelle de la realisation, PhD thesis. University of Paris 6, 1993. 

McLachlan, G.J. and T. Krishnan 1999. The Expectation Maximization (EM) Algorithm and Its Extensions. 2nd Edition, Lavoisier, Paris. 

---