Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1111 - 1140 of 7256

Full-Text Articles in Computer Sciences

Artificial Intelligence For Natural Disaster Management, Guansong Pang Nov 2022

Artificial Intelligence For Natural Disaster Management, Guansong Pang

Research Collection School Of Computing and Information Systems

Artificial intelligence (AI) can leverage massive amount of diverse types of data, such as geospatial data, social media data, and wireless network sensor data, to enhance our understanding of natural disasters, their forecasting and detection, and humanitarian assistance in natural disaster management (NDM). Due to this potential, different communities have been dedicating enormous efforts to the development and/or adoption of AI technologies for NDM. This article provides an overview of these efforts and discusses major challenges and opportunities in this topic.


Delving Deep Into Pixelized Face Recovery And Defense, Zhixuan Zhong, Yong Du, Yang Zhou, Jiangzhong Cao, Shengfeng He Nov 2022

Delving Deep Into Pixelized Face Recovery And Defense, Zhixuan Zhong, Yong Du, Yang Zhou, Jiangzhong Cao, Shengfeng He

Research Collection School Of Computing and Information Systems

Pixelization is arguably one of the most well-adopted deterministic obfuscation techniques for privacy preservation purposes. Although the recovery of pixelized faces is underexplored, the powerful deep neural networks might combat this problem in a data-driven manner. As a consequence, an unbreakable pixelization approach is desired. To achieve this goal, in this paper, we delve into two contradictory problems of unrecoverable pixelization and its counterpart, depixelization, by leveraging the best recovery to strengthen the robustness of the unrecoverable pixelized patterns. In particular, on the offensive end of recovery, we combat the large and continuous nature of pixelized regions by proposing two …


Photovoltaic Cells For Energy Harvesting And Indoor Positioning, Hamada Rizk, Dong Ma, Mahbub Hassan, Moustafa Youssef Nov 2022

Photovoltaic Cells For Energy Harvesting And Indoor Positioning, Hamada Rizk, Dong Ma, Mahbub Hassan, Moustafa Youssef

Research Collection School Of Computing and Information Systems

We propose SoLoc, a lightweight probabilistic fingerprinting-based technique for energy-free device-free indoor localization. The system harnesses photovoltaic currents harvested by the photovoltaic cells in smart environments for simultaneously powering digital devices and user positioning. The basic principle is that the location of the human interferes with the lighting received by the photovoltaic cells, thus producing a location fingerprint on the generated photocurrents. To ensure resilience to noisy measurements, SoLoc constructs probability distributions as a photovoltaic fingerprint at each location. Then, we employ a probabilistic graphical model for estimating the user location in the continuous space. Results show that SoLoc can …


Codematcher: A Tool For Large-Scale Code Search Based On Query Semantics Matching, Chao Liu, Xuanlin Bao, Xin Xia, Meng Yan, David Lo, Ting Zhang Nov 2022

Codematcher: A Tool For Large-Scale Code Search Based On Query Semantics Matching, Chao Liu, Xuanlin Bao, Xin Xia, Meng Yan, David Lo, Ting Zhang

Research Collection School Of Computing and Information Systems

Due to the emergence of large-scale codebases, such as GitHub and Gitee, searching and reusing existing code can help developers substantially improve software development productivity. Over the years, many code search tools have been developed. Early tools leveraged the information retrieval (IR) technique to perform an efficient code search for a frequently changed large-scale codebase. However, the search accuracy was low due to the semantic mismatch between query and code. In the recent years, many tools leveraged Deep Learning (DL) technique to address this issue. But the DL-based tools are slow and the search accuracy is unstable.In this paper, we …


