Características de los ejercicios de prácticas de laboratorio incluidos en los libros de textos de Ciencias utilizados en Cataluña

The laboratory exercices in science textbooks used in grades 9 to 12 in Catalonian schools were content analyzed by three instruments: The Inquiry Leve1 Index (ILI), the Laboratory Assessment Inventory (LAI) and the Laboratory Dimenssions Inventory (LDI). The analysis was carried out by 24 teachers under the guidance of two science educators as an assignment in an in-service course on teaching and evaluation in the laboratory. It was found that the number of laboratory exercises offered in Catalonian science texbooks is rather small compared with texbooks in countries such as the U. K. and U.S.A. Most of the exercises are of low inquiry level featuring manipulation but missing high other inquiry skills such as formulating questions and hypotheses, designing experiments, etc. The relationship between practical work and theory is hardly indicated and the potential of the laboratory as a means to enhancing concept learning andlor developing social skills are hardly being considered. There is an urgent need to reform laboratory work in Catalonian schools

The Geometric Maximum Traveling Salesman Problem

We consider the traveling salesman problem when the cities are points in R^d for some fixed d and distances are computed according to geometric distances, determined by some norm. We show that for any polyhedral norm, the problem of finding a tour of maximum length can be solved in polynomial time. If arithmetic operations are assumed to take unit time, our algorithms run in time O(n^{f-2} log n), where f is the number of facets of the polyhedron determining the polyhedral norm. Thus for example we have O(n^2 log n) algorithms for the cases of points in the plane under the Rectilinear and Sup norms. This is in contrast to the fact that finding a minimum length tour in each case is NP-hard. Our approach can be extended to the more general case of quasi-norms with not necessarily symmetric unit ball, where we get a complexity of O(n^{2f-2} log n). For the special case of two-dimensional metrics with f=4 (which includes the Rectilinear and Sup norms), we present a simple algorithm with O(n) running time. The algorithm does not use any indirect addressing, so its running time remains valid even in comparison based models in which sorting requires Omega(n \log n) time. The basic mechanism of the algorithm provides some intuition on why polyhedral norms allow fast algorithms. Complementing the results on simplicity for polyhedral norms, we prove that for the case of Euclidean distances in R^d for d>2, the Maximum TSP is NP-hard. This sheds new light on the well-studied difficulties of Euclidean distances.Comment: 24 pages, 6 figures; revised to appear in Journal of the ACM. (clarified some minor points, fixed typos

Grover's Quantum Search Algorithm and Diophantine Approximation

In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result was generalized to the case of finding one object in a subset of marked elements. We consider the following computational problem: A subset of marked elements is given whose number of elements is either M or K, M<K, our task is to determine which is the case. We show how to solve this problem with a high probability of success using only iterations of Grover's basic step (and no other algorithm). Let m be the required number of iterations; we prove that under certain restrictions on the sizes of M and K the estimation m < (2N^{1/2})/(K^{1/2}-M^{1/2}) obtains. This bound sharpens previous results and is known to be optimal up to a constant factor. Our method involves simultaneous Diophantine approximations, so that Grover's algorithm is conceptualized as an orbit of an ergodic automorphism of the torus. We comment on situations where the algorithm may be slow, and note the similarity between these cases and the problem of small divisors in classical mechanics.Comment: 8 pages, revtex, Title change

Feeding live prey to zoo animals: response of zoo visitors in Switzerland

In summer 2007, with the help of a written questionnaire, the attitudes of more than 400 visitors to the zoological garden of Zurich, Switzerland, toward the idea of feeding live insects to lizards, live fish to otters, and live rabbits to tigers were investigated. The majority of Swiss zoo visitors agreed with the idea of feeding live prey (invertebrates and vertebrates) to zoo animals, both off- and on-exhibit, except in the case of feeding live rabbits to tigers on-exhibit. Women and frequent visitors of the zoo disagreed more often with the on-exhibit feeding of live rabbits to tigers. Study participants with a higher level of education were more likely to agree with the idea of feeding live invertebrates and vertebrates to zoo animals off-exhibit. In comparison to an earlier study undertaken in Scotland, zoo visitors in Switzerland were more often in favor of the live feeding of vertebrates. Feeding live prey can counter the loss of hunting skills of carnivores and improve the animals’ well-being. However, feeding enrichments have to strike a balance between optimal living conditions of animals and the quality of visitor experience. Our results show that such a balance can be found, especially when live feeding of mammals is carried out off-exhibit. A good interpretation of food enrichment might help zoos to win more support for the issue, and for re-introduction programs and conservation

Reading fiction and reading minds : the role of simulation in the default network

Research in psychology has suggested that reading fiction can improve individuals’ social-cognitive abilities. Findings from neuroscience show that reading and social cognition both recruit the default network, a network which is known to support our capacity to simulate hypothetical scenes, spaces and mental states. The current research tests the hypothesis that fiction reading enhances social cognition because it serves to exercise the default subnetwork involved in theory of mind. While undergoing functional neuroimaging, participants read literary passages that differed along two dimensions: (i) vivid vs abstract and (ii) social vs non-social. Analyses revealed distinct subnetworks of the default network respond to the two dimensions of interest: the medial temporal lobe subnetwork responded preferentially to vivid passages, with or without social content; the dorsomedial prefrontal cortex (dmPFC) subnetwork responded preferentially to passages with social and abstract content. Analyses also demonstrated that participants who read fiction most often also showed the strongest social cognition performance. Finally, mediation analysis showed that activity in the dmPFC subnetwork in response to the social content mediated this relation, suggesting that the simulation of social content in fiction plays a role in fiction’s ability to enhance readers’ social cognition

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geometric duality relationship between MWMP, MTSP, and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields in near-linear time solutions as well as upper bounds. Using various computational tools, we get solutions within considerably less than 1% of the optimum. An interesting feature of our approach is that, even though an FWP is hard to compute in theory and Edmonds' algorithm for maximum weighted matching yields a polynomial solution for the MWMP, the practical behavior is just the opposite, and we can solve the FWP with high accuracy in order to find a good heuristic solution for the MWMP.Comment: 20 pages, 14 figures, Latex, to appear in Journal of Experimental Algorithms, 200