scholarly journals An Alternate Idea for Storage Optimization in Search Engine

2011 ◽  
pp. 293-296
Author(s):  
Anirban Kundu ◽  
Siddhartha Sett ◽  
Subhajit Kumar ◽  
Shruti Sengupta ◽  
Srayan Chaudhury
Keyword(s):  
Search Engine ◽  
Time Complexity ◽  
Hamming Distance ◽  
Data Retrieval ◽  
Space Complexity ◽  
Storage Space ◽  
Efficient Utilization ◽  
Reduced Space ◽  
Indexing Mechanism ◽  
Storage Technique

We propose an alternate indexing storage technique of Search Engine. In this approach, we achieve reduced space complexity. We try to decrease time complexity for faster data retrieval and decrease storage space for efficient utilization of space. This paper provides an algorithm of indexing mechanism by which effective storage space is reduced. Space complexity of a Search Engine depends on the indices created by the indexing algorithm. Hamming distance concept is used to achieve better result.

The Filling Algorithm for Scanning Based on the Chain Structure

2011 ◽  
Vol 267 ◽  
pp. 404-409
Author(s):  
Wei Qing Wang
Keyword(s):  
Time Complexity ◽  
Chain Structure ◽  
Space Complexity ◽  
The Other ◽  
Storage Space ◽  
Boundary Points

By using the thought of Bresenham algorithm for drawing a line, it can generate basic graphics, at the same time it can create a regional point of scanning lines. According to the regional point of scanning lines it can be filled directly. It does not judge and calculate of the other pixels within the region. The time complexity of the algorithm has been markedly improved, at the same time, in the process of filling a polygon it only stores the coordinates of boundary points and the coordinates of regional points, and it does not store other pixels within the region. It only needs a small storage space, so its space complexity is also increased.

Cooperative Sequence Clustering and Decoding for DNA Storage System with Fountain Codes

2021 ◽  
Author(s):  
Jaeho Jeong ◽  
Seong-Joon Park ◽  
Jae-Won Kim ◽  
Jong-Seon No ◽  
Ha Hyeon Jeon ◽  
...  
Keyword(s):  
Hamming Distance ◽  
Storage Systems ◽  
Storage System ◽  
Data Retrieval ◽  
Illumina Miseq ◽  
Error Correcting Codes ◽  
Read Length ◽  
Sequence Coverage ◽  
Source Codes ◽  
Dna Storage

Abstract Motivation In DNA storage systems, there are tradeoffs between writing and reading costs. Increasing the code rate of error-correcting codes may save writing cost, but it will need more sequence reads for data retrieval. There is potentially a way to improve sequencing and decoding processes in such a way that the reading cost induced by this tradeoff is reduced without increasing the writing cost. In past researches, clustering, alignment, and decoding processes were considered as separate stages but we believe that using the information from all these processes together may improve decoding performance. Actual experiments of DNA synthesis and sequencing should be performed because simulations cannot be relied on to cover all error possibilities in practical circumstances. Results For DNA storage systems using fountain code and Reed-Solomon (RS) code, we introduce several techniques to improve the decoding performance. We designed the decoding process focusing on the cooperation of key components: Hamming-distance based clustering, discarding of abnormal sequence reads, RS error correction as well as detection, and quality score-based ordering of sequences. We synthesized 513.6KB data into DNA oligo pools and sequenced this data successfully with Illumina MiSeq instrument. Compared to Erlich’s research, the proposed decoding method additionally incorporates sequence reads with minor errors which had been discarded before, and thuswas able to make use of 10.6–11.9% more sequence reads from the same sequencing environment, this resulted in 6.5–8.9% reduction in the reading cost. Channel characteristics including sequence coverage and read-length distributions are provided as well. Availability The raw data files and the source codes of our experiments are available at: https://github.com/jhjeong0702/dna-storage.

scholarly journals Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of Trinomials

VLSI Design ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Yin Li ◽  
Yu Zhang ◽  
Xiaoli Guo
Keyword(s):  
Time Delay ◽  
Special Class ◽  
Time Complexity ◽  
Space Complexity ◽  
Polynomial Basis ◽  
Gate Delay ◽  
Complexity Bound ◽  
Parallel Multiplier ◽  
Highly Efficient ◽  
First Time

Recently, we present a novel Mastrovito form of nonrecursive Karatsuba multiplier for all trinomials. Specifically, we found that related Mastrovito matrix is very simple for equally spaced trinomial (EST) combined with classic Karatsuba algorithm (KA), which leads to a highly efficient Karatsuba multiplier. In this paper, we consider a new special class of irreducible trinomial, namely, xm+xm/3+1. Based on a three-term KA and shifted polynomial basis (SPB), a novel bit-parallel multiplier is derived with better space and time complexity. As a main contribution, the proposed multiplier costs about 2/3 circuit gates of the fastest multipliers, while its time delay matches our former result. To the best of our knowledge, this is the first time that the space complexity bound is reached without increasing the gate delay.

scholarly journals Cryptanalytic Performance Appraisal of Improved CCH2 Proxy Multisignature Scheme

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Raman Kumar ◽  
Nonika Singla
Keyword(s):  
Elliptic Curve ◽  
Performance Appraisal ◽  
Time Complexity ◽  
Space Complexity ◽  
Elliptic Curve Cryptosystem ◽  
Forgery Attack ◽  
Signature Schemes ◽  
Computational Overhead ◽  
Threshold Schemes

