DC Polarographic and Plane Polarographic investigation of the reduction of Thallium(I) - Aqueous systems at dropping mercury electrode

The reduction behavior Thallium (I) at DME has been studied by several authors with different equivalent circuits and arrived at varying results. The complexity is due to the rapid reduction process and the adsorption behavior in the mercury solution interface. So, a thorough investigation was carried out on the reduction behavior of Thallium(I) at DME using DC polarographic and impedance methods assuming Randles and Laitinen (1955) basic equivalent circuit to hold good. The investigation was carried out in three different supporting electrolytes, sodium perchlorate, potassium nitrate and potassium chloride and for four different concentrations of depolariser. The double layer capacity was obtained by extrapolation method for all the systems. The reactant adsorption was established in the supporting electrolytes, potassium nitrate and potassium chloride. In the case of sodium perchlorate a different behavior was observed. Further theoretical phase sensitive ac polarograms are drawn to confirm the results. In all the systems, Thallium (I) proceeds with high degree of reversibility and the values of Ksh were found to be greater than one.Key words: Thallium, Impedance analysis, Plane Polarography, DC polarography

Effect of agronomic biofortification on growth, yield, uptake and quality characters of maize (Zea mays .L) through integrated management practices under North-eastern region of Tamil Nadu, India

Agronomic biofortification increases the concentration of target mineral in edible portions of crops by the use of mineral fertilizers to increase dietary intake of target minerals. Among these iron and zinc deficiencies in human nutrition are noticed in countries where maize is the staple food. The objective of this study was to evaluate agronomic biofortification performance in association with Integrated Nutrient Management in maize (Zea mays .L). The study was conducted under field conditions in Chinnakandiankuppam village, Vriddhachalam Taluk, in the North-eastern region of Tamil Nadu state, India of Kharif 2020 season. Two hybrids in main plots (M1 – Non biofortified and M2 – Biofortified) were combined with six treatments in sub-plots (100 % RDF through NPK (S1), 100 % RDF through FYM (S2), 50% RDF through NPK + 50% through FYM (S3) as soil application, S1+ Zinc + Iron (S4), S2 +Zinc + Iron (S5) and S3 + Zinc + Iron (S6) as foliar application with evaluations were carried out in wet season period of the year. Application of 50 percent RDF through NPK + 50 percent RDF through FYM with Fe, Zn, foliar applications (S6) was the most efficient agronomic biofortification practice for growth attributes, yield and yield attributes, nutrient uptake, and quality parameters for the maize cropping system under the irrigated condition of the northeastern zone of Tamilnadu State, India.

Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas

We show lower bounds of $\Omega(\sqrt{n})$ and $\Omega(n^{1/4})$ on the randomized and quantum communication complexity, respectively, of all $n$-variable read-once Boolean formulas. Our results complement the recent lower bound of $\Omega(n/8^d)$ by Leonardos and Saks and $\Omega(n/2^{\Omega(d\log d)})$ by Jayram, Kopparty and Raghavendra for randomized communication complexity of read-once Boolean formulas with depth $d$. We obtain our result by "embedding" either the Disjointness problem or its complement in any given read-once Boolean formula.Comment: 5 page

Serological diagnosis of pulmonary aspergillosis

Methods for the preparation of antigens from clinically isolated cultures of Aspergillus were standardized. Sera from 25 suspected cases of pulmonary aspergillosis were tested against antigens prepared by us, from 4 strains of A. fumigatus and one strain of A. flavus, using the Ouchterlony double diffusion and immunoelectrophoretic techniques. Of the 25 sera tested, 18 reacted positively with antigens of A.fumigatus, one with A.flavus and 2 with both these species. Antigens of two non-pathogenic Aspergilli included in the study failed to react with any of the sera. Our antigen preparations gave more numerous as well as sharper precipitin lines than the commercial Bencard antigens which were used for comparison. Moreover, mycelial antigens from 48 to 96 h old cultures revealed precipitin lines comparable to that of the routine, 4 week old culture filtrate antigens, thus suggesting that the incubation period for obtaining antigens could be cut down considerably

Contactless digital tachometer using microcontroller

Tachometer is a device that used for counting or for the measuring purpose of the number of revolutions (that is the total number rotations made by the device in unit of measuring time) of an object in unit time. It is expressed in the unit of RPS or RPM, the model uses a set of infrared transducer receiver to count the RPM pulses, and the Arduino microcontroller is used for the implementation of the project. The individual pulses are counted by the microcontroller to give the final output of the RPM

Improved Quantum Communication Complexity Bounds for Disjointness and Equality

We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of de Wolf. We also give an O(sqrt{n}c^{log^* n})-qubit bounded-error protocol for disjointness, modifying and improving the earlier O(sqrt{n}log n) protocol of Buhrman, Cleve, and Wigderson, and prove an Omega(sqrt{n}) lower bound for a large class of protocols that includes the BCW-protocol as well as our new protocol.Comment: 11 pages LaTe

The chromatic discrepancy of graphs

For a proper vertex coloring cc of a graph GG, let φc(G)φc(G) denote the maximum, over all induced subgraphs HH of GG, the difference between the chromatic number χ(H)χ(H) and the number of colors used by cc to color HH. We define the chromatic discrepancy of a graph GG, denoted by φ(G)φ(G), to be the minimum φc(G)φc(G), over all proper colorings cc of GG. If HH is restricted to only connected induced subgraphs, we denote the corresponding parameter by View the MathML sourceφˆ(G). These parameters are aimed at studying graph colorings that use as few colors as possible in a graph and all its induced subgraphs. We study the parameters φ(G)φ(G) and View the MathML sourceφˆ(G) and obtain bounds on them. We obtain general bounds, as well as bounds for certain special classes of graphs including random graphs. We provide structural characterizations of graphs with φ(G)=0φ(G)=0 and graphs with View the MathML sourceφˆ(G)=0. We also show that computing these parameters is NP-hard