Botulinum Toxin--how A Poison Turned To A Fascinating Ally Against An Old Adversary.

72

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast.

Hezbollah and Taliban - hybrid adversaries in contemporary conflicts? : views on an adversary from the United States Armed Forces perspective

The experiences of the United States Armed Forces of the wars in Iraq and Afghanistan and Israel Defense Forces in the Second Lebanon War resulted a new term to surface called “hybrid warfare”. It was to describe the complexity of today’s battlefield. The term “hy-brid warfare” was never officially defined nor is it today. The updated version of the US ARMY Field Manual 3-0: Operations (Change 1) from February 22, 2011, introduced and defined “hybrid threat” and thus opened the discussion for hybrid adversary. In this thesis a model is introduced according to which any organization, group or an ad-versary can be examined and evaluated to see whether it qualifies as a hybrid adversary. It is demonstrated by the example of Hezbollah, which is recognized as the best example of an organization utilizing “hybrid warfare” and subsequently categorizing as a hybrid adver-sary. The model will be tested with Afghan Taliban to see whether both the model works and Taliban qualifies as a hybrid adversary or not. According to the model used in this thesis, it is concluded that Taliban does not meet the standards of a hybrid adversary, but with acquisition of standoff weapons it would quickly qualify as one. The model proved to work, and it could be used as a tool by intelligence of-ficers for estimating the threat levels of any group or identifying those groups that are al-ready or are about to develop into a hybrid adversary.

The secret adversary /

Mode of access: Internet.

Representations of gender in the writings of St. Francis Xavier: an interdisciplinary approach

Francis Xavier’s Letters and Writings are eloquent narratives of a journey that absorbed the Saint’s entire life. His experiences and idiosyncrasies, values and categorizations are presented in a clear literate discourse. The missionary is rarely neutral in his opinions as he sustains his unmistakable and omnipresent objective: the conversion of peoples and the expansion of the Society of Jesus. Parallel with this objective, the reader is introduced to the individuals that Xavier meets or that he summons in his epistolary discourse. Letters and Writings presents us with a structured narrative peopled by all those who are subject to and objects of Xavier’s apostolic mission, by helpful and unhelpful persons of influence, and by leading and secondary actors. What is then the position of women, in the collective sense as well as in the individual sense, in the travels and goals that are the centre of Xavier’s Letters and Writings? What is the role of women, that secondary and suppressed term in the man/woman binomial, a dichotomy similar to the civilized/savage and European/native binomials that punctuate Xavier’s narratives and the historic context of his letters? Women are not absent from his writings, but it would be naïve to argue in favour of the author’s misogyny as much as of his “profound knowledge of the female heart”, to quote from Paulo Durão in "Women in the Letters of Saint Francis Xavier" (1952), the only paper on this subject published so far. We denote four great categories of women in the Letters and Writings: European Women, Converted Women, Women Who Profess another Religion, and Women as the Agents and Objects of Sin, the latter of which traverses the other three categories. They all depend on the context, circumstances and judgements of value that the author chooses to highlight and articulate.

Implementação de um Array de detetores de radiação ionizante

Atualmente, as radiações ionizantes desempenham um papel fundamental nas áreas de diagnóstico e terapia, estando omnipresentes em ambientes hospitalares. Contudo, devido aos efeitos biológicos adversos da radiação, torna-se essencial a protecção dos profissionais de saúde e pacientes. Consequentemente, um array de detetores capazes de produzir um sinal acústico, aquando da presença de radiação ionizante excedendo determinados valores limite e transmissão via wireless das leituras para um sistema central _e de grande interesse prático. Nesta dissertação, foi implementado um sistema capaz de alimentar um array de sensores de radiação para monitorização de diferentes espaços e transmissão das leituras efetuadas via wireless. A aquisição de dados foi realizada, recorrendo à utilização de um conversor analógico-digital. Vários testes de validação foram realizados, através de vários passos para alcançar a concretização do sistema final, nomeadamente testes relativos ao circuito de detecção, módulos de comunicação wireless, bem como o uso de diferentes ambientes de desenvolvimento integrados (IDE). Os resultados destes testes mostram a visualização e gravação adequadas dos dados relativos aos níveis de radiação, bem como a transmissão de dados de forma viável, permitindo a monitorização de espaços sujeitos à presença de radiação ionizante. Desta forma, um array de contadores Geiger-Müller, ligados a módulos wireless XBee open-source e uma placa Arduino, possibilitou a implementação de um sistema viável e de baixo custo para monitorização de radiação ionizante e registar esses mesmos dados para posterior análise.

Definição dinâmica de personagens: trabalho de projecto

Trabalho de Projecto submetido à Escola Superior de Teatro e Cinema para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Teatro - especialização em Artes Performativas (Escritas de Cena)

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Mediation incomplete information bargaining with filtered communication

We analyze a continuous-time bilateral double auction in the presence of two-sided incomplete information and a smallest money unit. A distinguishing feature of our model is that intermediate concessions are not observable by the adversary: they are only communicated to a passive auctioneer. An alternative interpretation is that of mediated bargaining. We show that an equilibrium using only the extreme agreements always exists and display the necessary and sufficient condition for the existence of (perfect Bayesian) equilibra which yield intermediate agreements. For the symmetric case with uniform type distribution we numerically calculate the equilibria. We find that the equilibrium which does not use compromise agreements is the least efficient, however, the rest of the equilibria yield the lower social welfare the higher number of compromise agreements are used.

Industrial Location and Space: New Insights

This paper tries to resolve some of the main shortcomings in the empirical literature of location decisions for new plants, i.e. spatial effects and overdispersion. Spatial effects are omnipresent, being a source of overdispersion in the data as well as a factor shaping the functional relationship between the variables that explain a firm’s location decisions. Using Count Data models, empirical researchers have dealt with overdispersion and excess zeros by developments of the Poisson regression model. This study aims to take this a step further, by adopting Bayesian methods and models in order to tackle the excess of zeros, spatial and non-spatial overdispersion and spatial dependence simultaneously. Data for Catalonia is used and location determinants are analysed to that end. The results show that spatial effects are determinant. Additionally, overdispersion is descomposed into an unstructured iid effect and a spatially structured effect. Keywords: Bayesian Analysis, Spatial Models, Firm Location. JEL Classification: C11, C21, R30.

Tackling self-selection into treatment and self-selection into the sample biases in VAA research

Self‐selection into treatment and self‐selection into the sample are major concerns of VAA research and need to be controlled for if the aim is to deduce causal effects from VAA use in observational data. This paper focuses on the methodological aspects of VAA research and outlines omnipresent endogeneity issues, partly imposed through unobserved factors that affect both whether individuals chose to use VAAs and their electoral behavior. We promote using Heckman selection models and apply various versions of the model to data from the Swiss electorate and smartvote users in order to see to what extent selection biases interfere with the estimated effects of interest.

On the computational security of a distributed key distribution scheme

In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss.