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 721 - 750 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Learning And Understanding User Interface Semantics From Heterogeneous Networks With Multimodal And Positional Attributes, Meng Kiat Gary Ang, Ee-Peng Lim Mar 2023

Learning And Understanding User Interface Semantics From Heterogeneous Networks With Multimodal And Positional Attributes, Meng Kiat Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

User interfaces (UI) of desktop, web, and mobile applications involve a hierarchy of objects (e.g., applications, screens, view class, and other types of design objects) with multimodal (e.g., textual and visual) and positional (e.g., spatial location, sequence order, and hierarchy level) attributes. We can therefore represent a set of application UIs as a heterogeneous network with multimodal and positional attributes. Such a network not only represents how users understand the visual layout of UIs but also influences how users would interact with applications through these UIs. To model the UI semantics well for different UI annotation, search, and evaluation tasks, …

Go to article

Wearables For In-Situ Monitoring Of Cognitive States: Challenges And Opportunities, Meeralakshmi Radhakrishnan, Thivya Kandappu, Manoj Gulati, Archan Misra Mar 2023

Wearables For In-Situ Monitoring Of Cognitive States: Challenges And Opportunities, Meeralakshmi Radhakrishnan, Thivya Kandappu, Manoj Gulati, Archan Misra

Research Collection School Of Computing and Information Systems

We propose using wrist and ear-based sensing, via multiple novel and complementary modalities, to unobtrusively infer activity-aware, complex cognitive and affective states (such as confusion, boredom, and recall failure) of individuals. While state-of-the-art wearable devices are predominantly used (a) independently, with limited coordination among multiple devices, and (b) to capture macro-level physical activity and physiological state, we seek to expand the ambit of unobtrusive wearable sensing to capture the cognitive states while performing commonplace physical activities. Such states typically manifest via fine-grained, almost unobservable, microscopic head, face, and eye movements. We identify some of these fine-grained physical markers that serve …

Go to article

Spatio-Temporal Heterogeneity In The International Trade Resilience During Covid-19, Wei Luo, Lingfeng He, Zihui Yang, Shirui Zhang, Yong Wang, Dianbo Liu, Sheng Hu, Li He, Jizhe Xia, Min Chen Mar 2023

Spatio-Temporal Heterogeneity In The International Trade Resilience During Covid-19, Wei Luo, Lingfeng He, Zihui Yang, Shirui Zhang, Yong Wang, Dianbo Liu, Sheng Hu, Li He, Jizhe Xia, Min Chen

Research Collection School Of Computing and Information Systems

The COVID-19 pandemic and subsequent lockdowns have created immeasurable health and economic crises, leading to unprecedented disruptions to world trade. The COVID-19 pandemic shows diverse impacts on different economies that suffer and recover at different rates and degrees. This research aims to evaluate the spatio-temporal heterogeneity of international trade network vulnerabilities in the current crisis to understand the global production resilience and prepare for the future crisis. We applied a series of complex network analysis approaches to the monthly international trade networks at the world, regional, and country scales for the pre- and post- COVID-19 outbreak period. The spatio-temporal patterns …

Go to article

Real-Time Hierarchical Map Segmentation For Coordinating Multi-Robot Exploration, Tianze Luo, Zichen Chen, Budhitama Subagdja, Ah-Hwee Tan Feb 2023

Real-Time Hierarchical Map Segmentation For Coordinating Multi-Robot Exploration, Tianze Luo, Zichen Chen, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Coordinating a team of autonomous agents to explore an environment can be done by partitioning the map of the environment into segments and allocating the segments as targets for the individual agents to visit. However, given an unknown environment, map segmentation must be conducted in a continuous and incremental manner. In this paper, we propose a novel real-time hierarchical map segmentation method for supporting multi-agent exploration of indoor environments, wherein clusters of regions of segments are formed hierarchically from randomly sampled points in the environment. Each cluster is then assigned with a cost-utility value based on the minimum cost possible …

