Battery case shear

Hand operated shear removes a battery case without disturbing the internal components which are to be tested. It consists of three tool-steel elements, the cutter blade, and a hand lever that provides the mechanical advantage required to cut steel

Normalization: A Preprocessing Stage

As we know that the normalization is a pre-processing stage of any type problem statement. Especially normalization takes important role in the field of soft computing, cloud computing etc. for manipulation of data like scale down or scale up the range of data before it becomes used for further stage. There are so many normalization techniques are there namely Min-Max normalization, Z-score normalization and Decimal scaling normalization. So by referring these normalization techniques we are going to propose one new normalization technique namely, Integer Scaling Normalization. And we are going to show our proposed normalization technique using various data sets.Comment: 4 pages, 3 figures, 3 table

A counter measure to Black hole attack on AODVbased Mobile Ad-Hoc Networks

Security is a major threat and essential requirement for mobile Ad Hoc network. Due to its inherent characteristics, it has many consequent challenges, which needs to be taken care of. In this paper we analyse the black hole attack in MANET using AODV as its routing protocol. Black hole is a type of routing attack where a malicious node impersonates a destination node by sending deceived route reply packet to a source node that initiates a route discovery process. By doing this, the malicious node can deprive the traffic from the source node. We propose a solution that makes a modification in existing AODV routing protoco

Improved Quantum Query Upper Bounds Based on Classical Decision Trees

We consider the following question in query complexity: Given a classical query algorithm in the form of a decision tree, when does there exist a quantum query algorithm with a speed-up (i.e., that makes fewer queries) over the classical one? We provide a general construction based on the structure of the underlying decision tree, and prove that this can give us an up-to-quadratic quantum speed-up in the number of queries. In particular, our results give a bounded-error quantum query algorithm of cost O(?s) to compute a Boolean function (more generally, a relation) that can be computed by a classical (even randomized) decision tree of size s. This recovers an O(?n) algorithm for the Search problem, for example. Lin and Lin [Theory of Computing\u2716] and Beigi and Taghavi [Quantum\u2720] showed results of a similar flavor. Their upper bounds are in terms of a quantity which we call the "guessing complexity" of a decision tree. We identify that the guessing complexity of a decision tree equals its rank, a notion introduced by Ehrenfeucht and Haussler [Information and Computation\u2789] in the context of learning theory. This answers a question posed by Lin and Lin, who asked whether the guessing complexity of a decision tree is related to any measure studied in classical complexity theory. We also show a polynomial separation between rank and its natural randomized analog for the complete binary AND-OR tree. Beigi and Taghavi constructed span programs and dual adversary solutions for Boolean functions given classical decision trees computing them and an assignment of non-negative weights to edges of the tree. We explore the effect of changing these weights on the resulting span program complexity and objective value of the dual adversary bound, and capture the best possible weighting scheme by an optimization program. We exhibit a solution to this program and argue its optimality from first principles. We also exhibit decision trees for which our bounds are strictly stronger than those of Lin and Lin, and Beigi and Taghavi. This answers a question of Beigi and Taghavi, who asked whether different weighting schemes in their construction could yield better upper bounds