Many of the signature schemes are proposed in which thetout ofnthreshold schemes are deployed, but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multisignature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity, and computational overhead of improved CCH1 and CCH2 proxy multisignature schemes. We have presented cryptanalysis of improved CCH2 proxy multisignature scheme and showed that improved CCH2 scheme suffered from various attacks, that is, forgery attack and framing attack.

An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme

2013 ◽  
pp. 285-296
Author(s):  
Sanjay Ram ◽  
Somnath Pal
Keyword(s):  
Chemical Reactions ◽  
Efficient Algorithm ◽  
Time Complexity ◽  
Symmetric Matrix ◽  
Reaction Scheme ◽  
Space Complexity ◽  
Average Case ◽  
Model Driven ◽  
Reaction Matrix

There are two approaches for classification of chemical reactions: Model-Driven and Data-Driven. In this paper, the authors develop an efficient algorithm based on a model-driven approach developed by Ugi and co-workers for classification of chemical reactions. The authors’ algorithm takes reaction matrix of a chemical reaction as input and generates its appropriate class as output. Reaction matrices being symmetric, matrix implementation of Ugi’s scheme using upper/lower tri-angular matrix is of O(n2) in terms of space complexity. Time complexity of similar matrix implementation is O(n4), both in worst case as well as in average case. The proposed algorithm uses two fixed size look-up tables in a novel way and requires constant space complexity. Time complexity both in worst and average cases of the algorithm is linear.

VuFind

2013 ◽  
pp. 73-99 ◽  
Author(s):  
Demian Katz ◽  
Andrew Nagy
Keyword(s):  
Open Source ◽  
Search Engine ◽  
Relational Database ◽  
Data Retrieval ◽  
Similarity Analysis ◽  
The Core ◽  
Front End ◽  
Informative Case ◽  
Key Features

Apache Solr, an open source Java-based search engine, forms the core of many Library 2.0 products. The use of an index in place of a relational database allows faster data retrieval along with key features like faceting and similarity analysis that are not practical in the previous generation of library software. The popular VuFind discovery tool was built to provide a library-friendly front-end for Solr’s powerful searching capabilities, and its development provides an informative case study on the use of Solr in a library setting. VuFind is just one of many library packages using Solr, and examples like Blacklight, Summon, and the eXtensible Catalog project show other possible approaches to its use.

Evaluation of Reliable Data Storage in Cloud Using an Efficient Encryption Technique

2021 ◽  
pp. 758-772
Author(s):  
Saswati Sarkar ◽  
Anirban Kundu ◽  
Ayan Banerjee
Keyword(s):  
Power Consumption ◽  
Data Storage ◽  
Time Complexity ◽  
Storage Time ◽  
Reliable Data ◽  
Time Analysis ◽  
Physical Size ◽  
Time Consumption ◽  
Current Consumption ◽  
Storage Technique

Cloud-based reliable and protected data storage technique is proposed in this chapter. The proposed technique encrypts and protects data with less time consumption. Power consumption of storage is dependent upon capacity of storage and physical size of storage. Time analysis is presented graphically in this chapter. Reliable data storage is represented in cloud based proposed approach. Data is encrypted with minimum time complexity due to usage of proposed cloud-based reliable data storage. The competent ratio of time complexity is graphically observed in proposed data storage technique. Power consumption of storage has been typically dependent on the basis of capacity of storage and amount of storage. A ratio of power consumption and capacity of storage is presented in cloud-based approach. An efficient usage of energy is shown depending on current consumption and voltage in proposed reliable approach.

scholarly journals Space and time complexity for infinite time Turing machines

2020 ◽  
Vol 30 (6) ◽  
pp. 1239-1255
Author(s):  
Merlin Carl
Keyword(s):  
Time Complexity ◽  
Space Complexity ◽  
Complexity Classes ◽  
Turing Machines ◽  
Infinite Time ◽  
Space And Time ◽  
Open Questions ◽  
Separation Results ◽  
Ordinal Computability

Abstract We consider notions of space by Winter [21, 22]. We answer several open questions about these notions, among them whether low space complexity implies low time complexity (it does not) and whether one of the equalities P=PSPACE, P$_{+}=$PSPACE$_{+}$ and P$_{++}=$PSPACE$_{++}$ holds for ITTMs (all three are false). We also show various separation results between space complexity classes for ITTMs. This considerably expands our earlier observations on the topic in Section 7.2.2 of Carl (2019, Ordinal Computability: An Introduction to Infinitary Machines), which appear here as Lemma $6$ up to Corollary $9$.

Stackable Smart Footwear Rack Using Infrared Sensor

2019 ◽  
Vol 16 (10) ◽  
pp. 4232-4235
Author(s):  
Rupesh Gupta ◽  
Sarang Sharma ◽  
Sheifali Gupta ◽  
Deepali Gupta
Keyword(s):  
Age Groups ◽  
Human Machine Interface ◽  
Easy Access ◽  
Storage Space ◽  
Infrared Sensor ◽  
Efficient Utilization ◽  
Present Solution ◽  
Machine Interface

The present solution relates to a stackable smart footwear rack and a cabinet housing the stackable smart footwear rack. The present solution provides easy access to organize, store and retrieve footwear in the racks in addition to providing efficient utilization of storage space in a smart and intelligent manner by means of human machine interface and sensors coupled to motor mechanisms. The present solution also helps negate disorganized arrangement of footwear in the racks and is easy to use thereby contributing to a comfortable lifestyle for people of all age groups. Additionally, the present solution also provides a means to minimize any incidences of dust, odor or dirt in the cabinets and racks due to soiled footwear leading to increased levels of hygiene when handling the contents.

Sign in / Sign up

Export Citation Format

Share Document