Towards a framework for large-scale multimedia data storage and processing on Hadoop platform

2013 ◽  
Vol 68 (1) ◽  
pp. 488-507 ◽  
Author(s):  
Wei Kuang Lai ◽  
Yi-Uan Chen ◽  
Tin-Yu Wu ◽  
Mohammad S. Obaidat
Keyword(s):  
Data Storage ◽  
Large Scale ◽  
Multimedia Data ◽  
Hadoop Platform

Revisiting FPGA Implementation of Digital Filters and Exploring Approximate Computing on Biomedical Signals

2020 ◽  
Vol 10 (9) ◽  
pp. 2000-2004
Author(s):  
Wang Hui ◽  
Gong Chang ◽  
S. Saravanan ◽  
V. Gomathi ◽  
R. Valarmathi ◽  
...  
Keyword(s):  
Data Storage ◽  
Large Scale ◽  
Noise Removal ◽  
Multimedia Data ◽  
Digital Data ◽  
Functional Verification ◽  
Approximate Computing ◽  
Human Beings ◽  
Volume Data ◽  
Simulation Results

In recent years, the approximate computing becomes popular in the era of VLSI (very large scale integration) domain to arrive better power, area, and delay outcomes at the cost of lower precision loss. Also, the human beings are not so intelligent to see/observe/listen the processed digital data; means even if some of the data loss occurs human beings are unable to notice them. This behavior set the engineers to research on approximate computing which are very useful in the multimedia data processing, data communications, high-volume data storage, etc. In this study, the experiments such as hum-noise removal, filters on QRS detection are implemented on an Altera FPGA EP4CEF29C7 device using Quartus II 13.1 synthesis software tool and the simulation results on device utilization reports, the speed and the power are obtained. Simulation results reveal that the approximate computational filters offer better power, area, and speed results than the conventional ones. Also, Matlab 9.4 (R2018a) simulation was used to carry out the functional verification of the actual and approximate filters.

scholarly journals Massive AIS data storage and query based on Hadoop platform

2021 ◽  
Vol 1948 (1) ◽  
pp. 012016
Author(s):  
Taizhi Lv ◽  
Chenyong He ◽  
Juan Zhang ◽  
Zhiyang Song
Keyword(s):  
Data Storage ◽  
Hadoop Platform

Research and Design of the Distributed Mass Small File Storage System Based on WCF

2013 ◽  
Vol 765-767 ◽  
pp. 1087-1091
Author(s):  
Hong Lin ◽  
Shou Gang Chen ◽  
Bao Hui Wang
Keyword(s):  
Fault Tolerance ◽  
Distributed Computing ◽  
Data Storage ◽  
Large Scale ◽  
Storage System ◽  
Hardware Platform ◽  
File Storage ◽  
Computing Framework ◽  
Research And Design ◽  
Small File

Recently, with the development of Internet and the coming of new application modes, data storage has some new characters and new requirements. In this paper, a Distributed Computing Framework Mass Small File storage System (For short:Dnet FS) based on Windows Communication Foundation in .Net platform is presented, which is lightweight, good-expansibility, running in cheap hardware platform, supporting Large-scale concurrent access, and having certain fault-tolerance. The framework of this system is analyzed and the performance of this system is tested and compared. All of these prove this system meet requirements.

scholarly journals Temporal Activity Path Based Character Correction in Heterogeneous Social Networks via Multimedia Sources

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Jun Long ◽  
Lei Zhu ◽  
Zhan Yang ◽  
Chengyuan Zhang ◽  
Xinpan Yuan
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Large Scale ◽  
Multimedia Data ◽  
Attribute Information ◽  
Novel Method ◽  
Relationship Network ◽  
Heterogeneous Social Networks ◽  
The Relationship ◽  
Over Time

Vast amount of multimedia data contains massive and multifarious social information which is used to construct large-scale social networks. In a complex social network, a character should be ideally denoted by one and only one vertex. However, it is pervasive that a character is denoted by two or more vertices with different names; thus it is usually considered as multiple, different characters. This problem causes incorrectness of results in network analysis and mining. The factual challenge is that character uniqueness is hard to correctly confirm due to lots of complicated factors, for example, name changing and anonymization, leading to character duplication. Early, limited research has shown that previous methods depended overly upon supplementary attribute information from databases. In this paper, we propose a novel method to merge the character vertices which refer to the same entity but are denoted with different names. With this method, we firstly build the relationship network among characters based on records of social activities participating, which are extracted from multimedia sources. Then we define temporal activity paths (TAPs) for each character over time. After that, we measure similarity of the TAPs for any two characters. If the similarity is high enough, the two vertices should be considered as the same character. Based on TAPs, we can determine whether to merge the two character vertices. Our experiments showed that this solution can accurately confirm character uniqueness in large-scale social network.