A Fine-Grained Data Set And Analysis Of Tangling In Bug Fixing Commits, Steffen Herbold, Alexander Trautsch, Benjamin Ledel, Alireza Aghamohammadi, Taher Ahmed Ghaleb, Kuljit Kaur Chahal, Tim Bossenmaier, Bhaveet Nagaria, Philip Makedonski, Matin Nili Ahmadabadi, Kristóf Szabados, Helge Spieker, Matej Madeja, Nathaniel G. Hoy, Christoph Treude, Shangwen Wang, Gema Rodríguez-Pérez, Ricardo Colomo-Palacios, Roberto Verdecchia, Paramvir Singh Nov 2022

A Fine-Grained Data Set And Analysis Of Tangling In Bug Fixing Commits, Steffen Herbold, Alexander Trautsch, Benjamin Ledel, Alireza Aghamohammadi, Taher Ahmed Ghaleb, Kuljit Kaur Chahal, Tim Bossenmaier, Bhaveet Nagaria, Philip Makedonski, Matin Nili Ahmadabadi, Kristóf Szabados, Helge Spieker, Matej Madeja, Nathaniel G. Hoy, Christoph Treude, Shangwen Wang, Gema Rodríguez-Pérez, Ricardo Colomo-Palacios, Roberto Verdecchia, Paramvir Singh

Research Collection School Of Computing and Information Systems

Context: Tangled commits are changes to software that address multiple concerns at once. For researchers interested in bugs, tangled commits mean that they actually study not only bugs, but also other concerns irrelevant for the study of bugs.Objective: We want to improve our understanding of the prevalence of tangling and the types of changes that are tangled within bug fixing commits.Methods: We use a crowd sourcing approach for manual labeling to validate which changes contribute to bug fixes for each line in bug fixing commits. Each line is labeled by four participants. If at least three participants agree on the …


The Necessity Of Cloud-Based Simulator For Indonesia's Maritime Education And Training Institutions, Stevian Geerbel Adrianes Rakka Oct 2022

The Necessity Of Cloud-Based Simulator For Indonesia's Maritime Education And Training Institutions, Stevian Geerbel Adrianes Rakka

World Maritime University Dissertations

No abstract provided.


Text Mining Policy Documents To Support Transboundary Integrated Ecosystem Assessment : The Case Of The South Mid-Atlantic Ridge, Debora Cristina Ferrari Ramalho Oct 2022

Text Mining Policy Documents To Support Transboundary Integrated Ecosystem Assessment : The Case Of The South Mid-Atlantic Ridge, Debora Cristina Ferrari Ramalho

World Maritime University Dissertations

No abstract provided.


Data Sharing Through Open Access Data Repositories, Karin Bennedsen Oct 2022

Data Sharing Through Open Access Data Repositories, Karin Bennedsen

All Things Open

The National Institutes of Health has expanded their data sharing requirements for obtaining funding to now include all awards for research producing scientific data to accelerate “biomedical research discovery, in part, by enabling validation of research results, providing accessibility to high-value datasets, and promoting data reuse for future research studies.” The new policy requiring a Data Management & Sharing Plan (DMSP) for all applications goes into effect January 25th, 2023. A DMSP includes where the data will be stored. This lightning talk will review Open Access Data Repositories. Don’t let the task of trying to find data storage hold you …


Tgdm: Target Guided Dynamic Mixup For Cross-Domain Few-Shot Learning, Linhai Zhuo, Yuqian Fu, Jingjing Chen, Yixin Cao, Yu-Gang Jiang Oct 2022

Tgdm: Target Guided Dynamic Mixup For Cross-Domain Few-Shot Learning, Linhai Zhuo, Yuqian Fu, Jingjing Chen, Yixin Cao, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

Given sufficient training data on the source domain, cross-domain few-shot learning (CD-FSL) aims at recognizing new classes with a small number of labeled examples on the target domain. The key to addressing CD-FSL is to narrow the domain gap and transferring knowledge of a network trained on the source domain to the target domain. To help knowledge transfer, this paper introduces an intermediate domain generated by mixing images in the source and the target domain. Specifically, to generate the optimal intermediate domain for different target data, we propose a novel target guided dynamic mixup (TGDM) framework that leverages the target …


