Job Sites

open the links in new tab

superior rank :

www.Careerage.com
www.ITJobs.com
www.Naukari.com
www.bestJobsUSA.com
www.Hitechjobs.com
www.SoftwareJobs.com
www.Technology.Jobs.com
www.Jobcenter.com
www.YourEmployment.com
www.Hinduonnet.com
www.MonsterIndia.com
www.NaukariIndia.com
www.JobsAhead.com
www.TimesJobs.com
www.Google.com/jobs
www.ResumeEdge.com
www.Jobs-FAQ.com
www.Ciol.com
www.ignou.com
www.classteacher.com
www.egurucool.com
www.jnu.ac.in
www.sims.edu
www.osmania.ac.in
www.modernschool.net
www.aboutjobs.com
www.americanjobs.com
www.career.com
www.careeravenue.com
www.careermag.com
www.careermart.com
www.careerweb.com
www.carolina.computerjobs.com
www.casinocareers.com
www.computerjobs.com
www.classfields.yahoo.com
www.coolworks.com
www.employmentspot.com
www.calijobs.com
www.bestjobsusa.com
www.ajb.dni.us
www.6figurejobs.com
www.4work.com
www.atlanta.computerjobs.com
www.careershop.com
www.careertown.com
www.career-vision.com
www.christianjobs.com
www.collegecentral.com
www.cweb.com
www.careerbuilder.com
www.1-jobs.com
www.accountability.com/isjobs.htm
www.careercity.com
www.careerexchange.com
www.careerexposure.com
www.careermosaic.com
www.careerpath.co.uk
www.careerwomen.net
www.ceweekly.wa.com
www.consultantlink.com
www.dice.com
www.dmworld.com
www.eclectic-usa.com
www.alltimejobs.com
www.aidnjobs.com
www.careergun.com
www.careerforyou.com
www.careersindia.com
www.cioljobs.com
www.careerage.com
www.ezeejobs.com
www.freelancingonline.com
www.go4careers.com
www.jobs.itspace.com
www.jobsahead.com
www.jobsdb.com
www.jobstreet.com
www.monster.com
www.netpiligrimc.com
www.placementindia.com
www.prizedjobs.com
www.timesclassifieds.com
www.winjobs.com

NEW DISTRIBUTED QUERY OPTIMIZATION TECHNIQUES


ABSTRACT:
 TOPIC:   new query processing and optimization techniques in distributed database
Now-a-days data is distributed across the networks to make total world as a global village. Distributed database management systems (DDBMS) are amongst the most important and successful software developments in this decade. They are enabling computing power and data to be placed within the user environment close to the point of user activities. The performance efficiency of DDBMS is deeply related to the query processing and optimization strategies involving data transmission over different nodes through the network. Most real-world data is not well structured. Today's databases typically contain much non-structured data such as text, images, video, and audio, often distributed across computer networks. This situation demands new query processing, optimization techniques in distributed database environment. These techniques will provide efficient performance in optimization of query processing strategies in a distributed databases environment. this paper mainly focuses distributed query optimization problem
The main contents of this paper are:
• Introduction to Distributed database, Query processing and Query optimization strategies.
• Distributed Query Processing Methodology.
• Distributed Query Optimization.
• New query optimization techniques in distributed database.
• Distributed Query Optimization problems and some solutions.
• Advantages of query optimization techniques in distributed database.
• Conclusion.

Introduction: Distributed database:
Distributed database is a database that is under the control of a central database management system (DBMS) in which storage devices are not all attached to a common CPU. It may be stored in multiple computers located in the same physical location, or may be dispersed over a network of interconnected computers. Collections of data (e.g. in a database) can be distributed across multiple physical locations.

 Query processing :
                          Query processing is defined as the activities involved in parsing, validating, optimizing and executing a query.
The main aim of query processing is Transform query written in high-level language (e.g. SQL), into correct and efficient execution strategy expressed in low-level language (implementing Relational Algebra) and to find information in one or more databases and deliver it to the user quickly and efficiently.
High level user query -> Query Processor ->low-level data manipulation commands

 Query optimization :
Query optimization is defined as the activity of choosing an efficient execution strategy for processing a query. Query optimization is a part of query processing.
The main aims of query optimization are to choose a transformation that minimizes resource usage, Reduce total execution time of query and also reduce response time of query
Distributed Query Processing Methodology:
 


Distributed query processing contains four stages which are query decomposition, data localization, global optimization and local optimization.
• Query decomposition: in this stage we are giving Calculus Query as an input and we are getting output as Algebraic Query. This stage is again divided in four stages they are Normalization, Analysis, Simplification and Restructuring
 Data localization: in this stage Algebraic query on distributed relations is input and fragment query is output. In this stage fragment involvement is determined.
 Global optimization: in this stage Fragment Query is input and optimized fragment query is output. Finding best global schedule is done in this stage.
 Local optimization: Best global execution schedule is input and localized optimization queries are output in this stage. it contain two sub stages they are Select the best access path ,Use the centralized optimization techniques.
Distributed Query Optimization:
Distributed query optimization is defined as finding efficient execution strategy path in distributed networks.
Query optimization is difficult in distributed environment.
There are three components of distributed query optimization they are Access Method, Join Criteria, and Transmission Costs.
• Access Method: The methods which are used to access data from distributed environment like hashing, indexing etc.
• Join Criteria: In distributed database data is presented in different sites. Join criteria is used to join the different sites to get optimized result.
 Transmission Costs: If data from multiple sites must be joined to satisfy a single query, then the cost of transmitting the results from intermediate steps needs to be factored into the equation. At times, it may be more cost effective simply to ship entire tables across the network to enable processing to occur at a single site, thereby reducing overall transmission costs. This component of query optimization is an issue only in a distributed environment.
There are many distributed query optimization issues some of them are types of optimizers, optimization granularity, network topologies and optimization timing.

