(Table 1) Seasonal sea ice concentration and the observed changes from 1972 to 2007 for the Southern Beaufort Sea

A reliable data set of Arctic sea ice concentration based on satellite observations exists since 1972. Over this time period of 36 years western arctic temperatures have increased; the temperature rise varies significantly from one season to another and over multi-year time scales. In contrast to most of Alaska, however, on the North Slope the warming continued after 1976, when a circulation change occurred, as expressed in the PDO index. The mean temperature increase for Barrow over the 36-year period was 2.9°C, a very substantial change. Wind speeds increased by 18% over this time period, however, the increase were non-linear and showed a peak in the early 1990s. The sea ice extent of the Arctic Ocean has decreased strongly in recent years, and in September 2007 a new record in the amount of open water was recorded in the Western Arctic. We observed for the Southern Beaufort Sea a fairly steady increase in the mean annual amount of open water from 14% in 1972 to 39% in 2007, as deduced from the best linear fit. In late summer the decrease is much larger, and September has, on average, the least ice concentration (22%), followed by August (35%) and October (54%). The correlation coefficient between mean annual values of temperature and sea ice concentration was 0.84. On a monthly basis, the best correlation coefficient was found in October with 0.88. However, the relationship between winter temperatures and the sea ice break-up in summer was weak. While the temperature correlated well with the CO2 concentration (r=0.86), the correlation coefficient between CO2 and sea ice was lower (r=-0.68). After comparing the ice concentration with 17 circulation indices, the best relation was found with the Pacific Circulation Index (r=-0.59).

Seawater carbonate chemistry and calcification of the crustose coralline alga Hydrolithon onkodes in a laboratory experiment

Anthropogenic CO2 emissions have exacerbated two environmental stressors, global climate warming and ocean acidification (OA), that have serious implications for marine ecosystems. Coral reefs are vulnerable to climate change yet few studies have explored the potential for interactive effects of warming temperature and OA on an important coral reef calcifier, crustose coralline algae (CCA). Coralline algae serve many important ecosystem functions on coral reefs and are one of the most sensitive organisms to ocean acidification. We investigated the effects of elevated pCO2 and temperature on calcification of Hydrolithon onkodes, an important species of reef-building coralline algae, and the subsequent effects on susceptibility to grazing by sea urchins. H. onkodes was exposed to a fully factorial combination of pCO2 (420, 530, 830 µatm) and temperature (26, 29 °C) treatments, and calcification was measured by the change in buoyant weight after 21 days of treatment exposure. Temperature and pCO2 had a significant interactive effect on net calcification of H. onkodes that was driven by the increased calcification response to moderately elevated pCO2. We demonstrate that the CCA calcification response was variable and non-linear, and that there was a trend for highest calcification at ambient temperature. H. onkodes then was exposed to grazing by the sea urchin Echinothrix diadema, and grazing was quantified by the change in CCA buoyant weight from grazing trials. E. diadema removed 60% more CaCO3 from H. onkodes grown at high temperature and high pCO2 than at ambient temperature and low pCO2. The increased susceptibility to grazing in the high pCO2 treatment is among the first evidence indicating the potential for cascading effects of OA and temperature on coral reef organisms and their ecological interactions.

Alkenone UK37 measured in the upper water column at pump stations CariacoTrench, Peru and Vertex

