Data Storage Systems Commons^™

Computational-Communicative Actions Of Informational Processing, Florentin Smarandache, Stefan Vladutescu

Branch Mathematics and Statistics Faculty and Staff Publications

This study is circumscribed to the Information Science. The zetetic aim of research is double: a) to define the concept of action of informational processing and b) to design a taxonomy of actions of informational processing. First, the investigation trays to demonstrate that the computational actions of informational processing or the informational actions are computational-investigative configurations for structuring information: clusters of highly-aggregated operations which are carried out in a unitary manner operate convergently and behave like a unique computational device. From a methodological point of view, they are comprised within the category of analytical instruments for the informational processing of …

Agricultural And Water Harvesting Opportunities In Kenya, Via A Crowd-Sourced, Citizen Science Hybrid Paradigm, Benjamin D. Branch, James Tindall, Rosemary Moki, Peter N. Baker, Jai Xu, Elisa Bertino

Libraries Faculty and Staff Presentations

This is potential joint collaborative research between the Purdue University and citizens of Kenya via the Global Engineering Program in the areas of agriculture in water harvesting. Specifically, in the rural part of Kenya, outside of Nairobi, lives can be greatly impacted. Libraries of tomorrow will have global capacity and responsibility to serve all aspects of global citizenry. Herein is one possible Kenyan example.

In partnership with the Tinmore Institute, an International Food, Water, and Energy Security team of experts, such international collaboration with Purdue's Global Engineering program could be quite successful within the areas of agricultural and water security …

A Cris Data Science Investigation Of Scientific Workflows Of Agriculture Big Data And Its Data Curation Elements, Benjamin D. Branch, Peter N. Baker, Jai Xu, Elisa Bertino

Libraries Faculty and Staff Presentations

This joint collaboration between the Purdue Libraries and Cyber Center demonstrates the next generation of computational platforms supporting interdisciplinary collaborative research. Such platforms are necessary for rapid advancements of technology, industry demand and scholarly congruence towards open data, open access, big data and cyber-infrastructure data science training. Our approach will utilize a Discovery Undergraduate Research Investigation effort as a preliminary research means to further joint library and computer science data curation research, tool development and refinement.

Cal Poly Library Of Pyroprints: Quality Control Analysis And Web Development, Chase Ricketts

Computer Science and Software Engineering

No abstract provided.

Providing Flexible File-Level Data Filtering For Big Data Analytics, Lei Xu, Ziling Huang, Hong Jiang, Lei Tian, David Swanson

School of Computing: Technical Reports

The enormous amount of big data datasets impose the needs for effective data filtering technique to accelerate the analytics process. We propose a Versatile Searchable File System, VSFS, which provides a transparent, flexible and near real-time file-level data filtering service by searching files directly through the file system. Therefore, big data analytics applications can transparently utilize this filtering service without application modifications. A versatile index scheme is designed to adapt to the exploratory and ad-hoc nature of the big data analytics activities. Moreover, VSFS uses a RAM-based distributed architecture to perform file indexing. The evaluations driven by three real-world analytics …

Evaluation And Analysis Of Distributed Graph-Parallel Processing Frameworks, Yue Zhao, Kenji Yoshigoe, Mengjun Xie, Suijian Zhou, Remzi Seker, Jiang Bian

Publications

A number of graph-parallel processing frameworks have been proposed to address the needs of processing complex and large-scale graph structured datasets in recent years. Although significant performance improvement made by those frameworks were reported, comparative advantages of each of these frameworks over the others have not been fully studied, which impedes the best utilization of those frameworks for a specific graph computing task and setting. In this work, we conducted a comparison study on parallel processing systems for large-scale graph computations in a systematic manner, aiming to reveal the characteristics of those systems in performing common graph algorithms with real-world …

Myspace, Inc. V. Graphon Corp.: Ignoring The Basic Premise That 101 Must Come Before 102 And 103, Emmanuel A. Fishelman

Journal of Business & Technology Law

No abstract provided.

On The Security Of Auditing Mechanisms For Secure Cloud Storage, Yong Yu, Lei Niu, Guomin Yang, Yi Mu, Willy Susilo