AN OPTIMIZATION EXAMPLE                               In order to understand distributed query optimization more fully, let’s take a look at an example of a query accessing tables in multiple locations. Consider the ramifications of coding a program to simply retrieve a list of all teachers who have taught physics to seniors. Furthermore, assume that the COURSE table and the ENROLLMENT table exist at Site 1; the STUDENT table exists at Site 2.If either all of the tables existed at a single site, or the DBMS supported distributed multi-site requests. However, if the DMBS can not perform (or optimize) distributed multi-site requests, programmatic optimization must be performed. There are at least six different ways to go about optimizing this three-table join.
Option 1: Start with Site 1 and join COURSE and ENROLLMENT, selecting only physics courses. For each qualifying row, move it to Site2 to be joined with STUDENT to see if any are seniors.
Option 2: Start with Site 1 and join COURSE and ENROLLMENT, selecting only physics courses, and move the entire result set to Site 2 to be joined with STUDENT, checking for senior students only.
Option 3: Start with Site 2 and select only seniors from STUDENT. For each of these examine the join of COURSE and ENROLLMENT at Site 1 for physics classes.
Option 4: Start with Site 2 and select only seniors from STUDENT at Site 2, and move the entire result set to Site 1 to be joined with COURSE and ENROLLMENT, checking for physics classes only.
Option 5: Move the COURSE and ENROLLMENT tables to Site 2 and proceed with a local three-table join.
Option 6: Move the STUDENT to Site 1 and proceed with a local three-table join.
Which of these six options will perform the best? Unfortunately, the only correct answer is "It depends." The optimal choice will depend upon:
1. the size of the tables;
2.the size of the result sets — that is, the number of qualifying rows
and their length in bytes; and
3.the efficiency of the network.
New query optimization techniques in distributed database:
 
Cost – based query optimization:
Objective of Cost-based query optimization is estimate the cost of different equivalent query expressions and chose the execution plan with the lowest cost.
Cost based query optimization mainly depends on two factors they are solution space and cost function.
Solution space: this is depends on the set of equivalent algebraic expressions.
Cost function: cost function is equivalent to summation of i/o cost, CPU cost and communication cost. it also depends on different distributed environments.
By considering these factors cost based query optimization is processed in distributed environment.

 Heuristic – based query optimization :
Heuristic based query optimization process involve following steps :
 Perform Selection operations as early as possible.
 Combine Cartesian product with subsequent selection whose predicate represents join condition into a Join operation.
 Use associatively of binary operations to rearrange leaf nodes so leaf nodes with most restrictive Selection operations executed first.
 Perform Projections operations as early as possible.
 Eliminate duplicate computations.
It is mainly used to minimize cost of selecting sites for multi join operations.

 Rank-Aware Query Optimization :
                      Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank aggregation algorithms. Rank-join operators progressively rank the join results while performing the join operation. The new operators have a direct impact on traditional query processing and optimization. We introduce a rank-aware query optimization framework that fully integrates rank-join operators into relational query engines. The framework is based on extending the System R dynamic programming algorithm in both enumeration and pruning. We define ranking as an interesting property that triggers the generation of rank-aware query plans. Unlike traditional join operators, optimizing for rank-join operators depends on estimating the input cardinality of these operators. We introduce a probabilistic model for estimating the input cardinality, and hence the cost of a rank-join operator. To our knowledge, this paper is the first effort in estimating the needed input size for optimal rank aggregation algorithms. Costing ranking plans, although challenging, is key to the full integration of rank-join operators in real-world query processing engines. We experimentally evaluate our framework by modifying the query optimizer of an open-source database management system. .
Query Optimization problems and some solutions in distributed database:
 Stochastic query optimization problem for multiple join:
The model of three joins stored at two sites leads to a nonlinear programming problem, which has an analytical solution. The model with four sites leads to a special kind of nonlinear optimization problem (P).This problem is known as stochastic query optimization problem for multiple join. This problem can not be solved analytically. It is proved that problem (P) has at least one solution and two new methods are presented for solving the problem. An ad hoc constructive model and a new evolutionary technique is used for solving problem (P). Results obtained by the two considered optimization approaches are compared.
• Problem of optimizing queries that involve set operations:The problem of optimizing queries that involves set operations (set queries) in a distributed relational database system. A particular emphasis is put on the optimization of such queries in horizontally partitioned database systems. A mathematical programming model of the set query problem is developed and its NP-completeness is proved. Solution procedures are proposed and computational results presented. One of the main results of the computational experiments is that, for many queries, the solution procedures are not sensitive to errors in estimating the size of results of set operations.
• Stochastic optimization problem for multiple queries:
Many algorithms have been devised for minimizing the costs associated with obtaining the answer to a single, isolated query in a distributed database system. However, if more than one query may be processed by the system at the same time and if the arrival times of the queries are unknown, the determination of optimal query-processing strategies becomes a stochastic optimization problem. In order to cope with such problems, a theoretical state-transition model is presented that treats the system as one operating under a stochastic load. Query-processing strategies may then be distributed over the processors of a network as probability distributions, in a manner which accommodates many queries over time. It is then shown that the model leads to the determination of optimal query-processing strategies as the solution of mathematical programming problems, and analytical results for several examples are presented. Furthermore, a divide-and-conquer approach is introduced for decomposing stochastic query optimization problems into distinct sub problems for processing queries sequentially and in parallel.

Sum product optimization problem:
                            most distributed query optimization problems can be transformed into an optimization problem comprising a set of binary decisions, termed Sum Product Optimization (SPO) problem. We first prove SPO is NP-hard in light of the NP-completeness of a well-known problem, Knapsack (KNAP). Then, using this result as a basis, we prove that five classes of distributed query optimization problems, which cover the majority of distributed query optimization problems previously studied in the literature, are NP-hard by polynomials reducing SPO to each of them. The detail for each problem transformation is derived. We not only prove the conjecture that many prior studies relied upon, but also provide a frame work for future related studies.
Advantages of distributed database:

• Reflects organizational structure — database fragments are located in the departments they relate to.
• Local autonomy — a department can control the data about them (as they are the ones familiar with it.)
• Improved availability — a fault in one database system will only affect one fragment, instead of the entire database.
• Improved performance — data is located near the site of greatest demand, and the database systems themselves are parallelized, allowing load on the databases to be balanced among servers. (A high load on one module of the database won't affect other modules of the database in a distributed database.)
• Economics — it costs less to create a network of smaller computers with the power of a single large computer.
• Modularity — systems can be modified, added and removed from the distributed database without affecting other modules (systems).
Advantages of Distributed query optimization:

 Distributed Query optimization techniques provide exact results in distributed environment.
 These techniques provide efficient performance in different distributed networks.
 In internet these techniques helps to search exact information and extract the required one.

Conclusion:

Most real-world data is not well structured. Today's databases typically contain much non-structured data such as text, images, video, and audio, often distributed across computer networks. To process these kinds of data and optimize queries on this data requires these distributed query optimization techniques.

STEGANOGRAPHY AND DIGITAL WATERMARKING


INDEX:
• Abstract
• Introduction
1.Steganography
2.Digitalwatermarking
 Steganographic techniques
1.Modern Steganographic techniques
2.Historical Steganographic techniques
• Digital watermarking as an application of Steganography

 What is a watermarking
 Classification
1.Visible watermarking
2.Invisible watermarking
• Differences between visible and invisible water marking
• Characteristics of digital watermarking
• Attacks due to multiple watermarking
• Watermarking an image
• Differences between Steganography and Digital water marking
• Conclusion
• References


1. ABSTRACT:
             This paper attempts to give a brief overview of Steganography & digital water marking in general. Emphasis is made to expose the different techniques that can be carried out on Steganography. It also gives a brief description of Digital watermarking and its characteristics and finally concludes with the differences between Digital watermarking of imagesn pictures and Steganography .Steganography means hidden or invisible messages.Its been one of the powerful techniques over the past few decades which provides security from the illegal access.
For network distribution services of copyrighted digital data (such as pay web distribution of musics, or digital libraries), the possibility of illegal redistribution due to some licensed user, who obtained the data in a legal way from the server, should be considered. Such actions cannot be prevented by use of encrypted communication only. To prevent the illegal copying itself is not realistic, because digital data can be in general copied easily, without decreasing its quality. An alternative solution investigated recently is ``digital watermarking'', which is a technology to embed some auxiliary information into digital data.

2. INTRODUCTION

What is Steganography?
                    The word " Steganography " is of Greek origin and means "covered, or hidden writing" . Its ancient origins can be traced back to 440 BC. Steganography is the art and science of writing hidden messages in such a way that no one apart from the intended recipient knows of the existence of the message; this is in contrast to cryptography, where the existence of the message itself is not disguised, but the content is obscured a steganographic message will appear to be something else: a picture, an article, a shopping list, or some other message. This apparent message is the covertext . For instance, a message may be hidden by using invisible ink between the visible lines of innocuous documents.

What is Digital watermarking?
                            Digital watermarking can be a form of steganography, in which data is hidden in the message without the end user's knowledge.It is a technique which allows an individual to add hidden copyright notices or other verification messages to digital audio, video, or image signals and documents. Such a message is a group of bits describing information pertaining to the signal or to the author of the signal (name, place, etc.) The technique takes its name from watermarking of paper or money as a security measure.

 
3. Steganographic techniques:
              An in depth analysis of the modern and historical steganographic techniques
• Modern steganogrpahic techniques:
• Concealing messages within the lowest bits of noisy images or sound files.
• Concealing data within encrypted data
• Chaffing and winnowing
• Invisible ink
• Null ciphers
• Concealed messages in tampered executable files
• Embedded pictures in video material
• A new steganographic technique involves injecting imperceptible delays to packets sent over the network from the keyboard
• Content-Aware Steganography hides information in the semantics a human user assigns a datagram; these systems offer security against a non-human adversary/warden
• Historical steganographic techniques:
• Hidden messages in wax tablets
• Hidden messages on messenger's body
• Hidden messages on paper written in secret inks under other messages or on the blank parts of other messages
• During and after World War II, espionage agents used photographically produced microdots to send information back and forth


• Counter-propaganda:
The one-time pad is a theoretically unbreakable cipher that produces ciphertexts indistinguishable from random texts: only those who have the private key can distinguish these ciphertexts from any other perfectly random texts. Thus, any perfectly random data can be used as a covertext for a theoretically unbreakable steganography

4. Digital water marking an application of Steganography:
              Steganography is used by some modern printers, including HP and Xerox brand color laser printers. Tiny yellow dots are added to each page. The dots are barely visible and contain encoded printer serial numbers, as well as date and time stamps. Steganography can be used for digital watermarking, where a message (being simply an identifier) is hidden in an image.


Steganograhy original

Steganogarphy recovered
                      Digital water marking is a technique which allows an individual to add hidden copyright notices or other verification messages to digital audio, video, or image signals and documents o that its source can be tracked or verified a watermarking can be classified into two sub-types visible and invisible.

5. What is ``watermarking'' ?
                   The process of embedding information into another object/signal can be termed as watermarking. it is mostly agreed that the watermark is one, which is imperceptibly added to the cover-signal in order to convey the hidden data. The digital age has simplified the process of content delivery and has increased the ease at which the buyer can re-distrubute the content, thus denying the income to the seller. Images published on the internet is an example of such content., one can identify an upper limit on the safe message size that can be embedded in a "typical" cover. This is called steganographic capacity and it is unknown even for the simplest methods out there, such as the LSB embedding.
Another application is to protect digital media by fingerprinting each copy with the purchaser's information. If the purchaser makes illegitimate copies, these will contain his name. Fingerprints are an extension to watermarking principle and can be both visible and invisible.

6. Classification :
                  Digital watermarking can be classified as visible and invisible watermarking

1.Visible water marking:                   Visible watermarks change the signal altogether such that the watermarked signal is totally different from the actual signal, e.g., adding an image as a watermark to another image.
Visible watermarks can be used in following cases :
• Visible watermarking for enhanced copyright protection.
• Visible watermarking used to indicate ownership originals.

Visible water marking- the text “Brian kell 2006”
Can be seen at the centre of Image.

2.Invisible water marking:
                        Invisible watermarks do not change the signal to a perceptually great extent, i.e., there are only minor variations in the output signal.
An example of an invisible watermark is when some bits are added to an image modifying only its least significant bits. Invisible watermarks that are unknown to the end user are steganographic. While the addition of the hidden message to the signal does not restrict that signal's use, it provides a mechanism to track the signal to the original owner.

7. Differences between visible and invisible water marking:
                 Visibility is a term associated with the perception of the human eye. A watermarked image in which the watermark is imperceptible, or the watermarked image is visually identical to its orginal constitutes a invisible watermarking. Examples include images distrubuted over internet with watermarks embedded in them for copyright protection. Those which fail can be classified as visible watermarks. Examples include logos used in papers in currencies 

8. Characteristics of digital watermarking:
                 The characteristics of an watermarking algorithm is normally tied to the application is was designed for. The following merely explain the words used in the context of watermarking.

• Imperceptibility
                       In watermarking, we traditionally seek high fidelity, i.e. the watermarked work must look or sound like the original. Whether or not this is a good goal is a different discussion.

• Robustness                     

It is more a property and not a requirement of watermarking. The watermark should be able to survive any resonable processing inflicted on the carrier (carrier here refers to the content being watermarked).

• Security
                The watermarked image should not reveal any clues of the presence of the watermarks, with respect to un-authorized detection, or (statistical) undetectability or unsuspicious (not the same as imperceptability).

9. Attacks due to multiple watermarking:                           Multiple watermarks can be considered as attacks in situations wherein one expects the presence of single watermark. Thus, any second operation of watermark embedding or any other processing on the carrier can be considered as an attack. The survival of the watermark in those cases is dependent on the application. A robust watermark is expected to survive such operations. Some watermarking tools do not allow you to insert a watermark if an image already contains a watermark from the same tool. Sometimes, a watermark from one tool may get overwritten with a watermark from another.

There are instances where, a carrier is intentionally watermarked multiple times. In cases of multiple watermarks, the order in which different watermarks are embedded may influence the detectability. A strong watermark embedded after a weak watermark will mask the weak watermark and render it undetectable
10. Digital Watermarking an Image
In this case, the server embeds certain identificationinformation of each user into the data before distributing (in this case, this technique is called ``fingerprinting''). Then, when the server finds the illegal copy, embedded information enables him to detect the guilty user. However, if the server embeds user IDs (or its numerical expressions) simply, two or more colluded users can recognize easily the position of embedded information by comparing their data legally obtained. As a consequence, embedded information may beerased by the colluded users. Furthermore, it may be also possible even to forge the data which contain ``identification information of other innocent user''.For the purpose of coping with such illegal actions by colluded users, we have been investigating construction of suitable embedded information, namely conversion method (encoding) from user IDs to embedded information.

 How to watermark an image? 
                   Visible watermarks on images can be easily achieved thorough image editing software. Ex. imagemagick or any other, which have the watermark functionality. Invisible watermarks on images can be achieved through some properitary softwares.
• Getting Pixel values in Image to watermark them
First determine what is the format of the image you are dealing with. Then search for libraries which can decode/read the images and provide pixel values. Tools like MATLAB can be helpful here. Another option would be to write plugins for image editing applications like image-magick.

11. Differences between Steganography and Digital watermarking:
                     steganography is about concealing their very existence. It comes from Greek roots, literally means 'covered writing', and is usually interpreted to mean hiding information in other information. Examples include sending a message to a spy by marking certain letters in a newspaper using invisible ink, and adding sub-perceptible echo at certain places in an audio recording. It is often thought that communications may be secured by encrypting the traffic, but this has rarely been adequate in practice. Ãneas the Tactician, and other classical writers
As the purpose of steganography is having a covert communication between two parties whose existence is unknown to a possible attacker, a successful attack consists in detecting the existence of this communication (e.g., using statistical analysis of images with and without hidden information). Watermarking , as opposed to steganography, has the (additional) requirement of robustness against possible attacks. In this context, the term 'robustness' is still not very clear; it mainly depends on the application. Copyright marks do not always need to be hidden, as some systems use visible digital watermarks , but most of the literature has focused on imperceptible (e.g., invisible, inaudible) digital watermarks which have wider applications. Visible digital watermarks are strongly linked to the original paper watermarks which appeared at the end of the XIII century to differentiate paper makers of that time. Modern visible watermarks may be visual patterns

12. Conclusion:
              Steganography used in electronic communication include teganographic coding inside of a transport layer, such as an MP3 file, or a protocol, such as UDP.
Steganography is used by some modern printers, including HP and Xerox brand color laser printers. Tiny yellow dots are added to each page. The dots are barely visible and contain encoded printer serial numbers, as well as date and time stamps
Watermarking (now-a-days) is mainly used for copy-protection and copyright-protection Historically, watermarking has been used to send ``sensitive'' information hidden in another signal. Watermarking has its applications in image/video copyright protection.
Copy protection attempts to find ways, which limits the access to copyrighted material and/or inhibit the copy process itself. Examples of copy protection include encrypted digital TV broadcast, access controls to copyrighted software through the use of license servers and technical copy protection mechanisms on the media. A recent example is the copy protection mechanism on DVDs. However, copy protection is very difficult to achieve in open systems, as recent incidents (like the DVD hack - DeCss) show.
Copyright protection inserts copyright information into the digital object without the loss of quality. Whenever the copyright of a digital object is in question, this information is extracted to identify the rightful owner. It is also possible to encode the identity of the original buyer along with the identity of the copyright holder, which allows tracing of any unauthorized copies. The most prominent way of embedding information in multimedia data is the use of digital watermarking.

13. References:
• www.wikipedia.com
• www.whatIs.com
• www.digitalwatermarkingworld.com
• www.digitalwatermarkingalliance.com
• www.watermarker.com
• www.jjtc.com
• Internet- ebook

Bio-metric Security -iris Recognisation Technology


1) ABSTRACT
2) WHAT IS BIOMETRICS
3) WHY WE USE BIOMETRICS
4) TYPES OF BIOMETRICS
5) IRIS SCANNING
6) HOW IT WORKS
7) THE ACCURACY OF IRIS RECOGNISATION
8) APPLICATIONS
9) ADVANTAGES & LIMITATIONS
10) CONCLUSION.

