Guangmo Tong

ORCID: 0000-0003-3247-4019
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Complex Network Analysis Techniques
  • Opinion Dynamics and Social Influence
  • Spam and Phishing Detection
  • Advanced Graph Neural Networks
  • Network Security and Intrusion Detection
  • Mobile Crowdsensing and Crowdsourcing
  • Game Theory and Applications
  • Complexity and Algorithms in Graphs
  • Vehicle Routing Optimization Methods
  • Security in Wireless Sensor Networks
  • Data Management and Algorithms
  • Advanced Graph Theory Research
  • Bayesian Modeling and Causal Inference
  • Real-Time Systems Scheduling
  • Parallel Computing and Optimization Techniques
  • Machine Learning and Algorithms
  • Misinformation and Its Impacts
  • Vehicular Ad Hoc Networks (VANETs)
  • Graph Labeling and Dimension Problems
  • Energy Efficient Wireless Sensor Networks
  • Data Visualization and Analytics
  • graph theory and CDMA systems
  • Optimization and Search Problems
  • Smart Parking Systems Research
  • Computational Geometry and Mesh Generation

University of Delaware
2018-2025

The University of Texas at Dallas
2015-2019

Beijing Institute of Technology
2016

Massachusetts Institute of Technology
2016

Mathematical Sciences Research Institute
2016

Princeton University
2016

University of Minnesota
2016

For the purpose of propagating information and ideas through a social network, seeding strategy aims to find small set seed users that are able maximize spread influence, which is termed as influence maximization problem.Despite large number works have studied this problem, existing strategies limited static networks.In fact, due high speed data transmission population participants, diffusion processes in real-world networks many aspects uncertainness.Unfortunately, shown experiments, such...

10.1109/tnet.2016.2563397 article EN IEEE/ACM Transactions on Networking 2016-05-24

Social networks allow rapid spread of ideas and innovations while negative information can also propagate widely. When a user receives two opposing opinions, they tend to believe the one arrives first. Therefore, once misinformation or rumor is detected, containment method introduce positive cascade competing against rumor. Given budget k, blocking problem asks for k seed users trigger such that number who are not influenced by be maximized. The prior works have shown approximated within...

10.1109/tnse.2017.2783190 article EN IEEE Transactions on Network Science and Engineering 2017-12-13

Social networks allow rapid spread of ideas and innovations while the negative information can also propagate widely. When cascades with different opinions reaching same user, cascade arriving first is most likely to be taken by user. Therefore, once misinformation or rumor detected, a natural containment method introduce positive competing against rumor. Given budget k, blocking problem asks for k seed users trigger such that number who are not influenced maximized. The prior works have...

10.1109/infocom.2017.8056957 article EN IEEE INFOCOM 2022 - IEEE Conference on Computer Communications 2017-05-01

Graphics processing units (GPUs) are being widely used as co-processors in many application domains to accelerate general-purpose workloads that computationally intensive, known GPGPU computing. Real-time multi-tasking support is a critical requirement for emerging computing domains. However, due the asynchronous and non-preemptive nature of GPU processing, environments, tasks with higher priority may be blocked by lower lengthy duration. This severely harms system's timing predictability...

10.1109/rtas.2015.7108420 article EN 2015-04-01

Misinformation and rumor can spread rapidly widely through online social networks therefore controlling has become a critical issue. It is assumed in the existing works that there single authority whose goal to minimize of by generating positive cascade. In this paper, we study more realistic scenario when multiple cascades generated different agents. For multiple-cascade diffusion, propose peer-to-peer independent cascade model for private communications. The main contribution paper an...

10.1109/tcss.2018.2818661 article EN IEEE Transactions on Computational Social Systems 2018-04-10

Set function learning has emerged as a crucial area in machine learning, addressing the challenge of modeling functions that take sets inputs. Unlike traditional involves fixed-size input vectors where order features matters, set demands methods are invariant to permutations set, presenting unique and complex problem. This survey provides comprehensive overview current development covering foundational theories, key methodologies, diverse applications. We categorize discuss existing...

