Data Structures and Algorithms

1504 Submissions

[4] viXra:1504.0227 [pdf] submitted on 2015-04-28 12:22:52

Spiral Hashed Information Vessel

Authors: Suraj Kumar
Comments: 4 Pages.

In this paper, it has been tried to provide an insight into the information system of Universe as a whole comparing it with the information system in our local reference frame of observables. With the conservation of information been carried out by the SU (1) gauge symmetry group of Universe, it explains how the same information is decoded in two different ways by respective information system mentioned above. It also provide with an introduction of different information processing methodology of the Universe and how their is loss of information by different dynamical changes in Universe including red shift.
Category: Data Structures and Algorithms

[3] viXra:1504.0134 [pdf] submitted on 2015-04-17 08:19:42

My-Search Algorithm to Search an Element

Authors: Bishnu Charan Behera
Comments: 2 Pages.

THIS IS A ALGORITHM WHICH HAS THE SAME TIME COMPLEXITY AS THAT OF LINEAR SEARCH OF O(n).BUT STILL IT IS BETTER THAN LINEAR SEARCH IN TERMS OF EXECUTION TIME. LET A[ ] BE THE THE ARRAY OF SOME SIZE N. IF THE ELEMENT WHICH WE WANT TO SEARCH IS AT ANY POSITION BEFORE N/2 THAN MY-SEARCH AND LINEAR-SEARCH BOTH WILL HAVE EXECUTION TIME , BUT THE MAGIC HAAPENS WHEN THE SEARCH ELEMENT IS AFTER N/2 POSITION.SUPPOSE THE ELEMENT WANT TO SEARCH IS AT Nth POSITION, THEN USING THE LINEAR SEARCH WILL FIND THE ELEMENT AFTER Nth ITERATION,BUT USING MY-SEARCH WE CAN SEARCH THE ELEMENT AFTER 1st ITERATION ITESELF. WHEN WE ARE DEALING WITH A SITUTATION WHEN SIZE IS SOMETHING 10 OR 15 ITS OK. BUT CAN YOU IMAGINE THE CASE WHEN THE SIZE IS “100000000” OR EQUIVALANENT.IF WE USE THIS LINEAR SEARCH TECHINIUQE THAN THE TOTAL EXPENDITURE YOU CAN THINK OFF TO CONTINUE THE LOOP FOR 100000000 TIMES.BUT RATHER IF USE MY-SEARCH U GET THE DESIRED SEARCH JUST AFTER 1 ITERATIONS. SO ,NOW YOU CAN IMAGINE HOW WE CAN PREVENT SUCH A BIG LOSS THROUGH MY-SEARCH. THANK YOU
Category: Data Structures and Algorithms

[2] viXra:1504.0116 [pdf] submitted on 2015-04-14 11:10:18

Single Window Performing Multiple Tax Operations

Authors: M.pooja, S.k Manigandan
Comments: 7 Pages.

This project income tax deals with computerizing the process of tax payment. The entire process of tax payment will be maintained in an automated way. The main objective of this project is to reduce the time consumption. The income tax system has been categorized into three groups according to the mode of payment to the central government, state government, and the municipality. The online tax payment system will be helpful for paying the money from anywhere and at any time. Earlier it was impossible to pay the money online using Debit card / Credit card. The main objective of our system is; we can pay the money use of Debit card / Credit card. Our project has included the concept of paying money through card number which is provided by the bank. It is very secure and easy to reimburse. Through the card security code providing secure money transaction in the system .in other hand through account number and bank name user has to pay the tax in the system. User has to viewing their tax calculation and money transaction status whether payment succeeds or not user has to monitor their entire tax calculation through the tax view module in the system. Admin login is used to login in admin side. Admin side has a security of Money Transaction and confidentiality of user information. Admin provides the security to their users. Admin view is used to view the Tax payments of the login User. Admin monitoring the user activities through admin view module.
Category: Data Structures and Algorithms

[1] viXra:1504.0072 [pdf] replaced on 2015-04-09 12:56:05

“The Majority is Enough” a Rebuttal of Two Proposed Vulnerabilities of Bitcoin Mining

Authors: Funkenstein the Dwarf
Comments: 4 Pages. Couple of typos and a simplification

About a year after Ittay Eyal published two papers claiming vulnerabilities in the bitcoin mining protocol, we have seen that the network is still strong (it has grown in hashpower many times over) and is unaffected by the supposed problems. I show here the biggest reasons the two vulnerability analyses were flawed. The attacks appear to hinder other miners who are competitors. However, both of the attacks harm the attacker's bottom line more than any harm to the competitors can emerge as profits for the attacker.
Category: Data Structures and Algorithms