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

Computer Sciences Commons™

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

2019

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1201 - 1230 of 3906

Full-Text Articles in Computer Sciences

Splitsecond: Flexible Privilege Separation Of Android Apps, Jehyun Lee, Akshaya Venkateswara Venkateswara Raja, Debin Gao Jul 2019

Splitsecond: Flexible Privilege Separation Of Android Apps, Jehyun Lee, Akshaya Venkateswara Venkateswara Raja, Debin Gao

Research Collection School Of Computing and Information Systems

Android applications have been attractive targets to attackers due to the large number of users and the sensitive information they possess. After the success of the first step of an attack exploiting a software vulnerability, the consequential damage is primarily determined by the criticality and the amount of Android permissions that a victim application has. As a countermeasure, process separation techniques that isolate potentially vulnerable components — usually native libraries — from the critical data and permissions, have been proposed. However, existing techniques offer little flexibility in the separation, e.g., with all native code being placed into one process without …

Go to article

Compositional Coding For Collaborative Filtering, Chenghao Liu, Tao Lu, Xin Wang, Zhiyong Cheng, Jianling Sun, Steven C. H. Hoi Jul 2019

Compositional Coding For Collaborative Filtering, Chenghao Liu, Tao Lu, Xin Wang, Zhiyong Cheng, Jianling Sun, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Efficiency is crucial to the online recommender systems, especially for the ones which needs to deal with tens of millions of users and items. Because representing users and items as binary vectors for Collaborative Filtering (CF) can achieve fast user-item affinity computation in the Hamming space, in recent years, we have witnessed an emerging research effort in exploiting binary hashing techniques for CF methods. However, CF with binary codes naturally suffers from low accuracy due to limited representation capability in each bit, which impedes it from modeling complex structure of the data. In this work, we attempt to improve the …

Go to article

On True Language Understanding, Seng-Beng Ho, Zhaoxia Wang Jul 2019

On True Language Understanding, Seng-Beng Ho, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

Despite the relative successes of natural language processing in providing some useful interfaces for users, natural language understanding is a much more difficult issue. Natural language processing was one of the main topics of AI for as long as computers were put to the task of generating intelligent behavior, and a number of systems that were created since the inception of AI have also been characterized as being capable of natural language understanding. However, in the existing domain of natural language processing and understanding, a definition and consensus of what it means for a system to “truly” understand language do …

Go to article

Securing Messaging Services Through Efficient Signcryption With Designated Equality Test, Yujue Wang, Hwee Hwa Pang, Robert H. Deng, Yong Ding, Qianhong Wu, Bo Qin Jul 2019

Securing Messaging Services Through Efficient Signcryption With Designated Equality Test, Yujue Wang, Hwee Hwa Pang, Robert H. Deng, Yong Ding, Qianhong Wu, Bo Qin

Research Collection School Of Computing and Information Systems

To address security and privacy issues in messaging services, we present a public key signcryption scheme with designated equality test on ciphertexts (PKS-DET) in this paper. The scheme enables a sender to simultaneously encrypt and sign (signcrypt) messages, and to designate a tester to perform equality test on ciphertexts, i.e., to determine whether two ciphertexts signcrypt the same underlying plaintext message. We introduce the PKS-DET framework, present a concrete construction and formally prove its security against three types of adversaries, representing two security requirements on message confidentiality against outsiders and the designated tester, respectively, and a requirement on message unforgeability …

Go to article

Resilient Collaborative Intelligence For Adversarial Iot Environments, Dulanga Weerakoon, Kasthuri Jayarajah, Randy Tandriansyah, Archan Misra Jul 2019

Resilient Collaborative Intelligence For Adversarial Iot Environments, Dulanga Weerakoon, Kasthuri Jayarajah, Randy Tandriansyah, Archan Misra

Research Collection School Of Computing and Information Systems