Go to article

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurran, Akshat Kumar Feb 2023

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurran, Akshat Kumar

Research Collection School Of Computing and Information Systems

The k-center clustering algorithm, introduced over 35 years ago, is known to be robust to class imbalance prevalent in many clustering problems and has various applications such as data summarization, document clustering, and facility location determination. Unfortunately, existing k-center algorithms provide highly suboptimal solutions that can limit their practical application, reproducibility, and clustering quality. In this paper, we provide a novel scalable and globally optimal solution to a popular variant of the k-center problem known as generalized L_1 k-center clustering that uses L_1 distance and allows the selection of arbitrary vectors as cluster centers. We show that this clustering objective …

Go to article

Learning Comprehensive Global Features In Person Re-Identification: Ensuring Discriminativeness Of More Local Regions, Jiali Xia, Jianqiang Huang, Shibao Zheng, Qin Zhou, Bernt Schiele, Xian-Sheng Hua, Qianru Sun Feb 2023

Learning Comprehensive Global Features In Person Re-Identification: Ensuring Discriminativeness Of More Local Regions, Jiali Xia, Jianqiang Huang, Shibao Zheng, Qin Zhou, Bernt Schiele, Xian-Sheng Hua, Qianru Sun

Research Collection School Of Computing and Information Systems

Person re-identification (Re-ID) aims to retrieve person images from a large gallery given a query image of a person of interest. Global information and fine-grained local features are both essential for the representation. However, global embedding learned by naive classification model tends to be trapped in the most discriminative local region, leading to poor evaluation performance. To address the issue, we propose a novel baseline network that learns strong global feature termed as Comprehensive Global Embedding (CGE), ensuring more local regions of global feature maps to be discriminative. In this work, two key modules are proposed including Non-parameterized Local Classifier …

Go to article

Online Hyperparameter Optimization For Class-Incremental Learning, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun Feb 2023

Online Hyperparameter Optimization For Class-Incremental Learning, Yaoyao Liu, Yingying Li, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Class-incremental learning (CIL) aims to train a classification model while the number of classes increases phase-by-phase. An inherent challenge of CIL is the stability-plasticity tradeoff, i.e., CIL models should keep stable to retain old knowledge and keep plastic to absorb new knowledge. However, none of the existing CIL models can achieve the optimal tradeoff in different data-receiving settings—where typically the training-from-half (TFH) setting needs more stability, but the training-from-scratch (TFS) needs more plasticity. To this end, we design an online learning method that can adaptively optimize the tradeoff without knowing the setting as a priori. Specifically, we first introduce the …

Go to article

Fa3: Fine-Grained Android Application Analysis, Yan Lin, Weng Onn Wong, Debin Gao Feb 2023

Fa3: Fine-Grained Android Application Analysis, Yan Lin, Weng Onn Wong, Debin Gao

Research Collection School Of Computing and Information Systems

Understanding Android applications' behavior is essential to many security applications, e.g., malware analysis. Although many systems have been proposed to perform such dynamic analysis, they are limited by their applicable analysis environment (on device vs. emulator), transparency to subject apps, applicable runtime (Dalvik vs. ART), applicable system stack, or granularity. In this paper, we propose FA3 (Fine-Grained Android Application Analysis), a novel on-device, non-invasive, and fine-grained analysis platform by leveraging existing profiling mechanisms in the Android Runtime (ART) and kernel to inspect method invocations and control-flow transfers for both Java methods and third-party native libraries. FA3 embeds its tracing capability …

Go to article

Web Apis: Features, Issues, And Expectations: A Large-Scale Empirical Study Of Web Apis From Two Publicly Accessible Registries Using Stack Overflow And A User Survey, Neng Zhang, Ying Zou, Xin Xia, David Lo, David Lo, Shanping Li Feb 2023

