Author image not provided
 Thang N. Dinh

 homepage
 tdinhatcise.ufl.edu

  Affiliation history
Bibliometrics: publication history
Average citations per article4.97
Citation Count144
Publication count29
Publication years2009-2017
Available for download17
Average downloads per article286.65
Downloads (cumulative)4,873
Downloads (12 Months)1,014
Downloads (6 Weeks)120
SEARCH
ROLE


SUBJECT AREAS
See all subject areas



BOOKMARK & SHARE


29 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 29
Result page: 1 2

Sort by:

1 published by ACM
October 2017 S3 '17: Proceedings of the 9th ACM Workshop on Wireless of the Students, by the Students, and for the Students
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8,   Downloads (12 Months): 22,   Downloads (Overall): 22

Full text available: PDFPDF
We introduce a lightweight, cost-effective, and portable solution for real-time peripheral oxygen saturation SpO2 measurement using photometric sensing through a smartphone's camera. Specifically, we design a hardware plug-in module that snaps onto the smartphone's flashlight and estimates the blood oxygen content from the light intensity reflected off the user's finger ...
Keywords: optical divider, oxygen saturation

2 published by ACM
August 2017 ACM Transactions on Information Systems (TOIS): Volume 36 Issue 2, September 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 21,   Downloads (12 Months): 104,   Downloads (Overall): 104

Full text available: PDFPDF
Given a social network, the Influence Maximization (InfMax) problem seeks a seed set of k people that maximizes the expected influence for a viral marketing campaign. However, a solution for a particular seed size k is often not enough to make an informed choice regarding budget and cost-effectiveness. In this ...
Keywords: approximation algorithms, Influence maximization, influence spectrum

3
August 2017 IEEE/ACM Transactions on Networking (TON): Volume 25 Issue 4, August 2017
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 15,   Downloads (Overall): 15

Full text available: PDFPDF
Online social networks have been one of the most effective platforms for marketing and advertising. Through the “world-of-mouth” exchanges, so-called viral marketing, the influence and product adoption can spread from few key influencers to billions of users in the network. To identify those key influencers, a great amount of work ...

4 published by ACM
June 2017 Proceedings of the ACM on Measurement and Analysis of Computing Systems: Volume 1 Issue 1, June 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 50,   Downloads (Overall): 50

Full text available: PDFPDF
Estimating cascade size and nodes' influence is a fundamental task in social, technological, and biological networks. Yet this task is extremely challenging due to the sheer size and the structural heterogeneity of networks. We investigate a new influence measure, termed outward influence (OI), defined as the (expected) number of nodes ...
Keywords: approximation algorithms, outward influence, fpras

5 published by ACM
June 2017 SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 53,   Downloads (Overall): 53

Full text available: PDFPDF
Estimating cascade size and nodes' influence is a fundamental task in social, technological, and biological networks. Yet this task is extremely challenging due to the sheer size and the structural heterogeneity of networks. We investigate a new influence measure, termed outward influence (OI), defined as the (expected) number of nodes ...
Keywords: billion-scale networks, outward influence, cascade size estimation
Also published in:
September 2017  ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review: Volume 45 Issue 1, June 2017

6 published by ACM
October 2016 CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 67,   Downloads (Overall): 105

Full text available: PDFPDF
Given an aftermath of a cascade in the network, i.e. a set V I of "infected" nodes after an epidemic outbreak or a propagation of rumors/worms/viruses, how can we infer the sources of the cascade? Answering this challenging question is critical for computer forensic, vulnerability analysis, and risk management. Despite ...
Keywords: infection source identification, approximation algorithm

7 published by ACM
June 2016 WearSys '16: Proceedings of the 2016 Workshop on Wearable Systems and Applications
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 16,   Downloads (12 Months): 193,   Downloads (Overall): 193

Full text available: PDFPDF
In this work, we present a low-cost and light-weight wearable sensing system that can monitor bioelectrical signals generated by electrically active tissues across the brain, the eyes, and the facial muscles from inside human ears. Our work presents two key aspects of the sensing, which include the construction of electrodes ...
Keywords: in-ear wearable, signal separation, sleep staging, biosignal

8 published by ACM
June 2016 SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 39,   Downloads (12 Months): 346,   Downloads (Overall): 638

Full text available: PDFPDF
Influence Maximization (IM), that seeks a small set of key users who spread the influence widely into the network, is a core problem in multiple domains. It finds applications in viral marketing, epidemic control, and assessing cascading failures within complex systems. Despite the huge amount of effort, IM in billion-scale ...
Keywords: influence maximization, sampling, stop-and-stare

9
May 2016 BICT'15: Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)
Publisher: ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 19