Many IoT networks, including for battlefield deployments, involve the deployment of resource-constrained sensors with varying degrees of redundancy/overlap (i.e., their data streams possess significant spatiotemporal correlation). Collaborative intelligence, whereby individual nodes adjust their inferencing pipelines to incorporate such correlated observations from other nodes, can improve both inferencing accuracy and performance metrics (such as latency and energy overheads). Using realworld data from a multicamera deployment, we first demonstrate the significant performance gains (up to 14% increase in accuracy) from such collaborative intelligence, achieved through two different approaches: (a) one involving statistical fusion of outputs from different nodes, and (b) another involving …

Go to article

Oblidc: An Sgx-Based Oblivious Distributed Computing Framework With Formal Proof, Pengfei Wu, Qingni Shen, Robert H. Deng, Ximeng Liu, Yinghui Zhang, Zhonghai Wu Jul 2019

Oblidc: An Sgx-Based Oblivious Distributed Computing Framework With Formal Proof, Pengfei Wu, Qingni Shen, Robert H. Deng, Ximeng Liu, Yinghui Zhang, Zhonghai Wu

Research Collection School Of Computing and Information Systems

Data privacy is becoming one of the most critical concerns in cloud computing. Several proposals based on Intel SGX such as VC3 and M2R have been introduced in the literature to protect data privacy during job execution in the cloud. However, a comprehensive formal proof of their security guarantees is still lacking. In this paper, we propose ObliDC, a general UC-secure SGX-based oblivious distributed computing framework. First, we model the life-cycle of a distributed computing job as data-flow graphs. Under the assumption of malicious, adaptive adversaries in the cloud, we then formally define data privacy of a distributed computing job …

Go to article

Evaluating The Readability Of Force Directed Graph Layouts: A Deep Learning Approach, Hammad Haleem, Yong Wang, Abishek Puri, Sahil Wadhwa, Huamin Qu Jul 2019

Evaluating The Readability Of Force Directed Graph Layouts: A Deep Learning Approach, Hammad Haleem, Yong Wang, Abishek Puri, Sahil Wadhwa, Huamin Qu

Research Collection School Of Computing and Information Systems

Existing graph layout algorithms are usually not able to optimize all the aesthetic properties desired in a graph layout. To evaluate how well the desired visual features are reflected in a graph layout, many readability metrics have been proposed in the past decades. However, the calculation of these readability metrics often requires access to the node and edge coordinates and is usually computationally inefficient, especially for dense graphs. Importantly, when the node and edge coordinates are not accessible, it becomes impossible to evaluate the graph layouts quantitatively. In this paper, we present a novel deep learning-based approach to evaluate the …

Go to article

Correlated Learning For Aggregation Systems, Tanvi Verma, Pradeep Varakantham Jul 2019

Correlated Learning For Aggregation Systems, Tanvi Verma, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Aggregation systems (e.g., Uber, Lyft, FoodPanda, Deliveroo) have been increasingly used to improve efficiency in numerous environments, including in transportation, logistics, food and grocery delivery. In these systems, a centralized entity (e.g., Uber) aggregates supply and assigns them to demand so as to optimize a central metric such as profit, number of requests, delay etc. Due to optimizing a metric of importance to the centralized entity, the interests of individuals (e.g., drivers, delivery boys) can be sacrificed. Therefore, in this paper, we focus on the problem of serving individual interests, i.e., learning revenue maximizing policies for individuals in the presence …

Go to article

Pruneable Sharding-Based Blockchain Protocol, Xiaoqin Feng, Jianfeng Ma, Yinbin Miao, Qian Meng, Ximeng Liu, Qi Jiang, Hui Li Jul 2019

Pruneable Sharding-Based Blockchain Protocol, Xiaoqin Feng, Jianfeng Ma, Yinbin Miao, Qian Meng, Ximeng Liu, Qi Jiang, Hui Li

Research Collection School Of Computing and Information Systems