A series of long-chain (C37, C38, C39), primarily di and tri-unsaturated methyl and ethyl ketones, first identified in sediments from Walvis Ridge off West Africa and from Black Sea (de Leeuw et al., 1979), has been found in marine sediments throughout the world (Brassell et al., 1986 doi:10.1038/320129a0). The marine coccolithophorid Emiliania huxleyi and members of the class Prymnesiophyceae are now the recognized sources of these compounds (Volkman et al., 1979; Marlowe, et al., 1984). Experiments with laboratory cultures of algae showed the degree of unsaturation in the ketone seris biosynthesized depends on growth temperature (Brassell et al., 1986; Marlowe, 1984), a physiological respons observed for classical membrane lipids (vanDeenen et al., 1972). Brassell and co-workers (Brassell et al., 198; Brassell et al., 1986b) thus proposed that systematic fluctuations in the unsaturation of these alkenones noted down-core in sediments from the Kane Gap region of the north-east tropical Atlantic Ocean and correlated with glacial-interglacial cycles provide an organic geochemical measure of past sea-surface water temperatures. Using laboratory cultures of E. huxleyi, we have calibrated changes in the unsaturation pattern of the long-chain ketone series versus growth temperature. The calibration curve is linear and accurtely predicts unsuturation patterns observed in natural particulate materials collected from oceanic waters of known temperature. We present evidence supporting the proposed paleotemperature hypothesis (Brassell et al., 1986, Brassel et al., 1986b) and suggesting absolute 'sea-surface temperatures' for a given oceanic location can be estimated from an analysis of long-chain ketone compositions preserved in glacial and interglacial horizons of deep-sea sediment cores.

Restoration of micro data of John Lossing Buck's survey and analysis of the inverse relationship between yield and farm size in rural China in the 1930's

A large scale Chinese agricultural survey was conducted at the direction of John Lossing Buck from 1929 through 1933. At the end of the 1990’s, some parts of the original micro data of Buck’s survey were discovered at Nanjing Agricultural University. An international joint study was begun to restore micro data of Buck’s survey and construct parts of the micro database on both the crop yield survey and special expenditure survey. This paper includes a summary of the characteristics of farmlands and cropping patterns in crop yield micro data that covered 2,102 farmers in 20 counties of 9 provinces. In order to test the classical hypothesis of whether or not an inverse relationship between land productivity and cultivated area may be observed in developing countries, a Box-Cox transformation test was conducted for functional forms on five main crops of Buck’s crop yield survey. The result of the test shows that the relationship between land productivity and cultivated areas of wheat and barley is linear and somewhat negative; those of rice, rapeseed, and seed cotton appear to be slightly positive. It can be tentatively concluded that the relationship between cultivated area and land productivity are not the same among crops, and the difference of labor intensity and the level of commercialization of each crop may be strongly related to the existence or non-existence of inverse relationships.

Curvature and velocity of methane-air Bunsen flame tips.

PIV and photographic recording are used to measure the velocity of the fresh gas and the shape of the reaction layer in a region around the tip of a methane-air Bunsen flame attached to a cylindrical burner. The results compare well with numerical simulations carried out with an infinite activation energy reaction model. The experimental and numerical results confirm that the well-known linear relation between flame velocity and flame stretch derived from asymptotic theory for weakly curved and strained flames is valid for small and moderate values of the flame stretch if the modified definition of stretch introduced by Echekki and Mungal (Proc Combust Inst 23:455–461, 1990) and Poinsot et al. (Combust Sci Technol 81:45–73, 1992) is used. However, the relation between flame velocity and modified stretch ceases to be linear and approaches a square root law for large values of the stretch, when the curvature of the flame tip becomes large compared to the inverse of the thickness of a planar flame.

PV self-consumption optimization with storage and Active DSM for the residential sector

With the rising prices of the retail electricity and the decreasing cost of the PV technology, grid parity with commercial electricity will soon become a reality in Europe. This fact, together with less attractive PV feed-in-tariffs in the near future and incentives to promote self-consumption suggest, that new operation modes for the PV Distributed Generation should be explored; differently from the traditional approach which is only based on maximizing the exported electricity to the grid. The smart metering is experiencing a growth in Europe and the United States but the possibilities of its use are still uncertain, in our system we propose their use to manage the storage and to allow the user to know their electrical power and energy balances. The ADSM has many benefits studied previously but also it has important challenges, in this paper we can observe and ADSM implementation example where we propose a solution to these challenges. In this paper we study the effects of the Active Demand-Side Management (ADSM) and storage systems in the amount of consumed local electrical energy. It has been developed on a prototype of a self-sufficient solar house called “MagicBox” equipped with grid connection, PV generation, lead–acid batteries, controllable appliances and smart metering. We carried out simulations for long-time experiments (yearly studies) and real measures for short and mid-time experiments (daily and weekly studies). Results show the relationship between the electricity flows and the storage capacity, which is not linear and becomes an important design criterion.

