Search Results for author: Mingyu Guo

Found 17 papers, 3 papers with code

Optimizing Cyber Response Time on Temporal Active Directory Networks Using Decoys

no code implementations27 Mar 2024 Huy Q. Ngo, Mingyu Guo, Hung Nguyen

We proposed a novel metric called response time, to measure the effectiveness of our decoy placement in temporal attack graphs.

Symmetry-Breaking Augmentations for Ad Hoc Teamwork

no code implementations15 Feb 2024 Ravi Hammond, Dustin Craggs, Mingyu Guo, Jakob Foerster, Ian Reid

In many collaborative settings, artificial intelligence (AI) agents must be able to adapt to new teammates that use unknown or previously unobserved strategies.

Evolutionary Multi-Objective Diversity Optimization

no code implementations15 Jan 2024 Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann

Creating diverse sets of high quality solutions has become an important problem in recent years.

Catch Me if You Can: Effective Honeypot Placement in Dynamic AD Attack Graphs

no code implementations28 Dec 2023 Huy Quang Ngo, Mingyu Guo, Hung Nguyen

To solve the dynamic graph problem, we re-design the mixed-integer programming formulation by combining m MIP (dyMIP(m)) instances to produce a near-optimal blocking plan.

Blocking

METAL: Metamorphic Testing Framework for Analyzing Large-Language Model Qualities

no code implementations11 Dec 2023 Sangwon Hyun, Mingyu Guo, M. Ali Babar

Through the experiments conducted with three prominent LLMs, we have confirmed that the METAL framework effectively evaluates essential QAs on primary LLM tasks and reveals the quality risks in LLMs.

Fairness Language Modelling +1

On the Financial Consequences of Simplified Battery Sizing Models without Considering Operational Details

1 code implementation3 Oct 2023 Nam Trong Dinh, Sahand Karimi-Arpanahi, S. Ali Pourmousavi, Mingyu Guo, Julian Lemos-Vinasco, Jon A. R. Liisberg

In this paper, we compare the most common existing sizing methods in the literature with a battery sizing model that incorporates the practical operation of a battery, that is, receding horizon operation.

Limited Query Graph Connectivity Test

no code implementations25 Feb 2023 Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen

Given a source s and a destination t, we aim to test s-t connectivity by identifying either a path (consisting of only On edges) or a cut (consisting of only Off edges).

Reinforcement Learning (RL)

Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem

1 code implementation25 Jan 2022 Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann

In this work, we consider the problem of finding a set of tours to a traveling salesperson problem (TSP) instance maximizing diversity, while satisfying a given cost constraint.

Dependency Structure for News Document Summarization

no code implementations23 Sep 2021 Congbo Ma, Wei Emma Zhang, Hu Wang, Shubham Gupta, Mingyu Guo

In this work, we develop a neural network based model which leverages dependency parsing to capture cross-positional dependencies and grammatical structures.

Dependency Parsing Document Summarization +2

Analysis of Evolutionary Diversity Optimisation for Permutation Problems

no code implementations23 Feb 2021 Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann

This work contributes to this line of research with an investigation on evolutionary diversity optimization for three of the most well-studied permutation problems, namely the Traveling Salesperson Problem (TSP), both symmetric and asymmetric variants, and Quadratic Assignment Problem (QAP).

Multi-document Summarization via Deep Learning Techniques: A Survey

no code implementations10 Nov 2020 Congbo Ma, Wei Emma Zhang, Mingyu Guo, Hu Wang, Quan Z. Sheng

Multi-document summarization (MDS) is an effective tool for information aggregation that generates an informative and concise summary from a cluster of topic-related documents.

Document Summarization Multi-Document Summarization

Cannot find the paper you are looking for? You can Submit a new open access paper.