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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 1021 - 1050 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau Jul 2022

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Quadratic unconstrained binary optimization (QUBO) models have garnered growing interests as a strong alternative modelling framework for solving combinatorial optimization problems. A wide variety of optimization problems that are usually studied using conventional Operations Research approaches can be formulated as QUBO problems. However, QUBO solvers do not guarantee optimality when solving optimization problems. Instead, obtaining high quality solutions using QUBO solvers entails tuning of multiple parameters. Here in our work, we conjecture that the initial states adjustment method used in QUBO solvers can be improved, where careful tuning will yield overall better results. We propose a data-driven multi-start algorithm that …

Go to article

Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo Jul 2022

Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo

Research Collection School Of Computing and Information Systems

Modern software engineering projects often depend on open-source software libraries, rendering them vulnerable to potential security issues in these libraries. Developers of client projects have to stay alert of security threats in the software dependencies. While there are existing tools that allow developers to assess if a library vulnerability is reachable from a project, they face limitations. Call graphonly approaches may produce false alarms as the client project may not use the vulnerable code in a way that triggers the vulnerability, while test generation-based approaches faces difficulties in overcoming the intrinsic complexity of exploiting a vulnerability, where extensive domain knowledge …

Go to article

Using Constraint Programming And Graph Representation Learning For Generating Interpretable Cloud Security Policies, Mikhail Kazdagli, Mohit Tiwari, Akshat Kumar Jul 2022

Using Constraint Programming And Graph Representation Learning For Generating Interpretable Cloud Security Policies, Mikhail Kazdagli, Mohit Tiwari, Akshat Kumar

Research Collection School Of Computing and Information Systems

Modern software systems rely on mining insights from business sensitive data stored in public clouds. A data breach usually incurs signifcant (monetary) loss for a commercial organization. Conceptually, cloud security heavily relies on Identity Access Management (IAM) policies that IT admins need to properly confgure and periodically update. Security negligence and human errors often lead to misconfguring IAM policies which may open a backdoor for attackers. To address these challenges, frst, we develop a novel framework that encodes generating optimal IAM policies using constraint programming (CP). We identify reducing dormant permissions of cloud users as an optimality criterion, which intuitively …

Go to article

A Recommendation System Approach To Tune A Qubo Solver, Siong Thye Goh, Jianyuan Bo, Matthieu Parizy, Hoong Chuin Lau Jul 2022

A Recommendation System Approach To Tune A Qubo Solver, Siong Thye Goh, Jianyuan Bo, Matthieu Parizy, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

There are two major challenges to solving constrained optimization problems using a QuadraticUnconstrained Binary Optimization or QUBO solver (QS). First, we need to tune both the underlyingproblem parameters and the algorithm parameters. Second, the solution returned from a QSmight not be feasible. While it is common to use automated tuners such as SMAC and Hyperopt totune the algorithm parameters, the initial search ranges input for the auto tuner affect the performanceof the QS. In this paper, we propose a framework that resembles the Algorithm Selection(AS) framework to tune algorithm parameters for an annealing-based QS. To cope with constraints,we focus on …

Go to article

Uncovering Inclusivity Gaps In Design Pedagogy Through The Digital Design Marginalization Framework, Jaisie Sin, Cosmin Munteanu, Michael Nixon, Velian Pandeliev, Garreth W. Tigwell, Kristen Shinohara, Anthony Tang, Steve Szigeti Jul 2022

Uncovering Inclusivity Gaps In Design Pedagogy Through The Digital Design Marginalization Framework, Jaisie Sin, Cosmin Munteanu, Michael Nixon, Velian Pandeliev, Garreth W. Tigwell, Kristen Shinohara, Anthony Tang, Steve Szigeti

Research Collection School Of Computing and Information Systems

Designers play a key role in the design of inclusive and socially conscious interfaces. Thus, it is imperative for designers to be thoughtful of the ethical and social implications of design. However, gaps in the foundational training that designers receive (e.g., as university students) can negatively impact their ability to consider the social implications of their design practice. This can result in consequences such as digital marginalization, which, as defined by the Digital Design Marginalization (DDM) framework, is the “pushing away”, whether intentional or not, of a defined group of users from a digital or online service or system, where …

