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 7531 - 7560 of 8692
Full-Text Articles in Entire DC Network
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Research Collection School Of Computing and Information Systems
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q's influence on a data point p (∈ P) is denoted by κp where q is the κp-th NN of p. We introduce a new variant of RNN query, namely, …
Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith
Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith
Research Collection School Of Computing and Information Systems
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably juggling multiple concurrent streams of tasks (or work flows) of varying importance and urgency. There is uncertainty with respect to the duration of a pending task as well as the amount of follow-on work that may be generated as a result of executing the task. The user’s goal is to be as productive as possible; i.e., to execute tasks that realize the maximum cumulative payoff. This is achieved by enabling …
Mobile Interaction Design: Integrating Individual And Organizational Perspectives, Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester
Mobile Interaction Design: Integrating Individual And Organizational Perspectives, Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester
Research Collection School Of Computing and Information Systems
While mobile computing provides organizations with many information systems implementation alternatives, it is often difficult to predict the potential benefits, limitations, and problems with mobile applications. Given the inherent portability of mobile devices, many design and use issues can arise which do not exist with desktop systems. While many existing rules of thumb for design of stationary systems apply to mobile systems, many new ones emerge. Issues such as the security and privacy of information take on new dimensions, and potential conflicts can develop when a single mobile device serves both personal and business needs. This paper identifies potential issues …
Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu
Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu
Research Collection School Of Computing and Information Systems
Specification mining is a process of extracting specifications, often from program execution traces. These specifications can in turn be used to aid program understanding, monitoring and verification. There are a number of dynamic-analysis-based specification mining tools in the literature, however none so far extract past time temporal expressions in the form of rules stating: whenever a series of events occurs, previously another series of events has happened. Rules of this format are commonly found in practice and useful for various purposes. Most rule-based specification mining tools only mine future-time temporal expression. Many past-time temporal rules like whenever a resource is …
Mining Temporal Rules For Software Maintenance, David Lo, Siau-Cheng Khoo, Chao Liu
Mining Temporal Rules For Software Maintenance, David Lo, Siau-Cheng Khoo, Chao Liu
Research Collection School Of Computing and Information Systems
Software evolution incurs difficulties in program comprehension and software verification, and hence it increases the cost of software maintenance. In this study, we propose a novel technique to mine from program execution traces a sound and complete set of statistically significant temporal rules of arbitrary lengths. The extracted temporal rules reveal invariants that the program observes, and will consequently guide developers to understand the program behaviors, and facilitate all downstream applications such as verification and debugging. Different from previous studies that were restricted to mining two-event rules (e.g., (lock) →(unlock)), our algorithm discovers rules of arbitrary lengths. In order to …
H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings
H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings
Research Collection School Of Computing and Information Systems
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential in size. The basic DPOP always communicates all possible assignments, even when some of them may be inconsistent due to hard constraints. Many real problems contain hard constraints that significantly reduce the space of feasible assignments. This paper introduces H-DPOP, a hybrid algorithm that is based on DPOP, which uses Constraint Decision Diagrams (CDD) to rule out infeasible assignments, and thus compactly …
Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin
Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin
Research Collection School Of Computing and Information Systems
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance by combining the outputs from multiple ranking algorithms. Many ensemble ranking approaches employ supervised learning techniques to learn appropriate weights for combining multiple rankers. The main shortcoming with these approaches is that the learned weights for ranking algorithms are query independent. This is suboptimal since a ranking algorithm could perform well for certain queries but poorly for others. In this paper, we propose a novel semi-supervised ensemble ranking (SSER) algorithm that learns query-dependent weights when combining …
Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar
Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar
Research Collection School Of Computing and Information Systems
Externalities occur among agglomerated firms. Scale externalities occur between firms in the same industry. Scope externalities occur when heterogeneous industries are collocated. Combined scale-and-scope externalities exist when the scale of one industry is beneficial to the growth of another collocated industry. In the Sein and Haridranath (2004) framework of information technology (IT) impacts on development, scale externalities correspond to second-order impacts, while combined scale and scope eternalities correspond to third-order impacts. We use an agglomeration perspective to explain the growth of IT industries in India. We study growth patterns of four specific IT industries: computer and peripheral equipment manufacturing, semiconductor …
Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi
Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi
Research Collection School Of Computing and Information Systems
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables. A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design. Specification languages like Timed Communicating Sequential Process (CSP) and Timed Communicating Object-Z (TCOZ) are well suited for presenting compositional models of complex real-time systems. In this work, we define a set of composable Timed Automata patterns based on hierarchical constructs in time-enriched process algebras. The patterns facilitate the hierarchical design of complex systems …
An Office Survival Guide, M. Thulasidas
An Office Survival Guide, M. Thulasidas
Research Collection School Of Computing and Information Systems
In the unforgiving, dog-eat-dog corporate jungle, when you find yourself in a new corporate setting, you need to be sure of the welcome. More importantly, you need to prove yourself worthy of it.
Context Modeling With Evolutionary Fuzzy Cognitive Map In Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen
Context Modeling With Evolutionary Fuzzy Cognitive Map In Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen
Research Collection School Of Computing and Information Systems
To generate a believable and dynamic virtual world is a great challenge in interactive storytelling. In this paper, we propose a model, namely evolutionary fuzzy cognitive map (E-FCM), to model the dynamic causal relationships among different context variables. As an extension to conventional FCM, E-FCM models not only the fuzzy causal relationships among the variables, but also the probabilistic property of causal relationships, and asynchronous activity update of the concepts. With this model, the context variables evolve in a dynamic and uncertain manner with the according evolving time. As a result, the virtual world is presented more realistically and dynamically.
Self-Organizing Neural Models Integrating Rules And Reinforcement Learning, Teck-Hou Teng, Zhong-Ming Tan, Ah-Hwee Tan
Self-Organizing Neural Models Integrating Rules And Reinforcement Learning, Teck-Hou Teng, Zhong-Ming Tan, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Traditional approaches to integrating knowledge into neural network are concerned mainly about supervised learning. This paper presents how a family of self-organizing neural models known as fusion architecture for learning, cognition and navigation (FALCON) can incorporate a priori knowledge and perform knowledge refinement and expansion through reinforcement learning. Symbolic rules are formulated based on pre-existing know-how and inserted into FALCON as a priori knowledge. The availability of knowledge enables FALCON to start performing earlier in the initial learning trials. Through a temporal-difference (TD) learning method, the inserted rules can be refined and expanded according to the evaluative feedback signals received …
Traceable And Retrievable Identity-Based Encryption, Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susilo, Duncan S. Wong, Guomin Yang
Traceable And Retrievable Identity-Based Encryption, Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susilo, Duncan S. Wong, Guomin Yang
Research Collection School Of Computing and Information Systems
Very recently, the concept of Traceable Identity-based Encryption (IBE) scheme (or Accountable Authority Identity based Encryption scheme) was introduced in Crypto 2007. This concept enables some mechanisms to reduce the trust of a private key generator (PKG) in an IBE system. The aim of this paper is threefold. First, we discuss some subtleties in the first traceable IBE scheme in the Crypto 2007 paper. Second, we present an extension to this work by having the PKG’s master secret key retrieved automatically if more than one user secret key are released. This way, the user can produce a concrete proof of …
Wikinetviz: Visualizing Friends And Adversaries In Implicit Social Networks, Minh-Tam Le, Hoang-Vu Dang, Ee Peng Lim, Anwitaman Datta
Wikinetviz: Visualizing Friends And Adversaries In Implicit Social Networks, Minh-Tam Le, Hoang-Vu Dang, Ee Peng Lim, Anwitaman Datta
Research Collection School Of Computing and Information Systems
When multiple users with diverse backgrounds and beliefs edit Wikipedia together, disputes often arise due to disagreements among the users. In this paper, we introduce a novel visualization tool known as WikiNetViz to visualize and analyze disputes among users in a dispute-induced social network. WikiNetViz is designed to quantify the degree of dispute between a pair of users using the article history. Each user (and article) is also assigned a controversy score by our proposed controversy rank model so as to measure the degree of controversy of a user (and an article) by the amount of disputes between the user …
Multi-View Ear Recognition Based On B-Spline Pose Manifold Construction, Zhiyuan Zhang, Heng Liu
Multi-View Ear Recognition Based On B-Spline Pose Manifold Construction, Zhiyuan Zhang, Heng Liu
Research Collection School Of Computing and Information Systems
In this work, multi-view ear recognition problems are examined in detail. A new multi-view ear recognition approach based on B-Spline pose manifold construction in discriminative projection space which is formed by null kernel discriminant analysis (NKDA) feature extraction is presented. Many experiments and comparisons are provided to show the effectiveness of our multi-view ear recognition approach.
Use Of Cognitive Mapping Techniques In Information Systems Development, Keng Siau, X. Tan
Use Of Cognitive Mapping Techniques In Information Systems Development, Keng Siau, X. Tan
Research Collection School Of Computing and Information Systems
Cognitive mapping techniques as a communication tool can be used in various information systems (IS) development and implementation activities. The three major cognitive mapping techniques include causal mapping, semantic mapping, and concept mapping. A causal map represents a set of causal relationships among constructs within a belief system. Semantic mapping, also known as idea mapping, is used to explore an idea without the constraints of a superimposed structure. The result of concept mapping is a graphical representation in which nodes represent concepts and links represent the relationships between concepts. Cognitive mapping techniques have been proposed to be applied in requirements …
An Experimental Study On U-Commerce Adoption: Impact Of Personalization And Privacy Concerns, H. Sheng, Fiona Fui-Hoon Nah, Keng Siau
An Experimental Study On U-Commerce Adoption: Impact Of Personalization And Privacy Concerns, H. Sheng, Fiona Fui-Hoon Nah, Keng Siau
Research Collection School Of Computing and Information Systems
Ubiquitous commerce (u-commerce) represents “anytime, anywhere” commerce. U-commerce can provide a high level of personalization, which can bring significant benefits to customers. However, privacy is a major concern to customers and an obstacle to the adoption of u-commerce. This research examines how personalization and context can impact customers’ privacy concerns as well as intention to adopt u-commerce applications. As u-commerce is new and emerging, we used the scenario-based approach to operationalize personalization and context in an experimental study. The experimental results show that the effects of personalization on customers’ privacy concerns and adoption intention are situation dependent.
Information-Theory Based Optimal Location Management Schemes For Integrated Multi-System Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das
Information-Theory Based Optimal Location Management Schemes For Integrated Multi-System Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das
Research Collection School Of Computing and Information Systems
In a multisystem environment where a mobile node can utilize multiple interfaces and simultaneously connect to multiple providers, new opportunities exist for efficient location management strategies spanning heterogeneous cellular wireless networks. In this paper, an integrated framework is developed for location management in such a multi-system, fourth generation (4 G) wireless networks. This information-theoretic framework allows each individual sub-system to operate fairly independently, and does not require the knowledge of individual sub-network topologies. An efficient location management in such a loosely coupled network is designed by having a mobile node view its movement as a vector-valued sequence, and then transmit …
Utility-Based Adaptation In Mission-Oriented Wireless Sensor Networks, Sharanya Eswaran, Archan Misra, Thomas La Porta
Utility-Based Adaptation In Mission-Oriented Wireless Sensor Networks, Sharanya Eswaran, Archan Misra, Thomas La Porta
Research Collection School Of Computing and Information Systems
This paper extends the distributed network utility maximization (NUM) framework to consider the case of resource sharing by multiple competing missions in a military-centric wireless sensor network (WSN) environment. Prior work on NUM-based optimization has considered unicast flows with sender-based utilities in either wireline or wireless networks. We extend the NUM framework to consider three key new features observed in mission-centric WSN environments: i) the definition of an individual mission's utility as a joint function of data from multiple sensor sources ii) the consumption of each senders (sensor) data by multiple receivers (missions) and iii) the multicast-tree based dissemination of …
Localized Minimum-Latency Broadcasting In Multi-Radio Multi-Rate Wireless Mesh Networks, Junaid Qadir, Chun Tung Chou, Archan Misra, Joo Ghee Lim
Localized Minimum-Latency Broadcasting In Multi-Radio Multi-Rate Wireless Mesh Networks, Junaid Qadir, Chun Tung Chou, Archan Misra, Joo Ghee Lim
Research Collection School Of Computing and Information Systems
We address the problem of minimizing the worst-case broadcast delay in ldquomulti-radio multi-channel multi-rate wireless mesh networksrdquo (MR2-MC WMN) in a distributed and localized fashion. Efficient broadcasting in such networks is especially challenging due to the desirability of exploiting the ldquowireless broadcast advantagerdquo (WBA), the interface-diversity, the channel-diversity and the rate-diversity offered by these networks. We propose a framework that calculates a set of forwarding nodes and transmission rate at these forwarding nodes irrespective of the broadcast source. Thereafter, a forwarding tree is constructed taking into consideration the source of broadcast. Our broadcasting algorithms are distributed and utilize locally available …
Visual Analytics For Supporting Entity Relationship Discovery On Text Data, Hanbo Dai, Ee Peng Lim, Hady W. Lauw, Hwee Hwa Pang
Visual Analytics For Supporting Entity Relationship Discovery On Text Data, Hanbo Dai, Ee Peng Lim, Hady W. Lauw, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
To conduct content analysis over text data, one may look out for important named objects and entities that refer to real world instances, synthesizing them into knowledge relevant to a given information seeking task. In this paper, we introduce a visual analytics tool called ER-Explorer to support such an analysis task. ER-Explorer consists of a data model known as TUBE and a set of data manipulation operations specially designed for examining entities and relationships in text. As part of TUBE, a set of interestingness measures is defined to help exploring entities and their relationships. We illustrate the use of ER-Explorer …
Probabilistically Reliable On-Demand Multicast In Wireless Mesh Networks, Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha, Archan Misra
Probabilistically Reliable On-Demand Multicast In Wireless Mesh Networks, Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha, Archan Misra
Research Collection School Of Computing and Information Systems
This paper studies probabilistically reliable multicast in wireless mesh networks (WMNs), utilizing MAC layer re-transmission and wireless broadcast advantage to improve both the multicast throughput and the delivery rate. We first present a new multicast routing metric which we call the expected multicast transmissions (EMT). EMT captures the effect of link packet delivery ratio, MAC layer retransmission and wireless broadcast advantage at the same time. The EMT of a MAC layer multicast transmission is the expected number of data transmissions (including retransmissions) required for a packet to reach all the recipients. The EMT of a multicast tree is the sum …
A Multimodal And Multilevel Ranking Scheme For Large-Scale Video Retrieval, Steven C. H. Hoi, Michael R. Lyu
A Multimodal And Multilevel Ranking Scheme For Large-Scale Video Retrieval, Steven C. H. Hoi, Michael R. Lyu
Research Collection School Of Computing and Information Systems
A critical issue of large-scale multimedia retrieval is how to develop an effective framework for ranking the search results. This problem is particularly challenging for content-based video retrieval due to some issues such as short text queries, insufficient sample learning, fusion of multimodal contents, and large-scale learning with huge media data. In this paper, we propose a novel multimodal and multilevel (MMML) ranking framework to attack the challenging ranking problem of content-based video retrieval. We represent the video retrieval task by graphs and suggest a graph based semi-supervised ranking (SSR) scheme, which can learn with small samples effectively and integrate …
Measuring Novelty And Redundancy With Multiple Modalities In Cross-Lingual Broadcast News, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo
Measuring Novelty And Redundancy With Multiple Modalities In Cross-Lingual Broadcast News, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
News videos from different channels, languages are broadcast everyday, which provide abundant information for users. To effectively search, retrieve, browse and track news stories, news story similarity plays a critical role in assessing the novelty and redundancy among news stories. In this paper, we explore different measures of novelty and redundancy detection for cross-lingual news stories. A news story is represented by multimodal features which include a sequence of keyframes in the visual track, and a set of words and named entities extracted from speech transcript in the audio track. Vector space models and language models on individual features (text, …
Seemon: Scalable And Energy-Efficient Context Monitoring Framework For Sensor-Rich Mobile Environments, Seungwoo Kang, Jinwon Lee, Hyukjae Jang, Hyonik Lee, Youngki Lee, Souneil Park, Taiwoo Park, Junehwa Song
Seemon: Scalable And Energy-Efficient Context Monitoring Framework For Sensor-Rich Mobile Environments, Seungwoo Kang, Jinwon Lee, Hyukjae Jang, Hyonik Lee, Youngki Lee, Souneil Park, Taiwoo Park, Junehwa Song
Research Collection School Of Computing and Information Systems
Proactively providing services to mobile individuals is essential for emerging ubiquitous applications. The major challenge in providing users with proactive services lies in continuously monitoring their contexts based on numerous sensors. The context monitoring with rich sensors imposes heavy workloads on mobile devices with limited computing and battery power. We present SeeMon, a scalable and energy-efficient context monitoring framework for sensor-rich, resource-limited mobile environments. Running on a personal mobile device, SeeMon effectively performs context monitoring involving numerous sensors and applications. On top of SeeMon, multiple applications on the device can proactively understand users' contexts and react appropriately. This paper proposes …
Semi-Supervised Svm Batch Mode Active Learning For Image Retrieval, Steven Hoi, Rong Jin, Jianke Zhu, Michael R. Lyu
Semi-Supervised Svm Batch Mode Active Learning For Image Retrieval, Steven Hoi, Rong Jin, Jianke Zhu, Michael R. Lyu
Research Collection School Of Computing and Information Systems
Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learning is popular for its application to relevance feedback in CBIR. However, the regular SVM active learning has two main drawbacks when used for relevance feedback. First, SVM often suffers from learning with a small number of labeled examples, which is the case in relevance feedback. Second, SVM active learning usually does not take into account the redundancy among examples, and therefore could select multiple examples in relevance feedback that are similar (or even identical) to …
Predicting Trusts Among Users Of Online Communities: An Epinions Case Study, Haifeng Liu, Ee Peng Lim, Hady W. Lauw, Minh-Tam Le, Aixin Sun, Jaideep Srivastava, Young Ae Kim
Predicting Trusts Among Users Of Online Communities: An Epinions Case Study, Haifeng Liu, Ee Peng Lim, Hady W. Lauw, Minh-Tam Le, Aixin Sun, Jaideep Srivastava, Young Ae Kim
Research Collection School Of Computing and Information Systems
Trust between a pair of users is an important piece of information for users in an online community (such as electronic commerce websites and product review websites) where users may rely on trust information to make decisions. In this paper, we address the problem of predicting whether a user trusts another user. Most prior work infers unknown trust ratings from known trust ratings. The effectiveness of this approach depends on the connectivity of the known web of trust and can be quite poor when the connectivity is very sparse which is often the case in an online community. In this …
Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath
Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath
Research Collection School Of Computing and Information Systems
Software personal assistants continue to be a topic of significant research interest. This article outlines some of the important lessons learned from a successfully-deployed team of personal assistant agents (Electric Elves) in an office environment. In the Electric Elves project, a team of almost a dozen personal assistant agents were continually active for seven months. Each elf (agent) represented one person and assisted in daily activities in an actual office environment. This project led to several important observations about privacy, adjustable autonomy, and social norms in office environments. In addition to outlining some of the key lessons learned we outline …
Capacity Constrained Assignment In Spatial Databases, Hou U Leong, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
Capacity Constrained Assignment In Spatial Databases, Hou U Leong, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
Research Collection School Of Computing and Information Systems
Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q 2 Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M Q × P such that (i) each point q 2 Q (p 2 P) appears at most k times (at most nce) in M, (ii) the size of M is maximized (i.e., it comprises min{|P|,P q2Q q.k} pairs), and (iii) the total assignment cost (i.e., the sum of Euclidean distances within all pairs) is minimized. Thus, the CCA problem is …
Advances And Challenges For Scalable Provenance In Stream Processing Systems, Archan Misra, Marion Blount, Anastasios Kementsietsidis, Daby Sow, Min Wang
Advances And Challenges For Scalable Provenance In Stream Processing Systems, Archan Misra, Marion Blount, Anastasios Kementsietsidis, Daby Sow, Min Wang
Research Collection School Of Computing and Information Systems
While data provenance is a well-studied topic in both database and workflow systems, its support within stream processing systems presents a new set of challenges. Part of the challenge is the high stream event rate and the low processing latency requirements imposed by many streaming applications. For example, emerging streaming applications in healthcare or finance call for data provenance, as illustrated in the Century stream processing infrastructure that we are building for supporting online healthcare analytics. At anytime, given an output data element (e.g., a medical alert) generated by Century, the system must be able to retrieve the input and …