Hierarchical Hourglass Convolutional Network For Efficient Video Classification, Yi Tan, Yanbin Hao, Hao Zhang, Shuo Wang Oct 2022

Hierarchical Hourglass Convolutional Network For Efficient Video Classification, Yi Tan, Yanbin Hao, Hao Zhang, Shuo Wang

PhD Student’s Publications Collection

Videos naturally contain dynamic variation over the temporal axis, which will result in the same visual clues (e.g., semantics, objects) changing their scale, position, and perspective patterns between adjacent frames. A primary trend in video CNN is adopting spatial-2D convolution for spatial semantics and temporal-1D convolution for temporal dynamics. Though the direction achieves a favorable balance between efficiency and efficacy, it suffers from misalignment of visual clues with large displacements. Particularly, rigid temporal convolution would fail to capture correct motions when a specific target moves out of the reception field of temporal convolution between adjacent frames.To tackle large visual displacements …


Adaptive Structural Similarity Preserving For Unsupervised Cross Modal Hashing, Liang Li, Baihua Zheng, Weiwei Sun Oct 2022

Adaptive Structural Similarity Preserving For Unsupervised Cross Modal Hashing, Liang Li, Baihua Zheng, Weiwei Sun

Research Collection School Of Computing and Information Systems

Relation Extraction (RE) is a vital step to complete Knowledge Graph (KG) by extracting entity relations from texts. However, it usually suffers from the long-tail issue. The training data mainly concentrates on a few types of relations, leading to the lack of sufficient annotations for the remaining types of relations. In this paper, we propose a general approach to learn relation prototypes from unlabeled texts, to facilitate the long-tail relation extraction by transferring knowledge from the relation types with sufficient training data. We learn relation prototypes as an implicit factor between entities, which reflects the meanings of relations as well …


Interactive Contrastive Learning For Self-Supervised Entity Alignment, Kaisheng Zeng, Zhenhao Dong, Lei Hou, Yixin Cao, Minghao Hu, Jifan Yu, Xin Lv, Lei Cao, Xin Wang, Haozhuang Liu, Yi Huang, Jing Wan, Juanzi Li Oct 2022

Interactive Contrastive Learning For Self-Supervised Entity Alignment, Kaisheng Zeng, Zhenhao Dong, Lei Hou, Yixin Cao, Minghao Hu, Jifan Yu, Xin Lv, Lei Cao, Xin Wang, Haozhuang Liu, Yi Huang, Jing Wan, Juanzi Li

Research Collection School Of Computing and Information Systems

