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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 5581 - 5610 of 8597

Full-Text Articles in Entire DC Network

Non-Invasive Detection Of Moving And Stationary Human With Wifi, Chenshu Wu, Zheng Yang, Zimu Zhou, Xuefeng Liu, Yunhao Liu, Jiannong Cao May 2015

Non-Invasive Detection Of Moving And Stationary Human With Wifi, Chenshu Wu, Zheng Yang, Zimu Zhou, Xuefeng Liu, Yunhao Liu, Jiannong Cao

Research Collection School Of Computing and Information Systems

Non-invasive human sensing based on radio signals has attracted a great deal of research interest and fostered a broad range of innovative applications of localization, gesture recognition, smart health-care, etc., for which a primary primitive is to detect human presence. Previous works have studied the detection of moving humans via signal variations caused by human movements. For stationary people, however, existing approaches often employ a prerequisite scenario-tailored calibration of channel profile in human-free environments. Based on in-depth understanding of human motion induced signal attenuation reflected by PHY layer channel state information (CSI), we propose DeMan, a unified scheme for non-invasive …

Go to article

Relative Localization Of Rfid Tags Using Spatial-Temporal Phase Profiling, Longfei Shangguan, Zheng Yang, Alex X. Liu, Zimu Zhou, Yunhao Liu May 2015

Relative Localization Of Rfid Tags Using Spatial-Temporal Phase Profiling, Longfei Shangguan, Zheng Yang, Alex X. Liu, Zimu Zhou, Yunhao Liu

Research Collection School Of Computing and Information Systems

Many object localization applications need the relative locations of a set of objects as oppose to their absolute locations. Although many schemes for object localization using Radio Frequency Identification (RFID) tags have been proposed, they mostly focus on absolute object localization and are not suitable for relative object localization because of large error margins and the special hardware that they require. In this paper, we propose an approach called Spatial-Temporal Phase Profiling (STPP) to RFID based relative object localization. The basic idea of STPP is that by moving a reader over a set of tags during which the reader continuously …

Go to article

Self-Organizing Neural Networks Integrating Domain Knowledge And Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Jacek M. Zurada May 2015

Self-Organizing Neural Networks Integrating Domain Knowledge And Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Jacek M. Zurada

Research Collection School Of Computing and Information Systems

The use of domain knowledge in learning systems is expected to improve learning efficiency and reduce model complexity. However, due to the incompatibility with knowledge structure of the learning systems and real-time exploratory nature of reinforcement learning (RL), domain knowledge cannot be inserted directly. In this paper, we show how self-organizing neural networks designed for online and incremental adaptation can integrate domain knowledge and RL. Specifically, symbol-based domain knowledge is translated into numeric patterns before inserting into the self-organizing neural networks. To ensure effective use of domain knowledge, we present an analysis of how the inserted knowledge is used by …

Go to article

Ambient Rendezvous: Energy Efficient Neighbor Discovery Via Acoustic Sensing, Keyu Wang, Zheng Yang, Zimu Zhou, Yunhao Liu, Lionel M. Ni May 2015

Ambient Rendezvous: Energy Efficient Neighbor Discovery Via Acoustic Sensing, Keyu Wang, Zheng Yang, Zimu Zhou, Yunhao Liu, Lionel M. Ni

Research Collection School Of Computing and Information Systems

The continual proliferation of mobile devices has stimulated the development of opportunistic encounter-based networking and has spurred a myriad of proximity-based mobile applications. A primary cornerstone of such applications is to discover neighboring devices effectively and efficiently. Despite extensive protocol optimization, current neighbor discovery modalities mainly rely on radio interfaces, whose energy and wake up delay required to initiate, configure and operate these protocols hamper practical applicability. Unlike conventional schemes that actively emit radio tones, we exploit ubiquitous audio events to discover neighbors passively. The rationale is that spatially adjacent neighbors tend to share similar ambient acoustic environments. We propose …

Go to article

A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger May 2015

A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value …

Go to article

Discovering The Rise And Fall Of Software Engineering Ideas From Scholarly Publication Data, Subhajit Datta, Santonu Sarkar, Sajeev A. S. M., Nishant Kumar May 2015

Discovering The Rise And Fall Of Software Engineering Ideas From Scholarly Publication Data, Subhajit Datta, Santonu Sarkar, Sajeev A. S. M., Nishant Kumar

Research Collection School Of Computing and Information Systems

