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

Computer Sciences Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 26461 - 26490 of 63663

Full-Text Articles in Computer Sciences

Towards Understanding Android System Vulnerabilities: Techniques And Insights, Daoyuan Wu, Debin Gao, Eric K. T. Cheng, Yichen Cao, Jintao Jiang, Robert H. Deng Jul 2019

Towards Understanding Android System Vulnerabilities: Techniques And Insights, Daoyuan Wu, Debin Gao, Eric K. T. Cheng, Yichen Cao, Jintao Jiang, Robert H. Deng

Research Collection School Of Computing and Information Systems

As a common platform for pervasive devices, Android has been targeted by numerous attacks that exploit vulnerabilities in its apps and the operating system. Compared to app vulnerabilities, systemlevel vulnerabilities in Android, however, were much less explored in the literature. In this paper, we perform the first systematic study of Android system vulnerabilities by comprehensively analyzing all 2,179 vulnerabilities on the Android Security Bulletin program over about three years since its initiation in August 2015. To this end, we propose an automatic analysis framework, upon a hierarchical database structure, to crawl, parse, clean, and analyze vulnerability reports and their publicly …

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

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

Simulated Annealing For The Single-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey T. Widjaja, Pieter. Vansteenwegen Jul 2019

Simulated Annealing For The Single-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey T. Widjaja, Pieter. Vansteenwegen

Research Collection School Of Computing and Information Systems

This paper studies the Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) with the objective of simultaneously minimizing distribution and inventory costs for the customers and maximizing the collected rewards. A subset of customers is selected for the vehicle, including the quantity to be delivered to them. Simulated Annealing (SA) is proposed for solving the problem. Experimental results on 50 benchmark instances show that SA is comparable to the state-of-the-art algorithms. It is able to obtain 12 new best known solutions.

Go to article

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

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

Research Collection School Of Computing and Information Systems

Developing software often requires code changes that are widespread and applied to multiple locations.There are tools for Java that allow developers to specify patterns for program matching and source-to-source transformation. However, to our knowledge, none allows for transforming code based on its control-flow context. We prototype Coccinelle4J, an extension to Coccinelle, which is a program transformation tool designed for widespread changes in C code, in order to work on Java source code. We adapt Coccinelle to be able to apply scripts written in the Semantic Patch Language (SmPL), a language provided by Coccinelle, to Java source files. As a case …

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

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

A Closer Look Tells More: A Facial Distortion Based Liveness Detection For Face Authentication, Yan Li, Zilong Wang, Yingjiu Li, Robert H. Deng, Binbin Chen, Weizhi Meng, Hui Li Jul 2019

A Closer Look Tells More: A Facial Distortion Based Liveness Detection For Face Authentication, Yan Li, Zilong Wang, Yingjiu Li, Robert H. Deng, Binbin Chen, Weizhi Meng, Hui Li

Research Collection School Of Computing and Information Systems

Face authentication is vulnerable to media-based virtual face forgery (MVFF) where adversaries display photos/videos or 3D virtual face models of victims to spoof face authentication systems. In this paper, we propose a liveness detection mechanism, called FaceCloseup, to protect the face authentication on mobile devices. FaceCloseup detects MVFF-based attacks by analyzing the distortion of face regions in a user's closeup facial videos captured by built-in camera on mobile device. It can detect MVFF-based attacks with an accuracy of 99.48%.

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

Social Media Text Mining Framework For Drug Abuse: An Opioid Crisis Case Analysis, Tareq Nasralah Jul 2019

Social Media Text Mining Framework For Drug Abuse: An Opioid Crisis Case Analysis, Tareq Nasralah

Masters Theses & Doctoral Dissertations

Social media is considered as a promising and viable source of data for gaining insights into various disease conditions, patients’ attitudes and behaviors, and medications. The daily use of social media provides new opportunities for analyzing several aspects of communication. Social media as a big data source can be used to recognize communication and behavioral themes of problematic use of prescription drugs. Mining and analyzing such media have challenges and limitations with respect to topic deduction and data quality. There is a need for a structured approach to efficiently and effectively analyze social media content related to drug abuse in …

Go to article

Active-Passive Dynamic Consensus Filters For Linear Time-Invariant Multiagent Systems, J. Daniel Peterson, Tansel Yucelen, S. Jagannathan Jul 2019

Active-Passive Dynamic Consensus Filters For Linear Time-Invariant Multiagent Systems, J. Daniel Peterson, Tansel Yucelen, S. Jagannathan

Mechanical and Aerospace Engineering Faculty Research & Creative Works

Active-passive dynamic consensus filters consist of a group of agents, where a subset of these agents is able to observe a quantity of interest (i.e. active agents) and the rest are subject to no observations (i.e. passive agents). Specifically, the objective of these filters is that the states of all agents are required to converge to the weighted average of the set of observations sensed by the active agents. Existing active-passive dynamic consensus filters in the classical sense assume that all agents can be modeled as having single integrator dynamics, which may not always hold in practice. Motivating from this …

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

Distributed State Estimation By Using Active-Passive Sensor Networks, Akhilesh Raj, S. Jagannathan, Tansel Yucelen Jul 2019

Distributed State Estimation By Using Active-Passive Sensor Networks, Akhilesh Raj, S. Jagannathan, Tansel Yucelen

Electrical and Computer Engineering Faculty Research & Creative Works

This paper proposes a novel adaptive observer for heterogeneous sensor networks (HSNs) to estimate state vector of an unknown target or process by using the sensed output when the input to the target/process is also not known. In an HSN, nodes are considered either active or passive depending upon their ability to sense the target output. The local information exchange among the nodes is dictated by a connected graph. By using the criterion of collective observability, a novel distributed adaptive estimation is introduced where the nodes are allowed to have different sensor modalities. Stability analysis shows uniform ultimate boundedness of …

Go to article

Location Based Encryption, Tran Viet Xuan Phuong, Willy Susilo, Guomin Yang, Jun Yan, Dongxi Liu Jul 2019

Location Based Encryption, Tran Viet Xuan Phuong, Willy Susilo, Guomin Yang, Jun Yan, Dongxi Liu

Research Collection School Of Computing and Information Systems

We first propose a 2D Location Based Encryption (LBE) scheme, where the setting includes a geography center system and the 2D triangle area including the set of locations. A user joining in the system is provided with a pre-arranged key, which belongs to her/his location. If the user’s location is belonging to this area, he/she can decrypt the message. Our proposed scheme achieves a constant ciphertext size in encryption algorithm and decryption cost. Beyond the 2D-LBE scheme, we explore the 3D-LBE scheme; whereby the location is set up in the 3D dimensions. This proposed scheme is an extension of 2D-LBE …

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

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

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

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

A Network-Driven Approach For Characterizing Emoji Usage In Social Media, Seyed Mohammad Mahdi Seyednezhad Jul 2019

A Network-Driven Approach For Characterizing Emoji Usage In Social Media, Seyed Mohammad Mahdi Seyednezhad

Theses and Dissertations

With the rapid growth in the number of online users, people tend to use emojis to enrich their text with emotions. In this dissertation, after an overview of the previous studies on emojis, we provide a brief introduction to emojis and the way they are constructed by the Unicode codes points. Then, we extract the emojis from messages collected from Twitter in different topics. In the first step towards analyzing the emoji usage on social media, we created the directed weighted co-occurrence network of emojis for each topic. By analyzing these networks, we realized that emoji usage has a similar …

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

A Review On Swarm Intelligence And Evolutionary Algorithms For Solving Flexible Job Shop Scheduling Problems, Kaizhou Gao, Zhiguang Cao, Le Zhang, Zhenghua Chen, Yuyan Han, Quanke Pan Jul 2019

A Review On Swarm Intelligence And Evolutionary Algorithms For Solving Flexible Job Shop Scheduling Problems, Kaizhou Gao, Zhiguang Cao, Le Zhang, Zhenghua Chen, Yuyan Han, Quanke Pan

Research Collection School Of Computing and Information Systems

Flexible job shop scheduling problems (FJSP) have received much attention from academia and industry for many years. Due to their exponential complexity, swarm intelligence (SI) and evolutionary algorithms (EA) are developed, employed and improved for solving them. More than 60% of the publications are related to SI and EA. This paper intents to give a comprehensive literature review of SI and EA for solving FJSP. First, the mathematical model of FJSP is presented and the constraints in applications are summarized. Then, the encoding and decoding strategies for connecting the problem and algorithms are reviewed. The strategies for initializing algorithms? population …

Go to article

Deephunter: A Coverage-Guided Fuzz Testing Framework For Deep Neural Networks, Xiaofei Xie, Lei Ma, Felix Juefei-Xu, Minhui Xue, Hongxu Chen, Yang Liu, Jianjun Zhao, Bo Li, Jianxiong Yin, Simon See Jul 2019

Deephunter: A Coverage-Guided Fuzz Testing Framework For Deep Neural Networks, Xiaofei Xie, Lei Ma, Felix Juefei-Xu, Minhui Xue, Hongxu Chen, Yang Liu, Jianjun Zhao, Bo Li, Jianxiong Yin, Simon See

Research Collection School Of Computing and Information Systems