Self-supervised entity alignment (EA) aims to link equivalent entities across different knowledge graphs (KGs) without the use of pre-aligned entity pairs. The current state-of-the-art (SOTA) selfsupervised EA approach draws inspiration from contrastive learning, originally designed in computer vision based on instance discrimination and contrastive loss, and suffers from two shortcomings. Firstly, it puts unidirectional emphasis on pushing sampled negative entities far away rather than pulling positively aligned pairs close, as is done in the well-established supervised EA. Secondly, it advocates the minimum information requirement for self-supervised EA, while we argue that self-described KG’s side information (e.g., entity name, relation name, …


On Mitigating Hard Clusters For Face Clustering, Yingjie Chen, Huasong Zhong, Chong Chen, Chen Shen, Jianqiang Huang, Tao Wang, Yun Liang, Qianru Sun Oct 2022

On Mitigating Hard Clusters For Face Clustering, Yingjie Chen, Huasong Zhong, Chong Chen, Chen Shen, Jianqiang Huang, Tao Wang, Yun Liang, Qianru Sun

Research Collection School Of Computing and Information Systems

Face clustering is a promising way to scale up face recognition systems using large-scale unlabeled face images. It remains challenging to identify small or sparse face image clusters that we call hard clusters, which is caused by the heterogeneity, i.e., high variations in size and sparsity, of the clusters. Consequently, the conventional way of using a uniform threshold (to identify clusters) often leads to a terrible misclassification for the samples that should belong to hard clusters. We tackle this problem by leveraging the neighborhood information of samples and inferring the cluster memberships (of samples) in a probabilistic way. We introduce …


Ngram-Oaxe: Phrase-Based Order-Agnostic Cross Entropy For Non-Autoregressive Machine Translation, Cunxiao Du, Zhaopeng Tu, Longyue Wang, Jing Jiang Oct 2022

Ngram-Oaxe: Phrase-Based Order-Agnostic Cross Entropy For Non-Autoregressive Machine Translation, Cunxiao Du, Zhaopeng Tu, Longyue Wang, Jing Jiang

Research Collection School Of Computing and Information Systems

Recently, a new training oaxe loss has proven effective to ameliorate the effect of multimodality for non-autoregressive translation (NAT), which removes the penalty of word order errors in the standard cross-entropy loss. Starting from the intuition that reordering generally occurs between phrases, we extend oaxe by only allowing reordering between ngram phrases and still requiring a strict match of word order within the phrases. Extensive experiments on NAT benchmarks across language pairs and data scales demonstrate the effectiveness and universality of our approach. Further analyses show that ngram noaxe indeed improves the translation of ngram phrases, and produces more fluent …


Automatic Pull Request Title Generation, Ting Zhang, Ivana Clairine Irsan, Ferdian Thung, Donggyun Han, David Lo, Lingxiao Jiang Oct 2022

Automatic Pull Request Title Generation, Ting Zhang, Ivana Clairine Irsan, Ferdian Thung, Donggyun Han, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Pull Requests (PRs) are a mechanism on modern collaborative coding platforms, such as GitHub. PRs allow developers to tell others that their code changes are available for merging into another branch in a repository. A PR needs to be reviewed and approved by the core team of the repository before the changes are merged into the branch. Usually, reviewers need to identify a PR that is in line with their interests before providing a review. By default, PRs are arranged in a list view that shows the titles of PRs. Therefore, it is desirable to have a precise and concise …


Social Access And Representation For Autistic Adult Livestreamers, Terrance Mok, Anthony Tang, Adam Mccrimmon, Lora Oehlberg Oct 2022

Social Access And Representation For Autistic Adult Livestreamers, Terrance Mok, Anthony Tang, Adam Mccrimmon, Lora Oehlberg

Research Collection School Of Computing and Information Systems

We interviewed 10 autistic livestreamers to understand their motivations for livestreaming on Twitch. Our participants explained that streaming helped them fulfill social desires by: supporting them in making meaningful social connections with others; giving them a safe space to practice social skills like “small talk”; and empowering them to be autistic role models and to share their true selves. This work offers an early report on how autistic individuals leverage livestreaming as a beneficial social platform while struggling with audience expectations.


Locally Varying Distance Transform For Unsupervised Visual Anomaly Detection, Wen-Yan Lin, Zhonghang Liu, Siying Liu Oct 2022

Locally Varying Distance Transform For Unsupervised Visual Anomaly Detection, Wen-Yan Lin, Zhonghang Liu, Siying Liu

Research Collection School Of Computing and Information Systems

Unsupervised anomaly detection on image data is notoriously unstable. We believe this is because many classical anomaly detectors implicitly assume data is low dimensional. However, image data is always high dimensional. Images can be projected to a low dimensional embedding but such projections rely on global transformations that truncate minor variations. As anomalies are rare, the final embedding often lacks the key variations needed to distinguish anomalies from normal instances. This paper proposes a new embedding using a set of locally varying data projections, with each projection responsible for persevering the variations that distinguish a local cluster of instances from …


Ergo: Event Relational Graph Transformer For Document-Level Event Causality Identification, Meiqi Chen, Yixin Cao, Kunquan Deng, Mukai Li, Kun Wang, Jing Shao, Yan Zhang Oct 2022

Ergo: Event Relational Graph Transformer For Document-Level Event Causality Identification, Meiqi Chen, Yixin Cao, Kunquan Deng, Mukai Li, Kun Wang, Jing Shao, Yan Zhang

Research Collection School Of Computing and Information Systems

Document-level Event Causality Identification (DECI) aims to identify event-event causal relations in a document. Existing works usually build an event graph for global reasoning across multiple sentences. However, the edges between events have to be carefully designed through heuristic rules or external tools. In this paper, we propose a novel Event Relational Graph TransfOrmer (ERGO) framework1 for DECI, to ease the graph construction and improve it over the noisy edge issue. Different from conventional event graphs, we define a pair of events as a node and build a complete event relational graph without any prior knowledge or tools. This naturally …


Multi-Functional Job Roles To Support Operations In A Multi-Faceted Jewel Enabled By Ai And Digital Transformation, Steven M. Miller Oct 2022

Multi-Functional Job Roles To Support Operations In A Multi-Faceted Jewel Enabled By Ai And Digital Transformation, Steven M. Miller

Research Collection School Of Computing and Information Systems

In this story, we highlight the way in which the use of AI enabled support systems, together with work process digital transformation and innovative approaches to job redesign, have combined to dramatically change the nature of the work of the front-line service staff who protect and support the facility and visitors at the world’s most iconic airport mall and lifestyle destination.


Two Singapore Public Healthcare Ai Applications For National Screening Programs And Other Examples, Andy Wee An Ta, Han Leong Goh, Christine Ang, Lian Yeow Koh, Ken Poon, Steven M. Miller Oct 2022

Two Singapore Public Healthcare Ai Applications For National Screening Programs And Other Examples, Andy Wee An Ta, Han Leong Goh, Christine Ang, Lian Yeow Koh, Ken Poon, Steven M. Miller

Research Collection School Of Computing and Information Systems

This article explains how two AI systems have been incorporated into the everyday operations of two Singapore public healthcare nation-wide screening programs. The first example is embedded within the setting of a national level population health screening program for diabetes related eye diseases, targeting the rapidly increasing number of adults in the country with diabetes. In the second example, the AI assisted screening is done shortly after a person is admitted to one of the public hospitals to identify which inpatients—especially which elderly patients with complex conditions—have a high risk of being readmitted as an inpatient multiple times in the …


Explanation Guided Contrastive Learning For Sequential Recommendation, Lei Wang, Ee-Peng Lim, Zhiwei Liu, Tianxiang Zhao Oct 2022

Explanation Guided Contrastive Learning For Sequential Recommendation, Lei Wang, Ee-Peng Lim, Zhiwei Liu, Tianxiang Zhao

Research Collection Lee Kong Chian School Of Business

Recently, contrastive learning has been applied to the sequential recommendation task to address data sparsity caused by users with few item interactions and items with few user adoptions. Nevertheless, the existing contrastive learning-based methods fail to ensure that the positive (or negative) sequence obtained by some random augmentation (or sequence sampling) on a given anchor user sequence remains to be semantically similar (or different). When the positive and negative sequences turn out to be false positive and false negative respectively, it may lead to degraded recommendation performance. In this work, we address the above problem by proposing Explanation Guided Augmentations …


Artificial Intelligence, Consumers, And The Experience Economy, Hannah H. Chang, Anirban Mukherjee Oct 2022

Artificial Intelligence, Consumers, And The Experience Economy, Hannah H. Chang, Anirban Mukherjee

Research Collection Lee Kong Chian School Of Business

The term Artificial Intelligence (AI) was first used by McCarthy, Minsky, Rochester, and Shannon in a proposal for a summer research project in 1955 (Solomonoff, 1985). It is widely and commonly defined to be “the science and engineering of making intelligent machines” (McCarthy, 2006). Recent technological advances and methodological developments have made AI pervasive in new marketing offerings, ranging from self-driving cars, intelligent voice assistants such as Amazon’s Alexa, to burger-making robots at restaurants and rack-moving robots inside warehouses such as Amazon’s family of robots (Kiva, Pegasus, Xanthus) and delivery drones. There is optimism, and perhaps even over-optimism, of the …


Improving Knowledge-Aware Recommendation With Multi-Level Interactive Contrastive Learning, Ding Zou, Wei Wei, Ziyang Wang, Xian-Ling Mao, Feida Zhu, Rui Fang, Dangyang Chen Oct 2022

Improving Knowledge-Aware Recommendation With Multi-Level Interactive Contrastive Learning, Ding Zou, Wei Wei, Ziyang Wang, Xian-Ling Mao, Feida Zhu, Rui Fang, Dangyang Chen

Research Collection School Of Computing and Information Systems

Incorporating Knowledge Graphs (KG) into recommeder system as side information has attracted considerable attention. Recently, the technical trend of Knowledge-aware Recommendation (KGR) is to develop end-to-end models based on graph neural networks (GNNs). However, the extremely sparse user-item interactions significantly degrade the performance of the GNN-based models, from the following aspects: 1) the sparse interaction, itself, means inadequate supervision signals and limits the supervised GNN-based models; 2) the combination of sparse interactions (CF part) and redundant KG facts (KG part) further results in an unbalanced information utilization. Besides, the GNN paradigm aggregates local neighbors for node representation learning, while ignoring …


