Open Access. Powered by Scholars. Published by Universities.®

Data Storage Systems Commons™

Open Access. Powered by Scholars. Published by Universities.®

1,559 Full-Text Articles 3,949 Authors 816,536 Downloads 124 Institutions

All Articles in Data Storage Systems

Faceted Search

1,559 full-text articles. Page 30 of 75.

Feature Extraction And Parallel Visualization For Large-Scale Scientific Data, Lina Yu 2017 University of Nebraska-Lincoln

Feature Extraction And Parallel Visualization For Large-Scale Scientific Data, Lina Yu

School of Computing: Dissertations, Theses, and Student Research

Advanced computing and sensing technologies enable scientists to study natural and physical phenomena with unprecedented precision, resulting in an explosive growth of data. The unprecedented amounts of data generated from large scientific simulations impose a grand challenge in data analytics and visualization due to the fact that data are too massive for transferring, storing, and processing.

This dissertation makes the first contribution to the design of novel transfer functions and application-aware data replacement policy to facilitate feature classification on highly parallel distributed systems. We design novel transfer functions that advance the classification of continuously changed volume data by combining the …


Bim+Blockchain: A Solution To The Trust Problem In Collaboration?, Malachy Mathews, Dan Robles, Brian Bowe 2017 Technological University Dublin

Bim+Blockchain: A Solution To The Trust Problem In Collaboration?, Malachy Mathews, Dan Robles, Brian Bowe

Conference papers

This paper provides an overview of historic and current organizational limitations emerging in the Architecture, Engineering, Construction, Building Owner / Operations (AECOO) Industry. It then provides an overview of new technologies that attempt to mitigate these limitations. However, these technologies, taken together, appear to be converging and creating entirely new organizational structures in the AEC industries. This may be characterized by the emergence of what is called the Network Effect and it’s related calculus. This paper culminates with an introduction to Blockchain Technology (BT) and it’s integration with the emergence of groundbreaking technologies such as Internet of Things (IoT), Artificial …


Resource Estimation For Large Scale, Real-Time Image Analysis On Live Video Cameras Worldwide, Caleb Tung, Yung-Hsiang Lu, Anup Mohan 2017 Purdue University

Resource Estimation For Large Scale, Real-Time Image Analysis On Live Video Cameras Worldwide, Caleb Tung, Yung-Hsiang Lu, Anup Mohan

The Summer Undergraduate Research Fellowship (SURF) Symposium

Thousands of public cameras live-stream an abundance of data to the Internet every day. If analyzed in real-time by computer programs, these cameras could provide unprecedented utility as a global sensory tool. For example, if cameras capture the scene of a fire, a system running image analysis software on their footage in real-time could be programmed to react appropriately (perhaps call firefighters). No such technology has been deployed at large scale because the sheer computing resources needed have yet to be determined. In order to help us build computer systems powerful enough to achieve such lifesaving feats, we developed a …


Semantic Visualization For Short Texts With Word Embeddings, Van Minh Tuan LE, Hady W. LAUW 2017 Singapore Management University

Semantic Visualization For Short Texts With Word Embeddings, Van Minh Tuan Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Semantic visualization integrates topic modeling and visualization, such that every document is associated with a topic distribution as well as visualization coordinates on a low-dimensional Euclidean space. We address the problem of semantic visualization for short texts. Such documents are increasingly common, including tweets, search snippets, news headlines, or status updates. Due to their short lengths, it is difficult to model semantics as the word co-occurrences in such a corpus are very sparse. Our approach is to incorporate auxiliary information, such as word embeddings from a larger corpus, to supplement the lack of co-occurrences. This requires the development of a …


Smartphone Sensing Meets Transport Data: A Collaborative Framework For Transportation Service Analytics, Yu LU, Archan MISRA, Wen SUN, Huayu WU 2017 Beijing Normal University

Smartphone Sensing Meets Transport Data: A Collaborative Framework For Transportation Service Analytics, Yu Lu, Archan Misra, Wen Sun, Huayu Wu

Research Collection School Of Computing and Information Systems