Go to article

Multi-Objective Evolutionary Algorithm Based On Rbf Network For Solving The Stochastic Vehicle Routing Problem, Yunyun Niu, Jie Shao, Jianhua Xiao, Wen Song, Zhiguang Cao Jul 2022

Multi-Objective Evolutionary Algorithm Based On Rbf Network For Solving The Stochastic Vehicle Routing Problem, Yunyun Niu, Jie Shao, Jianhua Xiao, Wen Song, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Solving the multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is challenging due to its non-deterministic property and conflicting objectives. Most multi -objective evolutionary algorithm dealing with this problem update current population without any guidance from previous searching experience. In this paper, a multi -objective evolutionary algorithm based on artificial neural networks is proposed to tackle the MO-VRPSD. Particularly, during the evolutionary process, a radial basis function net-work (RBFN) is exploited to learn the potential knowledge of individuals, generate hypoth-esis and instantiate hypothesis. The RBFN evaluates individuals with different scores and generates new individuals with higher quality while taking into …

Go to article

A Mean-Field Markov Decision Process Model For Spatial Temporal Subsidies In Ride-Sourcing Markets, Zheng Zhu, Jintao Ke, Hai Wang Jul 2022

A Mean-Field Markov Decision Process Model For Spatial Temporal Subsidies In Ride-Sourcing Markets, Zheng Zhu, Jintao Ke, Hai Wang

Research Collection School Of Computing and Information Systems

Ride-sourcing services are increasingly popular because of their ability to accommodate on-demand travel needs. A critical issue faced by ride-sourcing platforms is the supply-demand imbalance, as a result of which drivers may spend substantial time on idle cruising and picking up remote passengers. Some platforms attempt to mitigate the imbalance by providing relocation guidance for idle drivers who may have their own self-relocation strategies and decline to follow the suggestions. Platforms then seek to induce drivers to system-desirable locations by offering them subsidies. This paper proposes a mean-field Markov decision process (MF-MDP) model to depict the dynamics in ride-sourcing markets …

Go to article

Self-Guided Learning To Denoise For Robust Recommendation, Yunjun Gao, Yuntao Du, Yujia Hu, Lu Chen, Xinjun Zhu, Ziquan Fang, Baihua Zheng Jul 2022

Self-Guided Learning To Denoise For Robust Recommendation, Yunjun Gao, Yuntao Du, Yujia Hu, Lu Chen, Xinjun Zhu, Ziquan Fang, Baihua Zheng

Research Collection School Of Computing and Information Systems

The ubiquity of implicit feedback makes them the default choice to build modern recommender systems. Generally speaking, observed interactions are considered as positive samples, while unobserved interactions are considered as negative ones. However, implicit feedback is inherently noisy because of the ubiquitous presence of noisy-positive and noisy-negative interactions. Recently, some studies have noticed the importance of denoising implicit feedback for recommendations, and enhanced the robustness of recommendation models to some extent. Nonetheless, they typically fail to (1) capture the hard yet clean interactions for learning comprehensive user preference, and (2) provide a universal denoising solution that can be applied to …

Go to article

Proceedings Of The 13th International Workshop On Graph Computation Models (Gcm 2022), Reiko Heckel, Christopher M. Poskitt Jul 2022

Proceedings Of The 13th International Workshop On Graph Computation Models (Gcm 2022), Reiko Heckel, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

This volume contains the proceedings of the Thirteenth International Workshop on Graph Computation Models (GCM 2022) , which was held in Nantes, France on 6th July 2022 as part of the STAF federation of conferences. Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modelling in science, engineering, and beyond, including computer science, biology, and business process modelling. Graph computation models constitute a class of very high-level models where graphs are first-class citizens. The aim of the International GCM Workshop series is to bring together researchers interested in all aspects …

Go to article

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu Jul 2022

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu

Research Collection School Of Computing and Information Systems

