Thermocatalytic cracking of fat from fat boxes with activated red mud

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adsorption Rate of 198 Reactive Red Dye from Aqueous Solutions by using Activated Red Mud

Backgroud and purpose: Dye is one of the problems of industrial effluent such as textile industries. The dyes can be removed by various methods. Therefore, the aim of this study was the evaluation of adsorption rate of reactive red 198 from aqueous solution by activated red mud. Materials and methods: This research was a lab study. Activated red mud was used as an adsorbent to remove reactive r...

متن کامل

adsorption rate of 198 reactive red dye from aqueous solutions by using activated red mud

backgroud and purpose: dye is one of the problems of industrial effluent such as textile industries. the dyes can be removed by various methods. therefore, the aim of this study was the evaluation of adsorption rate of reactive red 198 from aqueous solution by activated red mud. materials and methods: this research was a lab study. activated red mud was used as an adsorbent to remove reactive r...

متن کامل

INVESTIGATING SELECTIVE REMOVAL OF Cr(VI) AND Zinc IONS FROM AQUEOUS MEDIA BY MECHANICAL-CHEMICAL ACTIVATED RED MUD

In this study, the adsorption of hexavalent chromium and zinc ions from the solution is investigated by raw red mud and mechanical-chemical activated red mud along with the possibility of selective reclamation of these ions from the solution. The mechanical-chemical activation of red mud was done by employing high-energy milling and subsequent acid treatment with HNO3. Raw red mud (RRM) and mec...

متن کامل

Klee’s Measure Problem on Fat Boxes in Time O(n)

The measure problem of Klee asks for the volume of the union of n axis-parallel boxes in a fixed dimension d. We give an O(n) time algorithm for the special case of all boxes being cubes or, more generally, fat boxes. Previously, the fastest run-time was n 2O(log ∗ , achieved by the general case algorithm of Chan [SoCG 2008]. For the general problem our run-time would imply a complexity theoret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Brazilian Journal of Development

سال: 2020

ISSN: 2525-8761,2525-8761

DOI: 10.34117/bjdv6n4-237