For researchers and practitioners of a relatively young discipline like software engineering, an enduring concern is to identify the acorns that will grow into oaks -- ideas remaining most current in the long run. Additionally, it is interesting to know how the ideas have risen in importance, and fallen, perhaps to rise again. We analyzed a corpus of 19,000+ papers written by 21,000+ authors across 16 software engineering publication venues from 1975 to 2010, to empirically determine the half-life of software engineering research topics. We adapted existing measures of half-life as well as defined a specific measure based on publication …

Go to article

Active Semi-Supervised Defect Categorization, Ferdian Thung, Xuan-Bach D. Le, David Lo May 2015

Active Semi-Supervised Defect Categorization, Ferdian Thung, Xuan-Bach D. Le, David Lo

Research Collection School Of Computing and Information Systems

Defects are inseparable part of software development and evolution. To better comprehend problems affecting a software system, developers often store historical defects and these defects can be categorized into families. IBM proposes Orthogonal Defect Categorization (ODC) which include various classifications of defects based on a number of orthogonal dimensions (e.g., symptoms and semantics of defects, root causes of defects, etc.). To help developers categorize defects, several approaches that employ machine learning have been proposed in the literature. Unfortunately, these approaches often require developers to manually label a large number of defect examples. In practice, manually labelling a large number of …

Go to article

Advances In Knowledge Discovery And Data Mining Part Ii, Tru Cao, Ee Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda May 2015

Advances In Knowledge Discovery And Data Mining Part Ii, Tru Cao, Ee Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Advances In Knowledge Discovery And Data Mining: 19th Pacific-Asia Conference, Pakdd 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part I, Tru Cao, Ee-Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda May 2015

Advances In Knowledge Discovery And Data Mining: 19th Pacific-Asia Conference, Pakdd 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part I, Tru Cao, Ee-Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Solving Multi-Vehicle Profitable Tour Problem Via Knowledge Adoption In Evolutionary Bi-Level Programming, Stephanus Daniel Handoko, Abhishek Gupta, Chen Kim Heng, Hoong Chuin Lau, Yew Soon Ong, Puay Siew Tan May 2015

Solving Multi-Vehicle Profitable Tour Problem Via Knowledge Adoption In Evolutionary Bi-Level Programming, Stephanus Daniel Handoko, Abhishek Gupta, Chen Kim Heng, Hoong Chuin Lau, Yew Soon Ong, Puay Siew Tan

Research Collection School Of Computing and Information Systems

Profitable tour problem (PTP) belongs to the class of vehicle routing problem (VRP) with profits seeking to maximize the difference between the total collected profit and the total cost incurred. Traditionally, PTP involves single vehicle. In this paper, we consider PTP with multiple vehicles. Unlike the classical VRP that seeks to serve all customers, PTP involves the strategic-level customer selection so as to maximize the total collected profit and the operational-level route optimization to minimize the total cost incurred. Therefore, PTP is essentially the knapsack problem at the strategic level with VRP at the operational level. That means the evolutionary …

Go to article

Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu May 2015

Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu

Research Collection School Of Computing and Information Systems

In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with the network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of …

Go to article

Flutcha: Using Fluency To Distinguish Humans From Computers, Kotaro Hara, Mohammad Taghi Hajiaghayi, Benjamin B. Benderson May 2015

Flutcha: Using Fluency To Distinguish Humans From Computers, Kotaro Hara, Mohammad Taghi Hajiaghayi, Benjamin B. Benderson

Research Collection School Of Computing and Information Systems

Improvements in image understanding technologies aremaking it possible for computers to pass traditionalCAPTCHA tests with high probability. This suggests theneed for new kinds of tasks that are easy to accomplishfor humans but remain difficult for computers. In thispaper, we introduce Fluency CAPTCHA (FluTCHA), anovel method to distinguish humans from computersusing the fact that humans are better than machines atimproving the fluency of sentences. We propose a wayto let users work on FluTCHA tests and simultaneouslycomplete useful linguistic tasks. Evaluation studiesdemonstrate the feasibility of using FluTCHA todistinguish humans from computers.

Go to article

Electronic Contract Signing Without Using Trusted Third Party, Zhiguo Wan, Robert H. Deng, David Kuo Chuen Lee May 2015

Electronic Contract Signing Without Using Trusted Third Party, Zhiguo Wan, Robert H. Deng, David Kuo Chuen Lee

Research Collection School Of Computing and Information Systems