Research Collection School Of Computing and Information Systems

Cloud computing is a novel computing model that enables convenient and on-demand access to a shared pool of configurable computing resources. Auditing services are highly essential to make sure that the data is correctly hosted in the cloud. In this paper, we investigate the active adversary attacks in three auditing mechanisms for shared data in the cloud, including two identity privacy-preserving auditing mechanisms called Oruta and Knox, and a distributed storage integrity auditing mechanism.We show that these schemes become insecure when active adversaries are involved in the cloud storage. Specifically, an active adversary can arbitrarily alter the cloud data without …

Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of distance between any two m  n matrices. If the distance is 0 or m  n there is nothing interesting. When the distance happens to be a value t; 0 < t < m  n the study is both innovating and interesting. The three cases of study which is carried out in this book are 1. If the difference between two square matrices is large, will it imply the eigen values and eigen vectors of those matrices are distinct? Several open conjectures in this direction are given. 2. The difference between parity check matrix and the generator matrix for the same C(n, k) code is studied. This will help in detecting errors in storage systems as well as in cryptography.

Data Management In Cloud Environments: Nosql And Newsql Data Stores, Katarina Grolinger, Wilson A. Higashino, Abhinav Tiwari, Miriam Am Capretz

Electrical and Computer Engineering Publications

: Advances in Web technology and the proliferation of mobile devices and sensors connected to the Internet have resulted in immense processing and storage requirements. Cloud computing has emerged as a paradigm that promises to meet these requirements. This work focuses on the storage aspect of cloud computing, specifically on data management in cloud environments. Traditional relational databases were designed in a different hardware and software era and are facing challenges in meeting the performance and scale requirements of Big Data. NoSQL and NewSQL data stores present themselves as alternatives that can handle huge volume of data. Because of the …

Tascked: The Sanity Promoting Task Manager, Jake Tobin

Computer Science and Software Engineering

Personal task managers or various forms of to-do lists are abundant in our modern computing age. With the explosion of mobile computing technology, it is easier than ever to take notes digitally and make the data seemingly instantly available anywhere on the Internet. There is a fairly well defined core set of features in personal task managers available for public consumption, but it seems nothing that is publicly available provides feedback to the user or suggestions based on user history. Tascked is a task management solution, which records user history and solicits user feedback on progress. This allows the system …

Adaptive Computer‐Generated Forces For Simulator‐Based Training, Expert Systems With Applications, Teck-Hou Teng, Ah-Hwee Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Simulator-based training is in constant pursuit of increasing level of realism. The transition from doctrine-driven computer-generated forces (CGF) to adaptive CGF represents one such effort. The use of doctrine-driven CGF is fraught with challenges such as modeling of complex expert knowledge and adapting to the trainees’ progress in real time. Therefore, this paper reports on how the use of adaptive CGF can overcome these challenges. Using a self-organizing neural network to implement the adaptive CGF, air combat maneuvering strategies are learned incrementally and generalized in real time. The state space and action space are extracted from the same hierarchical doctrine …

An Open Source, Line Rate Datagram Protocol Facilitating Message Resiliency Over An Imperfect Channel, Christina Marie Smith

Graduate Theses and Dissertations

Remote Direct Memory Access (RDMA) is the transfer of data into buffers between two compute nodes that does not require the involvement of a CPU or Operating System (OS). The idea is borrowed from Direct Memory Access (DMA) which allows memory within a compute node to be transferred without transiting through the CPU. RDMA is termed a zero-copy protocol as it eliminates the need to copy data between buffers within the protocol stack. Because of this and other features, RDMA promotes reliable, high throughput and low latency transfer for packet-switched networking. While the benefits of RMDA are well known and …

A Simple Integration Of Social Relationship And Text Data For Identifying Potential Customers In Microblogging, Guansong Pang, Shengyi Jiang, Dongyi Chen

Research Collection School Of Computing and Information Systems