10.48550/arxiv.2501.14991 preprint EN arXiv (Cornell University) 2025-01-24

The well-known influence maximization problem (IM) aims at maximizing the of one information cascade in a social network by selecting appropriate seed users prior to diffusion process. In its adaptive version, additional can be selected after observing certain results. On other hand, computing tasks are often time-critical, and therefore, only resulted early period is worthwhile, which naturally modeled enforcing time constraint. this article, we present an analysis time-constrained IM...

10.1109/tcss.2020.3032616 article EN publisher-specific-oa IEEE Transactions on Computational Social Systems 2020-10-30

Hypergraph neural networks have been promising tools for handling learning tasks involving higher-order data, with notable applications in web graphs, such as modeling multi-way hyperlink structures and complex user interactions. Yet, their generalization abilities theory are less clear to us. In this paper, we seek develop margin-based bounds four representative classes of hypergraph networks, including convolutional-based methods (UniGCN), set-based aggregation (AllDeepSets), invariant...

10.48550/arxiv.2501.12554 preprint EN arXiv (Cornell University) 2025-01-21

This paper discusses challenges in computer systems research posed by the emerging autonomous driving systems. We first identify four areas related to systems: real-time and embedded systems, machine learning, edge computing, cloud computing. Next, we sketch two fatal accidents caused active driving, uses them indicate key missing capabilities from today's In light of these shortcomings, describe a vision digital circumstances for vehicles refer as "clients" this circumstance. Then propose...

10.1109/metrocad48866.2020.00010 article EN 2020-02-01

An echo chamber effect describes the situation in which opinions are amplified by communication and repetition inside a relatively closed social system. In this article, we will detect real-world data set measure during information diffusion process. Any user be influenced its neighbors or effect. Also, assume that these activation events from each activated neighbor independent. model for first time. Then, influence maximization with (IMEC) problem aims to select <inline-formula...

10.1109/tcss.2021.3073064 article EN IEEE Transactions on Computational Social Systems 2021-04-29

Device-free indoor localization may play a critical role in improving passengers' safety large vessels, particularly for scenarios without equipped radios. However, due to dynamic internal and external influences from the sailing ship such as changing speed, existing systems suffer huge accuracy degradation mobile environment. The challenges are mainly rich arbitrary motions resulting complicated impacts on wireless channels. To address challenges, this article, we first propose motion...

10.1109/jiot.2020.3004240 article EN IEEE Internet of Things Journal 2020-06-22

The device-free localization of individuals not equipped with a radio device plays critical role in cruise ships, particularly during an emergency. In this paper, we introduce scheme requiring low human effort, i.e., DiFS, which utilizes onboard off-the-shelf WiFi infrastructure. An intuitive idea <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">DiFS</i> is that because the channel state information (CSI) sensitive to target location within...

10.1109/jsen.2024.3392913 article EN IEEE Sensors Journal 2024-04-30

Online misinformation has been considered as one of the top global risks it may cause serious consequences such economic damages and public panic. The prevention problem aims at generating a positive cascade with appropriate seed nodes in order to compete against misinformation. In this paper, we study under prominent independent model. Due #P-hardness computing influence, core is design effective sampling methods estimate function value. main contribution paper novel method. Different from...

10.1109/infocom.2019.8737485 preprint EN IEEE INFOCOM 2022 - IEEE Conference on Computer Communications 2019-04-01

The widespread online misinformation could cause public panic and serious economic damages. containment problem aims at limiting the spread of in social networks by launching competing campaigns. Motivated realistic scenarios, we present first analysis for case when an arbitrary number cascades are allowed. This paper makes four contributions. First, provide a formal model multi-cascade diffusion introduce important concept called as cascade priority. Second, show that cannot be approximated...

