Division of Labor in Hand Usage in Free- Ranging Bonnet Macaques, Macaca radiata

Primates exhibit laterality in hand usage either in terms of (a) hand with which an individual solves a task or while solving a task that requires both hands, executes the most complex action, that is, hand preference, or (b) hand with which an individual executes actions most efficiently, that is, hand performance. Observations from previous studies indicate that laterality in hand usage might reflect specialization of the two hands for accomplishing tasks that require maneuvering dexterity or physical strength. However, no existing study has investigated handedness with regard to this possibility. In this study, we examined laterality in hand usage in urban free-ranging bonnet macaques, Macaca radiata with regard to the above possibility. While solving four distinct food extraction tasks which varied in the number of steps involved in the food extraction process and the dexterity required in executing the individual steps, the macaques consistently used one hand for extracting food (i.e., task requiring maneuvering dexterity)the maneuvering hand, and the other hand for supporting the body (i.e., task requiring physical strength)the supporting hand. Analogously, the macaques used the maneuvering hand for the spontaneous routine activities that involved maneuvering in three-dimensional space, such as grooming, and hitting an opponent during an agonistic interaction, and the supporting hand for those that required physical strength, such as pulling the body up while climbing. Moreover, while solving a task that ergonomically forced the usage of a particular hand, the macaques extracted food faster with the maneuvering hand as compared to the supporting hand, demonstrating the higher maneuvering dexterity of the maneuvering hand. As opposed to the conventional ideas of handedness in non-human primates, these observations demonstrate division of labor between the two hands marked by their consistent usage across spontaneous and experimental tasks requiring maneuvering in three-dimensional space or those requiring physical strength. Am. J. Primatol. 76:576-585, 2014. (c) 2013 Wiley Periodicals, Inc.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

Divide-and-Correct Algorithm for Division in a Negative Base

A divide-and-correct algorithm is described for multiple-precision division in the negative base number system. In this algorithm an initial quotient estimate is obtained from suitable segmented operands; this is then corrected by simple rules to arrive at the true quotient.

Divide-and-Correct Algorithm for Division in a Negative Base

A divide-and-correct algorithm is described for multiple-precision division in the negative base number system. In this algorithm an initial quotient estimate is obtained from suitable segmented operands; this is then corrected by simple rules to arrive at the true quotient.

Deterministic Division Algorithm in a Negative Base

Described here is a deterministic division algorithm in a negative-base number system; here, the divisor is mapped into a suitable range by premultiplication, so that the choice of the quotient digit is deterministic.

Division of the Salmonella-Containing Vacuole and Depletion of Acidic Lysosomes in Salmonella-Infected Host Cells Are Novel Strategies of Salmonella enterica To Avoid Lysosomes

Salmonella has evolved several strategies to counteract intracellular microbicidal agents like reactive oxygen and nitrogen species. However, it is not yet clear how Salmonella escapes lysosomal degradation. Some studies have demonstrated that Salmonella can inhibit phagolysosomal fusion, whereas other reports have shown that the Salmonella-containing vacuole (SCV) fuses/interacts with lysosomes. Here, we have addressed this issue from a different perspective by investigating if the infected host cell has a sufficient quantity of lysosomes to target Salmonella. Our results suggest that SCVs divide along with Salmonella, resulting in a single bacterium per SCV. As a consequence, the SCV load per cell increases with the division of Salmonella inside the host cell. This demands more investment from the host cell to counteract Salmonella. Interestingly, we observed that Salmonella infection decreases the number of acidic lysosomes inside the host cell both in vitro and in vivo. These events potentially result in a condition in which an infected cell is left with insufficient acidic lysosomes to target the increasing number of SCVs, which favors the survival and proliferation of Salmonella inside the host cell.

Genetic Heterogeneity in Wild Isolates of Cellular Slime Mold Social Groups

This study addresses the issues of spatial distribution, dispersal, and genetic heterogeneity in social groups of the cellular slime molds (CSMs). The CSMs are soil amoebae with an unusual life cycle that consists of alternating solitary and social phases. Because the social phase involves division of labor with what appears to be an extreme form of "altruism", the CSMs raise interesting evolutionary questions regarding the origin and maintenance of sociality. Knowledge of the genetic structure of social groups in the wild is necessary for answering these questions. We confirm that CSMs are widespread in undisturbed forest soil from South India. They are dispersed over long distances via the dung of a variety of large mammals. Consistent with this mode of dispersal, most social groups in the two species examined for detailed study, Dictyostelium giganteum and Dictyostelium purpureum, are multi-clonal.

A numerical study of division of flow in open channels

A two-dimensional numerical model which employs the depth-averaged forms of continuity and momentum equations along with k-e turbulence closure scheme is used to simulate the flow at the open channel divisions. The model is generalised to flows of arbitrary geometries and MacCormack finite volume method is used for solving governing equations. Application of cartesian version of the model to analyse the flow at right-angled junction is presented. The numerical predictions are compared with experimental data of earlier investigators and measurements made as part of the present study. Performance of the model in predicting discharge distribution, surface profiles, separation zone parameters and energy losses is evaluated and discussed in detail. To illustrate the application of the numerical model to analyse the flow in acute angled offtakes and streamlined branch entries, a few computational results are presented.

