Com o crescimento da utilização das redes de computadores e também o aumento da utilização das redes de dispositivos para a automação, torna-se cada vez mais atrativo se pensar em uma solução que integre essas tecnologias. Em cada uma das áreas se observa um aumento da utilização da tecnologia LonWorks em redes distribuídas de dispositivos, e a consolidação do Simple Network Management Protocol (SNMP) como um protocolo padrão para o gerenciamento das redes de computadores. Neste trabalho foi desenvolvido um agente proxy SNMP, capaz de auxiliar no gerenciamento de uma rede de automação baseada na tecnologia LonWorks através do uso de ferramentas já disponíveis no mercado para a realização do gerenciamento das redes de computadores. Esse tipo de solução possibilita que uma mesma equipe possa gerenciar as duas estruturas de rede, através de um mesmo sistema, facilitando a interação entre os dispositivos e reduzindo o custo atrelado à manutenção das equipes. O agente foi desenvolvido através da utilização de uma Application Programming Interface (API), que implementa toda a estrutura de comunicação SNMP; e para realizar o gerenciamento foi criada uma Management Information Base (MIB), com algumas informações de diagnóstico do dispositivo. / With the growth of the computer networks use and also the increase of devices network for the automation use, becomes each more attractive think about a solution that integrates these technologies. In each one of those areas it observes, an increase of the LonWorks technology use in distributed networks of devices, and the consolidation of the Simple Network Management Protocol (SNMP) as a protocol standard for the management of the computer networks. In this work was developed a proxy agent SNMP, capable to assist the management of control network, based on the LonWorks technology, through the available tools use already in the market for the accomplishment of the computer networks management. This solution type makes possible that same team can manage two network structures, through the same system, facilitating the interaction between the devices and reducing maintenance teams cost. The agent was developed through of an Application Programming Interface (API) use, that implements all the communication structure SNMP; and to achieve the management was created a Management Information Base (MIB), with some information of devices diagnosis.

Syfte: Studien har två huvudsakliga syften. Det första är att beskriva hur proxy voting sker i Sverige och i hur pass stor omfattning proxy voting förekommer. Det andra är att analysera proxy voting utifrån den teoretiska bild som finns om bolagsstyrning och ägande. Metod: Vi intervjuade nyckelpersoner i proxy voting-processen och genomförde en enkätundersökning med företag på large cap-listan. Slutsatser: Svensk bolagsstyrning är i förändring, ägare som visar upp ett nytt beteende. Det ställs krav på bättre informationssystem hos företag för att hantera proxy voting. Delade meningar om proxy voting som metod.

With the convenience and development of digital signature and network technologies, several companies are beginning to transmit documents and messages over networks.This is expected to reduce costs and improve the efficiency of the working process. Based on the typical digital signature technique over public key infrastructure, each company can apply for its own certificate from the certificate authority to enable people to verify whether a message is signed by the company through the public key within the certificate. Generally, a general manager is responsible for signing a message to be published. However, the general manager is not always available; hence, the proxy signature scheme can be an efficient solution to this problem. In the typical proxy signature scheme, the delegator will delegate a proxy agent with the power of signing. The proxy agent can sign and produce the signature of the company on behalf of the general manager. A malicious proxy agent involved in the signing process may cause substantial damage to the company because of misbehaviors, such as signature forgery. Therefore, we propose a provably secure multi-agent designated proxy re-signature scheme. In the proposed scheme, the general manager designates several agents as delegatees. Each delegatee signs the message and send her/his signature to the proxy. The proxy can re-sign the message to form the signature of the company only when the proxy has obtained signatures from all delegatees. In addition, security definitions and formal proofs are provided in our scheme.

Univ., Diss.--Frankfurt (Main), 2004. / Literaturverz. S. 459 - 485.

