id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_5516_chunk_2
|
Transversal (combinatorics)
|
In computer science, computing transversals is useful in several application domains, with the input family of sets often being described as a hypergraph. Existence and number A fundamental question in the study of SDR is whether or not an SDR exists. Hall's marriage theorem gives necessary and sufficient conditions for a finite collection of sets, some possibly overlapping, to have a transversal. The condition is that, for every integer k, every collection of k sets must contain in common at least k different elements. The following refinement by H. J. Ryser gives lower bounds on the number of such SDRs.
|
wikipedia
|
wiki_30349_chunk_15
|
Global Energy and Water Exchanges
|
Critique
One critique of the Build-up Phase data and predictions is that there needs to be better error descriptions. The global estimate of rainfall indicates that the confidence range is large relative to possible trends. The number of ground sensing stations (currently around 40) in the BSRN is rather limited for global observation this affected the measurement of aerosols which are regionally dominant. The best measurements of aerosol pollution are obtained when cloud types are identified properly by satellite observation, therefore better cloud sensing strategies and models are needed to provide the clearest real-time data. Certain projects like GCIP allow have focused on continental scale observations provide better prediction for project areas; however, areas outside these project areas may lag in receiving forecasting improvements. Many of the deficiencies in Phase I are improvement areas within the objectives of Phase II of the project. Currently scientist use NASA Aqua's Advanced Microwave Scanning Radiometer (AMSR-E) to evaluation soil moisture from space. However, except for focused observations the satellites data is not useful for global weather prediction. The proposed Soil Moisture and Ocean Salinity satellite would provide the detail of soil moisture information on a daily basis may provide the data needed for real time forecasting.
|
wikipedia
|
wiki_32762_chunk_10
|
FACT (computer language)
|
Report layouts:
L 1 PAGE-HEADING BATCH NO. ^ IN ERROR PAGE ^
L 2 COLUMN-HEADING EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS EMP.NO. HOURS
L 3 ERROR-LINE ^ .^ ^ .^ ^ .^ ^ .^ ^ .^ ^ .^ ^ .^ ^ .^
L 4 BOND-HEADING BOND ORDERS EMP. NO. NAME DATE BOND PAGE ^
L 5 BONDORDER-LINE ^ ^ ^- ^- ^ . ^
L 6 DEL-HEADING TERMINATIONS EMP. NO. DATE NAME BOND CR. TOTALS.. GROSS TAX FICA INSUR RET PAGE ^
L 7 DELETIONS-LINE ^ ^- ^- ^ ^ . ^ . ^ . ^ . ^ . ^ . ^
L 8 ERROR-HEADING ERRORS... EMP. NO. DATE TYPE PAGE ^
L 9 ERROR-LINE ^ ^- ^- ^ ^
L 10 TITLE-LINE PLACE CHECK FORM IN PRINTER
L 12 1PAYLINE ^ ^/ ^/ ^ .^ ^/ ^/ ^
L 13 2PAYLINE . ^ . ^ . ^ .^ . ^
L 14 3PAYLINE ^ $****. ^ . ^ . ^
|
wikipedia
|
wiki_11990_chunk_9
|
Anonymous recursion
|
In the lambda calculus, which only uses functions of a single variable, this can be done via the Y combinator. First make the higher-order function of two variables be a function of a single variable, which directly returns a function, by currying:
fact1 = lambda f: (lambda n1: 1 if n1 == 0 else n1 * f(f)(n1 - 1))
fact = fact1(fact1)
There are two "applying a higher order function to itself" operations here: f(f) in the first line and fact1(fact1) in the second. Factoring out the second double application into a combinator'' yields:
C = lambda x: x(x)
fact1 = lambda f: (lambda n1: 1 if n1 == 0 else n1 * f(f)(n1 - 1))
fact = C(fact1)
Factoring out the other double application yields:
C = lambda x: x(x)
D = lambda f: (lambda x: f(lambda v: x(x)(v)))
fact1 = lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1))
fact = C(D(fact1))
Combining the two combinators into one yields the Y combinator:
C = lambda x: x(x)
D = lambda f: (lambda x: f(lambda v: x(x)(v)))
Y = lambda y: C(D(y))
fact1 = lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1))
fact = Y(fact1)
Expanding out the Y combinator yields:
Y = lambda f: (lambda x: f(lambda v: x(x)(v))) \
(lambda x: f(lambda v: x(x)(v)))
fact1 = lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1))
fact = Y(fact1)
Combining these yields a recursive definition of the factorial in lambda calculus (anonymous functions of a single variable):
(lambda f: (lambda x: f(lambda v: x(x)(v)))
(lambda x: f(lambda v: x(x)(v)))) \
(lambda g: (lambda n1: 1 if n1 == 0 else n1 * g(n1 - 1)))
|
wikipedia
|
wiki_30746_chunk_1
|
International Paderborn Computer Chess Championship
|
Champions
{| class="sortable wikitable"
! # !! Year !! Program !! Champion
|-
| 1||1991||Zugzwang||Rainer Feldmann, Peter Mysliwietz, Heiner Matthias
|-
| 2||1992||Zugzwang||Rainer Feldmann, Peter Mysliwietz, Heiner Matthias
|-
| 3||1993||Bobby||Hans-Joachim Kraas, Günther Schrüfer
|-
| 4||1994||Schach 3.0||Matthias Engelbach, Thomas Kreitmair
|-
| 5||1995||MChess Pro 5.0||Martin Hirsch
|-
| 6||1997||Zugzwang||Rainer Feldmann, Peter Mysliwietz, Heiner Matthias
|-
| 7||1998||Nimzo98||Christian Donninger
|-
| 8||1999||P.ConNerS ||Ulf Lorenz
|-
| 9||2000||Shredder||Stefan Meyer-Kahlen
|-
| 10||2001||Shredder||Stefan Meyer-Kahlen
|-
| 11||2002||Shredder||Stefan Meyer-Kahlen
|-
| 12||2003||Fritz||Frans Morsch, Mathias Feist
|-
| 13||2004||Hydra||Christian Donninger, Alex Kure, Ulf Lorenz
|-
| 14||2005||Hydra||Christian Donninger, Alex Kure, Ulf Lorenz
|-
| 15||2005||Rybka||Vasik Rajlich
|-
| 16||2006||Rybka||Vasik Rajlich
|-
| 17||2007||HIARCS||Mark Uniacke
|}
|
wikipedia
|
wiki_29328_chunk_20
|
JaVale McGee
|
|-
| style="text-align:left;"| 2006–07
| style="text-align:left;"| Nevada
| 33 || 0 || 10.0 || .600 || .667 || .471 || 2.2 || .1 || .2 || .9 || 3.3
|-
| style="text-align:left;"| 2007–08
| style="text-align:left;"| Nevada
| 33 || 31 || 27.3 || .529 || .333 || .525 || 7.3 || .6 || .8 || 2.8 || 14.1
|- class="sortbottom"
| style="text-align:center;" colspan="2"| Career
| 66 || 31 || 18.7 || .542 || .356 || .514 || 4.8 || .3 || .5 || 1.8 || 8.7
|
wikipedia
|
wiki_27222_chunk_3
|
Codex Colombino
|
External links
https://web.archive.org/web/20071219163600/http://www.tula.gob.mx/CONGRESO/CdiceColombino.html (image)
World Digital Library Collection
https://www-oxfordreference-com.ezp-prod1.hul.harvard.edu/view/10.1093/acref/9780195108156.001.0001/acref-9780195108156-e-134?rskey=xRon5X&result=134
|
wikipedia
|
wiki_2841_chunk_72
|
Logicism
|
The unit class, impredicativity, and the vicious circle principle
A benign impredicative definition: Suppose a librarian wants to index her collection into a single book (call it Ι for "index"). Her index will list all the books and their locations in the library. As it turns out, there are only three books, and these have titles Ά, β, and Γ. To form her index I, she goes out and buys a book of 200 blank pages and labels it "I". Now she has four books: I, Ά, β, and Γ. Her task is not difficult. When completed, the contents of her index I are 4 pages, each with a unique title and unique location (each entry abbreviated as Title.LocationT):
I = { I.LI, Ά.LΆ, β.Lβ, Γ.LΓ}.
|
wikipedia
|
wiki_6637_chunk_59
|
FOCAL (programming language)
|
Example code
The original Lunar Lander makes an excellent example for examining FOCAL code, as it uses most of the features of the language. This code is from the original, found on Jim Storer's Lunar Lander page.
01.04 T "CONTROL CALLING LUNAR MODULE. MANUAL CONTROL IS NECESSARY"!
01.06 T "YOU MAY RESET FUEL RATE K EACH 10 SECS TO 0 OR ANY VALUE"!
01.08 T "BETWEEN 8 & 200 LBS/SEC. YOU'VE 16000 LBS FUEL. ESTIMATED"!
01.11 T "FREE FALL IMPACT TIME-120 SECS. CAPSULE WEIGHT-32500 LBS"!
01.20 T "FIRST RADAR CHECK COMING UP"!!!;E
01.30 T "COMMENCE LANDING PROCEDURE"!"TIME,SECS ALTITUDE,"
01.40 T "MILES+FEET VELOCITY,MPH FUEL,LBS FUEL RATE"!
01.50 S A=120;S V=1;S M=32500;S N=16500;S G=.001;S Z=1.8
02.10 T " ",%3,L," ",FITR(A)," ",%4,5280*(A-FITR(A))
02.20 T %6.02," ",3600*V," ",%6.01,M-N," K=";A K;S T=10
02.70 T %7.02;I (200-K)2.72;I (8-K)3.1,3.1;I (K)2.72,3.1
02.72 T "NOT POSSIBLE";F X=1,51;T "."
02.73 T "K=";A K;G 2.7
03.10 I (M-N-.001)4.1;I (T-.001)2.1;S S=T
03.40 I ((N+S*K)-M)3.5,3.5;S S=(M-N)/K
03.50 D 9;I (I)7.1,7.1;I (V)3.8,3.8;I (J)8.1
03.80 D 6;G 3.1
04.10 T "FUEL OUT AT",L," SECS"!
04.40 S S=(FSQT(V*V+2*A*G)-V)/G;S V=V+G*S;S L=L+S
05.10 T "ON THE MOON AT",L," SECS"!;S W=3600*V
05.20 T "IMPACT VELOCITY OF",W,"M.P.H."!,"FUEL LEFT:"M-N," LBS"!
05.40 I (1-W)5.5,5.5:T "PERFECT LANDING !-(LUCKY)"!;G 5.9
05.50 I (10-W)5.6,5.6;T "GOOD LANDING-(COULD BE BETTER)"!;G 5.9
05.60 I (22-W)5.7,5.7;T "CONGRATULATIONS ON A POOR LANDING"!;G 5.9
05.70 I (40-W)5.81,5.81;T "CRAFT DAMAGE. GOOD LUCK"!;G 5.9
05.81 I (60-W)5.82,5.82;T "CRASH LANDING-YOU'VE 5 HRS OXYGEN"!;G 5.9
05.82 T "SORRY,BUT THERE WERE NO SURVIVORS-YOU BLEW IT!"!"IN "
05.83 T "FACT YOU BLASTED A NEW LUNAR CRATER",W*.277777," FT.DEEP.
05.90 T !!!!"TRY AGAIN?"!
05.92 A "(ANS. YES OR NO)"P;I (P-0NO)5.94,5.98
05.94 I (P-0YES)5.92,1.2,5.92
05.98 T "CONTROL OUT"!!!;Q
06.10 S L=L+S;S T=T-S;S M=M-S*K;S A=I;S V=J
07.10 I (S-.005)5.1;S S=2*A/(V+FSQT(V*V+2*A*(G-Z*K/M)))
07.30 D 9;D 6;G 7.1
08.10 S W=(1-M*G/(Z*K))/2;S S=M*V/(Z*K*(W+FSQT(W*W+V/Z)))+.05;D 9
08.30 I (I)7.1,7.1;D 6;I (-J)3.1,3.1;I (V)3.1,3.1,8.1
09.10 S Q=S*K/M;S J=V+G*S+Z*(-Q-Q^2/2-Q^3/3-Q^4/4-Q^5/5)
09.40 S I=A-G*S*S/2-V*S+Z*S*(Q/2+Q^2/6+Q^3/12+Q^4/20+Q^5/30)
|
wikipedia
|
wiki_11908_chunk_5
|
Discriminant of an algebraic number field
|
Examples
Quadratic number fields: let d be a square-free integer, then the discriminant of is
An integer that occurs as the discriminant of a quadratic number field is called a fundamental discriminant.
Cyclotomic fields: let n > 2 be an integer, let ζn be a primitive nth root of unity, and let Kn = Q(ζn) be the nth cyclotomic field. The discriminant of Kn is given by
where is Euler's totient function, and the product in the denominator is over primes p dividing n.
Power bases: In the case where the ring of integers has a power integral basis, that is, can be written as OK = Z[α], the discriminant of K is equal to the discriminant of the minimal polynomial of α. To see this, one can choose the integral basis of OK to be b1 = 1, b2 = α, b3 = α2, ..., bn = αn−1. Then, the matrix in the definition is the Vandermonde matrix associated to αi = σi(α), whose determinant squared is
which is exactly the definition of the discriminant of the minimal polynomial.
Let K = Q(α) be the number field obtained by adjoining a root α of the polynomial x3 − x2 − 2x − 8. This is Richard Dedekind's original example of a number field whose ring of integers does not possess a power basis. An integral basis is given by {1, α, α(α + 1)/2} and the discriminant of K is −503.
Repeated discriminants: the discriminant of a quadratic field uniquely identifies it, but this is not true, in general, for higher-degree number fields. For example, there are two non-isomorphic cubic fields of discriminant 3969. They are obtained by adjoining a root of the polynomial or , respectively.
|
wikipedia
|
wiki_2270_chunk_8
|
History of computing hardware (1960s–present)
|
The first generation had pioneered the use of special facilities for calling subroutines, e.g., TSX on the IBM 709. In the second generation, such facilities were ubiquitous. In the descriptions below, NSI is the next sequential instruction, the return address. Some examples are:
Automatically record the NSI in a register for all or most successful branch instructions
The Jump Address (JA) Register on the Philco TRANSAC S-2000
The Sequence History (SH) and Cosequence History (CSH) registers on the Honeywell 800
The B register on an IBM 1401 with the indexing feature
Automatically record the NSI at a standard memory location following all or most successful branches
Store P (STP) locations on RCA 301 and RCA 501
Call instructions that save the NSI in the first word of the subroutine
Return Jump (RJ) on the UNIVAC 1107
Return Jump (RJ) on CDC 3600 and CDC 6000 series
Call instructions that save the NSI in an implicit or explicit register
Branch and Load Location in Index Word (BLX) on the IBM 7070
Transfer and Set Xn (TSXn) on the GE-600 series
Branch and Link (BAL) on the IBM System/360
Call instructions that use an index register as a stack pointer and push return information onto the stack
Push jump (PUSHJ) on the DEC PDP-6
Implicit call with return information pushed onto the stack
Program descriptors on the Burroughs B5000 line
Program descriptors on the Burroughs B6500 line
|
wikipedia
|
wiki_19211_chunk_1
|
Mathematical discussion of rangekeeping
|
Rangekeeping is an excellent example of the application of analog computing to a real-world mathematical modeling problem. Because nations had so much money invested in their capital ships, they were willing to invest enormous amounts of money in the development of rangekeeping hardware to ensure that the guns of these ships could put their projectiles on target. This article presents an overview of the rangekeeping as a mathematical modeling problem. To make this discussion more concrete, the Ford Mk 1 Rangekeeper is used as the focus of this discussion. The Ford Mk 1 Rangekeeper was first deployed on the in 1916 during World War I. This is a relatively well documented rangekeeper that had a long service life. While an early form of mechanical rangekeeper, it does illustrate all the basic principles. The rangekeepers of other nations used similar algorithms for computing gun angles, but often differed dramatically in their operational use.
|
wikipedia
|
wiki_32894_chunk_1
|
Spectral geometry
|
Inverse problems seek to identify features of the geometry from information about the eigenvalues of the Laplacian. One of the earliest results of this kind was due to Hermann Weyl who used David Hilbert's theory of integral equation in 1911 to show that the volume of a bounded domain in Euclidean space can be determined from the asymptotic behavior of the eigenvalues for the Dirichlet boundary value problem of the Laplace operator. This question is usually expressed as "Can one hear the shape of a drum?", the popular phrase due to Mark Kac. A refinement of Weyl's asymptotic formula obtained by Pleijel and Minakshisundaram produces a series of local spectral invariants involving covariant differentiations of the curvature tensor, which can be used to establish spectral rigidity for a special class of manifolds. However as the example given by John Milnor tells us, the information of eigenvalues is not enough to determine the isometry class of a manifold (see isospectral). A general and systematic method due to Toshikazu Sunada gave rise to a veritable cottage industry of such examples which clarifies the phenomenon of isospectral manifolds.
|
wikipedia
|
wiki_25397_chunk_2
|
Mathematical Contest in Modeling
|
Problems
At the beginning of the contest, teams have a choice between two problems. Problem A involves a system that requires the use of continuous mathematics, and thus often involves concepts from geometry, physics, or engineering. Problem B involves a system that requires the use of discrete mathematics. In 2016, a "data insights" problem was added, where teams are given access to database files and tasked with using them to answer a question. This problem was designated as Problem C, though previously, Problem C referred to an ICM problem. These problems tend to be open-ended, and are drawn from all fields of science, business, and public policy. Past problems include
Estimate the global effects of a large asteroid impacting Antarctica (1999 A)
Study the hunting strategies of velociraptor dinosaurs based on fossil data (1997 A)
Develop a more efficient method of boarding passengers onto large commercial jets (2007 B)
Teams have 96 hours to research and submit their solutions in the form of a research paper. During this time, they may consult any available references, but may not discuss their problem with anyone outside their teams. Several guides containing advice and recommendations for teams and/or advisors have been published online or in print.
|
wikipedia
|
wiki_39905_chunk_4
|
Religious and political symbols in Unicode
|
Dingbats block
The Dingbats block also contains some symbols with political/religious connotations:
{| class="wikitable" style="text-align:center"
|-
! Symbol !! Code point !! Name
|-
| || U+2719 || style="text-align:left" | OUTLINED GREEK CROSS
|-
| || U+271A || style="text-align:left" | HEAVY GREEK CROSS
|-
| || U+271B || style="text-align:left" | OPEN CENTER CROSS
|-
| || U+271C || style="text-align:left" | HEAVY OPEN CENTER CROSS
|-
| || U+271D || style="text-align:left" | LATIN CROSS
|-
| || U+271E || style="text-align:left" | SHADOWED WHITE LATIN CROSS
|-
| || U+271F || style="text-align:left" | OUTLINED LATIN CROSS
|-
| || U+2720 || style="text-align:left" | MALTESE CROSS
|-
| || U+2721 || style="text-align:left" | STAR OF DAVID
|}
|
wikipedia
|
wiki_19713_chunk_1
|
Council for the Mathematical Sciences
|
Purpose
to represent the interests of mathematics to government, Research Councils and other public bodies;
to promote good practice in the mathematics curriculum and its teaching and learning at all levels and in all sectors of education;
to respond coherently and effectively to proposals from government and other public bodies which may affect the mathematical community;
to work with other bodies such as the Joint Mathematical Council and HoDoMS. Structure
It is situated off the A4200 in Russell Square, next to the University of London in the offices of the London Mathematical Society. It is accessed via the Russell Square tube station on the Piccadilly Line. References External links
Web site
|
wikipedia
|
wiki_16607_chunk_7
|
Bruce Woodcock (computer games analyst)
|
References
MMOGCHART.COM(Bruce Woodcock's website)
Biography at Austin Game Conference website
"Network Appliance's Knight of the Message Boards", July 3, 2000 - Profile of Woodcock in Business Week
"Race to build Stormreach" by Hiawatha Bay, The Boston Globe, June 8, 2005
"Can Mickey and Frodo revive virtual worlds?" by John Borland, CNET News.com, May 31, 2005
"Everything You Need to MMO" by Evan Shamoon, Game Developer Magazine, Volume 12 Number 4, April 2005
"Student of the Game" by Daniel Morris, PC Gamer, Issue 12 Number 4, April 2005
"Massively Multiplying Online Games Face Age of Cannibalization" by Steve Smith, Electronic Gaming Business, August 25, 2004
"Multiplayer Online Games: Let in the Cannibals" by Steve Smith, Electronic Gaming Business, April 7, 2004
"Interactive Multi-User Computer Games" by Dr. Richard Bartle, December 1990 (Woodcock is interviewed during his early TinyMUD days.)
|
wikipedia
|
wiki_38771_chunk_5
|
All the Wrong Questions
|
Characters
Lemony Snicket: the narrator and protagonist; a thirteen-year-old apprentice of V.F.D. staying in Stain'd-by-the-Sea.
S. Theodora Markson: Snicket's chaperone in the town; an incompetent member of V.F.D. Known for her unruly hair.
Moxie Mallahan: a child and aspiring journalist living in Stain'd-by-the-Sea after her mother abandoned her.
Ellington Feint: a mysterious girl with green eyes and a love of coffee. She wants the Bombinating Beast so that she can trade it with Hangfire in return for her father, Armstrong.
Dashiell Qwerty: a "sub-sub-librarian" in Stain'd-by-the-Sea. He is known for his wild hair and leather jacket. Dies in book 4.
Pip and Squeak Bellerophon: two children who are temporarily driving a taxi while their father is ill.
Jake Hix: a chef at Hungry's, working for his aunt, and the boyfriend of Cleo Knight.
Cleo Knight: a chemist working on creating invisible ink, and the girlfriend of Jake Hix.
Hangfire: the main antagonist; a mysterious villain in Stain'd-by-the-Sea, who is committing various crimes to try and obtain the Bombinating Beast. His plans involve kidnapping children and small aquatic animals. He started a group called the Inhumane Society and he has the ability to mimic voices.
Stew Mitchum: the son of Harvey and Mimi, Stew is cruel towards Snicket although he always manages to hide this fact from his parents. He also idolizes Hangfire and the Inhumane Society.
Harvey and Mimi Mitchum: the town's police officers, notorious for constantly arguing. They are the attentive parents of Stew.
Prosper Lost: owner of the Lost Arms hotel in Stain'd-by-the-Sea, where Snicket and Theodora stay. Prosper is described as nosey.
Kellar Haines: the son of Sharon and friend of Lemony, and a very fast typist. His goal is to rescue his sister, Lizzie, from Hangfire.
Sharon Haines: the mother of Kellar and Lizzie and associate of Hangfire. She impersonates a Department of Education official to save her daughter Lizzie from Hangfire.
Dame Sally Murphy: an associate of Hangfire and a theatrical legend in Stain'd-by-the-Sea.
Ornette Lost: the young daughter of Prosper who has exceptional origami and fire fighting skills.
Doctor Flammarion and Nurse Dander: associates of Hangfire, employees at the Colophon Clinic and apothecaries to the Knight family.
Kit Snicket: the sister of Lemony who is also a dedicated member of V.F.D. Her mission is to break into a museum. She is arrested alongside Ellington for her crimes.
Lizzie Haines: the daughter of Sharon, sister of Kellar.
Gifford: A member of V.F.D
Ghede: A member of V.F.D
Walleye, Pocket, and Eratosthenes: Librarians Lemony met on the train.
Polly Partial: A grocery store owner in Stain'd-by-the-Sea.
Zada and Zora: Twin maids in book 2.
|
wikipedia
|
wiki_30856_chunk_2
|
Q (programming language from Kx Systems)
|
The following code demonstrates the relationships of the data structures. Expressions to evaluate appear prefixed with the q) prompt, with the output of the evaluation shown beneath: q)`john / an atom of type symbol
`john
q)50 / an atom of type integer
50 q)`john`jack / a list of symbols
`john`jack
q)50 60 / a list of integers
50 60 q)`john`jack!50 60 / a list of symbols and a list of integers combined to form a dictionary
john| 50
jack| 60
|
wikipedia
|
wiki_4547_chunk_19
|
United States of America Mathematical Olympiad
|
2006-2007
Beginning in 2006, the USAMO was expanded to include approximately 500 students (around 430 were actually invited, read below) due to a proposal and sponsorship from the Art of Problem Solving website:
The goal is to select about 500 of the top scorers from this year's AIME and AMC 12A, AMC 12B, AMC 10A and AMC 10B contests to participate in the USAMO.
Selection will be based on the USAMO index which is defined as 10 times the student's AIME score plus the student's score on the AMC 12 or the AMC 10.
The first selection will be the approximately 240 highest USAMO indices of students taking the AMC 12A or AMC 12B contest.
The lowest AIME score among those 240 first selected will determine a floor value. The second selection of approximately 120 USAMO participants will be among students in the 10th grade and below who received an AIME score at least as high as the floor value. If there are more than 120 young students with a score above the floor value, then approximately 120 students will be selected from this group by using the USAMO index.
The student with the highest USAMO index from each state, territory, or U.S. possession not already represented in the selection of the first and second groups will be invited to take the USAMO.
To adjust for variations in contest difficulty, the number of students selected from A & B contests will be proportional to the number of students who took the A & B Contests.
The selection process is designed to favor students who take the more mathematically comprehensive AMC 12A and AMC 12B contests.*
Source: American Mathematics Competitions
|
wikipedia
|
wiki_38440_chunk_6
|
Computer architecture
|
There are other technologies in computer architecture. The following technologies are used in bigger companies like Intel, and were estimated in 2002 to count for 1% of all of computer architecture:
Macroarchitecture: architectural layers more abstract than microarchitecture
Assembly instruction set architecture: A smart assembler may convert an abstract assembly language common to a group of machines into slightly different machine language for different implementations.
Programmer-visible macroarchitecture: higher-level language tools such as compilers may define a consistent interface or contract to programmers using them, abstracting differences between underlying ISA, UISA, and microarchitectures. For example, the C, C++, or Java standards define different programmer-visible macroarchitectures.
|
wikipedia
|
wiki_21913_chunk_3
|
South Asia Theological Research Institute
|
Courses offered
{| class="toccolours" style="float:right; margin-left:1em; font-size:85%; background:#ffc; color:black; width:35em; max-width:40%;" cellspacing="0" cellpadding="0"
|-
! style="background:#ccc;"| Succession of Deans of SATHRI
|-
| style="text-align: left;" |
1989-2000, The Rev. K. C. Abraham, Ph.D. (Princeton),
2000-2009,<ref>Minutes of the 35th Meeting of the Board of Theological Education of Senate of Serampore College held on 3rd and 4th February 2010 at the United Theological College, Bengaluru, Karnataka. - Report of the Director In-Charge, Research and SATHRI, p.6.</ref> The Rev. Samson Prabhakar, Dr. Theol. (Berne),
2009-2011, The Rev. A. Wati Longchar, D.Th. (Serampore),
2011-2014, The Rev. H. Vanlalauva, D.Th. (Serampore),
2014-2018, The Rev. P. G. George, Th.D. (Toronto)
2018-present, The Rev. Limatula Longkumer, D. Th. (Serampore)
|}
|
wikipedia
|
wiki_4937_chunk_9
|
Network theory
|
Link analysis
Link analysis is a subset of network analysis, exploring associations between objects. An example may be examining the addresses of suspects and victims, the telephone numbers they have dialed and financial transactions that they have partaken in during a given timeframe, and the familial relationships between these subjects as a part of police investigation. Link analysis here provides the crucial relationships and associations between very many objects of different types that are not apparent from isolated pieces of information. Computer-assisted or fully automatic computer-based link analysis is increasingly employed by banks and insurance agencies in fraud detection, by telecommunication operators in telecommunication network analysis, by medical sector in epidemiology and pharmacology, in law enforcement investigations, by search engines for relevance rating (and conversely by the spammers for spamdexing and by business owners for search engine optimization), and everywhere else where relationships between many objects have to be analyzed. Links are also derived from similarity of time behavior in both nodes. Examples include climate networks where the links between two locations (nodes) are determined for example, by the similarity of the rainfall or temperature fluctuations in both sites.
|
wikipedia
|
wiki_15293_chunk_1
|
EEVIAC Operational Index and Reference Guide, Including Other Modern Computational Devices
|
Track listing
"Interstellar Hardrive"
"D:Contamination"
"U-235/PU-239"
"Domain of the Human Race"
"Theme from EEVIAC"
"A Reversal of Polarity"
"Fractionalized Reception of a Scrambled Transmission"
"Engines of Difference"
"Psychology of A.I. (Numbers Follow Answers)"
"Krasnoyask-26"
"Within the Mainframe, Impaired Vision from Inoperable Cataracts Can Become a New Impending Nepotism"
"As Estrelas Agora Elas Estão Mortas"
"_/Myopia"
"Automated Liner Notes Sequence" (unlisted)
|
wikipedia
|
wiki_24875_chunk_4
|
Residuated Boolean algebra
|
Examples
Any Boolean algebra, with the monoid multiplication • taken to be conjunction and both residuals taken to be material implication x→y. Of the remaining 15 binary Boolean operations that might be considered in place of conjunction for the monoid multiplication, only five meet the monotonicity requirement, namely 0, 1, x, y, and x∨y. Setting y = z = 0 in the residuation axiom y ≤ x\z ⇔ x•y ≤ z, we have 0 ≤ x\0 ⇔ x•0 ≤ 0, which is falsified by taking x = 1 when x•y = 1, x, or x∨y. The dual argument for z/y rules out x•y = y. This just leaves x•y = 0 (a constant binary operation independent of x and y), which satisfies almost all the axioms when the residuals are both taken to be the constant operation x/y = x\y = 1. The axiom it fails is x•I = x = I•x, for want of a suitable value for I. Hence conjunction is the only binary Boolean operation making the monoid multiplication that of a residuated Boolean algebra.
The power set 2X2 made a Boolean algebra as usual with ∩, ∪ and complement relative to X2, and made a monoid with relational composition. The monoid unit I is the identity relation {(x,x)|x ∈ X}. The right residual R\S is defined by x(R\S)y if and only if for all z in X, zRx implies zSy. Dually the left residual S/R is defined by y(S/R)x if and only if for all z in X, xRz implies ySz.
The power set 2Σ* made a Boolean algebra as for Example 2, but with language concatenation for the monoid. Here the set Σ is used as an alphabet while Σ* denotes the set of all finite (including empty) words over that alphabet. The concatenation LM of languages L and M consists of all words uv such that u ∈ L and v ∈ M. The monoid unit is the language {ε} consisting of just the empty word ε. The right residual M\L consists of all words w over Σ such that Mw ⊆ L. The left residual L/M is the same with wM in place of Mw.
|
wikipedia
|
wiki_956_chunk_45
|
Unification (computer science)
|
A successful example computation path for the unification problem { app(x,app(y,x)) ≐ a.a.nil } is shown below. To avoid variable name clashes, rewrite rules are consistently renamed each time before their use by rule mutate; v2, v3, ... are computer-generated variable names for this purpose. In each line, the chosen equation from G is highlighted in red. Each time the mutate rule is applied, the chosen rewrite rule (1 or 2) is indicated in parentheses. From the last line, the unifying substitution S = { y ↦ nil, x ↦ a.nil } can be obtained. In fact,app(x,app(y,x)) {y↦nil, x↦ a.nil } = app(a.nil,app(nil,a.nil)) ≡ app(a.nil,a.nil) ≡ a.app(nil,a.nil) ≡ a.a.nil solves the given problem.
A second successful computation path, obtainable by choosing "mutate(1), mutate(2), mutate(2), mutate(1)" leads to the substitution S = { y ↦ a.a.nil, x ↦ nil }; it is not shown here. No other path leads to a success.
|
wikipedia
|
wiki_6166_chunk_16
|
Loop unrolling
|
Assembler example (IBM/360 or Z/Architecture)
This example is for IBM/360 or Z/Architecture assemblers and assumes a field of 100 bytes (at offset zero) is to be copied from array FROM to array TO—both having 50 entries with element lengths of 256 bytes each.* The return address is in R14.
* Initialize registers R15, R0, R1, and R2 from data defined at the end of
* the program starting with label INIT/MAXM1.
LM R15,R2,INIT Set R15 = maximum number of MVC
* instructions (MAXM1 = 16),
* R0 = number of entries of array,
* R1 = address of 'FROM' array, and
* R2 = address of 'TO' array.
*
* The loop starts here.
LOOP EQU * Define LOOP label.
* At this point, R15 will always contain the number 16 (MAXM1).
SR R15,R0 Subtract the remaining number of
* entries in the array (R0) from R15.
BNP ALL If R15 is not positive, meaning we
* have more than 16 remaining entries
* in the array, jump to do the entire
* MVC sequence and then repeat.
*
* Calculate an offset (from start of MVC sequence) for unconditional branch to
* the 'unwound' MVC loop below.
* If the number of remaining entries in the arrays is zero, R15 will be 16, so
* all the MVC instructions will be bypassed.
MH R15,=AL2(ILEN) Multiply R15 by the length of one
* MVC instruction.
B ALL(R15) Jump to ALL+R15, the address of the
* calculated specific MVC instruction
* with drop through to the rest of them.
*
* MVC instruction 'table'.
* First entry has maximum allowable offset with single register = hexadecimal F00
* (15*256) in this example.
* All 16 of the following MVC ('move character') instructions use base-plus-offset
* addressing and each to/from offset decreases by the length of one array element
* (256). This avoids pointer arithmetic being required for each element up to a
* maximum permissible offset within the instruction of hexadecimal FFF
* (15*256+255). The instructions are in order of decreasing offset, so the last
* element in the set is moved first.
ALL MVC 15*256(100,R2),15*256(R1) Move 100 bytes of 16th entry from
* array 1 to array 2 (with
* drop-through).
ILEN EQU *-ALL Set ILEN to the length of the previous
* MVC instruction.
MVC 14*256(100,R2),14*256(R1) Move 100 bytes of 15th entry.
MVC 13*256(100,R2),13*256(R1) Move 100 bytes of 14th entry.
MVC 12*256(100,R2),12*256(R1) Move 100 bytes of 13th entry.
MVC 11*256(100,R2),11*256(R1) Move 100 bytes of 12th entry.
MVC 10*256(100,R2),10*256(R1) Move 100 bytes of 11th entry.
MVC 09*256(100,R2),09*256(R1) Move 100 bytes of 10th entry.
MVC 08*256(100,R2),08*256(R1) Move 100 bytes of 9th entry.
MVC 07*256(100,R2),07*256(R1) Move 100 bytes of 8th entry.
MVC 06*256(100,R2),06*256(R1) Move 100 bytes of 7th entry.
MVC 05*256(100,R2),05*256(R1) Move 100 bytes of 6th entry.
MVC 04*256(100,R2),04*256(R1) Move 100 bytes of 5th entry.
MVC 03*256(100,R2),03*256(R1) Move 100 bytes of 4th entry.
MVC 02*256(100,R2),02*256(R1) Move 100 bytes of 3rd entry.
MVC 01*256(100,R2),01*256(R1) Move 100 bytes of 2nd entry.
MVC 00*256(100,R2),00*256(R1) Move 100 bytes of 1st entry.
*
S R0,MAXM1 Reduce the number of remaining entries
* to process.
BNPR R14 If no more entries to process, return
* to address in R14.
AH R1,=AL2(16*256) Increment 'FROM' array pointer beyond
* first set.
AH R2,=AL2(16*256) Increment 'TO' array pointer beyond
* first set.
L R15,MAXM1 Reload the maximum number of MVC
* instructions per batch into R15
* (destroyed by the calculation in the
* first instruction of the loop).
B LOOP Execute loop again.
*
* Static constants and variables (these could be passed as parameters, except
* MAXM1).
INIT DS 0A 4 addresses (pointers) to be
* pre-loaded with the 'LM' instruction
* in the beginning of the program.
MAXM1 DC A(16) Maximum number of MVC instructions
* executed per batch.
N DC A(50) Number of actual entries in array (a
* variable, set elsewhere).
DC A(FROM) Address of start of array 1
* ("pointer").
DC A(TO) Address of start of array 2
* ("pointer").
*
* Static arrays (these could be dynamically acquired).
FROM DS 50CL256 Array of 50 entries of 256 bytes each.
TO DS 50CL256 Array of 50 entries of 256 bytes each.
|
wikipedia
|
wiki_20689_chunk_4
|
CSA (database company)
|
Civil Engineering Abstracts
CSA/ASCE Civil Engineering Abstracts encompasses global, indexing, and abstracting coverage of civil engineering technical literature. Coverage also includes the complementary fields of forensic engineering, engineering services management, engineering services marketing, engineering education, theoretical mechanics, theoretical dynamics, and computational studies. Serial and non-serial publications are part of this database. More than 3,000 abstracted titles encompass, books, conference proceedings, trade journal, scientific journals, technical journals, patents, government reports, dissertations, monographs newsletters, and press releases. Indexing with a controlled vocabulary (12,500 terms) also references items such as cited references, corresponding author's e-mail address, and publisher contact information. With a file size of 1,372,711 records (July 2010), an update frequency of once per month, about 40,000 records are added each year, and temporal coverage is from 1966 to present day.
|
wikipedia
|
wiki_2991_chunk_16
|
Kahan summation algorithm
|
Further enhancements
Neumaier introduced an improved version of Kahan algorithm, which he calls an "improved Kahan–Babuška algorithm", which also covers the case when the next term to be added is larger in absolute value than the running sum, effectively swapping the role of what is large and what is small. In pseudocode, the algorithm is:
function KahanBabushkaNeumaierSum(input)
var sum = 0.0
var c = 0.0 // A running compensation for lost low-order bits.
for i = 1 to input.length do
var t = sum + input[i]
if |sum| >= |input[i]| then
c += (sum - t) + input[i] // If sum is bigger, low-order digits of input[i] are lost.
else
c += (input[i] - t) + sum // Else low-order digits of sum are lost.
endif
sum = t
next i
return sum + c // Correction only applied once in the very end.
|
wikipedia
|
wiki_6608_chunk_6
|
Gauss–Newton algorithm
|
In a biology experiment studying the relation between substrate concentration and reaction rate in an enzyme-mediated reaction, the data in the following table were obtained.
{|class="wikitable" style="text-align: center;"
!
| 1 || 2 || 3 || 4 || 5 || 6 || 7
|-
!
| 0.038 || 0.194 || 0.425 || 0.626 || 1.253 || 2.500 || 3.740
|-
! Rate
| 0.050 || 0.127 || 0.094 || 0.2122 || 0.2729 || 0.2665 || 0.3317
|}
|
wikipedia
|
wiki_23074_chunk_13
|
New York Number Theory Seminar
|
The third edition was published in 1985. The work undergone during the seminars has recognised the support of the NSF and the U.S. Air Force on the introduction page of the edition. They also acknowledge the help of the Computer Algebra Group of the T.J. Watson Research Center who contributed with extended research and provided knowledge on certain topics. This edition holds the lectures notes of the remaining seminars of 1984 (those which have not already been published in the previous edition) and part of 1985. There is a total of 16 articles in this edition with P. Erdos having contributed to 2 of them (Problems and Results on Minimal Bases in Additive Number Theory and On the Number of False Witnesses for a Composite Number).
|
wikipedia
|
wiki_26493_chunk_177
|
Comparison of programming languages (associative array)
|
- exception NotFound;
exception NotFound
- val m : (string, string) HashTable.hash_table = HashTable.mkTable (HashString.hashString, op=) (3, NotFound);
val m =
HT
{eq_pred=fn,hash_fn=fn,n_items=ref 0,not_found=NotFound(-),
table=ref [|NIL,NIL,NIL,NIL,NIL,NIL,NIL,NIL,NIL,NIL,NIL,NIL,...|]}
: (string,string) HashTable.hash_table
- HashTable.insert m ("Sally Smart", "555-9999");
val it = () : unit
- HashTable.insert m ("John Doe", "555-1212");
val it = () : unit
- HashTable.insert m ("J. Random Hacker", "553-1337");
val it = () : unit
HashTable.find m "John Doe"; (* returns NONE if not found *)
val it = SOME "555-1212" : string option
- HashTable.lookup m "John Doe"; (* raises the exception if not found *)
val it = "555-1212" : string
|
wikipedia
|
wiki_16032_chunk_7
|
Tacit programming
|
A few programs have been written to automatically convert a Haskell expression to a point-free form. APL family
In J, the same sort of point-free code occurs in a function made to compute the average of a list (array) of numbers:
avg=: +/ % #
+/ sums the items of the array by mapping (/) summation (+) to the array. % divides the sum by the number of elements (#) in the array. Euler's formula expressed tacitly:
|
wikipedia
|
wiki_4359_chunk_19
|
Dead zone (ecology)
|
"Eutrophication poses a threat to the environment, the economy (e.g. impact on shellfish production, fishing, tourism), but also to human health (Von Blottnitz et al., 2006; Sutton et al., 2011). Attempts to evaluate the monetary impacts of eutrophication have been made over the last two decades, mainly in the United States and in the Baltic Sea (Dodds et al., 2009; Gren et al., 1997). These studies indicate a variety of impacts and costs which are quantifiable fairly directly, for instance when cities of hundreds of thousands of people are deprived of drinking water for several days. One example is the toxic algal bloom in the western Lake Erie basin in 2014, which led to disruption of water supplies to 400,000 people (Smith et al., 2015) On the other hand, integrating all the environmental, health and socio-economic impacts in the calculations of indirect effects, poses more of a challenge (Folke et al., 1994; Romstad, 2014)."
|
wikipedia
|
wiki_942_chunk_5
|
CYK algorithm
|
Probabilistic CYK (for finding the most probable parse)
Allows to recover the most probable parse given the probabilities of all productions.
let the input be a string I consisting of n characters: a1 ... an.
let the grammar contain r nonterminal symbols R1 ... Rr, with start symbol R1.
let P[n,n,r] be an array of real numbers. Initialize all elements of P to zero.
let back[n,n,r] be an array of backpointing triples.
for each s = 1 to n
for each unit production Rv →as
set P[1,s,v] = Pr(Rv →as)
for each l = 2 to n -- Length of span
for each s = 1 to n-l+1 -- Start of span
for each p = 1 to l-1 -- Partition of span
for each production Ra → Rb Rc
prob_splitting = Pr(Ra →Rb Rc) * P[p,s,b] * P[l-p,s+p,c]
if P[p,s,b] > 0 and P[l-p,s+p,c] > 0 and P[l,s,a] < prob_splitting then
set P[l,s,a] = prob_splitting
set back[l,s,a] = <p,b,c>
|
wikipedia
|
wiki_36916_chunk_13
|
Blossom algorithm
|
INPUT: Graph G, matching M on G
OUTPUT: augmenting path P in G or empty path if none found
B01 function find_augmenting_path(G, M) : P
B02 F ← empty forest
B03 unmark all vertices and edges in G, mark all edges of M
B05 for each exposed vertex v do
B06 create a singleton tree { v } and add the tree to F
B07 end for
B08 while there is an unmarked vertex v in F with distance(v, root(v)) even do
B09 while there exists an unmarked edge e = { v, w } do
B10 if w is not in F then
// w is matched, so add e and ws matched edge to F
B11 x ← vertex matched to w in M
B12 add edges { v, w } and { w, x } to the tree of v
B13 else B14 if distance(w, root(w)) is odd then // Do nothing.
B15 else B16 if root(v) ≠ root(w) then // Report an augmenting path in F { e }.
B17 P ← path (root(v) → ... → v) → (w → ... → root(w))
B18 return P
B19 else // Contract a blossom in G and look for the path in the contracted graph.
B20 B ← blossom formed by e and edges on the path v → w in T
B21 G’, M’ ← contract G and M by B
B22 P’ ← find_augmenting_path(G’, M’)
B23 P ← lift P’ to G
B24 return P
B25 end if B26 end if B27 end if B28 mark edge e
B29 end while B30 mark vertex v
B31 end while B32 return empty path
B33 end functionExamples
The following four figures illustrate the execution of the algorithm. Dashed lines indicate edges that are currently not present in the forest. First, the algorithm processes an out-of-forest edge that causes the expansion of the current forest (lines B10 – B12).
|
wikipedia
|
wiki_907_chunk_13
|
Geostatistics
|
GeoENVia promotes the use of geostatistical methods in environmental applications, and organizes bi-annual conferences.
, a resource on the internet about geostatistics and spatial statistics
On-Line Library that chronicles Matheron's journey from classical statistics to the new science of geostatistics
https://web.archive.org/web/20040326205028/http://geostatscam.com/ Is the site of Jan W. Merks, who claims that geostatistics is "voodoo science" and a "scientific fraud"
It is a group for exchanging of ideas and discussion on multiple point geostatistics (MPS).
|
wikipedia
|
wiki_1527_chunk_38
|
Generating function
|
using the Riemann zeta function. The sequence ak generated by a Dirichlet series generating function (DGF) corresponding to: where is the Riemann zeta function, has the ordinary generating function: Multivariate generating functions
Multivariate generating functions arise in practice when calculating the number of contingency tables of non-negative integers with specified row and column totals. Suppose the table has r rows and c columns; the row sums are and the column sums are . Then, according to I. J. Good, the number of such tables is the coefficient of in
|
wikipedia
|
wiki_3229_chunk_19
|
Integer programming
|
In the special case of 0-1 ILP, Lenstra's algorithm is equivalent to complete enumeration: the number of all possible solutions is fixed (2n), and checking the feasibility of each solution can be done in time poly(m, log V). In the general case, where each variable can be an arbitrary integer, complete enumeration is impossible. Here, Lenstra's algorithm uses ideas from Geometry of numbers. It transforms the original problem into an equivalent one with the following property: either the existence of a solution is obvious, or the value of (the n-th variable) belongs to an interval whose length is bounded by a function of n. In the latter case, the problem is reduced to a bounded number of lower-dimensional problems. The run-time complexity of the algorithm has been improved in several steps:
|
wikipedia
|
wiki_30823_chunk_2
|
Computer graphics (computer science)
|
There are several international conferences and journals where the most significant results in computer graphics are published. Among them are the SIGGRAPH and Eurographics conferences and the Association for Computing Machinery (ACM) Transactions on Graphics journal. The joint Eurographics and ACM SIGGRAPH symposium series features the major venues for the more specialized sub-fields: Symposium on Geometry Processing, Symposium on Rendering, Symposium on Computer Animation, and High Performance Graphics. As in the rest of computer science, conference publications in computer graphics are generally more significant than journal publications (and subsequently have lower acceptance rates).
|
wikipedia
|
wiki_38000_chunk_25
|
Consumer neuroscience
|
Limitations
Most of the consumer neuroscience studies involving brain scanning techniques have been conducted in medical or technological environments where such brain imaging devices are present. This is not a realistic environment for consumer decision making and may serve to skew the data relative to consumer decision making in normal consumer environments.
Testing underlying neurophysiological principles is extraordinarily difficult from an experimental setup standpoint simply because it is unclear exactly how various factors are perceived in the human mind. An extremely comprehensive understanding of the neuroscientific testing techniques to be used is required to be able to establish proper controls and create an environment such that test subjects are not inadvertently exposed to unwanted stimuli that may bias results.
There are many concerns over the value and the potential usage of consumer neuroscience data. The potential for enhanced consumer welfare is certainly present but equally present is the potential for the information to be used inappropriately for individual gain. The reaction to emerging study results in both the public and the media remains to be seen.
In its current state, consumer neuroscience research is a compilation of only loosely related subjects that is unable, at this point, to produce any collective conclusions.
|
wikipedia
|
wiki_9832_chunk_13
|
Lamport's bakery algorithm
|
When implementing the pseudo code in a single process system or under cooperative multitasking, it is better to replace the "do nothing" sections with code that notifies the operating system to immediately switch to the next thread. This primitive is often referred to as yield. Lamport's bakery algorithm assumes a sequential consistency memory model. Few, if any, languages or multi-core processors implement such a memory model. Therefore, correct implementation of the algorithm typically requires inserting fences to inhibit reordering. PlusCal code We declare N to be the number of processes, and we assume that N is a natural number.
|
wikipedia
|
wiki_1763_chunk_54
|
Computer-assisted language learning
|
A distinction needs to be made between the impact and the effectiveness of CALL. Impact may be measured quantitatively and qualitatively in terms of the uptake and use of ICT in teaching foreign languages, issues of availability of hardware and software, budgetary considerations, Internet access, teachers' and learners' attitudes to the use of CALL, changes in the ways in which languages are learnt and taught, and paradigm shifts in teachers' and learners' roles. Effectiveness, on the other hand, usually focuses on assessing to what extent ICT is a more effective way of teaching foreign languages compared to using traditional methods – and this is more problematic as so many variables come into play. Worldwide, the picture of the impact of CALL is extremely varied. Most developed nations work comfortably with the new technologies, but developing nations are often beset with problems of costs and broadband connectivity. Evidence on the effectiveness of CALL – as with the impact of CALL – is extremely varied and many research questions still need to be addressed and answered. Hubbard (2002) presents the results of a CALL research survey that was sent to 120 CALL professionals from around the world asking them to articulate a CALL research question they would like to see answered. Some of the questions have been answered but many more remain open. Leakey (2011) offers an overview of current and past research in CALL and proposes a comprehensive model for evaluating the effectiveness of CALL platforms, programs and pedagogy.
|
wikipedia
|
wiki_28723_chunk_4
|
Neuroscience Information Framework
|
The NIFSTD, or NIF Standard Ontology contains many of the terms, synonyms and abbreviations useful for neuroscience, as well as dynamic categories such as defined cell classes based on various properties like neuron by neurotransmitter or by circuit role or drugs of abuse according to the National Institutes on Drug Abuse.
Any term (with associated synonyms) or dynamic category (all terms with their synonyms) can be used to simultaneously query all of the data that NIF currently indexes, please find several examples below:
available data about the hippocampus including synonyms
data about parkinson's disease including archaic synonyms like paralysis agitans
neocortical neuron a dynamic category includes all neurons that have cell soma in any part of the neocortex
|
wikipedia
|
wiki_637_chunk_3
|
Jess (programming language)
|
(assert (car (color red) (mileage 10000) (value 400)))
Sample code:
(clear)
(deftemplate blood-donor (slot name) (slot type))
(deffacts blood-bank ; put names & their types into [[working memory]]
(blood-donor (name "Alice")(type "A"))
(blood-donor (name "Agatha")(type "A"))
(blood-donor (name "Bob")(type "B"))
(blood-donor (name "Barbara")(type "B"))
(blood-donor (name "Jess")(type "AB"))
(blood-donor (name "Karen")(type "AB"))
(blood-donor (name "Onan")(type "O"))
(blood-donor (name "Osbert")(type "O"))
)
(defrule can-give-to-same-type-but-not-self ; handles A > A, B > B, O > O, AB > AB, but not N1 > N1
(blood-donor (name ?name)(type ?type))
(blood-donor (name ?name2)(type ?type2 &:(eq ?type ?type2) &: (neq ?name ?name2) ))
=>
(printout t ?name " can give blood to " ?name2 crlf)
)
(defrule O-gives-to-others-but-not-itself ; O to O cover in above rule
(blood-donor (name ?name)(type ?type &:(eq ?type "O")))
(blood-donor (name ?name2)(type ?type2 &: (neq ?type ?type2) &: (neq ?name ?name2) ))
=>
(printout t ?name " can give blood to " ?name2 crlf)
)
(defrule A-or-B-gives-to-AB ; case O gives to AB and AB gives to AB already dealt with
(blood-donor (name ?name)(type ?type &:(or (eq ?type "A") (eq ?type "B" ))))
(blood-donor (name ?name2)(type ?type2 &: (eq ?type2 "AB") &: (neq ?name ?name2) ))
=>
(printout t ?name " can give blood to " ?name2 crlf)
)
;(watch all)
(reset)
(run)
|
wikipedia
|
wiki_521_chunk_20
|
Statistics
|
Experimental and observational studies
A common goal for a statistical research project is to investigate causality, and in particular to draw a conclusion on the effect of changes in the values of predictors or independent variables on dependent variables. There are two major types of causal statistical studies: experimental studies and observational studies. In both types of studies, the effect of differences of an independent variable (or variables) on the behavior of the dependent variable are observed. The difference between the two types lies in how the study is actually conducted. Each can be very effective.
An experimental study involves taking measurements of the system under study, manipulating the system, and then taking additional measurements using the same procedure to determine if the manipulation has modified the values of the measurements. In contrast, an observational study does not involve experimental manipulation. Instead, data are gathered and correlations between predictors and response are investigated. While the tools of data analysis work best on data from randomized studies, they are also applied to other kinds of data—like natural experiments and observational studies—for which a statistician would use a modified, more structured estimation method (e.g., Difference in differences estimation and instrumental variables, among many others) that produce consistent estimators.
|
wikipedia
|
wiki_18663_chunk_4
|
Society for Anthropological Sciences
|
It maintains a website at http://www.societyforanthropologicalsciences.org. The purpose of the site is promote discussion and cooperation among anthropologists and others interested in promoting scientific anthropology, as opposed to those who argue that anthropology (and social science generally) is not scientific, cannot be scientific, or should not be scientific. The site promotes relevant conferences and meetings, provides links to useful scientific resources, provides links to teaching materials, and provides forms that can be used to join SASci and to register and propose panels for panels at the conferences organized by SASci itself.
In association with its website, the SASci also maintains a listserve to facilitate discussion among members on the same issues and concerns, and help members organize cooperative research.
The SASci sponsors annual meetings for interested persons on relevant themes and organize panels for such meetings. The first such conference was held in New Orleans, LA, 22–23 November 2004. The second was Santa Fe, NM, in 23 February 2005-February 27, 2005, and the third was in Savannah, GA, on February 22-February 25, 2006. The second and third were held in conjunction with the Society for Cross Cultural Anthropology, which is older and larger and has been doing this for some years. Financially, they are self-liquidating. Conference fees have covered the costs, with small amount left over, but they are not fundraising activities.
SAS/SASci sponsor the H. Russell Bernard Graduate Student Paper Awards at both the American Anthropological Association meetings in the autumn and the annual spring meetings. This prize goes to the best paper submitted and presented at the meetings that reflects the highest standards in empirical anthropology. The prize is named in honour of one of the founding members of SAS, H. Russell Bernard, who has provided both inspiration and tuition for generations of scientific and humanistic anthropologists.
The SASci promotes or facilitates the organization by its members of panels at the Annual Meetings of the American Anthropological Association.
In the American Anthropological Association, the SASci presently has the status of a provisional "section". Its title is the Section for Anthropological Sciences (SAS). Membership just prior to being granted status as a provisional section was over 500.
|
wikipedia
|
wiki_17601_chunk_23
|
Softmax function
|
Here is an example of Julia code: julia> A = [1.0, 2.0, 3.0, 4.0, 1.0, 2.0, 3.0]; # semicolon to suppress interactive output julia> exp.(A) ./ sum(exp.(A))
7-element Array{Float64,1}:
0.0236405
0.0642617
0.174681
0.474833
0.0236405
0.0642617
0.174681 Here is an example of R code:
|
wikipedia
|
wiki_11615_chunk_13
|
Mathematics of Sudoku
|
Rectangular regions
A popular variant is made of rectangular regions (blocks or boxes) – for example, 2×3 hexominoes tiled in a 6×6 grid. The following notation is used for discussing this variant:
R×C denotes a rectangular region with R rows and C columns.
The implied grid configuration has:
grid dimensions N×N, where N = R×C
N blocks (boxes) of size R×C, arranged in a C×R 'supergrid'
C bands of size R×N, consisting of R horizontally adjacent blocks
R stacks of size N×C, consisting of C vertically adjacent blocks
Sudoku with square N×N regions are more symmetrical than rectangular Sudoku since each row and column intersects N regions and shares N cells with each. The number of bands and stacks also equals N. The "3×3" Sudoku is additionally unique: N is also the number of row-column-region constraints from the One Rule (i.e. there are N=3 types of units).
|
wikipedia
|
wiki_3019_chunk_37
|
R (programming language)
|
Coefficients:
Estimate Std. Error t value Pr(>|t|)
(Intercept) -9.3333 2.8441 -3.282 0.030453 *
x 7.0000 0.7303 9.585 0.000662 ***
---
Signif. codes: 0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1
|
wikipedia
|
wiki_8086_chunk_32
|
Courant Institute of Mathematical Sciences
|
External links
Courant Institute of Mathematical Sciences
Department of Mathematics, New York University
Applied Mathematics Laboratory
New York University Computer Science
New York University Mathematics in Finance
New York University Scientific Computing
http://www.cims.nyu.edu/~csplash/index.php
NYU Mathematics Society, New York University
http://www.cs.nyu.edu/~wincweb/
http://www.cs.nyu.edu/~macsweb/
https://web.archive.org/web/20090414012602/http://cs.nyu.edu/~acmweb/wordpress/
|
wikipedia
|
wiki_1712_chunk_5
|
Statistics Canada
|
Statistics Canada provides free access to numerous aggregate data tables on various subjects of relevance to Canadian life. Many tables used to be published as the Canadian Socio-economic Information Management System, or CANSIM, which has since been replaced by new, more easily manipulated data tables Subject areas include Aboriginal peoples, Agriculture, Business, consumer and property services, Business performance and ownership, Children and youth, Construction, Crime and justice, Culture and leisure, Economic accounts, Education, training and learning, Energy, Environment, Ethnic diversity and immigration, Families, households and housing, Government, Health, Income, pensions, spending and wealth, Information and communications technology, International trade, Labour, Languages, Manufacturing, Population and demography, Prices and price indexes, Reference, Retail and wholesale, Science and technology, Seniors, Society and community, Transportation, and Travel and tourism.
|
wikipedia
|
wiki_35835_chunk_4
|
Journal of Cell Biology
|
Key dates
January 25, 1955: Publication of the first issue of The Journal of Biophysical and Biochemical Cytology.
January 1961 – December 1983: Raymond Griffiths is Executive Editor.
January 1962: Journal name changed to The Journal of Cell Biology.
January 1984 – December 1998: Bernie Gilula is Editor in Chief.
January 13, 1997: First issue of JCB is published online.
April 1997 – April 2007: Mike Rossner is Managing Editor.
January 1999 – December 2008: Ira Mellman is Editor in Chief.
July 2000: Authors allowed to post the final, published pdf file of their articles on their own websites.
January 2001: JCB begins to make its online content free to the public six months after publication.
July 2002: JCB adopts completely electronic workflow.
September 2002: JCB begins screening all digital images for evidence of manipulation.
January 2003: JCB pioneers RGB workflow for color digital images.
June 2003: JCB releases all of its back content older than six months for free to the public back to volume 1, issue 1.
May 2007 – July 2010: Emma Hill is Executive Editor.
November 2007: JCB begins posting all of its content on PubMed Central, where it is available for free to the public six months after publication.
May 1, 2008: New copyright policy allows authors to retain copyright to their own works and third parties to reuse JCB content under a Creative Commons license.
December 2008: JCB launches Dataviewer
January 2009 – September 2014: Tom Misteli is Editor in Chief.
September 2010 – December 2014: Elizabeth H. Williams is Executive Editor.
October 2014 – May 2015: Alan Hall is Editor in Chief.
April 2015 - August 2019: Rebecca Alvania is Executive Editor.
August 2015 – present: Jodi Nunnari is Editor in Chief.
November 2019 - present: Tim Spencer is Executive Editor
|
wikipedia
|
wiki_39909_chunk_6
|
Alpha algorithm
|
Description
The alpha miner starts with converting an event log into directly-follows, sequence, parallel, and choice relations, and using them to create a petri net describing the process model. Initially the algorithm constructs a footprint matrix. Using the footprint matrix and the above shown pattern, one can construct a process model.
Based on the four relations described earlier a footprint based matrix is first discovered. Using the footprint based matrix places are discovered. Each place is identified with a pair of sets of tasks, in order to keep the number of places low.
|
wikipedia
|
wiki_8588_chunk_39
|
Matrix calculus
|
{|class="wikitable" style="text-align: center;"
|+ Identities: vector-by-scalar
! scope="col" width="150" | Condition
! scope="col" width="100" | Expression
! scope="col" width="100" | Numerator layout, i.e. by y,result is column vector
! scope="col" width="100" | Denominator layout, i.e. by yT,result is row vector
|-
| a is not a function of x || ||colspan=2|
|-
| a is not a function of x,u = u(x) ||
| colspan=2|
|-
| A is not a function of x,u = u(x) || || ||
|-
| u = u(x) ||
| colspan=2|
|-
| u = u(x), v = v(x) ||
| colspan=2|
|-
| u = u(x), v = v(x) ||
||
||
|-
| rowspan=2|u = u(x) || rowspan=2| || ||
|-
|colspan=2|Assumes consistent matrix layout; see below.
|-
| rowspan=2|u = u(x) || rowspan=2| || ||
|-
|colspan=2|Assumes consistent matrix layout; see below.
|-
| U = U(x), v = v(x) ||
||
||
|}
|
wikipedia
|
wiki_7647_chunk_24
|
Minkowski's question-mark function
|
Restricting the Minkowski question mark function to ?:[0,1] → [0,1], it can be used as the cumulative distribution function of a singular distribution on the unit interval. This distribution is symmetric about its midpoint, with raw moments of about m1 = 0.5, m2 = 0.290926, m3 = 0.186389 and m4 = 0.126992, and so a mean and median of 0.5, a standard deviation of about 0.2023, a skewness of 0, and an excess kurtosis about -1.147. Conway box function
|
wikipedia
|
wiki_34229_chunk_8
|
Symbol (programming)
|
Examples
The following is a simple example of a symbol literal in Ruby:
my_symbol = :a
my_symbol = :"an identifier"
Strings can be coerced into symbols, vice versa:
irb(main):001:0> my_symbol = "Hello, world!".intern
=> :"Hello, world!"
irb(main):002:0> my_symbol = "Hello, world!".to_sym
=> :"Hello, world!"
irb(main):003:0> my_string = :hello.to_s
=> "hello"
Symbols are objects of the Symbol class in Ruby:
irb(main):004:0> my_symbol = :hello_world
=> :hello_world
irb(main):005:0> my_symbol.length
=> 11
irb(main):006:0> my_symbol.class
=> Symbol
Symbols are commonly used to dynamically send messages to (call methods on) objects:
irb(main):007:0> "aoboc".split("o")
=> ["a", "b", "c"]
irb(main):008:0> "aoboc".send(:split, "o") # same result
=> ["a", "b", "c"]
Symbols as keys of an associative array:
irb(main):009:0> my_hash = { a: "apple", b: "banana" }
=> {:a=>"apple", :b=>"banana"}
irb(main):010:0> my_hash[:a]
=> "apple"
irb(main):011:0> my_hash[:b]
=> "banana"
|
wikipedia
|
wiki_33657_chunk_12
|
Hayden Geological Survey of 1871
|
The survey followed the Firehole River upstream to Madison Lake and then over the divide to Shoshone Lake eventually camping near Lost Lake about from the West Thumb area of Yellowstone Lake. On August 7, 1871 they camped and explored at West Thumb for two days. As some of the military escort were to travel back to Fort Ellis, the survey team took the opportunity to send back correspondence and a large amount of specimens collected to the Base Camp at Bottler's Ranch. In that correspondence was Hayden's Report No. 7 to Assistant Secretary of the Smithsonian Institution, Dr. Spencer Baird, a bit of which is excerpted below:
Yellowstone Lake, WY August 8th, 1871 - Dear Professor Baird, Your letters of June 6th and July 3rd were brought us from Fort Ellis by Lt. Doane who has just arrived to take command of our escort and accompany my party the remainder of the season. ... We arrived at the banks of the Yellow Stone Lake [sic] July 26th [actually July 28] and pitched our camp near the point where the river leaves the Lake. Hence we brought the first pair of wheels that ever came to the Lake with our Odometer. We launched the first Boat on the Lake, 4.5 feet wide and 11 feet long, with sails and oars. ... A chart of this soundings will be made. Points have been located with a prismatic compass all around the Lake. A man stands on the shore with a compass and takes a bearing to the man in the Boat as he drops the lead, giving a signal at the time. Then a man in the Boat takes a bearing to the fixed point on the shore where the first man is located and thus the soundings will be located on the chart. Henry Elliot and Mr. Carrington have just left in our little boat, the Annie. [They] will make a systematic sketch of the shore with all its indentations, with the banks down, indeed, making a complete topographical as well as pictorial sketch of the shores as seen from the water, for a circuit--of at least 130 miles. ... One of the islands has been explored. We have called it Stevenson's Island as he was undoubtedly the first human that ever set foot upon it. ... We found everything in the Geyser region even more wonderful than it has been represented. ... I send this back to you by James [Stevenson] who returns to our permanent camp for supplies. ... We hope to reach Fort Ellis about the 1st or 5th of September. Schönborn does splendid Topographical work. Write at once. Yours Truly, F. V. Hayden, I will send you some Photographs soon.
|
wikipedia
|
wiki_15554_chunk_6
|
Jacobi eigenvalue algorithm
|
procedure jacobi(S ∈ Rn×n; out e ∈ Rn; out E ∈ Rn×n)
var
i, k, l, m, state ∈ N
s, c, t, p, y, d, r ∈ R
ind ∈ Nn
changed ∈ Ln
function maxind(k ∈ N) ∈ N ! index of largest off-diagonal element in row k
m := k+1
for i := k+2 to n do
if │Ski│ > │Skm│ then m := i endif
endfor
return m
endfunc
procedure update(k ∈ N; t ∈ R) ! update ek and its status
y := ek; ek := y+t
if changedk and (y=ek) then changedk := false; state := state−1
elsif (not changedk) and (y≠ek) then changedk := true; state := state+1
endif
endproc
procedure rotate(k,l,i,j ∈ N) ! perform rotation of Sij, Skl
┌ ┐ ┌ ┐┌ ┐
│Skl│ │c −s││Skl│
│ │ := │ ││ │
│Sij│ │s c││Sij│
└ ┘ └ ┘└ ┘
endproc
! init e, E, and arrays ind, changed
E := I; state := n
for k := 1 to n do indk := maxind(k); ek := Skk; changedk := true endfor
while state≠0 do ! next rotation
m := 1 ! find index (k,l) of pivot p
for k := 2 to n−1 do
if │Sk indk│ > │Sm indm│ then m := k endif
endfor
k := m; l := indm; p := Skl
! calculate c = cos φ, s = sin φ
y := (el−ek)/2; d := │y│+√(p2+y2)
r := √(p2+d2); c := d/r; s := p/r; t := p2/d
if y<0 then s := −s; t := −t endif
Skl := 0.0; update(k,−t); update(l,t)
! rotate rows and columns k and l
for i := 1 to k−1 do rotate(i,k,i,l) endfor
for i := k+1 to l−1 do rotate(k,i,i,l) endfor
for i := l+1 to n do rotate(k,i,l,i) endfor
! rotate eigenvectors for i := 1 to n do
┌ ┐ ┌ ┐┌ ┐
│Eik│ │c −s││Eik│
│ │ := │ ││ │
│Eil│ │s c││Eil│
└ ┘ └ ┘└ ┘
endfor
! rows k, l have changed, update rows indk, indl indk := maxind(k); indl := maxind(l)
loop
endproc
|
wikipedia
|
wiki_2443_chunk_141
|
Quantitative genetics
|
A second application involves using regression analysis, which estimates from statistics the ordinate (Y-estimate), derivative (regression coefficient) and constant (Y-intercept) of calculus. The regression coefficient estimates the rate of change of the function predicting Y from X, based on minimizing the residuals between the fitted curve and the observed data (MINRES). No alternative method of estimating such a function satisfies this basic requirement of MINRES. In general, the regression coefficient is estimated as the ratio of the covariance(XY) to the variance of the determinator (X). In practice, the sample size is usually the same for both X and Y, so this can be written as SCP(XY) / SS(X), where all terms have been defined previously. In the present context, the parents are viewed as the "determinative variable" (X), and the offspring as the "determined variable" (Y), and the regression coefficient as the "functional relationship" (ßPO) between the two. Taking cov(MPO) = ½ s2A as cov(XY), and s2P / 2 (the variance of the mean of two parents—the mid-parent) as s2X, it can be seen that ßMPO = [½ s2A] / [½ s2P] = h2 . Next, utilizing cov(PO) = [ ½ s2A + ½ s2D ] as cov(XY), and s2P as s2X, it is seen that 2 ßPO = [ 2 (½ s2A + ½ s2D )] / s2P = H2 .
|
wikipedia
|
wiki_849_chunk_29
|
Algebraic notation (chess)
|
Though not technically a part of algebraic notation, the following are some symbols commonly used by annotators, for example in publications Chess Informant and Encyclopaedia of Chess Openings, to give editorial comment on a move or position.
{|
|- style="vertical-align:bottom;"
|colspan="2;"|On moves:
|- style="vertical-align:top;"
| !
| a very good move
|- style="vertical-align:top;"
| !!
| a brilliant—and usually surprising—move
|- style="vertical-align:top;"
| ?
| a bad move; a mistake
|- style="vertical-align:top;"
| ??
| a blunder
|- style="vertical-align:top;"
| !?
| an interesting move that may not be the best
|- style="vertical-align:top;"
| ?!
| a dubious move that is not easily refutable
|- style="vertical-align:top;"
|
| a better move than the one played
|- style="vertical-align:top;"
|
| the only reasonable move, or the only move available
|- style="vertical-align:top;"
| ( )
| a
|- style="vertical-align:bottom;"
|colspan="2;"| On positions:
|-style="vertical-align:top;"
| =
| for both players
|-style="vertical-align:top;"
| +/= ( ⩲)
| White has a slight plus
|-style="vertical-align:top;"
| =/+ ( ⩱)
| Black has a slight plus
|-style="vertical-align:top;"
| +/− ( ±)
| White has a clear plus
|-style="vertical-align:top;"
| −/+ ( ∓)
| Black has a clear plus
|-style="vertical-align:top;"
| +−
| White has a winning advantage
|-style="vertical-align:top;"
| −+
| Black has a winning advantage
|-style="vertical-align:top;"
| ∞
| unclear whether either side has an advantage; “toss-up”
|-style="vertical-align:top;"
| =/∞
| whoever is down in has compensation for it
|}
|
wikipedia
|
wiki_19608_chunk_15
|
Comparison of programming languages (syntax)
|
Parentheses ( ... )
OCaml, Prolog, Standard ML
Square brackets [ ... ]
Smalltalk (blocks are first class objects. a.k.a. closures)
begin ... end
Ada, ALGOL, Pascal, Ruby (for, do/while & do/until loops), OCaml, SCL, Simula, Erlang.
do ... end
PL/I, REXX
do ... done
Bash (for & while loops), Visual Basic, Fortran, TUTOR (with mandatory indenting of block body), Visual Prolog
do ... end
Lua, Ruby (pass blocks as arguments, for loop), Seed7 (encloses loop bodies between do and end)
X ... end (e.g. if ... end):
Ruby (if, while, until, def, class, module statements), OCaml (for & while loops), MATLAB (if & switch conditionals, for & while loops, try clause, package, classdef, properties, methods, events, & function blocks), Lua (then / else & function)
(begin ...)
Scheme
(progn ...)
Lisp
(do ...)
Clojure
|
wikipedia
|
wiki_8588_chunk_44
|
Matrix calculus
|
{|class="wikitable" style="text-align: center;"
|+ Identities: matrix-by-scalar
! scope="col" width="175" | Condition
! scope="col" width="100" | Expression
! scope="col" width="100" | Numerator layout, i.e. by Y
|-
| U = U(x) || ||
|-
| A, B are not functions of x, U = U(x) || ||
|-
| U = U(x), V = V(x) || ||
|-
| U = U(x), V = V(x) || ||
|-
| U = U(x), V = V(x) || ||
|-
| U = U(x), V = V(x) || ||
|-
| U = U(x) || ||
|-
| U = U(x,y) || ||
|-
| A is not a function of x, g(X) is any polynomial with scalar coefficients, or any matrix function defined by an infinite polynomial series (e.g. eX, sin(X), cos(X), ln(X), etc.); g(x) is the equivalent scalar function, g′(x) is its derivative, and g′(X) is the corresponding matrix function || || colspan=2|
|-
| A is not a function of x || ||
|}
|
wikipedia
|
wiki_38856_chunk_7
|
Company Level Intelligence Cell
|
References
Corps creates intel cells at rifle-company level
Creating Intelligence, Neil Garra, http://www.s2company.com/index.php?topic=4
Company-Level Intelligence Cell, Training and evaluation at Talon Reach V: “all-in” for intelligence integration at the company level, by Maj Brendan Heatherman, MCIS Staff, and MCWL Staff, https://web.archive.org/web/20151208145235/https://www.mca-marines.org/gazette/2015/08/company-level-intelligence-cell
Company-Level Intelligence Cell, Next Generation, Major Mark Schaefer, https://web.archive.org/web/20150710011920/https://www.mca-marines.org/gazette/2015/07/clic-next-generation
The CLIC in EF 21, Perspective from the GCE, LtCol Jeffrey Dinsmore and Capt Caleb Gowan, https://web.archive.org/web/20151208173749/https://www.mca-marines.org/gazette/2015/08/clic-ef-21
MCIP 2-1.01 http://www.marines.mil/LinkClick.aspx?fileticket=I6KLcKFwR2c%3D&portalid=59
|
wikipedia
|
wiki_35990_chunk_2
|
The Selected Works of T. S. Spivet
|
Plot summary
The novel is told from the perspective of twelve-year-old T.S. Spivet, a mapmaking enthusiast living on a ranch near Divide, Montana, a small village near Butte, Montana, practically on the continental divide.
T.S.'s mother, whom he consistently refers to as "Dr. Clair," is an entomologist preoccupied — or so it seems — with the search for a possibly nonexistent species of insect, the "tiger monk beetle".
His father, an equally emotionally detached rancher with no understanding for the world of scientific investigation, solely judges — or so it seems — T.S. for his nonexistent cowboy abilities.
T.S.'s younger brother, Layton, who followed his father's cowboy lifestyle and interests, was killed in a joint brotherly experiment that involved the scientific investigation of gun shooting.
His elder sister, Gracie, is in her teenage years, prone to "awful girl pop" and violent mood swings.
T.S.'s love for scientific research leads to a friendship with his mother's partner, who unbeknownst to the Spivets has sent several of T.S.'s works into various magazines and societies. One day, T.S. receives a call from a man at the Smithsonian Institution who, believing T.S. to be an adult scientist, informs him that he has won the prestigious Baird Award and is invited to give a talk at the Institution's ceremonies. Without telling his family, T.S. decides to run away from home to attend the event, which he will travel to by freighthopping. T.S. tricks a Union Pacific freight train into pausing at Divide and hides himself in a Winnebago that is being shipped on a flat car. He settles down for a lengthy journey, mapping the trip and imagining the Winnebago to be a conversational companion along the way.
|
wikipedia
|
wiki_34985_chunk_4
|
IEEE Oceanic Engineering Society
|
(a) IEEE Journal of Oceanic Engineering: A quarterly journal published by OES whose field of interest includes all aspects of science, engineering and technology that address research, development, and operations pertaining to all bodies of water. This includes the creation of new capabilities and technologies from concept design through prototypes, testing and operational systems to sense, explore, analyze, understand, develop, use and responsibly manage natural resources.
(b) OES Beacon Newsletter: This newsletter is published four times a year as the society’s primary promotional product and provides articles on the latest society conferences, activities, members, etc., along with advertisements and promotional information on upcoming events. All OES members, unless they opt out, receive a print version of the Beacon, which is also available on the OES website in PDF and HTML formats. The ongoing work/activities of the OES President, Vice Presidents (VPs), Committees and Chapters are reported regularly.
(c) IEEE OES Earthzine: An online publication operating under the auspices of OES. It provides up-to-date information on science, technology, Earth/Ocean observation and information utilization and those participating and contributing to its advancement. Earthzine is run by volunteers of the OES. Earthzine publishes materials that are inspirational to new and future Earth/Ocean observers and that promote greater awareness of the Earth through its observation. Earthzine encourages interaction of an on-line community of Earth observers. It is updated regularly with news spanning:
|
wikipedia
|
wiki_29911_chunk_4
|
Feature-oriented programming
|
A third generation of research focussed on the fact that every program has multiple representations (e.g., source, makefiles,
documentation, etc.) and adding a feature to a program should elaborate each of its representations so that all are consistent. Additionally, some of representations could be generated (or derived) from others. In the sections below, the mathematics of the three most recent generations of FOSD, namely GenVoca, AHEAD, and FOMDD are
described, and links to product lines that have been developed using FOSD tools are provided.
Also, four additional results that apply to all generations of FOSD are: FOSD metamodels, FOSD program cubes, and FOSD feature interactions.
|
wikipedia
|
wiki_26407_chunk_32
|
Text Executive Programming Language
|
TEX commands:
call ! – call a subroutine in the current program or in another file. the call ends when a stop or return
clear – remove a named variable from the pool or use * to remove all variables
goto ! – goto the named file and label
ercall ! – call subroutine on error in the preceding command
ergoto ! – goto procedure on error in the preceding command
if – if conditional, the expression is of the form <variable|value>:op:<variable|value> where the op is one of the comparator ops mentioned earlier.
in: – print the expression and wait for input. Store input in the *in variable
int: – print the expression and wait for input specifically from the terminal. Store the input in the *in variable.
*null – no-input carriage return from the terminal, used to terminate insert mode in a TEX program. No other commands may be on the same line.
stop – stop the TEX program
_ – remarks line
return – return from a subroutine call
out: – print the expression to the terminal
outt: – force print the expression (and all prior output not yet flushed) to the terminal
scan:: – scan from left to right searching for and parse placing the results in *left, *middle, and *right star variables and if *match is T then a match was found.
scann:: – scan from left to right searching for and parse placing the results in *left, *middle, and *right star variables and if *match is T then a match was found. scann was limited to a single character or character class (*lc=lowercase alphabetic, *uc=uppercase alphabetic, *n=numeric, *a=alphabetic(*lc+*uc), *an=alphanumeric(*a+*n))
scanr:: – scan from right to left searching for and parse placing the results in *left, *middle, and *right star variables and if *match is T then a match was found.
scannr:: – scan from right to left searching for and parse placing the results in *left, *middle, and *right star variables and if *match is T then a match was found. scannr was limited to a single character or character class (*lc=lowercase alphabetic, *uc=uppercase alphabetic, *n=numeric, *a=alphabetic(*lc+*uc), *an=alphanumeric(*a+*n))
split:: – split at position starting from the beginning of placing the results in *left, *middle, and *right star variables
splitr:: – split at position starting from the end of placing the results in *left, *middle, and *right star variables
subs – activate subs mode where TEX will scan for pairs of <subs_characters>, evaluating the expression and placing it in the line prior to executing the line. SUBS mode is turned off by NOSUBS
trace - activate trace mode where lines are displayed prior to being executed. Trace mode is turned off by NOTRACE
vari - display all variables and their values including the star variables
|
wikipedia
|
wiki_20402_chunk_7
|
Tree of life (biology)
|
Charles Darwin (1809–1882) used the metaphor of a "tree of life" to conceptualize his theory of evolution. In On the Origin of Species (1859) he presented an abstract diagram of a theoretical tree of life for species of an unnamed large genus (see figure). On the horizontal base line hypothetical species within this genus are labelled A – L and are spaced irregularly to indicate how distinct they are from each other, and are above broken lines at various angles suggesting that they have diverged from one or more common ancestors. On the vertical axis divisions labelled I – XIV each represent a thousand generations. From A, diverging lines show branching descent producing new varieties, some of which become extinct, so that after ten thousand generations descendants of A have become distinct new varieties or even sub-species a10, f10, and m10. Similarly, the descendants of I have diversified to become the new varieties w10 and z10. The process is extrapolated for a further four thousand generations so that the descendants of A and I become fourteen new species labelled a14 to z14. While F has continued for fourteen thousand generations relatively unchanged, species B,C,D,E,G,H,K and L have gone extinct. In Darwin's own words: "Thus the small differences distinguishing varieties of the same species, will steadily tend to increase till they come to equal the greater differences between species of the same genus, or even of distinct genera.". This is a branching pattern with no names given to species, unlike the more linear tree Ernst Haeckel made years later (figure below) which includes the names of species and shows a more linear development from "lower" to "higher" species. In his summary to the section, Darwin put his concept in terms of the metaphor of the tree of life:
|
wikipedia
|
wiki_16437_chunk_12
|
Civil Services Examination
|
From 2011 onwards, the preliminary examination intends to focus on analytical abilities and understanding rather than the ability to memorize. The new pattern includes two papers of two hours duration and 200 marks each. Both papers have multiple choice objective type questions only. They are as follows:
Paper I tests the candidate's knowledge on current events, history of India and Indian national movement, Indian and world geography, Indian polity panchayti Raj system and governance, economic and social development, environmental ecology, biodiversity, climate change and general science, Art and culture.
Paper II (also called CSAT or Civil Services Aptitude Test), tests the candidate's skills in comprehension, interpersonal skills, communication, logical reasoning, analytical ability, decision making, problem solving, basic numeracy, data interpretation, English language comprehension skills and mental ability. It is qualifying in nature and the marks obtained in this paper are not counted for merit. However, it is mandatory for the candidate to score a minimum of 33 per cent in this paper to qualify the Prelims exam.
|
wikipedia
|
wiki_13051_chunk_9
|
Cell (novel)
|
Characters
Clayton Riddell: a graphic artist separated from his family in Boston as the Pulse destroys civilization. Clay heads north with a group of survivors and tries to find his son, Johnny, and estranged wife, Sharon.
Thomas McCourt: a middle-aged man from Malden; Tom teams up with Clay in the initial chaos created by the Pulse. With Clay and Alice, he travels to his home in Malden. Then, they move on north where they meet others. He remains with the group until after Kashwak, when he survives and leaves Clay along with Jordan, Denise and Dan.
Alice Maxwell: a 15-year-old girl; Alice teams up with Clay and Tom to head north. She forces her anxiety and trauma into an abandoned child's Nike shoe which helps her cope with the atrocities committed by the phoners. Alice remains an important part of the group who continue to take inspiration from her even after her death.
Jordan: a 12-year-old-boy studying at Gaiten Academy, a prep school that was devastated by the Pulse; Jordan faithfully remains with the headmaster, Charles Ardai, until they destroy the flock at the school and Ardai is driven to suicide by the phoners. Jordan remains with Clay's group and provides the intellectual theory and comparison of the effects of the Pulse to that of a worm in a computer.
Charles Ardai: the headmaster of Jordan's prep school; Ardai is a father figure to Jordan and cares for the group. They manage to destroy a flock of phoners, but then Ardai is telepathically forced to commit suicide.
Dan Hartwick: a survivor and head of another flock-killing group; a former professor, Dan is intelligent and joins Clay's group as they head to Kashwak. He ultimately survives and leaves Clay with Jordan, Denise and Tom.
Denise Link: a pregnant survivor and part of Dan's flock-killing group; Denise joins the group with Dan and Ray and ultimately survives with them. She is described by Clay as a strong-willed woman and leaves with Tom, Jordan and Dan after Kashwak.
Ray Huizenga: a construction worker who specialized in explosives; Ray was part of Dan's group of flock-killers along with Denise, but has a plan regarding Kashwak. He gives Clay vague instructions about the plan before committing suicide with a pistol in order to mask his plans from the phoners. This ultimately saves the entire group.
The Raggedy Man/President of Harvard: the main antagonist of the book; he wears a torn red Harvard hoodie. He is killed by the bomb at Kashwak.
"Pixie Light": a teenage girl spotted by Clay in Boston and dubbed Pixie Light because of her haircut and hair color, this girl was one of the first victims of the Pulse and attacked another phoner seconds after listening to the Pulse on her cell phone. Pixie Light tore out the phoner's neck with her teeth and was knocked unconscious by Clay before she could do any more harm and was left on the streets of Boston.
"Pixie Dark": a teenage girl spotted by Clay in Boston who was named for reasons similar to Pixie Light; Pixie Dark was Pixie Light's friend and only heard a small dose of the Pulse via Pixie Light's cell phone. Instead of going completely crazy like her friend, Pixie Dark's brain was erased by the Pulse and she lost her mind, running off into Boston shouting "Who am I?" over and over. She is referenced several times throughout the book by Clay.
Gunner and Harold: a pair of young men encountered by Clay's group not long after they depart Gaiten; mouthy and rude (particularly toward Alice), they believe that Kashwak will be a safe haven for "normies". Following their brutal reciprocation to a threat made to them by Clay, Gunner and Harold are summarily punished for daring to touch an untouchable.
Other minor characters are briefly mentioned or seen throughout the book, primarily either as "normies" ("Plump Bible-toting Lady", Roscoe Handt) or phoners ("Power Suit Woman", Judy Scottoni).
|
wikipedia
|
wiki_11351_chunk_5
|
Programming complexity
|
Chidamber and Kemerer proposed a set of programing complexity metrics, widely used in many measurements and academic articles. They are WMC, CBO, RFC, NOC, DIT, and LCOM, described below:
WMC - weighted methods per class
n is the number of methods on the class
is the complexity of the method
CBO - coupling between object classes
number of other class which is coupled (using or being used)
RFC - response for a class
where
is set of methods called by method i
is the set of methods in the class
NOC - number of children
sum of all classes that inherit this class or a descendant of it
DIT - depth of inheritance tree
maximum depth of the inheritance tree for this class
LCOM- lack of cohesion of methods
Measures the intersection of the attributes used in common by the class methods
Where
And
With is the set of attributes (instance variables) accessed (read from or written to) by the -th method of the class
|
wikipedia
|
wiki_20689_chunk_18
|
CSA (database company)
|
The database covers theory, experimentation, application, emerging technologies, and companies that are involved in the space sciences (including aeronautics and astronautics), computer & information technology, solid state materials (including solid state devices), communications, chemistry geoscience, and finally electronics. Further research, application, and development coverage includes more than 40 countries including Japan and Eastern European nations. More than 10.7 million records are available (February 2011), with a monthly update of approximately 100,000 records, and temporal coverage from 1962 to the present. It is indexed by references, abstracts, and 40,000 controlled vocabulary terms.
|
wikipedia
|
wiki_17201_chunk_12
|
Use of Free and Open-Source Software (FOSS) in the U.S. Department of Defense
|
Create a "Generally Recognized As Safe" FOSS list. This list would provide quick official recognition of FOSS applications that are (a) commercially supported, (b) widely used, and (c) have proven track records of security and reliability—e.g., as measured by speed of closures of CERT reports in comparison to closed-source alternatives. Initial applications for consideration would include, but not be limited to, the set of 115 already-used applications identified by the survey in Table 2, plus other widely used tools such as Python () that did not appear in this first set of results. In formulating the list, quick consideration should be given in particular to high value, heavily used infrastructure and development tools such as Linux, OpenBSD, NetBSD, FreeBSD, Samba, Apache, Perl, GCC, GNAT, XFree86, OpenSSH, BIND, and sendmail.
Develop Generic, Infrastructure, Development, Security, & Research Policies. The DoD should develop generic policies both to promote broader and more effective use of FOSS, and to encourage the use of commercial products that work well with FOSS. A good example of the latter is the Microsoft Windows Services for UNIX product, which relies on FOSS (GPL) software to reduce development costs and dramatically increase its power. A second layer of customized policies should be created to deal with major use areas. For Infrastructure and Development, these policies should focus on enabling easier use of GRAS products such as Apache, Linux, and GCC that are already in wide use, but which often suffer from an ambiguous approval status. For Security, use of GPL within groups with well-defined security boundaries should be encouraged to promote faster, more locally autonomous responses to cyber threats. Finally, for Research the policies should encourage appropriate use of FOSS both to share and publish basic research, and to encourage faster commercial innovation.
Encourage use of FOSS to promote product diversity. FOSS applications tend to be much lower in cost than their proprietary equivalents, yet they often provide high levels of functionality with good user acceptance. This makes them good candidates to provide product diversity in both the acquisition and architecture of DoD systems. Acquisition diversity reduces the cost and security risks of being fully dependent on a single software product, while architectural diversity lowers the risk of catastrophic cyber attacks based on automated exploitation of specific features or flaws of very widely deployed products.
|
wikipedia
|
wiki_13132_chunk_7
|
Extreme programming practices
|
Determine Risk Index: Give each user story an index from 0 to 2 on each of the following factors:
Completeness (do we know all of the story details?)
Complete (0)
Incomplete (1)
Unknown (2)
Volatility (is it likely to change?)
low (0)
medium (1)
high (2)
Complexity (how hard is it to build?)
simple (0)
standard (1)
complex (2)
|
wikipedia
|
wiki_6352_chunk_47
|
Gene expression programming
|
For example, below is shown a simple chromosome composed of only one gene a head size of 7 (the Dc stretches over positions 15–22): 01234567890123456789012 +?*+?**aaa??aaa68083295 where the terminal "?” represents the placeholder for the RNCs. This kind of chromosome is expressed exactly as shown above, giving: Then the ?'s in the expression tree are replaced from left to right and from top to bottom by the symbols (for simplicity represented by numerals) in the Dc, giving:
|
wikipedia
|
wiki_32_chunk_22
|
Analysis of algorithms
|
Growth rate analysis of other resources
The methodology of run-time analysis can also be utilized for predicting other growth rates, such as consumption of memory space. As an example, consider the following pseudocode which manages and reallocates memory usage by a program based on the size of a file which that program manages: while file is still open:
let n = size of file
for every 100,000 kilobytes of increase in file size
double the amount of memory reserved
|
wikipedia
|
wiki_3229_chunk_23
|
Integer programming
|
Sparse integer programming
It is often the case that the matrix which defines the integer program is sparse. In particular, this occurs when the matrix has a block structure, which is the case in many applications. The sparsity of the matrix can be measured as follows. The graph of has vertices corresponding to columns of , and two columns form an edge if has a row where both columns have nonzero entries. Equivalently, the vertices correspond to variables, and two variables form an edge if they share an inequality. The sparsity measure of is the minimum between the tree-depth of the graph of and the tree-depth of the graph of the transpose of . Let be the numeric measure of defined as the maximum absolute value of any entry of . Let be the number of variables of the integer program. Then it was shown in 2018 that integer programming can be solved in strongly polynomial and fixed-parameter tractable time parameterized by and . That is, for some computable function and some constant , integer programming can be solved in time . In particular, the time is independent of the right-hand side and objective function . Moreover, in contrast to the classical result of Lenstra, where the number of variables is a parameter, here the number of variables is a variable part of the input.
|
wikipedia
|
wiki_6166_chunk_29
|
Loop unrolling
|
l.d $f10, 24($5) ; iteration with displacement 24
l.d $f12, 24($6)
mul.d $f10, $f10, $f12
add.d $f8, $f8, $f10 addi $5, $5, 32
addi $6, $6, 32
addi $7, $7, -4
test:
bgtz $7, loop3 ; Continue loop if $7 > 0 See also Duff's device
Instruction level parallelism
Just-in-time compilation
Loop fusion
Loop splitting
Parallel computing References
|
wikipedia
|
wiki_34246_chunk_2
|
Dungeon Master Option: High-Level Campaigns
|
Header
The book begins with a one-page foreword by Skip Williams. Chapter One (pages 6–29) explains the seven maxims for running high-level AD&D campaigns: Don't depend on the dice, Use adversaries intelligently and inventively, Control magic, Be aware of demographics, Think on an epic scale, Plan ahead, and Share responsibility with your players. Chapter Two (pages 30–67) provides advice on how to construct adventures. Chapter Three (pages 68–85) expands on the use of spells and magical items. Chapter Four (pages 86–95) presents a guide for spellcasting characters to create magical items. Chapter Five (pages 96–117) details how to conduct magical duels between spellcasters. Chapter Six (pages 118-141) details true dweomers, spells more powerful than those presented in the Player's Handbook. Chapter Seven (pages 142-179) details how to advance high-level player characters beyond 20th level. An appendix (pages 180-188) lists the statistics of spells usable in spell dueling. Pages 189-192 are an index to the book.
|
wikipedia
|
wiki_7791_chunk_20
|
Chinese mathematics
|
Linear algebra
The Book of Computations is the first known text to solve systems of equations with two unknowns. There are a total of three sets of problems within The Book of Computations involving solving systems of equations with the false position method, which again are put into practical terms. Chapter Seven of The Nine Chapters on the Mathematical Art also deals with solving a system of two equations with two unknowns with the false position method. To solve for the greater of the two unknowns, the false position method instructs the reader to cross-multiply the minor terms or zi (which are the values given for the excess and deficit) with the major terms mu. To solve for the lesser of the two unknowns, simply add the minor terms together.
|
wikipedia
|
wiki_2693_chunk_7
|
Disk (mathematics)
|
Computation
Complete elliptic integrals can be computed by the method of the arithmetic-geometric mean. can then be determined to good accuracy by code along the following lines:
double discdist(double q)
{ double x,a,b,c,oldc,adash,mult,csum,K,KminusE,qsq,pi=3.141592653589793 ;
if(q==0) return 2.0/3.0 ; else q = fabs(q) ;
if(q==1) return 32/(9*pi) ;
qsq = q * q ;
if(q<1) x = qsq ; else x = 1/qsq ;
// agm
b = sqrt(1-x) ;
c = sqrt(x) ;
for(a=1,oldc=c+1,csum=c*c/2,mult=1;c>1e-15&&c<oldc;csum+=mult*c*c,mult*=2)
{ oldc = c ; c = (a-b)/2 ; adash = (a+b)/2 ; b = sqrt(a*b) ; a = adash ; }
K = pi / (2*a) ;
KminusE = K * csum ;
if(q<1) return (4/(9*pi)) * ((5*qsq+3)*K - (qsq+7)*KminusE) ;
else return (4/(9*pi)) * ((5*qsq+3)*K/q - (qsq+7)*KminusE*q) ;
}
|
wikipedia
|
wiki_27918_chunk_1
|
List of unsolved problems in statistics
|
Inference and testing
How to detect and correct for systematic errors, especially in sciences where random errors are large (a situation Tukey termed uncomfortable science).
The Graybill–Deal estimator is often used to estimate the common mean of two normal populations with unknown and possibly unequal variances. Though this estimator is generally unbiased, its admissibility remains to be shown.
Meta-analysis: Though independent p-values can be combined using Fisher's method, techniques are still being developed to handle the case of dependent p-values.
Behrens–Fisher problem: Yuri Linnik showed in 1966 that there is no uniformly most powerful test for the difference of two means when the variances are unknown and possibly unequal. That is, there is no exact test (meaning that, if the means are in fact equal, one that rejects the null hypothesis with probability exactly α) that is also the most powerful for all values of the variances (which are thus nuisance parameters). Though there are many approximate solutions (such as Welch's t-test), the problem continues to attract attention as one of the classic problems in statistics.
Multiple comparisons: There are various ways to adjust p-values to compensate for the simultaneous or sequential testing of hypothesis. Of particular interest is how to simultaneously control the overall error rate, preserve statistical power, and incorporate the dependence between tests into the adjustment. These issues are especially relevant when the number of simultaneous tests can be very large, as is increasingly the case in the analysis of data from DNA microarrays.
Bayesian statistics: A list of open problems in Bayesian statistics has been proposed.
|
wikipedia
|
wiki_3248_chunk_27
|
Sum-addressed decoder
|
References
Paul Demone has an explanation of sum-addressed caches in a realworldtech article.
Heald et al. have a paper in ISSCC 1998 that explains what may be the original sum-addressed cache in the Ultrasparc III.
Sum-addressed memory is described in
United States patent 5,754,819,
May 19, 1998,
Low-latency memory indexing method and structure.
Inventors: Lynch; William L. (Palo Alto, CA), Lauterbach; Gary R. (Los Altos, CA);
Assignee: Sun Microsystems, Inc. (Mountain View, CA), Filed: July 28, 1994
At least one of the inventors named on a patent related to carry-free address decoding credits the following publication:
Evaluation of A + B = K Conditions without Carry Propagation (1992)
Jordi Cortadella, Jose M. Llaberia
IEEE Transactions on Computers,
The following patent extends this work, to use redundant form arithmetic throughout the processor, and so avoid carry propagation overhead even in ALU operations, or when an ALU operation is bypassed into a memory address:
United States Patent 5,619,664,
Processor with architecture for improved pipelining of arithmetic instructions by forwarding redundant intermediate data forms,
awarded April 18, 1997,
Inventor: Glew; Andrew F. (Hillsboro, OR);
Assignee: Intel Corporation (Santa Clara, CA),
Appl. No.: 08/402,322, Filed: March 10, 1995
|
wikipedia
|
wiki_36622_chunk_5
|
Discovery Networks Deutschland
|
Some programmes shown on DMAX
Was geht? Experiment am Limit (What works? Experiments at the limits) - gives solutions for childhood dreams and daily problems. e.g.: can a gun be fired underwater?
Die Ludolfs – 4 Brüder auf'm Schrottplatz (The Ludolfs – four brothers at the scrapyard) - observes Peter, Manni, Uwe and Günther eating pasta and fiddling around on broken cars
D Tech - presenter Daniel Hartwich takes viewers through the world of knowledge in an entertainment
Fish ’n’ Fun - entertains with beautiful landscape shots, reveals fishing tricks and shows men how to make a delicious dish out of their catch. The male desire for adventure is also satisfied, for example with the documentary series on crab fishers in Alaska’s waters
D Motor - presented by Tim Schrick and Sabine Schmitz, who has to prove her own driving skill against an opponent on her local race track, the Nürburgring
Moneycoach – Rette dein Geld (Money coach – save your money) - presenter Michael Requardt helps viewers out of their debt trap
|
wikipedia
|
wiki_19542_chunk_5
|
Map algebra
|
Tomlin classified the many possible map algebra operations into three types, to which some systems add a fourth:
Local Operators
Operations that operate on one cell location at a time during the scan phase. A simple example would be an arithmetic operator such as addition: to compute MAP3 = MAP1 + MAP2, the software scans through each matching cell of the input grids, adds the numeric values in each using normal arithmetic, and puts the result in the matching cell of the output grid. Due to this decomposition of operations on maps into operations on individual cell values, any operation that can be performed on numbers (e.g., arithmetic, statistics, trigonometry, logic) can be performed in map algebra. For example, a LocalMean operator would take in two or more grids and compute the arithmetic mean of each set of spatially corresponding cells. In addition, a range of GIS-specific operations has been defined, such as reclassifying a large range of values to a smaller range of values (e.g., 45 land cover categories to 3 levels of habitat suitability), which dates to the original IMGRID implementation of 1975. A common use of local functions is for implementing mathematical models, such as an index, that are designed to compute a resultant value at a location from a set of input variables.
Focal Operators
Functions that operate on a geometric neighborhood around each cell. A common example is calculating slope from a grid of elevation values. Looking at a single cell, with a single elevation, it is impossible to judge a trend such as slope. Thus, the slope of each cell is computed from the value of the corresponding cell in the input elevation grid and the values of its immediate neighbors. Other functions allow for the size and shape of the neighborhood (e.g. a circle or square of arbitrary size) to be specified. For example, a FocalMean operator could be used to compute the mean value of all the cells within 1000 meters (a circle) of each cell.
Zonal Operators
Functions that operate on regions of identical value. These are commonly used with discrete fields (also known as categorical coverages), where space is partitioned into regions of homogeneous nominal or categorical value of a property such as land cover, land use, soil type, or surface geologic formation. Unlike local and focal operators, zonal operators do not operate on each cell individually; instead, all of the cells of a given value are taken as input to a single computation, with identical output being written to all of the corresponding cells. For example, a ZonalMean operator would take in two layers, one with values representing the regions (e.g., dominant vegetation species) and another of a related quantitative property (e.g., percent canopy cover). For each unique value found in the former grid, the software collects all of the corresponding cells in the latter grid, computes the arithmetic mean, and writes this value to all of the corresponding cells in the output grid.
Global Operators
Functions that summarize the entire grid. These were not included in Tomlin's work, and are not technically part of map algebra, because the result of the operation is not a raster grid (i.e., it is not closed), but a single value or summary table. However, they are useful to include in the general toolkit of operations. For example, a GlobalMean operator would compute the arithmetic mean of all of the cells in the input grid and return a single mean value. Some also consider operators that generate a new grid by evaluating patterns across the entire input grid as global, which could be considered part of the algebra. An example of these are the operators for evaluating cost distance.
|
wikipedia
|
wiki_13449_chunk_61
|
Turing's proof
|
11 S.D – Standard Description: a sequence of symbols A, C, D, L, R, N, “;” on a Turing machine tape 12 D.N — Description Number: an S.D converted to a number: 1=A, 2=C, 3 =D, 4=L, 5=R, 6=N, 7=; 13 M(n) — a machine whose D.N is number “n” 14 satisfactory — a S.D or D.N that represents a circle-free machine
|
wikipedia
|
wiki_5511_chunk_14
|
Topological sorting
|
Note that the prefix sum for the local offsets can be efficiently calculated in parallel.
p processing elements with IDs from 0 to p-1
Input: G = (V, E) DAG, distributed to PEs, PE index j = 0, ..., p - 1
Output: topological sorting of G
function traverseDAGDistributed
δ incoming degree of local vertices V
// All vertices with indegree 0
nrOfVerticesProcessed = 0
do
global build prefix sum over size of Q // get offsets and total amount of vertices in this step
offset = nrOfVerticesProcessed + sum(Qi, i = 0 to j - 1) // j is the processor index
foreach u in Q
localOrder[u] = index++;
foreach (u,v) in E do post message (u, v) to PE owning vertex v
nrOfVerticesProcessed += sum(|Qi|, i = 0 to p - 1)
deliver all messages to neighbors of vertices in Q
receive messages for local vertices V
remove all vertices in Q
foreach message (u, v) received:
if --δ[v] = 0
add v to Q
while global size of Q > 0
return localOrder
The communication cost depends heavily on the given graph partition. As for runtime, on a CRCW-PRAM model that allows fetch-and-decrement in constant time, this algorithm runs in , where is again the longest path in and the maximum degree.
|
wikipedia
|
wiki_1067_chunk_39
|
Civil Service (United Kingdom)
|
{|class="wikitable"
! width="9%" rowspan="2"|Group
! colspan="2" | Historic names
! width="26%" colspan="3" style='background: #ffebd2' | Current structure
! colspan="3" width="39%" |Equivalent military rank(NATO Code)
|-
! Grade(pre 1971)
! 1971 unified grading structure
! colspan="2" width="13%" | 1996 SCS changes
! width="13%" |SCS bands known as
! width="13%" |Royal Navy
! width="13%" |Army
! width="13%" |Royal Air Force
|-
! rowspan="6"| SeniorCivilService
| Cabinet Secretary
|Grade 1A
| style='background: #ffebd2' colspan="2" rowspan="2"| SCS Pay Band 4
| Cabinet Secretary
| Admiral of the Fleet (OF-10)
| Field Marshal (OF-10)
| Marshal of the RAF (OF-10)
|-
| Permanent [Under] Secretary
|Grade 1
| Permanent Secretary
|Admiral (OF-9)
|General (OF-9)
|Air Chief Marshal (OF-9)
|-
| Deputy [Under] Secretary
|Grade 2
| style='background: #ffebd2' colspan="2" | SCS Pay Band 3
| Director General
|Vice Admiral (OF-8)
|Lieutenant General (OF-8)
|Air Marshal (OF-8)
|-
| Assistant Under Secretary, latterly Under Secretary or Director General
|Grade 3
| style='background: #ffebd2' colspan="2" | SCS Pay Band 2
| Director
|Rear Admiral (OF-7)
|Major General (OF-7)
|Air Vice Marshal (OF-7)
|-
| Under Secretary or Superintendent
| Grade 4
| style='background: #ffebd2' colspan="2" rowspan="2" | SCS Pay Band 1
| rowspan="2"| Director or Deputy Director
| rowspan="2" |Commodore (OF-6)
| rowspan="2" |Brigadier (OF-6)
| rowspan="2" |Air Commodore (OF-6)
|-
|Assistant Secretary or Director
|Grade 5
|-
! rowspan="3" |Senior Managers
| Senior Principal [xxx] or Deputy Director
| colspan="4" style='background: #ffebd2' |Grade 6/Band A+
| N/A
| N/A
| N/A
|-
|Principal [xxx] or Assistant Director
| style='background: #ffebd2' colspan="4" |Grade 7/Band A
| Captain (OF-5)
| Colonel (OF-5)
| Group Captain (OF-5)
|-
| colspan="3" |Assistant Principal [xxx] or Deputy Assistant Director
| style='background: #ffebd2' colspan="2" rowspan="2" |Senior Executive Officer (SEO)/Band B2+
| rowspan="2" |Commander (OF-4)
| rowspan="2" |Lieutenant Colonel (OF-4)
| rowspan="2" |Wing Commander (OF-4)
|-
! rowspan="2" |Middle Managers
| colspan="3" |Senior xxx Officer (SxO)
|-
| colspan="3" |Higher xxx Officer (HxO)
| style='background: #ffebd2' colspan="2" |Higher Executive Officer (HEO)/Band B2
| Lieutenant Commander (OF-3)
| Major (OF-3)
| Squadron Leader (OF-3)
|-
! rowspan="1" |Junior Managers
| colspan="3" |xxx Officer (xO) or Industrial Process & General Supervisory Grade E (PGSE)| colspan="2" style='background: #ffebd2' |Executive Officer (EO) or Industrial Skill Zone 4 (SZ4)
| Lieutenant (OF-2)
| Captain (OF-2)
| Flight Lieutenant (OF-2)
|-
! rowspan="4" |Administrative or Support Ranks
| colspan="3" |Higher Clerical Officer (HCO) or Industrial PGSD
| colspan="2" rowspan="2" style='background: #ffebd2' |Administrative Officer (AO) or Industrial Skill Zone 3 (SZ3)
| rowspan="2" | N/A
| rowspan="2" | N/A
| rowspan="2" | N/A
|-
| colspan="3" |Clerical Officer (CO) or Industrial PGSC
|-
| colspan="3" |Clerical Assistant (CA) or Industrial PGSB
| colspan="2" style='background: #ffebd2' |Administrative Assistant (AA) or Industrial Skill Zone 2 (SZ2)
| N/A
| N/A
| N/A
|-
| colspan="3" |Industrial PGSA
| colspan="2" style='background: #ffebd2' |Industrial Skill Zone 1' (SZ1)
| N/A
| N/A
| N/A
|}
|
wikipedia
|
wiki_15404_chunk_13
|
Engineering ethics
|
Institute of Electrical and Electronics Engineers: "We, the members of the IEEE, … do hereby commit ourselves to the highest ethical and professional conduct and agree: 1. to accept responsibility in making decisions consistent with the safety, health and welfare of the public, and to disclose promptly factors that might endanger the public or the environment;"
Institution of Civil Engineers: "Members of the ICE should always be aware of their overriding responsibility to the public good. A member’s obligations to the client can never override this, and members of the ICE should not enter undertakings which compromise this responsibility. The ‘public good’ encompasses care and respect for the environment, and for humanity's cultural, historical and archaeological heritage, as well as the primary responsibility members have to protect the health and well-being of present and future generations."
Professional Engineers Ontario: "A practitioner shall, regard the practitioner's duty to public welfare as paramount."
National Society of Professional Engineers: "Engineers, in the fulfillment of their professional duties, shall: Hold paramount the safety, health, and welfare of the public."
American Society of Mechanical Engineers: "Engineers shall hold paramount the safety, health and welfare of the public in the performance of their professional duties."
Institute of Industrial Engineers: "Engineers uphold and advance the integrity, honor and dignity of the engineering profession by: 2. Being honest and impartial, and serving with fidelity the public, their employers and clients."
American Institute of Chemical Engineers: "To achieve these goals, members shall hold paramount the safety, health and welfare of the public and protect the environment in performance of their professional duties."
American Nuclear Society: "ANS members uphold and advance the integrity and honor of their professions by using their knowledge and skill for the enhancement of human welfare and the environment; being honest and impartial; serving with fidelity the public, their employers, and their clients; and striving to continuously improve the competence and prestige of their various professions."
Society of Fire Protection Engineers: "In the practice of their profession, fire protection engineers must maintain and constantly improve their competence and perform under a standard of professional behavior which requires adherence to the highest principles of ethical conduct with balanced regard for the interests of the public, clients, employers, colleagues, and the profession."
|
wikipedia
|
wiki_38313_chunk_3
|
Lightweight Kernel Operating System
|
Characteristics
Although it is surprisingly difficult to exactly define what a lightweight kernel is, there are some common design goals:
Targeted at massively parallel environments composed of thousands of processors with distributed memory and a tightly coupled network.
Provide necessary support for scalable, performance-oriented scientific applications.
Offer a suitable development environment for parallel applications and libraries.
Emphasize efficiency over functionality.
Maximize the amount of resources (e.g., CPU, memory, and network bandwidth) allocated to the application.
Seek to minimize time to completion for the application.
|
wikipedia
|
wiki_21686_chunk_12
|
Javaris Crittenton
|
|-
| style="text-align:left;"|
| style="text-align:left;"| L.A. Lakers
| 22|| 0 || 7.8 || .491 || .333 || .679 || 1 || .8 || .3 || 0 || 3.3
|-
| style="text-align:left;"|
| style="text-align:left;"| Memphis
| 28 || 0 || 18.1 || .400 || .265 || .697 || 3.2 || 1.2 || 0.1 || 0.4 || 7.4
|-
| style="text-align:left;"|
| style="text-align:left;"| Memphis
| 7 || 0 || 6.3 || .460 || .000 || .455 || 0.9 || 0.7 || .000 || 0.1 || 2.7
|-
| style="text-align:left;"|
| style="text-align:left;"| Washington
| 56 || 10 || 20.2 || .459 || .143 || .593 || 2.9 || 2.6 || 0.1 || 0.7 || 5.3
|-
|- class="sortbottom"
| style="text-align:center;" colspan="2"| Career
| 113 || 10 || 16.4 || .442 || .231 || .638 || 2.4 || 1.8 || .5 || .1 || 5.3
|
wikipedia
|
wiki_23161_chunk_14
|
FAME (database)
|
Expanded managed content provides out-of-the-box data and object models for:
Equity pricing
Corporate bond pricing
Futures, commodities and options
Company and index fundamentals
Company and index estimates
Macro-economic indicators and benchmark construction
FAME 10 provides a number of enhanced features for creating object models, including
Support for longer object names (up to 242 characters) and for assigning unlimited number of user-defined attributes to an object
Support for object names with up to 35 dimensions
December 2010: FAME 10.1 released.
December 2011: FAME 10.2 released.
March 2012: FAME 11.0 released.
June 2012: FAME 11.1 released.
December 2012: FAME 11.2 released.
March 2013: FAME 11.3 released.
June 2014: FAME 11.4 released.
November 2015 : FAME 11.5 released.
|
wikipedia
|
wiki_8203_chunk_2
|
Global Infectious Disease Epidemiology Network
|
The second module follows the epidemiology of individual diseases, including their global background and status in each of 205 countries and regions. All past and current outbreaks of all diseases, in all countries, are described in detail. The user may also access a list of diseases compatible with any combination of agent, vector, vehicle, reservoir and country (for example, one could list all the mosquito-borne flaviviruses of Brazil which have an avian reservoir). Over 30,000 graphs display all the data, and are updated in "real time". These graphs can be used for preparation of PowerPoint displays, pamphlets, lecture notes, etc. Several thousand high-quality images are also available, including clinical lesions, roentgenograms, Photomicrographs and disease life cycles.
|
wikipedia
|
wiki_27985_chunk_16
|
Bees algorithm
|
%% Iterations of the grouped bees algorithm
for i=1:maxIteration % GBA's main loop
beeIndex = 0; % keep track of all bees (i.e, patches)
for g=1:nGroups % for each group of scout bees
for j = 1 : groups(g) % exploit each patch within each group
beeIndex = beeIndex + 1; % increase the counter per each patch
for i = 1 : recruited_bees(g) % for each recruited bees of the group
solution = bee_waggle_dance(sorted_population(beeIndex,1:maxParameters),ngh(g)); % search the neighborhood around selected patch/solution within the radius of ngh
fit = evaluate_fitness(solution); % evaluate the fitness of recently found solution
if fit < sorted_population(beeIndex,maxParameters+1) % A minimization problem: if a better location/patch/solution is found by the recuiter bee
sorted_population(beeIndex,1 : maxParameters+1) = [solution(1 : maxParameters),fit]; % copy new solution and its fitness to the sorted population matrix
end
end
end
end
|
wikipedia
|
wiki_39905_chunk_7
|
Religious and political symbols in Unicode
|
Enclosed Ideographic Supplement block
The Unicode chart for the Enclosed Ideographic Supplement block notes several symbols used for Chinese folk religion:
{| class="wikitable" style="text-align:center"
|-
! Symbol !! Code point !! Name and notes
|-
| || U+1F260 || style="text-align:left" | ROUNDED SYMBOL FOR FU (luck)
|-
| || U+1F261 || style="text-align:left" | ROUNDED SYMBOL FOR LU (prosperity)
|-
| || U+1F262 || style="text-align:left" | ROUNDED SYMBOL FOR SHOU (longevity)
|-
| || U+1F263 || style="text-align:left" | ROUNDED SYMBOL FOR XI (happiness)
|-
| || U+1F264 || style="text-align:left" | ROUNDED SYMBOL FOR SHUANGXI (double happiness, love and marriage)
|-
| || U+1F265 || style="text-align:left" | ROUNDED SYMBOL FOR CAI (wealth)
|}
|
wikipedia
|
wiki_649_chunk_18
|
Beam-powered propulsion
|
Testing
Early in the morning of 2 October 2000 at the High Energy Laser Systems Test Facility (HELSTF), Lightcraft Technologies, Inc. (LTI) with the help of Franklin B. Mead of the U.S. Air Force Research Laboratory and Leik Myrabo set a new world's altitude record of 233 feet (71 m) for its 4.8 inch (12.2 cm) diameter, , laser-boosted rocket in a flight lasting 12.7 seconds. Although much of the 8:35 am flight was spent hovering at 230+ feet, the Lightcraft earned a world record for the longest ever laser-powered free flight and the greatest "air time" (i.e., launch-to-landing/recovery) from a light-propelled object. This is comparable to Robert Goddard's first test flight of his rocket design. Increasing the laser power to 100 kilowatts will enable flights up to a 30-kilometer altitude. Their goal is to accelerate a one-kilogram microsatellite into low Earth orbit using a custom-built, one megawatt ground-based laser. Such a system would use just about 20 dollars' worth of electricity, placing launch costs per kilogram to many times less than current launch costs (which are measured in thousands of dollars).
|
wikipedia
|
wiki_4174_chunk_11
|
Computer-Assisted Passenger Prescreening System
|
Redress process - A system of due process exists whereby aviation passengers determined to pose a threat are either delayed or prohibited from boarding their scheduled flights by TSA may appeal such decisions and correct erroneous information contained in CAPPS II or Secure Flight or other follow-on/successor programs.
Accuracy of databases and effectiveness of Secure Flight - The underlying error rate of the government and private databases that will be used to both establish identity and assign a risk level to a passenger will not produce a large number of false positives that will result in a significant number of passengers being treated mistakenly or security resources being diverted.
Stress testing - TSA has stress-tested and demonstrated the efficacy and accuracy of all search technologies in CAPPS II or Secure Flight or other follow-on/successor programs and has demonstrated that CAPPS II or Secure Flight or other follow-on/successor programs can make an accurate predictive assessment of those passengers who may constitute a threat to aviation.
Internal oversight - The Secretary of Homeland Security has established an internal oversight board to monitor the manner in which CAPPS II or Secure Flight or other follow-on/successor programs are being developed and prepared.
Operational safeguards - TSA has built in sufficient operational safeguards to reduce the opportunities for abuse.
Security measures - Substantial security measures are in place to protect CAPPS II or Secure Flight or other follow-on/successor programs from unauthorized access by hackers or other intruders.
Oversight of system use and operation - TSA has adopted policies establishing effective oversight of the use and operation of the system.
Privacy concerns - There are no specific privacy concerns with the technological architecture of the system.
Modifications with respect to intrastate travel to accommodate states with unique air transportation needs - TSA has, in accordance with the requirements of section 44903 (j)(2)(B) of title 49, United States Code, modified CAPPS II or Secure Flight or other follow-on/successor programs with respect to intrastate transportation to accommodate states with unique air transportation needs and passengers who might otherwise regularly trigger primary selectee status.
Life-cycle cost estimates and expenditure plans - Appropriate life-cycle cost estimates, and expenditure and program plans exist.
|
wikipedia
|
wiki_942_chunk_4
|
CYK algorithm
|
let the input be a string I consisting of n characters: a1 ... an.
let the grammar contain r nonterminal symbols R1 ... Rr, with start symbol R1.
let P[n,n,r] be an array of booleans. Initialize all elements of P to false.
for each s = 1 to n
for each unit production Rv → as
set P[1,s,v] = true
for each l = 2 to n -- Length of span
for each s = 1 to n-l+1 -- Start of span
for each p = 1 to l-1 -- Partition of span
for each production Ra → Rb Rc
if P[p,s,b] and P[l-p,s+p,c] then set P[l,s,a] = true
if P[n,1,1] is true then
I is member of language
else
I is not member of language
|
wikipedia
|
wiki_547_chunk_64
|
Scheme (programming language)
|
Scheme has three different types of equivalence between arbitrary objects denoted by three different equivalence predicates, relational operators for testing equality, eq?, eqv? and equal?:
eq? evaluates to #f unless its parameters represent the same data object in memory;
eqv? is generally the same as eq? but treats primitive objects (e.g. characters and numbers) specially so that numbers that represent the same value are eqv? even if they do not refer to the same object;
equal? compares data structures such as lists, vectors and strings to determine if they have congruent structure and eqv? contents.(R5RS sec. 6.1)
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.