sour cherry and orange juice were successfully cryoconcentrated. novel clarification (electro-flotation and ultra-filtration) improved cryconcentration efficiency. ef-uf clarified sour cherry and orange juices were cryoconcentrated in three stages up to 34.52±0.14, 44.42±0.19, 52.44±0.13 and 28.43±0.16, 40.51±0.15, and 45.42±0.19° brix at -10˚c respectively. duncan's multiple range test was use...

The aim of this study is to explore the capability of subcritical methanol to reduce the acidity of naphthenic acids and to determine reaction kinetics for large-scale reactor design.The experiments were carried out in a 25 mL autoclave reactor (China) at temperatures of 70-120oC, Methanol Partial Pressures (MPPs) of 0.1-1.5 MPa, and reaction times of 0-60 min. The total...

‎let $g=(v(g),e(g))$ be a graph‎, ‎$gamma_t(g)$. let $ooir(g)$ be the total domination and oo-irredundance number of $g$‎, ‎respectively‎. ‎a total dominating set $s$ of $g$ is called a $textit{total perfect code}$ if every vertex in $v(g)$ is adjacent to exactly one vertex of $s$‎. ‎in this paper‎, ‎we show that if $g$ has a total perfect code‎, ‎then $gamma_t(g)=ooir(g)$‎. ‎as a consequence, ...

given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...

‎a set $s$ of vertices of a graph $g=(v,e)$ without isolated vertex‎ ‎is a {em total dominating set} if every vertex of $v(g)$ is‎ ‎adjacent to some vertex in $s$‎. ‎the {em total domatic number} of‎ ‎a graph $g$ is the maximum number of total dominating sets into‎ ‎which the vertex set of $g$ can be partitioned‎. ‎we show that the‎ ‎total domatic number of a random $r$-regular graph is almost‎...