På vej mod nye mål i folkeskolens naturfagsundervisning

I august 2009 træder nye mål (Fælles Mål II) i kraft for naturfagene og en lang række andrefag i folkeskolen. Målrevisionen skal ses som en opfølgning på regeringens globaliseringsstrategi hvor“verdens bedste folkeskole” og “styrkelse af de centrale fagområder, læsning, matematik, naturfag ogengelsk” var blandt de vigtigste mål for den grundlæggende uddannelse i Danmark. På naturfagsområdethar udgangspunktet for revisionen af Fælles Mål været anbefalinger fra to ekspertudvalgnedsat af den tidligere og nuværende undervisningsminister. Artiklen beskriver de politiske rammerfor revisionen af Fælles Mål, udgangspunktet for de naturfaglige arbejdsgrupper og de væsentligsteelementer i de reviderede sæt af kundskabs- og færdighedsmål

Naturfagene i den nye læreruddannelse

Den nye læreruddannelse, der får virkning fra 1. august 2007, ændrer bl.a. grundlæggende linjefagsstrukturen i uddannelsen. Den lov vi forlader, indførte 4 linjefag for at styrke fagligheden i uddannelsen. Baggrunden for ændringen af uddannelsen mod færre linjefag skal ses som led i en politiskproces der har til formål fortsat at styrke både fagligheds- og evalueringskulturen i skolen. Nogle afnaturfagene ser for en umiddelbar betragtning ud til at stå styrket i den nye uddannelse. Men der erbegrundet tvivl om hvorvidt det nu også bliver tilfældet i praksis. Artiklen analyserer den nye uddannelsesmuligheder og problemer i forhold til bl.a. de valgmønstre som karakteriserede linjefagsvalgeti den gamle uddannelse. Endelig vurderes uddannelsen i forhold til de anbefalinger der blev givet afudvalget bag rapporten “Fremtidens naturfag i folkeskolen” fra februar 2006

Relación entre turismo, género y sexo: el caso de Buzios – Brasil

La relación entre sexo y turismo ha seguido diferentes caminos, desde el turismo para GLS hasta el turismo nudista o la prostitución. No obstante aún son pocas las iniciativas que tienden a interrumpir el flagelo, que deja grandes secuelas sociales y escandaliza a la opinión pública. Probablemente por el tabú que históricamente ha significado el sexo, suele ser problemática toda relación en la que esté implicado. Este artículo describe un estudio de caso realizado en el centro turístico de Buzios, en Brasil, donde se aplicaron tres variables en las cuales se encuentra involucrada la mujer, el turismo aparece como revelador del sexismo existente en la sociedad y queda manifiesta la eficacia de una política social de concientización en dos de las variables.The relationship between sex and tourism has followed different paths starting from the Gay / Lesbian friendly market to nudist tourism or prostitution. Not withstanding, there are sill few initiatives to stop this kind of tourism that brings with its huge social problems and scandalizes the public opinion. This is probably due to the fact that from an historic point of view matters related to sex are associated with taboo and therefore are not easy to understand. This article describes a case study made in Buzios, Brazil, by means of three variables in which women are implied and tourism appears as an indicator of the sexism that is evident in present society. Two variables show the efficiency of social policies of consciousness.Facultad de Periodismo y Comunicación Socia

Gastronomía y Turismo. Destinos con sal y pimienta

La publicación digital Gastronomía y Turismo. Destinos con sal y pimienta, coordinada o anfitrionada por Juana Alejandrina Norrild, ha sido editada en 2017 por el Centro de Investigaciones y Estudios Turísticos [CIET], Argentina; y es el primer libro de la colección Estudios y Realidades. Cuenta con más de 400 páginas y 23 capítulos distribuidos en un menú de cuatro pasos, carta de vinos y sobremesa, que cubren un amplio espectro de temas relacionados con la gastronomía y el turismo, de los cuales se hace un profundo análisis y se abren jugosos debates. La publicación se puede bajar libremente del sitio web del CIET [cietutisticos.com.ar] y resulta de interés para un amplio perfil de lectores, desde investigadores académicos, profesionales del área de turismo, docentes, estudiantes, hasta cocineros y otros profesionales gastronómicos. Se realizan interesantes exposiciones y profundos análisis teóricos de los temas de vanguardia del ámbito de la gastronomía y el turismo. Asimismo se presentan enriquecedores estudios de distintos casos de América, España y Portugal.  AUTORJuana Alejandrina Norrild - Licenciada en Comunicación Social, Universidad de La Plata, La Plata, Argentina. Es Editora Asociada de la revista Estudios Y Perspectivas en Turismo (Argentina) y Co-Directora de la colección de publicaciones Estudios y Realidades del CIET (Argentina).  E-mail: [email protected]

Inhibition of glycosylation of herpes simplex virus glycoproteins: Identification of antigenic and immunogenic partially glycosylated glycopeptides on the cell surface membrane