Web Apis: Features, Issues, And Expectations: A Large-Scale Empirical Study Of Web Apis From Two Publicly Accessible Registries Using Stack Overflow And A User Survey, Neng Zhang, Ying Zou, Xin Xia, David Lo, David Lo, Shanping Li

Research Collection School Of Computing and Information Systems

With the increasing adoption of services-oriented computing and cloud computing technologies, web APIs have become the fundamental building blocks for constructing software applications. Web APIs are developed and published on the internet. The functionality of web APIs can be used to facilitate the development of software applications. There are numerous studies on retrieving and recommending candidate web APIs based on user requirements from a large set of web APIs. However, there are very limited studies on the features of web APIs that make them more likely to be used and the issues of using web APIs in practice. Moreover, users' …

Go to article

Generalization Bounds For Inductive Matrix Completion In Low-Noise Settings, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur, Marius Kloft Feb 2023

Generalization Bounds For Inductive Matrix Completion In Low-Noise Settings, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Yann Guermeur, Marius Kloft

Research Collection School Of Computing and Information Systems

We study inductive matrix completion (matrix completion with side information) under an i.i.d. subgaussian noise assumption at a low noise regime, with uniform sampling of the entries. We obtain for the first time generalization bounds with the following three properties: (1) they scale like the standard deviation of the noise and in particular approach zero in the exact recovery case; (2) even in the presence of noise, they converge to zero when the sample size approaches infinity; and (3) for a fixed dimension of the side information, they only have a logarithmic dependence on the size of the matrix. Differently …

Go to article

Mirror: Mining Implicit Relationships Via Structure-Enhanced Graph Convolutional Networks, Jiaying Liu, Feng Xia, Jing Ren, Bo Xu, Guansong Pang, Lianhua Chi Feb 2023

Mirror: Mining Implicit Relationships Via Structure-Enhanced Graph Convolutional Networks, Jiaying Liu, Feng Xia, Jing Ren, Bo Xu, Guansong Pang, Lianhua Chi

Research Collection School Of Computing and Information Systems

Data explosion in the information society drives people to develop more effective ways to extract meaningful information. Extracting semantic information and relational information has emerged as a key mining primitive in a wide variety of practical applications. Existing research on relation mining has primarily focused on explicit connections and ignored underlying information, e.g., the latent entity relations. Exploring such information (defined as implicit relationships in this article) provides an opportunity to reveal connotative knowledge and potential rules. In this article, we propose a novel research topic, i.e., how to identify implicit relationships across heterogeneous networks. Specially, we first give a …

Go to article

Layout Generation As Intermediate Action Sequence Prediction, Huiting Yang, Danqing Huang, Chin-Yew Lin, Shengfeng He Feb 2023

Layout Generation As Intermediate Action Sequence Prediction, Huiting Yang, Danqing Huang, Chin-Yew Lin, Shengfeng He

Research Collection School Of Computing and Information Systems

Layout generation plays a crucial role in graphic design intelligence. One important characteristic of the graphic layouts is that they usually follow certain design principles. For example, the principle of repetition emphasizes the reuse of similar visual elements throughout the design. To generate a layout, previous works mainly attempt at predicting the absolute value of bounding box for each element, where such target representation has hidden the information of higher-order design operations like repetition (e.g. copy the size of the previously generated element). In this paper, we introduce a novel action schema to encode these operations for better modeling the …

Go to article

Generalizing Math Word Problem Solvers Via Solution Diversification, Zhenwen Liang, Jipeng Zhang, Lei Wang, Yan Wang, Jie Shao, Xiangliang Zhang Feb 2023

Generalizing Math Word Problem Solvers Via Solution Diversification, Zhenwen Liang, Jipeng Zhang, Lei Wang, Yan Wang, Jie Shao, Xiangliang Zhang

Research Collection School Of Computing and Information Systems

