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 5671 - 5700 of 8722
Full-Text Articles in Entire DC Network
Matchmaking Game Players On Public Transport, Nairan Zhang, Youngki Lee, Rajesh Krishna Balan
Matchmaking Game Players On Public Transport, Nairan Zhang, Youngki Lee, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
This paper extends our recent work, called GameOn, which presented a system for allowing public transport commuters to engage in multiplayer games with fellow commuters traveling on the same bus or train. An important challenge for GameOn is to group players with reliable connections into the same game. In this case, the meaning of reliability has two dimensions. First, the network connectivity (TCP, UDP etc.) should be robust. Second, the players should be collocated with each other for a sufficiently long duration so that a game session will not be terminated by players leaving the public transport modality such as …
Report On The Fg 2015 Video Person Recognition Evaluation, J.R. Beveridge, H. Zhang, B.A. Draper, P.J. Flynn, Z. Feng, P. Huber, J. Kittler, Zhiwu Huang, Li S., Li Y., M. Kan, R. Wang, S. Shan, X. Chen, Li H., G. Hua, V. Struc, J. Krizaj, C. Ding, D. Tao
Report On The Fg 2015 Video Person Recognition Evaluation, J.R. Beveridge, H. Zhang, B.A. Draper, P.J. Flynn, Z. Feng, P. Huber, J. Kittler, Zhiwu Huang, Li S., Li Y., M. Kan, R. Wang, S. Shan, X. Chen, Li H., G. Hua, V. Struc, J. Krizaj, C. Ding, D. Tao
Research Collection School Of Computing and Information Systems
This report presents results from the Video Person Recognition Evaluation held in conjunction with the 11th IEEE International Conference on Automatic Face and Gesture Recognition. Two experiments required algorithms to recognize people in videos from the Point-and-Shoot Face Recognition Challenge Problem (PaSC). The first consisted of videos from a tripod mounted high quality video camera. The second contained videos acquired from 5 different handheld video cameras. There were 1401 videos in each experiment of 265 subjects. The subjects, the scenes, and the actions carried out by the people are the same in both experiments. Five groups from around the world …
Thinking Bigger: Pushing Singaporean Entrepreneurship To The Next Level, Arcot Desai Narasimhalu
Thinking Bigger: Pushing Singaporean Entrepreneurship To The Next Level, Arcot Desai Narasimhalu
Research Collection School Of Computing and Information Systems
The environment in Singaporehas become more conducive forentrepreneurship. What lies aheadand what lessons can other Asiancountries learn?
Crowdsourcing With Tullock Contests: A New Perspective, Tie Luo, Salil S Kanhere, Hwee-Pink Tan, Fan Wu
Crowdsourcing With Tullock Contests: A New Perspective, Tie Luo, Salil S Kanhere, Hwee-Pink Tan, Fan Wu
Research Collection School Of Computing and Information Systems
Incentive mechanisms for crowdsourcing have been extensively studied under the framework of all-pay auctions. Along a distinct line, this paper proposes to use Tullock contests as an alternative tool to design incentive mechanisms for crowdsourcing. We are inspired by the conduciveness of Tullock contests to attracting user entry (yet not necessarily a higher revenue) in other domains. In this paper, we explore a new dimension in optimal Tullock contest design, by superseding the contest prize - which is fixed in conventional Tullock contests - with a prize function that is dependent on the (unknown) winner's contribution, in order to maximize …
Beyond Traits: Social Context Based Personality Model, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann
Beyond Traits: Social Context Based Personality Model, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann
Research Collection School Of Computing and Information Systems
The relation between individual’s personality and environmental context is a key issue in psychology, recently also in character simulations. This paper contributes to both domains by proposing a socio-cognitive, contextual personality model - a new voice in a century old problem of personality, but also an approach to simulating groups of more humanlike agents. After analyzing the influence of popularity of ‘trait personality models’ on psychology and computer simulation, we propose Social Context based Personality model - a continuation and specification of the Cognitive-Affective Personality System theory. The discussion, model and implementation are provided, followed by an example application in …
Phaseu: Real-Time Los Identification With Wifi, Chenshu Wu, Zheng Yang, Zimu Zhou, Kun Qian, Yunhao Liu, Mingyan Liu
Phaseu: Real-Time Los Identification With Wifi, Chenshu Wu, Zheng Yang, Zimu Zhou, Kun Qian, Yunhao Liu, Mingyan Liu
Research Collection School Of Computing and Information Systems
WiFi technology has fostered numerous mobile computing applications, such as adaptive communication, finegrained localization, gesture recognition, etc., which often achieve better performance or rely on the availability of Line-Of-Sight (LOS) signal propagation. Thus the awareness of LOS and NonLine-Of-Sight (NLOS) plays as a key enabler for them. Realtime LOS identification on commodity WiFi devices, however, is challenging due to limited bandwidth of WiFi and resulting coarse multipath resolution. In this work, we explore and exploit the phase feature of PHY layer information, harnessing both space diversity with antenna elements and frequency diversity with OFDM subcarriers. On this basis, we propose …
Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar
Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar
Research Collection School Of Computing and Information Systems
Detection of infeasible paths is required in many areas including test coverage analysis, test case generation, security vulnerability analysis, etc. Existing approaches typically use static analysis coupled with symbolic evaluation, heuristics, or path-pattern analysis. This paper is related to these approaches but with a different objective. It is to analyze code of real systems to build patterns of unsatisfiable constraints in infeasible paths. The resulting patterns can be used to detect infeasible paths without the use of constraint solver and evaluation of function calls involved, thus improving scalability. The patterns can be built gradually. Evaluation of the proposed approach shows …
Breaking The News: First Impressions Matter On Online News, Julio Reis, Fabr´Icio Benevenuto, Pedro Olmo, Raquel Prates, Haewoon Kwak, Jisun An
Breaking The News: First Impressions Matter On Online News, Julio Reis, Fabr´Icio Benevenuto, Pedro Olmo, Raquel Prates, Haewoon Kwak, Jisun An
Research Collection School Of Computing and Information Systems
A growing number of people are changing the way they consume news, replacing the traditional physical newspapers and magazines by their virtual online versions or/and weblogs. The interactivity and immediacy present in online news are changing the way news are being produced and exposed by media corporations. News websites have to create effective strategies to catch people’s attention and attract their clicks. In this paper we investigate possible strategies used by online news corporations in the design of their news headlines. We analyze the content of 69,907 headlines produced by four major global media corporations during a minimum of eight …
Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper introduces an automated approach called OSCAR that combines algorithm portfolios and online algorithm selection. The goal of algorithm portfolios is to construct a subset of algorithms with diverse problem solving capabilities. The portfolio is then used to select algorithms from for solving a particular (set of) instance(s). Traditionally, algorithm selection is usually performed in an offline manner and requires the need of domain knowledge about the target problem; while online algorithm selection techniques tend not to pay much attention to a careful construction of algorithm portfolios. By combining algorithm portfolios and online selection, our hope is to design …
Adviser: A Web-Based Algorithm Portfolio Deviser, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
Adviser: A Web-Based Algorithm Portfolio Deviser, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The basic idea of algorithm portfolio [1] is to create a mixture of diverse algorithms that complement each other’s strength so as to solve a diverse set of problem instances. Algorithm portfolios have taken on a new and practical meaning today with the wide availability of multi-core processors: from an enterprise perspective, the interest is to make best use of parallel machines within the organization by running different algorithms simultaneously on different cores to solve a given problem instance. Parallel execution of a portfolio of algorithms as suggested by [2, 3] a number of years …
Rclinker: Automated Linking Of Issue Reports And Commits Leveraging Rich Contextual Information, Tien-Duy B. Le, Mario Linares Vasquez, David Lo, Denys Poshyvanyk
Rclinker: Automated Linking Of Issue Reports And Commits Leveraging Rich Contextual Information, Tien-Duy B. Le, Mario Linares Vasquez, David Lo, Denys Poshyvanyk
Research Collection School Of Computing and Information Systems
Links between issue reports and their corresponding commits in version control systems are often missing. However, these links are important for measuring the quality of a software system, predicting defects, and many other tasks. Several approaches have been designed to solve this problem by automatically linking bug reports to source code commits via comparison of textual information in commit messages and bug reports. Yet, the effectiveness of these techniques is oftentimes suboptimal when commit messages are empty or contain minimum information; this particular problem makes the process of recovering traceability links between commits and bug reports particularly challenging. In this …
Predicting Bundles Of Spatial Locations From Learning Revealed Preference Data, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan
Predicting Bundles Of Spatial Locations From Learning Revealed Preference Data, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan
Research Collection School Of Computing and Information Systems
We propose the problem of predicting a bundle of goods, where the goods considered is a set of spatial locations that an agent wishes to visit. This typically arises in the tourism setting where attractions can often be bundled and sold as a package to visitors. While the problem of predicting future locations given the current and past trajectories is well-established, we take a radical approach by looking at it from an economic point of view. We view an agent's past trajectories as revealed preference (RP) data, where the choice of locations is a solution to an optimisation problem according …
Towards Practical Graph-Based Verification For An Object-Oriented Concurrency Model, Alexander Heußner, Christopher M. Poskitt, Claudio Corrodi, Benjamin Morandi
Towards Practical Graph-Based Verification For An Object-Oriented Concurrency Model, Alexander Heußner, Christopher M. Poskitt, Claudio Corrodi, Benjamin Morandi
Research Collection School Of Computing and Information Systems
To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformation system (GTS) based run-time semantics for SCOOP that grasps the most common features of all known semantics of …
Tlv: Abstraction Through Testing, Learning, And Validation, Jun Sun, Hao Xiao, Yang Liu, Shang-Wei Lin, Shengchao Qin
Tlv: Abstraction Through Testing, Learning, And Validation, Jun Sun, Hao Xiao, Yang Liu, Shang-Wei Lin, Shengchao Qin
Research Collection School Of Computing and Information Systems
A (Java) class provides a service to its clients (i.e., programs which use the class). The service must satisfy certain specifications. Different specifications might be expected at different levels of abstraction depending on the client's objective. In order to effectively contrast the class against its specifications, whether manually or automatically, one essential step is to automatically construct an abstraction of the given class at a proper level of abstraction. The abstraction should be correct (i.e., over-approximating) and accurate (i.e., with few spurious traces). We present an automatic approach, which combines testing, learning, and validation, to constructing an abstraction. Our approach …
Physio@Home: Exploring Visual Guidance And Feedback Techniques For Physiotherapy Exercises, Richard Tang, Xing-Dong Yang, Scott Bateman, Joaquim Jorge, Anthony Tang
Physio@Home: Exploring Visual Guidance And Feedback Techniques For Physiotherapy Exercises, Richard Tang, Xing-Dong Yang, Scott Bateman, Joaquim Jorge, Anthony Tang
Research Collection School Of Computing and Information Systems
Physiotherapy patients exercising at home alone are at risk of re-injury since they do not have corrective guidance from a therapist. To explore solutions to this problem, we designed Physio@Home, a prototype that guides people through pre-recorded physiotherapy exercises using realtime visual guides and multi-camera views. Our design addresses several aspects of corrective guidance, including: plane and range of movement, joint positions and angles, and extent of movement. We evaluated our design, comparing how closely people could follow exercise movements under various feedback conditions. Participants were most accurate when using our visual guide and multi-views. We provide suggestions for exercise …
Using Support Vector Machine Ensembles For Target Audience Classification On Twitter, Siaw Ling Lo, Raymond Chiong, David Cornforth
Using Support Vector Machine Ensembles For Target Audience Classification On Twitter, Siaw Ling Lo, Raymond Chiong, David Cornforth
Research Collection School Of Computing and Information Systems
The vast amount and diversity of the content shared on social media can pose a challenge for any business wanting to use it to identify potential customers. In this paper, our aim is to investigate the use of both unsupervised and supervised learning methods for target audience classification on Twitter with minimal annotation efforts. Topic domains were automatically discovered from contents shared by followers of an account owner using Twitter Latent Dirichlet Allocation (LDA). A Support Vector Machine (SVM) ensemble was then trained using contents from different account owners of the various topic domains identified by Twitter LDA. Experimental results …
Queuevadis: Queuing Analytics Using Smartphones, Tadashi Okoshii, Lu Yu, Chetna Vig, Youngki Lee, Rajesh Krishna Balan, Archan Misra
Queuevadis: Queuing Analytics Using Smartphones, Tadashi Okoshii, Lu Yu, Chetna Vig, Youngki Lee, Rajesh Krishna Balan, Archan Misra
Research Collection School Of Computing and Information Systems
We present QueueVadis, a system that addresses the problem of estimating, in real-time, the properties of queues at commonplace urban locations, such as coffee shops, taxi stands and movie theaters. Abjuring the use of any queuing-specific infrastructure sensors, QueueVadis uses participatory mobile sensing to detect both (i) the individual-level queuing episodes for any arbitrarily-shaped queue (by a characteristic locomotive signature of short bursts of "shuffling forward" between periods of "standing") and (ii) the aggregate-level queue properties (such as expected wait or service times) via appropriate statistical aggregation of multi-person data. Moreover, for venues where multiple queues are too close …
Cofaçade: A Customizable Assistive Approach For Elders And Their Helpers, Jason Chen Zhao, Richard Christopher Davis, Pin Sym Foong, Shengdong Zhao
Cofaçade: A Customizable Assistive Approach For Elders And Their Helpers, Jason Chen Zhao, Richard Christopher Davis, Pin Sym Foong, Shengdong Zhao
Research Collection School Of Computing and Information Systems
We present CoFaçade, a novel approach to helping elders reach their goals with IT products by working collaboratively with helpers. In this approach, the elder uses an interface with a small number of triggers, where each trigger is a single button (or card) that can execute a procedure. The helper uses a customization interface to link triggers to procedures that accomplish frequently-recurring high-level goals with IT products. Customization can be done either locally or remotely. We conducted an experiment to compare the CoFaçade approach with a baseline approach where helpers taught elders to perform IT tasks. Our results showed that …
Measuring User Influence, Susceptibility And Cynicalness In Sentiment Diffusion, Roy Ka-Wei Lee, Ee Peng Lim
Measuring User Influence, Susceptibility And Cynicalness In Sentiment Diffusion, Roy Ka-Wei Lee, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Diffusion in social networks is an important research topic lately due to massive amount of information shared on social media and Web. As information diffuses, users express sentiments which can affect the sentiments of others. In this paper, we analyze how users reinforce or modify sentiment of one another based on a set of inter-dependent latent user factors as they are engaged in diffusion of event information. We introduce these sentiment-based latent user factors, namely influence, susceptibility and cynicalness. We also propose the ISC model to relate the three factors together and develop an iterative computation approach to …
Markov Decision Processes With Applications In Wireless Sensor Networks: A Survey, Abu Mohammad Alsheikh, Dinh Thai Hoang, Dusit Niyato, Hwee-Pink Tan
Markov Decision Processes With Applications In Wireless Sensor Networks: A Survey, Abu Mohammad Alsheikh, Dinh Thai Hoang, Dusit Niyato, Hwee-Pink Tan
Research Collection School Of Computing and Information Systems
Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are used to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process …
Multi-Roles Affiliation Model For General User Profiling, Lizi Liao, Heyan Huang, Yashen Wang
Multi-Roles Affiliation Model For General User Profiling, Lizi Liao, Heyan Huang, Yashen Wang
Research Collection School Of Computing and Information Systems
Online social networks release user attributes, which is important for many applications. Due to the sparsity of such user attributes online, many works focus on profiling user attributes automatically. However, in order to profile a specific user attribute, an unique model is built and such model usually does not fit other profiling tasks. In our work, we design a novel, flexible general user profiling model which naturally models users’ friendships with user attributes. Experiments show that our method simultaneously profile multiple attributes with better performance.
Mobility Increases Localizability: A Survey On Wireless Indoor Localization Using Inertial Sensors, Zheng Yang, Chenshu Wu, Zimu Zhou, Xinglin Zhang, Xu Wang, Yunhao Liy
Mobility Increases Localizability: A Survey On Wireless Indoor Localization Using Inertial Sensors, Zheng Yang, Chenshu Wu, Zimu Zhou, Xinglin Zhang, Xu Wang, Yunhao Liy
Research Collection School Of Computing and Information Systems
Wireless indoor positioning has been extensively studied for the past two decades and continuously attracted growing research efforts in mobile computing context. As the integration of multiple inertial sensors (e.g., accelerometer, gyroscope, and magnetometer) to nowadays smartphones in recent years, human-centric mobility sensing is emerging and coming into vogue. Mobility information, as a new dimension in addition to wireless signals, can benefit localization in a number of ways, since location and mobility are by nature related in physical world. In this article, we survey this new trend of mobility enhancing smartphone-based indoor localization. Specifically, we first study how to measure …
Exploring Cyberbullying And Other Toxic Behavior In Team Competition Online Games, Haewoon Kwak, Jeremy Blackburn, Seungyeop. Han
Exploring Cyberbullying And Other Toxic Behavior In Team Competition Online Games, Haewoon Kwak, Jeremy Blackburn, Seungyeop. Han
Research Collection School Of Computing and Information Systems
In this work we explore cyberbullying and other toxic behavior in team competition online games. Using a dataset of over 10 million player reports on 1.46 million toxic players along with corresponding crowdsourced decisions, we test several hypotheses drawn from theories explaining toxic behavior. Besides providing large-scale, empirical based understanding of toxic behavior, our work can be used as a basis for building systems to detect, prevent, and counter-act toxic behavior.
Best Upgrade Plans For Single And Multiple Source-Destination Pairs, Yimin Lin, Kyriakos Mouratidis
Best Upgrade Plans For Single And Multiple Source-Destination Pairs, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper, we study Resource Constrained Best Upgrade Plan (BUP) computation in road network databases. Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. In the single-pair version of BUP, the input includes a source and a destination in G, and a budget B (resource constraint). The goal is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …
Review Selection Using Micro-Reviews, Thanh-Son Nguyen, Hady W. Lauw, Panayiotis Tsaparas
Review Selection Using Micro-Reviews, Thanh-Son Nguyen, Hady W. Lauw, Panayiotis Tsaparas
Research Collection School Of Computing and Information Systems
Given the proliferation of review content, and the fact that reviews are highly diverse and often unnecessarily verbose, users frequently face the problem of selecting the appropriate reviews to consume. Micro-reviews are emerging as a new type of online review content in the social media. Micro-reviews are posted by users of check-in services such as Foursquare. They are concise (up to 200 characters long) and highly focused, in contrast to the comprehensive and verbose reviews. In this paper, we propose a novel mining problem, which brings together these two disparate sources of review content. Specifically, we use coverage of micro-reviews …
Memory Dynamics In Attractor Networks, Guoqi Li, Kiruthika Ramanathan, Ning Ning, Luping Shi, Changyun Wen
Memory Dynamics In Attractor Networks, Guoqi Li, Kiruthika Ramanathan, Ning Ning, Luping Shi, Changyun Wen
Research Collection School Of Computing and Information Systems
As can be represented by neurons and their synaptic connections, attractor networks are widely believed to underlie biological memory systems and have been used extensively in recent years to model the storage and retrieval process of memory. In this paper, we propose a new energy function, which is nonnegative and attains zero values only at the desired memory patterns. An attractor network is designed based on the proposed energy function. It is shown that the desired memory patterns are stored as the stable equilibrium points of the attractor network. To retrieve a memory pattern, an initial stimulus input is presented …
Chalk And Cheese In Twitter: Discriminating Personal And Organization Accounts, Richard Jayadi Oentaryo, Jia-Wei Low, Ee Peng Lim
Chalk And Cheese In Twitter: Discriminating Personal And Organization Accounts, Richard Jayadi Oentaryo, Jia-Wei Low, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Social media have been popular not only for individuals to share contents, but also for organizations to engage users and spread information. Given the trait differences between personal and organization accounts, the ability to distinguish between the two account types is important for developing better search/recommendation engines, marketing strategies, and information dissemination platforms. However, such task is non-trivial and has not been well studied thus far. In this paper, we present a new generic framework for classifying personal and organization accounts, based upon which comprehensive and systematic investigation on a rich variety of content, social, and temporal features can be …
Students’ Perspectives On Flipped Classroom Implementation In Higher Education, Joelle Elmaleh, Nachamma Sockalingam
Students’ Perspectives On Flipped Classroom Implementation In Higher Education, Joelle Elmaleh, Nachamma Sockalingam
Research Collection School Of Computing and Information Systems
This paper reports students' experiences with a Flipped Classroom pedagogy model in an undergraduate programming course and suggests ways to improve the Flipped Classroom implementation.
Sensorem – An Efficient Mobile Platform For Wireless Sensor Network Visualization, Jin Ming Koh, Marcus Sak, Hwee Xian Tan, Huiguang Liang, Fachmin Folianto, Tony Quek
Sensorem – An Efficient Mobile Platform For Wireless Sensor Network Visualization, Jin Ming Koh, Marcus Sak, Hwee Xian Tan, Huiguang Liang, Fachmin Folianto, Tony Quek
Research Collection School Of Computing and Information Systems
No abstract provided.
Understanding The Test Automation Culture Of App Developers, Pavneet Singh Kochhar, Ferdian. Thung, Nachiappan Nagappan, Thomas Zimmermann, David Lo
Understanding The Test Automation Culture Of App Developers, Pavneet Singh Kochhar, Ferdian. Thung, Nachiappan Nagappan, Thomas Zimmermann, David Lo
Research Collection School Of Computing and Information Systems
Smartphone applications (apps) have gained popularity recently. Millions of smartphone applications (apps) are available on different app stores which gives users plethora of options to choose from, however, it also raises concern if these apps are adequately tested before they are released for public use. In this study, we want to understand the test automation culture prevalent among app developers. Specifically, we want to examine the current state of testing of apps, the tools that are commonly used by app developers, and the problems faced by them. To get an insight on the test automation culture, we conduct two different …