The surface membranes of cells infected with herpes simplex virus type 1 (HSV-1), strain KOS, contain three principal glycoproteins, gC (apparent Mr 129k), gB (apparent Mr 120k), and gD (apparent Mr 58k). Infections carried out in the presence of the glycosylation inhibitor 2-deoxy--glucose result in the loss of the mature species with the concurrent appearance of lower-molecular-weight polypeptides which are presumably partially glycosylated forms of the fully processed glycoproteins. Specific immunoprecipitation of radiolabeled cytoplasmic extracts of 2-deoxy--glucose-inhibited infections identified partially glycosylated proteins designated DG92, DG88, and DG53, which are antigenically related to the corresponding mature forms gB, gC, and gD. Cell surface radioiodination, in combination with specific immunoprecipitation, revealed that DG88 and DG53 were the principal species transported to the cell surface in 2-deoxy--glucose-inhibited infections. DG92 was readily detected in the cytoplasm but not on the plasma membrane. Cells infected with the KOS mutant, syn LD70, did not synthesize glycoprotein gC. In glycosylation-inhibited syn LD70 infections, DG88 was not detected in either the cytoplasm or plasma membrane, demonstrating a genetic relationship between DG88 and gC. Polyclonal and monoclonal antibodies directed against the glycoproteins gC, gB, and gD sensitized infected cells to complement-mediated immune cytolysis. Cells infected in the presence of the inhibitor were sensitized to lysis only by antibody specific for gC and gD. The glycosylation-inhibited cells were insensitive to immunolysis by anti-gB monoclonal antibody. These findings confirm that the glycosylation-deficient forms of gC and gD, but not gB reach the cell surface in the presence of inhibitor and that the inhibitor-induced alterations in glycosylation do not cause a complete loss of antigenicity. Inoculation of mice with syngeneic 3T3 cells infected in the presence or absence of inhibitor-induced cytolytic and neutralizing antibody. A major portion of the cytolytic antibody was directed against gC, but anti-gC antibody appeared to play a minor role in virus neutralization. While the serum induced by the control infected cells contained precipitating antibodies for gC, gB, and gD, the serum derived from mice inoculated with inhibitor-treated infected cells had only weak immunoprecipitating activity against gB. Together, these findings have identified partially glycosylated forms of the major HSV glycoproteins and show that complete glycosylation is not required for transport of some of these partially glycosylated polypeptides to the cell surface. Moreover, complete glycosylation of the glycopeptides is not essential for maintenance of antigenicity or immunogenicity, indicating that at least some determinants recognized by antibodies directed against the mature glycoproteins are not affected by 2-deoxy--glucose-induced carbohydrate alterations.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/25239/1/0000681.pd

State of the Art Report: Verified Computation

This report describes the state of the art in verifiable computation. The problem being solved is the following: The Verifiable Computation Problem (Verifiable Computing Problem) Suppose we have two computing agents. The first agent is the verifier, and the second agent is the prover. The verifier wants the prover to perform a computation. The verifier sends a description of the computation to the prover. Once the prover has completed the task, the prover returns the output to the verifier. The output will contain proof. The verifier can use this proof to check if the prover computed the output correctly. The check is not required to verify the algorithm used in the computation. Instead, it is a check that the prover computed the output using the computation specified by the verifier. The effort required for the check should be much less than that required to perform the computation. This state-of-the-art report surveys 128 papers from the literature comprising more than 4,000 pages. Other papers and books were surveyed but were omitted. The papers surveyed were overwhelmingly mathematical. We have summarised the major concepts that form the foundations for verifiable computation. The report contains two main sections. The first, larger section covers the theoretical foundations for probabilistically checkable and zero-knowledge proofs. The second section contains a description of the current practice in verifiable computation. Two further reports will cover (i) military applications of verifiable computation and (ii) a collection of technical demonstrators. The first of these is intended to be read by those who want to know what applications are enabled by the current state of the art in verifiable computation. The second is for those who want to see practical tools and conduct experiments themselves.Comment: 54 page

State of the Art Report : Verified Computation

This report describes the state of the art in verifiable computation. The problem being solved is the following: The Verifiable Computation Problem (Verifiable Computing Problem) Suppose we have two computing agents. The first agent is the verifier, and the second agent is the prover. The verifier wants the prover to perform a computation. The verifier sends a description of the computation to the prover. Once the prover has completed the task, the prover returns the output to the verifier. The output will contain proof. The verifier can use this proof to check if the prover computed the output correctly. The check is not required to verify the algorithm used in the computation. Instead, it is a check that the prover computed the output using the computation specified by the verifier. The effort required for the check should be much less than that required to perform the computation. This state-of-the-art report surveys 128 papers from the literature comprising more than 4,000 pages. Other papers and books were surveyed but were omitted. The papers surveyed were overwhelmingly mathematical. We have summarised the major concepts that form the foundations for verifiable computation. The report contains two main sections. The first, larger section covers the theoretical foundations for probabilistically checkable and zero-knowledge proofs. The second section contains a description of the current practice in verifiable computation. Two further reports will cover (i) military applications of verifiable computation and (ii) a collection of technical demonstrators. The first of these is intended to be read by those who want to know what applications are enabled by the current state of the art in verifiable computation. The second is for those who want to see practical tools and conduct experiments themselves