As a distributed ledger technology, the block-chain has gained much attention from both the industrical and academical fields, but most of the existing blockchain protocols still have the cubical dilatation problem. Although the latest Rollerchain has mitigated this issue by changing the blockheader's contents, the low efficiency, severe capacity expansion and non-scalability problems still hinder the adoption of Rollerchain in practice. To this end, we present the pruneable sharding-based blockchain protocol by utilizing the sharding technique and PBFT(Practical Byzantine Fault Tolerance) algorithm in the improved Rollerchain, which has high efficiency, slow cubical dilatation, small capacity expansion and high scalability. Moreover, …

Go to article

Redpc: A Residual Error-Based Density Peak Clustering Algorithm, Milan Parmar, Di Wang, Xiaofeng Zhang, Ah-Hwee Tan, Chunyan Miao, You Zhou Jul 2019

Redpc: A Residual Error-Based Density Peak Clustering Algorithm, Milan Parmar, Di Wang, Xiaofeng Zhang, Ah-Hwee Tan, Chunyan Miao, You Zhou

Research Collection School Of Computing and Information Systems

The density peak clustering (DPC) algorithm was designed to identify arbitrary-shaped clusters by finding density peaks in the underlying dataset. Due to its aptitudes of relatively low computational complexity and a small number of control parameters in use, DPC soon became widely adopted. However, because DPC takes the entire data space into consideration during the computation of local density, which is then used to generate a decision graph for the identification of cluster centroids, DPC may face difficulty in differentiating overlapping clusters and in dealing with low-density data points. In this paper, we propose a residual error-based density peak clustering …

Go to article

Resource Constrained Deep Reinforcement Learning, Abhinav Bhatia, Pradeep Varakantham, Akshat Kumar Jul 2019

Resource Constrained Deep Reinforcement Learning, Abhinav Bhatia, Pradeep Varakantham, Akshat Kumar

Research Collection School Of Computing and Information Systems

In urban environments, resources have to be constantly matched to the “right” locations where customer demand is present. For instance, ambulances have to be matched to base stations regularly so as to reduce response time for emergency incidents in ERS (Emergency Response Systems); vehicles (cars, bikes among others) have to be matched to docking stations to reduce lost demand in shared mobility systems. Such problems are challenging owing to the demand uncertainty, combinatorial action spaces and constraints on allocation of resources (e.g., total resources, minimum and maximum number of resources at locations and regions). Existing systems typically employ myopic and …

Go to article

Multi-Channel Graph Neural Network For Entity Alignment, Yixin Cao, Zhiyuan Liu, Chengjiang Li, Zhiyuan Liu, Juanzi Li, Tat-Seng Chua Jul 2019

Multi-Channel Graph Neural Network For Entity Alignment, Yixin Cao, Zhiyuan Liu, Chengjiang Li, Zhiyuan Liu, Juanzi Li, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Entity alignment typically suffers from the issues of structural heterogeneity and limited seed alignments. In this paper, we propose a novel Multi-channel Graph Neural Network model (MuGNN) to learn alignment-oriented knowledge graph (KG) embeddings by robustly encoding two KGs via multiple channels. Each channel encodes KGs via different relation weighting schemes with respect to self-attention towards KG completion and cross-KG attention for pruning exclusive entities respectively, which are further combined via pooling techniques. Moreover, we also infer and transfer rule knowledge for completing two KGs consistently. MuGNN is expected to reconcile the structural differences of two KGs, and thus make …

Go to article

The Wiener Attack On Rsa Revisited: A Quest For The Exact Bound, Willy Susilo, Joseph Tonien, Guomin Yang Jul 2019

The Wiener Attack On Rsa Revisited: A Quest For The Exact Bound, Willy Susilo, Joseph Tonien, Guomin Yang

Research Collection School Of Computing and Information Systems

Since Wiener pointed out that the RSA can be broken if the private exponent d is relatively small compared to the modulus N (using the continued fraction technique), it has been a general belief that the Wiener attack works for. On the contrary, in this work, we give an example where the Wiener attack fails with, thus, showing that the bound is not accurate as it has been thought of. By using the classical Legendre Theorem on continued fractions, in 1999 Boneh provided the first rigorous proof which showed that the Wiener attack works for. However, the question remains whether …

Go to article

Toward Human-Like Summaries Generated From Heterogeneous Software Artefacts, Mahfouth Alghamdi, Christoph Treude, Markus Wagner Jul 2019

Toward Human-Like Summaries Generated From Heterogeneous Software Artefacts, Mahfouth Alghamdi, Christoph Treude, Markus Wagner

Research Collection School Of Computing and Information Systems

Automatic text summarisation has drawn considerable interest in the field of software engineering. It can improve the efficiency of software developers, enhance the quality of products, and ensure timely delivery. In this paper, we present our initial work towards automatically generating human-like multi-document summaries from heterogeneous software artefacts. Our analysis of the text properties of 545 human-written summaries from 15 software engineering projects will ultimately guide heuristics searches in the automatic generation of human-like summaries.

Go to article

Semantic Patches For Java Program Transformation (Artifact), Hong Jin Kang, Thung Ferdian, Julia Lawall, Gilles Muller, Lingxiao Jiang, David Lo Jul 2019

Semantic Patches For Java Program Transformation (Artifact), Hong Jin Kang, Thung Ferdian, Julia Lawall, Gilles Muller, Lingxiao Jiang, David Lo

Research Collection School Of Computing and Information Systems

The program transformation tool Coccinelle is designed for making changes that is required in many locations within a software project. It has been shown to be useful for C code and has been been adopted for use in the Linux kernel by many developers. Over 6000 commits mentioning the use of Coccinelle have been made in the Linux kernel. Our artifact, Coccinelle4J, is an extension to Coccinelle in order for it to apply program transformations to Java source code. This artifact accompanies our experience report “Semantic Patches for Java Program Transformation”, in which we show a case study of applying …

Go to article

Networkmetrics Unraveled: Mbda In Action, José Camacho, Rasmus Bro, David Kotz Jul 2019

Networkmetrics Unraveled: Mbda In Action, José Camacho, Rasmus Bro, David Kotz

Other Faculty Materials

We propose networkmetrics, a new data-driven approach for monitoring, troubleshooting and understanding communication networks using multivariate analysis. Networkmetric models are powerful machine-learning tools to interpret and interact with data collected from a network. In this paper, we illustrate the application of Multivariate Big Data Analysis (MBDA), a recently proposed networkmetric method with application to Big Data sets. We use MBDA for the detection and troubleshooting of network problems in a campus-wide Wi-Fi network. Data includes a seven-year trace (from 2012 to 2018) of the network’s most recent activity, with approximately 3,000 distinct access points, 40,000 authenticated users, and 600,000 distinct …

Go to article

The Impact Of Changes Mislabeled By Szz On Just-In-Time Defect Prediction, Yuanrui Fan, Xin Xia, Daniel A. Costa, David Lo, Ahmed E. Hassan, Shanping Li Jul 2019

The Impact Of Changes Mislabeled By Szz On Just-In-Time Defect Prediction, Yuanrui Fan, Xin Xia, Daniel A. Costa, David Lo, Ahmed E. Hassan, Shanping Li

Research Collection School Of Computing and Information Systems