We advocate for and introduce TRANSense, a framework for urban transportation service analytics that combines participatory smartphone sensing data with city-scale transportation-related transactional data (taxis, trains etc.). Our work is driven by the observed limitations of using each data type in isolation: (a) commonly-used anonymous city-scale datasets (such as taxi bookings and GPS trajectories) provide insights into the aggregate behavior of transport infrastructure, but fail to reveal individual-specific transport experiences (e.g., wait times in taxi queues); while (b) mobile sensing data can capture individual-specific commuting-related activities, but suffers from accuracy and energy overhead challenges due to usage artefacts and lack …


Integrity Coded Databases: Ensuring Correctness And Freshness Of Outsourced Databases, Ujwal Karki 2017 Boise State University

Integrity Coded Databases: Ensuring Correctness And Freshness Of Outsourced Databases, Ujwal Karki

Boise State University Theses and Dissertations

In recent years, cloud storage has become an inexpensive and convenient option for individuals and businesses to store and retrieve information. The cloud releases the data owner from the financial burden of hiring professionals to create, update and maintain local databases. The advancements in the field of networking and the growing need for computing resources for various applications have made cloud computing more demanding. Its positive aspects make the cloud an attractive option for data storage, but this service comes with a cost that it requires the data owner to relinquish control of their information to the cloud service provider. …


Indexing Metric Uncertain Data For Range Queries And Range Joins, Lu CHEN, Yunjun GAO, Aoxiao ZHONG, Christian S. JENSEN, Gang CHEN, Baihua ZHENG 2017 Zhejiang University

Indexing Metric Uncertain Data For Range Queries And Range Joins, Lu Chen, Yunjun Gao, Aoxiao Zhong, Christian S. Jensen, Gang Chen, Baihua Zheng

Research Collection School Of Computing and Information Systems

Range queries and range joins in metric spaces have applications in many areas, including GIS, computational biology, and data integration, where metric uncertain data exist in different forms, resulting from circumstances such as equipment limitations, high-throughput sequencing technologies, and privacy preservation. We represent metric uncertain data by using an object-level model and a bi-level model, respectively. Two novel indexes, the uncertain pivot B+-tree (UPB-tree) and the uncertain pivot B+-forest (UPB-forest), are proposed in order to support probabilistic range queries and range joins for a wide range of uncertain data types and similarity metrics. Both index structures use a small set …


Geometric Approaches For Top-K Queries [Tutorial], Kyriakos MOURATIDIS 2017 Singapore Management University

Geometric Approaches For Top-K Queries [Tutorial], Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Top-k processing is a well-studied problem with numerous applications that is becoming increasingly relevant with the growing availability of recommendation systems and decision-making software. The objective of this tutorial is twofold. First, we will delve into the geometric aspects of top-k processing. Second, we will cover complementary features to top-k queries, with strong practical relevance and important applications, that have a computational geometric nature. The tutorial will close with insights in the effect of dimensionality on the meaningfulness of top-k queries, and interesting similarities to nearest neighbor search.


Embedding-Based Representation Of Categorical Data By Hierarchical Value Coupling Learning, Songlei JIAN, Longbing CAO, Guansong PANG, Kai LU, Hang GAO 2017 Singapore Management University

Embedding-Based Representation Of Categorical Data By Hierarchical Value Coupling Learning, Songlei Jian, Longbing Cao, Guansong Pang, Kai Lu, Hang Gao

Research Collection School Of Computing and Information Systems

Learning the representation of categorical data with hierarchical value coupling relationships is very challenging but critical for the effective analysis and learning of such data. This paper proposes a novel coupled unsupervised categorical data representation (CURE) framework and its instantiation, i.e., a coupled data embedding (CDE) method, for representing categorical data by hierarchical value-to-value cluster coupling learning. Unlike existing embedding- and similarity-based representation methods which can capture only a part or none of these complex couplings, CDE explicitly incorporates the hierarchical couplings into its embedding representation. CDE first learns two complementary feature value couplings which are then used to cluster …


Learning Homophily Couplings From Non-Iid Data For Joint Feature Selection And Noise-Resilient Outlier Detection, Guansong PANG, Longbing CAO, Ling CHEN, Huan LIU 2017 Singapore Management University

