Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2024
Exploring Generative Adversarial Networks for Augmenting Network Intrusion Detection Tasks
- research-articleAugust 2024
NetDiff: A Service-Guided Hierarchical Diffusion Model for Network Flow Trace Generation
Proceedings of the ACM on Networking (PACMNET), Volume 2, Issue CoNEXT3Article No.: 16, Pages 1–21https://doi.org/10.1145/3676870Network flow traces are fundamental to many network management workflows. In this paper, we aim to generate high-fidelity network flow traces by explicitly modeling users' dynamic network usage intents. We propose NetDiff, a service-guided hierarchical ...
- research-articleFebruary 2024
Stale Profile Matching
CC 2024: Proceedings of the 33rd ACM SIGPLAN International Conference on Compiler ConstructionPages 162–173https://doi.org/10.1145/3640537.3641573Profile-guided optimizations rely on profile data for directing compilers to generate optimized code. To achieve the maximum performance boost, profile data needs to be collected on the same version of the binary that is being optimized. In practice ...
- research-articleSeptember 2024
Robust and secure file transmission through video streaming using steganography and blockchain
International Journal of Information and Computer Security (IJICS), Volume 24, Issue 3-4Pages 258–283https://doi.org/10.1504/ijics.2024.141610File transfer is always handled by a separate service, sometimes it is a third-party service in videoconferencing. When sending files during a video session, file data flow and video stream are independent of each other. Encryption is a mature method to ...
- research-articleDecember 2023
Dual Bounds from Decision Diagram-Based Route Relaxations: An Application to Truck-Drone Routing
Transportation Science (TRNPS), Volume 58, Issue 1Pages 257–278https://doi.org/10.1287/trsc.2021.0170For vehicle routing problems, strong dual bounds on the optimal value are needed to develop scalable exact algorithms as well as to evaluate the performance of heuristics. In this work, we propose an iterative algorithm to compute dual bounds motivated by ...
-
- research-articleSeptember 2023
Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs
Transportation Science (TRNPS), Volume 57, Issue 5Pages 1252–1275https://doi.org/10.1287/trsc.2022.0073Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSSP) with a large number of scenarios. The main idea behind the Benders decomposition is to solve a large problem by replacing the values of the second-stage ...
- research-articleAugust 2023
Fair Integral Network Flows
Mathematics of Operations Research (MOOR), Volume 48, Issue 3Pages 1393–1422https://doi.org/10.1287/moor.2022.1303A strongly polynomial algorithm is developed for finding an integer-valued feasible st-flow of a given flow amount, which is decreasingly minimal on a specified subset F of edges in the sense that the largest flow value on F is as small as possible; ...
- research-articleJuly 2023
The Impact of Optimized Fleets in Transportation Networks
Transportation Science (TRNPS), Volume 57, Issue 4Pages 1047–1068https://doi.org/10.1287/trsc.2022.1189Connected technologies have engendered a paradigm shift in mobility systems by enabling digital platforms to coordinate large sets of vehicles in real time. Recent research has investigated how a small number of connected vehicles may be coordinated to ...
- research-articleJune 2023
SOAER: Self-Obstacle Avoiding Escape Routing for Paper-Based Digital Microfluidic Biochips
GLSVLSI '23: Proceedings of the Great Lakes Symposium on VLSI 2023Pages 255–260https://doi.org/10.1145/3583781.3590229In paper-based digital microfluidic biochips (P-DMFBs), conductive electrodes and control lines are printed on the same side of the photo paper, which introduces a critical design challenge on the so-called control interference issue. This introduces a ...
- research-articleMay 2023
Anonymous Multi-Agent Path Finding with Individual Deadlines
AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent SystemsPages 869–877Anonymous Multi-Agent Path Finding (AMAPF) is the problem of planning conflict-free paths to a set of target locations for a group of agents, where each agent is not associated with a specific target. This paper studies AMAPF with Individual Deadlines (...
- research-articleApril 2023
Match4Match: Enhancing Text-Video Retrieval by Maximum Flow with Minimum Cost
WWW '23: Proceedings of the ACM Web Conference 2023Pages 3257–3267https://doi.org/10.1145/3543507.3583365With the explosive growth of video and text data on the web, text-video retrieval has become a vital task for online video platforms. Recently, text-video retrieval methods based on pre-trained models have attracted a lot of attention. However, existing ...
- research-articleApril 2023
Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and the Value of Dynamic Pricing
Operations Research (OPRH), Volume 72, Issue 5Pages 2097–2118https://doi.org/10.1287/opre.2022.2425In “Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and The Value of Dynamic Pricing,” Chen, Lei, and Jasin consider a dynamic pricing problem faced by a ride-hailing service provider who manages a ...
Motivated by the growth of ride-hailing services in urban areas, we study a (tactical) real-time spatial–intertemporal dynamic pricing problem where a firm uses a pool of homogeneous servers (e.g., a fleet of taxis) to serve price-sensitive customers (...
- research-articleFebruary 2023
The Green Scheduling Architecture for the Virtual Resource Supply
Automatic Control and Computer Sciences (ACCS), Volume 57, Issue 1Pages 14–26https://doi.org/10.3103/S0146411623010108AbstractThe data center is a large cluster system. The IT clusters provide users with various services and resources, which make decentralized energy consumption over the past come together, resulting in great energy consumption of the data center. ...
- research-articleJanuary 2023
HyDroid: android malware detection using network flow combined with permissions and intent filter
International Journal of Mobile Communications (IJMC), Volume 22, Issue 1Pages 70–91https://doi.org/10.1504/ijmc.2023.131799Android has become one of the most widely used operating systems for mobile platforms in the recent years. With its widespread adoption, it has also became the target of malicious applications' developers and cyber threats. This in turn has stimulated ...
- research-articleSeptember 2022
An Optimal Control Framework for Online Job Scheduling with General Cost Functions
Operations Research (OPRH), Volume 70, Issue 5Pages 2674–2701https://doi.org/10.1287/opre.2022.2321The paper “An Optimal Control Framework for Online Job Scheduling with General Cost Functions,” by Etesami devises online speed-augmented competitive algorithms for minimizing the generalized completion time on a single and multiple unrelated machines for ...
We consider the problem of online job scheduling on a single machine or multiple unrelated machines with general job and machine-dependent cost functions. In this model, each job has a processing requirement and arrives with a nonnegative nondecreasing ...
- research-articleJune 2022
Anchored Densest Subgraph
SIGMOD '22: Proceedings of the 2022 International Conference on Management of DataPages 1200–1213https://doi.org/10.1145/3514221.3517890Given a graph, densest subgraph search reports a single subgraph that maximizes the density (i.e., average degree). To diversify the search results without imposing rigid constraints, this paper studies the problem of anchored densest subgraph search (...
- research-articleMarch 2022
An Inverse Optimization Approach to Measuring Clinical Pathway Concordance
- Timothy C. Y. Chan,
- Maria Eberg,
- Katharina Forster,
- Claire Holloway,
- Luciano Ieraci,
- Yusuf Shalaby,
- Nasrin Yousefi
Management Science (MANS), Volume 68, Issue 3Pages 1882–1903https://doi.org/10.1287/mnsc.2021.4100Clinical pathways outline standardized processes in the delivery of care for a specific disease. Patient journeys through the healthcare system, however, can deviate substantially from these pathways. Given the positive benefits of clinical pathways, it ...
- research-articleJanuary 2022
On the complexity of approximating multimarginal optimal transport
The Journal of Machine Learning Research (JMLR), Volume 23, Issue 1Article No.: 65, Pages 2835–2877We study the complexity of approximating the multimarginal optimal transport (MOT) distance, a generalization of the classical optimal transport distance, considered here between m discrete probability distributions supported each on n support points. ...
- research-articleJanuary 2022
Detecting botnet using traffic behaviour analysis and extraction of effective flow features
International Journal of Internet Technology and Secured Transactions (IJITST), Volume 12, Issue 1Pages 49–60https://doi.org/10.1504/ijitst.2022.119672Botnets is one of the most serious attacks that cause irreversible damage to systems and networks, and it is important to detect and prevent botnets as attacks using them are constantly occurring. In the paper, the botnet detection method proposed so far ...