ABSTRACT: 
In the present scenario security has become a major aspect. From ATM to AIRPORTS security has become important. The number of system that have been comprised is ever increasing and authenticity plays a major role as a first line of defense against intruders. Identity verification has become a challenging task and an attractive goal when it has to be automated with high accuracy and no reputability .The three main types of authentification are something you know (such as password) ,something you are (BIOMETRIC). The first 2two methods are inadequate to meet heavy demands as are notorious and easily crack able, so it become very difficult to identify the actual owner. In this context automated biometrics can meet all the demand as they are difficult to replicate and steal. However this paper deals with Irises technology and requirements and developments for future security systems.

I. WHAT IS BIOMERTICS?              Biometrics is development of statistical and mathematical methods applicable.
The term "biometrics" is derived from the Greek words bio (life) and metric (to measure). For our use, biometrics refers to technologies for measuring and analyzing a person's physiological or behavioral characteristics, such as fingerprints, irises, voice patterns, facial patterns, and hand measurements, for identification and verification purposes.

II.WHY WE USE BIOMETRICS? 
                        It makes it possible to guarantee in an absolute, infallible way and ultra confidential safety, the recognition and access control with the physical places or the information processing systems, revolutionizing in same time the securisation and the authentification of E-business and E-trade.
III. TYPES OF BIOMETRICS: 
     There are two types of biometrics: 
