Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8549)
- Computer Sciences (8532)
- Databases and Information Systems (3451)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1067)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (956)
- Graphics and Human Computer Interfaces (933)
- Social and Behavioral Sciences (734)
- Business (686)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (186)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Feature extraction (46)
- Collaboration (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 5521 - 5550 of 8722
Full-Text Articles in Entire DC Network
Answering Why-Not Questions On Reverse Top-K Queries, Yunjun Gao, Qing Liu, Gang Chen, Baihua Zheng, Linlin Zhou
Answering Why-Not Questions On Reverse Top-K Queries, Yunjun Gao, Qing Liu, Gang Chen, Baihua Zheng, Linlin Zhou
Research Collection School Of Computing and Information Systems
Why-not questions, which aim to seek clarifications on the missing tuples for query results, have recently received considerable attention from the database community. In this paper, we systematically explore why-not questions on reverse top-k queries, owing to its importance in multi-criteria decision making. Given an initial reverse top-k query and a missing/why-not weighting vector set Wm that is absent from the query result, why-not questions on reverse top-k queries explain why Wm does not appear in the query result and provide suggestions on how to refine the initial query with minimum penalty to include Wm in the refined query result. …
Evaluation And Improvement Of Procurement Process With Data Analytics, Melvin H. C. Tan, Wee Leong Lee
Evaluation And Improvement Of Procurement Process With Data Analytics, Melvin H. C. Tan, Wee Leong Lee
Research Collection School Of Computing and Information Systems
Analytics can be applied in procurement to benefit organizations beyond just prevention and detection of fraud. This study aims to demonstrate how advanced data mining techniques such as text mining and cluster analysis can be used to improve visibility of procurement patterns and provide decision-makers with insight to develop more efficient sourcing strategies, in terms of cost and effort. A case study of an organization’s effort to improve its procurement process is presented in this paper. The findings from this study suggest that opportunities exist for organizations to aggregate common goods and services among the purchases made under and across …
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We are concerned with the routine crowd management problem after a major event at a known venue. Without properly design complementary transport services, such sudden crowd build-ups will overwhelm the existing infrastructure. In this paper, we introduce a novel flow-rate based model to model the dynamic movement of passengers over the transportation flow network. Based on this basic model, an integer linear programming model is proposed to solve the bus transit problem permanently. We validate our model against a real scenario in Singapore, where a newly constructed mega-stadium hosts various large events regularly. The results show that the proposed approach …
On Security Of Content-Based Video Stream Authentication, Swee Won Lo, Zhou Wei, Deng, Robert H., Xuhua Ding
On Security Of Content-Based Video Stream Authentication, Swee Won Lo, Zhou Wei, Deng, Robert H., Xuhua Ding
Research Collection School Of Computing and Information Systems
Content-based authentication (CBA) schemes are used to authenticate multimedia streams while allowing content-preserving manipulations such as bit-rate transcoding. In this paper, we survey and classify existing transform-domain CBA schemes for videos into two categories, and point out that in contrary to CBA for images, there exists a common design flaw in these schemes. We present the principles (based on video coding concept) on how the flaw can be exploited to mount semantic-changing attacks in the transform domain that cannot be detected by existing CBA schemes. We show attack examples including content removal, modification and insertion attacks. Noting that these CBA …
Information Retrieval And Spectrum Based Bug Localization: Better Together, Tien-Duy B. Le, Richard J. Oentaryo, David Lo
Information Retrieval And Spectrum Based Bug Localization: Better Together, Tien-Duy B. Le, Richard J. Oentaryo, David Lo
Research Collection School Of Computing and Information Systems
Debugging often takes much effort and resources. To help developers debug, numerous information retrieval (IR)-based and spectrum-based bug localization techniques have been proposed. IR-based techniques process textual information in bug reports, while spectrum-based techniques process program spectra (i.e., a record of which program elements are executed for each test case). Both eventually generate a ranked list of program elements that are likely to contain the bug. However, these techniques only consider one source of information, either bug reports or program spectra, which is not optimal. To deal with the limitation of existing techniques, in this work, we propose a new …
Did You Expect Your Users To Say This?: Distilling Unexpected Micro-Reviews For Venue Owners, Wen-Haw Chong, Bingtian Dai, Ee-Peng Lim
Did You Expect Your Users To Say This?: Distilling Unexpected Micro-Reviews For Venue Owners, Wen-Haw Chong, Bingtian Dai, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
With social media platforms such as Foursquare, users can now generate concise reviews, i.e. micro-reviews, about entities such as venues (or products). From the venue owner's perspective, analysing these micro-reviews will offer interesting insights, useful for event detection and customer relationship management. However not all micro-reviews are equally important, especially since a venue owner should already be familiar with his venue's primary aspects. Instead we envisage that a venue owner will be interested in micro-reviews that are unexpected to him. These can arise in many ways, such as users focusing on easily overlooked aspects (by the venue owner), making comparisons …
Latent Factors Meet Homophily In Diffusion Modelling, Duc Minh Luu, Ee-Peng Lim
Latent Factors Meet Homophily In Diffusion Modelling, Duc Minh Luu, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Diffusion is an important dynamics that helps spreading information within an online social network. While there are already numerous models for single item diffusion, few have studied diffusion of multiple items, especially when items can interact with one another due to their inter-similarity. Moreover, the well-known homophily effect is rarely considered explicitly in the existing diffusion models. This work therefore fills this gap by proposing a novel model called Topic level Interaction Homophily Aware Diffusion (TIHAD) to include both latent factor level interaction among items and homophily factor in diffusion. The model determines item interaction based on latent factors and …
Candy Crushing Your Sleep, Kasthuri Jeyarajah, Meeralakshi Radhakrishnan, Steven C. H. Hoi, Archan Misra
Candy Crushing Your Sleep, Kasthuri Jeyarajah, Meeralakshi Radhakrishnan, Steven C. H. Hoi, Archan Misra
Research Collection School Of Computing and Information Systems
Growing interest in quantified self has led to the popularity of lifelogging applications. In particular, health and wellness related applications have seen an upsurge with the advent of wearables such as the Fitbit. In this paper, we focus on the quality of sleep that directly impacts the overall wellness of individuals. In particular, in this work, we present a first of its kind study that (1) unobtrusively quantifies the quality of sleep and (2) seeks to identify attributing aspects of our daily lives such as an individual's usage of apps throughout the day and his/her physical environment that may affect …
Multi-Factor Duplicate Question Detection In Stack Overflow, Yun Zhang, David Lo, Xin Xia, Jian Ling Sun
Multi-Factor Duplicate Question Detection In Stack Overflow, Yun Zhang, David Lo, Xin Xia, Jian Ling Sun
Research Collection School Of Computing and Information Systems
Stack Overflow is a popular on-line question and answer site for software developers to share their experience and expertise. Among the numerous questions posted in Stack Overflow, two or more of them may express the same point and thus are duplicates of one another. Duplicate questions make Stack Overflow site maintenance harder, waste resources that could have been used to answer other questions, and cause developers to unnecessarily wait for answers that are already available. To reduce the problem of duplicate questions, Stack Overflow allows questions to be manually marked as duplicates of others. Since there are thousands of questions …
Near Real-Time Retail Payment And Settlement Systems Mechanism Design, Zhiling Guo, Robert John Kauffman, Mei Lin, Dan Ma
Near Real-Time Retail Payment And Settlement Systems Mechanism Design, Zhiling Guo, Robert John Kauffman, Mei Lin, Dan Ma
Research Collection School Of Computing and Information Systems
Rapid expansion of e-commerce, along with rising domestic and cross-border payments, has fueled the demand among financial institutions for a cost-effective means to expedite clearing and settlement of low-value retail payments. These are called faster payments settlement systems. Traditionally, retail payments have made extensive use of interbank netting systems, in which payments are accumulated for end-of-day settlement. This approach, known as deferred net settlement (DNS), reduces the liquidity needs of the payment system, but bears inherent operational and financial risks for unsettled intraday payments. As large dollar volumes of retail payments accumulate, real-time gross settlement (RTGS) has been recognized as …
Using Content-Level Structures For Summarizing Microblog Repost Trees, Jing Li, Wei Gao, Zhongyu Wei, Baolin Peng, Kam-Fai Wong
Using Content-Level Structures For Summarizing Microblog Repost Trees, Jing Li, Wei Gao, Zhongyu Wei, Baolin Peng, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
A microblog repost tree provides strong clues on how an event described therein develops. To help social media users capture the main clues of events on microblogging sites, we propose a novel repost tree summarization framework by effectively differentiating two kinds of messages on repost trees called leaders and followers, which are derived from contentlevel structure information, i.e., contents of messages and the reposting relations. To this end, Conditional Random Fields (CRF) model is used to detect leaders across repost tree paths. We then present a variant of random-walk-based summarization model to rank and select salient messages based on the …
Trace Element Composition Of Pm2.5 And Pm10 From Kolkata - A Heavily Polluted Indian Metropolis, Reshmi Das, Bahareh Khezri, Bijayen Srivastava, Subhajit Datta, Pradip Kumar Sikdar, Richard D. Webster, Xianfeng Wang
Trace Element Composition Of Pm2.5 And Pm10 From Kolkata - A Heavily Polluted Indian Metropolis, Reshmi Das, Bahareh Khezri, Bijayen Srivastava, Subhajit Datta, Pradip Kumar Sikdar, Richard D. Webster, Xianfeng Wang
Research Collection School Of Computing and Information Systems
Elemental composition of PM2.5 and PM10 was measured from 16 locations in Greater Kolkata in Eastern India. Sampling was carried out in the winter months of 2013–2014. PM2.5 and PM10 mass concentrations ranged from 83–783 μg/m3 and 167–928 μg/m3 respectively. 20 elements were measured with an Agilent 7700 series ICP–MS equipped with a 3rd generation He reaction/collision cell following closed vessel microwave digestion. In both size fractions Fe, Na, Al, K, Ca were present in high concentrations (>1 000 ng/m3), Mn, Zn and Pb demonstrated medium concentrations (>100 ng/m …
Uedashboard: Awareness Of Unusual Events In Commit Histories, Larissa Leite, Christoph Treude, Fernando Figueira Filho
Uedashboard: Awareness Of Unusual Events In Commit Histories, Larissa Leite, Christoph Treude, Fernando Figueira Filho
Research Collection School Of Computing and Information Systems
To be able to respond to source code modifications with large impact or commits that necessitate further examination, developers and managers in a software development team need to be aware of anything unusual happening in their software projects. To address this need, we introduce UEDashboard, a tool which automatically detects unusual events in a commit history based on metrics and smells, and surfaces them in an event feed. Our preliminary evaluation with a team of professional software developers showed that our conceptualization of unusual correlates with developers' perceptions of task difficulty, and that UEDashboard could be useful in supporting development …
Name List Only? Target Entity Disambiguation In Short Texts, Yixin Cao, Juanzi Li, Xiaofei Guo, Shuanhu Bai, Heng Ji, Jie Tang
Name List Only? Target Entity Disambiguation In Short Texts, Yixin Cao, Juanzi Li, Xiaofei Guo, Shuanhu Bai, Heng Ji, Jie Tang
Research Collection School Of Computing and Information Systems
Target entity disambiguation (TED), the task of identifying target entities of the same domain, has been recognized as a critical step in various important applications. In this paper, we propose a graphbased model called TremenRank to collectively identify target entities in short texts given a name list only. TremenRank propagates trust within the graph, allowing for an arbitrary number of target entities and texts using inverted index technology. Furthermore, we design a multi-layer directed graph to assign different trust levels to short texts for better performance. The experimental results demonstrate that our model outperforms state-of-the-art methods with an average gain …
Learning Of Business Processes & Application: An Industry-Ready Approach, Yi Meng Lau, Yu Yee Poon, Mike Wee
Learning Of Business Processes & Application: An Industry-Ready Approach, Yi Meng Lau, Yu Yee Poon, Mike Wee
Research Collection School Of Computing and Information Systems
The Learning Framework for Business Processes was developed by lectures from School of InfoComm Technology (ICT)to support their students’ learning in the Diploma of Financial Informatics. This framework leverage on the use of learning approaches such as Inquiry based learning to create opportunities for students to be engaged, explore, explain and apply their learning. This framework was presented at International Symposium on Advances in Technology Education (ISATE) 2015 in Nagaoka, Japan.
Spatial And Temporal Trends In Information Technology Outsourcing, Arti Mann, David Folch, Robert J. Kauffman, Luc Anselin
Spatial And Temporal Trends In Information Technology Outsourcing, Arti Mann, David Folch, Robert J. Kauffman, Luc Anselin
Research Collection School Of Computing and Information Systems
Over the last two decades information technology (IT) outsourcing has grown dramatically, and has emerged as a strategic choice for firms searching for ways to control their costs and maintain a competitive edge. The mechanisms driving its growth are not fully understood though. In this research, we employ an approach that focuses on geographic, temporal, and industrial proximity in a mechanism that identifies the process underlying the diffusion of IT outsourcing across firms within the U.S from 2000 to 2010. We focus on the role that firm location plays in the diffusion process, and use space-time clustering techniques from the …
Competition, Cooperation And Regulation: Understanding The Evolution Of The Mobile Payments Technology Ecosystem, Jun Liu, Robert J. Kauffman, Dan Ma
Competition, Cooperation And Regulation: Understanding The Evolution Of The Mobile Payments Technology Ecosystem, Jun Liu, Robert J. Kauffman, Dan Ma
Research Collection School Of Computing and Information Systems
The past twenty years have been a time of many new technological developments, changing business practices, and interesting innovations in the financial information system (IS) and technology landscape. They have led to the increasing use of prior innovations that have supported e-commerce, and that are now being brought into financial services to support different kinds of improvements to core business processes. This research examines recent changes in the payment sector in financial services, specifically related to mobile payments (m-payments) that enable new channels for consumer payments for goods and services purchases, and other forms of economic exchange. We extend recent …
Tonetrack: Leveraging Frequency-Agile Radios For Time-Based Indoor Wireless, Jie Xiong, Karthikeyan Sundaresan, Kyle Jamieson
Tonetrack: Leveraging Frequency-Agile Radios For Time-Based Indoor Wireless, Jie Xiong, Karthikeyan Sundaresan, Kyle Jamieson
Research Collection School Of Computing and Information Systems
Indoor localization of mobile devices and tags has received much attention recently, with encouraging fine-grained localization results available with enough line-of-sight coverage and hardware infrastructure. Some of the most promising techniques analyze the time-of-arrival of incoming signals, but the limited bandwidth available to most wireless transmissions fundamentally constrains their resolution. Frequency-agile wireless networks utilize bandwidths of varying sizes and locations in a wireless band to effi- ciently share the wireless medium between users. ToneTrack is an indoor location system that achieves sub-meter accuracy with minimal hardware and antennas, by leveraging frequency-agile wireless networks to increase the effective bandwidth. Our novel …
Event And Strategy Analytics, Jin Song Dong, Jun Sun, Yang Liu, Yuan-Fang Li, Jing Sun, Ling Shi
Event And Strategy Analytics, Jin Song Dong, Jun Sun, Yang Liu, Yuan-Fang Li, Jing Sun, Ling Shi
Research Collection School Of Computing and Information Systems
Model checking has been pervasive and successful in finding bugs in hardware and software systems, including real-time and probabilistic systems. Applying model checking to decision making is relative new and has an excellent potential to be compliment to data analytics and other Artificial Intelligent (AI) or Operational Research (OR) based decision making techniques. Our last 8 years research has focused on the development of PAT (Process Analysis Toolkit) [18] which supports modelling languages that combine the expressiveness of event, state, time and probability based modeling techniques to which model checking can be directly applied. The next direction for PAT is …
Using Content-Level Structures For Summarizing Microblog Repost Trees, Jing Li, Wei Gao, Zhongyu Wei, Baolin Peng, Kam-Fai Wong
Using Content-Level Structures For Summarizing Microblog Repost Trees, Jing Li, Wei Gao, Zhongyu Wei, Baolin Peng, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
A microblog repost tree provides strong clues on how an event described therein develops. To help social media users capture the main clues of events on microblogging sites, we propose a novel repost tree summarization framework by effectively differentiating two kinds of messages on repost trees called leaders and followers, which are derived from contentlevel structure information, i.e., contents of messages and the reposting relations. To this end, Conditional Random Fields (CRF) model is used to detect leaders across repost tree paths. We then present a variant of random-walk-based summarization model to rank and select salient messages based on the …
On Indistinguishability In Remote Data Integrity Checking, Xinyu Fan, Guomin Yang, Yi Mu, Yong Yu
On Indistinguishability In Remote Data Integrity Checking, Xinyu Fan, Guomin Yang, Yi Mu, Yong Yu
Research Collection School Of Computing and Information Systems
With a rapid growth of data storage in the cloud, data integrity checking in a remote data storage system has become an important issue. A number of protocols, which allow remote integrity checking by a third party, have been proposed. Although those protocols are provably secure, the data privacy issues in those protocols have not been considered. We believe that these issues are equally important since the communication flows of integrity proofs from the cloud server should not reveal any useful information of the stored data. In this paper, we introduce a new definition of data privacy called ‘INDPrivacy’ by …
Attribute Based Broadcast Encryption With Short Ciphertext And Decryption Key, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo, Xiaofeng Chen
Attribute Based Broadcast Encryption With Short Ciphertext And Decryption Key, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo, Xiaofeng Chen
Research Collection School Of Computing and Information Systems
Attribute Based Broadcast Encryption (ABBE) is a combination of Attribute Based Encryption (ABE) and Broadcast Encryption (BE). It allows a broadcaster (or encrypter) to broadcast an encrypted message that can only be decrypted by the receivers who are within a predefined user set and satisfy the access policy specified by the broadcaster. Compared with normal ABE, ABBE allows direct revocation, which is important in many real-time broadcasting applications such as Pay TV. In this paper, we propose two novel ABBE schemes that have distinguishing features: the first scheme is key-policy based and has short ciphertext and constant size decryption key; …
Real-Time Targeted Influence Maximization For Online Advertisements, Yuchen Li, Dongxiang Zhang, Kian-Lee Tan
Real-Time Targeted Influence Maximization For Online Advertisements, Yuchen Li, Dongxiang Zhang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Advertising in social network has become a multi-billion dollar industry. A main challenge is to identify key influencers who can effectively contribute to the dissemination of information. Although the influence maximization problem, which finds a seed set of k most influential users based on certain propagation models, has been well studied, it is not target-aware and cannot be directly applied to online advertising. In this paper, we propose a new problem, named Keyword-Based Targeted Influence Maximization (KB-TIM), to find a seed set that maximizes the expected influence over users who are relevant to a given advertisement. To solve the problem, …
From Physical Security To Cybersecurity, Arunesh Sinha, Thanh H. Nguyen, Debarun Kar, Matthew Brown, Milind Tambe, Albert Xin Jiang
From Physical Security To Cybersecurity, Arunesh Sinha, Thanh H. Nguyen, Debarun Kar, Matthew Brown, Milind Tambe, Albert Xin Jiang
Research Collection School Of Computing and Information Systems
Security is a critical concern around the world. In many domains from cybersecurity to sustainability, limited security resources prevent complete security coverage at all times. Instead, these limited resources must be scheduled (or allocated or deployed), while simultaneously taking into account the importance of different targets, the responses of the adversaries to the security posture, and the potential uncertainties in adversary payoffs and observations, etc. Computational game theory can help generate such security schedules. Indeed, casting the problem as a Stackelberg game, we have developed new algorithms that are now deployed over multiple years in multiple applications for scheduling of …
Mining Revenue-Maximizing Bundling Configuration, Loc Do, Hady Wirawan Lauw, Ke Wang
Mining Revenue-Maximizing Bundling Configuration, Loc Do, Hady Wirawan Lauw, Ke Wang
Research Collection School Of Computing and Information Systems
With greater prevalence of social media, there is an increasing amount of user-generated data revealing consumer preferences for various products and services. Businesses seek to harness this wealth of data to improve their marketing strategies. Bundling, or selling two or more items for one price is a highly-practiced marketing strategy. In this paper, we address the bundle configuration problem from the data-driven perspective. Given a set of items in a seller’s inventory, we seek to determine which items should belong to which bundle so as to maximize the total revenue, by mining consumer preferences data. We show that this problem …
Cobweb: A Robust Map Update System Using Gps Trajectories, Zhangqing Shan, Hao Wu, Weiwei Sun, Baihua Zheng
Cobweb: A Robust Map Update System Using Gps Trajectories, Zhangqing Shan, Hao Wu, Weiwei Sun, Baihua Zheng
Research Collection School Of Computing and Information Systems
The accuracy and completeness of a digital map plays a critical role in determining the quality of most location-based services. Unfortunately, road networks change frequently. Consequently, we study the issue of automatic map update in this paper. We propose a system called COBWEB which takes all the unmatched trajectories as input and generates the missing road segments with both the geometry properties and topology features well preserved. We conduct a comprehensive experimental study via real trajectory data generated by roughly 15,000 taxis in Singapore within a 5-month period. Compared with existing work, COBWEB demonstrates a better and more stable performance …
Special Issue: Contemporary Research On Payments And Cards In The Global Fintech Revolution, Robert John Kauffman, Dan Ma
Special Issue: Contemporary Research On Payments And Cards In The Global Fintech Revolution, Robert John Kauffman, Dan Ma
Research Collection School Of Computing and Information Systems
In the past several years, there has been a lot of activity in the world of financial technologies involving card and payment services, new business products and processes involving mobile phones and location-based services, and also new money capabilities such as Bitcoin and block chain technology. The genesis of this Electronic Commerce Research and Applications Virtual Special Issue (VSI) project grew out of the Editor-in-Chief’s recognition that this journal’s first Special Issue on mobile payments appeared in 2008, when there was still a lot of hype about mobile phones and how mobile payments might work. Today, the past prognostications about …
A Rolling Horizon Auction Mechanism And Virtual Pricing Of Shipping Capacity For Urban Consolidation Centers, Chen Wang, Hoong Chuin Lau, Yun Fong Lim
A Rolling Horizon Auction Mechanism And Virtual Pricing Of Shipping Capacity For Urban Consolidation Centers, Chen Wang, Hoong Chuin Lau, Yun Fong Lim
Research Collection School Of Computing and Information Systems
A number of cities around the world have adopted urban consolidation centers (UCCs) to address challenges of last-mile deliveries. At the UCC, goods are consolidated based on their destinations prior to their deliveries into city centers. Typically, a UCC owns a fleet of ecofriendly vehicles to carry out such deliveries. Shippers/carriers that make use of the UCC’s service hence no longer need to be restricted by timewindow and vehicle-type regulations. As a result, they retain the ability to deploy large trucks for the economies of scale from the source to the UCC which is located outside the city center. Furthermore, …
Maximum Rank Query, Kyriakos Mouratidis, Jilian Zhang, Hwee Hwa Pang
Maximum Rank Query, Kyriakos Mouratidis, Jilian Zhang, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
The top-k query is a common means to shortlist a number of options from a set of alternatives, based on the user's preferences. Typically, these preferences are expressed as a vector of query weights, defined over the options' attributes. The query vector implicitly associates each alternative with a numeric score, and thus imposes a ranking among them. The top-k result includes the k options with the highest scores. In this context, we define the maximum rank query (MaxRank). Given a focal option in a set of alternatives, the MaxRank problem is to compute the highest rank this option may achieve …
Server-Aided Revocable Identity-Based Encryption, Baodong Qin, Deng, Robert H., Yingjiu Li, Shengli Liu
Server-Aided Revocable Identity-Based Encryption, Baodong Qin, Deng, Robert H., Yingjiu Li, Shengli Liu
Research Collection School Of Computing and Information Systems
Efficient user revocation in Identity-Based Encryption (IBE) has been a challenging problem and has been the subject of several research efforts in the literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach, a trusted Key Generation Center (KGC) periodically broadcasts a set of key updates to all (non-revoked) users through public channels, where the size of key updates is only O(r log N/r), with N being the number of users and r the number of revoked users, respectively; however, every user needs to keep at least O(logN) …