
	Where results make sense

Topic: Hans Peter Luhn

Related Topics

Luhn algorithm

Credit card number

In the News (Thu 17 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Hans Peter Luhn - Wikipedia, the free encyclopedia
		Hans Peter Luhn was born in Barmen, Germany on July 1, 1896.
		After the war Luhn entered the textile field, which eventually led him to the United States, where he invented a threadcounting gauge (the Lunometer) which is still on the market: http://www.lunometer.com.
		Luhn spent greater and greater amounts of time on the problems of information retrieval and storage faced by libraries and documentation centers, and pioneered the use of data processing equipment in resolving these problems.
	en.wikipedia.org /wiki/Hans_Peter_Luhn (458 words)

	CHOPGO.COM eShop - Secret of your Credit Card Number - Luhn formula
		The algorithm used to arrive at the proper check digit is called the Luhn algorithm, after IBM scientist Hans Peter Luhn (1896-1964), who was awarded US Patent 2950048 ("Computer for Verifying Numbers") for the technique in 1960.
		Based on ANSI X4.13, the LUHN formula (also known as the modulus 10 -- or mod 10 -- algorithm) is used to generate and/or validate and verify the accuracy of credit-card numbers.
		The Luhn algorithm (also known as the mod 10 algorithm) is used to catch data entry errors when entering long sequences of numbers.
	www.chopgo.com /offering/CreditCardNumber.html (1329 words)

	Hans Peter Luhn - Wikipedia
		Luhn wurde 1896 als Sohn des Druckereibesitzers Peter Luhn und Enkel des Seifenfabrikanten August Luhn in Barmen geboren.
		Luhn fand für dieses und andere Probleme Lösung mit Hilfe von Lochkarten, musste dafür aber oftmals die Limitationen der damals verfügbaren Maschinen umgehen, indem er neue Wege fand, diese zu nutzen.
		Luhn war der Erste oder einer der Ersten, die Techniken erarbeiteten, die in der Informationswissenschaft heutzutage selbstverständlich sind.
	de.wikipedia.org /wiki/Hans_Peter_Luhn (422 words)


		He was also a pioneer in the development and application of automatic measuring and controlling devices, binary arithmetic systems, switching devises, serial binary computers, electronic information scanning, and storage and retrieval devices.
		His career in printing was halted by his service as a communications officer in the German Army during World War I. After the war Luhn entered the textile field, which eventually led him to the United States, where he invented a threadcounting machine (the Lunometer) that was still being marketed in the 1980's.
		"Luhn was the first, or among the first, to work out many of the basic techniques now commonplace in information science." These techniques included full-text processing; Key Word in Context indexing (KWIC); auto-indexing; automatic abstracting and the concept of selective dissemination of information (SDI).
	www.libsci.sc.edu /bob/ISP/luhn.htm (622 words)

	Amazon.com: "Hans Peter Luhn": Key Phrase page (Site not responding. Last check: 2007-10-29)
		Hans Peter Luhn, the modern "inventor" of keyword searching, defended this easy and inexpensive form of accessing bibliographic information on the grounds that...
		Luhn himself was clear about the relation of his own use of the word to that of Roget, but the...
		The "documentation methods" of the 1960s and the work of such documentalists as Mortimer Taube,: Hans Peter Luhn' and Gerald Salton' were designed to improve subject access to information over traditional classification and subject catalog- ing methods and...
	www.amazon.com /phrase/Hans-Peter-Luhn (526 words)

	ComputerBase - Lexikon: Extraktionsalgorithmus nach Luhn (Site not responding. Last check: 2007-10-29)
		Da Luhn der Meinung war, dass nur Worte mit mittlerer Häufigkeit etwas über die Signifikanz eines Satzes aussagen und Worte mit sehr hoher Häufigkeit eher nichtssagend, weil zu allgemein sind, wollte er diese allgemeinen Worte mit sehr hohem Vorkommen im Text ausschließen.
		Luhn entschied sich für die zweite, einfachere Variante.
		Nach Luhns Meinung werden die Nutzer von Zusammenfassungssystemen nach und nach Lernen, wie die erstellten Zusammenfassungen interpretiert werden müssen.
	www.computerbase.de /lexikon/Extraktionsalgorithmus_nach_Luhn (681 words)

	cs2041 - q.html (Site not responding. Last check: 2007-10-29)
		The validation algorithm used for credit cards is an old one devised by Hans-Peter Luhn (1896-1964), a mathematician at IBM (he was also a prolific inventor of devices as well as information processes).
		The Luhn formula assigns weights of 1 for odd positions and 2 for even positions, counting from the right as usual.
		The Luhn formula detects all single substitution errors and all but one pair of adjacent transposition errors.
	www.cse.unsw.edu.au /~cs2041/06s2/tut/week08/q.html (768 words)

	Hashing Concepts and the Java Programming Language: Introduction
		A proposal for hash search was described by Hans Peter Luhn in an IBM technical memorandum in 1953.
		Luhn's goal for producing uniform randoms is one approach, but often in computer science the goal of getting a completely even distribution has been substituted for it.
		The change in goal is significant and leads to two completely different lines of research both of which are commonly called `hashing'.
	www.serve.net /buz/hash.adt/java.001.html (899 words)

	Anatomy of Credit Card Numbers
		The most succint description of the Luhn algorithm I have found comes from the hacker publication phrack 47-8: "For a card with an even number of digits, double every odd numbered digit and subtract 9 if the product is greater than 9.
		By changing the check digit from 0 to 3, we arrive at the number 4408 0412 3456 7893, which does pass the Luhn check, since the sum of the digits in the bottom row would be 70, which is divisible by 10.
		By changing the check digit from 2 to 3, we arrive at the number 4417 1234 5678 9113, which does pass the Luhn check, since the sum of the digits in the bottom row would be 70, which is divisible by 10.
	www.merriampark.com /anatomycc.htm (1161 words)

	CHF - CHRONOLOGY OF CHEM INFO SCIENCE - STORED AND RETRIEVED ELECTROMECHANICALLY
		Watson agrees to work on the problem and assigns Hans Peter Luhn to the project.
		Hans Peter Luhn develops prototype of the Luhn Scanner for IBM.
		Hans Peter Luhn (IBM) and Herbert Ohlman (System Development Corporation) display first key word in context (KWIC) indexes at ICSI.
	www.chemheritage.org /explore/timeline/MACHINE.HTM (684 words)

	Luhn algorithm - Wikipedia, the free encyclopedia
		The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers and Canadian Social Insurance Numbers.
		It was created by IBM scientist Hans Peter Luhn and described in US Patent 2,950,048, filed on January 6, 1954 and granted on August 23, 1960.
		The following is an algorithm (in C#) to generate a number that passes the Luhn algorithm.
	en.wikipedia.org /wiki/Luhn_algorithm (607 words)

	Illuminations: Check That Digit
		The process used to determine the check digit is the Luhn algorithm (mod 10), named after IBM scientist Hans Peter Luhn.
		If the check digit were 1, the result would be congruent to 0 mod 10; but because the check digit is 2, the sum is not divisible by 10.
		The Luhn algorithm is able to detect single data entry errors and most transpositions.
	illuminations.nctm.org /LessonDetail.aspx?id=L693 (2215 words)

	Online Before the Internet: Early Pioneers Tell Their Stories (Site not responding. Last check: 2007-10-29)
		Luhn, Hans Peter — Worked for IBM from 1941 until his retirement in 1961.
		SDI was invented, or developed, by Hans Peter Luhn, in 1960 or so.
		Luhn was at IBM, and he was doing SDIs within IBM; I think they were on their internal literature and maybe some journal articles.
	www.infotoday.com /searcher/jun03/ardito_bjorner.shtml (7153 words)

	Brief company profile - Hans Peter Luhn GmbH
		Hans-Peter Luhn GmbH deals in fresh as well as in deep frozen vegetables for the processing foodstuff industry.
		Within the scope of this contract farming Hans-Peter Luhn GmbH concludes field-by-field planting contracts with selected farmers in Northern Germany, Denmark, Poland and Belgium.
		Hans-Peter Luhn GmbH provides the farmers with seed and plants and also with sowing machines, if required.
	www.luhn-gmbh.de /englisch/about_us (353 words)

	Hans peter still (Site not responding. Last check: 2007-10-29)
		in Peter while private plug-in still a for take little will script a that until Note...
		Senior ID no is are living world I in Brondmo My with and a Vice am check Peter is where...
		July 1, Hans Barmen, still born still machine being the in was Peter in that...
	4679.6lez56.info (507 words)

	Reference.com/Encyclopedia/Luhn algorithm (Site not responding. Last check: 2007-10-29)
		The following is an algorithm to generate a number that passes the Luhn Algorithm.
		Other, more complex check digit algorithms (such as the Verhoeff algorithm) can detect more transcription errors.
		The Luhn mod N Algorithm is an extension that supports non-numerics strings.
	www.reference.com /browse/wiki/Luhn_algorithm (751 words)

	Credit Card Verifier - CDYNE Wiki for Web Services
		C# version of the Credit Card Verifier using the Luhn Formula.
		Much of its notoriety comes from credit card companies' adoption of it shortly after its creation in the late 1960s by IBM scientist Hans Peter Luhn (1896–1964).
		Explanation of the Luhn's algorithm can be found here.
	wiki.cdyne.com /index.php/Credit_Card_Verifier (354 words)

	Techworld.com - Briefings - Making a hash of file content
		What he wanted was a function that would deliberately abuse keys producing practically the equivalent of the mathematical concept of uniformly distributed random variables.[bashe86] The uniform distribution of hashes would cut down search time.
		John Smith, because there are many names that begin with S. A clean hash function, when given a series of keys, gives back a reasonable approximation of a uniform random distribution of hashes.
		(This is the problem Luhn, the IBM researcher, was focussed on.) This means that all bins will probably be about the same size, so that, on the average, searching will take about the same amount of time to find a record, any record, in any bin.
	www.techworld.com /features/index.cfm?fuseaction=displayfeature&featureID=235 (1766 words)

	Gaetano Caruana’s Blog » Blog Archive » Credit Card Validation
		In order to explain the Luhn function, I am going to use my credit card number as an example algorithm:
		I have included a Haskell implementation of Luhn function.
		The first luhn function has a redundant otherwise clause, this is a shorter way of stating it:
	www.gaetanocaruana.com /2006/09/25/credit-card-validation (478 words)

	MD5z.com :: Encryption and Security Digest
		It is based on the use of hashing to compare strings.
		The term "hash" apparently comes by way of analogy with its standard meaning in the physical world, to "chop and mix." Knuth notes that Hans Peter Luhn of IBM appears to have been the first to use the concept, in a memo dated January 1953; the term hash came into use some ten years later.
		In the SHA-1 algorithm, for example, the domain is "flattened" and "chopped" into "words" which are then "mixed" with one another using carefully chosen mathematical functions.
	www.md5z.com (1334 words)

	Reminder: Linguistics colloquium today (Site not responding. Last check: 2007-10-29)
		In the paragraph-based approach, sentences in the beginning of paragraphs received higher importance ratings than other sentences.
		The word-based approaches determined sentence rankings based on relative word frequencies (Luhn 1958; Salton and Buckley 1988).
		Coherence-based approaches determined sentence rankings based on some property of the coherence structure of a text (Marcu 2000; Page et al.
	crl.ucsd.edu /pipermail/pdpnlp/2004/000067.html (394 words)

	digg - Credit Card Validation - Luhn Function
		Luhn function (invented by Hans Peter Luhn) is a very simple validation function.
		In the context of a Luhn check, a card number is either entirely valid or entirely invalid isn't it?
		Thanks for the time killer; I just wrote a matlab function to check credit card numbers.
	digg.com /programming/Credit_Card_Validation_Luhn_Function (370 words)

	What's New - October, 2003
		All major cards use the same algorithm as described in the ANSI standard that governs credit cards: ANSI X4.13, "American National Standard for Financial Services - Financial Transaction Cards".
		The algorithm was developed by Hans Peter Luhn, one of the early pioneers developing techniques for making computers useful.
		He was granted the check digit patent in 1960, at age 64.
	www.delphiforfun.com /whatsnew/WhatsNew_Oct2003.htm (438 words)

	[No title]
		Information can be sought for various reasons and with various ideas of how to determine what doc uments are relevant.
		\par }\pard \qj\widctlpar {\fs20 (Belkin, 1993b; Luhn, 1957).
		\par \par }\pard \qj\widctlpar {\fs20 Hans Peter Luhn.
	www.ercim.org /publication/ws-proceedings/DELOS1/hansen.rtf (1117 words)

	Quality guaranty - Ökohof Gemüsehandel GmbH
		High quality and reliability are prerequisites for being convincing in competition, keeping up and extending the good reputation and success of Hans-Peter Luhn GmbH and with that, contributing to safeguarding and creation of jobs and making provisions for future needs of the company.
		This is the statement concerning the quality policy of Hans-Peter Luhn GmbH as specified in their Manual for Quality Management and according to which their aims are defined.
		Here are some of the measures taken to ensure high quality:
	www.oekohof-gmbh.de /english/quality/sicherung.htm (204 words)

	Amazon.com: Self-demarcating code words;: A set of three and four letter code words with serially-unique and ... (Site not responding. Last check: 2007-10-29)
		Amazon.com: Self-demarcating code words;: A set of three and four letter code words with serially-unique and disjunctive combination forming characteristics [by] Hans Peter Luhn: Books: H. P Luhn
		This item is not eligible for Amazon Prime, but over a million other items are.
		Self-demarcating code words;: A set of three and four letter code words with serially-unique and disjunctive combination forming characteristics [by] Hans Peter Luhn (Unknown Binding)
	www.amazon.com /Self-demarcating-code-words-serially-unique-characteristics/dp/B0007EVZDA (656 words)

	Information Retrieval - GSLISWiki
		Late 1940's: US military confronts problems of indexing and retrieval of wartime scientific research documents captured from Germans.
		1947: Hans Peter Luhn (research engineer at IBM since 1941) begins work on mechanized, punch card based system for searching chemical compounds.
		1959:Hans Peter Luhn publishes Ã¢Â€ÂœAuto-encoding of documents for information retrieval.Ã¢Â€Â (more on Luhn)
	www.gslis.org /index.php?title=Information_Retrieval (799 words)

Try your search on: Qwika (all wikis)