Multimedia Data Storage

2018 ◽  
pp. 2383-2386
Author(s):  
Jeffrey Xu Yu
Keyword(s):  
Data Storage ◽  
Multimedia Data

scholarly journals 3D DNA structural barcode copying and random access

2020 ◽  
Author(s):  
Filip Bošković ◽  
Alexander Ohmann ◽  
Ulrich F. Keyser ◽  
Kaikai Chen
Keyword(s):  
Data Storage ◽  
Single Molecule ◽  
Self Assembly ◽  
Large Scale ◽  
Three Dimensional ◽  
Random Access ◽  
Scale Production ◽  
Digital Information ◽  
Dna Nanostructures ◽  
Large Scale Production

AbstractThree-dimensional (3D) DNA nanostructures built via DNA self-assembly have established recent applications in multiplexed biosensing and storing digital information. However, a key challenge is that 3D DNA structures are not easily copied which is of vital importance for their large-scale production and for access to desired molecules by target-specific amplification. Here, we build 3D DNA structural barcodes and demonstrate the copying and random access of the barcodes from a library of molecules using a modified polymerase chain reaction (PCR). The 3D barcodes were assembled by annealing a single-stranded DNA scaffold with complementary short oligonucleotides containing 3D protrusions at defined locations. DNA nicks in these structures are ligated to facilitate barcode copying using PCR. To randomly access a target from a library of barcodes, we employ a non-complementary end in the DNA construct that serves as a barcode-specific primer template. Readout of the 3D DNA structural barcodes was performed with nanopore measurements. Our study provides a roadmap for convenient production of large quantities of self-assembled 3D DNA nanostructures. In addition, this strategy offers access to specific targets, a crucial capability for multiplexed single-molecule sensing and for DNA data storage.

scholarly journals Hallucinating Optical Flow Features for Video Classification

2019 ◽  
Author(s):  
Yongyi Tang ◽  
Lin Ma ◽  
Lianqiang Zhou
Keyword(s):  
Optical Flow ◽  
Data Storage ◽  
Large Scale ◽  
State Of The Art ◽  
Video Content ◽  
Video Classification ◽  
Temporal Relationships ◽  
Optical Flow Computation ◽  
Flow Features ◽  
Optical Flow Features

Appearance and motion are two key components to depict and characterize the video content. Currently, the two-stream models have achieved state-of-the-art performances on video classification. However, extracting motion information, specifically in the form of optical flow features, is extremely computationally expensive, especially for large-scale video classification. In this paper, we propose a motion hallucination network, namely MoNet, to imagine the optical flow features from the appearance features, with no reliance on the optical flow computation. Specifically, MoNet models the temporal relationships of the appearance features and exploits the contextual relationships of the optical flow features with concurrent connections. Extensive experimental results demonstrate that the proposed MoNet can effectively and efficiently hallucinate the optical flow features, which together with the appearance features consistently improve the video classification performances. Moreover, MoNet can help cutting down almost a half of computational and data-storage burdens for the two-stream video classification. Our code is available at: https://github.com/YongyiTang92/MoNet-Features

scholarly journals Short-Term Master-Slave Forecast Method for Distributed Photovoltaic Plants Based on the Spatial Correlation

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jia Ning ◽  
Guanghao Lu ◽  
Sipeng Hao ◽  
Aidong Zeng ◽  
Hualei Wang
Keyword(s):  
Power Systems ◽  
Spatial Correlation ◽  
Data Storage ◽  
Power Plants ◽  
Large Scale ◽  
Clustering Algorithm ◽  
Storage Condition ◽  
Support Vector ◽  
Forecast Method ◽  
Short Term

With the large-scale integration of distributed photovoltaic (DPV) power plants, the uncertainty of photovoltaic generation is intensively influencing the secure operation of power systems. Improving the forecast capability of DPV plants has become an urgent problem to solve. However, most of the DPV plants are not able to make generation forecast on their own due to the constraints of the investment cost, data storage condition, and the influence of microscope environment. Therefore, this paper proposes a master-slave forecast method to predict the power of target plants without forecast ability based on the power of DPV plants with comprehensive forecast system and the spatial correlation between these two kinds of plants. First, a characteristics pattern library of DPV plants is established with K-means clustering algorithm considering the time difference. Next, the pattern most spatially correlated to the target plant is determined through online matching. The corresponding spatial correlation mapping relationship is obtained by numerical fitting using least squares support vector machine (LS-SVM), and the short-term generation forecast for target plants is achieved with the forecast of reference plants and mapping relationship. Simulation results demonstrate that the proposed method could improve the overall forecast accuracy by more than 52% for univariate prediction and by more than 22% for multivariate prediction and obtain short-term generation forecast for DPV or newly built DPV plants with low investment.

Sign in / Sign up

Export Citation Format

Share Document