TEX86H proxy and BIT index of sediment core GeoB9528-3 and reconstructed temperature data from NW Africa surface sediments

Changes in the strength of Atlantic meridional overturning circulation (AMOC) are known to have profound impacts on global climate. Coupled modelling studies have suggested that, on annual to multi-decadal time scales, a slowdown of AMOC causes a deepening of the thermocline in the tropical Atlantic. However, this process has been poorly constrained by sedimentary geochemical records. Here, we reconstruct surface (UK'37 Index) and thermocline (TEX86H) water temperatures from the Guinea Plateau Margin (Eastern tropical Atlantic) over the last two glacial-interglacial cycles (~ 192 kyr). These paleotemperature records show that periods of reduced AMOC, as indicated by the d13 C benthic foraminiferal record from the same core, coincide with a reduction in the near-surface vertical temperature gradient, demonstrating for the first time that AMOC-induced tropical Atlantic thermocline adjustment exists on longer, millennial time scales. Modelling results support the interpretation of the geochemical records and show that thermocline adjustment is particularly pronounced in the eastern tropical Atlantic. Thus, variations in AMOC strength appear to be an important driver of the thermocline structure in the tropical Atlantic from annual to multi-millennial time scales.

Has Low Productivity Constrained Competitiveness of African Firms? : Comparison of the Firm Performances with Asian Firms

It has been argued that poor productive performance is one of critical sources of stagnation of the African manufacturing sector, but firm-level empirical supports are limited. Using the inter-regional firm data of the garment industry, technical efficiency and its contribution to competitiveness measured as unit costs were compared between Kenyan and Bangladeshi firms. Our estimates indicated that there is no significant gap in the average technical efficiency of the two industries despite conservative estimation, although unit costs greatly differ between the two industries. Higher unit cost in Kenyan firms mainly stems from high labour cost, while impact of inefficiency is quite small. Productivity accounts little for the stagnation of garment industry in several African countries.

A geometric characterization of the upper bound for the span of the jones polynomial

Let D be a link diagram with n crossings, sA and sB be its extreme states and |sAD| (respectively, |sBD|) be the number of simple closed curves that appear when smoothing D according to sA (respectively, sB). We give a general formula for the sum |sAD| + |sBD| for a k-almost alternating diagram D, for any k, characterizing this sum as the number of faces in an appropriate triangulation of an appropriate surface with boundary. When D is dealternator connected, the triangulation is especially simple, yielding |sAD| + |sBD| = n + 2 - 2k. This gives a simple geometric proof of the upper bound of the span of the Jones polynomial for dealternator connected diagrams, a result first obtained by Zhu [On Kauffman brackets, J. Knot Theory Ramifications6(1) (1997) 125–148.]. Another upper bound of the span of the Jones polynomial for dealternator connected and dealternator reduced diagrams, discovered historically first by Adams et al. [Almost alternating links, Topology Appl.46(2) (1992) 151–165.], is obtained as a corollary. As a new application, we prove that the Turaev genus is equal to the number k of dealternator crossings for any dealternator connected diagram

A generator of efficient abstract machine implementations and its application to emulator minimization

The implementation of abstract machines involves complex decisions regarding, e.g., data representation, opcodes, or instruction specialization levéis, all of which affect the final performance of the emulator and the size of the bytecode programs in ways that are often difficult to foresee. Besides, studying alternatives by implementing abstract machine variants is a time-consuming and error-prone task because of the level of complexity and optimization of competitive implementations, which makes them generally difficult to understand, maintain, and modify. This also makes it hard to genérate specific implementations for particular purposes. To ameliorate those problems, we propose a systematic approach to the automatic generation of implementations of abstract machines. Different parts of their definition (e.g., the instruction set or the infernal data and bytecode representation) are kept sepárate and automatically assembled in the generation process. Alternative versions of the abstract machine are therefore easier to produce, and variants of their implementation can be created mechanically, with specific characteristics for a particular application if necessary. We illustrate the practicality of the approach by reporting on an implementation of a generator of production-quality WAMs which are specialized for executing a particular fixed (set of) program(s). The experimental results show that the approach is effective in reducing emulator size.

Lower bound cost estimation for logic programs

It is generally recognized that information about the runtime cost of computations can be useful for a variety of applications, including program transformation, granularity control during parallel execution, and query optimization in deductive databases. Most of the work to date on compile-time cost estimation of logic programs has focused on the estimation of upper bounds on costs. However, in many applications, such as parallel implementations on distributed-memory machines, one would prefer to work with lower bounds instead. The problem with estimating lower bounds is that in general, it is necessary to account for the possibility of failure of head unification, leading to a trivial lower bound of 0. In this paper, we show how, given type and mode information about procedures in a logic program, it is possible to (semi-automatically) derive nontrivial lower bounds on their computational costs. We also discuss the cost analysis for the special and frequent case of divide-and-conquer programs and show how —as a pragmatic short-term solution —it may be possible to obtain useful results simply by identifying and treating divide-and-conquer programs specially.

B-LOG: A branch and bound methodology for the parallel execution of logic programs

We propose a computational methodology -"B-LOG"-, which offers the potential for an effective implementation of Logic Programming in a parallel computer. We also propose a weighting scheme to guide the search process through the graph and we apply the concepts of parallel "branch and bound" algorithms in order to perform a "best-first" search using an information theoretic bound. The concept of "session" is used to speed up the search process in a succession of similar queries. Within a session, we strongly modify the bounds in a local database, while bounds kept in a global database are weakly modified to provide a better initial condition for other sessions. We also propose an implementation scheme based on a database machine using "semantic paging", and the "B-LOG processor" based on a scoreboard driven controller.