Stability of pargasite during ultrahigh-temperature metamorphism:A consequence of titanium and REE partitioning

Orthopyroxene-clinopyroxene-plagioclase needles and symplectite along the cleavage planes and grain boundaries of fluorine-bearing titanian-ferroan pargasite from the Highland Complex, Sri Lanka, are interpreted as evidence for dehydration melting at ultrahigh-temperature conditions. High Ti (up to 0.4 pfu) and F (XF up to 0.56) content in pargasite extends its stability to higher temperatures, and the composition indicates the dehydration melting reaction may take place at ultrahigh-temperatures (~950 °C) at a pressure around 10 kbar, close to peak metamorphic conditions. The increase of Ti content close to the grain boundaries and cleavage planes in pargasite indicates titanium partitioning from the melt during dehydration melting enhanced the stability of the mineral toward ultrahigh-temperature conditions. The REE content in the pargasite shows a similar behavior to that of titanium. The cores with no breakdown assemblage consist of low and flat REE concentrations with respect to the high and Eu-depleted rim. Clinopyroxene in symplectite and needle-shaped lamellae within the pargasite porphyroblasts have similar REE patterns with slightly low-concentrations relative to that of pargasite. In the breakdown assemblage, LREEs are partitioned mainly into plagioclase while the HREEs are partitioned into orthopyroxene. The REE enrichment in the pargasite rims signals their relative partitioning between pargasite rims and melt. Modeling of the partitioning of Ti and REEs associated with pargasite breakdown demonstrates that its stability is greatly enhanced at UHT conditions. This investigation implies that the stability of hydrous minerals such as amphibole can be extended to UHT conditions, and expands our knowledge of metamorphism in the lower crust.

Synergistic Execution of Stream Programs on Multicores with Accelerators

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Optimal Resource Partitioning in a Military Conflict based on Lanchester Attrition Models

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts. The Lanchester attrition model is used to develop the dynamical equations governing the variation in force strength. Three different allocation schemes - Time-Zero-Allocation (TZA), Allocate-Assess-Reallocate (AAR), and Continuous Constant Allocation (CCA) - are considered and the optimal solutions are obtained in each case. Numerical examples are given to support the analytical results.

Optimal Resource Partitioning in a Military Conflict based on Lanchester Attrition Models

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts. The Lanchester attrition model is used to develop the dynamical equations governing the variation in force strength. Three different allocation schemes - Time-Zero-Allocation (TZA), Allocate-Assess-Reallocate (AAR), and Continuous Constant Allocation (CCA) - are considered and the optimal solutions are obtained in each case. Numerical examples are given to support the analytical results.

Optimal resource partitioning in conflicts based on Lanchester (n, 1) attrition model

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary from n different fronts. The problem of optimally partitioning the defending forces against the attacking forces is addressed. The Lanchester square law model is used to develop the dynamical equations governing the variation in force strength. Two different allocation schemes-Time-ZeroAllocation (TZA) and Continuous Constant Allocation (CCA) are considered and the optimal solutions for both are obtained analytically. These results generalize other results available in the literature. Numerical examples are given to support the analytical results.

Parallel circuit partitioning on a reduced array architecture

The physical design of a VLSI circuit involves circuit partitioning as a subtask. Typically, it is necessary to partition a large electrical circuit into several smaller circuits such that the total cross-wiring is minimized. This problem is a variant of the more general graph partitioning problem, and it is known that there does not exist a polynomial time algorithm to obtain an optimal partition. The heuristic procedure proposed by Kernighan and Lin1,2 requires O(n2 log2n) time to obtain a near-optimal two-way partition of a circuit with n modules. In the VLSI context, due to the large problem size involved, this computational requirement is unacceptably high. This paper is concerned with the hardware acceleration of the Kernighan-Lin procedure on an SIMD architecture. The proposed parallel partitioning algorithm requires O(n) processors, and has a time complexity of O(n log2n). In the proposed scheme, the reduced array architecture is employed with due considerations towards cost effectiveness and VLSI realizability of the architecture.The authors are not aware of any earlier attempts to parallelize a circuit partitioning algorithm in general or the Kernighan-Lin algorithm in particular. The use of the reduced array architecture is novel and opens up the possibilities of using this computing structure for several other applications in electronic design automation.

