First-principles study of the neutral molecular metal Ni(tmdt)2.

The electronic structure of the molecular solid Ni(tmdt)2, the only well characterized neutral molecular metal to date, has been studied by means of first-principles density functional calculations. It is shown that these calculations correctly describe the metallic vs semiconducting behavior of molecular conductors of this type. The origin of the band overlap leading to the metallic character and the associated Fermi surfaces has been studied.

Heavy metal accumulation by intestinal helminths of vertebrates

The relevancy of parasites as potential indicators of environmental quality has been increasing over the last years, mostly due to the variety of ways in which they respond to anthropogenic pollution. The use of fish parasites as bioindicators of heavy metal pollution in aquatic ecosystems has been widely studied. However, little information concerning terrestrial habitats is presently available. In fact, in the last two decades several studies have been performed worldwide in different habitats and/or conditions (theoretically both in polluted and unpolluted terrestrialecosystems, but mainly in aquatic ecosystems) in order to investigate heavy metal pollution using parasitological models. Different groups of vertebrates (mainly fish, mammals and birds) and several parasitological models have been tested involving acanthocephalans mostly, but also cestodes and nematodes. It is not the aim of this chapter to do a complete revision of the availabledata concerning this subject. Instead, we emphasize some general aspects and compile a mini-review of the work performed in this field by our research group. The results obtained until now allow confirming several parasitic models as promising bioindicator systems to evaluate environmental cadmium and mainly lead pollution in terrestrial non-urban habitats, as it was already demonstrated for aquatic ecosystems. The present knowledge also allows confirming that parasites can reveal environmental impact. Environmental parasitology is an interdisciplinary field, which needs simultaneous expertise from toxicology, environmental chemistry and parasitology. Furthermore, environmental parasitology should be taken into account in order to increase the efficiency of environmental monitoring programs.

Heavy metal accumulation by intestinal helminths of vertebrates

The relevancy of parasites as potential indicators of environmental quality has been increasing over the last years, mostly due to the variety of ways in which they respond to anthropogenic pollution. The use of fish parasites as bioindicators of heavy metal pollution in aquatic ecosystems has been widely studied. However, little information concerning terrestrial habitats is presently available. In fact, in the last two decades several studies have been performed worldwide in different habitats and/or conditions (theoretically both in polluted and unpolluted terrestrialecosystems, but mainly in aquatic ecosystems) in order to investigate heavy metal pollution using parasitological models. Different groups of vertebrates (mainly fish, mammals and birds) and several parasitological models have been tested involving acanthocephalans mostly, but also cestodes and nematodes. It is not the aim of this chapter to do a complete revision of the availabledata concerning this subject. Instead, we emphasize some general aspects and compile a mini-review of the work performed in this field by our research group. The results obtained until now allow confirming several parasitic models as promising bioindicator systems to evaluate environmental cadmium and mainly lead pollution in terrestrial non-urban habitats, as it was already demonstrated for aquatic ecosystems. The present knowledge also allows confirming that parasites can reveal environmental impact. Environmental parasitology is an interdisciplinary field, which needs simultaneous expertise from toxicology, environmental chemistry and parasitology. Furthermore, environmental parasitology should be taken into account in order to increase the efficiency of environmental monitoring programs.

Somatostatin Subtype‑2 Receptor-Targeted Metal-Based Anticancer Complexes

Conjugates of a dicarba analogue of octreotide, a potent somatostatin agonist whose receptors are overexpressed on tumor cells, with [PtCl2(dap)] (dap = 1-(carboxylic acid)-1,2-diaminoethane) (3), [(η6-bip)Os(4-CO2-pico)Cl] (bip = biphenyl, pico = picolinate) (4), [(η6-p-cym)RuCl(dap)]+ (p-cym = p-cymene) (5), and [(η6-p-cym)RuCl(imidazole-CO2H)(PPh3)]+ (6), were synthesized by using a solid-phase approach. Conjugates 35 readily underwent hydrolysis and DNA binding, whereas conjugate 6 was inert to ligand substitution. NMR spectroscopy and molecular dynamics calculations showed that conjugate formation does not perturb the overall peptide structure. Only 6 exhibited antiproliferative activity in human tumor cells (IC50 = 63 ± 2 μM in MCF-7 cells and IC50 = 26 ± 3 μM in DU-145 cells) with active participation of somatostatin receptors in cellular uptake. Similar cytotoxic activity was found in a normal cell line (IC50 = 45 ± 2.6 μM in CHO cells), which can be attributed to a similar level of expression of somatostatin subtype-2 receptor. These studies provide new insights into the effect of receptor-binding peptide conjugation on the activity of metal-based anticancer drugs, and demonstrate the potential of such hybrid compounds to target tumor cells specifically.

Structures of ethylenediaminetetraacetato (3-) metal complexes. I complexes with Co, Mg and Cd metals

(I): Hexaaquacobalt(II) aqua[ethylenediaminetetraacetato(3-)]cobaltate(II) dihydrate, [Co(H2O)6][Co(C10H13N2O8)(H2O)]2.2H2O (Ibis): Hexaaquamagnesium(II) aqua[ethylenediaminetetraacetato(3-)]magnesiate(II) dihydrate, [Mg(H2O)6][Mg(C10H13N2O8)(H2O)]2.2H2O (II):Tetraaquabis{aqua[ethylenediaminetetraacetato(3-)]cadmium(II)-O-O'}Cadmium(II) tetrahydrate

Structures of ethylenediaminetetraacetato (3-) metal complexes. I complexes with Co, Mg and Cd metals

(I): Hexaaquacobalt(II) aqua[ethylenediaminetetraacetato(3-)]cobaltate(II) dihydrate, [Co(H2O)6][Co(C10H13N2O8)(H2O)]2.2H2O (Ibis): Hexaaquamagnesium(II) aqua[ethylenediaminetetraacetato(3-)]magnesiate(II) dihydrate, [Mg(H2O)6][Mg(C10H13N2O8)(H2O)]2.2H2O (II):Tetraaquabis{aqua[ethylenediaminetetraacetato(3-)]cadmium(II)-O-O'}Cadmium(II) tetrahydrate

Structures of ethylenediaminetetraacetato (3-) metal complexes. I complexes with Co, Mg and Cd metals

(I): Hexaaquacobalt(II) aqua[ethylenediaminetetraacetato(3-)]cobaltate(II) dihydrate, [Co(H2O)6][Co(C10H13N2O8)(H2O)]2.2H2O (Ibis): Hexaaquamagnesium(II) aqua[ethylenediaminetetraacetato(3-)]magnesiate(II) dihydrate, [Mg(H2O)6][Mg(C10H13N2O8)(H2O)]2.2H2O (II):Tetraaquabis{aqua[ethylenediaminetetraacetato(3-)]cadmium(II)-O-O'}Cadmium(II) tetrahydrate

Stereoselective Acetate Aldol Reactions From Metal Enolates

This review deals with metal enolate-mediated stereoselective acetate aldol reactions. It summarizes recent advances on aldol additions of unsubstituted metal enolates from chiral auxiliaries, stoichiometric and catalytic Lewis acids, or acting in substrate- controlled reactions, which provide stereocontrolled aldol transformations that allow the efficient synthesis of structurally complex natural products.

Metal leaching from a limestone quarry minesoil made with thermally-dried sewage sludge

Peer Reviewed

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

How hard is a commercial puzzle: the eternity II challenge

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.