Electronic contract signing allows two potentially dis-trustful parties to digitally sign an electronic document “simultaneously” across a network. Existing solutions for electronic contract signing either require the involvement of a trusted third party (TTP), or are complex and expensive in communication and computation. In this paper we propose an electronic contract signing protocol between two parties with the following advantages over existing solutions: 1) it is practical and scalable due to its simplicity and high efficiency; 2) it does not require any trusted third party as the mediator; and 3) it guarantees fairness between the two signing parties. We achieve …

Go to article

Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau May 2015

Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We address the problem of crowd congestion at venues like theme parks, museums and world expos by providing route guidance to multiple selfish users (with budget constraints) moving through the venue simultaneously. To represent these settings, we introduce the Selfish Orienteering Problem (SeOP) that combines two well studied problems from literature, namely Orienteering Problem (OP) and Selfish Routing (SR). OP is a single agent routing problem where the goal is to minimize latency (or maximize reward) in traversing a subset of nodes while respecting budget constraints. SR is a game between selfish agents looking for minimum latency routes from source …

Go to article

Multi-Agent Task Assignment For Mobile Crowdsourcing Under Trajectory Uncertainties, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra May 2015

Multi-Agent Task Assignment For Mobile Crowdsourcing Under Trajectory Uncertainties, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra

Research Collection School Of Computing and Information Systems

In this work, we investigate the problem of mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually browse and filter tasks to perform, we intend to automatically make task recommendations based on workers' historical trajectories and desired time budgets. However, predicting workers' trajectories is inevitably faced with uncertainties, as no one will take exactly the same route every day; yet such uncertainties are oftentimes abstracted away in the known literature. In this work, we depart from the deterministic modeling and study the stochastic task recommendation problem where …

Go to article

Moving Average Reversion Strategy For On-Line Portfolio Selection, Bin Li, Steven C. H. Hoi, Doyen Sahoo, Zhi-Yong Liu May 2015

Moving Average Reversion Strategy For On-Line Portfolio Selection, Bin Li, Steven C. H. Hoi, Doyen Sahoo, Zhi-Yong Liu

Research Collection School Of Computing and Information Systems

On-line portfolio selection, a fundamental problem in computational finance, has attracted increasing interest from artificial intelligence and machine learning communities in recent years. Empirical evidence shows that stock's high and low prices are temporary and stock prices are likely to follow the mean reversion phenomenon. While existing mean reversion strategies are shown to achieve good empirical performance on many real datasets, they often make the single-period mean reversion assumption, which is not always satisfied, leading to poor performance in certain real datasets. To overcome this limitation, this article proposes a multiple-period mean reversion, or so-called "Moving Average Reversion" (MAR), and …

Go to article

Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen May 2015

Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen

Research Collection School Of Computing and Information Systems

Reverse k nearest neighbor (RkNN) queries have a broad application base such as decision support, profile-based marketing, and resource allocation. Previous work on RkNN search does not take textual information into consideration or limits to the Euclidean space. In the real world, however, most spatial objects are associated with textual information and lie on road networks. In this paper, we introduce a new type of queries, namely, reverse top-k Boolean spatial keyword (RkBSK) retrieval, which assumes objects are on the road network and considers both spatial and textual information. Given a data set P on a road network and a …

Go to article

Elblocker: Predicting Blocking Bugs With Ensemble Imbalance Learning, Xin Xia, David Lo, Emad Shihab, Xinyu Wang, Xiaohu Yang May 2015

Elblocker: Predicting Blocking Bugs With Ensemble Imbalance Learning, Xin Xia, David Lo, Emad Shihab, Xinyu Wang, Xiaohu Yang

Research Collection School Of Computing and Information Systems

Context: Blocking bugs are bugs that prevent other bugs from being fixed. Previous studies show that blocking bugs take approximately two to three times longer to be fixed compared to non-blocking bugs. Objective: Thus, automatically predicting blocking bugs early on so that developers are aware of them, can help reduce the impact of or avoid blocking bugs. However, a major challenge when predicting blocking bugs is that only a small proportion of bugs are blocking bugs, i.e., there is an unequal distribution between blocking and non-blocking bugs. For example, in Eclipse and OpenOffice, only 2.8% and 3.0% bugs are blocking …

