Globalisation and MA TESOL programs in the UK

This article reports the results of a mixed-methods approach to investigating the association between globalisation and MATESOL in UK universities. Qualitative and quantitative data collected from academic staff through eight emails, four interviews and 41 questionnaires indicate that the globalised context of higher education have affected these programmes in a number of ways including an increasing interest in recruiting more international students and a growing awareness about the need for curriculum and content modifications. The analysis of the data suggests that although change has been an inherent characteristic of these MAs over the past decade, it has been implemented gradually and conservatively, often relying on a dialectic relationship between academic staff and universities’ policies. The results imply that factors other than globalisation have also been at work. Many of the participants contend that globalisation has not lowered the quality of these MAs or standards of good practice.

Precise analysis of array usage in scientific programs

The automatic transformation of sequential programs for efficient execution on parallel computers involves a number of analyses and restructurings of the input. Some of these analyses are based on computing array sections, a compact description of a range of array elements. Array sections describe the set of array elements that are either read or written by program statements. These sections can be compactly represented using shape descriptors such as regular sections, simple sections, or generalized convex regions. However, binary operations such as Union performed on these representations do not satisfy a straightforward closure property, e.g., if the operands to Union are convex, the result may be nonconvex. Approximations are resorted to in order to satisfy this closure property. These approximations introduce imprecision in the analyses and, furthermore, the imprecisions resulting from successive operations have a cumulative effect. Delayed merging is a technique suggested and used in some of the existing analyses to minimize the effects of approximation. However, this technique does not guarantee an exact solution in a general setting. This article presents a generalized technique to precisely compute Union which can overcome these imprecisions.

Causation, complexity, and the concert: the pragmatics of causal explanation in international relations

A causal explanation provides information about the causal history of whatever is being explained. However, most causal histories extend back almost infinitely and can be described in almost infinite detail. Causal explanations therefore involve choices about which elements of causal histories to pick out. These choices are pragmatic: they reflect our explanatory interests. When adjudicating between competing causal explanations, we must therefore consider not only questions of epistemic adequacy (whether we have good grounds for identifying certain factors as causes) but also questions of pragmatic adequacy (whether the aspects of the causal history picked out are salient to our explanatory interests). Recognizing that causal explanations differ pragmatically as well as epistemically is crucial for identifying what is at stake in competing explanations of the relative peacefulness of the nineteenth-century Concert system. It is also crucial for understanding how explanations of past events can inform policy prescription.

Aligning IS programs with industry: linking business analysis curricula design with the professional body

Aligning information systems (IS) solutions with business goals and needs are crucial for IS activities. IS professionals who are able to work closely with both the business and technical staff are key enablers of business and IT alignment. IS programs in higher education (HE) institutions have a long tradition of enabling graduates to develop the appropriate skills needed for their future careers. Yet, organizations are still having difficulty finding graduates who possess both the knowledge and skills that are best suited to their specific requirements. Prior studies suggest that IS curricula are often ill-matched with industry/business needs. This study reports on the business analysis curricula (re) design which was undertaken to align it with a key professional body for the IS industry. This study presents the approaches taken in the (re) design of the module, and provides a discussion of the wider implications for IS curricula design. The results show a positive outcome for the HE and professional body partnership.

Programs to compute magnetization to density ratio and the magnetization inclination from 3-D gravity and magnetic anomalies

Vector field formulation based on the Poisson theorem allows an automatic determination of rock physical properties (magnetization to density ratio-MDR-and the magnetization inclination-MI) from combined processing of gravity and magnetic geophysical data. The basic assumptions (i.e., Poisson conditions) are: that gravity and magnetic fields share common sources, and that these sources have a uniform magnetization direction and MDR. In addition, the previously existing formulation was restricted to profile data, and assumed sufficiently elongated (2-D) sources. For sources that violate Poisson conditions or have a 3-D geometry, the apparent values of MDR and MI that are generated in this way have an unclear relationship to the actual properties in the subsurface. We present Fortran programs that estimate MDR and MI values for 3-D sources through processing of gridded gravity and magnetic data. Tests with simple geophysical models indicate that magnetization polarity can be successfully recovered by MDR-MI processing, even in cases where juxtaposed bodies cannot be clearly distinguished on the basis of anomaly data. These results may be useful in crustal studies, especially in mapping magnetization polarity from marine-based gravity and magnetic data. (c) 2007 Elsevier Ltd. All rights reserved.