Task assignment in a multiprocessor system

One of the key problems in the design of any incompletely connected multiprocessor system is to appropriately assign the set of tasks in a program to the Processing Elements (PEs) in the system. The task assignment problem has proven difficult both in theory and in practice. This paper presents a simple and efficient heuristic algorithm for assigning program tasks with precedence and communication constraints to the PEs in a Message-based Multiple-bus Multiprocessor System, M3, so that the total execution time for the program is minimized. The algorithm uses a cost function: “Minimum Distance and Parallel Transfer” to minimize the completion time. The effectiveness of the algorithm has been demonstrated by comparing the results with (i) the lower bound on the execution time of a program (task) graph and (ii) a random assignment.

Impaired conflict monitoring in Parkinson's disease patients during an oculomotor redirect task

Fallibility is inherent in human cognition and so a system that will monitor performance is indispensable. While behavioral evidence for such a system derives from the finding that subjects slow down after trials that are likely to produce errors, the neural and behavioral characterization that enables such control is incomplete. Here, we report a specific role for dopamine/basal ganglia in response conflict by accessing deficits in performance monitoring in patients with Parkinson's disease. To characterize such a deficit, we used a modification of the oculomotor countermanding task to show that slowing down of responses that generate robust response conflict, and not post-error per se, is deficient in Parkinson's disease patients. Poor performance adjustment could be either due to impaired ability to slow RT subsequent to conflicts or due to impaired response conflict recognition. If the latter hypothesis was true, then PD subjects should show evidence of impaired error detection/correction, which was found to be the case. These results make a strong case for impaired performance monitoring in Parkinson's patients.

Task Dependent Boundary Mannequins in Statistical DHM

The primary objective of the paper is to make use of statistical digital human model to better understand the nature of reach probability of points in the taskspace. The concept of task-dependent boundary manikin is introduced to geometrically characterize the extreme individuals in the given population who would accomplish the task. For a given point of interest and task, the map of the acceptable variation in anthropometric parameters is superimposed with the distribution of the same parameters in the given population to identify the extreme individuals. To illustrate the concept, the task space mapping is done for the reach probability of human arms. Unlike the boundary manikins, who are completely defined by the population, the dimensions of these manikins will vary with task, say, a point to be reached, as in the present case. Hence they are referred to here as the task-dependent boundary manikins. Simulations with these manikins would help designers to visualize how differently the extreme individuals would perform the task. Reach probability at the points in a 3D grid in the operational space is computed; for objects overlaid in this grid, approximate probabilities are derived from the grid for rendering them with colors indicating the reach probability. The method may also help in providing a rational basis for selection of personnel for a given task.

Flux Partitioning of Species Approach in Binary Interdiffusion Process

Validation of the flux partitioning of species model has been illustrated. Various combinations of inequality expression for the fluxes of species A and B in two successively grown hypothetical intermetallic phases in the interdiffusion zone have been considered within the constraints of this concept. Furthermore, ratio of intrinsic diffusivities of the species A and B in those two phases has been correlated in four different cases. Moreover, complete and or partial validation or invalidation of this model with respect to both the species, has been proven theoretically and also discussed with the Co-Si system as an example.

Multi-UAV Task Allocation using Team Theory

A multiple UAV search and attack mission in a battlefield involves allocating UAVs to different target tasks efficiently. This task allocation becomes difficult when there is no communication among the UAVs and the UAVs sensors have limited range to detect the targets and neighbouring UAVs, and assess target status. In this paper, we propose a team theoretic approach to efficiently allocate UAVs to the targets with the constraint that UAVs do not communicate among themselves and have limited sensor range. We study the performance of team theoretic approach for task allocation on a battle field scenario. The performance obtained through team theory is compared with two other methods, namely, limited sensor range but with communication among all the UAVs, and greedy strategy with limited sensor range and no communication. It is found that the team theoretic strategy performs the best even though it assumes limited sensor range and no communication.

