Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8519)
- Computer Sciences (8502)
- Databases and Information Systems (3446)
- Software Engineering (2153)
- Artificial Intelligence and Robotics (1686)
-
- Information Security (1056)
- Numerical Analysis and Scientific Computing (1023)
- Engineering (955)
- Graphics and Human Computer Interfaces (926)
- Social and Behavioral Sciences (734)
- Business (685)
- Computer Engineering (511)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (183)
- Education (178)
- Management Information Systems (177)
- Data Storage Systems (175)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (110)
- Keyword
-
- Deep learning (124)
- Machine learning (124)
- Social media (80)
- Artificial intelligence (71)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (53)
- Singapore (52)
- Visualization (52)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Task analysis (48)
- Anomaly detection (47)
- Collaboration (45)
- Feature extraction (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 7171 - 7200 of 8692
Full-Text Articles in Entire DC Network
Policy-Driven Distributed And Collaborative Demand Response In Multi-Domain Commercial Buildings, Archan Misra, Henning Schulzrinne
Policy-Driven Distributed And Collaborative Demand Response In Multi-Domain Commercial Buildings, Archan Misra, Henning Schulzrinne
Research Collection School Of Computing and Information Systems
Enabling a sophisticated Demand Response (DR) framework, whereby individual consumers adapt their electricity consumption in response to price variations, is a major objective of the emerging Smart Grid. We first point out why the current model, of EMS-based centralized control of a static repository of high load appliances, is inappropriate for supporting DR in future commercial buildings and campuses, where the consuming appliances are controlled by multiple users. To enable DR in such multi-domain environments, we envision a more collaborative and autonomous model, where a large set of heterogeneous smart electrical devices autonomously self-organize and negotiate their collective DR. Enabling …
Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw
Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw
Research Collection School Of Computing and Information Systems
An approach is described for generating synonyms to supplement at least one information item, such as, in one case, a set of related items. The approach can involve an expansion phase, a clean-up phase, and a reduction phase. In the expansion phase, the approach identifies, for each related item, a set of initial synonym candidates. In the clean-up phase, the approach removes noise from the set of initial synonym candidates (if such noise exists), to provide a set of filtered synonym candidate items. In the reduction phase, the approach ranks and applies a threshold (or thresholds) to the set of …
Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen
Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen
Research Collection School Of Computing and Information Systems
An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous CkNN (HCCkNN) queries on R-tree-like structures storing historical information about moving object trajectories. Given a trajectory set D, a query object (point or trajectory) q, a temporal extent T, and a constrained region CR, (i) a CkNN query over trajectories retrieves from D within T, the k (≥ 1) trajectories that lie closest to q and …
Model-Based Methods For Linking Web Service Choreography And Orchestration, Jun Sun, Yang Liu, Jin Song Dong, Geguang Pu, Tian Huat Tan
Model-Based Methods For Linking Web Service Choreography And Orchestration, Jun Sun, Yang Liu, Jin Song Dong, Geguang Pu, Tian Huat Tan
Research Collection School Of Computing and Information Systems
In recent years, many Web service composition languages have been proposed. Web service choreography describes collaboration protocols of cooperating Web service participants from a global view. Web service orchestration describes collaboration of the Web services in predefined patterns based on local decision about their interactions with one another at the message/execution level. In this work, we present model-based methods to close the gap between the two views. Building on the strength of model checking techniques, Web service choreography and orchestration are verified against temporal properties or against each other (to show that they are consistent). Specialized optimization techniques are developed …
Cca-Secure Unidirectional Proxy Re-Encryption In The Adaptive Corruption Model Without Random Oracles, Jian Weng, Minrong Chen, Yanjiang Yang, Robert H. Deng, Kefei Chen
Cca-Secure Unidirectional Proxy Re-Encryption In The Adaptive Corruption Model Without Random Oracles, Jian Weng, Minrong Chen, Yanjiang Yang, Robert H. Deng, Kefei Chen
Research Collection School Of Computing and Information Systems
Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss in Eurocrypt’98, allows a semitrusted proxy to convert a ciphertext originally intended for Alice into an encryption of the same message intended for Bob. PRE has recently drawn great interest, and many interesting PRE schemes have been proposed. However, up to now, it is still an important question to come up with a chosen-ciphertext secure unidirectional PRE in the adaptive corruption model. To address this problem, we propose a new unidirectional PRE scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known …
Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard
Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard
Research Collection School Of Computing and Information Systems
This paper explores strategic behavior in a network of firms using an agent-based model. The model exhibits a tension between economic efficiency and the stability of the network in the face of incentives to change its configuration. This tension is to be expected because the conditions of the Coase theorem are violated: the boundedly rational firms in the model lack the ability to discover efficient network configurations or achieve them through collective action. In computational experiments, as predicted by theory, firms frequently became locked into inefficient outcomes or endless cycles of mutual frustration. However, simple institutional innovations such as property …
Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham
Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham
Research Collection School Of Computing and Information Systems
Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/or fusion techniques exploit spatio-temporal correlation among sensory data to reduce traffic load and mitigate congestion. However, this is often at the expense of loss in Information Quality (IQ) of data that is collected at the fusion center. In this work, we address the problem of finding the least-cost routing tree that satisfies a given IQ constraint. We note that the optimal least-cost routing solution is a variation of the classical NP-hard Steiner tree …
Homophily In The Digital World: A Livejournal Case Study, Hady W. Lauw, John C. Shafer, Rakesh Agrawal, Alexandros Ntoulas
Homophily In The Digital World: A Livejournal Case Study, Hady W. Lauw, John C. Shafer, Rakesh Agrawal, Alexandros Ntoulas
Research Collection School Of Computing and Information Systems
Are two users more likely to be friends if they share common interests? Are two users more likely to share common interests if they're friends? The authors study the phenomenon of homophily in the digital world by answering these central questions. Unlike the physical world, the digital world doesn't impose any geographic or organizational constraints on friendships. So, although online friends might share common interests, a priori there's no reason to believe that two users with common interests are more likely to be friends. Using data from LiveJournal, the authors show that the answer to both questions is yes.
Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li
Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li
Research Collection School Of Computing and Information Systems
An increasing number of serious games have been developed to enhance the user experiences in education and training. In order to bridge the gap of game experiences in the virtual environment and in the real life, it is crucial to generate believable characters and contexts in real-time. However, the variables to be simulated for a large-scale serious game are numerous. These variables are involved in complex causal relationships and their values change over time. In view that world modeling has not been well addressed with conventional models, this paper uses a computational model Evolutionary Fuzzy Cognitive Map (EFCM) to model …
A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong
A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong
Research Collection School Of Computing and Information Systems
This paper presents a self-organizing neural architecture that integrates the features of belief, desire, and intention (BDI) systems with reinforcement learning. Based on fusion Adaptive Resonance Theory (fusion ART), the proposed architecture provides a unified treatment for both intentional and reactive cognitive functionalities. Operating with a sense-act-learn paradigm, the low level reactive module is a fusion ART network that learns action and value policies across the sensory, motor, and feedback channels. During performance, the actions executed by the reactive module are tracked by a high level intention module (also a fusion ART network) that learns to associate sequences of actions …
Symphony: A Platform For Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw
Symphony: A Platform For Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw
Research Collection School Of Computing and Information Systems
We present the design of Symphony, a platform that enables non-developers to build and deploy a new class of search-driven applications that combine their data and domain expertise with content from search engines and other web services. The Symphony prototype has been built on top of Microsoft's Bing infrastructure. While Symphony naturally makes use of the customization capabilities exposed by Bing, its distinguishing feature is the capability it provides to the application creator to combine their proprietary data and domain expertise with content obtained from Bing. They can also integrate specialized data obtained from web services to enhance the richness …
Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu
Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu
Research Collection School Of Computing and Information Systems
Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate …
Efficient Verification Of Shortest Path Search Via Authenticated Hints, Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
Efficient Verification Of Shortest Path Search Via Authenticated Hints, Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanning logistics, spatial optimization, or everyday driving decisions. Often times, the owner of the road network data (e.g., a transport authority) provides its database to third-party query services, which are responsible for answering shortest path queries posed by their clients. The issue arising here is that a query service might be returning sub-optimal paths either purposely (in order to serve its own purposes like computational savings or commercial reasons) or because it has been compromised by …
Top-K Aggregation Queries Over Large Networks, Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
Top-K Aggregation Queries Over Large Networks, Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
Research Collection School Of Computing and Information Systems
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional associations in biological pathways. In these domains, there is a need to perform aggregation operations on large-scale networks. Unfortunately the existing implementation of aggregation operations on relational databases does not guarantee superior performance in network space, especially when it involves edge traversals and joins of gigantic tables. In this paper, we investigate the neighborhood aggregation queries: Find nodes that have top-k highest aggregate values over their h-hop neighbors. While these basic queries are common in …
Medially: A Provenance-Aware Remote Health Monitoring Middleware, Atanu Roy Chowdhury, Ben Falchuk, Archan Misra
Medially: A Provenance-Aware Remote Health Monitoring Middleware, Atanu Roy Chowdhury, Ben Falchuk, Archan Misra
Research Collection School Of Computing and Information Systems
This paper presents MediAlly, a middleware for supporting energy-efficient, long-term remote health monitoring. Data is collected using physiological sensors and transported back to the middleware using a smart phone. The key to MediAlly's energy efficient operations lies in the adoption of an Activity Triggered Deep Monitoring (ATDM) paradigm, where data collection episodes are triggered only when the subject is determined to possess a specified context. MediAlly supports the on-demand collection of contextual provenance using a novel low-overhead provenance collection sub-system. The behaviour of this sub-system is configured using an application-defined context composition graph. The resulting provenance stream provides valuable insight …
Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane
Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane
Research Collection School Of Computing and Information Systems
The fields of organizational behavior (OB)/strategy and marketing have taken different paths over the past two decades to understanding organizational learning. OB/strategy has been pre-occupied with theory development and case study illustrations, whereas marketing has taken a highly quantitative path. Although relying on essentially the same foundation theory, the two disciplines have had minimal crossfertilization. Furthermore, both fields tend to blur or usually ignore the distinction between structural and informal knowledge processes. The purpose of the paper is to highlight the distinction between informal and structural knowledge acquisition and dissemination processes and propose new definitions to differentiate them. Future research …
A Multi-Key Pirate Decoder Against Traitor Tracing Schemes, Yongdong Wu, Robert H. Deng
A Multi-Key Pirate Decoder Against Traitor Tracing Schemes, Yongdong Wu, Robert H. Deng
Research Collection School Of Computing and Information Systems
In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of defeating most multiple-round based traitor tracing schemes such as the schemes based on the black-box confirmation method. In particular, the proposed pirate decoder is customized to defeat the private key and the public key fully collusion resistant traitor tracing (FTT) schemes, respectively. We show how the decoder prolongs a trace process so that the tracer has to give up his effort. FTT schemes are designed to identify all …
Probabilistic Public Key Encryption With Equality Test, Guomin Yang, Chik How Tan, Qiong Huang, Duncan S. Wong
Probabilistic Public Key Encryption With Equality Test, Guomin Yang, Chik How Tan, Qiong Huang, Duncan S. Wong
Research Collection School Of Computing and Information Systems
We present a (probabilistic) public key encryption (PKE) scheme such that when being implemented in a bilinear group, anyone is able to check whether two ciphertexts are encryptions of the same message. Interestingly, bilinear map operations are not required in key generation, encryption or decryption procedures of the PKE scheme, but is only required when people want to do an equality test (on the encrypted messages) between two ciphertexts that may be generated using different public keys. We show that our PKE scheme can be used in different applications such as searchable encryption and partitioning encrypted data. Moreover, we show …
Fuzzy Matching Of Web Queries To Structured Data, Tao Cheng, Hady W. Lauw, Stelios Paparizos
Fuzzy Matching Of Web Queries To Structured Data, Tao Cheng, Hady W. Lauw, Stelios Paparizos
Research Collection School Of Computing and Information Systems
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismatch between how content creators describe entities and how different users try to retrieve them. In this paper, we consider the problem of determining whether a candidate query approximately matches with an entity. We propose an off-line, data-driven, bottom-up approach that mines query logs for instances where Web content creators and Web users apply a variety of strings to refer to the same Web pages. This way, given a set of strings that …
Efficient Cca-Secure Pke From Identity-Based Techniques, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou
Efficient Cca-Secure Pke From Identity-Based Techniques, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou
Research Collection School Of Computing and Information Systems
Boneh, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure public key encryption (PKE) from any selective-ID CPA-secure identity-based encryption (IBE) schemes. Their approach treated IBE as a black box. Subsequently, Boyen, Mei, and Waters demonstrated how to build a direct CCA-secure PKE scheme from the Waters IBE scheme, which is adaptive-ID CPA secure. They made direct use of the underlying IBE structure, and required no cryptographic primitive other than the IBE scheme itself. However, their scheme requires long public key and the security reduction is loose. In this paper, we propose an efficient PKE scheme employing identity-based …
K-Anonymity In The Presence Of External Databases, Dimitris Sacharidis, Kyriakos Mouratidis, Dimitris Papadias
K-Anonymity In The Presence Of External Databases, Dimitris Sacharidis, Kyriakos Mouratidis, Dimitris Papadias
Research Collection School Of Computing and Information Systems
The concept of k-anonymity has received considerable attention due to the need of several organizations to release microdata without revealing the identity of individuals. Although all previous k-anonymity techniques assume the existence of a public database (PD) that can be used to breach privacy, none utilizes PD during the anonymization process. Specifically, existing generalization algorithms create anonymous tables using only the microdata table (MT) to be published, independently of the external knowledge available. This omission leads to high information loss. Motivated by this observation we first introduce the concept of k-join-anonymity (KJA), which permits more effective generalization to reduce the …
Further Exploration On Relationship Between Crisp Sets And Fuzzy Sets, Zhaoxia Wang, Quan Wang, Ming Bai, Chen Zeng-Qiang, Zhen Sun
Further Exploration On Relationship Between Crisp Sets And Fuzzy Sets, Zhaoxia Wang, Quan Wang, Ming Bai, Chen Zeng-Qiang, Zhen Sun
Research Collection School Of Computing and Information Systems
This paper employs the concept of fuzzify upgrade operator to describe the relationship between crisp sets, fuzzy sets and higher order fuzzy sets, such as type-2 fuzzy sets. Theory analysis and case studies demonstrate that a crisp set can be represented by a type-1 fuzzy set, a type-1 fuzzy set can be represented by a type-2 fuzzy set, and a type-n (n>=2) fuzzy set can be represented by a type-(n+1) (n>=2) fuzzy set. The fuzzify upgrade operator makes crisp sets, type-1 fuzzy sets, type-2 fuzzy sets and any fuzzy sets much more accessible to all readers. The relationship …
Twitterrank: Finding Topic-Sensitive Influential Twitterers, Jianshu Weng, Ee Peng Lim, Jing Jiang, Qi He
Twitterrank: Finding Topic-Sensitive Influential Twitterers, Jianshu Weng, Ee Peng Lim, Jing Jiang, Qi He
Research Collection School Of Computing and Information Systems
This paper focuses on the problem of identifying influential users of micro-blogging services. Twitter, one of the most notable micro-blogging services, employs a social-networking model called "following", in which each user can choose who she wants to "follow" to receive tweets from without requiring the latter to give permission first. In a dataset prepared for this study, it is observed that (1) 72.4% of the users in Twitter follow more than 80% of their followers, and (2) 80.5% of the users have 80% of users they are following follow them back. Our study reveals that the presence of "reciprocity" can …
Estimating The Quality Of Postings In The Real-Time Web, Hady W. Lauw, Alexandros Ntoulas, Krishnaram Kenthapadi
Estimating The Quality Of Postings In The Real-Time Web, Hady W. Lauw, Alexandros Ntoulas, Krishnaram Kenthapadi
Research Collection School Of Computing and Information Systems
Millions of users are posting their status updates, interesting findings, news, ideas and observations in real-time on microblogging services such as Twitter, Jaiku and Plurk. This real-time Web can be a great resource of valuable timely information. Since the real-time Web is completely open and decentralized and anyone may post information at whim, distinguishing interesting and popular postings from the mundane ones is a challenging task. In this paper we study the problem of estimating the quality (or “interestingness”) of postings in the real-time Web. We identify several important factors that are indicative of the quality of postings, and present …
An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh
An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh
Research Collection School Of Computing and Information Systems
We construct an agent-based model to study the interplay between extreme price shocks and illiquidity in the presence of systematic traders known as trend followers. The agent-based approach is particularly attractive in modeling commodity markets because the approach allows for the explicit modeling of production, capacities, and storage constraints. Our study begins by using the price stream from a market simulation involving human participants and studies the behavior of various trend-following strategies, assuming initially that their participation will not impact the market. We notice an incremental deterioration in strategy performance as and when strategies deviate further and further from the …
Player Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Richa Sharan, Jaideep Srivastava
Player Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Richa Sharan, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
Recent years have seen an ever increasing number of people interacting in the online space. Massively multiplayer online role-playing games (MMORPGs) are personal computer or console-based digital games where thousands of players can simultaneously sign on to the same online, persistent virtual world to interact and collaborate with each other through their in-game characters. In recent years, researchers have found virtual environments to be a sound venue for studying learning, collaboration, social participation, literacy in online space, and learning trajectory at the individual level as well as at the group level. While many games today provide web and GUI-based reports …
Privacy-Preserving Similarity-Based Text Retrieval, Hwee Hwa Pang, Jialie Shen, Ramayya Krishnan
Privacy-Preserving Similarity-Based Text Retrieval, Hwee Hwa Pang, Jialie Shen, Ramayya Krishnan
Research Collection School Of Computing and Information Systems
Users of online services are increasingly wary that their activities could disclose confidential information on their business or personal activities. It would be desirable for an online document service to perform text retrieval for users, while protecting the privacy of their activities. In this article, we introduce a privacy-preserving, similarity-based text retrieval scheme that (a) prevents the server from accurately reconstructing the term composition of queries and documents, and (b) anonymizes the search results from unauthorized observers. At the same time, our scheme preserves the relevance-ranking of the search server, and enables accounting of the number of documents that each …
Efficient Valid Scope For Location-Dependent Spatial Queries In Mobile Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Efficient Valid Scope For Location-Dependent Spatial Queries In Mobile Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Research Collection School Of Computing and Information Systems
In mobile environments, mobile clients can access information with respect to their locations by submitting Location-Dependent Spatial Queries (LDSQs) to Location-Based Service (LBS) servers. Owing to scarce wireless channel bandwidth and limited client battery life, frequent LDSQ submission from clients must be avoided. Observing that LDSQs issued from a client located at nearby positions would likely return the same query results, we explore the idea of valid scope, which represents a spatial area in which a set of LDSQs will retrieve exactly the same set of query results. With a valid scope derived and an LDSQ result cached, a client …
Smart Media: Bridging Interactions And Services For The Smart Internet, Margaret-Anne Storey, Lars Grammel, Christoph Treude
Smart Media: Bridging Interactions And Services For The Smart Internet, Margaret-Anne Storey, Lars Grammel, Christoph Treude
Research Collection School Of Computing and Information Systems
This chapter describes a need for Smart Media to enhance the vision of the Smart Internet. Smart Media is introduced as a mechanism to bridge Smart Services and Smart Interactions. Smart Media extends the existing notions of Media in HCI such as Hypermedia, New Media, Adaptive Hypermedia, and Social Media. There are three main contributions from this paper: (1) A historical perspective of media in HCI and how media could benefit from smartness; (2) through some high level sample scenarios, a proposal for Smart Media to meet the vision of the Smart Internet; and (3) a detailed example of how …
Operational Risk In Trading Platforms, M. Thulasidas
Operational Risk In Trading Platforms, M. Thulasidas
Research Collection School Of Computing and Information Systems
Operational risk is the risk of loss resulting from inadequate or failed internal processes, people, and systems, or from external events. A trading platform is a system, and therefore comes under the umbrella definition of operational risk.