Learning Homophily Couplings From Non-Iid Data For Joint Feature Selection And Noise-Resilient Outlier Detection, Guansong Pang, Longbing Cao, Ling Chen, Huan Liu

Research Collection School Of Computing and Information Systems

This paper introduces a novel wrapper-based outlier detection framework (WrapperOD) and its instance (HOUR) for identifying outliers in noisy data (i.e., data with noisy features) with strong couplings between outlying behaviors. Existing subspace or feature selection-based methods are significantly challenged by such data, as their search of feature subset(s) is independent of outlier scoring and thus can be misled by noisy features. In contrast, HOUR takes a wrapper approach to iteratively optimize the feature subset selection and outlier scoring using a top-k outlier ranking evaluation measure as its objective function. HOUR learns homophily couplings between outlying behaviors (i.e., abnormal behaviors …


Time-Aware Conversion Prediction, Wendi JI, Xiaoling WANG, Feida ZHU 2017 East China Normal University

Time-Aware Conversion Prediction, Wendi Ji, Xiaoling Wang, Feida Zhu

Research Collection School Of Computing and Information Systems

The importance of product recommendation has been well recognized as a central task in business intelligence for e-commerce websites. Interestingly, what has been less aware of is the fact that different products take different time periods for conversion. The “conversion” here refers to actually a more general set of pre-defined actions, including for example purchases or registrations in recommendation and advertising systems. The mismatch between the product’s actual conversion period and the application’s target conversion period has been the subtle culprit compromising many existing recommendation algorithms.The challenging question: what products should be recommended for a given time period to maximize …


Pivot-Based Metric Indexing, Lu CHEN, Yunjun GAO, Baihua ZHENG, Christian S. JENSEN, Hanyu YANG, Keyu YANG 2017 Zhejiang University

Pivot-Based Metric Indexing, Lu Chen, Yunjun Gao, Baihua Zheng, Christian S. Jensen, Hanyu Yang, Keyu Yang

Research Collection School Of Computing and Information Systems

The general notion of a metric space encompasses a diverse range of data types and accompanying similarity measures. Hence, metric search plays an important role in a wide range of settings, including multimedia retrieval, data mining, and data integration. With the aim of accelerating metric search, a collection of pivot-based indexing techniques for metric data has been proposed, which reduces the number of potentially expensive similarity comparisons by exploiting the triangle inequality for pruning and validation. However, no comprehensive empirical study of those techniques exists. Existing studies each offers only a narrower coverage, and they use different pivot selection strategies …


Attribute-Based Encryption With Expressive And Authorized Keyword Search, Hui CUI, Robert H. DENG, Joseph K. LIU, Yingjiu LI 2017 Singapore Management University

Attribute-Based Encryption With Expressive And Authorized Keyword Search, Hui Cui, Robert H. Deng, Joseph K. Liu, Yingjiu Li

Research Collection School Of Computing and Information Systems

To protect data security and privacy in cloud storage systems, a common solution is to outsource data in encrypted forms so that the data will remain secure and private even if storage systems are compromised. The encrypted data, however, must be pliable to search and access control. In this paper, we introduce a notion of attribute-based encryption with expressive and authorized keyword search (ABE-EAKS) to support both expressive keyword search and fine-grained access control over encrypted data in the cloud. In ABE-EAKS, every data user is associated with a set of attributes and is issued a private attribute-key corresponding to …


Discovering Newsworthy Themes From Sequenced Data: A Step Towards Computational Journalism, Qi FAN, Yuchen LI, Dongxiang ZHANG, Kian-Lee Tan TAN 2017 Singapore Management University

Discovering Newsworthy Themes From Sequenced Data: A Step Towards Computational Journalism, Qi Fan, Yuchen Li, Dongxiang Zhang, Kian-Lee Tan Tan

Research Collection School Of Computing and Information Systems

Automatic discovery of newsworthy themes from sequenced data can relieve journalists from manually poring over a large amount of data in order to find interesting news. In this paper, we propose a novel k -Sketch query that aims to find k striking streaks to best summarize a subject. Our scoring function takes into account streak strikingness and streak coverage at the same time. We study the k -Sketch query processing in both offline and online scenarios, and propose various streak-level pruning techniques to find striking candidates. Among those candidates, we then develop approximate methods to discover the k most representative …


Mining Capstone Project Wikis For Knowledge Discovery, Swapna GOTTIPATI, Venky SHANKARARAMAN, Melvrivk GOH 2017 Singapore Management University

Mining Capstone Project Wikis For Knowledge Discovery, Swapna Gottipati, Venky Shankararaman, Melvrivk Goh

Research Collection School Of Computing and Information Systems

Wikis are widely used collaborative environments as sources of information and knowledge. The facilitate students to engage in collaboration and share information among members and enable collaborative learning. In particular, Wikis play an important role in capstone projects. Wikis aid in various project related tasks and aid to organize information and share. Mining project Wikis is critical to understand the students learning and latest trends in industry. Mining Wikis is useful to educationists and academicians for decision-making about how to modify the educational environment to improve student's learning. The main challenge is that the content or data in project Wikis …


One-To-Cloud One-Time Pad Data Encryption: Introducing Virtual Prototyping With Pspice, Paul Tobin, Lee Tobin, Roberto Gandia Blanquer DR, Michael McKeever, Jonathan Blackledge 2017 Technological University Dublin

One-To-Cloud One-Time Pad Data Encryption: Introducing Virtual Prototyping With Pspice, Paul Tobin, Lee Tobin, Roberto Gandia Blanquer Dr, Michael Mckeever, Jonathan Blackledge

Conference papers

In this paper, we examine the design and application of a one-time pad encryption system for protecting data stored in the Cloud. Personalising security using a one-time pad generator at the client-end protects data from break-ins, side-channel attacks and backdoors in public encryption algorithms. The one-time pad binary sequences were obtained from modified analogue chaos oscillators initiated by noise and encoded client data locally. Specific ``one-to-Cloud'' storage applications returned control back to the end user but without the key distribution problem normally associated with one-time pad encryption. Development of the prototype was aided by ``Virtual Prototyping'' in the latest version …


Blend It Applications And Server, Rebecca McKinley, Cory Mayer, Tyler Fox, Alex Bartlett, Aly Chapman 2017 California Polytechnic State University, San Luis Obispo

Blend It Applications And Server, Rebecca Mckinley, Cory Mayer, Tyler Fox, Alex Bartlett, Aly Chapman

Computer Engineering

No abstract provided.


Smartgarden, Samuel S. Lees, Matthew T. Lindly 2017 California Polytechnic State University, San Luis Obispo

Smartgarden, Samuel S. Lees, Matthew T. Lindly

Computer Engineering

The problem that the SmartGarden project seeks to solve is the challenge of watering succulents correctly and maintaining consistent plant health. Too much water can cause root rot and drowning while too little water can cause dehydration and starvation.
The SmartGarden solves this common problem by configuring a Raspberry Pi to measure soil moisture, store the data to an AWS server in the cloud, and water the succulent when necessary, informing the user by providing both a web-interface and a variety of notifications.


Table Of Contents Jitim Vol 26 Issue 2, 2017, 2017 California State University, San Bernardino

Table Of Contents Jitim Vol 26 Issue 2, 2017

Journal of International Technology and Information Management

Table of Contents JITIM vol 26 issue 2, 2017


Is The Whole Greater Than The Sum Of Its Parts?, Liangyue LI, Hanghang TONG, Yong WANG, Conglei SHI, Nan CAO, Norbou BUCHLER 2017 Singapore Management University

Is The Whole Greater Than The Sum Of Its Parts?, Liangyue Li, Hanghang Tong, Yong Wang, Conglei Shi, Nan Cao, Norbou Buchler

Research Collection School Of Computing and Information Systems

The PART-WHOLE relationship routinely finds itself in many disciplines, ranging from collaborative teams, crowdsourcing, autonomous systems to networked systems. From the algorithmic perspective, the existing work has primarily focused on predicting the outcomes of the whole and parts, by either separate models or linear joint models, which assume the outcome of the parts has a linear and independent effect on the outcome of the whole. In this paper, we propose a joint predictive method named PAROLE to simultaneously and mutually predict the part and whole outcomes. The proposed method offers two distinct advantages over the existing work. First (Model Generality), …


Digital Commons powered by bepress