Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3441)
- Software Engineering (2143)
- Artificial Intelligence and Robotics (1664)
- Information Security (1056)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (921)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (178)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (53)
- Security (53)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Large Language Models (43)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 6511 - 6540 of 8479
Full-Text Articles in Computer Sciences
Virality And Susceptibility In Information Diffusions, Tuan-Anh Hoang, Ee Peng Lim
Virality And Susceptibility In Information Diffusions, Tuan-Anh Hoang, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Viral diffusion allows a piece of information to widely and quickly spread within the network of users through word-ofmouth. In this paper, we study the problem of modeling both item and user factors that contribute to viral diffusion in Twitter network. We identify three behaviorial factors, namely user virality, user susceptibility and item virality, that contribute to viral diffusion. Instead of modeling these factors independently as done in previous research, we propose a model that measures all the factors simultaneously considering their mutual dependencies. The model has been evaluated on both synthetic and real datasets. The experiments show that our …
Prioritized Shaping Of Models For Solving Dec-Pomdps, Pradeep Reddy Varakantham, William Yeoh, Prasanna Velagapudi, Paul Scerri
Prioritized Shaping Of Models For Solving Dec-Pomdps, Pradeep Reddy Varakantham, William Yeoh, Prasanna Velagapudi, Paul Scerri
Research Collection School Of Computing and Information Systems
An interesting class of multi-agent POMDP planning problems can be solved by having agents iteratively solve individual POMDPs, find interactions with other individual plans, shape their transition and reward functions to encourage good interactions and discourage bad ones and then recompute a new plan. D-TREMOR showed that this approach can allow distributed planning for hundreds of agents. However, the quality and speed of the planning process depends on the prioritization scheme used. Lower priority agents shape their models with respect to the models of higher priority agents. In this paper, we introduce a new prioritization scheme that is guaranteed to …
Distributed Path Authentication For Dynamic Rfid-Enabled Supply Chains, Shaoying Cai, Yingjiu Li, Yunlei Zhao
Distributed Path Authentication For Dynamic Rfid-Enabled Supply Chains, Shaoying Cai, Yingjiu Li, Yunlei Zhao
Research Collection School Of Computing and Information Systems
In this paper, we propose a distributed path authentication solution for dynamic RFID-enabled supply chains to address the counterfeiting problem. Compared to existing general anti-counterfeiting solutions, our solution requires non sharing of item-level RFID information among supply chain parties, thus eliminating the requirement on high network bandwidth and fine-grained access control. Our solution is secure, privacy-preserving, and practical. It leverages on the standard EPCglobal network to share information about paths and parties in path authentication. Our solution can be implemented on standard EPC class 1 generation 2 tags with only 720 bits storage and no computational capability.
Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis
Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Wireless data broadcasting is a promising technique for information dissemination that exploits the computational capabilities of mobile devices, in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may tune in the broadcast channel and process their queries locally without contacting the server. In this paper we focus on spatial queries in particular. First, we review existing methods on this topic. Next, taking shortest path computation as an example, we showcase technical challenges arising in this processing model and describe techniques …
Method And Apparatus For Rapid Identification Of Column Heterogeneity, Bing Tian Dai, Nikolaos Koudas, Beng Chin Ooi, Divesh Srivastava, Suresh Venkatasubranmanian
Method And Apparatus For Rapid Identification Of Column Heterogeneity, Bing Tian Dai, Nikolaos Koudas, Beng Chin Ooi, Divesh Srivastava, Suresh Venkatasubranmanian
Research Collection School Of Computing and Information Systems
A method and apparatus for rapid identification of column heterogeneity in databases are disclosed. For example, the method receives data associated with a column in a database. The method computes a cluster entropy for the data as a measure of data heterogeneity and then determines whether said data is heterogeneous in accordance with the cluster entropy.
Empirical Studies On Collaboration In Software Development: A Systematic Literature Review, Christoph Treude, Margaret-Anne Storey, Jens Weber
Empirical Studies On Collaboration In Software Development: A Systematic Literature Review, Christoph Treude, Margaret-Anne Storey, Jens Weber
Research Collection School Of Computing and Information Systems
Collaboration in software development is a complex is- sue that has been examined by various researchers over the last decade. This paper presents a systematic literature re- view of pertinent literature on empirical studies on collabo- rative software development. We found that a lot of progress has been achieved in the field of global or distributed de- velopment. While there are still many challenges, today's projects seem to have overcome at least some of those. Also, first steps have been made in understanding the collabora- tive aspects of requirements engineering and design. Re- search on tools for collaboration is advanced, …
Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis
Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Wireless data broadcasting is a promising technique for information dissemination that exploits the computational capabilities of mobile devices, in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may tune in the broadcast channel and process their queries locally without contacting the server. In this paper we focus on spatial queries in particular. First, we review existing methods on this topic. Next, taking shortest path computation as an example, we showcase technical challenges arising in this processing model and describe techniques …
Coercion Resistance In Authentication Responsibility Shifting, Payas Gupta, Xuhua Ding, Debin Gao
Coercion Resistance In Authentication Responsibility Shifting, Payas Gupta, Xuhua Ding, Debin Gao
Research Collection School Of Computing and Information Systems
Responsibility shifting, a popular solution used in the event of failure of primary authentication where a human helper is involved in regaining access, is vulnerable to coercion attacks. In this work, we report our user study which investigates the helper’s emotional status when being coerced to assist in an attack. Results show that the coercion causes involuntary skin conductance fluctuation on the helper, which indicates that he/she is nervous and stressed. This response can be used to strengthen the security of the authentication system by providing coercion resistance.
Pamr: Passive-Aggressive Mean Reversion Strategy For Portfolio Selection, Bin Li, Peilin Zhao, Steven C. H. Hoi, Vivekanand Gopalkrishnan
Pamr: Passive-Aggressive Mean Reversion Strategy For Portfolio Selection, Bin Li, Peilin Zhao, Steven C. H. Hoi, Vivekanand Gopalkrishnan
Research Collection School Of Computing and Information Systems
This project proposes a novel online portfolio selection strategy named ``Passive Aggressive Mean Reversion" (PAMR). Unlike traditional trend following approaches, the proposed approach relies upon the mean reversion relation of financial markets. Equipped with online passive aggressive learning technique from machine learning, the proposed portfolio selection strategy can effectively exploit the mean reversion property of markets. By analyzing PAMR's update scheme, we find that it nicely trades off between portfolio return and volatility risk and reflects the mean reversion trading principle. We also present several variants of PAMR algorithm, including a mixture algorithm which mixes PAMR and other strategies. We …
Spalendar: Visualizing A Group's Calendar Events Over A Geographic Space On A Public Display, Chen Xiang, Sebastian Boring, Sheelagh Carpendale, Anthony Tang, Saul Greenberg
Spalendar: Visualizing A Group's Calendar Events Over A Geographic Space On A Public Display, Chen Xiang, Sebastian Boring, Sheelagh Carpendale, Anthony Tang, Saul Greenberg
Research Collection School Of Computing and Information Systems
Portable paper calendars (i.e., day planners and organizers) have greatly influenced the design of group electronic calendars. Both use time units (hours/days/weeks/etc.) to organize visuals, with useful information (e.g., event types, locations, attendees) usually presented as - perhaps abbreviated or even hidden - text fields within those time units. The problem is that, for a group, this visual sorting of individual events into time buckets conveys only limited information about the social network of people. For example, people’s whereabouts cannot be read ‘at a glance’ but require examining the text. Our goal is to explore an alternate visualization that can …
Organizing User Search Histories, Heasoo Hwang, Hady W. Lauw, Lise Getoor, Alexandros Ntoulas
Organizing User Search Histories, Heasoo Hwang, Hady W. Lauw, Lise Getoor, Alexandros Ntoulas
Research Collection School Of Computing and Information Systems
Users are increasingly pursuing complex task-oriented goals on the web, such as making travel arrangements, managing finances, or planning purchases. To this end, they usually break down the tasks into a few codependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the web, search engines keep track of their queries and clicks while searching online. In this paper, we study the problem of organizing a user's historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups is helpful for a …
Vignette: Interactive Texture Design And Manipulation With Freeform Gestures For Pen-And-Ink Illustration, Rubaiat Habib Kazi, Takeo Igarashi, Shengdong Zhao, Richard C. Davis
Vignette: Interactive Texture Design And Manipulation With Freeform Gestures For Pen-And-Ink Illustration, Rubaiat Habib Kazi, Takeo Igarashi, Shengdong Zhao, Richard C. Davis
Research Collection School Of Computing and Information Systems
Vignette is an interactive system that facilitates texture creation in pen-and-ink illustrations. Unlike existing systems, Vignette preserves illustrators' workflow and style: users draw a fraction of a texture and use gestures to automatically fill regions with the texture. We currently support both 1D and 2D synthesis with stitching. Our system also has interactive refinement and editing capabilities to provide a higher level texture control, which helps artists achieve their desired vision. A user study with professional artists shows that Vignette makes the process of illustration more enjoyable and that first time users can create rich textures from scratch within minutes.
Student Usage Patterns And Perceptions For Differentiated Lab Exercises In An Undergraduate Programming Course, Heng Ngee Mok
Student Usage Patterns And Perceptions For Differentiated Lab Exercises In An Undergraduate Programming Course, Heng Ngee Mok
Research Collection School Of Computing and Information Systems
Differentiated instruction in the form of tiered take-home lab exercises was implemented for students of an undergraduate-level programming course. This paper attempts to uncover the perceptions and usage patterns of students toward these new lab exercises using a comprehensive survey. Findings reveal that these tiered exercises are generally very well received and preferred over their traditional "one size fits all" counter-parts. Although the study does not show that tiered exercises have improved proÞciency or scores, it does seem to indicate higher student engagement and motivation levels. Based on the survey results, a list of recommendations is put forth for the …
Expressive Cp-Abe With Partially Hidden Access Structures, Junzuo Lai, Robert H. Deng, Yingjiu Li
Expressive Cp-Abe With Partially Hidden Access Structures, Junzuo Lai, Robert H. Deng, Yingjiu Li
Research Collection School Of Computing and Information Systems
At Eurocrypt 2005, Sahai and Waters [7] introduced the concept of attribute-based encryption (ABE). ABE enables public key based one-to-many encryption and is envisioned as a promising cryptographic primitive for realizing scalable and fine-grained access control systems. There are two kinds of ABE schemes [1], key-policy ABE (KP-ABE) and ciphertext-policy ABE (CP-ABE) schemes. This paper, our concern is on the latter.
#Epicplay: Crowd-Sourcing Sports Video Highlights, Anthony Tang, Sebastian Boring
#Epicplay: Crowd-Sourcing Sports Video Highlights, Anthony Tang, Sebastian Boring
Research Collection School Of Computing and Information Systems
During a live sports event, many sports fans use social media as a part of their viewing experience, reporting on their thoughts on the event as it unfolds. In this work, we use this information stream to semantically annotate live broadcast sports games, using these annotations to select video highlights from the game. We demonstrate that this approach can be used to select highlights specific for fans of each team, and that these clips reflect the emotions of a fan during a game. Further, we describe how these clips differ from those seen on nightly sportscasts.
Setting Up A Low-Cost Lab Management System For A Multi-Purpose Computing Laboratory Using Virtualisation Technology, Heng Ngee Mok, Wee Kiat Tan
Setting Up A Low-Cost Lab Management System For A Multi-Purpose Computing Laboratory Using Virtualisation Technology, Heng Ngee Mok, Wee Kiat Tan
Research Collection School Of Computing and Information Systems
This paper describes how a generic computer laboratory equipped with 52 workstations is set up for teaching IT-related courses and other general purpose usage. The authors have successfully constructed a lab management system based on decentralised, client-side software virtualisation technology using Linux and free software tools from VMware that fulfils the requirements of fast "switch over" time between consecutive lab sessions, the ability to support a wide range of IT courses and usage scenarios, low cost, easy maintenance, and a sandboxed environment for potentially disruptive IT security lab exercises. Sufficient implementation details are provided so that readers can build a …
Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha
Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha
Research Collection School Of Computing and Information Systems
There is a significant body of empirical work on statistical de-anonymization attacks against databases containing micro-dataabout individuals, e.g., their preferences, movie ratings, or transactiondata. Our goal is to analytically explain why such attacks work. Specifically, we analyze a variant of the Narayanan-Shmatikov algorithm thatwas used to effectively de-anonymize the Netflix database of movie ratings. We prove theorems characterizing mathematical properties of thedatabase and the auxiliary information available to the adversary thatenable two classes of privacy attacks. In the first attack, the adversarysuccessfully identifies the individual about whom she possesses auxiliaryinformation (an isolation attack). In the second attack, the adversarylearns additional …
Structural Analysis In Multi-Relational Social Networks, Bing Tian Dai, Freddy Chong Tat Chua, Ee-Peng Lim
Structural Analysis In Multi-Relational Social Networks, Bing Tian Dai, Freddy Chong Tat Chua, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Modern social networks often consist of multiple relationsamong individuals. Understanding the structureof such multi-relational network is essential. In sociology,one way of structural analysis is to identify differentpositions and roles using blockmodels. In thispaper, we generalize stochastic blockmodels to GeneralizedStochastic Blockmodels (GSBM) for performing positionaland role analysis on multi-relational networks.Our GSBM generalizes many different kinds of MultivariateProbability Distribution Function (MVPDF) tomodel different kinds of multi-relational networks. Inparticular, we propose to use multivariate Poisson distributionfor multi-relational social networks. Our experimentsshow that GSBM is able to identify the structuresfor both synthetic and real world network data.These structures can further be used for predicting …
Obfuscating The Topical Intention In Enterprise Text Search, Hwee Hwa Pang, Xiaokui Xiao, Jialie Shen
Obfuscating The Topical Intention In Enterprise Text Search, Hwee Hwa Pang, Xiaokui Xiao, Jialie Shen
Research Collection School Of Computing and Information Systems
The text search queries in an enterprise can reveal the users' topic of interest, and in turn confidential staff or business information. To safeguard the enterprise from consequences arising from a disclosure of the query traces, it is desirable to obfuscate the true user intention from the search engine, without requiring it to be re-engineered. In this paper, we advocate a unique approach to profile the topics that are relevant to the user intention. Based on this approach, we introduce an (ε 1, ε 2)-privacy model that allows a user to stipulate that topics relevant to her intention …
Detecting Extreme Rank Anomalous Collections, Hanbo Dai, Feida Zhu, Ee-Peng Lim, Hwee Hwa Pang
Detecting Extreme Rank Anomalous Collections, Hanbo Dai, Feida Zhu, Ee-Peng Lim, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Anomaly or outlier detection has a wide range of applications, including fraud and spam detection. Most existing studies focus on detecting point anomalies, i.e., individual, isolated entities. However, there is an increasing number of applications in which anomalies do not occur individually, but in small collections. Unlike the majority, entities in an anomalous collection tend to share certain extreme behavioral traits. The knowledge essential in understanding why and how the set of entities becomes outliers would only be revealed by examining at the collection level. A good example is web spammers adopting common spamming techniques. To discover this kind of …
Motivated Learning For The Development Of Autonomous Agents, Janusz A. Starzyk, James T. Graham, Pawel Raif, Ah-Hwee Tan
Motivated Learning For The Development Of Autonomous Agents, Janusz A. Starzyk, James T. Graham, Pawel Raif, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
A new machine learning approach known as motivated learning (ML) is presented in this work. Motivated learning drives a machine to develop abstract motivations and choose its own goals. ML also provides a self-organizing system that controls a machine’s behavior based on competition between dynamically-changing pain signals. This provides an interplay of externally driven and internally generated control signals. It is demonstrated that ML not only yields a more sophisticated learning mechanism and system of values than reinforcement learning (RL), but is also more efficient in learning complex relations and delivers better performance than RL in dynamically changing environments. In …
Hasbe: A Hierarchical Attribute-Based Solution For Flexible And Scalable Access Control In Cloud Computing, Zhiguo Wan, Jun'e Liu, Robert H. Deng
Hasbe: A Hierarchical Attribute-Based Solution For Flexible And Scalable Access Control In Cloud Computing, Zhiguo Wan, Jun'e Liu, Robert H. Deng
Research Collection School Of Computing and Information Systems
Cloud computing has emerged as one of the most influential paradigms in IT industry in recent years. Since this new computing technology requires users to entrust their valuable data to cloud providers, there have been increasing security and privacy concerns on outsourced data. Several schemes employing attribute-based encryption (ABE) have been proposed for access control of outsourced data in cloud computing; however, most of them suffer from inflexibility in implementing complex access control policies. In order to realize scalable, flexible, and fine-grained access control of outsourced data in cloud computing, in this paper we propose hierarchical attribute-set-based encryption (HASBE) by …
Mining Social Dependencies In Dynamic Interaction Networks, Freddy Chong-Tat Chua, Hady W. Lauw, Ee Peng Lim
Mining Social Dependencies In Dynamic Interaction Networks, Freddy Chong-Tat Chua, Hady W. Lauw, Ee Peng Lim
Research Collection School Of Computing and Information Systems
User-to-user interactions have become ubiquitous in Web 2.0. Users exchange emails, post on newsgroups, tag web pages, co-author papers, etc. Through these interactions, users co-produce or co-adopt content items (e.g., words in emails, tags in social bookmarking sites). We model such dynamic interactions as a user interaction network, which relates users, interactions, and content items over time. After some interactions, a user may produce content that is more similar to those produced by other users previously. We term this effect social dependency, and we seek to mine from such networks the degree to which a user may be socially dependent …
Evaluation Of Different Electronic Product Code Discovery Service Models, Su Mon Kywe, Jie Shi, Yingjiu Li, Raghuwanshi Kailash
Evaluation Of Different Electronic Product Code Discovery Service Models, Su Mon Kywe, Jie Shi, Yingjiu Li, Raghuwanshi Kailash
Research Collection School Of Computing and Information Systems
Electronic Product Code Discovery Service (EPCDS) is an important concept in supply chain processes and in Internet of Things (IOT). It allows supply chain participants to search for their partners, communicate with them and share product information using standardized interfaces securely. Many researchers have been proposing different EPCDS models, considering different requirements. In this paper, we describe existing architecture designs of EPCDS systems, namely Directory Service Model, Query Relay Model and Aggregating Discovery Service Model (ADS). We also briefly mention Secure Discovery Service (SecDS) Model, which is an improved version of Directory Service Model with a secure attribute-based access control …
Scalable Activity-Travel Pattern Monitoring Framework For Large-Scale City Environment, Youngki Lee, Sangjeong Lee, Byoungjip Kim, Jungwoo Kim, Yunseok Rhee, Junehwa Song
Scalable Activity-Travel Pattern Monitoring Framework For Large-Scale City Environment, Youngki Lee, Sangjeong Lee, Byoungjip Kim, Jungwoo Kim, Yunseok Rhee, Junehwa Song
Research Collection School Of Computing and Information Systems
In this paper, we introduce Activity Travel Pattern (ATP) monitoring in a large-scale city environment. ATP represents where city residents and vehicles stay and how they travel around in a complex megacity. Monitoring ATP will incubate new types of value-added services such as predictive mobile advertisement, demand forecasting for urban stores, and adaptive transportation scheduling. To enable ATP monitoring, we develop ActraMon, a high-performance ATP monitoring framework. As a first step, ActraMon provides a simple but effective computational model of ATP and a declarative query language facilitating effective specification of various ATP monitoring queries. More important, ActraMon employs the shared …
Message Passing Algorithms For Map Estimation Using Dc Programming, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
Message Passing Algorithms For Map Estimation Using Dc Programming, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
Research Collection School Of Computing and Information Systems
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of difference of convex functions (DC) programming, and use the concave-convex procedure (CCCP) to develop efficient message-passing solvers. The resulting algorithms are guaranteed to converge to a global optimum of the well-studied local polytope, an outer bound on the MAP marginal polytope. To tighten the outer bound, we show how to combine it with the mean-field based inner bound and, again, solve it using CCCP. We also identify a useful relationship …
Hoare-Style Verification Of Graph Programs, Christopher M. Poskitt, Detlef Plump
Hoare-Style Verification Of Graph Programs, Christopher M. Poskitt, Detlef Plump
Research Collection School Of Computing and Information Systems
GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction. In particular, GP frees programmers from dealing with low-level data structures. In this paper, we present a Hoare-style proof system for verifying the partial correctness of (a subset of) graph programs. The pre- and postconditions of the calculus are nested graph conditions with expressions, a formalism for specifying both structural graph properties and properties of labels. We show that our proof system is sound with …
Boosting Web Video Categorization With Contextual Information From Social Web, Xiao Wu, Chong-Wah Ngo, Yi-Ming Zhu, Qiang Peng
Boosting Web Video Categorization With Contextual Information From Social Web, Xiao Wu, Chong-Wah Ngo, Yi-Ming Zhu, Qiang Peng
Research Collection School Of Computing and Information Systems
Web video categorization is a fundamental task for web video search. In this paper, we explore web video categorization from a new perspective, by integrating the model-based and data-driven approaches to boost the performance. The boosting comes from two aspects: one is the performance improvement for text classifiers through query expansion from related videos and user videos. The model-based classifiers are built based on the text features extracted from title and tags. Related videos and user videos act as external resources for compensating the shortcoming of the limited and noisy text features. Query expansion is adopted to reinforce the classification …
Dynamic Lookahead Mechanism For Conserving Power In Multi-Player Mobile Games, Karthik Thirugnanam, Bhojan Anand, Jeena Sebastian, Pravein Kannan, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan
Dynamic Lookahead Mechanism For Conserving Power In Multi-Player Mobile Games, Karthik Thirugnanam, Bhojan Anand, Jeena Sebastian, Pravein Kannan, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan
Research Collection School Of Computing and Information Systems
As the current generation of mobile smartphones become more powerful, they are being used to perform more resource intensive tasks making battery lifetime a major bottleneck. In this paper, we present a technique called dynamic AoV lookahead for reducing wireless interface power consumption up to 50% while playing a popular, yet resource intensive, mobile multiplayer games.
Quality And Leniency In Online Collaborative Rating Systems, Hady W. Lauw, Ee Peng Lim, Ke Wang
Quality And Leniency In Online Collaborative Rating Systems, Hady W. Lauw, Ee Peng Lim, Ke Wang
Research Collection School Of Computing and Information Systems
The emerging trend of social information processing has resulted in Web users’ increased reliance on user-generated content contributed by others for information searching and decision making. Rating scores, a form of user-generated content contributed by reviewers in online rating systems, allow users to leverage others’ opinions in the evaluation of objects. In this article, we focus on the problem of summarizing the rating scores given to an object into an overall score that reflects the object’s quality. We observe that the existing approaches for summarizing scores largely ignores the effect of reviewers exercising different standards in assigning scores. Instead of …