999 resultados para Soyland Power Cooperative
Resumo:
"ILENR/RE-SP-87/03."
Resumo:
La presente monografía pretende explorar la cooperación Sur-Sur en el marco de los BRICS como una estrategia de soft power de estos Estados para aumentar su liderazgo global. Lo anterior se constituye como un elemento fundamental en la consolidación de los BRICS como un foro político y ha permitido el inicio de un proceso de cohesión identitaria dentro del grupo, lo que a su vez ha generado que actúen conjuntamente en diferentes espacios. El análisis se hace a través de la aproximación teórica de la hegemonía cooperativa de Thomas Pedersen y el concepto de soft power desarrollado por Joseph Nye, lo que permite no solo caracterizar a los miembros del grupo BRICS sino que también da lugar a identificar sus aspiraciones en el foro y en torno a qué temas u objetivos se unen.
Resumo:
"February 1989."
Resumo:
We consider a cooperative relaying network in which a source communicates with a group of users in the presence of one eavesdropper. We assume that there are no source-user links and the group of users receive only retransmitted signal from the relay. Whereas, the eavesdropper receives both the original and retransmitted signals. Under these assumptions, we exploit the user selection technique to enhance the secure performance. We first find the optimal power allocation strategy when the source has the full channel state information (CSI) of all links. We then evaluate the security level through: i) ergodic secrecy rate and ii) secrecy outage probability when having only the statistical knowledge of CSIs.
Resumo:
In this work we investigate the population dynamics of cooperative hunting extending the McCann and Yodzis model for a three-species food chain system with a predator, a prey, and a resource species. The new model considers that a given fraction sigma of predators cooperates in prey's hunting, while the rest of the population 1-sigma hunts without cooperation. We use the theory of symbolic dynamics to study the topological entropy and the parameter space ordering of the kneading sequences associated with one-dimensional maps that reproduce significant aspects of the dynamics of the species under several degrees of cooperative hunting. Our model also allows us to investigate the so-called deterministic extinction via chaotic crisis and transient chaos in the framework of cooperative hunting. The symbolic sequences allow us to identify a critical boundary in the parameter spaces (K, C-0) and (K, sigma) which separates two scenarios: (i) all-species coexistence and (ii) predator's extinction via chaotic crisis. We show that the crisis value of the carrying capacity K-c decreases at increasing sigma, indicating that predator's populations with high degree of cooperative hunting are more sensitive to the chaotic crises. We also show that the control method of Dhamala and Lai [Phys. Rev. E 59, 1646 (1999)] can sustain the chaotic behavior after the crisis for systems with cooperative hunting. We finally analyze and quantify the inner structure of the target regions obtained with this control method for wider parameter values beyond the crisis, showing a power law dependence of the extinction transients on such critical parameters.
Resumo:
The activity of Control Center operators is important to guarantee the effective performance of Power Systems. Operators’ actions are crucial to deal with incidents, especially severe faults like blackouts. In this paper, we present an Intelligent Tutoring approach for training Portuguese Control Center operators in tasks like incident analysis and diagnosis, and service restoration of Power Systems. Intelligent Tutoring System (ITS) approach is used in the training of the operators, having into account context awareness and the unobtrusive integration in the working environment. Several Artificial Intelligence techniques were criteriously used and combined together to obtain an effective Intelligent Tutoring environment, namely Multiagent Systems, Neural Networks, Constraint-based Modeling, Intelligent Planning, Knowledge Representation, Expert Systems, User Modeling, and Intelligent User Interfaces.
Resumo:
As the complexity of embedded systems increases, multiple services have to compete for the limited resources of a single device. This situation is particularly critical for small embedded devices used in consumer electronics, telecommunication, industrial automation, or automotive systems. In fact, in order to satisfy a set of constraints related to weight, space, and energy consumption, these systems are typically built using microprocessors with lower processing power and limited resources. The CooperatES framework has recently been proposed to tackle these challenges, allowing resource constrained devices to collectively execute services with their neighbours in order to fulfil the complex Quality of Service (QoS) constraints imposed by users and applications. In order to demonstrate the framework's concepts, a prototype is being implemented in the Android platform. This paper discusses key challenges that must be addressed and possible directions to incorporate the desired real-time behaviour in Android.
Resumo:
The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to perform services with specific Quality of Service constraints, particularly in dynamic distributed environments where the characteristics of the computational load cannot always be predicted in advance. Our work addresses this problem by allowing resource constrained devices to cooperate with more powerful neighbour nodes, opportunistically taking advantage of global distributed resources and processing power. Rather than assuming that the dynamic configuration of this cooperative service executes until it computes its optimal output, the paper proposes an anytime approach that has the ability to tradeoff deliberation time for the quality of the solution. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves at each iteration, with an overhead that can be considered negligible.
Resumo:
8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.
Resumo:
Background: Design of newly engineered microbial strains for biotechnological purposes would greatly benefit from the development of realistic mathematical models for the processes to be optimized. Such models can then be analyzed and, with the development and application of appropriate optimization techniques, one could identify the modifications that need to be made to the organism in order to achieve the desired biotechnological goal. As appropriate models to perform such an analysis are necessarily non-linear and typically non-convex, finding their global optimum is a challenging task. Canonical modeling techniques, such as Generalized Mass Action (GMA) models based on the power-law formalism, offer a possible solution to this problem because they have a mathematical structure that enables the development of specific algorithms for global optimization. Results: Based on the GMA canonical representation, we have developed in previous works a highly efficient optimization algorithm and a set of related strategies for understanding the evolution of adaptive responses in cellular metabolism. Here, we explore the possibility of recasting kinetic non-linear models into an equivalent GMA model, so that global optimization on the recast GMA model can be performed. With this technique, optimization is greatly facilitated and the results are transposable to the original non-linear problem. This procedure is straightforward for a particular class of non-linear models known as Saturable and Cooperative (SC) models that extend the power-law formalism to deal with saturation and cooperativity. Conclusions: Our results show that recasting non-linear kinetic models into GMA models is indeed an appropriate strategy that helps overcoming some of the numerical difficulties that arise during the global optimization task.
Resumo:
[cat] En aquest article es considera un problema de cooperació entre agents on cada agent realitza una contribució (diners, capital, treball, esforç) per tal d'obtenir un benefici comú a repartir. El repartiment proporcional respecte a les contribucions és una distribució que pertany al nucli del joc cooperatiu associat. A partir d'aquest model bàsic s'introdueix un agent extern que pot realitzar una determinada aportació que serveix per avaluar el potencial benefici de cada subcoalició d'agents si aquest nou agent finalment entrés. Aquesta anàlisi pot produir que el poder relatiu dels agents hagi variat. en concret s'avalua si la distribució proporcional és encara robusta des del punt de vista de la seva pertinença al conjunt de negociació. Amb aquest objectiu, analitzem el problema utilitzant el model de joc cooperatius amb estructura de coalició. Donat que, en general, la distribució proporcional, no pertany al conjunt de negociació, s'estudia una condició suficient per a que així sigui. També enunciem una condició necessària, i finalment es proposa una condició suficient que garanteix que el repartiment proporcional és la única distribució existent dins del conjunt de negociació.
Resumo:
[cat] En aquest article es considera un problema de cooperació entre agents on cada agent realitza una contribució (diners, capital, treball, esforç) per tal d'obtenir un benefici comú a repartir. El repartiment proporcional respecte a les contribucions és una distribució que pertany al nucli del joc cooperatiu associat. A partir d'aquest model bàsic s'introdueix un agent extern que pot realitzar una determinada aportació que serveix per avaluar el potencial benefici de cada subcoalició d'agents si aquest nou agent finalment entrés. Aquesta anàlisi pot produir que el poder relatiu dels agents hagi variat. en concret s'avalua si la distribució proporcional és encara robusta des del punt de vista de la seva pertinença al conjunt de negociació. Amb aquest objectiu, analitzem el problema utilitzant el model de joc cooperatius amb estructura de coalició. Donat que, en general, la distribució proporcional, no pertany al conjunt de negociació, s'estudia una condició suficient per a que així sigui. També enunciem una condició necessària, i finalment es proposa una condició suficient que garanteix que el repartiment proporcional és la única distribució existent dins del conjunt de negociació.
Resumo:
The SAGUAPAC cooperative in the city of Santa Cruz de la Sierra (Eastern Bolivia) is regularly presented as an example of cooperative successes regarding water supply and sanitation. Its efficiency, both economic and technical, is widely considered as the main reason for its attractiveness. However, without denying its importance, we show, through a discourse analysis from and about SAGUAPAC in local media, that moral and non-instrumental factors are crucial in the reproduction of the cooperative. These factors create attachment and affection toward the cooperative, through a storytelling using a four-dimensional rhetoric (mythification, identification, emotionalisation and personification). This storytelling technique, internalized in the local media discourse and materializing the so-called new spirit of capitalism, exploits the affects and instrumentalisation of local myths and legends, as well as the 'camba' ethnic identity. In that, it tends to retain SAGUAPAC members and to canvass new ones, by providing them with recognition in their quality of local community members. However, the mobilisation of social norms and power hierarchies might end up reinforcing the social exclusion of Andean non-camba immigrants, inspite of an a priori inclusive and democratic organisation.
Resumo:
Data caching can remarkably improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. The cache placement problem minimizes total data access cost in ad hoc networks with multiple data items. The ad hoc networks are multi hop networks without a central base station and are resource constrained in terms of channel bandwidth and battery power. By data caching the communication cost can be reduced in terms of bandwidth as well as battery energy. As the network node has limited memory the problem of cache placement is a vital issue. This paper attempts to study the existing cooperative caching techniques and their suitability in mobile ad hoc networks.