10.48550/arxiv.1809.06486 preprint EN other-oa arXiv (Cornell University) 2018-01-01

Uniform heterogeneous multicore architectures are becoming increasingly popular due to their potential of achieving high performance and energy efficiency compared the homogeneous architectures. In such systems, real-time scheduling problem becomes more challenging because processors have different speeds. Prior research on uniform multiprocessor has focused hard where, significant processing capacity may be sacrificed in worst-case ensure that all deadlines met. As meeting is overkill for...

10.1109/tpds.2015.2503278 article EN publisher-specific-oa IEEE Transactions on Parallel and Distributed Systems 2015-11-24

The classic influence maximization problem explores the strategies for deploying cascades such that total is maximized, and it assumes seed nodes initiate are computed prior to diffusion process. In its adaptive version, allowed be launched in an manner after observing certain results. this article, we provide a systematic study on problem, focusing algorithmic analysis of general feedback models. We introduce concept regret ratio characterize key trade-off designing seeding strategies,...

10.1109/tetc.2020.3031057 article EN IEEE Transactions on Emerging Topics in Computing 2020-10-14

Vehicle tracking, a core application to smart city video analytics, is becoming more widely deployed than ever before thanks the increasing number of traffic cameras and recent advances in computer vision machine-learning. Due constraints bandwidth, latency, privacy concerns, tracking tasks are preferable run on edge devices sitting close cameras. However, provisioned with fixed amount computing budget, making them incompetent adapt time-varying imbalanced workloads caused by dynamics. In...

10.1145/3549551 article EN ACM Transactions on Internet of Things 2022-07-19

One model for viral marketing is the positive influence. In this model, an inactive node changed into active if and only at least half of its neighbors are already in state. The influence can be viewed as a special case general threshold which function each has value one certain fraction state, 0 otherwise. This proved to monotonically increasing nonsubmodular any predefined fraction. Therefore, given seed set, number influenced nodes not submodular with respect size set. fact makes those...

10.1109/infocom.2017.8057070 article EN IEEE INFOCOM 2022 - IEEE Conference on Computer Communications 2017-05-01

Online social systems have become important platforms for viral marketing where the advertising of products is carried out with communication users. After adopting product, seed buyers may spread information to their friends via online messages e.g. posts and tweets. In another issue, electronic coupon system one relevant promotion vehicles that help manufacturers retailers attract more potential customers. By offering coupons buyers, there a chance convince influential users who are,...

10.48550/arxiv.1802.06946 preprint EN other-oa arXiv (Cornell University) 2018-01-01

Influence maximization is a prototypical problem enabling applications in various domains, and it has been extensively studied the past decade. The classic influence explores strategies for deploying seed users before start of diffusion process such that total can be maximized. In its adaptive version, nodes are allowed to launched an manner after observing certain results. this paper, we provide systematic study on problem, focusing algorithmic analysis scenarios when not submodular. We...

10.48550/arxiv.1902.00192 preprint EN other-oa arXiv (Cornell University) 2019-01-01

Given a combinatorial optimization problem taking an input, can we learn strategy to solve it from the examples of input-solution pairs without knowing its objective function? In this paper, consider such setting and study misinformation prevention problem. attacker-protector pairs, our goal is compute protectors against future attackers, need underlying diffusion model. To end, design structured prediction framework, where main idea parameterize scoring function using random features...

10.48550/arxiv.2009.14337 preprint EN other-oa arXiv (Cornell University) 2020-01-01

Community detection aims to reveal the community structure in a social network, which is one of fundamental problems. In this paper we investigate problem based on concept terminal set. A set group users within any two belong different communities. Although hard general, can be very helpful designing effective algorithms. We first present 2-approximation algorithm running polynomial time for original problem. other issue, order better support real applications further consider case when...

10.1109/infocom.2016.7524473 article EN 2016-04-01
Coming Soon ...