Computação: Últimas Submissões
Resultados 21-30 de 1734
-
Client-transparent and self-managed MQTT broker federation at the application layer
(2023) [Dissertação]Scalability in messaging systems remains an open topic. Regular solutions present clus terized approaches, which can be very scalable for high-throughput systems but still rely on a unique orchestrator which is a single ... -
DWT in P4 : periodicity detection in the data plane
(2023) [Dissertação]This dissertation presents an extended implementation of the (1-D) Discrete Wavelet Transform (DWT) method in the P4 programming language, enabling efficient and real time analysis of periodic behavior in network traffic. ... -
Strategies for distributing task-based applications on heterogeneous platforms
(2023) [Tese]HPC platforms are vastly heterogeneous because of intra-node resources like accelerators and inter-node heterogeneity when there are different machines. The applications that use these re sources are already very complex, ... -
Automated social engineering attacks using ChatBots on professional social networks
(2023) [Dissertação]The grow of the internet and social networks had intensified online human interactions, raising the risk of cyberattacks. Social Engineering uses the same baseline as scams and fraud, but using technology as a support to ... -
Curios - a web of types
(2023) [Dissertação]Ever since their inception lambda calculus and type theory have been such an influence in the design of modern programming languages so much so that even programming lan guages outside of the functional circle have adopted ... -
Modelling behaviour diffusion with dynamic logic
(2023) [Dissertação]This work is about agents and their adoption of behaviors in a given network. The work has focused on defining models and policies related to the "diffusion of information" not through agent reasoning but through a force ... -
Understanding sample generation strategies for learning heuristic functions in classical planning
(2023) [Dissertação]Heuristic functions are essential in guiding search algorithms to solve planning tasks. We study the problem of learning good heuristic functions for classical planning tasks with neural networks based on samples that are ... -
Discovering and learning preferred operators for classical planning with neural networks
(2023) [Dissertação]In a planning task, an agent must choose the most efficient action from a po tentially large set of actions at each step. During a heuristic search, logic-based planners use preferred operators to reduce the branching ... -
A network centric architecture for military command and control systems
(2023) [Tese]Current multi-domain military operations require flexible and adaptable forces that must be able to work with civilian agencies and coalitions in open terrain and urban scenarios. These challenges require informed decision ... -
Simulação eficiente de cortes em objetos deformáveis baseados em partículas
(2018) [Dissertação]A simulação de cortes em corpos deformáveis tem sido estudada em computação gráfica há mais de duas décadas. Existem muitas soluções satisfatórias, no entanto, muitas de suas aplicações, como a simulação cirúrgica, exigem ...