The Munchausen syndrome by proxy refers to a pathology characterized by physical and emotional abuse in which the simulation or production of symptoms is directed towards a child, which involves taking him or her to health treatments and unnecessary surgeries. The difficulties in the diagnosis of this form of abuse and the emotional aspects involved highlight the destructive effects in the infancy subjectivity due to the lack of loving capacity protecting and prioritizing the child demands. Psychoanalysis offers a differentiated view, comprehending that the mother attempts to elaborate her own psychic conflicts by the repetition of traumatic experience. There is a necessity of comprehension of the instinct destructivity presented in the maternal unconscious dynamics revealed in the modality of caring which is reflected in violence. / El Síndrome de Munchausen by proxy se refiere a una patología caracterizada por el abuso físico o emocional, en donde la simulación o producción de síntomas es direccionada al hijo, llevando a tratamientos de salud y cirugías innecesarios. Las dificultades diagnósticas de este tipo de abuso y los aspectos emocionales implicados llaman atención por los efectos destructivos en la subjetividad infantil, fruto de una falla en la capacidad de amar, proteger y priorizar las demandas del hijo. El Psicoanálisis ofrece una mirada que retrata un intento de elaboración de los propios conflictos psíquicos por la vía de la repetición de vivencias traumáticas. Así, se percibe la necesidad de una comprensión de la destrucción pulsional presente en la dinámica inconsciente materna revelada por esta modalidad de cuidado que se traduce en violencia.

This thesis is focused on practical application of two methods used in non-life insurance, Nested Monte Carlo and Least squares Monte Carlo. Best estimate and 99.5% quantile was calculated using both methods and results was compared. Both methods are similar in estimates and therefore can be used for computation of capital requirement. Least squares Monte Carlo seem more favourable, because it significantly reduces computation time.

Alors que l’on utilise couramment de nombreux modèles numériques différents pour la description statique des réservoirs souterrains et des incertitudes associées, les incertitudes sur les écoulements des fluides à l’intérieur de ces réservoirs ne peuvent, pour des raisons de performance, que s’appuyer que sur quelques simulations d’écoulements. Les travaux de cette thèse ont donc pour objectif d’améliorer la transmission de l’impact des incertitudes statiques sur les réponses du simulateur dynamique d’écoulements sans augmenter le temps de calcul, grâce à des modèles approchés (proxy). Pour cela deux axes de recherche ont été menés : - L’implémentation de nouveaux proxys basés sur le Fast Marching, afin de modéliser la propagation d’un fluide dans un réservoir avec seulement quelques paramètres. Cela permet d’obtenir des courbes de réponse similaires à celles fournit par le simulateur d’écoulement pour un temps de calcul très court ; - La mise en place d’une procédure de minimisation mathématique afin de prédire les courbes de réponses du simulateur d’écoulement à partir d’un modèle analytique et des distances entre les modèles calculées avec les réponses des proxys. Les méthodes développées ont été appliquées sur deux cas d’études réels afin de les valider face aux données disponibles dans l’industrie. Les résultats ont montrés que les proxys que nous avons implémentés apportent de meilleures informations que les proxys disponibles bien que les nôtres soient toujours perfectibles. Nous avons aussi mis en évidence l’intérêt de notre procédure de minimisation pour mieux évaluer les incertitudes dynamiques à partir du moment où le proxy utilisé est suffisamment fiable / Although it is common to use many different numerical models for the static description of underground reservoirs and their associated uncertainties, for fluid flow uncertainties through these reservoirs only few dynamic simulations can be used due to performance reasons. The objective of this thesis’ work is to better transmit the impact of static uncertainties on flow simulator’s responses without increasing computation time, using approximated models (proxies). Research has been undertaken in 2 directions: - Implementation of new proxies based on Fast Marching in order to better approach fluid propagation behavior in a reservoir using only a few parameters. This allows to obtain response curves close to those provided by the flow simulator in a very short period of time - Set up a mathematical minimization’s procedure in order to predict flow simulator’s response curves using an analytical model and distances between proxy responses computed on every model. The methods developed during this PhD have been applied on two different real cases in order to validate them with industry data. Results have shown that our new proxy improve the quality of the information about fluid behavior compared to the available proxy even though ours can still be improved. We also highlight that our minimization procedure better assesses dynamic uncertainties if the proxy used is reliable enough

This work deals with topic of LAMP software bundle performance optimalization. Step by step, it tries to discover performance problems in all four parts of LAMP (in Linux, HTTP server Apache, MySQL database and PHP language interpreter). A model web application is created for these testing purposes. When a problem is found, a change in configuration files is done or a performance improving technology is applied to the corresponding part. A set of optimalization recommendations is compiled and verified on server running real web application.