Hitherto statistical type inference systems rely thoroughly on supervised learning approaches, which require laborious manual effort to collect and label large amounts of data. Most Turing-complete imperative languages share similar control- and data-flow structures, which make it possible to transfer knowledge learned from one language to another. In this paper, we propose a cross-lingual transfer learning framework, Plato, for statistical type inference, which allows us to leverage prior knowledge learned from the labeled dataset of one language and transfer it to the others, e.g., Python to JavaScript, Java to JavaScript, etc. Plato is powered by a novel kernelized attention mechanism …

Go to article

An Empirical Study On Data Distribution-Aware Test Selection For Deep Learning Enhancement, Qiang Hu, Yuejun Guo, Maxime Cordy, Xiaofei Xie, Lei Ma, Mike Papadakis, Yves Le Traon Jul 2022

An Empirical Study On Data Distribution-Aware Test Selection For Deep Learning Enhancement, Qiang Hu, Yuejun Guo, Maxime Cordy, Xiaofei Xie, Lei Ma, Mike Papadakis, Yves Le Traon

Research Collection School Of Computing and Information Systems

Similar to traditional software that is constantly under evolution, deep neural networks need to evolve upon the rapid growth of test data for continuous enhancement (e.g., adapting to distribution shift in a new environment for deployment). However, it is labor intensive to manually label all of the collected test data. Test selection solves this problem by strategically choosing a small set to label. Via retraining with the selected set, deep neural networks will achieve competitive accuracy. Unfortunately, existing selection metrics involve three main limitations: (1) using different retraining processes, (2) ignoring data distribution shifts, and (3) being insufficiently evaluated. To …

Go to article

Enabling Ai And Robotic Coaches For Physical Rehabilitation Therapy: Iterative Design And Evaluation With Therapists And Post-Stroke Survivors, Min Hun Lee, Asim Smailagic, Alexandre Bernardino, Sergi Bermúdez I Badia Jul 2022

Enabling Ai And Robotic Coaches For Physical Rehabilitation Therapy: Iterative Design And Evaluation With Therapists And Post-Stroke Survivors, Min Hun Lee, Asim Smailagic, Alexandre Bernardino, Sergi Bermúdez I Badia

Research Collection School Of Computing and Information Systems

Artificial intelligence (AI) and robotic coaches promise the improved engagement of patients on rehabilitation exercises through social interaction. While previous work explored the potential of automatically monitoring exercises for AI and robotic coaches, the deployment of these systems remains a challenge. Previous work described the lack of involving stakeholders to design such functionalities as one of the major causes. In this paper, we present our efforts on eliciting the detailed design specifications on how AI and robotic coaches could interact with and guide patient’s exercises in an effective and acceptable way with four therapists and five post-stroke survivors. Through iterative …

Go to article

Docee: A Large-Scale And Fine-Grained Benchmark For Document-Level Event Extraction, Meihan Tong, Bin Xu, Shuai Wang, Meihuan Han, Yixin Cao, Jiangqi Zhu, Siyu Chen, Lei Hou, Juanzi Li Jul 2022

Docee: A Large-Scale And Fine-Grained Benchmark For Document-Level Event Extraction, Meihan Tong, Bin Xu, Shuai Wang, Meihuan Han, Yixin Cao, Jiangqi Zhu, Siyu Chen, Lei Hou, Juanzi Li

Research Collection School Of Computing and Information Systems

Event extraction aims to identify an event and then extract the arguments participating in the event. Despite the great success in sentencelevel event extraction, events are more naturally presented in the form of documents, with event arguments scattered in multiple sentences. However, a major barrier to promote documentlevel event extraction has been the lack of large-scale and practical training and evaluation datasets. In this paper, we present DocEE, a new document-level event extraction dataset including 27,000+ events, 180,000+ arguments. We highlight three features: largescale manual annotations, fine-grained argument types and application-oriented settings. Experiments show that there is still a big …

Go to article

End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang Jul 2022

End-To-End Open-Set Semi-Supervised Node Classification With Out-Of-Distribution Detection, Tiancheng Huang, Donglin Wang, Yuan Fang

