Numerical Simulation and Optimization of the Alumina Distribution in an Aluminium Electrolysis Pot
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Many known materials possess polycrystalline structure. The images produced by plane cuts through such structures are polygonal complexes. The problem of finding the edges, when only the vertices of a given polygonal complex are known, is considered. A com ...
The objective of finding the lidar configuration which best matches airshed pollution modeling guided this study. This study detd. which and how many wavelengths (more than the min. no. of 2 could possibly improve measurement accuracy) are the most suited ...
The proposed paper describes the modelling and the prediction of the steady- state or transient behaviour of different modern variable-speed drives. The necessity of a performant numerical simulation tool in order to guarantee an optimized design is illust ...
A comparative study of the efficiencies of W, Mg, Mg + Pd, Ir + Mg and Ir + W + PO43- as chem. modifiers for the thermal stabilization of Pb and Sn in slurries was performed. The Ir + Mg modifier contributes more than the others to minimizing matrix effect ...
An iterative and decoupled method is proposed for solving the general active/reactive constrained power flow problem, based on rectangular coordinates of injected currents. Successive linear programming with dual-relaxation method is used. The general obje ...
Many hard combinatorial optimization problems can be approached by what has become known as simulated annealig, i.e. probabilistic exchange algorithms that yield good approximations and under certain conditions converge almost surely to the optimum. In thi ...
