Somali State Failure: Players, Incentives and Institutions

In Somalia the central government collapsed in 1991 and since then state failure became a widespread phenomenon and one of the greatest political and humanitarian problems facing the world in this century. Thus, the main objective of this research is to answer the following question: What went wrong? Most of the existing literature on the political economy of conflict starts from the assumption that state in Africa is predatory by nature. Unlike these studies, the present research, although it uses predation theory, starts from the social contract approach of state definition. Therefore, rather than contemplating actions and policies of the rulers alone, this approach allows us to deliberately bring the role of the society – as citizens – and other players into the analyses. In Chapter 1, after introducing the study, a simple principal-agent model will be developed to check the logical consistence of the argument and to make the identification of causal mechanism easier. I also identify three main actors in the process of state failure in Somalia: the Somali state, Somali society and the superpowers. In Chapter 2, so as to understand the incentives, preferences and constraints of each player in the state failure game, I in some depth analyse the evolution and structure of three central informal institutions: identity based patronage system of leadership, political tribalism, and the Cold War. These three institutions are considered as the rules of the game in the Somali state failure. Chapter 3 summarises the successive civilian governments’ achievements and failures (1960-69) concerning the main national goals, national unification and socio-economic development. Chapter 4 shows that the military regime, although it assumed power through extralegal means, served to some extent the developmental interest of the citizens in the first five years of its rule. Chapter 5 shows the process, and the factors involved, of the military regime’s self-transformation from being an agent for the developmental interests of the society to a predatory state that not only undermines the interests of the society but that also destroys the state itself. Chapter 6 addresses the process of disintegration of the post-colonial state of Somalia. The chapter shows how the regime’s merciless reactions to political ventures by power-seeking opposition leaders shattered the entire country and wrecked the state institutions. Chapter 7 concludes the study by summarising the main findings: due to the incentive structures generated by the informal institutions, the formal state institutions fell apart.

Weak Ehrenfeucht-Fraïssé Games

In this paper we define a game which is played between two players I and II on two mathematical structures A and B. The players choose elements from both structures in moves, and at the end of the game the player II wins if the chosen structures are isomorphic. Thus the difference of this to the ordinary Ehrenfeucht-Fra¨ıss´e game is that the isomorphism can be arbitrary, whereas in the ordinary EF-game it is determined by the moves of the players. We investigate determinacy of the weak EF-game for different (the length of the game) and its relation to the ordinary EF-game.

Functional expression and subcellular localization of the Cl- cotransporters KCC2 and NKCC1 in rodent hippocampal and neocortical neurons

The work presented here has focused on the role of cation-chloride cotransporters (CCCs) in (1) the regulation of intracellular chloride concentration within postsynaptic neurons and (2) on the consequent effects on the actions of the neurotransmitter gamma-aminobutyric acid (GABA) mediated by GABAA receptors (GABAARs) during development and in pathophysiological conditions such as epilepsy. In addition, (3) we found that a member of the CCC family, the K-Cl cotransporter isoform 2 (KCC2), has a structural role in the development of dendritic spines during the differentiation of pyramidal neurons. Despite the large number of publications dedicated to regulation of intracellular Cl-, our understanding of the underlying mechanisms is not complete. Experiments on GABA actions under resting steady-state have shown that the effect of GABA shifts from depolarizing to hyperpolarizing during maturation of cortical neurons. However, it remains unclear, whether conclusions from these steady-state measurements can be extrapolated to the highly dynamic situation within an intact and active neuronal network. Indeed, GABAergic signaling in active neuronal networks results in a continuous Cl- load, which must be constantly removed by efficient Cl- extrusion mechanisms. Therefore, it seems plausible to suggest that key parameters are the efficacy and subcellular distribution of Cl- transporters rather than the polarity of steady-state GABA actions. A further related question is: what are the mechanisms of Cl- regulation and homeostasis during pathophysiological conditions such as epilepsy in adults and neonates? Here I present results that were obtained by means of a newly developed method of measurements of the efficacy of a K-Cl cotransport. In Study I, the developmental profile of KCC2 functionality during development was analyzed both in dissociated neuronal cultures and in acute hippocampal slices. A novel method of photolysis of caged GABA in combination with Cl- loading to the somata was used in this study to assess the extrusion efficacy of KCC2. We demonstrated that these two preparations exhibit a different temporal profile of functional KCC2 upregulation. In Study II, we reported an observation of highly distorted dendritic spines in neurons cultured from KCC2-/- embryos. During their development in the culture dish, KCC2-lacking neurons failed to develop mature, mushroom-shaped dendritic spines but instead maintained an immature phenotype of long, branching and extremely motile protrusions. It was shown that the role of KCC2 in spine maturation is not based on its transport activity, but is mediated by interactions with cytoskeletal proteins. Another important player in Cl- regulation, NKCC1 and its role in the induction and maintenance of native Cl- gradients between the axon initial segment (AIS) and soma was the subject of Study III. There we demonstrated that this transporter mediates accumulation of Cl- in the axon initial segment of neocortical and hippocampal principal neurons. The results suggest that the reversal potential of the GABAA response triggered by distinct populations of interneurons show large subcellular variations. Finally, a novel mechanism of fast post-translational upregulation of the membrane-inserted, functionally active KCC2 pool during in-vivo neonatal seizures and epileptiform-like activity in vitro was identified and characterized in Study IV. The seizure-induced KCC2 upregulation may act as an intrinsic antiepileptogenic mechanism.

Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain

The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando's algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Rectilinear Path Following in 3D Space

This paper addresses the problem of determining an optimal (shortest) path in three dimensional space for a constant speed and turn-rate constrained aerial vehicle, that would enable the vehicle to converge to a rectilinear path, starting from any arbitrary initial position and orientation. Based on 3D geometry, we propose an optimal and also a suboptimal path planning approach. Unlike the existing numerical methods which are computationally intensive, this optimal geometrical method generates an optimal solution in lesser time. The suboptimal solution approach is comparatively more efficient and gives a solution that is very close to the optimal one. Due to its simplicity and low computational requirements this approach can be implemented on an aerial vehicle with constrained turn radius to reach a straight line with a prescribed orientation as required in several applications. But, if the distance between the initial point and the straight line to be followed along the vertical axis is high, then the generated path may not be flyable for an aerial vehicle with limited range of flight path angle and we resort to a numerical method for obtaining the optimal solution. The numerical method used here for simulation is based on multiple shooting and is found to be comparatively more efficient than other methods for solving such two point boundary value problem.

An Efficient Random Walk Strategy for Sampling Based Robot Motion Planners

Sampling based planners have been successful in path planning of robots with many degrees of freedom, but still remains ineffective when the configuration space has a narrow passage. We present a new technique based on a random walk strategy to generate samples in narrow regions quickly, thus improving efficiency of Probabilistic Roadmap Planners. The algorithm substantially reduces instances of collision checking and thereby decreases computational time. The method is powerful even for cases where the structure of the narrow passage is not known, thus giving significant improvement over other known methods.

Frontier Based Multiple Goal Search in Unknown Environments

We present a frontier based algorithm for searching multiple goals in a fully unknown environment, with only information about the regions where the goals are most likely to be located. Our algorithm chooses an ``active goal'' from the ``active goal list'' generated by running a Traveling Salesman Problem (Tsp) routine with the given centroid locations of the goal regions. We use the concept of ``goal switching'' which helps not only in reaching more number of goals in given time, but also prevents unnecessary search around the goals that are not accessible (surrounded by walls). The simulation study shows that our algorithm outperforms Multi-Heuristic LRTA* (MELRTA*) which is a significant representative of multiple goal search approaches in an unknown environment, especially in environments with wall like obstacles.

Comparative Nucleotide and Amino Acid Sequence Analysis of the Sequence-Specific RNA-Binding Rotavirus Nonstructural Protein NSP3

NSP3, an acidic nonstructural protein, encoded by gene 7 has been implicated as the key player in the assembly of the 11 viral plus-strand RNAs into the early replication intermediates during rotavirus morphogenesis. To date, the sequence or NSP3 from only three animal rotaviruses (SA11, SA114F, and bovine UK) has been determined and that from a human strain has not been reported. To determine the genetic diversity among gene 7 alleles from group A rotaviruses, the nucleotide sequence of the NSP3 gene from 13 strains belonging to nine different G serotypes, from both humans and animals, has been determined. Based on the amino acid sequence identity as well as phylogenetic analysis, NSP3 from group A rotaviruses falls into three evolutionarily related groups, i.e., the SA11 group, the Wa group, and the S2 group. The SA 11/SA114F gene appears to have a distant ancestral origin from that of the others and codes for a polypeptide of 315 amino acids (aa) in length. NSP3 from all other group A rotaviruses is only 313 aa in length because of a 2-amino-acid deletion near the carboxy-terminus, While the SA114F gene has the longest 3' untranslated region (UTR) of 132 nucleotides, that from other strains suffered deletions of varying lengths at two positions downstream of the translational termination codon. In spite of the divergence of the nucleotide (nt) sequence in the protein coding region, a stretch of about 80 nt in the 3' UTR is highly conserved in the NSP3 gene from all the strains. This conserved sequence in the 3' UTR might play an important role in the regulation of expression of the NSP3 gene. (C) 1995 Academic Press, Inc.

A Nash Bargaining Approach to Retention Enhancing Bid Optimization in Sponsored Search Auctions with Discrete Bids

Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.

RAD51 as a potential biomarker and therapeutic target for pancreatic cancer