The past decade has seen the great potential of applying deep neural network (DNN) based software to safety-critical scenarios, such as autonomous driving. Similar to traditional software, DNNs could exhibit incorrect behaviors, caused by hidden defects, leading to severe accidents and losses. In this paper, we propose DeepHunter, a coverage-guided fuzz testing framework for detecting potential defects of general-purpose DNNs. To this end, we first propose a metamorphic mutation strategy to generate new semantically preserved tests, and leverage multiple extensible coverage criteria as feedback to guide the test generation. We further propose a seed selection strategy that combines both diversity-based …

Go to article

A Scalable Approach To Joint Cyber Insurance And Security-As-A-Service Provisioning In Cloud Computing, Jonathan David Chase, Dusit Niyato, Ping Wang, Sivadon Chaisiri, Ryan K. L. Ko Jul 2019

A Scalable Approach To Joint Cyber Insurance And Security-As-A-Service Provisioning In Cloud Computing, Jonathan David Chase, Dusit Niyato, Ping Wang, Sivadon Chaisiri, Ryan K. L. Ko

Research Collection School Of Computing and Information Systems

As computing services are increasingly cloud-based, corporations are investing in cloud-based security measures. The Security-as-a-Service (SECaaS) paradigm allows customers to outsource security to the cloud, through the payment of a subscription fee. However, no security system is bulletproof, and even one successful attack can result in the loss of data and revenue worth millions of dollars. To guard against this eventuality, customers may also purchase cyber insurance to receive recompense in the case of loss. To achieve cost effectiveness, it is necessary to balance provisioning of security and insurance, even when future costs and risks are uncertain. To this end, …

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

Personalized Fashion Recommendation With Visual Explanations Based On Multimodal Attention Network: Towards Visually Explainable Recommendation, Xu Chen, Hanxiong Chen, Hongteng Xu, Yongfeng Zhang, Yixin Cao, Zheng Qin, Hongyuan Zha Jul 2019

Personalized Fashion Recommendation With Visual Explanations Based On Multimodal Attention Network: Towards Visually Explainable Recommendation, Xu Chen, Hanxiong Chen, Hongteng Xu, Yongfeng Zhang, Yixin Cao, Zheng Qin, Hongyuan Zha

Research Collection School Of Computing and Information Systems

Fashion recommendation has attracted increasing attention from both industry and academic communities. This paper proposes a novel neural architecture for fashion recommendation based on both image region-level features and user review information. Our basic intuition is that: for a fashion image, not all the regions are equally important for the users, i.e., people usually care about a few parts of the fashion image. To model such human sense, we learn an attention model over many pre-segmented image regions, based on which we can understand where a user is really interested in on the image, and correspondingly, represent the image in …

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

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

Seven Hci Grand Challenges, C. Stephanidis, G. Salvendy, M. Antona, J. Chen, J. Dong, V. Duffy, X. Fang, C. Fidopiastis, G. Fragomeni, L. Fu, Y. Guo, D. Harris, A. Ioannou, K. Jeong, Keng Siau, H. Krömker, M. Kurosu, J.R. Lewis, A. Marcus, G. Meiselwitz Jul 2019

Seven Hci Grand Challenges, C. Stephanidis, G. Salvendy, M. Antona, J. Chen, J. Dong, V. Duffy, X. Fang, C. Fidopiastis, G. Fragomeni, L. Fu, Y. Guo, D. Harris, A. Ioannou, K. Jeong, Keng Siau, H. Krömker, M. Kurosu, J.R. Lewis, A. Marcus, G. Meiselwitz

Research Collection School Of Computing and Information Systems

This article aims to investigate the Grand Challenges which arise in the current and emerging landscape of rapid technological evolution towards more intelligent interactive technologies, coupled with increased and widened societal needs, as well as individual and collective expectations that HCI, as a discipline, is called upon to address. A perspective oriented to humane and social values is adopted, formulating the challenges in terms of the impact of emerging intelligent interactive technologies on human life both at the individual and societal levels. Seven Grand Challenges are identified and presented in this article: Human-Technology Symbiosis; Human-Environment Interactions; Ethics, Privacy and Security; …

Go to article

Use Of Mental Models And Cognitive Maps To Understand Students’ Learning Challenges, Zixing Shen, Songxin Tan, Keng Siau Jul 2019

Use Of Mental Models And Cognitive Maps To Understand Students’ Learning Challenges, Zixing Shen, Songxin Tan, Keng Siau

Research Collection School Of Computing and Information Systems

Mental models and cognitive maps have been used in college business education as an instructional design technique, assessment tool, and learning strategy. The authors propose a novel use of mental models and cognitive maps as a device to elicit students’ challenges in learning the domain knowledge of a course. Such usage is illustrated in a management information systems course. This student-focused approach can help instructor to better understand students’ learning challenges and enhance teaching effectiveness.

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

First Prev Next Last