A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems

Nondeterminism and partially instantiated data structures give logic programming expressive power beyond that of functional programming. However, functional programming often provides convenient syntactic features, such as having a designated implicit output argument, which allow function cali nesting and sometimes results in more compact code. Functional programming also sometimes allows a more direct encoding of lazy evaluation, with its ability to deal with infinite data structures. We present a syntactic functional extensión, used in the Ciao system, which can be implemented in ISO-standard Prolog systems and covers function application, predefined evaluable functors, functional definitions, quoting, and lazy evaluation. The extensión is also composable with higher-order features and can be combined with other extensions to ISO-Prolog such as constraints. We also highlight the features of the Ciao system which help implementation and present some data on the overhead of using lazy evaluation with respect to eager evaluation.

Interfacing prolog and VRML and its application to constraint visualization

A number of data description languages initially designed as standards for trie WWW are currently being used to implement user interfaces to programs. This is done independently of whether such programs are executed in the same or a different host as trie one running the user interface itself. The advantage of this approach is that it provides a portable, standardized, and easy to use solution for the application programmer, and a familiar behavior for the user, typically well versed in the use of WWW browsers. Among the proposed standard description languages, VRML is a aimed at representing three dimensional scenes including hyperlink capabilities. VRML is already used as an import/export format in many 3-D packages and tools, and has been shown effective in displaying complex objects and scenarios. We propose and describe a Prolog library which allows parsing and checking VRML code, transforming it, and writing it out as VRML again. The library converts such code to an internal representation based on first order terms which can then be arbitrarily manipulated. We also present as an example application the use of this library to implement a novel 3-D visualization for examining and understanding certain aspects of the behavior of CLP(FD) programs.

Independent AND-parallel implementation of narrowing

We present a parallel graph narrowing machine, which is used to implement a functional logic language on a shared memory multiprocessor. It is an extensión of an abstract machine for a purely functional language. The result is a programmed graph reduction machine which integrates the mechanisms of unification, backtracking, and independent and-parallelism. In the machine, the subexpressions of an expression can run in parallel. In the case of backtracking, the structure of an expression is used to avoid the reevaluation of subexpressions as far as possible. Deterministic computations are detected. Their results are maintained and need not be reevaluated after backtracking.

A technique for recursive invariance detection and selective program specialization

This paper presents a technique for achieving a class of optimizations related to the reduction of checks within cycles. The technique uses both Program Transformation and Abstract Interpretation. After a ñrst pass of an abstract interpreter which detects simple invariants, program transformation is used to build a hypothetical situation that simpliñes some predicates that should be executed within the cycle. This transformation implements the heuristic hypothesis that once conditional tests hold they may continué doing so recursively. Specialized versions of predicates are generated to detect and exploit those cases in which the invariance may hold. Abstract interpretation is then used again to verify the truth of such hypotheses and conñrm the proposed simpliñcation. This allows optimizations that go beyond those possible with only one pass of the abstract interpreter over the original program, as is normally the case. It also allows selective program specialization using a standard abstract interpreter not speciñcally designed for this purpose, thus simplifying the design of this already complex module of the compiler. In the paper, a class of programs amenable to such optimization is presented, along with some examples and an evaluation of the proposed techniques in some application áreas such as floundering detection and reducing run-time tests in automatic logic program parallelization. The analysis of the examples presented has been performed automatically by an implementation of the technique using existing abstract interpretation and program transformation tools.

Towards high-level execution primitives for and-parallelism: preliminary results

