Climatic simulations of the eastern Andes low-level jet and its dependency on convective parameterizations

The South American low level jet (SALLJ) of the Eastern Andes is investigated with Regional Climate Model version 3 (RegCM3) simulations during the 2002-2003 austral summer using two convective parameterizations (Grell and Emanuel). The simulated SALLJ is compared with the special observations of SALLJEX (SALLJ Experiment). Both the Grell and Emanuel schemes adequately simulate the low level flow over South America. However, there are some intensity differences. Due to the larger (smaller) convective activity, the Emanuel (Grell) scheme simulates more intense (weaker) low level wind than analysis in the tropics and subtropics. The objectives criteria of Sugahara (SJ) and Bonner (BJ) were used for LLJ identification. When applied to the observations, both criteria suggest a larger frequency of the SALLJ in Santa Cruz, followed by Mariscal, Trinidad and Asuncin. In Mariscal and Asuncin, the diurnal cycle indicates that SJ occurs mainly at 12 UTCs (morning), while the BJ criterion presents the SALLJ as more homogenously distributed. The concentration into two of the four-times-a-day observations does not allow conclusions about the diurnal cycle in Santa Cruz and Trinidad. The simulated wind profiles result in a lower than observed frequency of SALLJ using both the SJ and BJ criteria, with fewer events obtained with the BJ. Due to the stronger simulated winds, the Emanuel scheme produces an equal or greater relative frequency of SALLJ than the Grell scheme. However, the Grell scheme using the SJ criterion simulates the SALLJ diurnal cycle closer to the observed one. Although some discrepancies between observed and simulated mean vertical profiles of the horizontal wind are noted, there is large agreement between the composites of the vertical structure of the SALLJ, especially when the SJ criterion is used with the Grell scheme. On an intraseasonal scale, a larger southward displacement of SALLJ in February and December when compared with January has been noted. The Grell and Emanuel schemes simulated this observed oscillation in the low-level flow. However, the spatial pattern and intensity of rainfall and circulation anomalies simulated by the Grell scheme are closer to the analyses than those obtained with the Emanuel scheme.

Document engineering approaches toward scalable and structured multimedia, web and printable documents

Document engineering is the computer science discipline that investigates systems for documents in any form and in all media. As with the relationship between software engineering and software, document engineering is concerned with principles, tools and processes that improve our ability to create, manage, and maintain documents (http://www.documentengineering.org). The ACM Symposium on Document Engineering is an annual meeting of researchers active in document engineering: it is sponsored by ACM by means of the ACM SIGWEB Special Interest Group. In this editorial, we first point to work carried out in the context of document engineering, which are directly related to multimedia tools and applications. We conclude with a summary of the papers presented in this special issue.

PedVis: A Structured, Space-Efficient Technique for Pedigree Visualization

Public genealogical databases are becoming increasingly populated with historical data and records of the current population`s ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree`s structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user`s ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.

A game theoretical approach to the evolution of structured communication codes

Structured meaning-signal mappings, i.e., mappings that preserve neighborhood relationships by associating similar signals with similar meanings, are advantageous in an environment where signals are corrupted by noise and sub-optimal meaning inferences are rewarded as well. The evolution of these mappings, however, cannot be explained within a traditional language evolutionary game scenario in which individuals meet randomly because the evolutionary dynamics is trapped in local maxima that do not reflect the structure of the meaning and signal spaces. Here we use a simple game theoretical model to show analytically that when individuals adopting the same communication code meet more frequently than individuals using different codes-a result of the spatial organization of the population-then advantageous linguistic innovations can spread and take over the population. In addition, we report results of simulations in which an individual can communicate only with its K nearest neighbors and show that the probability that the lineage of a mutant that uses a more efficient communication code becomes fixed decreases exponentially with increasing K. These findings support the mother tongue hypothesis that human language evolved as a communication system used among kin, especially between mothers and offspring.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.