|
Selmer M. Johnson
Selmer Martin Johnson (21 May 1916 – 26 June 1996) was an American mathematician, a researcher at the RAND Corporation. Biography Johnson was born on May 21, 1916, in Buhl, Minnesota. He earned a B.A. and then an M.A. in mathematics from the University of Minnesota in 1938 and 1940 respectively. World War II interrupted Johnson's mathematical studies: he enlisted in the United States Air Force, earning the rank of major. While serving, he also earned an M.S. in meteorology from New York University in 1942. After the war, Johnson returned to graduate study in mathematics at the University of Illinois at Urbana–Champaign, finishing his doctorate in 1950; his dissertation, on the subject of number theory, was supervised by David Bourgin, a student of George David Birkhoff.Contributors, ''IRE Transactions on Information Theory'', April 1962, p. 261. This section may be seen attached to ; Johnson's paper, "A new upper bound for error-correcting codes", appears earlier in the same ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
FamilySearch
FamilySearch is a nonprofit organization and website offering genealogical records, education, and software. It is operated by the Church of Jesus Christ of Latter-day Saints and is part of the Church's Family History Department (FHD). The Family History Department was originally established in 1894, as the Genealogical Society of Utah (GSU); it is the largest genealogy organization in the world. FamilySearch maintains a collection of records, resources, and services designed to help people learn more about their family history. Facilitating the performance of Latter-day Saint ordinances for deceased relatives is another major aim of the organization. Although it requires user account registration, it offers free access to its resources and service online at FamilySearch.org. In addition, FamilySearch offers personal assistance at more than 6,400 FamilySearch centers in 140 countries, including the FamilySearch Library in Salt Lake City, Utah. The Family Tree section allows u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ford–Johnson Algorithm
In computer science, merge-insertion sort or the Ford–Johnson algorithm is a comparison sorting algorithm published in 1959 by L. R. Ford Jr. and Selmer M. Johnson. It uses fewer comparisons in the worst case than the best previously known algorithms, binary insertion sort and merge sort, and for 20 years it was the sorting algorithm with the fewest known comparisons. Although not of practical significance, it remains of theoretical interest in connection with the problem of sorting with a minimum number of comparisons. The same algorithm may have also been independently discovered by Stanisław Trybuła and Czen Ping. Algorithm Merge-insertion sort performs the following steps, on an input X of n elements: #Group the elements of X into \lfloor n/2\rfloor pairs of elements, arbitrarily, leaving one element unpaired if there is an odd number of elements. #Perform \lfloor n/2\rfloor comparisons, one per pair, to determine the larger of the two elements in each pair. #Recursively ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Illinois Urbana-Champaign Alumni
A university () is an institution of tertiary education and research which awards academic degrees in several academic disciplines. ''University'' is derived from the Latin phrase , which roughly means "community of teachers and scholars". Universities typically offer both undergraduate and postgraduate programs. The first universities in Europe were established by Catholic monks. The University of Bologna (), Italy, which was founded in 1088, is the first university in the sense of: *being a high degree-awarding institute. *using the word (which was coined at its foundation). *having independence from the ecclesiastic schools and issuing secular as well as non-secular degrees (with teaching conducted by both clergy and non-clergy): grammar, rhetoric, logic, theology, canon law and notarial law.Hunt Janin: "The university in medieval life, 1179–1499", McFarland, 2008, , p. 55f.de Ridder-Symoens, Hilde''A History of the University in Europe: Volume 1, Universities in the Midd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
New York University Alumni
New or NEW may refer to: Music * New, singer of K-pop group The Boyz * ''New'' (album), by Paul McCartney, 2013 ** "New" (Paul McCartney song), 2013 * ''New'' (EP), by Regurgitator, 1995 * "New" (Daya song), 2017 * "New" (No Doubt song), 1999 * "new", a song by Loona from the 2017 single album '' Yves'' * "The New", a song by Interpol from the 2002 album '' Turn On the Bright Lights'' Transportation * Lakefront Airport, New Orleans, U.S., IATA airport code NEW * Newcraighall railway station, Scotland, station code NEW Other uses * ''New'' (film), a 2004 Tamil movie * New (surname), an English family name * NEW (TV station), in Australia * new and delete (C++), in the computer programming language * Net economic welfare, a proposed macroeconomic indicator * Net explosive weight, also known as net explosive quantity * Network of enlightened Women, an American organization * Newar language, ISO 639-2/3 language code new * Next Entertainment World, a South Korean media c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Minnesota College Of Liberal Arts Alumni
A university () is an institution of tertiary education and research which awards academic degrees in several academic disciplines. ''University'' is derived from the Latin phrase , which roughly means "community of teachers and scholars". Universities typically offer both undergraduate and postgraduate programs. The first universities in Europe were established by Catholic monks. The University of Bologna (), Italy, which was founded in 1088, is the first university in the sense of: *being a high degree-awarding institute. *using the word (which was coined at its foundation). *having independence from the ecclesiastic schools and issuing secular as well as non-secular degrees (with teaching conducted by both clergy and non-clergy): grammar, rhetoric, logic, theology, canon law and notarial law.Hunt Janin: "The university in medieval life, 1179–1499", McFarland, 2008, , p. 55f.de Ridder-Symoens, Hilde''A History of the University in Europe: Volume 1, Universities in the Midd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1996 Deaths
This is a list of lists of deaths of notable people, organized by year. New deaths articles are added to their respective month (e.g., Deaths in ) and then linked below. 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 Earlier years ''Deaths in years earlier than this can usually be found in the main articles of the years.'' See also * Lists of deaths by day * Deaths by year (category) {{DEFAULTSORT:deaths by year ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1916 Births
Events Below, the events of the First World War have the "WWI" prefix. January * January 1 – The British Empire, British Royal Army Medical Corps carries out the first successful blood transfusion, using blood that has been stored and cooled. * January 9 – WWI: Gallipoli Campaign – The last British troops are evacuated from Gallipoli, as the Ottoman Empire prevails over a joint British and French operation to capture Constantinople. * January 10 – WWI: Erzurum Offensive – Russia defeats the Ottoman Empire. * January 12 – The Gilbert and Ellice Islands Colony, part of the British Empire, is established in modern-day Tuvalu and Kiribati. * January 13 – WWI: Battle of Wadi (1916), Battle of Wadi – Ottoman Empire forces defeat the British, during the Mesopotamian campaign in modern-day Iraq. * January 29 – WWI: Paris is bombed by German Empire, German zeppelins. * January 31 – WWI: An attack is planned on Verdun, France. Febru ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Johnson's Rule
In operations research, Johnson's rule is a method of scheduling jobs in two work centers. Its primary objective is to find an optimal sequence of jobs to reduce makespan (the total amount of time it takes to complete all jobs). It also reduces the amount of idle time between the two work centers. The method minimizes the makespan in the case of two work centers. Furthermore, the method finds the shortest makespan in the case of three work centers if additional constraints are met. Algorithm The technique requires several preconditions: * The time for each job must be invariant with respect to when it is done. * Job times must be independent of the job sequence. * All jobs must be processed in the first work center before going through the second work center. * All jobs are equally prioritised. Johnson's rule is as follows: # List the jobs and their times at each work center. # Select the job with the shortest activity time. If that activity time is for the first work center, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Johnson Counter
A ring counter is a type of counter composed of flip-flops connected into a shift register, with the output of the last flip-flop fed to the input of the first, making a "circular" or "ring" structure. There are two types of ring counters: * A straight ring counter, also known as a one-hot counter, connects the output of the last shift register to the first shift register input and circulates a single one (or zero) bit around the ring. * A twisted ring counter, also called switch-tail ring counter, walking ring counter, Johnson counter, or Möbius counter, connects the complement of the output of the last shift register to the input of the first register and circulates a stream of ones followed by zeros around the ring. Four-bit ring-counter sequences Properties Ring counters are often used in hardware design (e.g. ASIC and FPGA design) to create finite-state machines. A binary counter would require an adder circuit which is substantially more complex than a ring coun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Johnson Bound
In applied mathematics, the Johnson bound (named after Selmer Martin Johnson) is a limit on the size of error-correcting codes, as used in coding theory for data transmission or communications. Definition Let C be a ''q''-ary code of length n, i.e. a subset of \mathbb_q^n. Let d be the minimum distance of C, i.e. :d = \min_ d(x,y), where d(x,y) is the Hamming distance between x and y. Let C_q(n,d) be the set of all ''q''-ary codes with length n and minimum distance d and let C_q(n,d,w) denote the set of codes in C_q(n,d) such that every element has exactly w nonzero entries. Denote by , C, the number of elements in C. Then, we define A_q(n,d) to be the largest size of a code with length n and minimum distance d: : A_q(n,d) = \max_ , C, . Similarly, we define A_q(n,d,w) to be the largest size of a code in C_q(n,d,w): : A_q(n,d,w) = \max_ , C, . Theorem 1 (Johnson bound for A_q(n,d)): If d=2t+1, : A_q(n,d) \leq \frac. If d=2t+2, : A_q(n,d) \leq \frac. Theorem 2 (Joh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Steinhaus–Johnson–Trotter Algorithm
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M. Johnson and Hale F. Trotter that generates all of the permutations of n elements. Each two adjacent permutations in the resulting sequence differ by swapping two adjacent permuted elements. Equivalently, this algorithm finds a Hamiltonian cycle in the permutohedron, a polytope whose vertices represent permutations and whose edges represent swaps. This method was known already to 17th-century English Change ringing, change ringers, and Robert Sedgewick (computer scientist), Robert Sedgewick calls it "perhaps the most prominent permutation enumeration algorithm". A version of the algorithm can be implemented in such a way that the average time per permutation is constant. As well as being simple and computationally efficient, this algorithm has the advantage that subsequent computations on the generated permutations may be s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
