Science News & Science Current Events
 
Email a Friend Send to a friend
Printer Friendly Print NIST tool helps Internet master top-level domains

NIST tool helps Internet master top-level domains

May 19, 2008

At the request of a worldwide Internet organization, a computer scientist at the National Institute of Standards and Technology (NIST) developed an algorithm that may guide applicants in proposing new "top-level domains"-the last part of an Internet address, such as .com, that people type in navigating the Web. As new top-level domains are added to the familiar .com, .info and .net, the algorithm* checks whether the newly proposed name is confusingly similar to existing ones by looking for visual likenesses in its appearance. Having visually distinct top-level domain names may help avoid confusion in navigating the ever-expanding Internet and combat fraud, by reducing the potential to create malicious look-alikes: .C0M with a zero instead of .COM, for instance.

Later this year, the Internet Corporation for Assigned Names and Numbers (ICANN) plans to launch the process for proposing a new round of "generic" top-level domains (gTLDs), strings such as .net, .gov and .org meant to indicate organizations or interests. In preparing for newly proposed gTLDs, ICANN reached out to various algorithm developers, including NIST's Paul E. Black, as among those engaged to "provide an open, objective, and predictable mechanism for assessing the degree of visual confusion" in gTLDs.




Black's algorithm compares a proposed gTLD with other TLDs and generates a score based on their visual similarities. For example, the domain .C0M scores an 88 percent visual similarity with the familiar .COM. The resulting scores may help indicate whether the newly proposed domain name looks too much like existing ones.

To make its assessments, the algorithm rates the degree of similarity between pairs of alpha-numeric characters. Some pairs, such as the numeral "1" and its dead-ringer, the lowercase letter "l," are assigned the highest scores for visual similarity while other pairs, such as "h" and "n", are given lower scores. The algorithm takes other considerations into account, for example how certain pairs of letters, like "c" and "l," can join to look like a third letter ("d"), as in the case of "close" and "dose." Employing these scores and considerations, the algorithm computes the "cost" of transforming one string of characters into another, such as "opel" into "apple." Lower cost means higher visual similarity. The algorithm then adjusts for the relative lengths of the two strings (different lengths increase their distinctiveness) and converts the final cost into a percent similarity.

ICANN is considering future enhancements to the algorithm, such as having it check for visual confusion between existing domains and future planned Internet top-level domain names in scripts such as Cyrillic.

National Institute of Standards and Technology (NIST)



Related Algorithm Current Events and Algorithm News Articles Algorithm Current Events and Algorithm News RSS Algorithm Current Events and Algorithm News RSS
Method of predicting clear air turbulence could make flights smoother in the future
It comes blasting out of the blue on your airplane flight: sudden bumpiness and sometimes even a violent plummeting. It arrives without warning, and it can be more than frightening, since it causes tens of millions of dollars in injury claims every year.

Researchers develop new self-training gene prediction program for fungi
Researchers at the Georgia Institute of Technology have developed a computer program that trains itself to predict genes in the DNA sequences of fungi.

Latest Electoral College forecast shows McCain ahead by as many as 27 votes
A new approach to determining which candidate will win the most electoral votes in the U.S. Presidential race factors in lessons learned from the 2004 election and uses sophisticated math modeling.

NIST studies how new helium ion microscope measures up
Just as test pilots push planes to explore their limits, researchers at the National Institute of Standards and Technology (NIST) are probing the newest microscope technology to further improve measurement accuracy at the nanoscale.

What a Sleep Study Can Reveal About Fibromyalgia
Research engineers and sleep medicine specialists from two Michigan universities have joined technical and clinical hands to put innovative quantitative analysis, signal-processing technology and computer algorithms to work in the sleep lab.

A Little Nitrogen Can Go a Long Way
Varying the rate of crop production inputs such as fertilizer and seed makes intuitive sense, as farmers have long observed differences in crop yield in various areas of a single field. The availability of spatial yield information from combines equipped with yield monitors has provided a good resource for improved management.

Most vaccine-allergic children can still be safely vaccinated, Hopkins experts say
With close monitoring and a few standard precautions, nearly all children with known or suspected vaccine allergies can be safely immunized, according to a team of vaccine safety experts led by the Johns Hopkins Children's Center.

Scientists develop new method to investigate origin of life
Scientists at Penn State have developed a new computational method that they say will help them to understand how life began on Earth.

UC San Diego Researchers' New Algorithm Significantly Boosts Routing Efficiency of Networks
A time-and-money-saving question shared by commuters in their cars and networks sharing ever-changing Internet resources is: "What's the best way to get from here to there?"

'Virtual archaeologist' reconnects fragments of an ancient civilization
For several decades, archaeologists in Greece have been painstakingly attempting to reconstruct wall paintings that hold valuable clues to the ancient culture of Thera, an island civilization that was buried under volcanic ash more than 3,500 years ago.
More Algorithm Current Events and Algorithm News Articles


Introduction to Algorithms and Java
by Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to...



The Algorithm Design Manual
by Steven S. Skiena

....The most comprehensive guide to designing practical and efficient algorithms!.... The Algorithm Design Manual, Second Edition "...the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject."...



Algorithm Design
by Jon Kleinberg, Éva Tardos

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer...



Introduction to the Design and Analysis of Algorithms (2nd Edition)
by Anany V. Levitin

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes...



Approximation Algorithms
by Vijay V. Vazirani

This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to...



Data Structures and Algorithm Analysis in C++ (3rd Edition)
by Mark Allen Weiss

In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical topics like abstract data types and the efficiency of algorithms, as well as performance and running time. This edition also...



Data Structures and Algorithms in Java
by Michael T. Goodrich, Roberto Tamassia

Fundamental data structures in a consistent object-oriented framework Now revised to reflect the innovations of Java 5.0, Goodrich and Tamassia's Fourth Edition of Data Structures and Algorithms in Java continues to offer accessible coverage of fundamental data structures, using a consistent object-oriented framework. The authors provide intuition, description, and analysis of...



Algorithms
by Sanjoy Dasgupta, Christos H. Papadimitriou, Umesh Vazirani

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to...



Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr)
by Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft



Randomized Algorithms
by Rajeev Motwani, Prabhakar Raghavan

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are...

© 2008 BrightSurf.com