Entre gente “aspra e dura” : advertências de um missionário no Congo e Angola (1713-1723)

A singularidade do relacionamento entre, por um lado, o reino do Kongo e as regiões mbundu vizinhas e, por outro, a acção evangelizadora levada a cabo pelos missionários europeus desde o final do século XV é, hoje, largamente reconhecida. Com pontos de partida diversos e enquadramentos conceptuais por vezes distintos, a generalidade dos autores converge na ideia que, ao longo dos séculos, as cosmologias africanas seleccionaram e reinterpretaram símbolos e rituais cristãos sem que a sua solidez e coerência tenham sido abaladas. Contudo, se existe acordo em relação a essa realidade, o mesmo não pode dizer-se relativamente à identificação da natureza e importância dos factores que intervieram nesse processo. Um desses aspectos remete, segundo alguns autores, para a feição tolerante que a acção missionária teria assumido naquelas paragens, permitindo a compatibilização dos preceitos doutrinais cristãos com as práticas culturais daqueles povos. O texto que se segue procura reflectir sobre esta problemática, sugerindo uma outra abordagem aos relatos e demais registos documentais produzidos pelos missionários. Centra-se, em particular, no exame de um conjunto de regras metodológicas para a acção dos missionários no Kongo e em Angola compiladas por Giuseppe Monari, um missionário capuchinho de Modena que chegou a Luanda no início de 1713. A partir desta análise, procura-se sustentar a tese de que a acção missionária em África não pode ser desligada das representação sobre África e os africanos correntes na Europa e do modo como essas imagens evoluem no contexto da experiência vivencial do missionário na realidade africana. Nessa perspectiva, a evangelização dos africanos é pensada, não sobre uma visão tolerante da realidade cultural africana mas, ao invés, a partir de uma imagem que inferioriza os africanos e reduz a sua existência espiritual a um território de ilusão e aparência, dominado pelas forças volúveis do interesse e da paixão.

Foro: revista de derecho. 4 (Recensiones)

Presenta las reseñas de los siguientes libros: Robert Cooter y Thomas Ulen, DERECHO Y ECONOMÍA, México, Fondo de Cultura Económica, 2002, segunda reimpresión, 686 pp. -- Robert Cooter, Ugo Mattei, Pier Giuseppe Monateri, Roberto Pardolesi, Thomas Ulen, Il. MERCATO DELLE REGOLE, ANALISI ECONÓMICA DEL DIRITTO CIVILE, Bologna, II Mulino, 2001, 488 pp. -- Diego Valadés, PROBLEMAS CONSTITUCIONALES DEL ESTADO DE DERECHO, Buenos Aires, Astrea, 2004, segunda edición, 157 pp. -- Instituto Interamericano de Derechos Humanos / Centro para la Justicia y el Derecho Internacional, Los DERECHOS HUMANOS DE LAS MUJERES: FORTALECIENDO SU PROMOCIÓN Y PROTECCIÓN INTERNACIONAL, San José, IIDH, 2004, 203 pp. -- Carlo Guamieri y Patrizia Pederzoli, LOS JUECES y LA POLÍTICA. PODER JUDICIAL y DEMOCRACIA, trad. Miguel Ángel Ruis de Azua, Madrid, Taurus, 1999, 209 pp.

Skill Rating by Bayesian Inference

Systems Engineering often involves computer modelling the behaviour of proposed systems and their components. Where a component is human, fallibility must be modelled by a stochastic agent. The identification of a model of decision-making over quantifiable options is investigated using the game-domain of Chess. Bayesian methods are used to infer the distribution of players’ skill levels from the moves they play rather than from their competitive results. The approach is used on large sets of games by players across a broad FIDE Elo range, and is in principle applicable to any scenario where high-value decisions are being made under pressure.

Dynamic load balancing for the distributed mining of molecular structures

In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.

A customizable multi-agent system for distributed data mining

We present a general Multi-Agent System framework for distributed data mining based on a Peer-to-Peer model. Agent protocols are implemented through message-based asynchronous communication. The framework adopts a dynamic load balancing policy that is particularly suitable for irregular search algorithms. A modular design allows a separation of the general-purpose system protocols and software components from the specific data mining algorithm. The experimental evaluation has been carried out on a parallel frequent subgraph mining algorithm, which has shown good scalability performances.

A management architecture for active networks

In this paper we present an architecture for network and applications management, which is based on the Active Networks paradigm and shows the advantages of network programmability. The stimulus to develop this architecture arises from an actual need to manage a cluster of active nodes, where it is often required to redeploy network assets and modify nodes connectivity. In our architecture, a remote front-end of the managing entity allows the operator to design new network topologies, to check the status of the nodes and to configure them. Moreover, the proposed framework allows to explore an active network, to monitor the active applications, to query each node and to install programmable traps. In order to take advantage of the Active Networks technology, we introduce active SNMP-like MIBs and agents, which are dynamic and programmable. The programmable management agents make tracing distributed applications a feasible task. We propose a general framework that can inter-operate with any active execution environment. In this framework, both the manager and the monitor front-ends communicate with an active node (the Active Network Access Point) through the XML language. A gateway service performs the translation of the queries from XML to an active packet language and injects the code in the network. We demonstrate the implementation of an active network gateway for PLAN (Packet Language for Active Networks) in a forty active nodes testbed. Finally, we discuss an application of the active management architecture to detect the causes of network failures by tracing network events in time.

A reconfigurable neural environment on active networks

This paper proposes the deployment of a neural network computing environment on Active Networks. Active Networks are packet-switched computer networks in which packets can contain code fragments that are executed on the intermediate nodes. This feature allows the injection of small pieces of codes to deal with computer network problems directly into the network core, and the adoption of new computing techniques to solve networking problems. The goal of our project is the adoption of a distributed neural network for approaching tasks which are specific of the computer network environment. Dynamically reconfigurable neural networks are spread on an experimental wide area backbone of active nodes (ABone) to show the feasibility of the proposed approach.

Context-aware visual exploration of molecular databases

Facilitating the visual exploration of scientific data has received increasing attention in the past decade or so. Especially in life science related application areas the amount of available data has grown at a breath taking pace. In this paper we describe an approach that allows for visual inspection of large collections of molecular compounds. In contrast to classical visualizations of such spaces we incorporate a specific focus of analysis, for example the outcome of a biological experiment such as high throughout screening results. The presented method uses this experimental data to select molecular fragments of the underlying molecules that have interesting properties and uses the resulting space to generate a two dimensional map based on a singular value decomposition algorithm and a self organizing map. Experiments on real datasets show that the resulting visual landscape groups molecules of similar chemical properties in densely connected regions.