Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8549)
- Computer Sciences (8532)
- Databases and Information Systems (3451)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1067)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (956)
- Graphics and Human Computer Interfaces (933)
- Social and Behavioral Sciences (734)
- Business (686)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (186)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Feature extraction (46)
- Collaboration (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 2581 - 2610 of 8722
Full-Text Articles in Entire DC Network
Linear Algebra For Computer Science, M. Thulasidas
Linear Algebra For Computer Science, M. Thulasidas
Research Collection School Of Computing and Information Systems
This textbook introduces the essential concepts and practice of Linear Algebra to the undergraduate student of computer science. The focus of this book is on the elegance and beauty of the numerical techniques and algorithms originating from Linear Algebra. As a practical handbook for computer and data scientists, LA4CS restricts itself mostly to real fields and tractable discourses, rather than deep and theoretical mathematics.
Strategic Behavior And Market Inefficiency In Blockchain-Based Auctions, Ping Fan Ke, Jianqing Chen, Zhiling Guo
Strategic Behavior And Market Inefficiency In Blockchain-Based Auctions, Ping Fan Ke, Jianqing Chen, Zhiling Guo
Research Collection School Of Computing and Information Systems
Blockchain-based auctions play a key role in decentralized finance, such as liquidation of collaterals in crypto-lending. In this research, we show that a Blockchain-based auction is subject to the threat to availability because of the characteristics of the Blockchain platform, which could lead to auction inefficiency or even market failure. Specifically, an adversary could occupy all of the transaction capacity of an auction by sending transactions with sufficiently high transaction fees, and then win the item in an auction with a nearly zero bid price as there are no competitors available. We discuss how to prevent this kind of strategic …
Decentralized Deterministic Multi-Agent Reinforcement Learning, Antoine Grosnit, Desmond Cai, Laura Wynter
Decentralized Deterministic Multi-Agent Reinforcement Learning, Antoine Grosnit, Desmond Cai, Laura Wynter
Research Collection School Of Computing and Information Systems
Recent work in multi-agent reinforcement learning (MARL) by [Zhang, ICML12018] provided the first decentralized actor-critic algorithm to offer convergence guarantees. In that work, policies are stochastic and are defined on finite action spaces. We extend those results to develop a provably-convergent decentralized actor-critic algorithm for learning deterministic policies on continuous action spaces. Deterministic policies are important in many real-world settings. To handle the lack of exploration inherent in deterministic policies we provide results for the off-policy setting as well as the on-policy setting. We provide the main ingredients needed for this problem: the expression of a local deterministic policy gradient, …
Robust Bipoly-Matching For Multi-Granular Entities, Ween Jiann Lee, Maksim Tkachenko, Hady W. Lauw
Robust Bipoly-Matching For Multi-Granular Entities, Ween Jiann Lee, Maksim Tkachenko, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Entity matching across two data sources is a prevalent need in many domains, including e-commerce. Of interest is the scenario where entities have varying granularity, e.g., a coarse product category may match multiple finer categories. Previous work in one-to-many matching generally presumes the `one' necessarily comes from a designated source and the `many' from the other source. In contrast, we propose a novel formulation that allows concurrent one-to-many bidirectional matching in any direction. Beyond flexibility, we also seek matching that is more robust to noisy similarity values arising from diverse entity descriptions, by introducing receptivity and reclusivity notions. In addition …
On Analysing Student Resilience In Higher Education Programs Using A Data-Driven Approach, Audrey Tedja Widjaja, Ee Peng Lim, Aldy Gunawan
On Analysing Student Resilience In Higher Education Programs Using A Data-Driven Approach, Audrey Tedja Widjaja, Ee Peng Lim, Aldy Gunawan
Research Collection School Of Computing and Information Systems
Analysing student resilience is important as research has shown that resilience is related to students’ academic performance and their persistence through academic setbacks. While questionnaires can be conducted to assess student resilience directly, they suffer from human recall errors and deliberate suppression of true responses. In this paper, we propose ACREA, ACademic REsilience Analytics framework which adopts a datadriven approach to analyse student resilient behavior with the use of student-course data. ACREA defines academic setbacks experienced by students and measures how well students overcome such setbacks using a quasi-experimental design. By applying ACREA on a real world student-course dataset, we …
The Power Of Renegotiation And Monitoring In Software Outsourcing: Substitutes Or Complements?, He Huang, Minhui Hu, Robert J. Kauffman, Hongyan Xu
The Power Of Renegotiation And Monitoring In Software Outsourcing: Substitutes Or Complements?, He Huang, Minhui Hu, Robert J. Kauffman, Hongyan Xu
Research Collection School Of Computing and Information Systems
Monitoring and contract renegotiation are two common solutions for addressing information asymmetry and uncertainty between a client and a vendor of software outsourcing services. Monitoring is mostly applied in time-and-materials contracts, as a basis for inspecting and reimbursing the vendor’s efforts in system development. Renegotiation, by contrast, is deployed in fixed-price and time-and-materials contracts to mitigate the loss of surplus from uncertainty after system development. We investigate the interaction between monitoring and renegotiation and examine the corresponding contract choice problem. We find that the client benefits from renegotiation based on two effects: an uncertainty-resolution effect and a post-development incentive effect, …
Vireo @ Trecvid 2021 Ad-Hoc Video Search, Jiaxin Wu, Phuong Anh Nguyen, Chong-Wah Ngo
Vireo @ Trecvid 2021 Ad-Hoc Video Search, Jiaxin Wu, Phuong Anh Nguyen, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
In this paper, we summarize our submitted runs and results for Ad-hoc Video Search (AVS) task at TRECVid 2020
Video Snapshot: Single Image Motion Expansion Via Invertible Motion Embedding, Qianshu Zhu, Chu Han, Guoqiang Han, Tien-Tsin Wong, Shengfeng He
Video Snapshot: Single Image Motion Expansion Via Invertible Motion Embedding, Qianshu Zhu, Chu Han, Guoqiang Han, Tien-Tsin Wong, Shengfeng He
Research Collection School Of Computing and Information Systems
Unlike images, finding the desired video content in a large pool of videos is not easy due to the time cost of loading and watching. Most video streaming and sharing services provide the video preview function for a better browsing experience. In this paper, we aim to generate a video preview from a single image. To this end, we propose two cascaded networks, the motion embedding network and the motion expansion network. The motion embedding network aims to embed the spatio-temporal information into an embedded image, called video snapshot. On the other end, the motion expansion network is proposed to …
Learning Large Neighborhood Search Policy For Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang
Learning Large Neighborhood Search Policy For Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
We propose a deep reinforcement learning (RL) method to learn large neighborhood search (LNS) policy for integer programming (IP). The RL policy is trained as the destroy operator to select a subset of variables at each step, which is reoptimized by an IP solver as the repair operator. However, the combinatorial number of variable subsets prevents direct application of typical RL algorithms. To tackle this challenge, we represent all subsets by factorizing them into binary decisions on each variable. We then design a neural network to learn policies for each variable in parallel, trained by a customized actor-critic algorithm. We …
Neurolkh: Combining Deep Learning Model With Lin-Kernighan-Helsgaun Heuristic For Solving The Traveling Salesman Problem, Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang
Neurolkh: Combining Deep Learning Model With Lin-Kernighan-Helsgaun Heuristic For Solving The Traveling Salesman Problem, Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
We present NeuroLKH, a novel algorithm that combines deep learning with the strong traditional heuristic Lin-Kernighan-Helsgaun (LKH) for solving Traveling Salesman Problem. Specifically, we train a Sparse Graph Network (SGN) with supervised learning for edge scores and unsupervised learning for node penalties, both of which are critical for improving the performance of LKH. Based on the output of SGN, NeuroLKH creates the edge candidate set and transforms edge distances to guide the searching process of LKH. Extensive experiments firmly demonstrate that, by training one model on a wide range of problem sizes, NeuroLKH significantly outperforms LKH and generalizes well to …
Learning To Iteratively Solve Routing Problems With Dual-Aspect Collaborative Transformer, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang
Learning To Iteratively Solve Routing Problems With Dual-Aspect Collaborative Transformer, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang
Research Collection School Of Computing and Information Systems
Recently, Transformer has become a prevailing deep architecture for solving vehicle routing problems (VRPs). However, it is less effective in learning improvement models for VRP because its positional encoding (PE) method is not suitable in representing VRP solutions. This paper presents a novel Dual-Aspect Collaborative Transformer (DACT) to learn embeddings for the node and positional features separately, instead of fusing them together as done in existing ones, so as to avoid potential noises and incompatible correlations. Moreover, the positional features are embedded through a novel cyclic positional encoding (CPE) method to allow Transformer to effectively capture the circularity and symmetry …
Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik
Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik
Research Collection School Of Computing and Information Systems
Due to the high communication cost in distributed and federated learning, methods relying on compressed communication are becoming increasingly popular. Besides, the best theoretically and practically performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of communications (faster convergence), e.g., Nesterov's accelerated gradient descent (Nesterov, 1983, 2004) and Adam (Kingma and Ba, 2014). In order to combine the benefits of communication compression and convergence acceleration, we propose a \emph{compressed and accelerated} gradient method based on ANITA (Li, 2021) for distributed optimization, which we call CANITA. Our CANITA achieves the \emph{first accelerated rate} $O\bigg(\sqrt{\Big(1+\sqrt{\frac{\omega^3}{n}}\Big)\frac{L}{\epsilon}} + \omega\big(\frac{1}{\epsilon}\big)^{\frac{1}{3}}\bigg)$, …
Towards Understanding Why Lookahead Generalizes Better Than Sgd And Beyond, Pan Zhou, Hanshu Yan, Xiaotong Yuan, Jiashi Feng, Shuicheng Yan
Towards Understanding Why Lookahead Generalizes Better Than Sgd And Beyond, Pan Zhou, Hanshu Yan, Xiaotong Yuan, Jiashi Feng, Shuicheng Yan
Research Collection School Of Computing and Information Systems
To train networks, lookahead algorithm [1] updates its fast weights k times via an inner-loop optimizer before updating its slow weights once by using the latest fast weights. Any optimizer, e.g. SGD, can serve as the inner-loop optimizer, and the derived lookahead generally enjoys remarkable test performance improvement over the vanilla optimizer. But theoretical understandings on the test performance improvement of lookahead remain absent yet. To solve this issue, we theoretically justify the advantages of lookahead in terms of the excess risk error which measures the test performance. Specifically, we prove that lookahead using SGD as its inner-loop optimizer can …
A Theory-Driven Self-Labeling Refinement Method For Contrastive Representation Learning, Pan Zhou, Caiming Xiong, Xiao-Tong Yuan
A Theory-Driven Self-Labeling Refinement Method For Contrastive Representation Learning, Pan Zhou, Caiming Xiong, Xiao-Tong Yuan
Research Collection School Of Computing and Information Systems
For an image query, unsupervised contrastive learning labels crops of the same image as positives, and other image crops as negatives. Although intuitive, such a native label assignment strategy cannot reveal the underlying semantic similarity between a query and its positives and negatives, and impairs performance, since some negatives are semantically similar to the query or even share the same semantic class as the query. In this work, we first prove that for contrastive learning, inaccurate label assignment heavily impairs its generalization for semantic instance discrimination, while accurate labels benefit its generalization. Inspired by this theory, we propose a novel …
Infinite Time Horizon Safety Of Bayesian Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger
Infinite Time Horizon Safety Of Bayesian Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger
Research Collection School Of Computing and Information Systems
Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network’s prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior’s support. …
Rmix: Learning Risk-Sensitive Policies For Cooperative Reinforcement Learning Agents, Wei Qiu, Xinrun Wang, Runsheng Yu, Xu He, Rundong Wang, Bo An, Svetlana Obraztsova, Zinovi Rabinovich
Rmix: Learning Risk-Sensitive Policies For Cooperative Reinforcement Learning Agents, Wei Qiu, Xinrun Wang, Runsheng Yu, Xu He, Rundong Wang, Bo An, Svetlana Obraztsova, Zinovi Rabinovich
Research Collection School Of Computing and Information Systems
Current value-based multi-agent reinforcement learning methods optimize individual Q values to guide individuals' behaviours via centralized training with decentralized execution (CTDE). However, such expected, i.e., risk-neutral, Q value is not sufficient even with CTDE due to the randomness of rewards and the uncertainty in environments, which causes the failure of these methods to train coordinating agents in complex environments. To address these issues, we propose RMIX, a novel cooperative MARL method with the Conditional Value at Risk (CVaR) measure over the learned distributions of individuals' Q values. Specifically, we first learn the return distributions of individuals to analytically calculate CVaR …
Data Fusion For Trust Evaluation, Zheng Yan, Qinghua Zheng, Laurence T. Yang, Robert H. Deng
Data Fusion For Trust Evaluation, Zheng Yan, Qinghua Zheng, Laurence T. Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Trust evaluation is a process to quantify trust by analyzing the data related to the factors that affect trust. It has been widely applied in many fields to facilitate decision making, system entity collaboration and security establishment. For example, in social networking, trust evaluation helps users make a social decision, reduce the risk of social interactions, and ensure the quality of a social networking environment. In digital communications, trust evaluation can be applied to detect malicious nodes, filter unwanted traffic and improve communication security. In e-commerce and cloud services, trust evaluation helps users selecting an appropriate product or service from …
Integration Of Information Technology Certifications Into Undergraduate Computing Curriculum, Eng Lieh Ouh, Kyong Jin Shim
Integration Of Information Technology Certifications Into Undergraduate Computing Curriculum, Eng Lieh Ouh, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
This innovative practice full paper describes our experiences of integrating information technology certifications into an undergraduate computing curriculum. As the technology landscape evolves, a common challenge for educators in computing programs is designing an industry-relevant curriculum. Over the years, industry practitioners have taken technology certifications to validate themselves against a base level of technical knowledge currently in demand in industry. Information technology (IT) certifications can also offer paths for academic computing programs to stay relevant to industry needs. However, identifying relevant IT certifications and integrating it into an academic curriculum requires a careful design approach as substantial efforts are needed …
Adadeep: A Usage-Driven, Automated Deep Model Compression Framework For Enabling Ubiquitous Intelligent Mobiles, Sicong Liu, Junzhao Du, Kaiming Nan, Zimu Zhou, Hui Liu, Zhangyang Wang, Yingyan Lin
Adadeep: A Usage-Driven, Automated Deep Model Compression Framework For Enabling Ubiquitous Intelligent Mobiles, Sicong Liu, Junzhao Du, Kaiming Nan, Zimu Zhou, Hui Liu, Zhangyang Wang, Yingyan Lin
Research Collection School Of Computing and Information Systems
Recent breakthroughs in deep neural networks (DNNs) have fueled a tremendously growing demand for bringing DNN-powered intelligence into mobile platforms. While the potential of deploying DNNs on resource-constrained platforms has been demonstrated by DNN compression techniques, the current practice suffers from two limitations: 1) merely stand-alone compression schemes are investigated even though each compression technique only suit for certain types of DNN layers; and 2) mostly compression techniques are optimized for DNNs’ inference accuracy, without explicitly considering other application-driven system performance (e.g., latency and energy cost) and the varying resource availability across platforms (e.g., storage and processing capability). To this …
Towards Non-Intrusive Camera-Based Heart Rate Variability Estimation In The Car Under Naturalistic Condition, Shu Liu, Kevin Koch, Zimu Zhou, Martin Maritsch, Xiaoxi He, Elgar Fleisch, Felix Wortmann
Towards Non-Intrusive Camera-Based Heart Rate Variability Estimation In The Car Under Naturalistic Condition, Shu Liu, Kevin Koch, Zimu Zhou, Martin Maritsch, Xiaoxi He, Elgar Fleisch, Felix Wortmann
Research Collection School Of Computing and Information Systems
Driver status monitoring systems are a vital component of smart cars in the future, especially in the era when an increasing amount of time is spent in the vehicle. The heart rate (HR) is one of the most important physiological signals of driver status. To infer HR of drivers, the mainstream of existing research focused on capturing subtle heartbeat-induced vibration of the torso or leveraged photoplethysmography (PPG) that detects cardiac cycle-related blood volume changes in the microvascular. However, existing approaches rely on dedicated sensors that are expensive and cumbersome to be integrated or are vulnerable to ambient noise. Moreover, their …
Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu
Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu
Research Collection School Of Computing and Information Systems
Smart contracts are computerized transaction protocols built on top of blockchain networks. Users are charged with fees, a.k.a. gas in Ethereum, when they create, deploy or execute smart contracts. Since smart contracts may contain vulnerabilities which may result in huge financial loss, developers and smart contract compilers often insert codes for security checks. The trouble is that those codes consume gas every time they are executed. Many of the inserted codes are however redundant. In this work, we present sOptimize, a tool that optimizes smart contract gas consumption automatically without compromising functionality or security. sOptimize works on smart contract bytecode, …
Spurring Digital Transformation In Singapore's Legal Industry, Xin Juan Chua, Steven M. Miller
Spurring Digital Transformation In Singapore's Legal Industry, Xin Juan Chua, Steven M. Miller
Research Collection School Of Computing and Information Systems
COVID-19 has transformed the way we live and work. It has caused the processes and operations of businesses and organisations to be restructured, as well as transformed business models. A 2020 McKinsey Global survey reported that companies all over the world claim they have accelerated the digitalisation of their customer and supply-chain interactions, as well as their internal operations, by three to four years. They also said they thought the share of digital or digitally enabled products in their portfolios has advanced by seven years. While technology transformation is not new to the legal profession, COVID-19 has cemented the importance …
Empirical Evaluation Of Minority Oversampling Techniques In The Context Of Android Malware Detection, Lwin Khin Shar, Nguyen Binh Duong Ta, David Lo
Empirical Evaluation Of Minority Oversampling Techniques In The Context Of Android Malware Detection, Lwin Khin Shar, Nguyen Binh Duong Ta, David Lo
Research Collection School Of Computing and Information Systems
In Android malware classification, the distribution of training data among classes is often imbalanced. This causes the learning algorithm to bias towards the dominant classes, resulting in mis-classification of minority classes. One effective way to improve the performance of classifiers is the synthetic generation of minority instances. One pioneer technique in this area is Synthetic Minority Oversampling Technique (SMOTE) and since its publication in 2002, several variants of SMOTE have been proposed and evaluated on various imbalanced datasets. However, these techniques have not been evaluated in the context of Android malware detection. Studies have shown that the performance of SMOTE …
Fine-Grained Generalization Analysis Of Inductive Matrix Completion, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Marius Kloft
Fine-Grained Generalization Analysis Of Inductive Matrix Completion, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Marius Kloft
Research Collection School Of Computing and Information Systems
In this paper, we bridge the gap between the state-of-the-art theoretical results for matrix completion with the nuclear norm and their equivalent in \textit{inductive matrix completion}: (1) In the distribution-free setting, we prove bounds improving the previously best scaling of \widetilde{O}(rd2) to \widetilde{O}(d3/2√r), where d is the dimension of the side information and rr is the rank. (2) We introduce the (smoothed) \textit{adjusted trace-norm minimization} strategy, an inductive analogue of the weighted trace norm, for which we show guarantees of the order \widetilde{O}(dr) under arbitrary sampling. In the inductive case, a similar rate was previously achieved only under uniform sampling …
Beyond Smoothness : Incorporating Low-Rank Analysis Into Nonparametric Density Estimation, Rob Vandermeulen, Antoine Ledent
Beyond Smoothness : Incorporating Low-Rank Analysis Into Nonparametric Density Estimation, Rob Vandermeulen, Antoine Ledent
Research Collection School Of Computing and Information Systems
The construction and theoretical analysis of the most popular universally consistent nonparametric density estimators hinge on one functional property: smoothness. In this paper we investigate the theoretical implications of incorporating a multi-view latent variable model, a type of low-rank model, into nonparametric density estimation. To do this we perform extensive analysis on histogram-style estimators that integrate a multi-view model. Our analysis culminates in showing that there exists a universally consistent histogram-style estimator that converges to any multi-view model with a finite number of Lipschitz continuous components at a rate of ˜O(1/3√n) in L1 error. In contrast, the standard histogram estimator …
Functional Signatures: New Definition And Constructions, Qingwen Guo, Qiong Huang, Sha Ma, Meiyan Xiao, Guomin Yang, Willy Susilo
Functional Signatures: New Definition And Constructions, Qingwen Guo, Qiong Huang, Sha Ma, Meiyan Xiao, Guomin Yang, Willy Susilo
Research Collection School Of Computing and Information Systems
Functional signatures (FS) enable a master authority to delegate its signing privilege to an assistant. Concretely, the master authority uses its secret key sk(F) to issue a signing key sk(f) for a designated function f is an element of F-FS and sends both f and sk(f) to the assistant E, which is then able to compute a signature sigma(f) with respect to pk(F) for a message y in the range of f. In this paper, we modify the syntax of FS slightly to support the application scenario where a certificate of authorization is necessary. Compared with the original FS, our …
Deriving Invariant Checkers For Critical Infrastructure Using Axiomatic Design Principles, Cheah Huei Yoong, Venkata Reddy Palleti, Rajib Ranjan Maiti, Arlindo Silva, Christopher M. Poskitt
Deriving Invariant Checkers For Critical Infrastructure Using Axiomatic Design Principles, Cheah Huei Yoong, Venkata Reddy Palleti, Rajib Ranjan Maiti, Arlindo Silva, Christopher M. Poskitt
Research Collection School Of Computing and Information Systems
Cyber-physical systems (CPSs) in critical infrastructure face serious threats of attack, motivating research into a wide variety of defence mechanisms such as those that monitor for violations of invariants, i.e. logical properties over sensor and actuator states that should always be true. Many approaches for identifying invariants attempt to do so automatically, typically using data logs, but these can miss valid system properties if relevant behaviours are not well-represented in the data. Furthermore, as the CPS is already built, resolving any design flaws or weak points identified through this process is costly. In this paper, we propose a systematic …
Towards Balancing Vr Immersion And Bystander Awareness, Yoshiki Kudo, Anthony Tang, Kazuyuki Fujita, Isamu Endo, Kazuki Takashima, Yoshifumi Kitamura
Towards Balancing Vr Immersion And Bystander Awareness, Yoshiki Kudo, Anthony Tang, Kazuyuki Fujita, Isamu Endo, Kazuki Takashima, Yoshifumi Kitamura
Research Collection School Of Computing and Information Systems
Head-mounted displays (HMDs) increase immersion into virtual worlds. The problem is that this limits headset users' awareness of bystanders: headset users cannot attend to bystanders' presence and activities. We call this the HMD boundary. We explore how to make the HMD boundary permeable by comparing different ways of providing informal awareness cues to the headset user about bystanders. We adapted and implemented three visualization techniques (Avatar View, Radar and Presence++) that share bystanders' location and orientation with headset users. We conducted a hybrid user and simulation study with three different types of VR content (high, medium, low interactivity) with twenty …
An Economic Analysis Of Rebates Conditional On Positive Reviews, Jianqing Chen, Zhiling Guo, Jian Huang
An Economic Analysis Of Rebates Conditional On Positive Reviews, Jianqing Chen, Zhiling Guo, Jian Huang
Research Collection School Of Computing and Information Systems
Strategic sellers on some online selling platforms have recently been using a conditional-rebate strategy to manipulate product reviews under which only purchasing consumers who post positive reviews online are eligible to redeem the rebate. A key concern for the conditional rebate is that it can easily induce fake reviews, which might be harmful to consumers and society. We develop a microbehavioral model capturing consumers’ review-sharing benefit, review-posting cost, and moral cost of lying to examine the seller’s optimal pricing and rebate decisions. We derive three equilibria: the no-rebate, organic-review equilibrium; the low-rebate, boosted-authentic-review equilibrium; and the high-rebate, partially-fake-review equilibrium. We …
On Aggregating Salaries Of Occupations From Job Post And Review Data, Chih-Chieh Hung, Ee-Peng Lim
On Aggregating Salaries Of Occupations From Job Post And Review Data, Chih-Chieh Hung, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
The popularity of job websites has significantly changed the way people learn about different occupations. Among the insights offered by these websites are the statistics of occupation salaries which are useful information for job seekers, career coaches, graduating students, and labor related government agencies. Such statistics include the distribution of job salaries of each occupation, such as average or quantiles. However, significant variability in salary (and review salary) can be found among jobs of the same occupation as we gather job post and review data from job websites. Such variability shows the existence of biases, including salary competitiveness in job …