Current math word problem (MWP) solvers are usually Seq2Seq models trained by the (one-problem; one-solution) pairs, each of which is made of a problem description and a solution showing reasoning flow to get the correct answer. However, one MWP problem naturally has multiple solution equations. The training of an MWP solver with (one-problem; one-solution) pairs excludes other correct solutions, and thus limits the generalizability of the MWP solver. One feasible solution to this limitation is to augment multiple solutions to a given problem. However, it is difficult to collect diverse and accurate augment solutions through human efforts. In this paper, …

Go to article

Mitigating Popularity Bias For Users And Items With Fairness-Centric Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu Feb 2023

Mitigating Popularity Bias For Users And Items With Fairness-Centric Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu

Research Collection School Of Computing and Information Systems

Recommendation systems are popular in many domains. Researchers usually focus on the effectiveness of recommendation (e.g., precision) but neglect the popularity bias that may affect the fairness of the recommendation, which is also an important consideration that could influence the benefits of users and item providers. A few studies have been proposed to deal with the popularity bias, but they often face two limitations. Firstly, most studies only consider fairness for one side - either users or items, without achieving fairness jointly for both. Secondly, existing methods are not sufficiently tailored to each individual user or item to cope with …

Go to article

Learning To Count Isomorphisms With Graph Neural Networks, Xingtong Yu, Zemin Liu, Yuan Fang, Xinming Zhang Feb 2023

Learning To Count Isomorphisms With Graph Neural Networks, Xingtong Yu, Zemin Liu, Yuan Fang, Xinming Zhang

Research Collection School Of Computing and Information Systems

Subgraph isomorphism counting is an important problem on graphs, as many graph-based tasks exploit recurring subgraph patterns. Classical methods usually boil down to a backtracking framework that needs to navigate a huge search space with prohibitive computational costs. Some recent studies resort to graph neural networks (GNNs) to learn a low-dimensional representation for both the query and input graphs, in order to predict the number of subgraph isomorphisms on the input graph. However, typical GNNs employ a node-centric message passing scheme that receives and aggregates messages on nodes, which is inadequate in complex structure matching for isomorphism counting. Moreover, on …

Go to article

Flexible Job-Shop Scheduling Via Graph Neural Network And Deep Reinforcement Learning, Wen Song, Xinyang Chen, Qiqiang Li, Zhiguang Cao Feb 2023

Flexible Job-Shop Scheduling Via Graph Neural Network And Deep Reinforcement Learning, Wen Song, Xinyang Chen, Qiqiang Li, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Recently, deep reinforcement learning (DRL) has been applied to learn priority dispatching rules (PDRs) for solving complex scheduling problems. However, the existing works face challenges in dealing with flexibility, which allows an operation to be scheduled on one out of multiple machines and is often required in practice. Such one-to-many relationship brings additional complexity in both decision making and state representation. This article considers the well-known flexible job-shop scheduling problem and addresses these issues by proposing a novel DRL method to learn high-quality PDRs end to end. The operation selection and the machine assignment are combined as a composite decision. …

Go to article

Learning Relation Prototype From Unlabeled Texts For Long-Tail Relation Extraction, Yixin Cao, Jun Kuang, Ming Gao, Aoying Zhou, Yonggang Wen, Tat-Seng Chua Feb 2023

Learning Relation Prototype From Unlabeled Texts For Long-Tail Relation Extraction, Yixin Cao, Jun Kuang, Ming Gao, Aoying Zhou, Yonggang Wen, Tat-Seng Chua

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 …

Go to article

Contrastive Learning Approach To Word-In-Context Task For Low-Resource Languages, Pei-Chi Lo, Yang-Yin Lee, Hsien-Hao Chen, Agus Trisnajaya Kwee, Ee-Peng Lim Feb 2023