Just-in-Time (JIT) defect prediction—a technique which aims to predict bugs at change level—has been paid more attention. JIT defect prediction leverages the SZZ approach to identify bug-introducing changes. Recently, researchers found that the performance of SZZ (including its variants) is impacted by a large amount of noise. SZZ may considerably mislabel changes that are used to train a JIT defect prediction model, and thus impact the prediction accuracy. In this paper, we investigate the impact of the mislabeled changes by different SZZ variants on the performance and interpretation of JIT defect prediction models. We analyze four SZZ variants (i.e., B-SZZ, …

Go to article

Model And Analysis Of Labor Supply For Ride-Sharing Platforms In The Presence Of Sample Self-Selection And Endogeneity, Hao Sun, Hai Wang, Zhixi Wan Jul 2019

Model And Analysis Of Labor Supply For Ride-Sharing Platforms In The Presence Of Sample Self-Selection And Endogeneity, Hao Sun, Hai Wang, Zhixi Wan

Research Collection School Of Computing and Information Systems

With the popularization of ride-sharing services, drivers working as freelancers on ride-sharing platforms can design their schedules flexibly. They make daily decisions regard- ing whether to participate in work, and if so, how many hours to work. Factors such as hourly income rate affect both the participation decision and working-hour decision, and evaluation of the impacts of hourly income rate on labor supply becomes important. In this paper, we propose an econometric framework with closed-form measures to estimate both the participation elasticity (i.e., extensive margin elasticity) and working-hour elasticity (i.e., intensive margin elasticity) of labor supply. We model the sample …

Go to article

Eugene: Towards Deep Intelligence As A Service, Shuochao Yao, Yifan Hao, Yiran Zhao, Ailing Piao, Huajie Shao, Dongxin Liu, Shengzhong Liu, Shaohan Hu, Dulanga Weerakoon, Kasthuri Jayarajah, Archan Misra, Tarek Abdelzaher Jul 2019

Eugene: Towards Deep Intelligence As A Service, Shuochao Yao, Yifan Hao, Yiran Zhao, Ailing Piao, Huajie Shao, Dongxin Liu, Shengzhong Liu, Shaohan Hu, Dulanga Weerakoon, Kasthuri Jayarajah, Archan Misra, Tarek Abdelzaher

Research Collection School Of Computing and Information Systems

The paper discusses an emerging suite of machine intelligence services that are of increasing importance in the highly instrumented world of the Internet of Things (IoT). The suite, called Eugene, would offer a form of intelligent behavior (based on deep neural networks) to otherwise simple embedded devices; the clients of the service. These devices would benefit from service resources to learn from data and to perform intelligent inference, classification, prediction, and estimation tasks that they are too limited to carry out on their own. The paper discusses the taxonomy of such services and the state of implementation, as well as …

Go to article

Stochastic Gradient Hamiltonian Monte Carlo With Variance Reduction For Bayesian Inference, Zhize Li, Tianyi Zhang, Shuyu Cheng, Jun Zhu, Jian Li Jul 2019

Stochastic Gradient Hamiltonian Monte Carlo With Variance Reduction For Bayesian Inference, Zhize Li, Tianyi Zhang, Shuyu Cheng, Jun Zhu, Jian Li

Research Collection School Of Computing and Information Systems

Gradient-based Monte Carlo sampling algorithms, like Langevin dynamics and Hamiltonian Monte Carlo, are important methods for Bayesian inference. In large-scale settings, full-gradients are not affordable and thus stochastic gradients evaluated on mini-batches are used as a replacement. In order to reduce the high variance of noisy stochastic gradients, Dubey et al. (in: Advances in neural information processing systems, pp 1154–1162, 2016) applied the standard variance reduction technique on stochastic gradient Langevin dynamics and obtained both theoretical and experimental improvements. In this paper, we apply the variance reduction tricks on Hamiltonian Monte Carlo and achieve better theoretical convergence results compared with …

Go to article

Using Feature Extraction From Deep Convolutional Neural Networks For Pathological Image Analysis And Its Visual Interpretability, Wei-Wen Hsu Jul 2019

Using Feature Extraction From Deep Convolutional Neural Networks For Pathological Image Analysis And Its Visual Interpretability, Wei-Wen Hsu

Electrical & Computer Engineering Theses & Dissertations

This dissertation presents a computer-aided diagnosis (CAD) system using deep learning approaches for lesion detection and classification on whole-slide images (WSIs) with breast cancer. The deep features being distinguishing in classification from the convolutional neural networks (CNN) are demonstrated in this study to provide comprehensive interpretability for the proposed CAD system using the domain knowledge in pathology. In the experiment, a total of 186 slides of WSIs were collected and classified into three categories: Non-Carcinoma, Ductal Carcinoma in Situ (DCIS), and Invasive Ductal Carcinoma (IDC). Instead of conducting pixel-wise classification (segmentation) into three classes directly, a hierarchical framework with the …

Go to article

Aggregating Private And Public Web Archives Using The Mementity Framework, Matthew R. Kelly Jul 2019

Aggregating Private And Public Web Archives Using The Mementity Framework, Matthew R. Kelly

Computer Science Theses & Dissertations

Web archives preserve the live Web for posterity, but the content on the Web one cares about may not be preserved. The ability to access this content in the future requires the assurance that those sites will continue to exist on the Web until the content is requested and that the content will remain accessible. It is ultimately the responsibility of the individual to preserve this content, but attempting to replay personally preserved pages segregates archived pages by individuals and organizations of personal, private, and public Web content. This is misrepresentative of the Web as it was. While the Memento …

Go to article

Developing Algorithms To Detect Incidents On Freeways From Loop Detector And Vehicle Re-Identification Data, Biraj Adhikari Jul 2019

Developing Algorithms To Detect Incidents On Freeways From Loop Detector And Vehicle Re-Identification Data, Biraj Adhikari

Civil & Environmental Engineering Theses & Dissertations

A new approach for testing incident detection algorithms has been developed and is presented in this thesis. Two new algorithms were developed and tested taking California #7, which is the most widely used algorithm to date, and SVM (Support Vector Machine), which is considered one of the best performing classifiers, as the baseline for comparisons. Algorithm #B in this study uses data from Vehicle Re-Identification whereas the other three algorithms (California #7, SVM and Algorithm #A) use data from a double loop detector for detection of an incident. A microscopic traffic simulator is used for modeling three types of incident …

Go to article

The Chilling Effect Of Enforcement Of Computer Misuse: Evidences From Online Hacker Forums, Qiu-Hong Wang, Rui-Bin Geng, Seung Hyun Kim Jul 2019

The Chilling Effect Of Enforcement Of Computer Misuse: Evidences From Online Hacker Forums, Qiu-Hong Wang, Rui-Bin Geng, Seung Hyun Kim

Research Collection School Of Computing and Information Systems

To reduce the availability of hacking tools for violators in committing cybersecurity offences, many countries have enacted the legislation to criminalize the production, distribution and possession of computer misuse tools with offensive intent. However, the dual-use nature of cybersecurity technology increases the difficulty in the legal process to recognize computer misuse tools and predict their harmful outcome, which leads to unintended impacts of the enforcement on the provision of techniques valuable for information security defence. Leveraging an external shock in online hacker forums, this study examines the potential impacts of the enforcement of computer misuse on users' contribution to information …

Go to article

One-Class Order Embedding For Dependency Relation Prediction, Meng-Fen Chiang, Ee-Peng Lim, Wang-Chien Lee, Xavier Jayaraj Siddarth Ashok, Philips Kokoh Prasetyo Jul 2019

One-Class Order Embedding For Dependency Relation Prediction, Meng-Fen Chiang, Ee-Peng Lim, Wang-Chien Lee, Xavier Jayaraj Siddarth Ashok, Philips Kokoh Prasetyo

Research Collection School Of Computing and Information Systems

Learning the dependency relations among entities and the hierarchy formed by these relations by mapping entities into some order embedding space can effectively enable several important applications, including knowledge base completion and prerequisite relations prediction. Nevertheless, it is very challenging to learn a good order embedding due to the existence of partial ordering and missing relations in the observed data. Moreover, most application scenarios do not provide non-trivial negative dependency relation instances. We therefore propose a framework that performs dependency relation prediction by exploring both rich semantic and hierarchical structure information in the data. In particular, we propose several negative …

Go to article

Entropy Based Independent Learning In Anonymous Multi-Agent Settings, Tanvi Verma, Pradeep Varakantham, Hoong Chuin Lau Jul 2019

Entropy Based Independent Learning In Anonymous Multi-Agent Settings, Tanvi Verma, Pradeep Varakantham, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are responsible for supply (e.g., taxi drivers, delivery bikes or delivery van drivers) earn more by being at the ”right” place at the ”right” time. We are interested in developing approaches that learn to guide individuals to be in the ”right” place at the ”right” time (to maximize revenue) in the presence of other …

Go to article

An Intelligent Platform With Automatic Assessment And Engagement Features For Active Online Discussions, Michelle L. F. Cheong, Yun-Chen Chen, Bing Tian Dai Jul 2019

An Intelligent Platform With Automatic Assessment And Engagement Features For Active Online Discussions, Michelle L. F. Cheong, Yun-Chen Chen, Bing Tian Dai

Research Collection School Of Computing and Information Systems

In a universitycontext, discussion forums are mostly available in Learning and ManagementSystems (LMS) but are often ineffective in encouraging participation due topoorly designed user interface and the lack of motivating factors toparticipate. Our integrated platform with the Telegram mobile app and aweb-based forum, is capable of automatic thoughtfulness assessment of questionsand answers posted, using text mining and Natural Language Processing (NLP)methodologies. We trained and applied the Random Forest algorithm to provideinstant thoughtfulness score prediction for the new posts contributed by thestudents, and prompted the students to improve on their posts, thereby invokingdeeper thinking resulting in better quality contributions. In addition, …

Go to article

Zac: A Zone Path Construction Approach For Effective Real-Time Ridesharing, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet Jul 2019

Zac: A Zone Path Construction Approach For Effective Real-Time Ridesharing, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Real-time ridesharing systems such as UberPool, Lyft Line, GrabShare have become hugely popular as they reduce the costs for customers, improve per trip revenue for drivers and reduce traffic on the roads by grouping customers with similar itineraries. The key challenge in these systems is to group the right requests to travel in available vehicles in real-time, so that the objective (e.g., requests served, revenue or delay) is optimized. The most relevant existing work has focussed on generating as many relevant feasible (with respect to available delay for customers) combinations of requests (referred to as trips) as possible in real-time. …

Go to article

Modeling Intra-Relation In Math Word Problems With Different Functional Multi-Head Attentions, Jierui Li, Lei Wang, Jipeng Zhang, Yan Wang, Bing Tian Dai, Dongxiang Zhang Jul 2019

Modeling Intra-Relation In Math Word Problems With Different Functional Multi-Head Attentions, Jierui Li, Lei Wang, Jipeng Zhang, Yan Wang, Bing Tian Dai, Dongxiang Zhang

Research Collection School Of Computing and Information Systems

Several deep learning models have been proposed for solving math word problems (MWPs) automatically. Although these models have the ability to capture features without manual efforts, their approaches to capturing features are not specifically designed for MWPs. To utilize the merits of deep learning models with simultaneous consideration of MWPs’ specific features, we propose a group attention mechanism to extract global features, quantity-related features, quantity-pair features and question-related features in MWPs respectively. The experimental results show that the proposed approach performs significantly better than previous state-of-the-art methods, and boost performance from 66.9% to 69.5% on Math23K with training-test split, from …

Go to article

Volumetric Optimization Of Freight Cargo Loading: Case Study Of A Smu Forwarder, Tristan Lim, Michael Ser Chong Ping, Mark Goh, Shi Ying Jacelyn Tan Jul 2019

Volumetric Optimization Of Freight Cargo Loading: Case Study Of A Smu Forwarder, Tristan Lim, Michael Ser Chong Ping, Mark Goh, Shi Ying Jacelyn Tan

Research Collection School Of Computing and Information Systems

Purpose: Freight forwarders faces a challenging environment of high market volatility and margin compression risks. Hence, strategic consideration is given to undertaking capacity management and transport asset ownership to achieve longer term cost leadership. Doing so will also help to address management issues, such as better control of potential transport disruptions, improve scheduling flexibility and efficiency, and provide service level enhancement.Design/methodology/approach: The case company currently hastruck resource which is unprofitable, and the firm’s schedulers are having difficulty optimizing the loading capacity. We apply Genetic Algorithm (GA) to undertake volumetric optimization of truckcapacity and to build an easy-to-use platform to help …

Go to article

First Prev Next Last