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 7291 - 7320 of 8692
Full-Text Articles in Entire DC Network
Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang
Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang
Research Collection School Of Computing and Information Systems
Similarity search over long sequence dataset becomes increasingly popular in many emerging applications, such as text retrieval, genetic sequences exploring, etc. In this paper, a novel index structure, namely Sequence Embedding Multiset tree (SEM − tree), has been proposed to speed up the searching process over long sequences. The SEM-tree is a multi-level structure where each level represents the sequence data with different compression level of multiset, and the length of multiset increases towards the leaf level which contains original sequences. The multisets, obtained using sequence embedding algorithms, have the desirable property that they do not need to keep the …
Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li
Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li
Research Collection School Of Computing and Information Systems
Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN …
Communication-Efficient Classification In P2p Networks, Hock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong Ng, Steven C. H. Hoi
Communication-Efficient Classification In P2p Networks, Hock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong Ng, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Distributed classification aims to learn with accuracy comparable to that of centralized approaches but at far lesser communication and computation costs. By nature, P2P networks provide an excellent environment for performing a distributed classification task due to the high availability of shared resources, such as bandwidth, storage space, and rich computational power. However, learning in P2P networks is faced with many challenging issues; viz., scalability, peer dynamism, asynchronism and fault-tolerance. In this paper, we address these challenges by presenting CEMPaR—a communication-efficient framework based on cascading SVMs that exploits the characteristics of DHT-based lookup protocols. CEMPaR is designed to be robust …
A Hybrid Firm's Pricing Strategy In Electronic Commerce Under Channel Migration, Robert John Kauffman, Dongwon Lee, Jung Lee, Byungjoon Yoo
A Hybrid Firm's Pricing Strategy In Electronic Commerce Under Channel Migration, Robert John Kauffman, Dongwon Lee, Jung Lee, Byungjoon Yoo
Research Collection School Of Computing and Information Systems
Achieving an effective business design across the Internet and the off-line channel is a critical concern for a hybrid firm's choice of pricing strategy. Two pricing models are proposed to examine how consumer channel migration (one-way channel interaction from the traditional sales channel to the Internet) affects pricing strategy. One model has no interaction between the Internet and off-line channels. The other includes the possibility of one-way migration to the Internet channel and incorporates consumers' channel-switching costs and loyalty to the firm. The two models offer interesting results for understanding traditional and Internet-based selling. A high level of channel migration …
Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma
Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma
Research Collection School Of Computing and Information Systems
Future Generation CDMA wireless systems, e.g., 3G, can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As radio resources are limited, we propose an admission control rule that protects users with stringent transmission bit-rate requirements (“streaming traffic”) while offering sufficient capacity over longer time intervals to delay-tolerant users (“elastic traffic”). While our strategy may not satisfy classical notions of fairness, we aim to reduce congestion and increase overall throughput of elastic users. Using time-scale decomposition, we develop approximations to evaluate the performance of our differentiated admission control strategy to support integrated services with transmission bit-rate requirements in a …
Exploiting Bilingual Information To Improve Web Search, Wei Gao, John Bitzer, Ming Zhou, Kam-Fai Wong
Exploiting Bilingual Information To Improve Web Search, Wei Gao, John Bitzer, Ming Zhou, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Web search quality can vary widely across languages, even for the same information need. We propose to exploit this variation in quality by learning a ranking function on bilingual queries: queries that appear in query logs for two languages but represent equivalent search interests. For a given bilingual query, along with corresponding monolingual query log and monolingual ranking, we generate a ranking on pairs of documents, one from each language. Then we learn a linear ranking function which exploits bilingual features on pairs of documents, as well as standard monolingual features. Finally, we show how to reconstruct monolingual ranking from …
Evaluating Straddle Carrier Deployment Policies: A Simulation Study For The Piraeus Container Terminal, Eleni Hadjiconstantinou, Nang Laik Ma
Evaluating Straddle Carrier Deployment Policies: A Simulation Study For The Piraeus Container Terminal, Eleni Hadjiconstantinou, Nang Laik Ma
Research Collection School Of Computing and Information Systems
Most container terminals in the world today are operating up to their capacities. In this paper, we have developed a decision support system to optimise yard operations by considering all container flows (import, export and transshipment) through the yard with the view to improving the terminal performance and efficiency. In another paper, we proposed an optimisation model that determines optimal container locations and straddle carrier (SC) movements with the objective of minimising the overall storage and handling cost of containers. In this paper, a discrete event simulation tool for container terminal operations has been developed with three objectives: (i) to …
Are Male And Female Avatars Perceived Equally In 3-D Virtual Worlds?, David Dewester, Fiona Fui-Hoon Nah, Sarah Gervais, Keng Siau
Are Male And Female Avatars Perceived Equally In 3-D Virtual Worlds?, David Dewester, Fiona Fui-Hoon Nah, Sarah Gervais, Keng Siau
Research Collection School Of Computing and Information Systems
Virtual worlds are three-dimensional, computer-generated worlds in which users take the form of avatars and use those avatars to interact with objects and other avatars in the virtual world. Virtual worlds are growing in importance in both educational institutions and businesses. Educational institutions have adopted virtual worlds as a medium for instructional delivery whereas businesses are using virtual worlds for recruitment, training, collaboration, and marketing. Given these emerging phenomena, a better understanding of behavioral and perceptual issues in virtual worlds is warranted. We propose a research model to study the interaction effects of gender stereotypicality of male and female avatars …
3-D Virtual Worlds And Higher Education, X. Chen, Keng Siau, Fiona Fui-Hoon Nah
3-D Virtual Worlds And Higher Education, X. Chen, Keng Siau, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Conducting education in three-dimensional (3-D) virtual worlds is an emerging phenomenon in the educational arena. The objective of this research is to investigate the factors influencing students’ intention to adopt the 3-D virtual worlds for delivery of education. Drawing on existing technology acceptance models as well as studies in traditional and distance education, we developed a model to study students’ acceptance of using a 3-D virtual world for education and propose to test the model empirically using survey data collected from college students. We also study the use of two instructional methods in the 3-D virtual world. This study contributes …
Measuring Method Complexity: Uml Versus Bpmn, Jan Recker, Michael Zur Muehlen, Keng Siau, John Erickson, Marta Indulska
Measuring Method Complexity: Uml Versus Bpmn, Jan Recker, Michael Zur Muehlen, Keng Siau, John Erickson, Marta Indulska
Research Collection School Of Computing and Information Systems
Graphical models are used to depict relevant aspects of real-world domains intended to be supported by an information system. Various approaches for modeling exist and approaches such as object-oriented and process-oriented modeling methods are in widespread use. These modeling methods differ in their expressive power as well as in their complexity of use, thereby leading to an important investment decision for organizations seeking to conduct modeling projects. In this paper, we used an established approach for evaluating the complexity of conceptual modeling methods and compared two important industry standards for modeling, Unified Modeling Language and Business Process Modeling Notation, based …
Essential Spreadsheet Modeling Course For Business Students, Thin Yin Leong, Michelle L. F. Cheong
Essential Spreadsheet Modeling Course For Business Students, Thin Yin Leong, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
Ask any student at the Singapore Management University (SMU) to name one of the most practical and useful courses offered by the university. The answer would inevitably include CAT. CAT stands for the "Computer as an Analysis Tool" course. Originally based on a course of the same title offered by the Wharton Business School, the focus of CAT was shifted to provide business students the essential practical skills and necessary "real-world" exposure to better use personal computers for resolving business problems. The course is basically centered on using the Excel spreadsheet to work on ambiguous ill-defined problems.
Ssnetviz: A Visualization Engine For Heterogeneous Semantic Social Networks, Ee Peng Lim, Maureen Maureen, Nelman Lubis Ibrahim, Aixin Sun, Anwitaman Datta, Kuiyu Chang
Ssnetviz: A Visualization Engine For Heterogeneous Semantic Social Networks, Ee Peng Lim, Maureen Maureen, Nelman Lubis Ibrahim, Aixin Sun, Anwitaman Datta, Kuiyu Chang
Research Collection School Of Computing and Information Systems
SSnetViz is an ongoing research to design and implement a visualization engine for heterogeneous semantic social networks. A semantic social network is a multi-modal network that contains nodes representing di®erent types of people or object entities, and edges representing relationships among them. When multiple heterogeneous semantic social networks are to be visualized together, SSnetViz provides a suite of functions to store heterogeneous semantic social networks, to integrate them for searching and analysis. We will illustrate these functions using social networks related to terrorism research, one crafted by domain experts and another from Wikipedia.
Setting Discrete Bid Levels Adaptively In Repeated Auctions, Jilian Zhang, Hoong Chuin Lau, Jialie Shen
Setting Discrete Bid Levels Adaptively In Repeated Auctions, Jilian Zhang, Hoong Chuin Lau, Jialie Shen
Research Collection School Of Computing and Information Systems
The success of an auction design often hinges on its ability to set parameters such as reserve price and bid levels that will maximize an objective function such as the auctioneer revenue. Works on designing adaptive auction mechanisms have emerged recently, and the challenge is in learning different auction parameters by observing the bidding in previous auctions. In this paper, we propose a non-parametric method for determining discrete bid levels dynamically so as to maximize the auctioneer revenue. First, we propose a non-parametric kernel method for estimating the probabilities of closing price with past auction data. Then a greedy strategy …
Data Mining For Software Engineering, Tao Xie, Suresh Thummalapenta, David Lo, Chao Liu
Data Mining For Software Engineering, Tao Xie, Suresh Thummalapenta, David Lo, Chao Liu
Research Collection School Of Computing and Information Systems
To improve software productivity and quality, software engineers are increasingly applying data mining algorithms to various software engineering tasks. However, mining SE data poses several challenges. The authors present various algorithms to effectively mine sequences, graphs, and text from such data.
On Efficient Mutual Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li
On Efficient Mutual Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li
Research Collection School Of Computing and Information Systems
This paper studies a new form of nearest neighbor queries in spatial databases, namely, mutual nearest neighbour (MNN) search. Given a set D of objects and a query object q, an MNN query returns from D, the set of objects that are among the k1 (≥ 1) nearest neighbors (NNs) of q; meanwhile, have q as one of their k2(≥ 1) NNs. Although MNN queries are useful in many applications involving decision making, data mining, and pattern recognition, it cannot be efficiently handled by existing spatial query processing approaches. In this paper, we present …
A Distributed Spatial Index For Error-Prone Wireless Data Broadcast, Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik Lun Lee, Min Shao
A Distributed Spatial Index For Error-Prone Wireless Data Broadcast, Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik Lun Lee, Min Shao
Research Collection School Of Computing and Information Systems
Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broadcast systems, a distributed spatial index (called DSI) is presented in this paper. DSI is highly efficient because it has a linear yet fully distributed structure that naturally shares links in different search paths. DSI is very resilient to the error-prone wireless communication environment because interrupted search operations based on DSI can be resumed easily. It supports search algorithms for classical location-based queries such as window queries and kNN queries …
A Fair Assignment Algorithm For Multiple Preference Queries, Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
A Fair Assignment Algorithm For Multiple Preference Queries, Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Consider an internship assignment system, where at the end of each academic year, interested university students search and apply for available positions, based on their preferences (e.g., nature of the job, salary, office location, etc). In a variety of facility, task or position assignment contexts, users have personal preferences expressed by different weights on the attributes of the searched objects. Although individual preference queries can be evaluated by selecting the object in the database with the highest aggregate score, in the case of multiple simultaneous requests, a single object cannot be assigned to more than one users. The challenge is …
Symphony: Enabling Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw
Symphony: Enabling Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw
Research Collection School Of Computing and Information Systems
We present the design of Symphony, a platform that enables non-developers to build and deploy a new class of search-driven applications that combine their data and domain expertise with content from search engines and other web services. The Symphony prototype has been built on top of Microsoft’s Live Search infrastructure. While Symphony naturally makes use of the customization capabilities exposed by Live Search, its distinguishing feature is the capability it provides to the application creator to combine their proprietary data and domain expertise with content obtained from Live Search. They can also integrate specialized data obtained from web services to …
Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang
Multilayer Image Inpainting Approach Based On Neural Networks, Quan Wang, Zhaoxia Wang, Che Sau Chang, Ting Yang
Research Collection School Of Computing and Information Systems
This paper describes an image inpainting approach based on the self-organizing map for dividing an image into several layers, assigning each damaged pixel to one layer, and then restoring these damaged pixels by the information of their respective layer. These inpainted layers are then fused together to provide the final inpainting results. This approach takes advantage of the neural network's ability of imitating human's brain to separate objects of an image into different layers for inpainting. The approach is promising as clearly demonstrated by the results in this paper.
Inferring Player Rating From Performance Data In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Muhammad Aurangzeb Ahmad, Nishith Pathak, Jaideep Srivastava
Inferring Player Rating From Performance Data In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Muhammad Aurangzeb Ahmad, Nishith Pathak, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
This paper examines online player performance in EverQuest II, a popular massively multiplayer online role-playing game (MMORPG) developed by Sony Online Entertainment. The study uses the game's player performance data to devise performance metrics for online players. We report three major findings. First, we show that the game's point-scaling system overestimates performances of lower level players and underestimates performances of higher level players. We present a novel point-scaling system based on the game's player performance data that addresses the underestimation and overestimation problems. Second, we present a highly accurate predictive model for player performance as a function of past behavior. …
Multi-Task Transfer Learning For Weakly-Supervised Relation Extraction, Jing Jiang
Multi-Task Transfer Learning For Weakly-Supervised Relation Extraction, Jing Jiang
Research Collection School Of Computing and Information Systems
Creating labeled training data for relation extraction is expensive. In this paper, we study relation extraction in a special weakly-supervised setting when we have only a few seed instances of the target relation type we want to extract but we also have a large amount of labeled instances of other relation types. Observing that different relation types can share certain common structures, we propose to use a multi-task learning method coupled with human guidance to address this weakly-supervised relation extraction problem. The proposed framework models the commonality among different relation types through a shared weight vector, enables knowledge learned from …
Optimal-Location-Selection Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li
Optimal-Location-Selection Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li
Research Collection School Of Computing and Information Systems
This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D_A, a target object set D_B, a spatial region R, and a critical distance d_c in a multidimensional space, an OLS query retrieves those target objects in D_B that are outside R but have maximal optimality. Here, the optimality of a target object b \in D_B located outside R is defined as the number of the data objects from D_A that are inside R and meanwhile have their distances to b not exceeding …
Scalable Verification For Outsourced Dynamic Databases, Hwee Hwa Pang, Jilian Zhang, Kyriakos Mouratidis
Scalable Verification For Outsourced Dynamic Databases, Hwee Hwa Pang, Jilian Zhang, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Query answers from servers operated by third parties need to be verified, as the third parties may not be trusted or their servers may be compromised. Most of the existing authentication methods construct validity proofs based on the Merkle hash tree (MHT). The MHT, however, imposes severe concurrency constraints that slow down data updates. We introduce a protocol, built upon signature aggregation, for checking the authenticity, completeness and freshness of query answers. The protocol offers the important property of allowing new data to be disseminated immediately, while ensuring that outdated values beyond a pre-set age can be detected. We also …
Game Action Based Power Management For Multiplayer Online Game, Bhojan Anand, A. L. Ananda, Mun Choon Chan, Long Thanh Le, Rajesh Krishna Balan
Game Action Based Power Management For Multiplayer Online Game, Bhojan Anand, A. L. Ananda, Mun Choon Chan, Long Thanh Le, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
Current mobile devices embrace a wide range of functionalities including high speed network support, hardware accelerated 3D graphics, and multimedia capabilities. These capabilities have boosted the interest for enabling multiplayer online games (MOG) support on such devices. However, the lack of similar growth in battery technology limits the usability of these devices for MOGs. In this paper, we present energy conservation techniques for highly interactive MOGs. These are games, such as first-person shooters, where crisp user interaction is paramount to the overall game experience. Hence, conserving energy while preserving crisp user interaction becomes a critical consideration in this domain. We …
Extracting Paraphrases Of Technical Terms From Noisy Parallel Software Corpus, Xiaoyin Wang, David Lo, Jing Jiang, Lu Zhang, Hong Mei
Extracting Paraphrases Of Technical Terms From Noisy Parallel Software Corpus, Xiaoyin Wang, David Lo, Jing Jiang, Lu Zhang, Hong Mei
Research Collection School Of Computing and Information Systems
In this paper, we study the problem of extracting technical paraphrases from a parallel software corpus, namely, a collection of duplicate bug reports. Paraphrase acquisition is a fundamental task in the emerging area of text mining for software engineering. Existing paraphrase extraction methods are not entirely suitable here due to the noisy nature of bug reports. We propose a number of techniques to address the noisy data problem. The empirical evaluation shows that our method significantly improves an existing method by upto 58%
Formal Verification Of Scalable Nonzero Indicators, Jun Sun, Yang Liu, Jun Sun, Jin Song Dong, Wei Chen, Yanhong A. Liu
Formal Verification Of Scalable Nonzero Indicators, Jun Sun, Yang Liu, Jun Sun, Jin Song Dong, Wei Chen, Yanhong A. Liu
Research Collection School Of Computing and Information Systems
Concurrent algorithms are notoriously difficult to design correctly, and high performance algorithms that make little or no use of locks even more so. In this paper, we describe a formal verification of a recent concurrent data structure Scalable NonZero Indicators. The algorithm supports incrementing, decrementing, and querying the shared counter in an efficient and linearizable way without blocking. The algorithm is highly non-trivial and it is challenging to prove the correctness. We have proved that the algorithm satisfies linearizability, by showing a trace refinement relation from the concrete implementation to its abstract specification. These models are specified in CSP and …
Large-Scale Near-Duplicate Web Video Search: Challenge And Opportunity, Wan-Lei Zhao, Song Tan, Chong-Wah Ngo
Large-Scale Near-Duplicate Web Video Search: Challenge And Opportunity, Wan-Lei Zhao, Song Tan, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
The massive amount of near-duplicate and duplicate web videos has presented both challenge and opportunity to multimedia computing. On one hand, browsing videos on Internet becomes highly inefficient for the need to repeatedly fast-forward videos of similar content. On the other hand, the tremendous amount of somewhat duplicate content also makes some traditionally difficult vision tasks become simple and easy. For example, annotating pictures can be as simple as recycling the tags of Internet images retrieved from image search engines. Such tasks, of either to eliminate or to recycle near-duplicates, can usually be achieved by the nearest neighbor search of …
Bonus Plans Of Mice And Men, M. Thulasidas
Bonus Plans Of Mice And Men, M. Thulasidas
Research Collection School Of Computing and Information Systems
Our best-laid plans often go awry. We see it all the time at a personal level -- accidents (both good and bad), deaths (both of loved ones and rich uncles), births, and lotteries all conspire to reshuffle our priorities and render our plans null and void. In fact, there is nothing like a solid misfortune to get us to put things in perspective. This opportunity may be the proverbial silver lining we are constantly advised to see. What is true at a personal level holds true also at a larger scale. The industry-wide financial meltdown has imparted a philosophical clarity …
Efficient Non-Interactive Range Proof, Tsz Hon Yuen, Qiong Huang, Yi Mu, Willy Susilo, Duncan S. Wong, Guomin Yang
Efficient Non-Interactive Range Proof, Tsz Hon Yuen, Qiong Huang, Yi Mu, Willy Susilo, Duncan S. Wong, Guomin Yang
Research Collection School Of Computing and Information Systems
We propose the first constant size non-interactive range proof which is not based on the heuristic Fiat-Shamir transformation and whose security does not rely on the random oracle assumption. The proof consists of a constant number of group elements. Compared with the most efficient constant-size range proof available in the literature, our scheme has significantly reduced the proof size. We showed that our scheme achieves perfect completeness, perfect soundness and composable zero-knowledge under a conventional number-theoretic assumption, namely the Subgroup Decision Problem.
Compositemap: A Novel Framework For Music Similarity Measure, Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wang
Compositemap: A Novel Framework For Music Similarity Measure, Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wang
Research Collection School Of Computing and Information Systems
With the continuing advances in data storage and communication technology, there has been an explosive growth of music information from different application domains. As an effective technique for organizing, browsing, and searching large data collections, music information retrieval is attracting more and more attention. How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems. In this paper, we introduce a novel framework based on a multimodal and adaptive similarity measure for various applications. Distinguished from previous approaches, our system can effectively combine music properties from different aspects into a …