The policy cycle and vernacular globalization: a case study of the creation of Vietnam National University - Hochiminh City

This article examines the policy cycle and vernacular globalization in the context of higher education reform in Vietnam. Through an analysis of the development of the Vietnam National University - Hochiminh City as part of the post-1986 reconstruction of Vietnamese higher education, the article considers the complex interrelationship between globalized policy discourses, national interests and history in Vietnam, and the specific politics of policy implementation within one institution. Vietnam National University - Hochiminh City was created through an amalgamation of a number of smaller universities, and against the backdrop of social and economic restructuring aimed at promoting industrialization and a market orientation within socialist governance. The article reveals the dynamic tension between these local and global influences on higher education policy and practice, and more specifically, the dilemmas associated with top-down policy implementation when a new organization consists of older organizations with powerful provenance and reputations. In so doing the article demonstrates the necessity to globalize policy theory.

Dating the dreaming? Creation of myths and rituals for mounds along the northern Australian coastline

Shell mounds ceased to be built in many parts of coastal northern Australia about 800-600 years ago. They are the subject of stories told by Aboriginal people and some have been incorporated in ritual and political activities during the last 150 ears. These understandings emerged only after termination of the economic and environmental system that created them, 800-600 years ago, in a number of widely separated coastal regions, Modern stories and treatments of these mounds by Aboriginal people concern modern or near-modern practices. Modern views of the mounds, their mythological and ritual associations, may be explained by reference to the socioeconomic transitions seen in the archaeological record; but the recent cultural, social and symbolic statements about these places cannot inform us of the process or ideology concerned with the formation of the mounds. Many Aboriginal communities over the last half a millennium actively,formed understandings of new landscapes and systems of land use. Attempts to impose historic ideologies and cosmologies on earlier times fail to acknowledge the magnitude and rate of economic and ideological change on the tropical coastline of Australia.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Construction of a 1-Mb restriction-mapped cosmid contig containing the candidate region for the familial mediterranean fever locus (MEFV) on chromosome 16p13.3

In this paper we describe the assembly and restriction map of a 1.05-Mb cosmid contig spanning the candidate region for familial Mediterranean fever (FMF), a recessively inherited disorder of inflammation localized to 16p13.3. Using a combination of cosmid walking and screening for P1, PAC, BAG, and YAC clones, we have generated a contig of genomic clones spanning similar to 1050 kb that contains the FMF critical region. The map consists of 179 cosmid, 15 P1, 10 PAC, 3 BAG, and 17 YAC clones, anchored by 27 STS markers. Eight additional STSs have been developed from the similar to 700 kb immediately centromeric to this genomic region. Five of the 35 STSs are microsatellites that have not been previously reported. NotI and EcoRI mapping of the overlapping cosmids, hybridization of restriction fragments from cosmids to one another, and STS analyses have been used to validate the assembly of the contig. Our contig totally subsumes the 250-kb interval recently reported, by founder haplotype analysis, to contain the FMF gene. Thus, our high-resolution clone map provides an ideal resource for transcriptional mapping toward the eventual identification of this disease gene. (C) 1997 Academic Press.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

Assessment of immediate conservative breast surgery reconstruction: A classification system of defects revisited and an algorithm for selecting the appropriate technique

Background: Although various techniques have been used for breast conservation surgery reconstruction, there are few studies describing a logical approach to reconstruction of these defects. The objectives of this study were to establish a classification system for partial breast defects and to develop a reconstructive algorithm. Methods: The authors reviewed a 7-year experience with 209 immediate breast conservation surgery reconstructions. Mean follow-up was 31 months. Type I defects include tissue resection in smaller breasts (bra size A/B), including type IA, which involves minimal defects that do not cause distortion; type III, which involves moderate defects that cause moderate distortion; and type IC, which involves large defects that cause significant deformities. Type II includes tissue resection in medium-sized breasts with or without ptosis (bra size C), and type III includes tissue resection in large breasts with ptosis (bra size D). Results: Eighteen percent of patients presented type I, where a lateral thoracodorsal flap and a latissimus dorsi flap were performed in 68 percent. Forty-five percent presented type II defects, where bilateral mastopexy was performed in 52 percent. Thirty-seven percent of patients presented type III distortion, where bilateral reduction mammaplasty was performed in 67 percent. Thirty-five percent of patients presented complications, and most were minor. Conclusions: An algorithm based on breast size in relation to tumor location and extension of resection can be followed to determine the best approach to reconstruction. The authors` results have demonstrated that the complications were similar to those in other clinical series. Success depends on patient selection, coordinated planning with the oncologic surgeon, and careful intraoperative management.

The Ideal Timing for Experimental Cleft Lip Creation

Cleft lip and palate (CLP) is the most common congenital defect of the face. Many animal models have been utilized to study embryogenesis and pathogenesis of CLP, including the development of secondary anomalies and consequent deformities. However, the ideal gestational age for surgical creation of lip or palate defects in rat models has never been determined. The aim of the present study is to improve the experimental model utilizing rat fetuses, defining the most appropriate timing for creation of the lip defect model. The study was composed of three groups of fetuses undergoing surgical creation of a lip defect at the left side of the superior lip at 17.5, 18.5, and 19.5 days of gestation. Fetuses were harvested at 21.5 days of gestation (term = 22 days) and underwent macroscopic and microscopic analyses. We found that the most appropriate moment for lip defect creation was at 19.5 days, given the presence of lip depression at the site of the defect and asymmetry and retraction associated with interruption of the lip and complete reepithelialization of the borders of the defect.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.