Small Ubiquitin-related Modifier Ligase Activity of Mms21 Is Required for Maintenance of Chromosome Integrity during the Unperturbed Mitotic Cell Division Cycle in Saccharomyces cerevisiae

The SUMO ligase activity of Mms21/Nse2, a conserved member of the Smc5/6 complex, is required for resisting extrinsically induced genotoxic stress. We report that the Mms21 SUMO ligase activity is also required during the unchallenged mitotic cell cycle in Saccharomyces cerevisiae. SUMO ligase-defective cells were slow growing and spontaneously incurred DNA damage. These cells required caffeine-sensitive Mec1 kinase-dependent checkpoint signaling for survival even in the absence of extrinsically induced genotoxic stress. SUMO ligase-defective cells were sensitive to replication stress and displayed synthetic growth defects with DNA damage checkpoint-defective mutants such as mec1, rad9, and rad24. MMS21 SUMO ligase and mediator of replication checkpoint 1 gene (MRC1) were epistatic with respect to hydroxyurea-induced replication stress or methyl methanesulfonate-induced DNA damage sensitivity. Subjecting Mms21 SUMO ligase-deficient cells to transient replication stress resulted in enhancement of cell cycle progression defects such as mitotic delay and accumulation of hyperploid cells. Consistent with the spontaneous activation of the DNA damage checkpoint pathway observed in the Mms21-mediated sumoylation-deficient cells, enhanced frequency of chromosome breakage and loss was detected in these mutant cells. A mutation in the conserved cysteine 221 that is engaged in coordination of the zinc ion in Loop 2 of the Mms21 SPL-RING E3 ligase catalytic domain resulted in strong replication stress sensitivity and also conferred slow growth and Mec1 dependence to unchallenged mitotically dividing cells. Our findings establish Mms21-mediated sumoylation as a determinant of cell cycle progression and maintenance of chromosome integrity during the unperturbed mitotic cell division cycle in budding yeast.

The TCP4 transcription factor of Arabidopsis blocks cell division in yeast at G1 -> S transition

The TCP transcription factors control important aspects of plant development. Members of class I TCP proteins promote cell cycle by regulating genes directly involved in cell proliferation. In contrast, members of class II TCP proteins repress cell division. While it has been postulated that class II proteins induce differentiation signal, their exact role on cell cycle has not been studied. Here, we report that TCP4, a class II TCP protein from Arabidopsis that repress cell proliferation in developing leaves, inhibits cell division by blocking G1 -> S transition in budding yeast. Cells expressing TCP4 protein with increased transcriptional activity fail to progress beyond G1 phase. By analyzing global transcriptional status of these cells, we show that expression of a number of cell cycle genes is altered. The possible mechanism of G1 -> S arrest is discussed. (C) 2011 Elsevier Inc. All rights reserved.

Incentive compatible mechanisms for group ticket allocation in software maintenance services

A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or more engineers is generally taken by the lead, based on customer delivery deadlines and a guided complexity assessment from each maintenance engineer. The key challenge in such a scenario is two folds, un-truthful (hiked up) elicitation of ticket complexity by each engineer to the lead and the decision of allocating the ticket to a group of engineers who will solve the ticket with in customer deadline. The decision of allocation should ensure Individual and Coalitional Rationality along with Coalitional Stability. In this paper we use game theory to examine the issue of truthful elicitation of ticket complexities by engineers for solving ticket as a group given a specific customer delivery deadline. We formulate this problem as strategic form game and propose two mechanisms, (1) Division of Labor (DOL) and (2) Extended Second Price (ESP). In the proposed mechanisms we show that truth telling by each engineer constitutes a Dominant Strategy Nash Equilibrium of the underlying game. Also we analyze the existence of Individual Rationality (IR) and Coalitional Rationality (CR) properties to motivate voluntary and group participation. We use Core, solution concept from co-operative game theory to analyze the stability of the proposed group based on the allocation and payments.

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

Stochastic optimization for adaptive labor staffing in service systems

Service systems are labor intensive. Further, the workload tends to vary greatly with time. Adapting the staffing levels to the workloads in such systems is nontrivial due to a large number of parameters and operational variations, but crucial for business objectives such as minimal labor inventory. One of the central challenges is to optimize the staffing while maintaining system steady-state and compliance to aggregate SLA constraints. We formulate this problem as a parametrized constrained Markov process and propose a novel stochastic optimization algorithm for solving it. Our algorithm is a multi-timescale stochastic approximation scheme that incorporates a SPSA based algorithm for ‘primal descent' and couples it with a ‘dual ascent' scheme for the Lagrange multipliers. We validate this optimization scheme on five real-life service systems and compare it with a state-of-the-art optimization tool-kit OptQuest. Being two orders of magnitude faster than OptQuest, our scheme is particularly suitable for adaptive labor staffing. Also, we observe that it guarantees convergence and finds better solutions than OptQuest in many cases.