Patronage and bribery in sixteenth-century Peru: The government of Viceroy Conde del Villar and the visita of Licentiate Alonso Fernandez de Bonilla

This dissertation deals with the nature of the political system in sixteenth-century colonial Spanish America through an analysis of the administration of Viceroy Fernando de Torres y Portugal, Conde del Villar, in Peru (1585–1590). The political conflicts surrounding his government and the accusations of bribery leveled against him and members of his household provide the documentation for a case study in a system in which prestige and authority were defined through a complex network of patronage and personal relationships with the Spanish monarch, the ultimate source of legitimate power. ^ This dissertation is conceptualized using categories presented in Max Weber's theory on the nature of political order and authority in the history of human societies and the definition of the patrimonial system as one in which the power of he king confers legitimacy and authority on the whole political structure. ^ The documentary base for this dissertation is an exceptionally detailed and complete record related to the official administrative review ( visita) ordered by Philip II in 1588 to assess the government of Viceroy Torres y Portugal. Additionally, letters as well as other primary and secondary sources are scattered in repositories on both sides of the Atlantic. ^ The study of this particular case offers an excellent opportunity to gain an understanding of a political order in which jurisdictional boundaries between institutions and authorities were not clearly defined. The legal system operating in the viceroyalty was subordinated to the personal decisions of the king, and order and equilibrium were maintained through the interaction of patronage networks that were reproduced at all levels of the colonial society. ^ The final charges against Viceroy Conde del Villar, as well as their impact on the political career of those involved in the accusations, reveal that situations today understood to constitute bribery had a different meaning in the context of a patrimonial order. ^

Adding concurrent data transfer to transport layer

In recent years, the internet has grown exponentially, and become more complex. This increased complexity potentially introduces more network-level instability. But for any end-to-end internet connection, maintaining the connection's throughput and reliability at a certain level is very important. This is because it can directly affect the connection's normal operation. Therefore, a challenging research task is to improve a network's connection performance by optimizing its throughput and reliability. This dissertation proposed an efficient and reliable transport layer protocol (called concurrent TCP (cTCP)), an extension of the current TCP protocol, to optimize end-to-end connection throughput and enhance end-to-end connection fault tolerance. The proposed cTCP protocol could aggregate multiple paths' bandwidth by supporting concurrent data transfer (CDT) on a single connection. Here concurrent data transfer was defined as the concurrent transfer of data from local hosts to foreign hosts via two or more end-to-end paths. An RTT-Based CDT mechanism, which was based on a path's RTT (Round Trip Time) to optimize CDT performance, was developed for the proposed cTCP protocol. This mechanism primarily included an RTT-Based load distribution and path management scheme, which was used to optimize connections' throughput and reliability. A congestion control and retransmission policy based on RTT was also provided. According to experiment results, under different network conditions, our RTT-Based CDT mechanism could acquire good CDT performance. Finally a CWND-Based CDT mechanism, which was based on a path's CWND (Congestion Window), to optimize CDT performance was introduced. This mechanism primarily included: a CWND-Based load allocation scheme, which assigned corresponding data to paths based on their CWND to achieve aggregate bandwidth; a CWND-Based path management, which was used to optimize connections' fault tolerance; and a congestion control and retransmission management policy, which was similar to regular TCP in its separate path handling. According to corresponding experiment results, this mechanism could acquire near-optimal CDT performance under different network conditions.

The recruitment process of the Shining Path and MRTA guerrilla groups: A political psychological perspective

This thesis is an analysis of the recruitment process of the Shining Path -SP- and Revolutionary Movement “Túpac Amaru” -MRTA- guerrilla groups. Although SP was considered more aggressive, it gained more followers than MRTA. This thesis tries to explain why. Social Revolution Theory and Social Movement Theory provide explanations based on issues of “poverty”, disregarding the specific characteristics of the guerrilla groups and their supporters, as well as the influence of specific persuasive processes between the leaders of the groups and their followers. Integrative complexity theory, on the contrary, provides a consistent method to analyze cognitive processes: because people tend to reject complex and sophisticated explanations that require mental efforts, simplicity was the key for success. To prove which guerrilla group provided a simpler worldview, a sample of official documents of SP and MRTA are compared. Finally, content analysis is applied through the Paragraph Completion Test (P.C.T.). ^

Optimization of pavement maintenance and rehabilitation programming using shuffled complex evolution algorithm

The major barrier to practical optimization of pavement preservation programming has always been that for formulations where the identity of individual projects is preserved, the solution space grows exponentially with the problem size to an extent where it can become unmanageable by the traditional analytical optimization techniques within reasonable limit. This has been attributed to the problem of combinatorial explosion that is, exponential growth of the number of combinations. The relatively large number of constraints often presents in a real-life pavement preservation programming problems and the trade-off considerations required between preventive maintenance, rehabilitation and reconstruction, present yet another factor that contributes to the solution complexity. In this research study, a new integrated multi-year optimization procedure was developed to solve network level pavement preservation programming problems, through cost-effectiveness based evolutionary programming analysis, using the Shuffled Complex Evolution (SCE) algorithm.^ A case study problem was analyzed to illustrate the robustness and consistency of the SCE technique in solving network level pavement preservation problems. The output from this program is a list of maintenance and rehabilitation treatment (M&R) strategies for each identified segment of the network in each programming year, and the impact on the overall performance of the network, in terms of the performance levels of the recommended optimal M&R strategy. ^ The results show that the SCE is very efficient and consistent in the simultaneous consideration of the trade-off between various pavement preservation strategies, while preserving the identity of the individual network segments. The flexibility of the technique is also demonstrated, in the sense that, by suitably coding the problem parameters, it can be used to solve several forms of pavement management programming problems. It is recommended that for large networks, some sort of decomposition technique should be applied to aggregate sections, which exhibit similar performance characteristics into links, such that whatever M&R alternative is recommended for a link can be applied to all the sections connected to it. In this way the problem size, and hence the solution time, can be greatly reduced to a more manageable solution space. ^ The study concludes that the robust search characteristics of SCE are well suited for solving the combinatorial problems in long-term network level pavement M&R programming and provides a rich area for future research. ^