Educating a global workforce?

In the public rhetoric, at least, education is the answer to most, if not all, the questions raised by the global knowledge-based economy. In this chapter we begin an examination of what education promises the global workforce, and what the global workforce, and the knowledgebased economy, might reasonably ask of education. Different perspectives on the knowledgebased economy imply different constructions of ‘knowledge’. Workers are characterised within these frameworks as ‘knowledge workers’ (an elite), or, perhaps, ‘knowledgeable workers’ (the non-elite majority) and questions arise around what they are required to learn, to know, and to be able to do. The global knowledge-based economy produces profound challenges to workrelated education at every level. While these challenges manifest themselves in uniquely local ways at specific local sites, they are produced, and must be addressed, in contexts that are uncompromisingly global. If work-related education is to contribute to positive outcomes for people and for local communities we (workers, corporations, educators, researchers, policy makers, politicians and international organisations) must find new ways to pay attention to the ways in which a workforce in the knowledge-based economy can be understood to be ‘global’ as well as ‘local’, and what workers need to be able to know and be able to do to move across and within these spatial and temporal domains

A re-examination of the life and work of A.F.G. Kerr and of his colleagues and friends

Arthur Francis George Kerr’s life is reviewed and related to a previously published account. Kerr’s collecting activity is analysed using an expanded version of the Thai Biogeography Group’s database of collections. 8,666 of the total 48,970 collections are Kerr’s and 3,178 are those of his colleagues and friends. Therefore, the total number of collections made by Kerr and his acquaintances is likely to be larger and more diverse than previously believed. Mapping of these data using GIS show that Kerr’s collecting activities focussed on particular regions of Thailand at particular times. Also large areas of the country remained unexplored by Kerr and his acquaintances: a pattern that, to some extent, persists to this day. The large, but dispersed, archive of Kerr’s photographs, maps, living collections and correspondence indicate that he was a skilled photographer (taking at least 3,000 images), cartographer (producing many hand-drawn maps) and exceptionally acute, accurate and detailed observer (filling numerous notebooks and leaving other records). It is clear that digitising these collections to form an on-line dedicated website is highly desirable to further progress on the flora of Thailand and surrounding countries and would form an unique record of the social history of early 20thC Thailand

Nutritional divergence in genotypes of forage peanut

The objective of this study was to evaluate the nutritional divergence between ten genotypes of forage peanut, based on chemical composition as well as fermentation and in vitro degradation kinetic characteristics. Treatments consisted of ten genotypes of Arachis pintoi, namely eight accessions (31135, 30333, 15121, 31828, 15598, 31534, 13251 and 31496) and two cultivars (cv. Belmonte and cv. Amarillo). The genotypes were harvested in each plot at a height of 3 cm from the ground, in 42-day intervals, during the time of heaviest rainfall. For the multivariate analysis the following variables, the following were used: crude protein, neutral detergent fiber, potential degradation in 48 hours, degradation rate of insoluble potentially degradable fraction and degradation rate of non-fibrous carbohydrate. The application of the hierarchical clustering analysis, using the Euclidian distances matrix of standardized averages allowed for the identification of five homogeneous groups. Among them, the accessions 31828, 31534, 15121 and cv. Belmonte stood out nutritionally among the remaining genotypes evaluated, depicting as promising for the utilization in ruminant feeding

Structure sharing for quantified terms: Fundamentals

Structure sharing is used in symbolic computation to share a common top level between terms with different lower levels. It is widely used in the implementation of Prolog interpreters and is of interest for the implementation of automatic theorem provers, interactive proof editors and verification systems. Previously, structure sharing has been applied only to free-variable terms. In this paper we extend the structure sharing technique to quantified terms. We give an efficient unification algorithm of our structure sharing representation of quantified terms, and we prove the correctness of the algorithm

Formalizing a hierarchical structure of practical mathematical reasoning

Traditionally, mathematical logic has been content with 'in principle' formalizations of deductive inference, which place little emphasis on the description of practical reasoning. Requirements for formal descriptions of practical inference methods are now emerging however. For example, interactive reasoning systems are needed for verification of computer systems, and should support practically convenient reasoning techniques as strongly as possible. This paper describes a proof paradigm which formalises a hierarchical, problem-reduction style of reasoning which is widely useful in practical reasoning. It is a goal directed paradigm, which gives a central role to equivalence transformations. A hierarchy of subgoals can co-exist at a single point in the proof, and these subgoals may be of arbitrary type. The approach allows good access to contextual information when transforming subgoals, and can be applied to a variety of logics

Regarding the structures and fluxionality of tricyclopentadienylaluminum compounds

Contains fulltext : 29357___.PDF (publisher's version ) (Open Access

A functional logic for higher level reasoning about computation

In many areas of computation and reasoning, the value of an expression may depend on an implicit parameter, which may for example represent a program state, or time, or a possible world. In this paper we describe a formal first order logic which captures a general notion of expressions which depend on an implicit parameter. Both semantics and syntax are discussed. An important application of the logic, used as a running example, is to provide a basis for unifying the Hoare logic of procedural programs with the mathematically powerful techniques of classical logic and set theory. It is, however, beyond the scope of this paper to develop this application fully