Simultaneous refolding and purification of recombinant proteins by macro-(affinity ligand) facilitated three-phase partitioning

A strategy called macro-(affinity ligand) facilitated three-phase partitioning (MLFTPP) is described for refolding of a diverse set of recombinant proteins starting from the solubilized inclusion bodies. It essentially consists of: (i) binding of the protein with a suitable smart polymer and (ii) precipitating the polymer-protein complex as an interfacial layer by mixing in a suitable amount of ammonium sulfate and t-butanol. Smart polymers are stimuli-responsive polymers that become insoluble on the application of a suitable stimulus (e.g., a change in the temperature, pH, or concentration of a chemical species such as Ca 2+ or K +). The MLFTPP process required approximately 10min, and the refolded proteins were found to be homogeneous on sodium dodecyl sulfate-polyacrylamide gel electrophoresis. The folded proteins were characterized by fluorescence emission spectroscopy, circular dichroism spectroscopy, biological activity, melting temperature, and surface hydrophobicity measurements by 8-anilino-1-naphthalenesulfonate fluorescence. Two refolded antibody fragments were also characterized by measuring K D by Biacore by using immobilized HIV-1 gp120. The data demonstrate that MLFTPP is a rapid and convenient procedure for refolding a variety of proteins from inclusion bodies at high concentration. Although establishing the generic nature of the approach would require wider trials by different groups, its success with the diverse kinds of proteins tried so far appears to be promising.

Cross-Guided Clustering: Transfer of Relevant Supervision across Tasks

Lack of supervision in clustering algorithms often leads to clusters that are not useful or interesting to human reviewers. We investigate if supervision can be automatically transferred for clustering a target task, by providing a relevant supervised partitioning of a dataset from a different source task. The target clustering is made more meaningful for the human user by trading-off intrinsic clustering goodness on the target task for alignment with relevant supervised partitions in the source task, wherever possible. We propose a cross-guided clustering algorithm that builds on traditional k-means by aligning the target clusters with source partitions. The alignment process makes use of a cross-task similarity measure that discovers hidden relationships across tasks. When the source and target tasks correspond to different domains with potentially different vocabularies, we propose a projection approach using pivot vocabularies for the cross-domain similarity measure. Using multiple real-world and synthetic datasets, we show that our approach improves clustering accuracy significantly over traditional k-means and state-of-the-art semi-supervised clustering baselines, over a wide range of data characteristics and parameter settings.

When good neighbors don't need fences: temporal landscape partitioning among baboon social groups

Intraspecific competition is a key factor shaping space-use strategies and movement decisions in many species, yet how and when neighbors utilize shared areas while exhibiting active avoidance of one another is largely unknown. Here, we investigated temporal landscape partitioning in a population of wild baboons (Papio cynocephalus). We used global positioning system (GPS) collars to synchronously record the hourly locations of five baboon social groups for similar to 900 days, and we used behavioral, demographic, and life history data to measure factors affecting use of overlap areas. Annual home ranges of neighboring groups overlapped substantially, as predicted (baboons are considered non-territorial), but home ranges overlapped less when space use was assessed over shorter time scales. Moreover, neighboring groups were in close spatial proximity to one another on fewer days than predicted by a null model, suggesting an avoidance-based spacing pattern. At all time scales examined (monthly, biweekly, and weekly), time spent in overlap areas was greater during time periods when groups fed on evenly dispersed, low-quality foods. The percent of fertile females in social groups was negatively correlated with time spent in overlap areas only during weekly time intervals. This suggests that broad temporal changes in ecological resources are a major predictor of how intensively overlap areas are used, and groups modify these ecologically driven spacing patterns at short time scales based on female reproductive status. Together, these findings offer insight into the economics of territoriality by highlighting the dynamics of spacing patterns at differing time scales.