Nature of chemistry in the national frame curricula for upper secondary education in Finland, Norway and Sweden

The aim of this study was to discover how current chemistry syllabi in the frame curricula for up- per secondary education in three Nordic countries (Finland, Norway, and Sweden) take into account topics related to the nature of chemistry. By qualitative content analysis, the statements related to the nature of chemistry were divided into categories. Conclusions and implications for improving the frame curricula under study were made by comparing results with research into the nature of science. Chemistry syllabi from the Nordic frame curricula analyzed take into account the aims related to the nature of chemistry in a very similar manner. The ideas that should be made more explicit in all of the analyzed curricula are: i) the limits of the chemical models and theories, ii) the relationship between chemistry and other natural sciences, iii) the importance of creativity in chemical research, iv) the concepts of evidence in science texts, v) the social nature of chemical research, and vi) chemistry as a technological practice.

Women, Management and Leadership - Naiset ja johtajuus : NASTA Women's Leadership Project Final Report

Leadership without the full participation of women not only excludes women individually and collectively, but is also a huge waste of talent, knowledge and expertise. And crucially, given the current state of society and the world, this aspect of gender inequality is likely to become even more important in the future. NASTA - Women’s Leadership: A Research and Education Development Project was established in 2005 as a national multi-university project mainly and generously funded by Finnish Ministry of Education. The project aims at producing new knowledge and increasing understanding about women’s leadership, as well as promoting women’s leadership through research, development of teaching, and public outreach. NASTA is a joint effort of three Finnish universities – Hanken School of Economics, University of Jyväskylä School of Business and Economics, and the Helsinki School of Economics (now part of Aalto University) – and has been coordinated by Hanken. This report presents research and activities conducted within and around the project. NASTA activities have been many and various. They have examined the position and experiences of women in relation to leadership, management, organisation and work more generally. They have sought new knowledge about gender and leadership, on women leaders’ values, attitudes and behaviour, as well as about values, attitudes and behaviour in relation to women’s leadership. NASTA activities have included teaching, student supervision, research theses, research projects, publishing, networking, seminars, meetings, an international conference, and knowledge transfer into other sectors of society. The first section of the book introduces NASTA joint projects, including web-based teaching material, a survey of gender staffing and teaching on gender in business schools, critical review of previous research literature, and new empirical research. The next section includes research articles on different aspects of gender, leadership and manage¬¬ment from more individual projects conducted by participating researchers and research groups linked to NASTA across the three universities. The final section includes short presentations of other research in progress. The appendix lists publications by NASTA members – journal articles, research reports, books, chapters, journal special issues, popular journal articles, magazine articles - and masters, licentiate and doctoral theses that have been produced. These matters of women, leadership and management are not simply academic concerns but urgent matters for practice, organisations, management, policy, and society more generally.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

Popular mixed matchings

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M, T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based on the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distribution over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P, Q) >= phi(Q, P) for all mixed matchings Q. We show that popular mixed matchings always exist and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem. (C) 2010 Elsevier B.V. All rights reserved.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

A Tutorial on Integrating CDS/ISIS Databases with the World Wide Web

With the emergence of Internet, the global connectivity of computers has become a reality. Internet has progressed to provide many user-friendly tools like Gopher, WAIS, WWW etc. for information publishing and access. The WWW, which integrates all other access tools, also provides a very convenient means for publishing and accessing multimedia and hypertext linked documents stored in computers spread across the world. With the emergence of WWW technology, most of the information activities are becoming Web-centric. Once the information is published on the Web, a user can access this information from any part of the world. A Web browser like Netscape or Internet Explorer is used as a common user interface for accessing information/databases. This will greatly relieve a user from learning the search syntax of individual information systems. Libraries are taking advantage of these developments to provide access to their resources on the Web. CDS/ISIS is a very popular bibliographic information management software used in India. In this tutorial we present details of integrating CDS/ISIS with the WWW. A number of tools are now available for making CDS/ISIS database accessible on the Internet/Web. Some of these are 1) the WAIS_ISIS Server. 2) the WWWISIS Server 3) the IQUERY Server. In this tutorial, we have explained in detail the steps involved in providing Web access to an existing CDS/ISIS database using the freely available software, WWWISIS. This software is developed, maintained and distributed by BIREME, the Latin American & Caribbean Centre on Health Sciences Information. WWWISIS acts as a server for CDS/ISIS databases in a WWW client/server environment. It supports functions for searching, formatting and data entry operations over CDS/ISIS databases. WWWISIS is available for various operating systems. We have tested this software on Windows '95, Windows NT and Red Hat Linux release 5.2 (Appolo) Kernel 2. 0. 36 on an i686. The testing was carried out using IISc's main library's OPAC containing more than 80,000 records and Current Contents issues (bibliographic data) containing more than 25,000 records. WWWISIS is fully compatible with CDS/ISIS 3.07 file structure. However, on a system running Unix or its variant, there is no guarantee of this compatibility. It is therefore safe to recreate the master and the inverted files, using utilities provided by BIREME, under Unix environment.

The Asian elephants Elephas maximus of Cat Tien National Park, Vietnam: status and conservation of a vanishing population

This study updates the status and conservation of the Endangered Asian elephant Elephas maximus in Cat Tien National Park, Vietnam. Line transect indirect surveys, block surveys for elephant signs, village surveys of elephant-human conflict incidents, guard-post surveys for records of sightings, and surveys of elephant food plants were undertaken during the dry and wet seasons of 2001. A minimum of 11 elephants and a maximum of 15-17 elephants was estimated for c. 500 km2 of the Park and its vicinity. The elephants are largely confined to the southern boundary of the Park and make extensive use of the adjoining La Nga State Forest Enterprises. During the dry season the elephants depend on at least 26 species of wild and cultivated plants, chiefly the fruits of cashew. Most of the villages surveyed reported some elephant-human conflict. Two adult male elephants seem to cover a large area to raid crops, whereas the family groups restrict themselves to a few villages; overall, the conflict is not serious. Since 2001 there have been no reports of any deaths or births of elephants in the Park. We make recommendations for habitat protection and management, increasing the viability of the small population, reducing elephant-human conflicts, and improving the chances of survival of the declining elephants of this Park. The Government has now approved an Action Plan for Urgent Conservation Areas in Vietnam that calls for the establishment of three elephant conservation areas in the country, including Cat Tien National Park.