behavioral and physical. Behavioral biometrics are generally used for verification while physical biometrics can be used for either identification or verification.

Examples of physical biometrics include:
 Bertillonage - measuring body lengths
• Fingerprint - analyzing fingertip patterns
 Facial Recognition - measuring facial characteristics
 Hand Geometry - measuring the shape of the hand
• Iris Scan - analyzing features of colored ring of the eye
 Retinal Scan - analyzing blood vessels in the eye
• Vascular Patterns - analyzing vein patterns
 DNA - analyzing genetic makeup
Examples of behavioral biometrics include:
 Speaker Recognition - analyzing vocal behavior
 Signature - analyzing signature dynamics
 Keystroke - measuring the time spacing of typed words
Major limitations of each BIOMETRICS: In the case of
 Bertillonage - body lengths no longer used.
 Fingerprint – we can change the hand or by gambling also.
 Facial Recognition - facial characteristics will change time to time.
 Hand Geometry - the shape of the hand also change the age and not accurate.
 Iris Scan – Not applicable for blind people.
 Retinal Scan – Eye will be effected more and more.
 Vascular Patterns - Vein scans usually use radioactive particles. DNA –DNA is same for twins.
 Speaker Recognition - vocal behavior can be change by imitations.
 Signature – forgery of signature dynamics
 Keystroke – not at all that much of accurate.
Out of all these biometric methods the accurate method is one and only one method which is referred to as Iris scanning method.

HISTORY:              
  The idea of using iris patterns for personal identification was originally proposed in 1936 by ophthalmologist Frank Burch. By the 1980's the idea had appeared in James Bond films, but it still remained science fiction and conjecture. In 1987 two other ophthalmologists, Aran Safir and Leonard Flom, patented this idea, and in 1989 they asked John Daugman (then teaching at Harvard University) to try to create actual algorithms for iris recognition. These algorithms, which Daugman patented in 1994 and are owned by Iridian Technologies, are the basis for all current iris recognition systems and products.
Iris scanning can seem very futuristic, but at the heart of the system is a simple CCD digital camera.. It uses both visible and near-infrared light to take a clear, high-contrast picture of a person's iris. With near-infrared light, a person's pupil is very black, making it easy for the computer to isolate the pupil and iris.
When you look into an iris scanner, either the camera focuses automatically or you use a mirror or audible feedback from the system to make sure that you are positioned correctly. Usually, your eye is 3 to 10 inches from the camera. When the camera takes a picture, the computer locates:
• The center of the pupil
• The edge of the pupil
• The edge of the iris
• The eyelids and eyelashes
It then analyzes the patterns in the iris and translates them into a code.Iris scanners are becoming more common in high-security applications because people's eyes are so unique (the chance of mistaking one iris code for another is 1 in 10 to the 78th power. They also allow more than 200 points of reference for comparison, as opposed to 60 or 70 points in fingerprints.
The iris is a visible but protected structure, and it does not usually change over time, making it ideal for biometric identification. Most of the time, people's eyes also remain unchanged after eye surgery, and blind people can use iris scanners as long as their eyes have irises. Eyeglasses and contact lenses typically do not interfere or cause inaccurate readings.
V. IRIS SCAN: Iris scans analyze the



features that exist in the colored tissue surrounding the pupil which has more than
200 points that can be used for comparison, including rings, furrows and freckles. The scans use a regular video

camera style and can be done from further away than a retinal scan. It will work through glasses fine and in fact has the ability to create an accurate enough measurement that it can be used for identification purposes, and not just verification.
VI. HOW IT WORKS: The user places himself so that he can see his own eye's reflection in the device. The user may be able to do this from up to 2 feet

may need to be as close as a couple of inches depending on the device. Verification time is generally less than 5 seconds, though the user will only need to look into the device for a couple moments.
To prevent a fake eye from being used to fool the system, these devices may vary the light shone into the eye and watch for pupil dilation.
Identification vs. Verification:
Iris recognition identifies people rather than verifying their identity.
Verification: asks; Is this person who they say they are? This is one-to-one matching which means a person must first suggest their identity through a password, card or name and the system then seeks to determine whether or not there is a match between the suggested and true identities.
Identification: asks; Who is this person? This is one-to-many matching meaning that the person is not required to carry anything or volunteer any information. The system simply captures the iris image, searches the entire database and either finds their identity or reports that they are unknown. This is obviously a much more powerful form of authentication as no information is required from the user.
It has several features .those are
Stable: - 
           the unique pattern in the human iris is formed by 10 months of age, and remains unchanged throughout one's lifetime.
Unique: - 
            the probability of two rises producing the same code is nearly impossible.
Flexible: - 
           iris recognition technology easily integrates into existing security systems or operates as a standalone.
Reliable: - a distinctive iris pattern is not susceptible to theft, loss or compromise Non-Invasive: - a distinctive iris pattern is not susceptible to theft, loss or compromise.
This proven biometric approach is fast and remarkably accurate, and lets you design systems that overcome the limitations of typical card or password strategies.

VII. The accuracy of Iris Recognition:
 
Iris readers use state-of-the art Iris Recognition technology to verify the


identity of authorized persons positively and definitively - with virtually no chance of mis-identification in all applications.
The identification is based on the intricate patterns in the iris of the eye, the ring-shaped structure that gives the eye its color. No two individuals, not even identical twins, have the same exact iris pattern.

Panasonic Iris Recognition has a false acceptance ratio of 0.001% to 0.0001%, making it far more accurate than other biometric approaches.
• 100 to 1,000 times more accurate than spot fingerprinting
• 1,000 to 10,000 times more accurate than hand-print verification
• 3,000 times more accurate than voice prints.
A complete, ready-to-use solution: Iris Readers incorporate a specially-designed video camera for capturing iris images, along with on-board software for processing the iris images and communicating with other elements of your access control system.

Identify almost instantly:
 
                 Then, at each access point, a user simply 'looks into' the Reader mounted alongside the doorway. The Reader captures a video image of the iris, translates it to an IrisCode, and compares it to the authorized IrisCodes on file. If there's a proper match, the Reader signals your access system accordingly. It takes about 1.5 seconds. And works with contact lenses, glasses, even protective goggles and face shields.