Proxy conflict seems to be on the rise as the contemporary form of armed conflict, particularly manifesting itself in the Middle East and North Africa. While proxy conflicts enjoy increased attention in academia, little research has focused on the type of support a sponsor provides to its proxy. This thesis contributes to the literature by asking under what circumstances does sponsor provide soft power support to proxies in proxy conflict? I employ a qualitative most-similar case design of Iran’ssupport to the Supreme Council for Islamic Revolution (SCIRI) and its military wing the Badr organization in Iraq, as well as United Arab Emirates’ (UAE) support to General Haftar and the Libyan National Army (LNA) in Libya. The theoretical argument posits that mobilized sectarian bonds between sponsor and proxy facilitate a trust that induces the sponsor to provide soft power support in addition to the baseline support of hard power. The empirical findings give mixed support for the argument, as both sponsors provided soft power support, albeit at somewhat various degrees. Notably, Iran mobilized deeper and broader amongst the organizational structure of the proxy and its followers, while UAE arguably only engaged with Haftar as a strong leader but less so with NLA as an organization and its followers. Therefore, there seems to a difference in how the two sponsors penetrated their mobilization of proxies.

In this thesis, we propose a decentralized peer-to-peer (P2P) Web proxy cache for enterprise networks (ENs). Currently, enterprises use a centralized proxy-based Web cache, where a dedicated proxy server does the caching. A dedicated proxy Web Cache has to be over-provisioned to handle peak loads. It is expensive, a single point of failure, and a bottleneck. In a P2P Web Cache, the clients themselves cooperate in caching the Web objects without any dedicated proxy cache. The resources from the client machines are pooled together to form a Web cache. This eliminates the need for extra hardware and the single point of failure, and improves the average response time, since all the machines serve the request queue. The most important attraction for the P2P scheme is its inherent scalability. Squirrel was the earliest P2P Web cache. Squirrel is built upon a structured P2P protocol called Pastry. Pastry is based on consistent hashing; a special hashing that performs well in the presence of client membership changes. Consistent hashing based protocols are designed for Internet-wide environments to handle very large membership sizes and high rates of membership change. To minimize the protocol bandwidth, the membership state maintained at each peer is very small. This state consists of the information about the peer’s immediate neighbours, and those of a few other P2P members, to achieve faster look-up. This scheme has the following advantages: (i) since peers do not maintain information about all the other peers in the system, any peer needing an object has to find the peer responsible for the object through a multi-hop lookup, thereby increasing the latency, and (ii) the number of objIds assigned to a peer depends on the hashing used, and this can be skewed, which affects the load distribution. The popular applications of the P2P paradigm have been file-sharing systems. These systems are deployed across the Internet. Hence, the existing P2P protocols were designed to operate within the constraints of Internet environments. The P2P proxy Web cache has been a recent application of the P2P paradigm. P2P Web Proxy caches operate across the entire network of an enterprise. An enterprise network(EN) comprises all the computing and communications capabilities of an institution. Institutions typically consist of many departments, with each department having and managing its own local area netwok (LAN). The available bandwidth in LANs is very high. LANs have low latency and low error rates. EN environments have smaller membership size, less frequent membership changes and more available bandwidth. Hence, in such environments, the P2P protocol can afford to store more membership information. This thesis explores the significant differences between EN and Internet environments. It proposes a new P2P protocol designed to exploit these differences, and a P2P Web proxy caching scheme based on this new protocol. Specifically, it shows that it is possible to maintain complete the consistent membership information on ENs. The thesis then presents a load distribution policy for a P2P system with complete and consistent membership information to achieve (i) load balance and (ii) minimum object migrations subsequent to each node join or node leave event. The proposed system requires extra storage and bandwidth costs. We have seen that the necessary storage is available in general workstations and the required bandwidth is feasible in modern networks. We then evaluated the improvement in performance achieved by the system over existing consistent hashing based systems. We have shown that without investing in any special hardware, the P2P system can match the performance of dedicated proxy caches. We have further shown that the buddy based P2P scheme has a better load distribution, especially under heavy loads when load balancing becomes critical. We have also shown that for large P2P systems, the buddy based scheme has a lower latency than the consistent hashing based schemes. Further, we have compared the costs of the proposed scheme and the existing consistent hashing based scheme for different loads (i.e., rate of Web object requests), and identified the situations in which the proposed scheme is likely to perform best. In summary, the thesis shows that (i) the membership dynamics of P2P systems on ENs are different from that of Internet file-sharing systems and (ii) it is feasible in ENs, to maintain complete the consistent view of the P2P membership at all the peers. We have designed a structured P2P protocol for LANs that maintains a complete and consistent view of membership information at all peers. P2P Web caches achieve single hop routing and a better balanced load distribution using this scheme. Complete and consistent view of membership information enabled a single-hop lookup and a flexible load assignment.