Innovating from the War Economy: Formal, Informal, and Illicit Economic Activities of the Military in Colombia

Over the last decade, the Colombian military has successfully rolled back insurgent groups, cleared and secured conflict zones, and enabled the extraction of oil and other key commodity exports. As a result, official policies of both the Uribe and Santos governments have promoted the armed forces to participate to an unprecedented extent in economic activities intended to consolidate the gains of the 2000s. These include formal involvement in the economy, streamlined in a consortium of military enterprises and social foundations that are intended to put the Colombian defense sector “on the map” nationally and internationally, and informal involvement expanded mainly through new civic action development projects intended to consolidate the security gains of the 2000s. However, failure to roll back paramilitary groups other than through the voluntary amnesty program of 2005 has facilitated the persistence of illicit collusion by military forces with reconstituted “neoparamilitary” drug trafficking groups. It is therefore crucially important to enhance oversight mechanisms and create substantial penalties for collusion with illegal armed groups. This is particularly important if Colombia intends to continue its new practice of exporting its security model to other countries in the region. The Santos government has initiated several promising reforms to enhance state capacity, institutional transparence, and accountability of public officials to the rule of law, which are crucial to locking in security gains and revitalizing democratic politics. Efforts to diminish opportunities for illicit association between the armed forces and criminal groups should complement that agenda, including the following: Champion breaking existing ties between the military and paramilitary successor groups through creative policies involving a mixture of punishments and rewards directed at the military; Investigation and extradition proceedings of drug traffickers, probe all possible ties, including as a matter of course the possibility of Colombian military collaboration. Doing so rigorously may have an important effect deterring military collusion with criminal groups. Establish and enforce zero-tolerance policies at all military ranks regarding collusion with criminal groups; Reward military units that are effective and also avoid corruption and criminal ties by providing them with enhanced resources and recognition; Rely on the military for civic action and development assistance as minimally as possible in order to build long-term civilian public sector capacity and to reduce opportunities for routine exposure of military forces to criminal groups circulating in local populations.

Algorithms for efficient transaction management and consistent queries in client -server semantic object-oriented parallel databases

Large read-only or read-write transactions with a large read set and a small write set constitute an important class of transactions used in such applications as data mining, data warehousing, statistical applications, and report generators. Such transactions are best supported with optimistic concurrency, because locking of large amounts of data for extended periods of time is not an acceptable solution. The abort rate in regular optimistic concurrency algorithms increases exponentially with the size of the transaction. The algorithm proposed in this dissertation solves this problem by using a new transaction scheduling technique that allows a large transaction to commit safely with significantly greater probability that can exceed several orders of magnitude versus regular optimistic concurrency algorithms. A performance simulation study and a formal proof of serializability and external consistency of the proposed algorithm are also presented.^ This dissertation also proposes a new query optimization technique (lazy queries). Lazy Queries is an adaptive query execution scheme which optimizes itself as the query runs. Lazy queries can be used to find an intersection of sub-queries in a very efficient way, which does not require full execution of large sub-queries nor does it require any statistical knowledge about the data.^ An efficient optimistic concurrency control algorithm used in a massively parallel B-tree with variable-length keys is introduced. B-trees with variable-length keys can be effectively used in a variety of database types. In particular, we show how such a B-tree was used in our implementation of a semantic object-oriented DBMS. The concurrency control algorithm uses semantically safe optimistic virtual "locks" that achieve very fine granularity in conflict detection. This algorithm ensures serializability and external consistency by using logical clocks and backward validation of transactional queries. A formal proof of correctness of the proposed algorithm is also presented. ^