Ultra-accurate, almost impossible to defeat:

Iris Readers use built-in countermeasures that make them virtually impossible to counterfeit or spoof.
In fact, it's estimated the chance of two irises being identical is 1 in 1078 : Of all the biometric technologies used for human authentication today, it is generally conceded that iris recognition is the most accurate. Iris recognition technology offers the highest accuracy in identifying individuals of any method available. This is because no two irises are alike - not between identical twins, or even between the left and right eye of the same person. Irises are also stable; unlike other identifying characteristics that can change with age; the pattern of one's iris is fully formed by ten months of age and remains the same for the duration of their lifetime. Iris recognition technology is also accurate because it uses more than 240 points of reference in an iris pattern as a basis for a match. By comparison, fingerprints use about 60.
Iris recognition technology works by combining computer vision, pattern recognition, and optics. First, a black-and-white video camera zooms in on the iris and records a sharp image of it. The iris is lit by a low-level light to aid the camera in focusing. A frame from this video is then digitized into a 512 byte file and stored on a computer database.
Iris recognition technology is capable of recording this image from as much as 16 inches (40.64 centimeters) away, so no physical contact is necessary. An individual's identity can then be confirmed by taking another picture of their iris and comparing it to the database. Iris recognition technology can confirm someone's identity within a few seconds.
Iris recognition technology is currently used at physical access points demanding high security, such as airports, government buildings, and research laboratories. However, some hotels have experimented with using iris recognition technology in place of a room key. The potential exists for iris recognition technology to replace most current forms of physical access-based identification. This would include anything requiring a password, personal identification number (PIN), or key; such as electronic transactions, building access, or automobile ignition. And unlike those physical methods of identification, an iris cannot be stolen. Iris recognition technology addresses the problems of both password management and fraud.
What about DNA?
The birth rate of identical twins is 1 in 121 births or 0.82%. As identical twins share the same DNA, the false acceptance rate for any DNA based system must be at least 0.82% due to the birth rate alone. DNA testing is an invasive technology with a cotton swab inserted into the mouth the most common method of obtaining a sample. Combine this with the negative stigma associated with DNA sampling and it becomes clear that iris recognition is the most accurate, safe, user-friendly and fastest identification system on the market.

VIII. APPLICATIONS:
 
Law enforcement agencies in the United States began using it in 1994 when the Lancaster County Prison in Pennsylvania became the first correctional facility to employ the technology for prisoner identification. The use of iris scans as part of the booking procedure along with fingerprints is just beginning to come into existence. Police stations around the country have been looking into the technology and some, including the Barnstable County jail in Massachusetts which put in a system in early 2002. The power of this biometric may make it rival fingerprints for booking situations where identification and verification are vital .In Berkshire County, the technology is used in the newly built Berkshire County Jail as a security check for employees. The Charlotte/Douglas International Airport in North Carolina and the Flughafen Frankfort Airport in Germany allow frequent passengers to register their iris scans in an effort to streamline boarding procedures. There is discussion that banks may someday make iris scans a routine part of ATM transactions and some have begun taking the first steps in testing out these systems.

In Criminal activities:
         Financial fraud - This type of identity theft includes bank fraud, credit card fraud, computer and telecommunications fraud, social program fraud, tax refund fraud, mail fraud, and several more. In fact, a total of 25 types of financial identity fraud are investigated by the United States Secret Service. While financial identity theft is the most prevalent (of the approximate 10,000 financial crime arrests that Secret Service agents made in 1997, 94 percent involved identity theft), it certainly isn't the only type. Other types of identity theft, however, usually involve a financial element as well -- typically to fund some sort of criminal enterprise.

Criminal activities 
This type of identity fraud involves taking on someone else's identity in order to commit a crime, enter a country, get special permits, hide one's own identity, or commit acts of terrorism. These criminal activities can include:
 Computer and cyber crimes
 Organized crime
 Drug trafficking
 Alien smuggling
 Money laundering
In order to avoid all the crime activities and fraud activities we should use Iris technology .

COMPARISION WITH OTHER BIOMETRIC TECHNOLOGIES:
 
          Cost-precision relation: When one calls upon one of these techniques, one first seeks precision, but one also interests in the cost. The graph below shows us the situation of certain techniques compared to these two criteria.

We can notice that, in spite of its 5th place in the market, the iris method of is the most precise, but also the most expensive. It is moreover this technique, particularly effective, that one finds in the film "Minority Report" of Steven Spielberg.
1. This content belongs to



LIMITATIONS: 
1) It will affect the eye & not applicable to eye challenged people.
2) The properties can be changed if any eye damage occurred.
3) If retina has changed then it may not be applicable.

Evaluation: 
            The uniqueness of eyes, even between the left and right eye of the same person, makes iris scanning very powerful for identification purposes. The likelihood of a false positive is extremely low and its relative speed and ease of use make it a great potential biometric. The only drawbacks are the potential difficulty in getting someone to hold their head in the right spot for the scan if they are not doing the scan willingly. It also takes up a bit more memory for the data to be stored, but with the advances in technology, this is unlikely to cause any major difficulty.


IX. ADVANTAGES of IRIS TECHNOLOGY SYSTEM:
 
1) The system involves no lasers, bright lights, or any hazardous technology at all. It's as safe to use as any video camera.

2) An award winning access control system.
3) Has no requirement or costs for cards or PIN's .
4) Is more accurate than DNA matching. No recorded instance of a false accept.
6) Has a very small record size (IrisCode 512 bytes).
6) Uses identification, (one to many) not verification (one to one) matching 7) Is non-contact. Works with glasses, protective clothing, safety shields and contact lenses.
8) Images the iris which is stable over life. One enrolment only.
9) Is non-invasive and non-contact. 10)Uses Video based technology .
11) Has extremely fast database matching (match rates in excess of 100,000 per second achieved on a standard PC).


CONCLUSION
 In order to avoid all the crime activities and fraud activities and for Anti-terrorism, we should use Iris technology. The uniqueness of eyes, even between the left and right eye of the same person, makes iris scanning very powerful for identification purposes. The likelihood of a false positive is extremely low and its relative speed and ease of use make it a great potential biometric. Iris Readers use built-in countermeasures that make them virtually impossible to counterfeit or spoof. It is the absolutely genius and unique technology in order to avoid crime activities and to attain more and more security.

REFERENCES:


• Sturgeon, W. (2004). “Biometrics used to keep German Olympians safe...but what are they testing - moustache or mullet?” Security Strategy Sillicon.com

• “The Biometrics Market in Germany 2004-2009: Anti-terrorism Laws Drive Growth” (2004). Soreon Research.
• Tracy V.Wilson, (2004) from “How Biometrics works?”
• Dinah BLIRANDO, Student-Engineer Supinfo Caraïbes SUPINFO graduate year 2007


• Bertillonage - measuring body lengths
• Fingerprint - analyzing fingertip patterns
• Facial Recognition - measuring facial characteristics
• Hand Geometry - measuring the shape of the hand
• Iris Scan - analyzing features of colored ring of the eye
• Retinal Scan - analyzing blood vessels in the eye
• Vascular Patterns - analyzing vein patterns
• DNA - analyzing genetic makeup


Examples of behavioral biometrics include:
• Speaker Recognition - analyzing vocal behavior
• Signature - analyzing signature dynamics
• Keystroke - measuring the time spacing of typed words
Major limitations of each BIOMETRICS: In the case of
• Bertillonage - body lengths no longer used.
• Fingerprint – we can change the hand or by gambling also.
• Facial Recognition - facial characteristics will change time to time.
• Hand Geometry - the shape of the hand also change the age and not accurate.
• Iris Scan – Not applicable for blind people.
• Retinal Scan – Eye will be effected more and more.
• Vascular Patterns - Vein scans usually use radioactive particles. DNA –DNA is same for twins.
• Speaker Recognition - vocal behavior can be change by imitations.
• Signature – forgery of signature dynamics
• Keystroke – not at all that much of accurate.
Out of all these biometric methods the accurate method is one and only one method which is referred to as Iris scanning method.


HISTORY:  

               The idea of using iris patterns for personal identification was originally proposed in 1936 by ophthalmologist Frank Burch. By the 1980's the idea had appeared in James Bond films, but it still remained science fiction and conjecture. In 1987 two other ophthalmologists, Aran Safir and Leonard Flom, patented this idea, and in 1989 they asked John Daugman (then teaching at Harvard University) to try to create actual algorithms for iris recognition. These algorithms, which Daugman patented in 1994 and are owned by Iridian Technologies, are the basis for all current iris recognition systems and products.
Iris scanning can seem very futuristic, but at the heart of the system is a simple CCD digital camera.. It uses both visible and near-infrared light to take a clear, high-contrast picture of a person's iris. With near-infrared light, a person's pupil is very black, making it easy for the computer to isolate the pupil and iris.
When you look into an iris scanner, either the camera focuses automatically or you use a mirror or audible feedback from the system to make sure that you are positioned correctly. Usually, your eye is 3 to 10 inches from the camera. When the camera takes a picture, the computer locates:
• The center of the pupil
• The edge of the pupil
• The edge of the iris
• The eyelids and eyelashes
It then analyzes the patterns in the iris and translates them into a code.Iris scanners are becoming more common in high-security applications because people's eyes are so unique (the chance of mistaking one iris code for another is 1 in 10 to the 78th power. They also allow more than 200 points of reference for comparison, as opposed to 60 or 70 points in fingerprints.
The iris is a visible but protected structure, and it does not usually change over time, making it ideal for biometric identification. Most of the time, people's eyes also remain unchanged after eye surgery, and blind people can use iris scanners as long as their eyes have irises. Eyeglasses and contact lenses typically do not interfere or cause inaccurate readings.


V. IRIS SCAN:  

        Iris scans analyze the
features that exist in the colored tissue surrounding the pupil which has more than
200 points that can be used for comparison, including rings, furrows and freckles. The scans use a regular video

camera style and can be done from further away than a retinal scan. It will work through glasses fine and in fact has the ability to create an accurate enough measurement that it can be used for identification purposes, and not just verification.
VI. HOW IT WORKS: 

The user places himself so that he can see his own eye's reflection in the device. The user may be able to do this from up to 2 feet
may need to be as close as a couple of inches depending on the device. Verification time is generally less than 5 seconds, though the user will only need to look into the device for a couple moments.
To prevent a fake eye from being used to fool the system, these devices may vary the light shone into the eye and watch for pupil dilation.
Identification vs. Verification:
Iris recognition identifies people rather than verifying their identity.
Verification: 

        asks; Is this person who they say they are? This is one-to-one matching which means a person must first suggest their identity through a password, card or name and the system then seeks to determine whether or not there is a match between the suggested and true identities.
Identification: asks; Who is this person? This is one-to-many matching meaning that the person is not required to carry anything or volunteer any information. The system simply captures the iris image, searches the entire database and either finds their identity or reports that they are unknown. This is obviously a much more powerful form of authentication as no information is required from the user.
It has several features .those are
Stable: - the unique pattern in the human iris is formed by 10 months of age, and remains unchanged throughout one's lifetime.
Unique: - 

the probability of two rises producing the same code is nearly impossible.
Flexible: - 

 iris recognition technology easily integrates into existing security systems or operates as a standalone.
Reliable: -           

                  a distinctive iris pattern is not susceptible to theft, loss or compromise Non-Invasive: - a distinctive iris pattern is not susceptible to theft, loss or compromise.
This proven biometric approach is fast and remarkably accurate, and lets you design systems that overcome the limitations of typical card or password strategies.


VII. The accuracy of Iris Recognition:

 
Iris readers use state-of-the art Iris Recognition technology to verify the identity of authorized persons positively and definitively - with virtually no chance of mis-identification in all applications.
The identification is based on the intricate patterns in the iris of the eye, the ring-shaped structure that gives the eye its color. No two individuals, not even identical twins, have the same exact iris pattern.

Panasonic Iris Recognition has a false acceptance ratio of 0.001% to 0.0001%, making it far more accurate than other biometric approaches.
• 100 to 1,000 times more accurate than spot fingerprinting
• 1,000 to 10,000 times more accurate than hand-print verification
• 3,000 times more accurate than voice prints.
A complete, ready-to-use solution: Iris Readers incorporate a specially-designed video camera for capturing iris images, along with on-board software for processing the iris images and communicating with other elements of your access control system.


Identify almost instantly:


              Then, at each access point, a user simply 'looks into' the Reader mounted alongside the doorway. The Reader captures a video image of the iris, translates it to an IrisCode, and compares it to the authorized IrisCodes on file. If there's a proper match, the Reader signals your access system accordingly. It takes about 1.5 seconds. And works with contact lenses, glasses, even protective goggles and face shields.


