Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8549)
- Computer Sciences (8532)
- Databases and Information Systems (3451)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1067)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (956)
- Graphics and Human Computer Interfaces (933)
- Social and Behavioral Sciences (734)
- Business (686)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (186)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Feature extraction (46)
- Collaboration (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 2161 - 2190 of 8722
Full-Text Articles in Entire DC Network
Shell Theory: A Statistical Model Of Reality, Wen-Yan Lin, Siying Liu, Changhao Ren, Ngai-Man Cheung, Hongdong Li, Yasuyuki Matsushita
Shell Theory: A Statistical Model Of Reality, Wen-Yan Lin, Siying Liu, Changhao Ren, Ngai-Man Cheung, Hongdong Li, Yasuyuki Matsushita
Research Collection School Of Computing and Information Systems
Machine learning's grand ambition is the mathematical modeling of reality. The recent years have seen major advances using deep-learned techniques that model reality implicitly; however, corresponding advances in explicit mathematical models have been noticeably lacking. We believe this dichotomy is rooted in the limitations of the current statistical tools, which struggle to make sense of the high dimensional generative processes that natural data seems to originate from. This paper proposes a new, distance based statistical technique which allows us to develop elegant mathematical models of such generative processes. Our model suggests that each semantic concept has an associated distinctive-shell which …
Analyzing The Impact Of Covid-19 Control Policies On Campus Occupancy And Mobility Via Wifi Sensing, Camellia Zakaria, Amee Trivedi, Emmanuel Cecchet, Michael Chee, Prashant Shenoy, Rajesh Krishna Balan
Analyzing The Impact Of Covid-19 Control Policies On Campus Occupancy And Mobility Via Wifi Sensing, Camellia Zakaria, Amee Trivedi, Emmanuel Cecchet, Michael Chee, Prashant Shenoy, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
Mobile sensing has played a key role in providing digital solutions to aid with COVID-19 containment policies, primarily to automate contact tracing and social distancing measures. As more and more countries reopen from lockdowns, there remains a pressing need to minimize crowd movements and interactions, particularly in enclosed spaces. Many COVID-19 technology solutions leverage positioning systems, generally using Bluetooth and GPS, and can theoretically be adapted to monitor safety compliance within dedicated environments. However, they may not be the ideal modalities for indoor positioning. This article conjectures that analyzing user occupancy and mobility via deployed WiFi infrastructure can help institutions …
On The Effectiveness Of Using Graphics Interrupt As A Side Channel For User Behavior Snooping, Haoyu Ma, Jianwen Tian, Debin Gao, Chunfu Jia
On The Effectiveness Of Using Graphics Interrupt As A Side Channel For User Behavior Snooping, Haoyu Ma, Jianwen Tian, Debin Gao, Chunfu Jia
Research Collection School Of Computing and Information Systems
Graphics Processing Units (GPUs) are now a key component of many devices and systems, including those in the cloud and data centers, thus are also subject to side-channel attacks. Existing side-channel attacks on GPUs typically leak information from graphics libraries like OpenGL and CUDA, which require creating contentions within the GPU resource space and are being mitigated with software patches. This paper evaluates potential side channels exposed at a lower-level interface between GPUs and CPUs, namely the graphics interrupts. These signals could indicate unique signatures of GPU workload, allowing a spy process to infer the behavior of other processes. We …
Hierarchical Semantic-Aware Neural Code Representation, Yuan Jiang, Xiaohong Su, Christoph Treude, Tiantian Wang
Hierarchical Semantic-Aware Neural Code Representation, Yuan Jiang, Xiaohong Su, Christoph Treude, Tiantian Wang
Research Collection School Of Computing and Information Systems
Code representation is a fundamental problem in many software engineering tasks. Despite the effort made by many researchers, it is still hard for existing methods to fully extract syntactic, structural and sequential features of source code, which form the hierarchical semantics of the program and are necessary to achieve a deeper code understanding. To alleviate this difficulty, we propose a new supervised approach based on the novel use of Tree-LSTM to incorporate the sequential and the global semantic features of programs explicitly into the representation model. Unlike previous techniques, our proposed model can not only learn low-level syntactic information within …
An Attribute-Aware Attentive Gcn Model For Attribute Missing In Recommendation, Fan Liu, Zhiyong Cheng, Lei Zhu, Chenghao Liu, Liqiang Nie
An Attribute-Aware Attentive Gcn Model For Attribute Missing In Recommendation, Fan Liu, Zhiyong Cheng, Lei Zhu, Chenghao Liu, Liqiang Nie
Research Collection School Of Computing and Information Systems
As important side information, attributes have been widely exploited in the existing recommender system for better performance. However, in the real-world scenarios, it is common that some attributes of items/users are missing (e.g., some movies miss the genre data). Prior studies usually use a default value (i.e., "other") to represent the missing attribute, resulting in sub-optimal performance. To address this problem, in this paper, we present an attribute-aware attentive graph convolution network (A(2)-GCN). In particular, we first construct a graph, where users, items, and attributes are three types of nodes and their associations are edges. Thereafter, we leverage the graph …
Towards An Optimal Bus Frequency Scheduling: When The Waiting Time Matters, Songsong Mo, Zhifeng Bao, Baihua Zheng, Zhiyong Peng
Towards An Optimal Bus Frequency Scheduling: When The Waiting Time Matters, Songsong Mo, Zhifeng Bao, Baihua Zheng, Zhiyong Peng
Research Collection School Of Computing and Information Systems
Reorganizing bus frequencies to cater for actual travel demands can significantly save the cost of the public transport system. This paper studies the bus frequency optimization problem considering the user satisfaction. Specifically, for the first time to our best knowledge, we study how to schedule the buses such that the total number of passengers who could receive their bus services within the waiting time threshold can be maximized. We propose two variants of the problem, FAST and FASTCO, to cater for different application needs and prove that both are NP-hard. To solve FAST effectively and efficiently, we first present an …
Learning To Solve Multiple-Tsp With Time Window And Rejections Via Deep Reinforcement Learning, Rongkai Zhang, Cong Zhang, Zhiguang Cao, Wen Song, Puay Siew Tan, Jie Zhang, Bihan Wen, Justin Dauwels
Learning To Solve Multiple-Tsp With Time Window And Rejections Via Deep Reinforcement Learning, Rongkai Zhang, Cong Zhang, Zhiguang Cao, Wen Song, Puay Siew Tan, Jie Zhang, Bihan Wen, Justin Dauwels
Research Collection School Of Computing and Information Systems
We propose a manager-worker framework (the implementation of our model is publically available at: https://github.com/zcaicaros/manager-worker-mtsptwr) based on deep reinforcement learning to tackle a hard yet nontrivial variant of Travelling Salesman Problem (TSP), i.e. multiple-vehicle TSP with time window and rejections (mTSPTWR), where customers who cannot be served before the deadline are subject to rejections. Particularly, in the proposed framework, a manager agent learns to divide mTSPTWR into sub-routing tasks by assigning customers to each vehicle via a Graph Isomorphism Network (GIN) based policy network. A worker agent learns to solve sub-routing tasks by minimizing the cost in terms of both …
Singapore Public Sector Ai Applications Emphasizing Public Engagement: Six Examples, Steven M. Miller
Singapore Public Sector Ai Applications Emphasizing Public Engagement: Six Examples, Steven M. Miller
Research Collection School Of Computing and Information Systems
This article provides an overview of six examples of public sector AI applications in Singapore that illustrate different ways of enhancing engagement with the public. These applications demonstrate ways of enhancing engagement with the public by providing greater accessibility to government services (access anywhere, anytime) and speedier responses to public processes and feedback. Some applications make it substantially easier for members of the public to do things or make choices, while others reduce waiting time, either across an entire public infrastructure, or for an individual transaction. Some provide highly individualized coaching to guide a person through the process of doing …
Choice-Based Crowdshipping: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra
Choice-Based Crowdshipping: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra
Research Collection School Of Computing and Information Systems
This paper studies the integration of the crowd workforce into a generic last-mile delivery setting in which a set of known delivery requests should be fulfilled at a minimum cost. In this setting, the crowd drivers are able to choose to perform a parcel delivery among the available and displayed requests. We specifically investigate the question: what tasks should be displayed to an individual driver, so as to minimize the overall delivery expenses? In contrast to past approaches, where drivers are either (a) given the choice of a single task chosen so as to optimize the platform’s profit, or (b) …
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 …
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 …
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 …
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 …
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 …
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 …
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 …
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 …
Learning Improvement Heuristics For Solving Routing Problems, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim
Learning Improvement Heuristics For Solving Routing Problems, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim
Research Collection School Of Computing and Information Systems
Recent studies in using deep learning to solve routing problems focus on construction heuristics, the solutions of which are still far from optimality. Improvement heuristics have great potential to narrow this gap by iteratively refining a solution. However, classic improvement heuristics are all guided by hand-crafted rules which may limit their performance. In this paper, we propose a deep reinforcement learning framework to learn the improvement heuristics for routing problems. We design a self-attention based deep architecture as the policy network to guide the selection of next solution. We apply our method to two important routing problems, i.e. travelling salesman …
Secure Deterministic Wallet And Stealth Address: Key-Insulated And Privacy-Preserving Signature Scheme With Publicly Derived Public Key, Zhen Liu, Guomin Yang, Duncan S. Wong, Khoa Nguyen, Huaxiong Wang, Xiaorong Ke, Yining Liu
Secure Deterministic Wallet And Stealth Address: Key-Insulated And Privacy-Preserving Signature Scheme With Publicly Derived Public Key, Zhen Liu, Guomin Yang, Duncan S. Wong, Khoa Nguyen, Huaxiong Wang, Xiaorong Ke, Yining Liu
Research Collection School Of Computing and Information Systems
Deterministic Wallet (DW) and Stealth Address (SA) mechanisms have been widely adopted in the cryptocurrency community, due to their virtues on functionality and privacy protection, which come from a key derivation mechanism that allows an arbitrary number of derived keys to be generated from a master key. However, these algorithms suffer a vulnerability that, when one derived key is compromised somehow, the damage is not limited to the leaked derived key only, but to the master key and in consequence all derived keys are compromised. In this article, we introduce and formalize a new signature variant, called Key-Insulated and Privacy-Preserving …
Deep Learning-Based Text Recognition Of Agricultural Regulatory Document, Hua Leong Fwa, Farn Haur Chan
Deep Learning-Based Text Recognition Of Agricultural Regulatory Document, Hua Leong Fwa, Farn Haur Chan
Research Collection School Of Computing and Information Systems
In this study, an OCR system based on deep learning techniques was deployed to digitize scanned agricultural regulatory documents comprising of certificates and labels. Recognition of the certificates and labels is challenging as they are scanned images of the hard copy form and the layout and size of the text as well as the languages vary between the various countries (due to diverse regulatory requirements). We evaluated and compared between various state-of-the-art deep learningbased text detection and recognition model as well as a packaged OCR library – Tesseract. We then adopted a two-stage approach comprising of text detection using Character …
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 …
Automatic Fairness Testing Of Neural Classifiers Through Adversarial Sampling, Peixin Zhang, Jingyi Wang, Jun Sun, Xinyu Wang, Guoliang Dong, Xinggen Wang, Ting Dai, Jinsong Dong
Automatic Fairness Testing Of Neural Classifiers Through Adversarial Sampling, Peixin Zhang, Jingyi Wang, Jun Sun, Xinyu Wang, Guoliang Dong, Xinggen Wang, Ting Dai, Jinsong Dong
Research Collection School Of Computing and Information Systems
Although deep learning has demonstrated astonishing performance in many applications, there are still concerns about its dependability. One desirable property of deep learning applications with societal impact is fairness (i.e., non-discrimination). Unfortunately, discrimination might be intrinsically embedded into the models due to the discrimination in the training data. As a countermeasure, fairness testing systemically identifies discriminatory samples, which can be used to retrain the model and improve the model’s fairness. Existing fairness testing approaches however have two major limitations. Firstly, they only work well on traditional machine learning models and have poor performance (e.g., effectiveness and efficiency) on deep learning …
Does Social Media Accelerate Product Recalls? Evidence From The Pharmaceutical Industry, Yang Gao, Wenjing Duan, Huaxia Rui
Does Social Media Accelerate Product Recalls? Evidence From The Pharmaceutical Industry, Yang Gao, Wenjing Duan, Huaxia Rui
Research Collection School Of Computing and Information Systems
Social media has become a vital platform for voicing product-related experiences that may not only reveal product defects but also impose pressure on firms to act more promptly than before. This study scrutinizes the rarely-studied relationship between these voices and the speed of product recalls in the context of the pharmaceutical industry where social media pharmacovigilance is becoming increasingly important for the detection of drug safety signals. Using Federal Drug Administration (FDA) drug enforcement reports and social media data crawled from online forums and Twitter, we investigate whether social media can accelerate the product recall process in the context of …