Most implementations of parallel logic programming rely on complex low-level machinery which is arguably difflcult to implement and modify. We explore an alternative approach aimed at taming that complexity by raising core parts of the implementation to the source language level for the particular case of and-parallelism. Therefore, we handle a signiflcant portion of the parallel implementation mechanism at the Prolog level with the help of a comparatively small number of concurrency-related primitives which take care of lower-level tasks such as locking, thread management, stack set management, etc. The approach does not eliminate altogether modiflcations to the abstract machine, but it does greatly simplify them and it also facilitates experimenting with different alternatives. We show how this approach allows implementing both restricted and unrestricted (i.e., non fork-join) parallelism. Preliminary experiments show that the amount of performance sacriflced is reasonable, although granularity control is required in some cases. Also, we observe that the availability of unrestricted parallelism contributes to better observed speedups.

Functional notation and lazy evaluation in Ciao

Certain aspects of functional programming provide syntactic convenience, such as having a designated implicit output argument, which allows function cali nesting and sometimes results in more compact code. Functional programming also sometimes allows a more direct encoding of lazy evaluation, with its ability to deal with infinite data structures. We present a syntactic functional extensión of Prolog covering function application, predefined evaluable functors, functional definitions, quoting, and lazy evaluation. The extensión is also composable with higher-order features. We also highlight the Ciao features which help implementation and present some data on the overhead of using lazy evaluation with respect to eager evaluation.

Improving the compilation of prolog to C using type and determinism information: Preliminary results

We describe the current status of and provide preliminary performance results for a compiler of Prolog to C. The compiler is novel in that it is designed to accept different kinds of high-level information (typically obtained via an analysis of the initial Prolog program and expressed in a standardized language of assertions) and use this information to optimize the resulting C code, which is then further processed by an off-the-shelf C compiler. The basic translation process used essentially mimics an unfolding of a C-coded bytecode emúlator with respect to the particular bytecode corresponding to the Prolog program. Optimizations are then applied to this unfolded program. This is facilitated by a more flexible design of the bytecode instructions and their lower-level components. This approach allows reusing a sizable amount of the machinery of the bytecode emulator: ancillary pieces of C code, data definitions, memory management routines and áreas, etc., as well as mixing bytecode emulated code with natively compiled code in a relatively straightforward way We report on the performance of programs compiled by the current versión of the system, both with and without analysis information.

The PiLLoW/Ciao library for INTERNET/WWW programming using computational logic systems

We discuss from a practical point of view a number of issues involved in writing Internet and WWW applications using LP/CLP systems. We describe PiLLoW, an Internet and WWW programming library for LP/CLP systems which we argüe significantly simplifies the process of writing such applications. PiLLoW provides facilities for generating HTML structured documents, producing HTML forms, writing form handlers, accessing and parsing WWW documents, and accessing code posted at HTTP addresses. We also describe the architecture of some application classes, using a high-level model of client-server interaction, active modules. Finally we describe an architecture for automatic LP/CLP code downloading for local execution, using generic browsers. The PiLLoW library has been developed in the context of the &-Prolog and CIAO systems, but it has been adapted to a number of popular LP/CLP systems, supporting most of its functionality.

The CIAO Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems

CIAO is an advanced programming environment supporting Logic and Constraint programming. It offers a simple concurrent kernel on top of which declarative and non-declarative extensions are added via librarles. Librarles are available for supporting the ISOProlog standard, several constraint domains, functional and higher order programming, concurrent and distributed programming, internet programming, and others. The source language allows declaring properties of predicates via assertions, including types and modes. Such properties are checked at compile-time or at run-time. The compiler and system architecture are designed to natively support modular global analysis, with the two objectives of proving properties in assertions and performing program optimizations, including transparently exploiting parallelism in programs. The purpose of this paper is to report on recent progress made in the context of the CIAO system, with special emphasis on the capabilities of the compiler, the techniques used for supporting such capabilities, and the results in the áreas of program analysis and transformation already obtained with the system.