نتایج جستجو برای: Bound-Soda Losses

تعداد نتایج: 246783  

A. Ghaemi, H. Hashemabadi M. Mahmoudian,

In the Bayer process, the reaction of silica in bauxite with caustic soda causes the loss of great amount of NaOH. In this research, the bound-soda losses in Bayer process solid residue (red mud) are predicted using intelligent techniques. This method, based on the application of regression and artificial neural networks (AAN), has been used to predict red mud bound-soda losses in Iran Alumina C...

In the present study, prediction of Alumina recovery efficiency (A.R.E), the amount of produced red mud (A.P.R), red mud settling rate (R.S.R) and bound-soda losses (B.S.L) in Bayer process red mud has been carried out for the first time in the field. These predictions are based on Lime to bauxite ratio and chemical analyses of bauxite and lime as Bayer process feed materials. Radial basis func...

Journal: :Journal of food science 2009
L Stahl K B Miller J Apgar D S Sweigart D A Stuart N McHale B Ou M Kondo W J Hurst

Little is known about the effects of common cooking processes on cocoa flavanols. Antioxidant activity, total polyphenols (TP), flavanol monomers, and procyanidin oligomers were determined in chocolate frosting, a hot cocoa drink, chocolate cookies, and chocolate cake made with natural cocoa powder. Recoveries of antioxidant activity, TP, flavanol monomers, and procyanidins ranged from 86% to o...

2009
Fei Li Jay Sethuraman Clifford Stein Baruch Awerbuch Boaz Patt-Shamir David Peleg Kevin Chen Radu Mihaescu Satish Rao Gagan Aggarwal Jason D. Hartline Julien Robert Nicolas Schabanel Ayelet Butman Danny Hermelin Moshe Lewenstein Dror Rawitz Kazuo Iwama Shuichi Miyazaki Naoya Yamauchi Thach Nguyen Jian Shen Minmei Hou Li Sheng Eyal Even-Dar Michael J. Kearns Siddharth Suri Ning Chen Anna R. Karlin Nikhil Bansal Kirk Pruhs Claire Mathieu Warren Schudy Ilan Gronau Shlomo Moran Sagi Snir Jessica Chang Thomas Erlebach Renars Gailis Samir Khuller Marek Krcal Jiri Sgall Matt Gibson Gaurav Kanade Erik Krohn Imran A. Pirwani Kasturi Varadarajan Naveen Garg Anupam Gupta Stefano Leonardi Piotr Sankowski

1. “An Optimal Online Algorithm for Packet Scheduling with Agreeable Deadlines,” Fei Li, Jay Sethuraman, Clifford Stein, SODA 2005: 801–802, (Fall 2007). 2. “Improved Recommendation systems,” Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark Tuttle, SODA 2005: 1174–1183, (Fall 2007). 3. “Overhang,” Mike Paterson and Uri Zwick, SODA 2006: 231–240, (Spring 2009). 4. “On the Tandem Duplication-...

Journal: :پژوهش های علوم و فناوری چوب و جنگل 0

the present research has been conducted to investigate the soda and soda-anthraquiuone pulping from whole kenaf (v36). in this respect, anatomical characteristics of kenaf bast and core fibers as well as the soda and soda-aq pulp properties produced at four sodium hydroxide concentrations, namely 25, 30, 35 and 40 (g/lit), have been evaluated. the pulping results indicated that pulp yield and k...

Doraid Dalalah

Loss-averse behavior makes the newsvendors avoid the losses more than seeking the probable gains as the losses have more psychological impact on the newsvendor than the gains. In economics and decision theory, the classical newsvendor models treat losses and gains equally likely, by disregarding the expected utility when the newsvendor is loss-averse. Moreover, the use of unbounded utility to m...

2014
Pierre Gaillard Gilles Stoltz Tim van Erven

We study online aggregation of the predictions of experts, and first show new second-order regret bounds in the standard setting, which are obtained via a version of the Prod algorithm (and also a version of the polynomially weighted average algorithm) with multiple learning rates. These bounds are in terms of excess losses, the differences between the instantaneous losses suffered by the algor...

Hassan Doosti, Yogendra P. Chaubey,

Here, we propose a method of estimation of the derivatives of probability density based wavelets methods for a sequence of m−dependent random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for the such estimators.

2007
Alexander Golynski

In this paper, we give two main technical results: (i) we show a stronger lower bound for substring search problem via compression extending results of Demaine and López-Ortiz (SODA ’01); (ii) improve the results of Gal and Miltersen (ICALP ’03) by showing a bound on the redundancy needed by the polynomial evaluation problem that is linear in terms of the information-theoretic minimum storage r...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید