Treatability Studies of Dairy Wastewater by Upflow Anaerobic Sludge Blanket Reactor

In any dairy plant, the quantity and characteristics of effluent is depending upon the extent of production activities, pasteurization of several milk products. The anaerobic digesters are used in the first phase of treatment, which is followed by high rate aerobic treatment. It remains as the most common effluent treatment scheme for dairy plants. The Indian dairy industry is stated to have the growth at more than 15% and waste water is poised to cross 150 million tones / annum. The requirement for milk and milk products is keep growing in steady state, making a significant impact on the Indian agriculture domain. The dairy industries require large quantity of water for the purpose of washing of cans, machinery and floor, the liquid waste in a dairy originates from manufacturing process, utilities and service section. So there is every need to reuse the waste water generated with proper and efficient treatment methods. Biological wastewater treatment has been performed in many different ways .In order to overcome the limitations of suspended and attached growth systems. Upflow Anaerobic Sludge Blanket reactors are designed. UASB is a hybrid type of reactor, involving both suspended and attached growth process. This study involves the treatment of dairy industry wastewater by UASB reactor by varying the retention times in days for a particular organic loading rate . This has effectively removed BOD, COD and other parameters because of the combined suspended and attached growth processes Keywords: UASB reactor, COD removal, biogas production

Identification of a surrogate anthropometric measurement to birth weight in high‑risk low birth weight newborns in a developing country

Background: The study of anthropometric measurements of newborns at birth allows rapid evaluation of the neonate who has suffered abnormal intrauterine growth. Thus, neonates at increased risk of postnatal complications can be followed‑up and given greater care.Objective: The aim of our study was to identify a simple anthropometric measurement which can act as a surrogate to birth weight (BW) in a resource‑poor country like India where the weight of majority of the newborns is not taken.Materials and Methods: We studied all consecutive singleton newborns with gestational age between 28 weeks and 42 weeks delivered at a large hospital in North India between January 2015 and December 2015. The total number of new‑borns included in the study was 3000. All data were entered and analyzed using Statistical Package for Social Sciences version 15.0 (SPSS Inc., Chicago, IL, USA).Results: The mean BW of 3000 neonates was 2387 g (standard deviation ‑ 560). The mean crown heel length, head circumference, chest circumference (CC), mid‑upper arm circumference, mid‑calf circumference, and mid‑thigh circumference were 45.9 ± 3.4 cm, 32.6.5 ± 2.3 cm, 29.5 ± 2.7 cm, 10.1 ± 1.3 cm, 10.5 ± 1.3, and 14.1 ± 1.2 cm, respectively. There was a positive correlation of BW to all such anthropometric measurements with the highest correlation coefficient for CC (r = 0.73). The optimal cutoff points for CC and arm circumference to identify low BW (LBW) newborns were ≥29.5 cm and ≥10.1 cm, respectively.Conclusion: Measurement of CC is a simple, easy, cheap, and reliable method for identification of LBW. Hence, it can be easily made use of identifying high‑risk newborns by our health‑care workers in rural settings of developing countries like India.Keywords: Anthropometric measurements, chest circumference, high‑risk newborns, low birth weigh

Removing Undesirable Flows by Edge Deletion

Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within 2√2|E| and 2√2(|E|+|undesirable flows|), respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming

Constructing tree decompositions of graphs with bounded gonality

In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of degree k that reaches all vertices is given. We also give a similar result for two related notions: stable divisorial gonality and stable gonality.</p

Adaptive wireless networks

GLOBECOM - IEEE Global Telecommunications Conference413

List scheduling in order of α-points on a single machine

Abstract. Many approximation results for single machine scheduling problems rely on the conversion of preemptive schedules into (preemptive or non-preemptive) solutions. The initial preemptive schedule is usually an optimal solution to a combinatorial relaxation or a linear programming relaxation of the scheduling problem under consideration. It therefore provides a lower bound on the optimal objective function value. However, it also contains structural information which is useful for the construction of provably good feasible schedules. In this context, list scheduling in order of so-called α-points has evolved as an important and successful tool. We give a survey and a uniform presentation of several approximation results for single machine scheduling with total weighted completion time objective from the last years which rely on the concept of α-points.