Full text available: PDFPDF
Gene regulatory networks (GRNs) possess an important structural property; they are sparse and resilient, with a robust topology that affords protection against random "attacks" (e.g., gene deletions). However, such networks exhibit optimal or near-optimal topological features not present in other scale-free networks. This paper utilizes an integer linear program formulation ...
Keywords: average shortest path, scale-free networks, transcriptional network motif, feed-forward loop

10
January 2016 Theoretical Computer Science: Volume 609 Issue P3, January 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

With the integration of advanced computing and communication technologies, the Smart Grid is expected to greatly enhance efficiency and reliability of future power systems with renewable energy resources, as well as distributed intelligence and demand response. Along with the salient features of the Smart Grid, cyber security emerges to be ...
Keywords: Smart Grids, Approximation algorithms, Malicious attacks detection

11
November 2015 ICDM '15: Proceedings of the 2015 IEEE International Conference on Data Mining (ICDM)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Many social networks and complex systems are found to be naturally divided into clusters of densely connected nodes, known as community structure (CS). Finding CS is one of fundamental yet challenging topics in network science. One of the most popular classes of methods for this problem is to maximize Newman's ...

12
October 2015 Journal of Combinatorial Optimization: Volume 30 Issue 3, October 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We introduce A$$^3$$3CS, an adaptive framework with approximation guarantees for quickly identifying community structure in dynamic networks via maximizing Modularity Q. Our framework explores the advantages of the power-law distribution property found in many real-world complex systems. The framework is scalable for very large networks, and more excitingly, possesses approximation ...
Keywords: Social networks, Adaptive approximation algorithm, Modularity, Community structure

13
June 2015 IEEE/ACM Transactions on Networking (TON): Volume 23 Issue 3, June 2015
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 26,   Downloads (Overall): 74

Full text available: PDFPDF
Critical infrastructures such as communication networks, electrical grids, and transportation systems are highly vulnerable to natural disasters and malicious attacks. Even failures of few nodes or links may have a profound impact on large parts of the system. Traditionally, network vulnerability assessment methods separate the studies of node vulnerability and ...
Keywords: approximation algorithm, joint node and link attacks, vulnerability assessment

14
December 2014 IEEE/ACM Transactions on Networking (TON): Volume 22 Issue 6, December 2014
Publisher: IEEE Press
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 5,   Downloads (12 Months): 47,   Downloads (Overall): 183

Full text available: PDFPDF
Online social networks (OSNs) have become one of the most effective channels for marketing and advertising. Since users are often influenced by their friends, "word-of-mouth" exchanges, so-called viral marketing, in social networks can be used to increase product adoption or widely spread content over the network. The common perception of ...
Keywords: social media, approximation algorithm, hardness proof, power-law networks, influence propagation

15
October 2014 Journal of Combinatorial Optimization: Volume 28 Issue 3, October 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0


16
August 2014 WI-IAT '14: Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 01
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Downloads (Overall): 58

Full text available: PDFPDF
Many complex networks commonly exhibit community structure in their underlying organizations, i.e., They contain multiple groups of nodes having more connections inside a group and less interactions among groups. This special structure not only offers key insights into understanding the network organization principles but also plays a vital role in ...
Keywords: Overlapping Community Structure, Network Vulnerability Assessment

17
July 2014 Journal of Combinatorial Optimization: Volume 28 Issue 1, July 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

As an imperative channel for fast information propagation, online social networks (OSNs) also have their defects. One of them is the information leakage, i.e., information could be spread via OSNs to the users whom we are not willing to share with. Thus the problem of constructing a circle of trust ...
Keywords: Computational complexity, Online social networks, Approximation algorithms, Circle of trust

18
July 2014 Journal of Combinatorial Optimization: Volume 28 Issue 1, July 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

Assessing network systems for failures is critical to mitigate the risk and develop proactive responses. In this paper, we investigate devastating consequences of link failures in networks. We propose an exact algorithm and a spectral lower-bound on the minimum number of removed links to incur a significant level of disruption. ...
Keywords: Integer programming, Spectral bound, Pairwise connectivity, Vulnerability assessment

19
April 2014 Journal of Combinatorial Optimization: Volume 27 Issue 3, April 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 8

In social networks, there is a tendency for connected users to match each other's behaviors. Moreover, a user likely adopts a behavior, if a certain fraction of his family and friends follows that behavior. Identifying people who have the most influential effect to the others is of great advantages, especially ...
Keywords: Information diffusion, Social networks, Hardness of approximation, Approximation algorithm

20
July 2013 ICDCS '13: Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 13

Online social networks (OSNs) provide a new platform for product promotion and advertisement. Influence maximization problem arisen in viral marketing has received a lot of attentions recently. Most of the existing diffusion models rely on one fundamental assumption that an influenced user necessarily adopts the product and encourages his/her friends ...
Keywords: Viral marketing, Opinion, Diffusion Model, Social Networks, Algorithm



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us