Chemometric study on the trace metal accumulation in the sediments of the Cochin Estuary―Southwest coast of India

The distribution and accumulation of trace metals in the sediments of the Cochin estuary during the pre-monsoon, monsoon and post-monsoon periods were investigated. Sediment samples from 14 locations were collected and analysed for the metal contents (Mg, Cr, Mn, Fe, Co, Ni, Cu, Zn, Cd and Pb), organic carbon, total nitrogen, total sulphur and grain size. The data were processed using statistical tools like correlation, factor and cluster analysis. The study revealed an enrichment of Cd and Zn in the study area particularly at station 2, which is confirmed by enrichment factor, contamination factor and geoaccumulation index. The factor analysis revealed that the source of Cd and Zn may be same. The study indicated that the spatial variation for the metals like Mg, Cr, Fe, Co, Ni, Cu, Zn, Cd and Pb were predominant unlike Mn which shows a temporal variation. The strong association of trace metals with Fe and Mn hydroxides and oxides are prominent along the Cochin estuary. The anthropogenic inputs of industrial effluents mainly control the trace metals enrichment in the Cochin estuary

Quantization of specific trace metals in bivalve, Villorita Cyprinoides Var Cochinensis in the Cochin estuary

Present study consists the quantization of specific metals-- Cr, Cd, Pb, Zn and Cu observed in the experimental bivalve, Villorita species. Bivalve specimens were collected seasonally from the identified three hot spots of Vembanad Lake. Soft tissue concentrations of metals are very sensitive in reflecting changes in the ambient environment and hence important in assessing the environmental quality. Concentrations of Zn in bivalves were fairly high compared to other metals. All the stations showed a maximum concentration during premonsoon and minimum during the other two seasons. Levels of Pb, Cu, Zn, Cd and Cr are between 0-6.17mg/kg, 0-17.224mg/kg, 1.916-255.163mg/kg, 0.325-4.133mg/kg, and 0-15.233mg/kg respectively

Abgrenzung bestehender Beschreibungsmittel für die Modellierung und Spezifikation von Manufacturing Execution Systems

Die Modellierung und Spezifikation von Manufacturing Execution Systems (MES) als prozessnah operierende Software-Systeme stellt eine Herausforderung interdisziplinärer Kommunikation dar. Bisher existiert kein grafisches Beschreibungsmittel, das diesen Prozess ausdrücklich unterstützt. In diesem Diskussionspapier werden bestehende Beschreibungsmittel aus angrenzenden Bereichen, wie die Business Process Modeling Notation, Petrinetze, die formalisierte Prozessbeschreibung oder die Unified Modelling Language anhand allgemeiner und MES-spezifischer Anforderungen auf ihre Eignung untersucht. Es wurden erhebliche Lücken bei der Erfüllung der Anforderungen durch bestehende Beschreibungsmittel identifiziert.

Pi: A Parallel Architecture Interface for Multi-Model Execution

This thesis defines Pi, a parallel architecture interface that separates model and machine issues, allowing them to be addressed independently. This provides greater flexibility for both the model and machine builder. Pi addresses a set of common parallel model requirements including low latency communication, fast task switching, low cost synchronization, efficient storage management, the ability to exploit locality, and efficient support for sequential code. Since Pi provides generic parallel operations, it can efficiently support many parallel programming models including hybrids of existing models. Pi also forms a basis of comparison for architectural components.

Ameliorating the Overhead of Dynamic Optimization

Dynamic optimization has several key advantages. This includes the ability to work on binary code in the absence of sources and to perform optimization across module boundaries. However, it has a significant disadvantage viz-a-viz traditional static optimization: it has a significant runtime overhead. There can be performance gain only if the overhead can be amortized. In this paper, we will quantitatively analyze the runtime overhead introduced by a dynamic optimizer, DynamoRIO. We found that the major overhead does not come from the optimizer's operation. Instead, it comes from the extra code in the code cache added by DynamoRIO. After a detailed analysis, we will propose a method of trace construction that ameliorate the overhead introduced by the dynamic optimizer, thereby reducing the runtime overhead of DynamoRIO. We believe that the result of the study as well as the proposed solution is applicable to other scenarios such as dynamic code translation and managed execution that utilizes a framework similar to that of dynamic optimization.

On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs

A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two algorithms, one serial and one parallel, to maintain series-parallel (SP) relationships "on the fly" for fork-join multithreaded programs. The serial SP-order algorithm runs in O(1) amortized time per operation. In contrast, the previously best algorithm requires a time per operation that is proportional to Tarjan’s functional inverse of Ackermann’s function. SP-order employs an order-maintenance data structure that allows us to implement a more efficient "English-Hebrew" labeling scheme than was used in earlier race detectors, which immediately yields an improved determinacy-race detector. In particular, any fork-join program running in T₁ time on a single processor can be checked on the fly for determinacy races in O(T₁) time. Corresponding improved bounds can also be obtained for more sophisticated data-race detectors, for example, those that use locks. By combining SP-order with Feng and Leiserson’s serial SP-bags algorithm, we obtain a parallel SP-maintenance algorithm, called SP-hybrid. Suppose that a fork-join program has n threads, T₁ work, and a critical-path length of T[subscript ∞]. When executed on P processors, we prove that SP-hybrid runs in O((T₁/P + PT[subscript ∞]) lg n) expected time. To understand this bound, consider that the original program obtains linear speed-up over a 1-processor execution when P = O(T₁/T[subscript ∞]). In contrast, SP-hybrid obtains linear speed-up when P = O(√T₁/T[subscript ∞]), but the work is increased by a factor of O(lg n).

Structural invariance of multiple intelligences, based on the level of execution

Resumen tomado de la publicaci??n

Computer-mediated communication and time pressure induce higher cardiovascular responses in the preparatory and execution phases of cooperative tasks

Resumen tomado de la publicaci??n

Trace elements biogeochemistry in high mountain lake catchments: identifying anthropogenic versus natural components from the atmospheric contamination legacy in remote natural areas

Human activities have been interfering with the natural biogeochemical cycles of trace elements since the ancient civilizations. Although they are inaccessible and remote, high mountain lake catchments are irrefutably trace-element contaminated by anthropogenic emissions, which can travel by long-range atmospheric transport before they are deposited. This has been revealed by several natural archives. High mountain lake catchments are thus excellent sentinels of long-range contamination. Continuous accumulation can lead to a build up of potentially toxic trace elements in these remote, or relatively remote, ecosystems. The thesis focuses on the biogeochemistry of a suite of trace elements of environmental concern (Ni, Cu, Zn, As, Se, Cd and Pb) in Pyrenean lake catchments, with special emphasis on discerning the “natural” components from the “anthropogenic” contributions. Five other metallic elements (Al, Fe, Ti, Mn and Zr) have also been studied to trace natural fluxes and biogeochemical processes within the lake catchment systems.