Explanipedia

Identification of Key Links in China's Electric Vehicle Industrial Chain Under External Risks:A Multi-Layer Network Synchronization Approach Open

Xiangjun Pei, Hua Li, Ding‐Zhu Du, Zhe Chen · 2025

Bi-level optimization scheduling of electric vehicle-distribution network considering demand response and carbon quota Open

Xiaoliang Chai, Yuanbo Zhang, Ding‐Zhu Du, Yue Sun · 2024

To mitigate the adverse effects of uncoordinated charging of electric vehicles (EVs) on the distribution network (DN) stability, this paper proposes a bi-level cooperative optimization scheduling method for EVs and DNs, considering demand …

Special Issue on Theory and Applications of Models of Computation TAMC 2022 Open

Ding‐Zhu Du, Chenchen Wu, Ruiqi Yang · 2024

An abstract is not available for this content. As you have access to this content, full HTML content is provided on this page. A PDF of this content is also available in through the 'Save PDF' action button.

Two Methods for Regularized Non-Monotone Submodular Maximization Open

Xin Sun, Congying Han, Chenchen Wu, Dachuan Xu, Yang Zhou , et al. · 2024

Cognitive Computing with a Big Data System in a Secure Internet of Things Open

Xiaochun Cheng, Ding‐Zhu Du, Arun Kumar Sangaiah, Rongxing Lu · 2023

This editorial aims to summarize the contents of the ten papers included in the Special Issue entitled “Cognitive Computing with a Big Data System in a Secure Internet of Things” [...]

Multi-Task Diffusion Incentive Design for Mobile Crowdsourcing in Social Networks Open

Jianxiong Guo, Qiufen Ni, Weili Wu, Ding‐Zhu Du · 2023

Mobile Crowdsourcing (MCS) is a novel distributed computing paradigm that recruits skilled workers to perform location-dependent tasks. A number of mature incentive mechanisms have been proposed to address the worker recruitment problem in…

Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems Open

Yaoyao Zhang, Chaojie Zhu, Shaojie Tang, Ringli Ran, Ding‐Zhu Du , et al. · 2022

Theoretical studies on evolutionary algorithms have developed vigorously in recent years. Many such algorithms have theoretical guarantees in both running time and approximation ratio. Some approximation mechanism seems to be inherently em…

Parallel algorithms for maximizing one-sided $σ$-smooth function Open

Hongxiang Zhang, Yukun Cheng, Chenchen Wu, Dachuan Xu, Ding‐Zhu Du · 2022

In this paper, we study the problem of maximizing a monotone normalized one-sided $σ$-smooth ($OSS$ for short) function $F(x)$, subject to a convex polytope. This problem was first introduced by Mehrdad et al. \cite{GSS2021} to characteriz…

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set Open

Chaojie Zhu, Yingli Ran, Zhao Zhang, Ding‐Zhu Du · 2022

A connected dominating set is a widely adopted model for the virtual backbone of a wireless sensor network. In this paper, we design an evolutionary algorithm for the minimum connected dominating set problem (MinCDS), whose performance is …

A Double Auction for Charging Scheduling among Vehicles Using DAG-Blockchains Open

Jianxiong Guo, Xingjian Ding, Weili Wu, Ding‐Zhu Du · 2020

Electric Vehicles (EVs) are becoming more and more popular in our daily life, which replaces traditional fuel vehicles to reduce carbon emissions and protect the environment. EVs need to be charged, but the number of charging piles in a Ch…

Population monotonic allocation schemes for vertex cover games Open

Han Xiao, Qizhi Fang, Ding‐Zhu Du · 2020

Approximation algorithm for the partial set multi-cover problem Open

Yishuo Shi, Yingli Ran, Zhao Zhang, James K. V. Willson, Guangmo Tong , et al. · 2019

Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention Open

Gunagmo Tong, Ding‐Zhu Du · 2019

Online misinformation has been considered as one of the top global risks as it may cause serious consequences such as economic damages and public panic. The misinformation prevention problem aims at generating a positive cascade with appro…

Corrections to “Fractal Intelligent Privacy Protection in Online Social Network Using Attribute-Based Encryption Schemes” Open

Wei Wei, Shuai Liu, Wenjia Li, Ding‐Zhu Du · 2018

In [1] , the financial support information in the first footnote should have read as follows.

Set Function Optimization Open

Weili Wu, Zhao Zhang, Ding‐Zhu Du · 2018

This article is an introduction to recent development of optimization theory on set functions, the nonsubmodular optimization, which contains two interesting results, DS (difference of submodular) functions decomposition and sandwich theor…

