Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (157)
- Databases and Information Systems (62)
- Software Engineering (34)
- Numerical Analysis and Scientific Computing (27)
- Business (21)
-
- Engineering (17)
- Information Security (15)
- Graphics and Human Computer Interfaces (13)
- Artificial Intelligence and Robotics (12)
- Management Information Systems (12)
- Social and Behavioral Sciences (10)
- Computer Engineering (9)
- Operations Research, Systems Engineering and Industrial Engineering (8)
- Data Storage Systems (7)
- OS and Networks (6)
- Communication (5)
- Programming Languages and Compilers (5)
- Theory and Algorithms (5)
- E-Commerce (4)
- Economics (3)
- Social Media (3)
- Communication Technology and New Media (2)
- Education (2)
- Public Affairs, Public Policy and Public Administration (2)
- Statistics and Probability (2)
- Asian Studies (1)
- Defense and Security Studies (1)
- Digital Communications and Networking (1)
- Econometrics (1)
- Keyword
-
- Algorithms (6)
- Blog (3)
- Model Check (3)
- Near-duplicate keyframe (3)
- Performance (3)
-
- Animation (2)
- Blog classification (2)
- Blog profiling (2)
- Concept-based video search (2)
- Entry selection (2)
- Experimentation (2)
- Image copy detection (2)
- Image retrieval (2)
- Linear Temporal Logic (2)
- Nonrigid image matching (2)
- Online community (2)
- Ontology (2)
- Popular queries (2)
- Query processing (2)
- Reinforcement learning (2)
- Remote attestation (2)
- Routing (2)
- Search results (2)
- Semi-supervised learning (2)
- Social tagging (2)
- Spatial databases (2)
- Supervised learning (2)
- Support vector machines (2)
- Trusted computing (2)
- Visual relatedness (2)
Articles 121 - 150 of 161
Full-Text Articles in Physical Sciences and Mathematics
Work Dispersion, Process-Based Learning And Offshore Software Development Performance, Narayanasamy Ramasubbu, Sunil Mithas, M. S. Krishnan, Chris Kemerer
Work Dispersion, Process-Based Learning And Offshore Software Development Performance, Narayanasamy Ramasubbu, Sunil Mithas, M. S. Krishnan, Chris Kemerer
Research Collection School Of Computing and Information Systems
In this paper we develop a learning-mediated model of offshore software project productivity and quality to examine whether widely adopted structured software processes are effective in mitigating the negative effects of work dispersion in offshore software development. We explicate how the key process areas of the capability maturity model (CMM) can be utilized as a platform to launch learning routines in offshore software development and thereby explain why some offshore software development process improvement initiatives are more effective than others. We validate our learning-mediated model of offshore software project performance by utilizing data collected from 42 offshore software projects of …
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 …
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 …
Semi-Supervised Distance Metric Learning For Collaborative Image Retrieval, Steven Hoi, Wei Liu, Shih-Fu Chang
Semi-Supervised Distance Metric Learning For Collaborative Image Retrieval, Steven Hoi, Wei Liu, Shih-Fu Chang
Research Collection School Of Computing and Information Systems
Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, relevance feedback has been adopted as a promising approach to improve the search performance. In this paper, we propose a novel idea of learning with historical relevance feedback log data, and adopt a new paradigm called “Collaborative Image Retrieval” (CIR). To effectively explore the log data, we propose a novel semi-supervised distance metric learning technique, called “Laplacian Regularized Metric Learning” (LRML), for learning robust distance metrics for CIR. Different from previous methods, the proposed LRML method integrates both …
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, …
Platform Competition In Digital Systems: Architectural Control And Value Migration, C. Jason Woodard
Platform Competition In Digital Systems: Architectural Control And Value Migration, C. Jason Woodard
Research Collection School Of Computing and Information Systems
Digital systems give rise to complex layered architectures in which products at one layer serve as platforms for applications and services in adjacent layers. Platform owners face a difficult balancing act. On one hand, they need to make their platforms attractive to potential complementors by mitigating the threat of architectural lock-in. On the other hand, platform owners must be careful not to give away too much too soon, or risk being unable to recoup their own investments. This paper presents an agent-based model that explores this tension at both the firm and industry levels. Computational experiments show that boundedly rational …
Verifying Completeness Of Relational Query Answers From Online Servers, Hwee Hwa Pang, Kian-Lee Tan
Verifying Completeness Of Relational Query Answers From Online Servers, Hwee Hwa Pang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online servers over extended periods of time. A breached server that is not detected in time may return incorrect query answers to users. In this article, we introduce authentication schemes for users to verify that their query answers from an online server are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values are legitimate). We introduce a scheme that supports range selection, projection as well as primary key-foreign key join queries on relational databases. We also …
Scalable Detection Of Semantic Clones, Mark Gabel, Lingxiao Jiang, Zhendong Su
Scalable Detection Of Semantic Clones, Mark Gabel, Lingxiao Jiang, Zhendong Su
Research Collection School Of Computing and Information Systems
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant code, locate bugs, or gain insight into program design. Existing scalable approaches to clone detection are limited to finding program fragments that are similar only in their contiguous syntax. Other, semantics-based approaches are more resilient to differences in syntax, such as reordered statements, related statements interleaved with other unrelated statements, or the use of semantically equivalent control structures. However, none of these techniques have scaled to real world code bases. These approaches capture semantic …
A Verification System For Timed Interval Calculus, Chunqing Chen, Jin Song Dong, Jun Sun
A Verification System For Timed Interval Calculus, Chunqing Chen, Jin Song Dong, Jun Sun
Research Collection School Of Computing and Information Systems
Timed Interval Calculus (TIC) is a highly expressive set-based notation for specifying and reasoning about embedded real-time systems. However, it lacks mechanical proving support, as its verification usually involves infinite time intervals and continuous dynamics. In this paper, we develop a system based on a generic theorem prover, Prototype Verification System (PVS), to assist formal verification of TIC at a high grade of automation. TIC semantics has been constructed by the PVS typed higher-order logic. Based on the encoding, we have checked all TIC reasoning rules and discovered subtle flaws. A translator has been implemented in Java to automatically transform …
Stress Test, M. Thulasidas
Stress Test, M. Thulasidas
Research Collection School Of Computing and Information Systems
Ultimately, the risk factors that create stress in professional life do not generate any reward
A Dynamic Trust Management Scheme To Mitigate Malware Proliferation In P2p Networks, Xuhua Ding, Wei Yu, Ying Pan
A Dynamic Trust Management Scheme To Mitigate Malware Proliferation In P2p Networks, Xuhua Ding, Wei Yu, Ying Pan
Research Collection School Of Computing and Information Systems
The surge of peer-to-peer (P2P) networks consisting of thousands of of hosts makes them a breeding ground for malware proliferation. Although some existing studies have shown that malware proliferation can pose significant threats to P2P networks, defending against such an attack is largely an open problem. This paper aims to develop the countermeasure that can effectively mitigate the malware proliferation while preserving P2P networks' performance. To this end, we propose a dynamic trust management scheme based upon localized trust evaluation and alert propagation which prevents innocent peers from downloading files from infected peers. Our analysis and experimental results show that …
Architectural Control Points, C. Jason Woodard
Architectural Control Points, C. Jason Woodard
Research Collection School Of Computing and Information Systems
System designers and technology strategists have long recognized the concept of an architectural control point as a way to identify parts of a system that have particular strategic importance. Despite the vast body of work on system architecture in the engineering design literature, however, few authors have attempted to define architectural control points or study them systematically. Moreover, some industry participants have questioned whether architectural control is still a valuable or achievable goal in an era of increasingly open standards. This paper offers tentative definitions of architectural control, architectural control points, and architectural strategy. In a longer version of the …
A Scalable Approach To Multi-Style Architectural Modeling And Verification, Stephen Wong, Jing Sun, Ian Warren, Jun Sun
A Scalable Approach To Multi-Style Architectural Modeling And Verification, Stephen Wong, Jing Sun, Ian Warren, Jun Sun
Research Collection School Of Computing and Information Systems
Software Architecture represents the high level description of a system in terms of components, external properties and communication. Despite its importance in the software engineering process, the lack of formal description and verification support limits the value of developing architectural models. Automated formal engineering methods can provide an effective means to precisely describe and rigorously verify intended structures and behaviors of software systems. In this paper, we present an approach to support the design and verification of software architectural models using the Alloy analyzer. Based on our earlier work, we propose a fundamental library for specifying system structures in terms …
A Formal Model Of Semantic Web Service Ontology (Wsmo) Execution, Hai H. Wang, Nick Gibbins, Terry R. Payne, Ahmed Saleh, Jun Sun
A Formal Model Of Semantic Web Service Ontology (Wsmo) Execution, Hai H. Wang, Nick Gibbins, Terry R. Payne, Ahmed Saleh, Jun Sun
Research Collection School Of Computing and Information Systems
Semantic Web services have been one of the most significant research areas within the semantic Web vision, and have been recognized as a promising technology that exhibits huge commercial potential. Current semantic Web service research focuses on defining models and languages for the semantic markup of all relevant aspects of services, which are accessible through a Web service interface. The Web service modelling ontology (WSMO) is one of the most significant semantic Web service framework proposed to date. To support the standardization and tool support of WSMO, a formal semantics of the language is highly desirable. As there are a …
Rate-Diversity And Resource-Aware Broadcast And Multicast In Multi-Rate Wireless Mesh Networks, Bao Hua Liu, Chun Tung Chou, Archan Misra, Sanjay Jha
Rate-Diversity And Resource-Aware Broadcast And Multicast In Multi-Rate Wireless Mesh Networks, Bao Hua Liu, Chun Tung Chou, Archan Misra, Sanjay Jha
Research Collection School Of Computing and Information Systems
This paper focuses on the problem of increasing the traffic capacity (volume of admissible traffic) of broadcast and multicast flows in a wireless mesh network (WMN). We study and suggest routing strategies where the process of constructing the forwarding tree considers three distinct features: (a) the ability of individual mesh nodes to perform link-layer broadcasts at multiple rates, (b) the wireless broadcast advantage, whereby a single broadcast transmission covers multiple neighboring receivers and (c) the residual transmission capacity at a WMN node, subject to intereference-based constraints from existing traffic flows in its neighborhood. Our metric of interest is the total …
K-Sketch: A 'Kinetic' Sketch Pad For Novice Animators, Richard C. Davis, Brien Colwell, James A. Landay
K-Sketch: A 'Kinetic' Sketch Pad For Novice Animators, Richard C. Davis, Brien Colwell, James A. Landay
Research Collection School Of Computing and Information Systems
Because most animation tools are complex and timeconsuming to learn and use, most animations today are created by experts. To help novices create a wide range of animations quickly, we have developed a general-purpos informal, 2D animation sketching system called K-Sketch. Field studies investigating the needs of animatorsnd would-be animators helped us collect a library of usage scenarios for our tool. A novel optimization technique enabled us to design an interface that is simultaneously fast, simple, and powerful. The result is a pen-based system that relies on users’ intuitive sense of space and time while still supporting a wide range …
Building A Web Of Trust Without Explicit Trust Ratings, Young Ae Kim, Minh-Tam Le, Hady W. Lauw, Ee Peng Lim, Haifeng Liu, Jaideep Srivastava
Building A Web Of Trust Without Explicit Trust Ratings, Young Ae Kim, Minh-Tam Le, Hady W. Lauw, Ee Peng Lim, Haifeng Liu, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
A satisfactory and robust trust model is gaining importance in addressing information overload, and helping users collect reliable information in online communities. Current research on trust prediction strongly relies on a web of trust, which is directly collected from users based on previous experience. However, the web of trust is not always available in online communities and even though it is available, it is often too sparse to predict the trust value between two unacquainted people with high accuracy. In this paper, we propose a framework to derive degree of trust based on users' expertise and users' affinity for certain …
Measurement And Estimation Of Network Qos Among Peer Xbox 360 Game Players, Youngki Lee, Sharad Agarwal, Chris Butcher, Jitu Padhye
Measurement And Estimation Of Network Qos Among Peer Xbox 360 Game Players, Youngki Lee, Sharad Agarwal, Chris Butcher, Jitu Padhye
Research Collection School Of Computing and Information Systems
The research community has proposed several techniques for estimating the quality of network paths in terms of delay and capacity. However, few techniques have been studied in the context of large deployed applications. Network gaming is an application that is extremely sensitive to network path quality [1,2,3]. Yet, the quality of network paths among players of large, wide-area games and techniques for estimating it have not received much attention from the research community.
E-Government Implementation: A Macro Analysis Of Singapore's E-Government Initiatives, Calvin M.L. Chan, Yi Meng Lau, Shan L. Pan
E-Government Implementation: A Macro Analysis Of Singapore's E-Government Initiatives, Calvin M.L. Chan, Yi Meng Lau, Shan L. Pan
Research Collection School Of Computing and Information Systems
This paper offers a macro perspective of the various activities involved in the implementation of e-government through an interpretive analysis of the various e-government-related initiatives undertaken by the Singapore Government. The analysis lead to the identification of four main components in the implementation of e-government, namely (i) information content, (ii) ICT infrastructure, (iii) e-government infostructure, and (iv) e-government promotion. These four components were then conceptually integrated into the e-Government Implementation Framework. This paper suggests that this framework can either be used as a descriptive tool to organize and coordinate various e-government initiatives, or be used as a prescriptive structure to …
Efficient Optimistic Fair Exchange Secure In The Multi-User Setting And Chosen-Key Model Without Random Oracles, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Efficient Optimistic Fair Exchange Secure In The Multi-User Setting And Chosen-Key Model Without Random Oracles, Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo
Research Collection School Of Computing and Information Systems
Optimistic fair exchange is a kind of protocols to solve the problem of fair exchange between two parties. Almost all the previous work on this topic are provably secure only in the random oracle model. In PKC 2007, Dodis et al. considered optimistic fair exchange in a multi-user setting, and showed that the security of an optimistic fair exchange in a single-user setting may no longer be secure in a multi-user setting. Besides, they also proposed one and reviewed several previous construction paradigms and showed that they are secure in the multi-user setting. However, their proofs are either in the …
Validating Multi-Column Schema Matchings By Type, Bing Tian Dai, Nick Koudas, Divesh Srivastava, Anthony K.H. Tung, Suresh Venkatasubramanian
Validating Multi-Column Schema Matchings By Type, Bing Tian Dai, Nick Koudas, Divesh Srivastava, Anthony K.H. Tung, Suresh Venkatasubramanian
Research Collection School Of Computing and Information Systems
Validation of multi-column schema matchings is essential for successful database integration. This task is especially difficult when the databases to be integrated contain little overlapping data, as is often the case in practice (e.g., customer bases of different companies). Based on the intuition that values present in different columns related by a schema matching will have similar "semantic type", and that this can be captured using distributions over values ("statistical types"), we develop a method for validating 1-1 and compositional schema matchings. Our technique is based on three key technical ideas. First, we propose a generic measure for comparing two …
Comp-Ref: A Technique To Guide The Delegation Of Responsibilities To Components In Software Systems, Subhajit Datta, Robert Van Engelen
Comp-Ref: A Technique To Guide The Delegation Of Responsibilities To Components In Software Systems, Subhajit Datta, Robert Van Engelen
Research Collection School Of Computing and Information Systems
In software systems, components collaborate to collectively fulfill requirements. A key concern of software design is the delegation of responsibilities to components such that user needs are most expediently met. This paper presents the COMP-REF technique based on a set of metrics and Linear Programming (LP) to guide the allocation of responsibilities of a system’s components. We define the metrics Aptitude Index, Requirement Set, and Concordance Index to extract some design characteristics and use these metrics in an optimization algorithm. Results from experimental validation of the COMP-REF technique across a range of software systems are reported. We also …
On-Line Discovery Of Hot Motion Paths, Dimitris Sacharidis, Kostas Patroumpas, Manolis Terrovitis, Verena Kantere, Michalis Potamias, Kyriakos Mouratidis, Timos Sellis
On-Line Discovery Of Hot Motion Paths, Dimitris Sacharidis, Kostas Patroumpas, Manolis Terrovitis, Verena Kantere, Michalis Potamias, Kyriakos Mouratidis, Timos Sellis
Research Collection School Of Computing and Information Systems
We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investigate the problem of maintaining hot motion paths, i.e., routes frequently followed by multiple objects over the recent past. Motion paths approximate portions of objects' movement within a tolerance margin that depends on the uncertainty inherent in positional measurements. Discovery of hot motion paths is important to applications requiring classification/profiling based on monitored movement patterns, such as targeted advertising, resource allocation, etc. To achieve this goal, we delegate part of the path extraction process to objects, …
Harmoni: Context-Aware Filtering Of Sensor Data For Continuous Remote Health Monitoring, Iqbal Mohomed, Archan Misra, Maria Ebling, William Jerome
Harmoni: Context-Aware Filtering Of Sensor Data For Continuous Remote Health Monitoring, Iqbal Mohomed, Archan Misra, Maria Ebling, William Jerome
Research Collection School Of Computing and Information Systems
A promising architecture for remote healthcare monitoring involves the use of a pervasive device (such as a cellular phone), which aggregates data from multiple body-worn medical sensors and transmits the data to the backend. Unfortunately, the volume of data generated by increasingly sophisticated continuouslyactive sensors can overwhelm the resources on the mobile device. We propose imbuing the mobile device with the intelligence to perform context-aware filtering of sensor data streams in order to reduce transmissions in cases where the observed data corresponds to the norm expected by the system in a given context. To investigate the efficacy of this technique, …
Processing Transitive Nearest-Neighbor Queries In Multi-Channel Access Environments, Xiao Zhang, Wang-Chien Lee, Prasnjit Mitra, Baihua Zheng
Processing Transitive Nearest-Neighbor Queries In Multi-Channel Access Environments, Xiao Zhang, Wang-Chien Lee, Prasnjit Mitra, Baihua Zheng
Research Collection School Of Computing and Information Systems
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs, can access only one channel at a time. In this paper, we consider a scenario of near future where a mobile device has the ability to process queries using information simultaneously received from multiple channels. We focus on the query processing of the transitive nearest neighbor (TNN) search [19]. Two TNN algorithms developed for a single broadcast channel environment are adapted to our new broadcast enviroment. Based on the obtained insights, we propose …
Wafer-Bonded Active/Passive Vertically Coupled Microring Lasers, M. Hamacher, H. Heidrich, U. Troppenz, D. Syvridis, D. Alexandropoulos, S. Mikroulis, A. Kapsalis, Chyng Wen Tee, K. A. Williams, V. Dragoi, M. Alexe, D. Cristea, M. Kusko
Wafer-Bonded Active/Passive Vertically Coupled Microring Lasers, M. Hamacher, H. Heidrich, U. Troppenz, D. Syvridis, D. Alexandropoulos, S. Mikroulis, A. Kapsalis, Chyng Wen Tee, K. A. Williams, V. Dragoi, M. Alexe, D. Cristea, M. Kusko
Research Collection Lee Kong Chian School Of Business
We summarize the results of a European Project entitled WAPITI (Waferbonding and Active Passive Integration Technology and Implementation) dealing with the fabrication and investigation of active/passive vertically coupled ring resonators, wafer bonded on GaAs, and based on full wafer technology. The concept allows for the integration of an active ring laser vertically coupled to a transparent bus waveguide. All necessary layers are grown in a single epitaxial run so that the critical coupling gap can be precisely controlled with the high degree of accuracy of epitaxial growth. One key challenge of the project …
On Ranking Controversies In Wikipedia: Models And Evaluation, Ba-Quy Vuong, Ee Peng Lim, Aixin Sun, Minh-Tam Le, Hady Wirawan Lauw, Kuiyu Chang
On Ranking Controversies In Wikipedia: Models And Evaluation, Ba-Quy Vuong, Ee Peng Lim, Aixin Sun, Minh-Tam Le, Hady Wirawan Lauw, Kuiyu Chang
Research Collection School Of Computing and Information Systems
Wikipedia 1 is a very large and successful Web 2.0 example. As the number of Wikipedia articles and contributors grows at a very fast pace, there are also increasing disputes occurring among the contributors. Disputes often happen in articles with controversial content. They also occur frequently among contributors who are "aggressive" or controversial in their personalities. In this paper, we aim to identify controversial articles in Wikipedia. We propose three models, namely the Basic model and two Controversy Rank (CR) models. These models draw clues from collaboration and edit history instead of interpreting the actual articles or edited content. While …
Integrating Temporal Difference Methods And Self‐Organizing Neural Networks For Reinforcement Learning With Delayed Evaluative Feedback, Ah-Hwee Tan, Ning Lu, Dan Xiao
Integrating Temporal Difference Methods And Self‐Organizing Neural Networks For Reinforcement Learning With Delayed Evaluative Feedback, Ah-Hwee Tan, Ning Lu, Dan Xiao
Research Collection School Of Computing and Information Systems
This paper presents a neural architecture for learning category nodes encoding mappings across multimodal patterns involving sensory inputs, actions, and rewards. By integrating adaptive resonance theory (ART) and temporal difference (TD) methods, the proposed neural model, called TD fusion architecture for learning, cognition, and navigation (TD-FALCON), enables an autonomous agent to adapt and function in a dynamic environment with immediate as well as delayed evaluative feedback (reinforcement) signals. TD-FALCON learns the value functions of the state-action space estimated through on-policy and off-policy TD learning methods, specifically state-action-reward-state-action (SARSA) and Q-learning. The learned value functions are then used to determine the …
Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Research Collection School Of Computing and Information Systems
Story clustering is a critical step for news retrieval, topic mining, and summarization. Nonetheless, the task remains highly challenging owing to the fact that news topics exhibit clusters of varying densities, shapes, and sizes. Traditional algorithms are found to be ineffective in mining these types of clusters. This paper offers a new perspective by exploring the pairwise visual cues deriving from near-duplicate keyframes (NDK) for constraint-based clustering. We propose a constraint-driven co-clustering algorithm (CCC), which utilizes the near-duplicate constraints built on top of text, to mine topic-related stories and the outliers. With CCC, the duality between stories and their underlying …
Private Query On Encrypted Data In Multi-User Setting, Feng Bao, Robert H. Deng, Xuhua Ding, Yanjiang Yang
Private Query On Encrypted Data In Multi-User Setting, Feng Bao, Robert H. Deng, Xuhua Ding, Yanjiang Yang
Research Collection School Of Computing and Information Systems
Searchable encryption schemes allow users to perform keyword based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multi-user setting. Our results include a set of security notions for multi-user searchable encryption as well as a construction which is provably secure under the newly introduced security notions.