Toward Personalized Answer Generation In E-Commerce Via Multi-Perspective Preference Modeling, Yang Deng, Yaliang Li, Wenxuan Zhang, Bolin Ding, Wai Lam Oct 2022

Toward Personalized Answer Generation In E-Commerce Via Multi-Perspective Preference Modeling, Yang Deng, Yaliang Li, Wenxuan Zhang, Bolin Ding, Wai Lam

Research Collection School Of Computing and Information Systems

Recently, Product Question Answering (PQA) on E-Commerce platforms has attracted increasing attention as it can act as an intelligent online shopping assistant and improve the customer shopping experience. Its key function, automatic answer generation for product-related questions, has been studied by aiming to generate content-preserving while question-related answers. However, an important characteristic of PQA, i.e., personalization, is neglected by existing methods. It is insufficient to provide the same “completely summarized” answer to all customers, since many customers are more willing to see personalized answers with customized information only for themselves, by taking into consideration their own preferences toward product aspects …


Using Machine Learning To Extract Insights From Consumer Data, Hannah H. Chang, Anirban Mukherjee Oct 2022

Using Machine Learning To Extract Insights From Consumer Data, Hannah H. Chang, Anirban Mukherjee

Research Collection Lee Kong Chian School Of Business

Advances in digital technology have led to the digitization of everyday activities of billions of people around the world, generating vast amounts of data on human behavior. From what people buy, to what information they search for, to how they navigate the social, digital, and physical world, human behavior can now be measured at a scale and level of precision that human history has not witnessed before. These developments have created unprecedented opportunities for those interested in understanding observable human behavior–social scientists, businesses, and policymakers—to (re)examine theoretical and substantive questions regarding people’s behavior. Moreover, technology has led to the emergence …