Chemotherapy is a very important therapeutic strategy for cancer treatment. The failure of conventional and molecularly targeted chemotherapeutic regimes for the treatment of pancreatic cancer highlights a desperate need for novel therapeutic interventions. Chemotherapy often fails to eliminate all tumor cells because of intrinsic or acquired drug resistance, which is the most common cause of tumor recurrence. Overexpression of RAD51 protein, a key player in DNA repair/recombination has been observed in many cancer cells and its hyperexpression is implicated in drug resistance. Recent studies suggest that RAD51 overexpression contributes to the development, progression and drug resistance of pancreatic cancer cells. Here we provide a brief overview of the available pieces of evidence in support of the role of RAD51 in pancreatic tumorigenesis and drug resistance, and hypothesize that RAD51 could serve as a potential biomarker for diagnosis of pancreatic cancer. We discuss the possible involvement of RAD51 in the drug resistance associated with epithelial to mesenchymal transition and with cancer stem cells. Finally, we speculate that targeting RAD51 in pancreatic cancer cells may be a novel approach for the treatment of pancreatic cancer. (C) 2011 Elsevier B.V. All rights reserved.

Experimental implementation of quantumUlam’s problem in a nuclear magnetic resonance quantum information processor

The Ulam’s problem is a two person game in which one of the player tries to search, in minimum queries, a number thought by the other player. Classically the problem scales polynomially with the size of the number. The quantum version of the Ulam’s problem has a query complexity that is independent of the dimension of the search space. The experimental implementation of the quantum Ulam’s problem in a Nuclear Magnetic Resonance Information Processor with 3 quantum bits is reported here.

Silencing of toxic gene expression by Fis

Bacteria and bacteriophages have evolved DNA modification as a strategy to protect their genomes. Mom protein of bacteriophage Mu modifies the phage DNA, rendering it refractile to numerous restriction enzymes and in turn enabling the phage to successfully invade a variety of hosts. A strong fortification, a combined activity of the phage and host factors, prevents untimely expression of mom and associated toxic effects. Here, we identify the bacterial chromatin architectural protein Fis as an additional player in this crowded regulatory cascade. Both in vivo and in vitro studies described here indicate that Fis acts as a transcriptional repressor of mom promoter. Further, our data shows that Fis mediates its repressive effect by denying access to RNA polymerase at mom promoter. We propose that a combined repressive effect of Fis and previously characterized negative regulatory factors could be responsible to keep the gene silenced most of the time. We thus present a new facet of Fis function in Mu biology. In addition to bringing about overall downregulation of Mu genome, it also ensures silencing of the advantageous but potentially lethal mom gene.

Silencing of toxic gene expression by Fis

Bacteria and bacteriophages have evolved DNA modification as a strategy to protect their genomes. Mom protein of bacteriophage Mumodifies the phage DNA, rendering it refractile to numerous restriction enzymes and in turn enabling the phage to successfully invade a variety of hosts. A strong fortification, a combined activity of the phage and host factors, prevents untimely expression of mom and associated toxic effects. Here, we identify the bacterial chromatin architectural protein Fis as an additional player in this crowded regulatory cascade. Both in vivo and in vitro studies described here indicate that Fisacts as a transcriptional repressor of mom promoter. Further, our data shows that Fis mediates its repressive effect by denying access to RNA polymerase at mom promoter. We propose that a combined repressive effect of Fis and previously characterized negative regulatory factors could be responsible to keep the gene silenced most of the time. We thus present a new facet of Fis function in Mu biology. In addition to bringing about overall downregulation of Mu genome, it also ensures silencing of the advantageous but potentially lethal mom gene.

ATM- and ATR-mediated phosphorylation of XRCC3 regulates DNA double-strand break-induced checkpoint activation and repair

The RAD51 paralogs XRCC3 and RAD51C have been implicated in homologous recombination (HR) and DNA damage responses. However, the molecular mechanism(s) by which these paralogs regulate HR and DNA damage signaling remains obscure. Here, we show that an SQ motif serine 225 in XRCC3 is phosphorylated by ATR kinase in an ATM signaling pathway. We find that RAD51C but not XRCC2 is essential for XRCC3 phosphorylation, and this modification follows end resection and is specific to S and G(2) phases. XRCC3 phosphorylation is required for chromatin loading of RAD51 and HR-mediated repair of double-strand breaks (DSBs). Notably, in response to DSBs, XRCC3 participates in the intra-S-phase checkpoint following its phosphorylation and in the G(2)/M checkpoint independently of its phosphorylation. Strikingly, we find that XRCC3 distinctly regulates recovery of stalled and collapsed replication forks such that phosphorylation is required for the HR-mediated recovery of collapsed replication forks but is dispensable for the restart of stalled replication forks. Together, these findings suggest that XRCC3 is a new player in the ATM/ATR-induced DNA damage responses to control checkpoint and HR-mediated repair.