Research Collection School Of Computing and Information Systems

Out-Of-Distribution (OOD) samples are prevalent in real-world applications. The OOD issue becomes even more severe on graph data, as the effect of OOD nodes can be potentially amplified by propagation through the graph topology. Recent works have considered the OOD detection problem, which is critical for reducing the uncertainty in learning and improving the robustness. However, no prior work considers simultaneously OOD detection and node classification on graphs in an end-to-end manner. In this paper, we study a novel problem of end-to-end open-set semisupervised node classification (OSSNC) on graphs, which deals with node classification in the presence of OOD nodes. …

Go to article

Deep One-Class Classification Via Interpolated Gaussian Descriptor, Yuanhong Chen, Yu Tian, Guansong Pang, Gustavo Carneiro Jun 2022

Deep One-Class Classification Via Interpolated Gaussian Descriptor, Yuanhong Chen, Yu Tian, Guansong Pang, Gustavo Carneiro

Research Collection School Of Computing and Information Systems

One-class classification (OCC) aims to learn an effective data description to enclose all normal training samples and detect anomalies based on the deviation from the data description. Current state-of-the-art OCC models learn a compact normality description by hyper-sphere minimisation, but they often suffer from overfitting the training data, especially when the training set is small or contaminated with anomalous samples. To address this issue, we introduce the interpolated Gaussian descriptor (IGD) method, a novel OCC model that learns a one-class Gaussian anomaly classifier trained with adversarially interpolated training samples. The Gaussian anomaly classifier differentiates the training samples based on their …

Go to article

Desire: An Efficient Dynamic Cluster-Based Forest Indexing For Similarity Search In Multi-Metric Spaces, Yifan Zhu, Lu Chen, Yunjun Gao, Baihua Zheng, Pengfei Wang Jun 2022

Desire: An Efficient Dynamic Cluster-Based Forest Indexing For Similarity Search In Multi-Metric Spaces, Yifan Zhu, Lu Chen, Yunjun Gao, Baihua Zheng, Pengfei Wang

Research Collection School Of Computing and Information Systems

Similarity search fnds similar objects for a given query object based on a certain similarity metric. Similarity search in metric spaces has attracted increasing attention, as the metric space can accommodate any type of data and support fexible distance metrics. However, a metric space only models a single data type with a specifc similarity metric. In contrast, a multi-metric space combines multiple metric spaces to simultaneously model a variety of data types and a collection of associated similarity metrics. Thus, a multi-metric space is capable of performing similarity search over any combination of metric spaces. Many studies focus on indexing …

Go to article

Faithful Extreme Rescaling Via Generative Prior Reciprocated Invertible Representations, Zhixuan Zhong, Liangyu Chai, Yang Zhou, Bailin Deng, Jia Pan, Shengfeng He Jun 2022

Faithful Extreme Rescaling Via Generative Prior Reciprocated Invertible Representations, Zhixuan Zhong, Liangyu Chai, Yang Zhou, Bailin Deng, Jia Pan, Shengfeng He

Research Collection School Of Computing and Information Systems

This paper presents a Generative prior ReciprocAted Invertible rescaling Network (GRAIN) for generating faithful high-resolution (HR) images from low-resolution (LR) invertible images with an extreme upscaling factor (64×). Previous researches have leveraged the prior knowledge of a pretrained GAN model to generate high-quality upscaling results. However, they fail to produce pixel-accurate results due to the highly ambiguous extreme mapping process. We remedy this problem by introducing a reciprocated invertible image rescaling process, in which high-resolution information can be delicately embedded into an invertible low-resolution image and generative prior for a faithful HR reconstruction. In particular, the invertible LR features not …

Go to article

Cross-Lingual Adaptation For Recipe Retrieval With Mixup, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Wing-Kwong Chan Jun 2022

Cross-Lingual Adaptation For Recipe Retrieval With Mixup, Bin Zhu, Chong-Wah Ngo, Jingjing Chen, Wing-Kwong Chan

Research Collection School Of Computing and Information Systems

