Jeanette Hernandez

The removal of water from mines was one of the key issues that former miners had to deal with. Roman colonists brought new technology to the Iberian Peninsula that addressed this problem. However, they did not invent this technology because it had already been applied to the growth of other endeavours in the Hellenistic society throughout the Eastern Mediterranean. In the mine, the Archimedes screw, waterwheels, bucket pulleys, and Ctesibius pumps were the primary drainage systems. In this essay, the primary characteristics, and modes of operation of machines are examined. Without leaving out the most significant finds made in the southwest of the Iberian Peninsula, one of the regions with the longest history of mining exploitation. To serve as a foundation for future research in this field, this work compares the primary mining mechanisms in ancient Huelva on a qualitative and quantitative level by the implementation of a TOPSIS methodology, a multi-criteria decision analysis method.

Counting models for a two conjunctive formula $F$, a problem known as $\sharp $2Sat, is a classic $\sharp $P complete problem. Given a 2-CF $F$ as input, its constraint graph $G$ is built. If $G$ is acyclic, then $\sharp $2Sat can be computed efficiently. In this paper, we address the case when $G$ has cycles. When $G$ is cyclic, we propose a decomposition on the constraint graph $G$ that allows the computation of $\sharp $2Sat in incremental way. Let $T$ be a cactus graph of $G$ containing a maximal number of independent cycles, and let $\overline{T}=-E)$ be a subset of frond edges from $G$. The clauses in $\overline{T}$ are ordered in connected components $\{K_1, \ldots, K_r\}$. Each $, i=1,\ldots,r$ is a knot of the graph. The arrangement of the clauses of $\overline{T}$ allows the decomposition of $G$ in knots and provides a way of computing $\sharp $2Sat in an incremental way. Our procedure has a bottom-up orientation for the computation of $\sharp $2Sat. It begins with $F_0 = T$. In each iteration of the procedure, a new clause $C_i \in \overline{T}$ is considered in order to form $F_i = $ and then to compute $\sharp $2Sat$$ based on the computation of $\sharp $2Sat$$.

The focus of this study was to analyze the content, distribution, and comparative genome relationships of 996 chromosome bin-mapped expressed sequence tags accounting for 2266 restriction fragments on the homoeologous group 3 chromosomes of hexaploid wheat. Of these loci, 634, 884, and 748 were mapped on chromosomes 3A, 3B, and 3D, respectively. The individual chromosome bin maps revealed bins with a high density of mapped ESTs in the distal region and bins of low density in the proximal region of the chromosome arms, with the exception of 3DS and 3DL. These distributions were more localized on the higher-resolution group 3 consensus map with intermediate regions of high-mapped-EST density on both chromosome arms. Gene ontology classification of mapped ESTs was not significantly different for homoeologous group 3 chromosomes compared to the other groups. A combined analysis of the individual bin maps using 537 of the mapped ESTs revealed rearrangements between the group 3 chromosomes. Approximately 232 of the consensus mapped ESTs matched sequences on rice chromosome 1 and revealed large- and small-scale differences in gene order. Of the group 3 mapped EST unigenes ∼21 and 32% matched the Arabidopsis coding regions and proteins, respectively, but no chromosome-level gene order conservation was detected.