Contrastive Learning Approach To Word-In-Context Task For Low-Resource Languages, Pei-Chi Lo, Yang-Yin Lee, Hsien-Hao Chen, Agus Trisnajaya Kwee, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Word in context (WiC) task aims to determine whether a target word’s occurrences in two sentences share the same sense. In this paper, we propose a Contrastive Learning WiC (CLWiC) framework to improve the learning of sentence/word representations and classification of target word senses in the sentence pair when performing WiC on lowresource languages. In representation learning, CLWiC trains a pre-trained language model’s ability to cope with lowresource languages using both unsupervised and supervised contrastive learning. The WiC classifier learning further finetunes the language model with WiC classification loss under two classifier architecture options, SGBERT and WiSBERT, which use single-encoder …

Go to article

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurram, Akshat Kumar Feb 2023

Scalable And Globally Optimal Generalized L1 K-Center Clustering Via Constraint Generation In Mixed Integer Linear Programming, Aravinth Chembu, Scott Sanner, Hassan Khurram, Akshat Kumar

Research Collection School Of Computing and Information Systems

The k-center clustering algorithm, introduced over 35 years ago, is known to be robust to class imbalance prevalent in many clustering problems and has various applications such as data summarization, document clustering, and facility location determination. Unfortunately, existing k-center algorithms provide highly suboptimal solutions that can limit their practical application, reproducibility, and clustering quality. In this paper, we provide a novel scalable and globally optimal solution to a popular variant of the k-center problem known as generalized L1 k-center clustering that uses L1 distance and allows the selection of arbitrary vectors as cluster centers. We show that this clustering objective …

Go to article

Human-Centered Ai For Software Engineering: Requirements, Reflection, And Road Ahead, David Lo Feb 2023

Human-Centered Ai For Software Engineering: Requirements, Reflection, And Road Ahead, David Lo

Research Collection School Of Computing and Information Systems

Since its inception in the 2000s, AI for Software Engineering (AI4SE) has grown rapidly. AI in its different forms, e.g., data mining, information retrieval, machine learning, natural language processing, etc., has been demonstrated to be able to produce good results for automating many tasks, including specification mining, bug and vulnerability discovery, bug localization, duplicate bug report identification, failure detection, program repair, technical question answering, code search, and many more. AI4SE has much potential to improve software engineers’ productivity and software quality. Due to its potential, it is currently one of the most popular research areas in the software engineering field.To …

Go to article

Learning Control Policies For Stochastic Systems With Reach-Avoid Guarantees, Dorde Zikelic, Mathias Lechner, A. Thomas Henzinger, Krishnendu Chatterjee Feb 2023

Learning Control Policies For Stochastic Systems With Reach-Avoid Guarantees, Dorde Zikelic, Mathias Lechner, A. Thomas Henzinger, Krishnendu Chatterjee

Research Collection School Of Computing and Information Systems

We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold p ∈ [0,1] over the infinite time horizon in general Lipschitz continuous systems. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees …

Go to article

Quantization-Aware Interval Bound Propagation For Training Certifiably Robust Quantized Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, A. Thomas Henzinger, Daniela Rus Feb 2023

Quantization-Aware Interval Bound Propagation For Training Certifiably Robust Quantized Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, A. Thomas Henzinger, Daniela Rus

Research Collection School Of Computing and Information Systems

We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore commonly adopted in industry. Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization, and certification of the quantized representation is necessary to guarantee robustness. In this work, we present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs. Inspired by advances in robust learning of non-quantized networks, our training …

Go to article

Cross-Domain Graph Anomaly Detection Via Anomaly-Aware Contrastive Alignment, Qizhou Wang, Guansong Pang, Mahsa Salehi, Wray Buntine, Christopher Leckie Feb 2023

Cross-Domain Graph Anomaly Detection Via Anomaly-Aware Contrastive Alignment, Qizhou Wang, Guansong Pang, Mahsa Salehi, Wray Buntine, Christopher Leckie

Research Collection School Of Computing and Information Systems