Cross-modal recipe retrieval has attracted research attention in recent years, thanks to the availability of large-scale paired data for training. Nevertheless, obtaining adequate recipe-image pairs covering the majority of cuisines for supervised learning is difficult if not impossible. By transferring knowledge learnt from a data-rich cuisine to a data-scarce cuisine, domain adaptation sheds light on this practical problem. Nevertheless, existing works assume recipes in source and target domains are mostly originated from the same cuisine and written in the same language. This paper studies unsupervised domain adaptation for image-to-recipe retrieval, where recipes in source and target domains are in different …

Go to article

Reinforcement Learning-Based Interactive Video Search, Zhixin Ma, Jiaxin Wu, Zhijian Hou, Chong-Wah Ngo Jun 2022

Reinforcement Learning-Based Interactive Video Search, Zhixin Ma, Jiaxin Wu, Zhijian Hou, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Despite the rapid progress in text-to-video search due to the advancement of cross-modal representation learning, the existing techniques still fall short in helping users to rapidly identify the search targets. Particularly, in the situation that a system suggests a long list of similar candidates, the user needs to painstakingly inspect every search result. The experience is frustrated with repeated watching of similar clips, and more frustratingly, the search targets may be overlooked due to mental tiredness. This paper explores reinforcement learning-based (RL) searching to relieve the user from the burden of brute force inspection. Specifically, the system maintains a graph …

Go to article

Group Contextualization For Video Recognition, Yanbin Hao, Hao Zhang, Chong-Wah Ngo, Xiangnan He Jun 2022

Group Contextualization For Video Recognition, Yanbin Hao, Hao Zhang, Chong-Wah Ngo, Xiangnan He

Research Collection School Of Computing and Information Systems

Learning discriminative representation from the complex spatio-temporal dynamic space is essential for video recognition. On top of those stylized spatio-temporal computational units, further refining the learnt feature with axial contexts is demonstrated to be promising in achieving this goal. However, previous works generally focus on utilizing a single kind of contexts to calibrate entire feature channels and could hardly apply to deal with diverse video activities. The problem can be tackled by using pair-wise spatio-temporal attentions to recompute feature response with cross-axis contexts at the expense of heavy computations. In this paper, we propose an efficient feature refinement method that …

Go to article

Reinforcement Learning Approach To Solve Dynamic Bi-Objective Police Patrol Dispatching And Rescheduling Problem, Waldy Joe, Hoong Chuin Lau, Jonathan Pan Jun 2022

Reinforcement Learning Approach To Solve Dynamic Bi-Objective Police Patrol Dispatching And Rescheduling Problem, Waldy Joe, Hoong Chuin Lau, Jonathan Pan

Research Collection School Of Computing and Information Systems

Police patrol aims to fulfill two main objectives namely to project presence and to respond to incidents in a timely manner. Incidents happen dynamically and can disrupt the initially-planned patrol schedules. The key decisions to be made will be which patrol agent to be dispatched to respond to an incident and subsequently how to adapt the patrol schedules in response to such dynamically-occurring incidents whilst still fulfilling both objectives; which sometimes can be conflicting. In this paper, we define this real-world problem as a Dynamic Bi-Objective Police Patrol Dispatching and Rescheduling Problem and propose a solution approach that combines Deep …

Go to article

Transportation-Enabled Urban Services: A Brief Discussion, Hai Wang Jun 2022

Transportation-Enabled Urban Services: A Brief Discussion, Hai Wang

Research Collection School Of Computing and Information Systems

Nearly 55% of the world's population lives in urban areas or cities, and is expected to rise above 70% over the coming decades. Rapid urbanization brings steadily more residents and a growing freelancing workforce into cities. The developments of city infrastructure and technologies—for instance, mobile location tracking and computing, autonomous and connected vehicles, wearable devices, robotics and robots, smart appliances, biometric authentication, various internet-of-things devices, and smart monitoring systems—are creating numerous opportunities and inspiring innovative and emerging urban services. Among these innovations, complex systems of urban transportation and logistics have embraced advances in technologies and, consequently, been significantly reshaped (Agatz …

Go to article