A pointcut-based coverage analysis approach for aspect-oriented programs

Aspect-oriented programming (AOP) is a promising technology that supports separation of crosscutting concerns (i.e., functionality that tends to be tangled with, and scattered through the rest of the system). In AOP, a method-like construct named advice is applied to join points in the system through a special construct named pointcut. This mechanism supports the modularization of crosscutting behavior; however, since the added interactions are not explicit in the source code, it is hard to ensure their correctness. To tackle this problem, this paper presents a rigorous coverage analysis approach to ensure exercising the logic of each advice - statements, branches, and def-use pairs - at each affected join point. To make this analysis possible, a structural model based on Java bytecode - called PointCut-based Del-Use Graph (PCDU) - is proposed, along with three integration testing criteria. Theoretical, empirical, and exploratory studies involving 12 aspect-oriented programs and several fault examples present evidence of the feasibility and effectiveness of the proposed approach. (C) 2010 Elsevier Inc. All rights reserved.

Important Parameters in Designing and Presenting Exhibits and Planetarium Programs in Science Centers : A Visitor-Based Framework

This dissertation proposes an initial framework for designing and presenting exhibits in science centers and to recommend methods for improving the educational role of planetariums in science centers.

The Survivability of Swedish Emergency Management Related Research Centers and Academic Programs : A Preliminary Sociology of Science Analysis

The Survivability of Swedish Emergency Management Related Research Centers and Academic Programs: A Preliminary Sociology of Science Analysis Despite being a relatively safe nation, Sweden has four different universities supporting four emergency management research centers and an equal and growing number of academic programs. In this paper, I discuss how these centers and programs survive within the current organizational environment. The sociology of science or the sociology of scientific knowledge perspectives should provide a theoretical guide. Yet, scholars of these perspectives have produced no research on these related topics. Thus, the population ecology model and the notion of organizational niche provide my theoretical foundation. My data come from 26 interviews from those four institutions, the gathering of documents, and observations. I found that each institution has found its own niche with little or no competition – with one exception. Three of the universities do have an international focus. Yet, their foci have minimal overlap. Finally, I suggest that key aspects of Swedish culture, including safety, and a need aid to the poor, help explain the extensive funding these centers and programs receive to survive. 

Fred: An approach to generating real, correct, reusable programs from proofs

In this paper we describe our system for automatically extracting "correct" programs from proofs using a development of the Curry-Howard process. Although program extraction has been developed by many authors, our system has a number of novel features designed to make it very easy to use and as close as possible to ordinary mathematical terminology and practice. These features include 1. the use of Henkin's technique to reduce higher-order logic to many-sorted (first-order) logic; 2. the free use of new rules for induction subject to certain conditions; 3. the extensive use of previously programmed (total, recursive) functions; 4. the use of templates to make the reasoning much closer to normal mathematical proofs and 5. a conceptual distinction between the computational type theory (for representing programs)and the logical type theory (for reasoning about programs). As an example of our system we give a constructive proof of the well known theorem that every graph of even parity, which is non-trivial in the sense that it does not consist of isolated vertices, has a cycle. Given such a graph as input, the extracted program produces a cycle as promised.

Protocols between programs and proofs

In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and the programs extracted from it. This protocol leads to the expansion of the theory and the production of more powerful programs. The methodology we use for automatically extracting “correct” programs from proofs is a development of the well-known Curry-Howard process. Program extraction has been developed by many authors, but our presentation is ultimately aimed at a practical, usable system and has a number of novel features. These include 1. a very simple and natural mimicking of ordinary mathematical practice and likewise the use of established computer programs when we obtain programs from formal proofs, and 2. a conceptual distinction between programs on the one hand, and proofs of theorems that yield programs on the other. An implementation of our methodology is the Fred system. As an example of our protocol we describe a constructive proof of the well-known theorem that every graph of even parity can be decomposed into a list of disjoint cycles. Given such a graph as input, the extracted program produces a list of the (non-trivial) disjoint cycles as promised.