Field Experiments In Operations Management, Yang Gao, Meng Li, Shujing Sun Oct 2022

Field Experiments In Operations Management, Yang Gao, Meng Li, Shujing Sun

Research Collection School Of Computing and Information Systems

While the field experiment is a powerful and well-established method to investigate causal relationships, operations management (OM) has embraced this methodology only in recent years. This paper provides a comprehensive review of the existing OM literature leveraging field experiments and serves as a one-stop guide for future application of field experiments in the OM area. We start by recapping the characteristics that distinguish field experiments from other common types of experiments and organizing the relevant OM studies by topic. Corresponding to the commonly overlooked issues in field experiment-based OM studies, we then provide a detailed roadmap, ranging from experimental design …


Equivariance And Invariance Inductive Bias For Learning From Insufficient Data, Tan Wang, Qianru Sun, Sugiri Pranata, Karlekar Jayashree, Hanwang Zhang Oct 2022

Equivariance And Invariance Inductive Bias For Learning From Insufficient Data, Tan Wang, Qianru Sun, Sugiri Pranata, Karlekar Jayashree, Hanwang Zhang

Research Collection School Of Computing and Information Systems

We are interested in learning robust models from insufficient data, without the need for any externally pre-trained model checkpoints. First, compared to sufficient data, we show why insufficient data renders the model more easily biased to the limited training environments that are usually different from testing. For example, if all the training "swan" samples are "white", the model may wrongly use the "white" environment to represent the intrinsic class "swan". Then, we justify that equivariance inductive bias can retain the class feature while invariance inductive bias can remove the environmental feature, leaving only the class feature that generalizes to any …