Flavor-Videos: Enhancing The Flavor Perception Of Food While Eating With Videos, Meetha Nesam James, Nimesha Ranasinghe, Anthony Tang, Lora Oehlberg Jun 2022

Flavor-Videos: Enhancing The Flavor Perception Of Food While Eating With Videos, Meetha Nesam James, Nimesha Ranasinghe, Anthony Tang, Lora Oehlberg

Research Collection School Of Computing and Information Systems

People are typically involved in different activities while eating, particularly when eating alone, such as watching television or playing games on their phones. Previous research in Human-Food Interaction (HFI) has primarily focused on studying people’s motivation and analyzing of the media content watched while eating. However, their impact on human behavioral and cognitive processes, particularly flavor perception and its attributes, remains underexplored. We present a user study to investigate the influence of six types of videos, including mukbang – a new food video genre, on flavor perceptions (taste sensations, liking, and emotions) while eating plain white rice. Our findings revealed …

Go to article

Deep Learning For Person Re-Identification: A Survey And Outlook, Mang Ye, Jianbing Shen, Gaojie Lin, Tao Xiang, Ling Shao, Steven C. H. Hoi Jun 2022

Deep Learning For Person Re-Identification: A Survey And Outlook, Mang Ye, Jianbing Shen, Gaojie Lin, Tao Xiang, Ling Shao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Person re-identification (Re-ID) aims at retrieving a person of interest across multiple non-overlapping cameras. With the advancement of deep neural networks and increasing demand of intelligent video surveillance, it has gained significantly increased interest in the computer vision community. By dissecting the involved components in developing a person Re-ID system, we categorize it into the closed-world and open-world settings. We first conduct a comprehensive overview with in-depth analysis for closed-world person Re-ID from three different perspectives, including deep feature representation learning, deep metric learning and ranking optimization. With the performance saturation under closed-world setting, the research focus for person Re-ID …

Go to article

Decomposing Generation Networks With Structure Prediction For Recipe Generation, Hao Wang, Guosheng Lin, Steven C. H. Hoi, Chunyan Miao Jun 2022

Decomposing Generation Networks With Structure Prediction For Recipe Generation, Hao Wang, Guosheng Lin, Steven C. H. Hoi, Chunyan Miao

Research Collection School Of Computing and Information Systems

Recipe generation from food images and ingredients is a challenging task, which requires the interpretation of the information from another modality. Different from the image captioning task, where the captions usually have one sentence, cooking instructions contain multiple sentences and have obvious structures. To help the model capture the recipe structure and avoid missing some cooking details, we propose a novel framework: Decomposing Generation Networks (DGN) with structure prediction, to get more structured and complete recipe generation outputs. Specifically, we split each cooking instruction into several phases, and assign different sub-generators to each phase. Our approach includes two novel ideas: …

Go to article

Deep Learning For Anomaly Detection, Guansong Pang, Charu Aggarwal, Chunhua Shen, Nicu Sebe Jun 2022

Deep Learning For Anomaly Detection, Guansong Pang, Charu Aggarwal, Chunhua Shen, Nicu Sebe

Research Collection School Of Computing and Information Systems

A nomaly detection aims at identifying data points which are rare or significantly different from the majority of data points. Many techniques are explored to build highly efficient and effective anomaly detection systems, but they are confronted with many difficulties when dealing with complex data, such as failing to capture intricate feature interactions or extract good feature representations. Deep-learning techniques have shown very promising performance in tackling different types of complex data in a broad range of tasks/problems, including anomaly detection. To address this new trend, we organized this Special Issue on Deep Learning for Anomaly Detection to cover the …

Go to article

Consensus Formation On Heterogeneous Networks, Edoardo Fadda, Junda He, Claudia J. Tessone, Paolo Barucca Jun 2022

Consensus Formation On Heterogeneous Networks, Edoardo Fadda, Junda He, Claudia J. Tessone, Paolo Barucca

Research Collection School Of Computing and Information Systems

