scholarly journals Compound Treatment of Chained Declustered Replicas Using a Parallel Btree for High Scalability and Availability

2010 ◽  
pp. 49-63
Author(s):  
Min Luo ◽  
Akitsugu Watanabe ◽  
Haruo Yokota
Keyword(s):  
High Scalability

Cloud-Based Multimedia Content Protection System

2020 ◽  
pp. 164-169
Author(s):  
B. Aparna ◽  
S. Madhavi ◽  
G. Mounika ◽  
P. Avinash ◽  
S. Chakravarthi
Keyword(s):  
Large Scale ◽  
Protection System ◽  
Multimedia Content ◽  
Computationally Efficient ◽  
Content Protection ◽  
Protection Systems ◽  
Multimedia Content Protection ◽  
High Scalability ◽  
Cloud Infrastructures ◽  
Rapid Deployment

We propose a new design for large-scale multimedia content protection systems. Our design leverages cloud infrastructures to provide cost efficiency, rapid deployment, scalability, and elasticity to accommodate varying workloads. The proposed system can be used to protect different multimedia content types, including videos, images, audio clips, songs, and music clips. The system can be deployed on private and/or public clouds. Our system has two novel components: (i) method to create signatures of videos, and (ii) distributed matching engine for multimedia objects. The signature method creates robust and representative signatures of videos that capture the depth signals in these videos and it is computationally efficient to compute and compare as well as it requires small storage. The distributed matching engine achieves high scalability and it is designed to support different multimedia objects. We implemented the proposed system and deployed it on two clouds: Amazon cloud and our private cloud. Our experiments with more than 11,000 videos and 1 million images show the high accuracy and scalability of the proposed system. In addition, we compared our system to the protection system used by YouTube and our results show that the YouTube protection system fails to detect most copies of videos, while our system detects more than 98% of them.

An Efficient, Secure, and Queryable Encryption for NoSQL-Based Databases Hosted on Untrusted Cloud Environments

2019 ◽  
Vol 13 (2) ◽  
pp. 14-31
Author(s):  
Mamdouh Alenezi ◽  
Muhammad Usama ◽  
Khaled Almustafa ◽  
Waheed Iqbal ◽  
Muhammad Ali Raza ◽  
...  
Keyword(s):  
Query Processing ◽  
State Of The Art ◽  
Data Communication ◽  
Nosql Databases ◽  
High Concern ◽  
Cloud Environments ◽  
High Scalability ◽  
And Performance ◽  
Secure Query Processing ◽  
Security Concern

NoSQL-based databases are attractive to store and manage big data mainly due to high scalability and data modeling flexibility. However, security in NoSQL-based databases is weak which raises concerns for users. Specifically, security of data at rest is a high concern for the users deployed their NoSQL-based solutions on the cloud because unauthorized access to the servers will expose the data easily. There have been some efforts to enable encryption for data at rest for NoSQL databases. However, existing solutions do not support secure query processing, and data communication over the Internet and performance of the proposed solutions are also not good. In this article, the authors address NoSQL data at rest security concern by introducing a system which is capable to dynamically encrypt/decrypt data, support secure query processing, and seamlessly integrate with any NoSQL- based database. The proposed solution is based on a combination of chaotic encryption and Order Preserving Encryption (OPE). The experimental evaluation showed excellent results when integrated the solution with MongoDB and compared with the state-of-the-art existing work.

Methods for detecting and correcting contextual data quality problems

2021 ◽  
Vol 25 (4) ◽  
pp. 763-787
Author(s):  
Alladoumbaye Ngueilbaye ◽  
Hongzhi Wang ◽  
Daouda Ahmat Mahamat ◽  
Ibrahim A. Elgendy ◽  
Sahalu B. Junaidu
Keyword(s):  
Data Quality ◽  
Quality Evaluation ◽  
Web Applications ◽  
Support Vector ◽  
Similarity Metrics ◽  
Distributed Data ◽  
Contextual Data ◽  
Formal Taxonomy ◽  
E Learning ◽  
High Scalability

Knowledge extraction, data mining, e-learning or web applications platforms use heterogeneous and distributed data. The proliferation of these multifaceted platforms faces many challenges such as high scalability, the coexistence of complex similarity metrics, and the requirement of data quality evaluation. In this study, an extended complete formal taxonomy and some algorithms that utilize in achieving the detection and correction of contextual data quality anomalies were developed and implemented on structured data. Our methods were effective in detecting and correcting more data anomalies than existing taxonomy techniques, and also highlighted the demerit of Support Vector Machine (SVM). These proposed techniques, therefore, will be of relevance in detection and correction of errors in large contextual data (Big data).

movAPA: modeling and visualization of dynamics of alternative polyadenylation across biological samples

2020 ◽  
Author(s):  
Wenbin Ye ◽  
Tao Liu ◽  
Hongjuan Fu ◽  
Congting Ye ◽  
Guoli Ji ◽  
...  
Keyword(s):  
Biological Samples ◽  
Tissue Specificity ◽  
Single Cells ◽  
Alternative Polyadenylation ◽  
R Package ◽  
Supplementary Information ◽  
Rna Seq ◽  
Mouse Sperm ◽  
High Scalability ◽  
A Site