Cross-domain graph anomaly detection (CD-GAD) describes the problem of detecting anomalous nodes in an unlabelled target graph using auxiliary, related source graphs with labelled anomalous and normal nodes. Although it presents a promising approach to address the notoriously high false positive issue in anomaly detection, little work has been done in this line of research. There are numerous domain adaptation methods in the literature, but it is difficult to adapt them for GAD due to the unknown distributions of the anomalies and the complex node relations embedded in graph data. To this end, we introduce a novel domain adaptation approach, …

Go to article

Effective Graph Kernels For Evolving Functional Brain Networks, Xinlei Wang, Jinyi Chen, Bing Tian Dai, Junchang Xin, Yu Gu, Ge Yu Feb 2023

Effective Graph Kernels For Evolving Functional Brain Networks, Xinlei Wang, Jinyi Chen, Bing Tian Dai, Junchang Xin, Yu Gu, Ge Yu

Research Collection School Of Computing and Information Systems

The graph kernel of the functional brain network is an effective method in the field of neuropsychiatric disease diagnosis like Alzheimer's Disease (AD). The traditional static brain networks cannot reflect dynamic changes of brain activities, but evolving brain networks, which are a series of brain networks over time, are able to seize such dynamic changes. As far as we know, the graph kernel method is effective for calculating the differences among networks. Therefore, it has a great potential to understand the dynamic changes of evolving brain networks, which are a series of chronological differences. However, if the conventional graph kernel …

Go to article

Planning And Learning For Non-Markovian Negative Side Effects Using Finite State Controllers, Aishwarya Srivastava, Sandhya Saisubramanian, Praveen Paruchuri, Akshat Kumar, Shlomo Zilberstein Feb 2023

Planning And Learning For Non-Markovian Negative Side Effects Using Finite State Controllers, Aishwarya Srivastava, Sandhya Saisubramanian, Praveen Paruchuri, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Autonomous systems are often deployed in the open world where it is hard to obtain complete specifications of objectives and constraints. Operating based on an incomplete model can produce negative side effects (NSEs), which affect the safety and reliability of the system. We focus on mitigating NSEs in environments modeled as Markov decision processes (MDPs). First, we learn a model of NSEs using observed data that contains state-action trajectories and severity of associated NSEs. Unlike previous works that associate NSEs with state-action pairs, our framework associates NSEs with entire trajectories, which is more general and captures non-Markovian dependence on states …

Go to article

On Generalized Degree Fairness In Graph Neural Networks, Zemin Liu, Trung Kien Nguyen, Yuan Fang Feb 2023

On Generalized Degree Fairness In Graph Neural Networks, Zemin Liu, Trung Kien Nguyen, Yuan Fang

Research Collection School Of Computing and Information Systems

Conventional graph neural networks (GNNs) are often confronted with fairness issues that may stem from their input, including node attributes and neighbors surrounding a node. While several recent approaches have been proposed to eliminate the bias rooted in sensitive attributes, they ignore the other key input of GNNs, namely the neighbors of a node, which can introduce bias since GNNs hinge on neighborhood structures to generate node representations. In particular, the varying neighborhood structures across nodes, manifesting themselves in drastically different node degrees, give rise to the diverse behaviors of nodes and biased outcomes. In this paper, we first define …

Go to article

Pose- And Attribute-Consistent Person Image Synthesis, Cheng Xu, Zejun Chen, Jiajie Mai, Xuemiao Xu, Shengfeng He Feb 2023

Pose- And Attribute-Consistent Person Image Synthesis, Cheng Xu, Zejun Chen, Jiajie Mai, Xuemiao Xu, Shengfeng He

Research Collection School Of Computing and Information Systems

