Logical time management is used to synchronize the executions of distributed simulation elements. In existing time management systems, such as High Level Architecture (HLA), logical times of the simulation elements are synchronized. However, in some cases synchronization can unnecessarily decrease the performance of the system. In the proposed HLA based time management mechanism, federates are clustered into logically related groups. The relevance of federates is taken to be a function of proximity which is defined as the distance between them in the virtual space. Thus, each federate cluster is composed of relatively close federates according to calculated distances. When federate clusters are sufficiently far from each other, there is no need to synchronize them, as they do not relate each other. So in PATiM mechanism, inter-cluster logical times are not synchronized when clusters are sufficiently distant. However, if the distant federate clusters get close to each other, they will need to resynchronize their logical times. This temporal partitioning is aimed at reducing network traffic and time management calculations and also increasing the concurrency between federates. The results obtained based on case applications have verified that clustering improves local performance as soon as federates become unrelated.

В магистерской диссертации «Управление процентными расходами коммерческих банков» представлено введение, три главы, заключение, библиографический список, включающий 59 источников. Работа включает 22 таблицы и 9 рисунков, общий объем – 93 страницы. / The master's thesis "Management of interest expenses of commercial banks" presents an introduction, three chapters, a conclusion, and a bibliographic list including 60 sources. The work includes 22 tables and 9 figures, the total volume is 93 pages.

This thesis focuses on two important problems related to DDDAS: interest management (data distribution) and prediction models. In order to reduce communication overhead, we propose a new interest management mechanism for mobile peer-to-peer systems. This approach involves dividing the entire space into cells and using an efficient sorting algorithm to sort the regions in each cell. A mobile landmarking scheme is introduced to implement this sort-based scheme in mobile peer-to-peer systems. The design does not require a centralized server, but rather, every peer can become a mobile landmark node to take a server-like role to sort and match the regions. Experimental results show that the scheme has better computational efficiency for both static and dynamic matching. In order to improve communication efficiency, we present a travel time prediction model based on boosting, an important machine learning technique, and combine boosting and neural network models to increase prediction accuracy. We also explore the relationship between the accuracy of travel time prediction and the frequency of traffic data collection with the long term goal of minimizing bandwidth consumption. Several different sets of experiments are used to evaluate the effectiveness of this model. The results show that the boosting neural network model outperforms other predictors.

Data distribution management (DDM) is a mechanism to interconnect data producers and data consumers in a distributed application. Data producers provide useful data to consumers in the form of messages. For each message produced, DDM determines the set of data consumers interested in receiving the message and delivers it to those consumers. We are particularly interested in DDM techniques for parallel and distributed discrete event simulations. Thus far, researchers have treated synchronization of events (i.e. time management) and DDM independent of each other. This research focuses on how to realize time managed DDM mechanisms. The main reason for time-managed DDM is to ensure that changes in the routing of messages from producers to consumers occur in a correct sequence. Also time managed DDM avoids non-determinism in the federation execution, which may result in non-repeatable executions. An optimistic approach to time managed DDM is proposed where one allows DDM events to be processed out of time stamp order, but a detection and recovery procedure is used to recover from such errors. These mechanisms are tailored to the semantics of the DDM operations to ensure an efficient realization. A correctness proof is presented to verify the algorithm correctly synchronizes DDM events. We have developed a fully distributed implementation of the algorithm within the framework of the Georgia Tech Federated Simulation Development Kit (FDK) software. A performance evaluation of the synchronized DDM mechanism has been completed in a loosely coupled distributed system consisting of a network of workstations connected over a local area network (LAN). We compare time-managed versus unsynchronized DDM for two applications that exercise different mobility patterns: one based on a military simulation and a second utilizing a synthetic workload. The experiments and analysis illustrate that synchronized DDM performance depends on several factors: the simulations model (e.g. lookahead), applications mobility patterns and the network hardware (e.g. size of network buffers). Under certain mobility patterns, time-managed DDM is as efficient as unsynchronized DDM. There are also mobility patterns where time-managed DDM overheads become significant, and we show how they can be reduced.

The shapes of political pressure and the lobby appear as important tools for the private interestmanagement in the contemporary democracies This article displays a plot of actions of lobby at the Peruvian parliament and the role of building networks at the political arena in which the collision with other interests is avoid Thus, the lobby appears to be effective on issues that are out of the agenda of the public-media debate, issues of high specialization, or those that are not of interest of the party blocs (but represent a huge volume of legislative initiatives) / Las formas de presión política y el lobby aparecen como herramientas importantes para la gestión de intereses privados en las democracias contemporáneas Este artículo muestra una parcela de las acciones del lobby en el parlamento peruano y la función de construcción de redes en una arena política en la que se evita la colisión con otros intereses Así, el lobby aparece con eficacia en los temas que están fuera de la agenda del debate público-mediático, temas de alta especialización, o aquellos que no revisten interés de las bancadas (pero que representan un enorme volumen de iniciativas legislativas) / As formas da pressão política e o lobby aparecem como ferramentas importantes para a gestão dos interesses privados nas democracias contemporâneas Este artigo mostra uma parcela de ações do lobby no parlamento peruano e a função da construção das redes num cenário político, na que evita a colisão com outros interesses Assim, o lobby aparece com eficácia nos temas que estão fora da agenda do debate público midiático, tópicos de maior especialização, ou aqueles que não têm interesse das bancadas (mas representam um volumem muito grande de iniciativas legislativas)

This thesis investigates designing and implementing a peer-to-peer (P2P) networking frameworkfor Unity, a popular game engine, intending to offer a scalable and efficient solution forconstructing networked multiplayer games. The research covers an analysis of a P2P networkarchitecture, transport layer protocols, challenges in NAT traversal, and peer list management.A framework is proposed, incorporating NAT traversal, remote procedural calls (RPC), synchronization variables (SyncVar), interest management (IM), and a lobby system. The framework’sperformance is evaluated through integration, network, and game performance tests. Resultsdemonstrate the framework’s capacity to accommodate up to 50 players, with a theoreticalmaximum of 200 players, but further optimization techniques could increase this limit. IMsolutions are suggested to improve scalability, rendering the framework a more viable optionfor MMOGs. Additionally, this thesis seeks to contribute to comprehending P2P networkingframework design and implementation for Unity while emphasizing potential directions forfuture research and how they should be optimized / Denna uppsats undersöker design och implementering av ett peer-to-peer (P2P) nätverksramverk för Unity, en populär spelmotor, med målet att erbjuda en skalbar och effektiv lösning för att bygga nätverksbaserade flerspelarspel. Uppsatsen omfattar en analys av P2P-nätverksarkitektur, transportlagerprotokoll, utmaningar vid NAT-Travesering och hantering av peerlistor. Ett ramverk som inkluderar NAT-Travesering, fjärrproceduranrop (RPC), synkroniseringsvariabler (SyncVar), Interest Management (IM) och ett lobby-system föreslås. Ramverkets prestanda utvärderas genom integrationstester, nätverksprestandatester och spel-prestandatester. Resultaten visar att ramverket kan hantera upp till 50 spelare, med en teoretisk maximal kapacitet på 200 spelare, men ytterligare optimiserings tekniker kan öka denna gränsen. IM-lösningar föreslås för att förbättra skalbarheten, vilket gör ramverket till ett bättre alternativ för MMOG. Dessutom syftar denna uppsats till att bidra till förståelsen för design och implementering av P2P-nätverksramverk för Unity, samtidigt som den betonar potentiella riktningar för framtida forskning och hur dessa ska kunna optimeras.