The freshwater fingerlings of Cirrhinus mrigala were exposed to Nickel in acidic medium pH = 6.0 (5.8-6.2), alkaline medium pH = 9.0 (8.8-9.2) and water hardness (40 mg/l) of CaCO3. The study indicates that nickel accumulation was significantly influenced by pH and hardness of water The concentration was found to be significantly higher at pH = 9.0 than at pH = 6.0. Also the presence of hardnes...

A hardness-based model for tailor hardened boron steel is presented that takes into account the softened heat-affected zone of resistance spot welds. The computational model is designed for crashworthiness simulation of fully and partially hardened components obtained by tailored tooling. Five different hardness grades of 22MnB5 are used for model calibration. The proposed model is validated wi...

D. Dobrotă, C. Iancu, Engineering Faculty, “Constantin Brâncuşi” University of Târgu-Jiu, Romania This paper presents the results of the main changes in the chemical composition of the material, and changes in its hardness. The changes in terms of chemical composition refer primarily to changes in concentration of sulfur and carbon, and in terms of hardness material change there can be noticed ...

In this paper we prove, that the problem ”kdim(G) ≤ 3” is polynomially solvable for chordal graphs, thus partially solving the problem of P. Hlineny and J. Kratochvil. We show, that the problem of finding m-krausz dimension is NP-hard for every m ≥ 1, even if restricted to (1,2)-colorable graphs, but the problem ”kdimm(G) ≤ k” is polynomially solvable for (∞, 1)-polar graphs for every fixed k,m...

In this note, we point out two major errors in the paper “Minimizing total tardiness on parallel machines with preemptions” by Kravchenko and Werner [2010]. More precisely, they proved that both problems P |pmtn| ∑ Tj and P |rj , pj = p, pmtn| ∑ Tj are NP-Hard. We give a counterexample to their proofs, letting the complexity of these two problems open.

Remark 1. One may wonder why Impagliazzo’s hard core lemma (see the previous lecture for the lemma statement) is not enough to get a 12 −2 −δn-hard function starting with a 2−δn-hard function. The difficulty lies in the fact that the hard core lemma only tells about the existence of a hard core set such that on that set f is 1 2 − 2 −δn -hard. We do not know how to sample from that hard core se...

From 07/02/10 to 12/02/10, the Dagstuhl Seminar 10061 Circuits, Logic, and Games was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in thi...