PersonImageSynthesisaimsattransferringtheappearanceofthesourcepersonimageintoatargetpose. Existingmethods cannot handle largeposevariations and therefore suffer fromtwocritical problems: (1)synthesisdistortionduetotheentanglementofposeandappearanceinformationamongdifferentbody componentsand(2)failureinpreservingoriginalsemantics(e.g.,thesameoutfit).Inthisarticle,weexplicitly addressthesetwoproblemsbyproposingaPose-andAttribute-consistentPersonImageSynthesisNetwork (PAC-GAN).Toreduceposeandappearancematchingambiguity,weproposeacomponent-wisetransferring modelconsistingoftwostages.Theformerstagefocusesonlyonsynthesizingtargetposes,whilethelatter renderstargetappearancesbyexplicitlytransferringtheappearanceinformationfromthesourceimageto thetargetimageinacomponent-wisemanner. Inthisway,source-targetmatchingambiguityiseliminated duetothecomponent-wisedisentanglementofposeandappearancesynthesis.Second,tomaintainattribute consistency,werepresenttheinputimageasanattributevectorandimposeahigh-levelsemanticconstraint usingthisvectortoregularizethetargetsynthesis.ExtensiveexperimentalresultsontheDeepFashiondataset demonstratethesuperiorityofourmethodoverthestateoftheart,especiallyformaintainingposeandattributeconsistenciesunderlargeposevariations.

Go to article

Lightweight And Non-Invasive User Authentication On Earables, Changshuo Hu, Xiao Ma, Dong Ma, Ting Dang Feb 2023

Lightweight And Non-Invasive User Authentication On Earables, Changshuo Hu, Xiao Ma, Dong Ma, Ting Dang

Research Collection School Of Computing and Information Systems

The widespread adoption of wireless earbuds has advanced the developments in earable-based sensing in various domains like entertainment, human-computer interaction, and health monitoring. Recently, researchers have shown an increased interest in user authentication using earables. Despite the successes witnessed in acoustic probing and speech based authentication systems, this paper proposed a lightweight and non-invasive ambient sound based user authentication scheme. It employs the difference between the in-ear and out-ear sounds to estimate the individual-specific occluded ear canal transfer function (OECTF). Specifically, the {out-ear, in-ear} scaling factors at different frequency bands are captured via linear regression and treated as the OECTF …

Go to article

The Gender Wage Gap In An Online Labor Market: The Cost Of Interruptions, Abi Adams-Prassl, Kotaro Hara, Kristy Milland, Chris Callison-Burch Feb 2023

The Gender Wage Gap In An Online Labor Market: The Cost Of Interruptions, Abi Adams-Prassl, Kotaro Hara, Kristy Milland, Chris Callison-Burch

Research Collection School Of Computing and Information Systems

This paper analyses gender differences in working patterns and wages on Amazon Mechanical Turk, a popular online labour platform. Using information on 2 million tasks, we find no gender differences in task selection nor experience. Nonetheless, women earn 20% less per hour on average. Gender differences in working patterns are a significant driver of this wage gap. Women are more likely to interrupt their working time on the platform with consequences for their task completion speed. A follow-up survey shows that the gender differences in working patterns and hourly wages are concentrated amongst workers with children.

Go to article

A Fair Incentive Scheme For Community Health Workers, Avinandan Bose, Tracey Li, Arunesh Sinha, Tien Mai Feb 2023

A Fair Incentive Scheme For Community Health Workers, Avinandan Bose, Tracey Li, Arunesh Sinha, Tien Mai

Research Collection School Of Computing and Information Systems

Community health workers (CHWs) play a crucial role in the last mile delivery of essential health services to under-served populations in low-income countries. Many non-governmental organizations (NGOs) provide training and support to enable CHWs to deliver health services to their communities, with no charge to the recipients of the services. This includes monetary compensation for the work that CHWs perform, which is broken down into a series of well-defined tasks. In this work, we partner with a NGO D-Tree International to design a fair monetary compensation scheme for tasks performed by CHWs in the semi-autonomous region of Zanzibar in Tanzania, …

Go to article

First Prev Next Last