Ultra-accurate, almost impossible to defeat:

               Iris Readers use built-in countermeasures that make them virtually impossible to counterfeit or spoof.
In fact, it's estimated the chance of two irises being identical is 1 in 1078 : Of all the biometric technologies used for human authentication today, it is generally conceded that iris recognition is the most accurate. Iris recognition technology offers the highest accuracy in identifying individuals of any method available. This is because no two irises are alike - not between identical twins, or even between the left and right eye of the same person. Irises are also stable; unlike other identifying characteristics that can change with age; the pattern of one's iris is fully formed by ten months of age and remains the same for the duration of their lifetime. Iris recognition technology is also accurate because it uses more than 240 points of reference in an iris pattern as a basis for a match. By comparison, fingerprints use about 60.
Iris recognition technology works by combining computer vision, pattern recognition, and optics. First, a black-and-white video camera zooms in on the iris and records a sharp image of it. The iris is lit by a low-level light to aid the camera in focusing. A frame from this video is then digitized into a 512 byte file and stored on a computer database.
Iris recognition technology is capable of recording this image from as much as 16 inches (40.64 centimeters) away, so no physical contact is necessary. An individual's identity can then be confirmed by taking another picture of their iris and comparing it to the database. Iris recognition technology can confirm someone's identity within a few seconds.
Iris recognition technology is currently used at physical access points demanding high security, such as airports, government buildings, and research laboratories. However, some hotels have experimented with using iris recognition technology in place of a room key. The potential exists for iris recognition technology to replace most current forms of physical access-based identification. This would include anything requiring a password, personal identification number (PIN), or key; such as electronic transactions, building access, or automobile ignition. And unlike those physical methods of identification, an iris cannot be stolen. Iris recognition technology addresses the problems of both password management and fraud.


What about DNA?

 
                          The birth rate of identical twins is 1 in 121 births or 0.82%. As identical twins share the same DNA, the false acceptance rate for any DNA based system must be at least 0.82% due to the birth rate alone. DNA testing is an invasive technology with a cotton swab inserted into the mouth the most common method of obtaining a sample. Combine this with the negative stigma associated with DNA sampling and it becomes clear that iris recognition is the most accurate, safe, user-friendly and fastest identification system on the market.


VIII. APPLICATIONS:

 
  • Law enforcement agencies in the United States began using it in 1994 when the Lancaster County Prison in Pennsylvania became the first correctional facility to employ the technology for prisoner identification. The use of iris scans as part of the booking procedure along with fingerprints is just beginning to come into existence. Police stations around the country have been looking into the technology and some, including the Barnstable County jail in Massachusetts which put in a system in early 2002. The power of this biometric may make it rival fingerprints for booking situations where identification and verification are vital .In Berkshire County, the technology is used in the newly built Berkshire County Jail as a security check for employees. The Charlotte/Douglas International Airport in North Carolina and the Flughafen Frankfort Airport in Germany allow frequent passengers to register their iris scans in an effort to streamline boarding procedures. There is discussion that banks may someday make iris scans a routine part of ATM transactions and some have begun taking the first steps in testing out these systems.

In Criminal activities:


  Financial fraud - This type of identity theft includes bank fraud, credit card fraud, computer and telecommunications fraud, social program fraud, tax refund fraud, mail fraud, and several more. In fact, a total of 25 types of financial identity fraud are investigated by the United States Secret Service. While financial identity theft is the most prevalent (of the approximate 10,000 financial crime arrests that Secret Service agents made in 1997, 94 percent involved identity theft), it certainly isn't the only type. Other types of identity theft, however, usually involve a financial element as well -- typically to fund some sort of criminal enterprise.

Criminal activities –
                    This type of identity fraud involves taking on someone else's identity in order to commit a crime, enter a country, get special permits, hide one's own identity, or commit acts of terrorism. These criminal activities can include:
 Computer and cyber crimes
 Organized crime
 Drug trafficking
 Alien smuggling
 Money laundering
In order to avoid all the crime activities and fraud activities we should use Iris technology .


COMPARISION WITH OTHER BIOMETRIC TECHNOLOGIES:
Cost-precision relation: When one calls upon one of these techniques, one first seeks precision, but one also interests in the cost. The graph below shows us the situation of certain techniques compared to these two criteria.

We can notice that, in spite of its 5th place in the market, the iris method of is the most precise, but also the most expensive. It is moreover this technique, particularly effective, that one finds in the film "Minority Report" of Steven Spielberg.
1. This content belongs to

LIMITATIONS:    


 1) It will affect the eye & not applicable to eye challenged people.
2) The properties can be changed if any eye damage occurred.
3) If retina has changed then it may not be applicable.

Evaluation:  

            The uniqueness of eyes, even between the left and right eye of the same person, makes iris scanning very powerful for identification purposes. The likelihood of a false positive is extremely low and its relative speed and ease of use make it a great potential biometric. The only drawbacks are the potential difficulty in getting someone to hold their head in the right spot for the scan if they are not doing the scan willingly. It also takes up a bit more memory for the data to be stored, but with the advances in technology, this is unlikely to cause any major difficulty.


IX. ADVANTAGES of IRIS TECHNOLOGY SYSTEM:


1) The system involves no lasers, bright lights, or any hazardous technology at all. It's as safe to use as any video camera.

2) An award winning access control system.
3) Has no requirement or costs for cards or PIN's .
4) Is more accurate than DNA matching. No recorded instance of a false accept.
6) Has a very small record size (IrisCode 512 bytes).
6) Uses identification, (one to many) not verification (one to one) matching 7) Is non-contact. Works with glasses, protective clothing, safety shields and contact lenses.
8) Images the iris which is stable over life. One enrolment only.
9) Is non-invasive and non-contact. 10)Uses Video based technology .
11) Has extremely fast database matching (match rates in excess of 100,000 per second achieved on a standard PC).


CONCLUSION: 

                         In order to avoid all the crime activities and fraud activities and for Anti-terrorism, we should use Iris technology. The uniqueness of eyes, even between the left and right eye of the same person, makes iris scanning very powerful for identification purposes. The likelihood of a false positive is extremely low and its relative speed and ease of use make it a great potential biometric. Iris Readers use built-in countermeasures that make them virtually impossible to counterfeit or spoof. It is the absolutely genius and unique technology in order to avoid crime activities and to attain more and more security.