Reaching consensus-a macroscopic state where the system constituents display the same microscopic state-is a necessity in multiple complex socio-technical and techno-economic systems: their correct functioning ultimately depends on it. In many distributed systems-of which blockchain-based applications are a paradigmatic example-the process of consensus formation is crucial not only for the emergence of a leading majority but for the very functioning of the system. We build a minimalistic network model of consensus formation on blockchain systems for quantifying how central nodes-with respect to their average distance to others-can leverage on their position to obtain competitive advantage in the consensus process. We …

Go to article

Hu-Fu: Efficient And Secure Spatial Queries Over Data Federation, Yongxin Tong, Xuchen Pan, Yuxiang Zeng, Yexuan Shi, Chunbo Xue, Zimu Zhou, Xiaofei Zhang, Lei Chen, Yi Xu, Ke Xu, Weifeng Lv Jun 2022

Hu-Fu: Efficient And Secure Spatial Queries Over Data Federation, Yongxin Tong, Xuchen Pan, Yuxiang Zeng, Yexuan Shi, Chunbo Xue, Zimu Zhou, Xiaofei Zhang, Lei Chen, Yi Xu, Ke Xu, Weifeng Lv

Research Collection School Of Computing and Information Systems

Data isolation has become an obstacle to scale up query processing over big data, since sharing raw data among data owners is often prohibitive due to security concerns. A promising solution is to perform secure queries over a federation of multiple data owners leveraging secure multi-party computation (SMC) techniques, as evidenced by recent federation work over relational data. However, existing solutions are highly inefficient on spatial queries due to excessive secure distance operations for query processing and their usage of general-purpose SMC libraries for secure operation implementation. In this paper, we propose Hu-Fu, the first system for efficient and secure …

Go to article

Mems Ultrasonic Transducers For Safe, Low-Power And Portable Eye-Blinking Monitoring, Sheng Sun, Jianyuan Wang, Menglun Zhang, Yuan Ning, Dong Ma, Yi Yuan, Pengfei Niu, Zhicong Rong, Zhuochen Wang, Wei Pang Jun 2022

Mems Ultrasonic Transducers For Safe, Low-Power And Portable Eye-Blinking Monitoring, Sheng Sun, Jianyuan Wang, Menglun Zhang, Yuan Ning, Dong Ma, Yi Yuan, Pengfei Niu, Zhicong Rong, Zhuochen Wang, Wei Pang

Research Collection School Of Computing and Information Systems

Eye blinking is closely related to human physiology and psychology. It is an effective method of communication among people and can be used in human–machine interactions. Existing blink monitoring methods include video-oculography, electro-oculograms and infrared oculography. However, these methods suffer from uncomfortable use, safety risks, limited reliability in strong light or dark environments, and infringed informational security. In this paper, we propose an ultrasound-based portable approach for eye-blinking activity monitoring. Low-power pulse-echo ultrasound featuring biosafety is transmitted and received by microelectromechanical system (MEMS) ultrasonic transducers seamlessly integrated on glasses. The size, weight and power consumption of the transducers are 2.5 …

Go to article

Challenges For Inclusion In Software Engineering: The Case Of The Emerging Papua New Guinean Society, Raula Kula, Christoph Treude, Hideaki Hata, Sebastian Baltes, Igor Steinmacher, Marco Gerosa, Winifred Kula Amini Jun 2022

Challenges For Inclusion In Software Engineering: The Case Of The Emerging Papua New Guinean Society, Raula Kula, Christoph Treude, Hideaki Hata, Sebastian Baltes, Igor Steinmacher, Marco Gerosa, Winifred Kula Amini

Research Collection School Of Computing and Information Systems

Software plays a central role in modern societies, with its high economic value and potential for advancing societal change. In this paper, we characterise challenges and opportunities for a country progressing towards entering the global software industry, focusing on Papua New Guinea (PNG). By hosting a Software Engineering workshop, we conducted a qualitative study by recording talks (n=3), employing a questionnaire (n=52), and administering an in-depth focus group session with local actors (n=5). Based on a thematic analysis, we identified challenges as barriers and opportunities for the PNG software engineering community. We also discuss the state of practices and how …

Go to article

First Prev Next Last