Class Is Invariant To Context And Vice Versa: On Learning Invariance For Out-Of-Distribution Generalization, Jiaxin Qi, Kaihua Tang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang Oct 2022

Class Is Invariant To Context And Vice Versa: On Learning Invariance For Out-Of-Distribution Generalization, Jiaxin Qi, Kaihua Tang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Out-Of-Distribution generalization (OOD) is all about learning invariance against environmental changes. If the context in every class is evenly distributed, OOD would be trivial because the context can be easily removed due to an underlying principle: class is invariant to context. However, collecting such a balanced dataset is impractical. Learning on imbalanced data makes the model bias to context and thus hurts OOD. Therefore, the key to OOD is context balance.We argue that the widely adopted assumption in prior work—the context bias can be directly annotated or estimated from biased class prediction—renders the context incomplete or even incorrect. In contrast, …


Soci: A Toolkit For Secure Outsourced Computation On Integers, Bowen Zhao, Jiaming Yuan, Ximeng Liu, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng Oct 2022

Soci: A Toolkit For Secure Outsourced Computation On Integers, Bowen Zhao, Jiaming Yuan, Ximeng Liu, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Secure outsourced computation is a key technique for protecting data security and privacy in the cloud. Although fully homomorphic encryption (FHE) enables computations over encrypted data, it suffers from high computation costs in order to support an unlimited number of arithmetic operations. Recently, secure computations based on interactions of multiple computation servers and partially homomorphic encryption (PHE) were proposed in the literature, which enable an unbound number of addition and multiplication operations on encrypted data more efficiently than FHE and do not add any noise to encrypted data; however, these existing solutions are either limited in functionalities (e.g., computation on …


Evaluation Of Geo-Spebh Algorithm Based On Bandwidth For Big Data Retrieval In Cloud Computing, Abubakar Usman Othman, Moses Timothy, Aisha Yahaya Umar, Abdullahi Salihu Audu, Boukari Souley, Abdulsalam Ya’U Gital Sep 2022

Evaluation Of Geo-Spebh Algorithm Based On Bandwidth For Big Data Retrieval In Cloud Computing, Abubakar Usman Othman, Moses Timothy, Aisha Yahaya Umar, Abdullahi Salihu Audu, Boukari Souley, Abdulsalam Ya’U Gital

Al-Bahir

The fast increase in volume and speed of information created by mobile devices, along with the availability of web-based applications, has considerably contributed to the massive collection of data. Approximate Nearest Neighbor (ANN) is essential in big size databases for comparison search to offer the nearest neighbor of a given query in the field of computer vision and pattern recognition. Many hashing algorithms have been developed to improve data management and retrieval accuracy in huge databases. However, none of these algorithms took bandwidth into consideration, which is a significant aspect in information retrieval and pattern recognition. As a result, our …