Go to article

Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham May 2015

Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Next generation of smart grids face a number of challenges including co-generation from intermittent renewable power sources, a shift away from monolithic control due to increased market deregulation, and robust operation in the face of disasters. Such heterogeneous nature and high operational readiness requirement of smart grids necessitates decentralized control for critical tasks such as power supply restoration (PSR) after line failures. We present a novel multiagent system based approach for PSR using Lagrangian dual decomposition. Our approach works on general graphs, provides provable quality-bounds and requires only local message-passing among different connected sub-regions of a smart grid, enabling decentralized …

Go to article

Gameon: P2p Gaming On Public Transport, Nairan Zhang, Youngki Lee, Meera Radhakrishnan, Rajesh Krishna Balan May 2015

Gameon: P2p Gaming On Public Transport, Nairan Zhang, Youngki Lee, Meera Radhakrishnan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Mobile games, and especially multiplayer games are a very popular daily distraction for many users. We hypothesise that commuters travelling on public buses or trains would enjoy being able to play multiplayer games with their fellow commuters to alleviate the commute burden and boredom. We present quantitative data to show that the typical one-way commute time is fairly long (at least 25 minutes on average) as well as survey results indicating that commuters are willing to play multiplayer games with other random commuters. In this paper, we present GameOn, a system that allows commuters to participate in multiplayer games with …

Go to article

Map: A Computational Model For Adaptive Persuasion, Yilin Kang, Ah-Hwee Tan May 2015

Map: A Computational Model For Adaptive Persuasion, Yilin Kang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

While a variety of persuasion agents have been created and applied in different domains such as marketing, military training and health industry, there is a lack of a model which provides a unified framework for different persuasion strategies. Specifically, persuasion is not adaptable to the individuals’ personal states in different situations. Grounded in the Elaboration Likelihood Model (ELM), this paper presents a computational model called Model for Adaptive Persuasion (MAP) for virtual agents. MAP is a semi-connected network model which enables an agent to adapt its persuasion strategies through feedback. We have implemented and evaluated a MAP-based virtual nurse agent …

Go to article

Tasknav: Task-Based Navigation Of Software Documentation, Christoph Treude, Mathieu Sicard, Marc Klocke, Martin P. Robillard May 2015

Tasknav: Task-Based Navigation Of Software Documentation, Christoph Treude, Mathieu Sicard, Marc Klocke, Martin P. Robillard

Research Collection School Of Computing and Information Systems

To help developers navigate documentation, we introduce Task Nav, a tool that automatically discovers and indexes task descriptions in software documentation. With Task Nav, we conceptualize tasks as specific programming actions that have been described in the documentation. Task Nav presents these extracted task descriptions along with concepts, code elements, and section headers in an auto-complete search interface. Our preliminary evaluation indicates that search results identified through extracted task descriptions are more helpful to developers than those found through other means, and that they help bridge the gap between documentation structure and the information needs of software developers. Video: https://www.youtube.com/watch?v=opnGYmMGnqY.

Go to article

Characterizing Silent Users In Social Media Communities, Wei Gong, Ee-Peng Lim, Feida Zhu May 2015

Characterizing Silent Users In Social Media Communities, Wei Gong, Ee-Peng Lim, Feida Zhu

Research Collection School Of Computing and Information Systems

Silent users often constitute a significant proportion of an online user-generated content system. In the context of social media such as Twitter, users can opt to be silent all or most of the time. They are often called the invisible participants or lurkers. As lurkers contribute little to the online content, existing analysis often overlooks their presence and voices. However, we argue that understanding lurkers is important in many applications such as recommender systems, targeted advertising, and social sensing. This research therefore seeks to characterize lurkers in social media and propose methods to profile them. We examine 18 weeks of …

Go to article

Matchmaking Game Players On Public Transport, Nairan Zhang, Youngki Lee, Rajesh Krishna Balan May 2015

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 …

Go to article

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 May 2015

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 …

Go to article

Crowdsourcing With Tullock Contests: A New Perspective, Tie Luo, Salil S Kanhere, Hwee-Pink Tan, Fan Wu May 2015

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 …

Go to article

Beyond Traits: Social Context Based Personality Model, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann May 2015

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 …

Go to article

Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar May 2015

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 …

Go to article

Breaking The News: First Impressions Matter On Online News, Julio Reis, Fabr´Icio Benevenuto, Pedro Olmo, Raquel Prates, Haewoon Kwak, Jisun An May 2015

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 …

Go to article

Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau May 2015

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 …

Go to article

First Prev Next Last