Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8555)
- Computer Sciences (8538)
- Databases and Information Systems (3453)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1071)
- Numerical Analysis and Scientific Computing (1025)
- Graphics and Human Computer Interfaces (932)
- Engineering (888)
- Social and Behavioral Sciences (681)
- Business (642)
- Theory and Algorithms (493)
- Computer Engineering (451)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (324)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (181)
- Education (170)
- Management Information Systems (167)
- Data Storage Systems (162)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (110)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (122)
- Social media (74)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Privacy (65)
- Data mining (64)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (54)
- Visualization (51)
- Task analysis (50)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Anomaly detection (47)
- Feature extraction (46)
- Twitter (46)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 2161 - 2190 of 8596
Full-Text Articles in Entire DC Network
Secure Hierarchical Deterministic Wallet Supporting Stealth Address, Xin Yin, Zhen Liu, Guomin Yang, Guoxing Chen, Haojin Zhu
Secure Hierarchical Deterministic Wallet Supporting Stealth Address, Xin Yin, Zhen Liu, Guomin Yang, Guoxing Chen, Haojin Zhu
Research Collection School Of Computing and Information Systems
Over the past decade, cryptocurrency has been undergoing a rapid development. Digital wallet, as the tool to store and manage the cryptographic keys, is the primary entrance for the public to access cryptocurrency assets. Hierarchical Deterministic Wallet (HDW), proposed in Bitcoin Improvement Proposal 32 (BIP32), has attracted much attention and been widely used in the community, due to its virtues such as easy backup/recovery, convenient cold-address management, and supporting trust-less audits and applications in hierarchical organizations. While HDW allows the wallet owner to generate and manage his keys conveniently, Stealth Address (SA) allows a payer to generate fresh address (i.e., …
Deep Learning For Coverage-Guided Fuzzing: How Far Are We?, Siqi Li, Xiaofei Xie, Yun Lin, Yuekang Li, Ruitao Feng, Xiaohong Li, Weimin Ge, Jin Song Dong
Deep Learning For Coverage-Guided Fuzzing: How Far Are We?, Siqi Li, Xiaofei Xie, Yun Lin, Yuekang Li, Ruitao Feng, Xiaohong Li, Weimin Ge, Jin Song Dong
Research Collection School Of Computing and Information Systems
Fuzzing is a widely-used software vulnerability discovery technology, many of which are optimized using coverage-feedback. Recently, some techniques propose to train deep learning (DL) models to predict the branch coverage of an arbitrary input owing to its always-available gradients etc. as a guide. Those techniques have proved their success in improving coverage and discovering bugs under different experimental settings. However, DL models, usually as a magic black-box, are notoriously lack of explanation. Moreover, their performance can be sensitive to the collected runtime coverage information for training, indicating potentially unstable performance. In this work, we conduct a systematic empirical study on …
Contrastive Transformer-Based Multiple Instance Learning For Weakly Supervised Polyp Frame Detection, Tian Yu, Guansong Pang, Fengbei Liu, Yuyuan Liu, Chong Wang, Yuanhong Chen, Johan Verjans, Gustavo Carneiro
Contrastive Transformer-Based Multiple Instance Learning For Weakly Supervised Polyp Frame Detection, Tian Yu, Guansong Pang, Fengbei Liu, Yuyuan Liu, Chong Wang, Yuanhong Chen, Johan Verjans, Gustavo Carneiro
Research Collection School Of Computing and Information Systems
Current polyp detection methods from colonoscopy videos use exclusively normal (i.e., healthy) training images, which i) ignore the importance of temporal information in consecutive video frames, and ii) lack knowledge about the polyps. Consequently, they often have high detection errors, especially on challenging polyp cases (e.g., small, flat, or partially visible polyps). In this work, we formulate polyp detection as a weakly-supervised anomaly detection task that uses video-level labelled training data to detect frame-level polyps. In particular, we propose a novel convolutional transformer-based multiple instance learning method designed to identify abnormal frames (i.e., frames with polyps) from anomalous videos (i.e., …
Joint Hyperbolic And Euclidean Geometry Contrastive Graph Neural Networks, Xiaoyu Xu, Guansong Pang, Di Wu, Mingsheng Shang
Joint Hyperbolic And Euclidean Geometry Contrastive Graph Neural Networks, Xiaoyu Xu, Guansong Pang, Di Wu, Mingsheng Shang
Research Collection School Of Computing and Information Systems
Graph Neural Networks (GNNs) have demonstrated state-of-the-art performance in a wide variety of analytical tasks. Current GNN approaches focus on learning representations in a Euclidean space, which are effective in capturing non-tree-like structural relations, but they fail to model complex relations in many real-world graphs, such as tree-like hierarchical graph structure. This paper instead proposes to learn representations in both Euclidean and hyperbolic spaces to model these two types of graph geometries. To this end, we introduce a novel approach - Joint hyperbolic and Euclidean geometry contrastive graph neural networks (JointGMC). JointGMC is enforced to learn multiple layer-wise optimal combinations …
A Carbon-Aware Planning Framework For Production Scheduling In Mining, Nurual Asyikeen Azhar, Aldy Gunawan, Shih-Fen Cheng, Erwin Leonardi
A Carbon-Aware Planning Framework For Production Scheduling In Mining, Nurual Asyikeen Azhar, Aldy Gunawan, Shih-Fen Cheng, Erwin Leonardi
Research Collection School Of Computing and Information Systems
Managing the flow of excavated materials from a mine pit and the subsequent processing steps is the logistical challenge in mining. Mine planning needs to consider various geometric and resource constraints while maximizing the net present value (NPV) of profits over a long horizon. This mine planning problem has been modelled and solved as a precedence constrained production scheduling problem (PCPSP) using heuristics, due to its NP-hardness. However, the recent push for sustainable and carbon-aware mining practices calls for new planning approaches. In this paper, we propose an efficient temporally decomposed greedy Lagrangian relaxation (TDGLR) approach to maximize profits while …
Eeg-Video Emotion-Based Summarization: Learning With Eeg Auxiliary Signals, Wai-Cheong L. Lew, Di Wang, Kai Keng Ang, Joo-Hwee Lim, Chai Quek, Ah-Hwee Tan
Eeg-Video Emotion-Based Summarization: Learning With Eeg Auxiliary Signals, Wai-Cheong L. Lew, Di Wang, Kai Keng Ang, Joo-Hwee Lim, Chai Quek, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Video summarization is the process of selecting a subset of informative keyframes to expedite storytelling with limited loss of information. In this paper, we propose an EEG-Video Emotion-based Summarization (EVES) model based on a multimodal deep reinforcement learning (DRL) architecture that leverages neural signals to learn visual interestingness to produce quantitatively and qualitatively better video summaries. As such, EVES does not learn from the expensive human annotations but the multimodal signals. Furthermore, to ensure the temporal alignment and minimize the modality gap between the visual and EEG modalities, we introduce a Time Synchronization Module (TSM) that uses an attention mechanism …
Performance Evaluation Of Aggregation-Based Group Recommender Systems For Ephemeral Groups, Edgar Ceh-Varela, Huiping Cao, Hady Wirawan Lauw
Performance Evaluation Of Aggregation-Based Group Recommender Systems For Ephemeral Groups, Edgar Ceh-Varela, Huiping Cao, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Recommender Systems (RecSys) provide suggestions in many decision-making processes. Given that groups of people can perform many real-world activities (e.g., a group of people attending a conference looking for a place to dine), the need for recommendations for groups has increased. A wide range of Group Recommender Systems (GRecSys) has been developed to aggregate individual preferences to group preferences. We analyze 175 studies related to GRecSys. Previous works evaluate their systems using different types of groups (sizes and cohesiveness), and most of such works focus on testing their systems using only one type of item, called Experience Goods (EG). As …
Constrained Multiagent Reinforcement Learning For Large Agent Population, Jiajing Ling, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar
Constrained Multiagent Reinforcement Learning For Large Agent Population, Jiajing Ling, Arambam James Singh, Duc Thien Nguyen, Akshat Kumar
Research Collection School Of Computing and Information Systems
Learning control policies for a large number of agents in a decentralized setting is challenging due to partial observability, uncertainty in the environment, and scalability challenges. While several scalable multiagent RL (MARL) methods have been proposed, relatively few approaches exist for large scale constrained MARL settings. To address this, we first formulate the constrained MARL problem in a collective multiagent setting where interactions among agents are governed by the aggregate count and types of agents, and do not depend on agents’ specific identities. Second, we show that standard Lagrangian relaxation methods, which are popular for single agent RL, do not …
Risk-Aware Procurement Optimization In A Global Technology Supply Chain, Jonathan Chase, Jingfeng Yang, Hoong Chuin Lau
Risk-Aware Procurement Optimization In A Global Technology Supply Chain, Jonathan Chase, Jingfeng Yang, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Supply chain disruption, from ‘Black Swan’ events like the COVID-19 pandemic or the Russian invasion of Ukraine, to more ordinary issues such as labour disputes and adverse weather conditions, can result in delays, missed orders, and financial loss for companies that deliver products globally. Developing a risk-tolerant procurement strategy that anticipates the logistical problems incurred by disruption involves both accurate quantification of risk and cost-effective decision-making. We develop a supplier-focused risk evaluation metric that constrains a procurement optimization model for a global technology company. Our solution offers practical risk tolerance and cost-effectiveness, accounting for a range of constraints that realistically …
Toward Intention Discovery For Early Malice Detection In Bitcoin, Ling Cheng, Feida Zhu, Yong Wang, Huiwen Liu
Toward Intention Discovery For Early Malice Detection In Bitcoin, Ling Cheng, Feida Zhu, Yong Wang, Huiwen Liu
Research Collection School Of Computing and Information Systems
Bitcoin has been subject to illicit activities more often than probably any other financial assets, due to the pseudo-anonymous nature of its transacting entities. An ideal detection model is expected to achieve all the three properties of (I) early detection, (II) good interpretability, and (III) versatility for various illicit activities. However, existing solutions cannot meet all these requirements, as most of them heavily rely on deep learning without satisfying interpretability and are only available for retrospective analysis of a specific illicit type.First, we present asset transfer paths, which aim to describe addresses' early characteristics. Next, with a decision tree based …
Largeea: Aligning Entities For Large-Scale Knowledge Graphs, Congcong Ge, Xiaoze Liu, Lu Chen, Yunjun Gao, Baihua Zheng
Largeea: Aligning Entities For Large-Scale Knowledge Graphs, Congcong Ge, Xiaoze Liu, Lu Chen, Yunjun Gao, Baihua Zheng
Research Collection School Of Computing and Information Systems
Entity alignment (EA) aims to find equivalent entities in different knowledge graphs (KGs). Current EA approaches suffer from scalability issues, limiting their usage in real-world EA scenarios. To tackle this challenge, we propose LargeEA to align entities between large-scale KGs. LargeEA consists of two channels, i.e., structure channel and name channel. For the structure channel, we present METIS-CPS, a memory-saving mini-batch generation strategy, to partition large KGs into smaller mini-batches. LargeEA, designed as a general tool, can adopt any existing EA approach to learn entities’ structural features within each mini-batch independently. For the name channel, we first introduce NFF, a …
Fine-Grained And Controllably Editable Data Sharing With Accountability In Cloud Storage, Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
Fine-Grained And Controllably Editable Data Sharing With Accountability In Cloud Storage, Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
Research Collection School Of Computing and Information Systems
With the increasing cloud storage service, users can enjoy non-interactive data sharing. Nonetheless, the data owner cannot timely update the shared data all the while. To ensure the timeliness and the authoritative source of the data, some users should be allowed to update the data on behalf of an authoritative data owner without changing data source. However, this allows harmful information to be injected into the data unnoticeably. How to efficiently realize editable cloud-based data sharing supporting malicious user tracing has not been fully explored. To address the problem, we propose a fine-grained and controllably editable cloud-based data sharing scheme …
A Traitor-Resistant And Dynamic Anonymous Communication Service For Cloud-Based Vanets, Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
A Traitor-Resistant And Dynamic Anonymous Communication Service For Cloud-Based Vanets, Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Cloud-based VANETs are designed to enable communication between high-speed vehicles. In such a highly dynamic environment, how to provide secure and anonymous communication service is a challenge. In this article, we affirmatively address the challenge by proposing a traitor-resistant and dynamic anonymous communication framework (TD-ACF) for cloud-based VANETs, which supports several advantageous features. In TD-ACF, each vehicle is represented by a set of attributes instead of its real identity, and the driving data is transmitted in encrypted form. Therefore, the anonymous authentication and the confidentiality of driving data are achieved in this way. Meanwhile, TD-ACF supports two practical requirements in …
Val: Volume And Access Pattern Leakage-Abuse Attack With Leaked Documents, Steven Lambregts, Huanhuan Chen, Jianting Ning, Kaitai Liang
Val: Volume And Access Pattern Leakage-Abuse Attack With Leaked Documents, Steven Lambregts, Huanhuan Chen, Jianting Ning, Kaitai Liang
Research Collection School Of Computing and Information Systems
Searchable Encryption schemes provide secure search over encrypted databases while allowing admitted information leakages. Generally, the leakages can be categorized into access and volume pattern. In most existing SE schemes, these leakages are caused by practical designs but are considered an acceptable price to achieve high search efficiency. Recent attacks have shown that such leakages could be easily exploited to retrieve the underlying keywords for search queries. Under the umbrella of attacking SE, we design a new Volume and Access Pattern Leakage-Abuse Attack (VAL-Attack) that improves the matching technique of LEAP (CCS ’21) and exploits both the access and volume …
Exploiting Reuse For Gpu Subgraph Enumeration, Wentiao Guo, Yuchen Li, Kian-Lee Tan
Exploiting Reuse For Gpu Subgraph Enumeration, Wentiao Guo, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Subgraph enumeration is important for many applications such as network motif discovery, community detection, and frequent subgraph mining. To accelerate the execution, recent works utilize graphics processing units (GPUs) to parallelize subgraph enumeration. The performances of these parallel schemes are dominated by the set intersection operations which account for up to $95\%$ of the total processing time. (Un)surprisingly, a significant portion (as high as $99\%$) of these operations is actually redundant, i.e., the same set of vertices is repeatedly encountered and evaluated. Therefore, in this paper, we seek to salvage and recycle the results of such operations to avoid repeated …
Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Cross-dockingis a useful concept used by many companies to control the product flow. It enables the transshipment process of products from suppliers to customers. This research thus extends the benefit of cross-docking with reverse logistics, since return process management has become an important field in various businesses. The vehicle routing problem in a distribution network is considered to be an integrated model, namely the vehicle routing problem with reverse cross-docking (VRP-RCD). This study develops a mathematical model to minimize the costs of moving products in a four-level supply chain network that involves suppliers, cross-dock, customers, and outlets. A matheuristic based …
Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham
Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Restless Multi-Armed Bandits (RMAB) is an apt model to represent decision-making problems in public health interventions (e.g., tuberculosis, maternal, and child care), anti-poaching planning, sensor monitoring, personalized recommendations and many more. Existing research in RMAB has contributed mechanisms and theoretical results to a wide variety of settings, where the focus is on maximizing expected value. In this paper, we are interested in ensuring that RMAB decision making is also fair to different arms while maximizing expected value. In the context of public health settings, this would ensure that different people and/or communities are fairly represented while making public health intervention …
Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study the maximum capture problem in facility location under random utility models, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured user demand is maximized, assuming that each customer chooses among all available facilities according to a random utility maximization model. We employ the generalized extreme value (GEV) family of discrete choice models and show that the objective function in this context is monotonic and submodular. This finding implies that a simple greedy heuristic can always guarantee a (1−1/e) approximation solution. We further develop a new algorithm combining a greedy heuristic, …
Holistic Combination Of Structural And Textual Code Information For Context Based Api Recommendation, Chi Chen, Xin Peng, Zhengchang Xing, Jun Sun, Xin Wang, Yifan Zhao, Wenyun Zhao
Holistic Combination Of Structural And Textual Code Information For Context Based Api Recommendation, Chi Chen, Xin Peng, Zhengchang Xing, Jun Sun, Xin Wang, Yifan Zhao, Wenyun Zhao
Research Collection School Of Computing and Information Systems
Context based API recommendation is an important way to help developers find the needed APIs effectively and efficiently. For effective API recommendation, we need not only a joint view of both structural and textual code information, but also a holistic view of correlated API usage in control and data flow graph as a whole. Unfortunately, existing API recommendation methods exploit structural or textual code information separately. In this work, we propose a novel API recommendation approach called APIRec-CST (API Recommendation by Combining Structural and Textual code information). APIRec-CST is a deep learning model that combines the API usage with the …
Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao
Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Estimating the time of arrival is a crucial task in intelligent transportation systems. Although considerable efforts have been made to solve this problem, most of them decompose a trajectory into several segments and then compute the travel time by integrating the attributes from all segments. The segment view, though being able to depict the local traffic conditions straightforwardly, is insufficient to embody the intrinsic structure of trajectories on the road network. To overcome the limitation, this study proposes multi-view trajectory representation that comprehensively interprets a trajectory from the segment-, link-, and intersection-views. To fulfill the purpose, we design a hierarchical …
Individually Rational Collaborative Vehicle Routing Through Give-And-Take Exchanges, Tran Phong, Paul Tang, Hoong Chuin Lau
Individually Rational Collaborative Vehicle Routing Through Give-And-Take Exchanges, Tran Phong, Paul Tang, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we are concerned with the automated exchange of orders between logistics companies in a marketplace platform to optimize total revenues. We introduce a novel multi-agent approach to this problem, focusing on the Collaborative Vehicle Routing Problem (CVRP) through the lens of individual rationality. Our proposed algorithm applies the principles of Vehicle Routing Problem (VRP) to pairs of vehicles from different logistics companies, optimizing the overall routes while considering standard VRP constraints plus individual rationality constraints. By facilitating cooperation among competing logistics agents through a Give-and-Take approach, we show that it is possible to reduce travel distance and …
Simple And Optimal Stochastic Gradient Methods For Nonsmooth Nonconvex Optimization, Zhize Li, Jian Li
Simple And Optimal Stochastic Gradient Methods For Nonsmooth Nonconvex Optimization, Zhize Li, Jian Li
Research Collection School Of Computing and Information Systems
We propose and analyze several stochastic gradient algorithms for finding stationary points or local minimum in nonconvex, possibly with nonsmooth regularizer, finite-sum and online optimization problems. First, we propose a simple proximal stochastic gradient algorithm based on variance reduction called ProxSVRG+. We provide a clean and tight analysis of ProxSVRG+, which shows that it outperforms the deterministic proximal gradient descent (ProxGD) for a wide range of minibatch sizes, hence solves an open problem proposed in Reddi et al. (2016b). Also, ProxSVRG+ uses much less proximal oracle calls than ProxSVRG (Reddi et al., 2016b) and extends to the online setting by …
Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng
Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng
Research Collection School Of Computing and Information Systems
With widespread deployment of GPS devices, massive spatiotemporal trajectories became more accessible. This booming trend paved the solid data ground for researchers to discover the regularities or patterns of human mobility. However, there are still three challenges in semantic pattern extraction including semantic absence, semantic bias and semantic complexity. In this paper, we invent and apply a novel data structure namely City Semantic Diagram to overcome above three challenges. First, our approach resolves semantic absence by exactly identifying semantic behaviours from raw trajectories. Second, the delicate design of semantic purification helps us to detect semantic complexity from human mobility. Third, …
Developing Gamification Research In Information Systems, De Liu, Richard Landers, Paul Lowry, Fiona Fui-Hoon Nah, Radhika Santhanam
Developing Gamification Research In Information Systems, De Liu, Richard Landers, Paul Lowry, Fiona Fui-Hoon Nah, Radhika Santhanam
Research Collection School Of Computing and Information Systems
Gamification, an umbrella term for incorporating game design elements into non-game systems to make them more engaging and productive, is of interest to Information System (IS) communities, because it has wide applications, such as, gamification designs for workplace, learning and health apps, social media, online communities, and the gig economy. As a multidisciplinary research domain, gamification integrates elements of technology, human motivation, task design, human-computer-interface design, and algorithms/AI design, and is a fertile ground for IS researchers with a variety of different background. There are many challenges in conducting gamification research, including how to get started in this highly multidisciplinary …
Aligning Dual Disentangled User Representations From Ratings And Textual Content, Nhu Thuat Tran, Hady Wirawan Lauw
Aligning Dual Disentangled User Representations From Ratings And Textual Content, Nhu Thuat Tran, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Classical recommendation methods typically render user representation as a single vector in latent space. Oftentimes, a user's interactions with items are influenced by several hidden factors. To better uncover these hidden factors, we seek disentangled representations. Existing disentanglement methods for recommendations are mainly concerned with user-item interactions alone. To further improve not only the effectiveness of recommendations but also the interpretability of the representations, we propose to learn a second set of disentangled user representations from textual content and to align the two sets of representations with one another. The purpose of this coupling is two-fold. For one benefit, we …
Variational Graph Author Topic Modeling, Ce Zhang, Hady Wirawan Lauw
Variational Graph Author Topic Modeling, Ce Zhang, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
While Variational Graph Auto-Encoder (VGAE) has presented promising ability to learn representations for documents, most existing VGAE methods do not model a latent topic structure and therefore lack semantic interpretability. Exploring hidden topics within documents and discovering key words associated with each topic allow us to develop a semantic interpretation of the corpus. Moreover, documents are usually associated with authors. For example, news reports have journalists specializing in writing certain type of events, academic papers have authors with expertise in certain research topics, etc. Modeling authorship information could benefit topic modeling, since documents by the same authors tend to reveal …
Verifying Neural Networks Against Backdoor Attacks, Long Hong Pham, Jun Sun
Verifying Neural Networks Against Backdoor Attacks, Long Hong Pham, Jun Sun
Research Collection School Of Computing and Information Systems
Neural networks have achieved state-of-the-art performance in solving many problems, including many applications in safety/security-critical systems. Researchers also discovered multiple security issues associated with neural networks. One of them is backdoor attacks, i.e., a neural network may be embedded with a backdoor such that a target output is almost always generated in the presence of a trigger. Existing defense approaches mostly focus on detecting whether a neural network is ‘backdoored’ based on heuristics, e.g., activation patterns. To the best of our knowledge, the only line of work which certifies the absence of backdoor is based on randomized smoothing, which is …
Sound And Complete Certificates For Quantitative Termination Analysis Of Probabilistic Programs, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic
Sound And Complete Certificates For Quantitative Termination Analysis Of Probabilistic Programs, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic
Research Collection School Of Computing and Information Systems
We consider the quantitative problem of obtaining lower-bounds on the probability of termination of a given non-deterministic probabilistic program. Specifically, given a non-termination threshold p∈[0,1], we aim for certificates proving that the program terminates with probability at least 1−p. The basic idea of our approach is to find a terminating stochastic invariant, i.e. a subset SI of program states such that (i) the probability of the program ever leaving SI is no more than p, and (ii) almost-surely, the program either leaves SI or terminates.While stochastic invariants are already well-known, we provide the first proof that the idea above is …
Resumable Zero-Knowledge For Circuits From Symmetric Key Primitives, Handong Zhang, Puwen Wei, Haiyang Xue, Yi Deng, Jinsong Li, Wei Wang, Guoxiao Liu
Resumable Zero-Knowledge For Circuits From Symmetric Key Primitives, Handong Zhang, Puwen Wei, Haiyang Xue, Yi Deng, Jinsong Li, Wei Wang, Guoxiao Liu
Research Collection School Of Computing and Information Systems
Consider the scenario that the prover and the verifier perform the zero-knowledge (ZK) proof protocol for the same statement multiple times sequentially, where each proof is modeled as a session. We focus on the problem of how to resume a ZK proof efficiently in such scenario. We introduce a new primitive called resumable honest verifier zero-knowledge proof of knowledge (resumable HVZKPoK) and propose a general construction of the resumable HVZKPoK for circuits based on the “MPC-in-the-head" paradigm, where the complexity of the resumed session is less than that of the original ZK proofs. To ensure the knowledge soundness for the …
Artificial Intelligence In Financial Technology, Keng Siau, Fiona Fui-Hoon Nah, Brenda L. Eschenbrenner, Langtao Chen
Artificial Intelligence In Financial Technology, Keng Siau, Fiona Fui-Hoon Nah, Brenda L. Eschenbrenner, Langtao Chen
Research Collection School Of Computing and Information Systems
AI applications in health care, communications, and arts have brought about rapid and dramatic advances in these fields. Nevertheless, the rapidly expanding potential of AI in the economy and society has raised a set of challenging issues. The fields of AI and financial technology are not spared. How can artificial intelligence (AI) be utilized in financial technology (fintech)? What will be the impact? What actionable objectives are needed to realize value from AI? This research uses a systematic qualitative research methodology, Value-Focused Thinking, to identify the actionable objectives for deriving value from AI in the fintech industry. The results of …