An Approximation Algorithm for Active Friending in Online Social Networks Open

Guangmo Tong, Ruiqi Wang, Xiang Li, Weili Wu, Ding‐Zhu Du · 2018

Guiding users to actively expanding their online social circles is one of the primary strategies for enhancing user participation and growing online social networks. In this paper, we study the active friending problem which aims at provid…

On Misinformation Containment in Online Social Networks Open

Guangmo Tong, Weili Wu, Ding‐Zhu Du · 2018

The widespread online misinformation could cause public panic and serious economic damages. The misinformation containment problem aims at limiting the spread of misinformation in online social networks by launching competing campaigns. Mo…

Group testing with geometry of classical groups over finite fields Open

Suogang Gao, Zengti Li, Weili Wu, Pãnos M. Pardalos, Ding‐Zhu Du · 2018

Coupon Advertising in Online Social Systems: Algorithms and Sampling Techniques Open

Guangmo Tong, Weili Wu, Ding‐Zhu Du · 2018

Online social systems have become important platforms for viral marketing where the advertising of products is carried out with the communication of users. After adopting the product, the seed buyers may spread the information to their fri…

On Misinformation Containment in Online Social Networks Open

Amo Tong, Ding‐Zhu Du, Weili Wu · 2018

The widespread online misinformation could cause public panic and serious economic damages. The misinformation containment problem aims at limiting the spread of misinformation in online social networks by launching competing campaigns. Mo…

Distributed Rumor Blocking in Social Networks: A Game Theoretical Analysis. Open

Guangmo Tong, Weili Wu, Ding‐Zhu Du · 2017

Social networks have become important platforms for communication and information exchange. Unfortunately, misinformation and rumor also spread rapidly and widely through online social networks. Therefore, rumor controlling is one of the c…

Distributed Rumor Blocking with Multiple Positive Cascades Open

Guangmo Tong, Weili Wu, Ding‐Zhu Du · 2017

Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. It is often assumed that there is a single authority whose goal is to minimize the spread of…

Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network Open

Jiao Zhou, Zhao Zhang, Shaojie Tang, Xiaohui Huang, Yuchang Mo , et al. · 2017

To save energy and alleviate interferences in a wireless sensor network, the\nusage of virtual backbone was proposed. Because of accidental damages or energy\ndepletion, it is desirable to construct a fault tolerant virtual backbone,\nwhic…

Randomized Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem Open

Yishuo Shi, Zhao Zhang, Ding‐Zhu Du · 2017

This paper studies randomized approximation algorithm for a variant of the set cover problem called minimum submodular cost partial multi-cover (SCPMC), in which each element $e$ has a covering requirement $r_e$ and a profit $p_e$, and the…

Randomized Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. Open

Yishuo Shi, Zhao Zhang, Ding‐Zhu Du · 2017

This paper studies randomized approximation algorithm for a variant of the set cover problem called {\em minimum submodular cost partial multi-cover} (SCPMC). In a \emph{partial set cover problem}, the goal is to find a minimum cost subcol…

On Rivest-Vuillemin Conjecture for Fourteen Variables Open

Guangmo Tong, Weili Wu, Ding‐Zhu Du · 2017

A boolean function $f(x_1,...,x_n)$ is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function $f(x_1,...,x_n)$ is \textit{elusive} if we have to check all $x_1$,..., $x_n$ to …

An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks Open

Guangmo Tong, Weili Wu, Ling Guo, Deying Li, Cong Liu , et al. · 2017

Social networks allow rapid spread of ideas and innovations while the negative information can also propagate widely. When the cascades with different opinions reaching the same user, the cascade arriving first is the most likely to be tak…

Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set Open

Zhao Zhang, Jiao Zhou, Xiaohui Huang, Ding‐Zhu Du · 2016

To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a $(k,m)$-CDS. For a connected graph $G=(V,E)$ and two fixed inte…

Editorial Board EOV Open

Anthony Bonato, Fan Chung Graham, Noga Alon, Albert-László Barabási, Elwyn R. Berlekamp , et al. · 2016

General Vol. 12, Issue 6, 2016October 31, 2016 EDTEditorial Board EOVInternet Mathematics, math • https://doi.org/10.1080/15427951.2016.1217729

Adaptive Influence Maximization in Dynamic Social Networks Open

Guangmo Tong, Weili Wu, Shaojie Tang, Ding‐Zhu Du · 2016

For the purpose of propagating information and ideas through a social\nnetwork, a seeding strategy aims to find a small set of seed users that are\nable to maximize the spread of the influence, which is termed as influence\nmaximization pr…

Ding‐Zhu Du YOU? Author Swipe