Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8526)
- Computer Sciences (8509)
- Databases and Information Systems (3448)
- Software Engineering (2153)
- Artificial Intelligence and Robotics (1686)
-
- Information Security (1060)
- Numerical Analysis and Scientific Computing (1024)
- Graphics and Human Computer Interfaces (926)
- Engineering (887)
- Social and Behavioral Sciences (681)
- Business (641)
- Theory and Algorithms (493)
- Computer Engineering (450)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (178)
- Education (168)
- Management Information Systems (166)
- Data Storage Systems (161)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (107)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (71)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (53)
- Visualization (51)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Task analysis (48)
- Anomaly detection (47)
- Twitter (46)
- Feature extraction (45)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 6901 - 6930 of 8567
Full-Text Articles in Entire DC Network
Understanding Gender Differences In Media Perceptions: A Comparison Of 2d Versus 3d Media, Fiona Fui-Hoon Nah, David Dewester, Brenda Eschenbrenner
Understanding Gender Differences In Media Perceptions: A Comparison Of 2d Versus 3d Media, Fiona Fui-Hoon Nah, David Dewester, Brenda Eschenbrenner
Research Collection School Of Computing and Information Systems
We examine gender differences in 2D versus 3D media perceptions. Using the Hunter-Gatherer Theory of Spatial Gender Differences and Jung’s Theory of Psychological Types, we hypothesize differences in men’s and women’s perceptions of skill, challenge, telepresence, and satisfaction with online experiences in 2D versus 3D media interaction. The findings suggest that even though women perceive lower skill levels and greater challenges in using 2D and 3D media than men, women’s sense of telepresence is higher than men in both 2D and 3D media. Women are also more satisfied with their interaction in 2D and 3D media than men.
Enhancing Brand Equity Through Flow: Comparison Of 2d Versus 3d Virtual World, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, David Dewester
Enhancing Brand Equity Through Flow: Comparison Of 2d Versus 3d Virtual World, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, David Dewester
Research Collection School Of Computing and Information Systems
This research uses the theory of flow to examine the effect of 2D versus 3D virtual world environments on brand equity and use intention. The results suggest that a 3D virtual world environment has both positive (indirect) and negative (direct) effects on brand equity. The positive, indirect effect of the 3D virtual world environment occurs through feelings of telepresence and enjoyment, both of which contribute positively to brand equity and, in turn, induces a higher behavioral intention. The negative, direct effect can be explained using distraction-conflict theory, where attentional conflict is faced by users of a highly interactive and rich …
Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner
Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner
Research Collection School Of Computing and Information Systems
There are various reader/tag authentication protocols proposed for the security of RFID systems. Such a protocol normally contains several rounds of conversations between a tag and a reader and involves cryptographic operations at both reader and tag sides. Currently there is a lack of benchmarks that provide a fair comparison platform for (a) the time cost of cryptographic operations at the tag side and (b) the time cost of data exchange between a reader and a tag, making it impossible to evaluate the total time cost for executing a protocol. Based on our experiments implemented on IAIK UHF tag emulators …
Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan
Dynamic Group Key Exchange Revisited, Guomin Yang, Chik How Tan
Research Collection School Of Computing and Information Systems
In a dynamic group key exchange protocol, besides the basic group setup protocol, there are also a join protocol and a leave protocol, which allow the membership of an existing group to be changed more efficiently than rerunning the group setup protocol. The join and leave protocols should ensure that the session key is updated upon every membership change so that the subsequent sessions are protected from leaving members (backward security) and the previous sessions are protected from joining members (forward security). In this paper, we present a new security model for dynamic group key exchange. Comparing to existing models, …
Sequence Alignment Based Analysis Of Player Behavior In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava
Sequence Alignment Based Analysis Of Player Behavior In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
This study proposes a sequence alignment-based behavior analysis framework (SABAF) developed for predicting inactive game players that either leave the game permanently or stop playing the game for a long period of time. Sequence similarity scores and derived statistics form profile databases of inactive players and active players from the past. SABAF uses global and local sequence alignment algorithms and a unique scoring scheme to measure similarity between activity sequences. SABAF is tested on the game player activity data of Ever Quest II, a popular massively multiplayer online role-playing game developed by Sony Online Entertainment. SABAF consists of the following …
Toward Effective Concept Representation In Decision Support To Improve Patient Safety, Tze-Yun Leong
Toward Effective Concept Representation In Decision Support To Improve Patient Safety, Tze-Yun Leong
Research Collection School Of Computing and Information Systems
Patient safety is an emerging, major health care discipline with significance accentuated in the influential Institute of Medicine (IOM) reports in the United States “To Err is Human” and “Crossing the Quality Chasm”. These reports highlighted the danger and prevalence of medical errors and preventable adverse events, explained the three main sources of system-related, human factors-related and cognitive-related errors, and recommended the use of information and decision support technologies to help alleviate the problem. A number of studies and reports from all over the world with similar findings have since followed, culminating in the 55th World Health Assembly Resolution on …
A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang
A Multi-User Steganographic File System On Untrusted Shared Storage, Jin Han, Meng Pan, Debin Gao, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Existing steganographic file systems enable a user to hide the existence of his secret data by claiming that they are (static) dummy data created during disk initialization. Such a claim is plausible if the adversary only sees the disk content at the point of attack. In a multi-user computing environment that employs untrusted shared storage, however, the adversary could have taken multiple snapshots of the disk content over time. Since the dummy data are static, the differences across snapshots thus disclose the locations of user data, and could even reveal the user passwords. In this paper, we introduce a Dummy-Relocatable …
3-D Virtual World Education: An Empirical Comparison With Face-To-Face Classroom, Xiaofeng Chen, Keng Siau, Fiona Fui-Hoon Nah
3-D Virtual World Education: An Empirical Comparison With Face-To-Face Classroom, Xiaofeng Chen, Keng Siau, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
3-D virtual worlds are increasing in popularity as a means of pedagogical delivery in higher education. In this research, we assess the relative effectiveness of a 3-D virtual world learning environment, Second Life, and traditional face-to-face learning environment. We also assess the efficacy of instructional strategies in these two learning environments and their effects on interactivity, perceived learning, and satisfaction. Our findings suggest that there is an interaction effect of learning environment and instructional strategy. Pair-wise comparisons indicate that when interactive instructional strategy is used, there is no significant difference for perceived learning and satisfaction between 3-D virtual world and …
A Structure First Image Inpainting Approach Based On Self-Organizing Map (Som), Bo Chen, Zhaoxia Wang, Ming Bai, Quan Wang, Zhen Sun
A Structure First Image Inpainting Approach Based On Self-Organizing Map (Som), Bo Chen, Zhaoxia Wang, Ming Bai, Quan Wang, Zhen Sun
Research Collection School Of Computing and Information Systems
This paper presents a structure first image inpainting method based on self-organizing map (SOM). SOM is employed to find the useful structure information of the damaged image. The useful structure information which includes relevant edges of the image is used to simulate the structure information of the lost or damaged area in the image. The structure information is described by distinct or indistinct curves in an image in this paper. The obtained target curves separate the damaged area of the image into several parts. As soon as each part of the damaged image is restored respectively, the damaged image is …
Traffic Velocity Prediction Using Gps Data: Ieee Icdm Contest Task 3 Report, Wei Shen, Yiannis Kamarianakis, Laura Wynter, Jingrui He, Qing He, Rick Lawrence, Grzegorz Swirszcz
Traffic Velocity Prediction Using Gps Data: Ieee Icdm Contest Task 3 Report, Wei Shen, Yiannis Kamarianakis, Laura Wynter, Jingrui He, Qing He, Rick Lawrence, Grzegorz Swirszcz
Research Collection School Of Computing and Information Systems
This report summarizes the methodologies and techniques we developed and applied for tackling task 3 of the IEEE ICDM Contest on predicting traffic velocity based on GPS data. The major components of our solution include 1) A pre-processing procedure to map GPS data to the network, 2) A K-nearest neighbor approach for identifying the most similar training hours for every test hour, and 3) A heuristic evaluation framework for optimizing parameters and avoiding over-fitting. Our solution finished Second in the final evaluation.
Ibm Power Systems And Service Oriented Architecture At Bank Of America’S Foreign Items Systems Office, Keng Siau, D. Dewester
Ibm Power Systems And Service Oriented Architecture At Bank Of America’S Foreign Items Systems Office, Keng Siau, D. Dewester
Research Collection School Of Computing and Information Systems
This is a teaching case on a real life scenario in an organization involving IT solution evaluation and selection. This case involves the Bank of America’s Foreign Items Systems office in Toronto. The officers from the Bank of America’s Foreign Items Systems office in Toronto were discussing how to respond to a Request for Proposal (RFP) from a major U.S. bank to provide foreign currency services. The case discusses three options: Standard J2EE Web Application Global Foreign Currency, Modified J2EE Web Application with Single Sign On, and Service-Oriented Architecture (SOA) via Web Services. The case can be used to complement …
Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen
Chosen-Ciphertext Secure Bidirectional Proxy Re-Encryption Schemes Without Pairings, Jian Weng, Huijie, Robert Deng, Shengli Liu, Kefei Chen
Research Collection School Of Computing and Information Systems
Proxy re-encryption realizes delegation of decryption rights, enabling a proxy holding a re-encryption key to convert a ciphertext originally intended for Alice into an encryption of the same message for Bob. Proxy re-encryption is a very useful primitive, having many applications in distributed file systems, outsourced filtering of encrypted spam, access control over network storage, and so on. Lately, Weng et al. proposed the first unidirectional proxy re-encryption scheme without using bilinear pairs. However, Weng et al.'s construction does not possess collusion resilience, in the sense that a coalition of the proxy and the delegatee can recover the delegator's private …
Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng
Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng
Research Collection School Of Computing and Information Systems
“Symmetric secret”-based RFID systems are widely adopted in supply chains. In such RFID systems, a reader’s ability to identify a RFID tag relies on the possession of the tag’s secret which is usually only known by its owner. If a “symmetric secret”-based RFID system is deployed in third party logistics (3PL) supply chains, all the three parties (the sender of the goods, the receiver of the goods and the 3PL provider) should have a copy of those tags’ secrets to access the tags. In case the three parties in 3PL supply chain are not all honest, sharing the secrets among …
Exploiting Intensity Inhomogeneity To Extract Textured Objects From Natural Scenes, Jundi Ding, Jialie Shen, Hwee Hwa Pang, Songcan Chen, Jingyu Yang
Exploiting Intensity Inhomogeneity To Extract Textured Objects From Natural Scenes, Jundi Ding, Jialie Shen, Hwee Hwa Pang, Songcan Chen, Jingyu Yang
Research Collection School Of Computing and Information Systems
Extracting textured objects from natural scenes is a challenging task in computer vision. The main difficulties arise from the intrinsic randomness of natural textures and the high-semblance between the objects and the background. In this paper, we approach the extraction problem with a seeded region-growing framework that purely exploits the statistical properties of intensity inhomogeneity. The pixels in the interior of potential textured regions are first found as texture seeds in an unsupervised manner. The labels of the texture seeds are then propagated through their respective inhomogeneous neighborhoods, to eventually cover the different texture regions in the image. Extensive experiments …
Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein
Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Computing a maximum a posteriori (MAP) assignment in graphical models is a crucial inference problem for many practical applications. Several provably convergent approaches have been successfully developed using linear programming (LP) relaxation of the MAP problem. We present an alternative approach, which transforms the MAP problem into that of inference in a finite mixture of simple Bayes nets. We then derive the Expectation Maximization (EM) algorithm for this mixture that also monotonically increases a lower bound on the MAP assignment until convergence. The update equations for the EM algorithm are remarkably simple, both conceptually and computationally, and can be implemented …
Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah
Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah
Research Collection School Of Computing and Information Systems
Energy consumption is an important issue in the design of wireless sensor networks (WSNs) which typically rely on portable energy sources like batteries for power. Recent advances in ambient energy harvesting technologies have made it possible for sensor nodes to be powered by ambient energy entirely without the use of batteries. However, since the energy harvesting process is stochastic, exact sleep-and-wakeup schedules cannot be determined in WSNs Powered solely using Ambient Energy Harvesters (WSN–HEAP). Therefore, many existing WSN routing protocols cannot be used in WSN–HEAP. In this paper, we design an opportunistic routing protocol (EHOR) for multi-hop WSN–HEAP. Unlike traditional …
Efficient Mining Of Multiple Partial Near-Duplicate Alignments By Temporal Network, Hung-Khoon Tan, Chong-Wah Ngo, Tat-Seng Chua
Efficient Mining Of Multiple Partial Near-Duplicate Alignments By Temporal Network, Hung-Khoon Tan, Chong-Wah Ngo, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
This paper considers the mining and localization of near-duplicate segments at arbitrary positions of partial near-duplicate videos in a corpus. Temporal network is proposed to model the visual-temporal consistency between video sequence by embedding temporal constraints as directed edges in the network. Partial alignment is then achieved through network flow programming. To handle multiple alignments, we consider two properties of network structure: conciseness and divisibility, to ensure that the mining is efficient and effective. Frame-level matching is further integrated in the temporal network for alignment verification. This results in an iterative alignment-verification procedure to fine tune the localization of near-duplicate …
An Analytic Characterization Of Model Minimization In Factored Markov Decision Processes, Guo W., Tze-Yun Leong
An Analytic Characterization Of Model Minimization In Factored Markov Decision Processes, Guo W., Tze-Yun Leong
Research Collection School Of Computing and Information Systems
Model minimization in Factored Markov Decision Processes (FMDPs) is concerned with finding the most compact partition of the state space such that all states in the same block are action-equivalent. This is an important problem because it can potentially transform a large FMDP into an equivalent but much smaller one, whose solution can be readily used to solve the original model. Previous model minimization algorithms are iterative in nature, making opaque the relationship between the input model and the output partition. We demonstrate that given a set of well-defined concepts and operations on partitions, we can express the model minimization …
Smu-Sis At Tac 2010 - Kbp Track Entity Linking, Swapna Gottipati, Jing Jiang
Smu-Sis At Tac 2010 - Kbp Track Entity Linking, Swapna Gottipati, Jing Jiang
Research Collection School Of Computing and Information Systems
Entity linking task is a process of linking the named entity within the unstructured text to the entity in the Knowledge Base. Entity liking to the relevant knowledge is useful in various information extraction and natural language processing applications that improve the user experiences such as search, summarization and so on. We propose the two way entity linking approach to reformulate query, disambiguate the entity and link to the relevant KB repository. This paper describes the details of our participation in TAC 2010 - Knowledge Base Population track. We provided an innovative approach to disambiguate the entity by query reformulation …
The Impact Of Social Media On Software Engineering Practices And Tools, Margaret-Anne Storey, Christoph Treude, Arie Van Deursen, Li-Te Cheng
The Impact Of Social Media On Software Engineering Practices And Tools, Margaret-Anne Storey, Christoph Treude, Arie Van Deursen, Li-Te Cheng
Research Collection School Of Computing and Information Systems
Today's generation of software developers frequently make use of social media, either as an adjunct or integrated into a wide range of tools ranging from code editors and issue trackers, to IDEs and web-based portals. The role of social media usage in software engineering is not well understood, and yet the use of these mechanisms influences software development practices. In this position paper, we advocate for research that strives to understand the benefits, risks and limitations of using social media in software development at the team, project and community levels. Guided by the implications of current tools and social media …
Arivu: Power-Aware Middleware For Multiplayer Mobile Games, Bhojan Anand, Karthik Thirugnanam, Thanh Long Le, Duc-Dung Pham, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan
Arivu: Power-Aware Middleware For Multiplayer Mobile Games, Bhojan Anand, Karthik Thirugnanam, Thanh Long Le, Duc-Dung Pham, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan
Research Collection School Of Computing and Information Systems
With the improved processing power, graphic quality and high-speed wireless connection in recent generations of mobile phone, it looks more attractive than ever to introduce networked games on these devices. While device features and application resource requirements are rapidly growing, the battery technologies are not growing at the same pace. Networked Mobile games are a class of application, which consume higher levels of energy, as they are naturally more computationally intensive and use hardware components including audio, display and network to their fullest capacities. Therefore, the main concern is the limitation of the battery power of such portable devices to …
Model Checking A Model Checker: A Code Contract Combined Approach, Jun Sun, Yang Liu, Bin Cheng
Model Checking A Model Checker: A Code Contract Combined Approach, Jun Sun, Yang Liu, Bin Cheng
Research Collection School Of Computing and Information Systems
Model checkers, like any complex software, are subject to bugs. Unlike ordinary software, model checkers are often used to verify safety critical systems. Their correctness is thus vital. Verifying model checkers is extremely challenging because they are always complicated in logic and highly optimized. In this work, we propose a code contract combined approach for checking model checkers and apply it to a home-grown model checker PAT. In this approach, we firstly embed programming contracts (i.e., pre/post-conditions and invariants) into its source code, which can capture correctness of model checking algorithms, underlying data structures, consistency between different model checking parameters, …
Would Position Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh
Would Position Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh
Research Collection School Of Computing and Information Systems
On May 6, 2010, the US equity markets experienced a brief but highly unusual drop in prices across a number of stocks and indices. The Dow Jones Industrial Average (DJIA) fell by approximately 9% in a matter of minutes, and several stocks were traded down sharply before recovering a short time later. Earlier research by Lee, Cheng and Koh (2010) identified the conditions under which a “flash crash” can be triggered by systematic traders running highly similar trading strategies, especially when they are “crowding out” other liquidity providers in the market. The authors contend that the events of May 6, …
Semi-Autonomous Virtual Valet Parking, Arne Suppe, Luis Navarro-Serment, Aaron Steinfeld
Semi-Autonomous Virtual Valet Parking, Arne Suppe, Luis Navarro-Serment, Aaron Steinfeld
Research Collection School Of Computing and Information Systems
Despite regulations specifying parking spots that support wheelchair vans, it is not uncommon for end users to encounter problems with clearance for van ramps. Even if a driver elects to park in the far reaches of a parking lot as a precautionary measure, there is no guarantee that the spot next to their van will be empty when they return. Likewise, the prevalence of older drivers who experience significant difficulty with ingress and egress from vehicles is nontrivial and the ability to fully open a car door is important. This work describes a method and user interaction for low cost, …
Vireo At Trecvid 2010: Semantic Indexing, Known-Item Search, And Content-Based Copy Detection, Chong-Wah Ngo, Shi-Ai Zhu, Hung-Khoon Tan, Wan-Lei Zhao
Vireo At Trecvid 2010: Semantic Indexing, Known-Item Search, And Content-Based Copy Detection, Chong-Wah Ngo, Shi-Ai Zhu, Hung-Khoon Tan, Wan-Lei Zhao
Research Collection School Of Computing and Information Systems
This paper presents our approaches and the comparative analysis of our results for the three TRECVID 2010 tasks that we participated in: semantic indexing, known-item search and content-based copy detection.
Revenue Management Model For On-Demand It Services, Tieming Liu, Chinnatat Methapatara, Laura Wynter
Revenue Management Model For On-Demand It Services, Tieming Liu, Chinnatat Methapatara, Laura Wynter
Research Collection School Of Computing and Information Systems
This paper presents a model for applying revenue management to on-demand IT services. The multinomial logit model is used to describe customer choice over multiple classes with different service-level agreements (SLAs). A nonlinear programming model is provided to determine the optimal price or service level for each class. Through a numerical analysis, we examine the impacts of system capacity and customer waiting incentives on the service provider’s profit and pricing strategies.
Model Checking Hierarchical Probabilistic Systems, Jun Sun, Songzheng Song, Yang Liu
Model Checking Hierarchical Probabilistic Systems, Jun Sun, Songzheng Song, Yang Liu
Research Collection School Of Computing and Information Systems
Probabilistic modeling is important for random distributed algorithms, bio-systems or decision processes. Probabilistic model checking is a systematic way of analyzing finite-state probabilistic models. Existing probabilistic model checkers have been designed for simple systems without hierarchy. In this paper, we extend the PAT toolkit to support probabilistic model checking of hierarchical complex systems. We propose to use PCSP#, a combination of Hoare’s CSP with data and probability, to model such systems. In addition to temporal logic, we allow complex safety properties to be specified by non-probabilistic PCSP# model. Validity of the properties (with probability) is established by refinement checking. Furthermore, …
Evolution Of A Bluetooth Test Application Product Line: A Case Study, Narayanasamy Ramasubbu, Rajesh Krishna Balan
Evolution Of A Bluetooth Test Application Product Line: A Case Study, Narayanasamy Ramasubbu, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
In this paper, we study the decision making process involved in the five year lifecycle of a Bluetooth software product produced by a large, multi-national test and measurement firm. In this environment, customer change requests either have to be added as a standard feature in the product, or developed as a special customized version of the product. We first discuss the influential factors, such as evolving standards, market share, installed-base, and complexity, which collectively determined how the firm responded to product change requests. We then develop a predictive decision model to test the collective impact of these factors on determining …
Online Multiple Kernel Learning: Algorithms And Mistake Bounds, Rong Jin, Steven C. H. Hoi, Tianbao Yang
Online Multiple Kernel Learning: Algorithms And Mistake Bounds, Rong Jin, Steven C. H. Hoi, Tianbao Yang
Research Collection School Of Computing and Information Systems
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing the intersecting research. In this paper, we introduce a new research problem, termed Online Multiple Kernel Learning (OMKL), that aims to learn a kernel based prediction function from a pool of predefined kernels in an online learning fashion. OMKL is generally more challenging than typical online learning because both the kernel classifiers and their linear combination weights must be learned simultaneously. In this work, we consider two setups for OMKL, i.e. combining …
Youth Olympic Village Co-Space, Zin-Yan Chua, Yilin Kang, Xing Jiang, Kah-Hoe Pang, Andrew C. Gregory, Chi-Yun Tan, Wai-Lun Wong, Ah-Hwee Tan, Yew-Soon Ong, Chunyan Miao
Youth Olympic Village Co-Space, Zin-Yan Chua, Yilin Kang, Xing Jiang, Kah-Hoe Pang, Andrew C. Gregory, Chi-Yun Tan, Wai-Lun Wong, Ah-Hwee Tan, Yew-Soon Ong, Chunyan Miao
Research Collection School Of Computing and Information Systems
We have designed and implemented a 3D virtual world based on the Co-Space concept encompasses the Youth Olympic Village (YOV) and several sports competition venues. It is a massively multiplayer online (MMO) virtual world built according to the actual, physical locations of the YOV and sports competition venues. On top of that, the Co-Space is being populated with human-like avatars, which are created according to the actual human size and appearance; they perform their activities and interact with the users in realworld context. In addition, autonomous intelligent agents are integrated into the Co-Space to provide context-aware and personalized services to …