Abstract Motivation Alternative polyadenylation (APA) has been widely recognized as a widespread mechanism modulated dynamically. Studies based on 3′ end sequencing and/or RNA-seq have profiled poly(A) sites in various species with diverse pipelines, yet no unified and easy-to-use toolkit is available for comprehensive APA analyses. Results We developed an R package called movAPA for modeling and visualization of dynamics of alternative polyadenylation across biological samples. movAPA incorporates rich functions for preprocessing, annotation and statistical analyses of poly(A) sites, identification of poly(A) signals, profiling of APA dynamics and visualization. Particularly, seven metrics are provided for measuring the tissue-specificity or usages of APA sites across samples. Three methods are used for identifying 3′ UTR shortening/lengthening events between conditions. APA site switching involving non-3′ UTR polyadenylation can also be explored. Using poly(A) site data from rice and mouse sperm cells, we demonstrated the high scalability and flexibility of movAPA in profiling APA dynamics across tissues and single cells. Availability and implementation https://github.com/BMILAB/movAPA. Supplementary information Supplementary data are available at Bioinformatics online.

A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×

2020 ◽  
Vol 176 (3-4) ◽  
pp. 349-384
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Theoretic Approach ◽  
The Novel ◽  
Data Types ◽  
Left Hand ◽  
Rule Languages ◽  
Tableau System ◽  
High Scalability ◽  
Better Than

In this paper we consider the most common TBox and ABox reasoning services for the description logic 𝒟ℒ〈4LQSR,x〉(D) ( 𝒟 ℒ D 4,× , for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQSR. 𝒟 ℒ D 4,× is a very expressive description logic. It combines the high scalability and efficiency of rule languages such as the SemanticWeb Rule Language (SWRL) with the expressivity of description logics. In fact, among other features, it supports Boolean operations on concepts and roles, role constructs such as the product of concepts and role chains on the left-hand side of inclusion axioms, role properties such as transitivity, symmetry, reflexivity, and irreflexivity, and data types. We further provide a KE-tableau-based procedure that allows one to reason on the main TBox and ABox reasoning tasks for the description logic 𝒟 ℒ D 4,× . Our algorithm is based on a variant of the KE-tableau system for sets of universally quantified clauses, where the KE-elimination rule is generalized in such a way as to incorporate the γ-rule. The novel system, called KEγ-tableau, turns out to be an improvement of the system introduced in [1] and of standard first-order KE-tableaux [2]. Suitable benchmark test sets executed on C++ implementations of the three mentioned systems show that in several cases the performances of the KEγ-tableau-based reasoner are up to about 400% better than the ones of the other two systems.

scholarly journals Comparative study of all-optical INVERTER and BUFFER gates using MZI structure

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Pallavi Singh ◽  
Ashutosh Kumar Singh ◽  
Vanya Arun ◽  
Devendra K Tripathi
Keyword(s):  
Extinction Ratio ◽  
Low Complexity ◽  
Optical Amplifier ◽  
Destructive Interference ◽  
Eye Diagram ◽  
Pump And Probe ◽  
All Optical ◽  
High Scalability ◽  
Comparative Results ◽  
Optical Gates

AbstractIn the paper, one input optical gates i.e., INVERTER and BUFFER have been designed using some basic assumption to analyze with the help of Semi-conductor Optical Amplifier based Mach–Zehnder Interferometer structure. The results are optimized by iterative process. The proposed design of optical gates presents low complexity, high scalability and more feasible to evaluate through digital Boolean analyzation. The digital Boolean analyzation is analyzed by some basic Boolean rules and assumptions which makes the design more digital so that it can be compatible for more than one input optical gates also. Optical Gate is designed to get constructive and destructive interference for pump and probe as they are injected into SOA simultaneously. The phase modulation is converted into intensity modulation which gives a Boolean result. The paper is optimized by Eye diagram, Q factor, wavelength spectrum and frequency chirp for both the gates. The comparative results of extinction ratio for both the gates have also been discussed. The design is supported by theoretical analysis, simulation tool (Optsim) and Boolean explanation. The proposed designs are constructed with same pattern which supports the same Boolean analysis.

Performance of high scalability hybrid system of 10G-TDM-OCDMA-PON based on 2D-SWZCC code

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Haidar Zaeer Dhaam ◽  
Mohammed Jawad Al Dujaili ◽  
Mushtaq Talib Mezeel ◽  
Abdullah Ali Qasim
Keyword(s):  
Hybrid System ◽  
High Speed ◽  
Optical Network ◽  
Passive Optical Network ◽  
Orthogonal Polarization ◽  
High Speed Data ◽  
High Scalability ◽  
High Bit Rate ◽  
Code Division Multiple ◽  
Time Division

Abstract A new architecture for increasing the number of simultaneous users in a hybrid system and providing a solution for the channel bottleneck problem has been designed and simulated. The 10G-TDM-OCDMA-PON system combines optical code division multiple access (OCDMA) and time-division multiplexed passive optical network (TDM-PON) techniques. The high bit rate TDM-PON system is based on a bit interleaving that uses noncontiguous order for data arranging manner, this system used to obtain ultra-high-speed data rate of 40 Gbps based on four TDM channels of 10 Gbps. The OCDMA system is based on two-dimensional single weight zero cross-correlation (2D-SWZCC) employing polarization and wavelength scheme with two orthogonal polarization angles (vertical and horizontal states). The proposed hybrid system increases the scalability by multiplexing M OCDMA codes in the same time slot of the TDM system that has N time slots. The results show that the proposed system with 2D-SWZCC has better performance with a high number of users and higher scalability than the system with 1D-SWZCC.

Sign in / Sign up

Export Citation Format

Share Document