Identifying potential customers among a huge number of users in microblogging is a fundamental problem for microblog marketing. One challenge in potential customer detection in microblogging is how to generate an accurate characteristic description for users, i.e., user profile generation. Intuitively, the preference of a user’s friends (i.e., the person followed by the user in microblogging) is of great importance to capture the characteristic of the user. Also, a user’s self-defined tags are often concise and accurate carriers for the user’s interests. In this paper, for identifying potential customers in microblogging, we propose a method to generate user profiles via …

D-Tunes: Configuration Engine For Geo-Replicated Cloud Storage, Jiawei Wang, Sanjay Rao

The Summer Undergraduate Research Fellowship (SURF) Symposium

When developing a web-based application, developers are facing stringent requirements to balance the latency, scalability and availability for their cloud database. Application developers need a specific replication configuration strategy based on the requirement of their application. To deal with this problem, some geo-replicated cloud strategy systems have emerged recently, like Cassandra. This project serves to design a web tool that can help configure the best replication strategies for geo-distributed data stores, which uses quorum-based protocols. Currently, our web tool D-Tunes, require a minimum input from users and generate specific scripts based on the inputs user provided. The program running these …

Is Real-Time Mobile Content-Based Image Retrieval Feasible?, Colin G. Graber, Anup Mohan, Yung-Hsiang Lu

The Summer Undergraduate Research Fellowship (SURF) Symposium

Content-based image retrieval (CBIR) is a method of searching through a database of images by using another image as a query instead of text. Recent advances in the processing power of smart phones and tablets, collectively known as mobile devices, have prompted researchers to attempt to construct mobile CBIR systems. Most of the research that has been conducted on mobile CBIR has focused on improving either its accuracy or its run-time, but not both simultaneously. We set out to answer the question: is real-time CBIR with manageable accuracy possible on current mobile devices? To find the answer to this question, …

Image Search By Graph-Based Label Propagation With Image Representation From Dnn, Yingwei Pan, Yao Ting, Kuiyuan Yang, Houqiang Li, Chong-Wah Ngo, Jingdong Wang, Tao Mei

Research Collection School Of Computing and Information Systems

Our objective is to estimate the relevance of an image to a query for image search purposes. We address two limitations of the existing image search engines in this paper. First, there is no straightforward way of bridging the gap between semantic textual queries as well as users’ search intents and image visual content. Image search engines therefore primarily rely on static and textual features. Visual features are mainly used to identify potentially useful recurrent patterns or relevant training examples for complementing search by image reranking. Second, image rankers are trained on query-image pairs labeled by human experts, making the …

Annotation For Free: Video Tagging By Mining User Search Behavior, Yao Ting, Tao Mei, Chong-Wah Ngo, Shipeng Li

Research Collection School Of Computing and Information Systems

The problem of tagging is mostly considered from the perspectives of machine learning and data-driven philosophy. A fundamental issue that underlies the success of these approaches is the visual similarity, ranging from the nearest neighbor search to manifold learning, to identify similar instances of an example for tag completion. The need to searching for millions of visual examples in high-dimensional feature space, however, makes the task computationally expensive. Moreover, the results can suffer from robustness problem, when the underlying data, such as online videos, are rich of semantics and the similarity is difficult to be learnt from low-level features. This …

Error Recovered Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Hierarchical classification (HC) is a popular and efficient way for detecting the semantic concepts from the images. However, the conventional HC, which always selects the branch with the highest classification response to go on, has the risk of propagating serious errors from higher levels of the hierarchy to the lower levels. We argue that the highestresponse-first strategy is too arbitrary, because the candidate nodes are considered individually which ignores the semantic relationship among them. In this paper, we propose a novel method for HC, which is able to utilize the semantic relationship among candidate nodes and their children to recover …

Web-Scale Near-Duplicate Search: Techniques And Applications, Chong-Wah Ngo, Changsheng Xu, Wessel Kraaij, Abdulmotaleb El Saddik

Research Collection School Of Computing and Information Systems

This paper presents some of the most recent advances in the research on Web-scale near-duplicate search and explores the potential for bringing this research a substantial step further. It contains high-quality contributions addressing various aspects of the Web-scale near-duplicate search problem in a number of relevant domains. The topics range from feature representation, matching, and indexing from different novel aspects to the adaptation of current technologies for mobile media search and photo archaeology mining.