Dataset Viewer
id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_28575_chunk_5
|
Window function (SQL)
|
Example
Window functions allow access to data in the records right before and after the current record. A window function defines a frame or window of rows with a given length around the current row, and performs a calculation across the set of data in the window.
NAME |
------------
Aaron| <-- Preceding (unbounded)
Andrew|
Amelia|
James|
Jill|
Johnny| <-- 1st preceding row
Michael| <-- Current row
Nick| <-- 1st following row
Ophelia|
Zach| <-- Following (unbounded)
In the above table, the next query extracts for each row the values of a window with one preceding and one following row: SELECT
LAG(name, 1)
OVER(ORDER BY name) "prev",
name,
LEAD(name, 1)
OVER(ORDER BY name) "next"
FROM people
ORDER BY nameThe result query contains the following values:
| PREV | NAME | NEXT |
|----------|----------|----------|
| (null)| Aaron| Andrew|
| Aaron| Andrew| Amelia|
| Andrew| Amelia| James|
| Amelia| James| Jill|
| James| Jill| Johnny|
| Jill| Johnny| Michael|
| Johnny| Michael| Nick|
| Michael| Nick| Ophelia|
| Nick| Ophelia| Zach|
| Ophelia| Zach| (null)|
|
wikipedia
|
wiki_19741_chunk_0
|
Gambling mathematics
|
Experiments, events and probability spaces
The technical processes of a game stand for experiments that generate aleatory events. Here are a few examples:
Throwing the dice in craps is an experiment that generates events such as occurrences of certain numbers on the dice, obtaining a certain sum of the shown numbers, and obtaining numbers with certain properties (less than a specific number, higher than a specific number, even, uneven, and so on). The sample space of such an experiment is {1, 2, 3, 4, 5, 6} for rolling one die or {(1, 1), (1, 2), ..., (1, 6), (2, 1), (2, 2), ..., (2, 6), ..., (6, 1), (6, 2), ..., (6, 6)} for rolling two dice. The latter is a set of ordered pairs and counts 6 x 6 = 36 elements. The events can be identified with sets, namely parts of the sample space. For example, the event occurrence of an even number is represented by the following set in the experiment of rolling one die: {2, 4, 6}.
Spinning the roulette wheel is an experiment whose generated events could be the occurrence of a certain number, of a certain color or a certain property of the numbers (low, high, even, uneven, from a certain row or column, and so on). The sample space of the experiment involving spinning the roulette wheel is the set of numbers the roulette holds: {1, 2, 3, ..., 36, 0, 00} for the American roulette, or {1, 2, 3, ..., 36, 0} for the European. The event occurrence of a red number is represented by the set {1, 3, 5, 7, 9, 12, 14, 16, 18, 19, 21, 23, 25, 27, 30, 32, 34, 36}. These are the numbers inscribed on the roulette wheel and table, in red.
Dealing cards in blackjack is an experiment that generates events such as the occurrence of a certain card or value as the first card dealt, obtaining a certain total of points from the first two cards dealt, exceeding 21 points from the first three cards dealt, and so on. In card games we encounter many types of experiments and categories of events. Each type of experiment has its own sample space. For example, the experiment of dealing the first card to the first player has as its sample space the set of all 52 cards (or 104, if played with two decks). The experiment of dealing the second card to the first player has as its sample space the set of all 52 cards (or 104), less the first card dealt. The experiment of dealing the first two cards to the first player has as its sample space a set of ordered pairs, namely all the 2-size arrangements of cards from the 52 (or 104). In a game with one player, the event the player is dealt a card of 10 points as the first dealt card is represented by the set of cards {10β , 10β£, 10β₯, 10β¦, Jβ , Jβ£, Jβ₯, Jβ¦, Qβ , Qβ£, Qβ₯, Qβ¦, Kβ , Kβ£, Kβ₯, Kβ¦}. The event the player is dealt a total of five points from the first two dealt cards is represented by the set of 2-size combinations of card values {(A, 4), (2, 3)}, which in fact counts 4 x 4 + 4 x 4 = 32 combinations of cards (as value and symbol).
In 6/49 lottery, the experiment of drawing six numbers from the 49 generates events such as drawing six specific numbers, drawing five numbers from six specific numbers, drawing four numbers from six specific numbers, drawing at least one number from a certain group of numbers, etc. The sample space here is the set of all 6-size combinations of numbers from the 49.
In draw poker, the experiment of dealing the initial five card hands generates events such as dealing at least one certain card to a specific player, dealing a pair to at least two players, dealing four identical symbols to at least one player, and so on. The sample space in this case is the set of all 5-card combinations from the 52 (or the deck used).
Dealing two cards to a player who has discarded two cards is another experiment whose sample space is now the set of all 2-card combinations from the 52, less the cards seen by the observer who solves the probability problem. For example, if you are in play in the above situation and want to figure out some odds regarding your hand, the sample space you should consider is the set of all 2-card combinations from the 52, less the three cards you hold and less the two cards you discarded. This sample space counts the 2-size combinations from 47.
|
wikipedia
|
wiki_3104_chunk_0
|
Illinois Mathematics and Science Academy
|
{{Infobox school
| name = Illinois Mathematics and Science Academy (IMSA)
| image =
| imagesize = 250px
| caption =
| streetaddress = 1500 Sullivan Rd.
| city = Aurora
| state = Illinois
| zipcode = 60506-1000
| country = United States
| coordinates =
| authority =
| oversight =
| founder = Leon Lederman
| specialist =
| president = Dr. Evan Glazer
| head of school =
| head_label = Paolo Palocios
| head =
| chairperson = Paula Olszewski-Kubilius
| principal = Dr. Comfort Akwaji-Anderson
| director =
| staff = 55
| faculty =
| teaching_staff =
| ceeb =
| avg_class_size =
| ratio =
| SAT =
| ACT = 31
| gender = Coed
| schooltype = Public residential magnet
| endowment =
| budget =
| grades = 10β12
| campus size =
| campus type = Suburban
| conference =
| slogan = To ignite and nurture creative, ethical, scientific minds that advance the human condition
| song =
| fightsong =
| motto =
| accreditation = AdvancED
| mascot =
| mascot image =
| team_name = Titans
| nickname =
| colors = Columbia blue Silver
| yearbook = 'Gallimaufry | newspaper = The Acronym
| established = 1985
| status =
| closed =
| nobel_laureates = 1
| enrollment = 650
| free_label =
| free_text =
| free_label1 =
| free_text1 =
| free_label2 =
| free_text2 =
| free_label3 =
| free_text3 =
| free_label4 =
| free_text4 =
| free_label5 =
| free_text5 =
| picture = IMSA-01.JPG
| homepage =
}}
|
wikipedia
|
wiki_2345_chunk_16
|
Prism (geometry)
|
A 1-polytopic prism is a rectangle, made from 2 translated line segments. It is represented as the product SchlΓ€fli symbol {}Γ{}. If it is square, symmetry can be reduced:
Example: Square, {}Γ{}, two parallel line segments, connected by two line segment sides.
A polygonal prism is a 3-dimensional prism made from two translated polygons connected by rectangles. A regular polygon {p} can construct a uniform n-gonal prism represented by the product {p}Γ{}. If , with square sides symmetry it becomes a cube:
Example: Pentagonal prism, {5}Γ{}, two parallel pentagons connected by 5 rectangular sides.
A polyhedral prism is a 4-dimensional prism made from two translated polyhedra connected by 3-dimensional prism cells. A regular polyhedron {p,Β q} can construct the uniform polychoric prism, represented by the product {p,Β q}Γ{}. If the polyhedron is a cube, and the sides are cubes, it becomes a tesseract: {4,Β 3}Γ{} =
Example: Dodecahedral prism, {5,Β 3}Γ{}, two parallel dodecahedra connected by 12 pentagonal prism sides.
...
|
wikipedia
|
wiki_8588_chunk_30
|
Matrix calculus
|
{|class="wikitable"
|+ Result of differentiating various kinds of aggregates with other kinds of aggregates
! colspan=2 rowspan=2 |
! colspan=2 | Scalar y
! colspan=2 | Column vector y (size mΓ1)
! colspan=2 | Matrix Y (size mΓn)
|-
! Notation !! Type
! Notation !! Type
! Notation !! Type
|-
! rowspan=2 | Scalar x
! Numerator
| rowspan=2 style="text-align:center;" |
| rowspan=2 | Scalar
| rowspan=2 style="text-align:center;" |
| Size-m column vector
| rowspan=2 style="text-align:center;" |
| mΓn matrix
|-
! Denominator
| Size-m row vector
|
|-
! rowspan=2 | Column vector x(size nΓ1)
! Numerator
| rowspan=2 style="text-align:center;" |
| Size-n row vector
| rowspan=2 style="text-align:center;" |
| mΓn matrix
| rowspan=2 style="text-align:center;" |
| rowspan=2 |
|-
! Denominator
| Size-n column vector
| nΓm matrix
|-
! rowspan=2 | Matrix X(size pΓq)
! Numerator
| rowspan=2 style="text-align:center;" |
| qΓp matrix
| rowspan=2 style="text-align:center;" |
| rowspan=2 |
| rowspan=2 style="text-align:center;" |
| rowspan=2 |
|-
! Denominator
| pΓq matrix
|}
|
wikipedia
|
wiki_1266_chunk_25
|
Postcodes in the United Kingdom
|
Notes:
As all formats end with 9AA, the first part of a postcode can easily be extracted by ignoring the last three characters.
Areas with only single-digit districts: BR, FY, HA, HD, HG, HR, HS, HX, JE, LD, SM, SR, WC, WN, ZE (although WC is always subdivided by a further letter, e.g. WC1A)
Areas with only double-digit districts: AB, LL, SO
Areas with a district '0' (zero): BL, BS, CM, CR, FY, HA, PR, SL, SS (BS is the only area to have both a district 0 and a district 10)
The following central London single-digit districts have been further divided by inserting a letter after the digit and before the space: EC1βEC4 (but not EC50), SW1, W1, WC1, WC2 and parts of E1 (E1W), N1 (N1C and N1P), NW1 (NW1W) and SE1 (SE1P).
The letters Q, V and X are not used in the first position.
The letters I, J and Z are not used in the second position.
The only letters to appear in the third position are A, B, C, D, E, F, G, H, J, K, P, S, T, U and W when the structure starts with A9A.
The only letters to appear in the fourth position are A, B, E, H, M, N, P, R, V, W, X and Y when the structure starts with AA9A.
The final two letters do not use C, I, K, M, O or V, so as not to resemble digits or each other when hand-written.
Postcode sectors are one of ten digits: 0 to 9, with 0 only used once 9 has been used in a post town, save for Croydon and Newport (see above).
|
wikipedia
|
wiki_10162_chunk_4
|
Murderous Maths
|
The following are the thirteen books that are available in the series.
Guaranteed to Bend Your Brain (previously Murderous Maths), - (addition, subtraction, multiplication, division, percentages, powers, tessellation, Roman numerals, the development of the "10" and the place system, shortcomings of calculators, prime numbers, time - how the year and day got divided, digital/analogue clocks, angles, introduction to real Mathematicians, magic squares, mental arithmetic, card trick with algebra explanation, rounding and symmetry.) Guaranteed to Mash your Mind (previously More Murderous Maths), (the monomino, domino, tromino, tetromino, pentomino, hexomino and heptomino, length area and volume, dimensions, measuring areas and volumes, basic rectangle and triangle formulas, speed, conversion of units, MΓΆbius strip, Pythagoras, right-angled triangles, irrational numbers, pi, area and perimeter, bisecting angles, triangular numbers, topology networks, magic squares.)Awesome Arithmetricks (previously The Essential Arithmetricks: How to + - Γ Γ·), - (counting, odd even and negative numbers, signs of maths, place value and rounding off, manipulating equations, + - x Γ· %, long division, times tables, estimation, decimal signs, QED.)The Mean & Vulgar Bits (previously The Mean & Vulgar Bits: Fractions and Averages), (fractions, converting improper and mixed fractions, adding subtracting multiplying and dividing fractions, primes and prime factors, reducing fractions, highest common factor and lowest common denominators, Egyptian fractions, comparing fractions, cancelling out fractions, converting fractions to decimals, decimal place system, percentages: increase and decrease, averages: mean mode and median.)Desperate Measures (previously Desperate Measures: Length, Area and Volume), (measuring lines: units and accuracy, old measuring systems, the development of metric, the SI system and powers of ten, shapes, measuring areas and area formulas, weight, angles, measuring volume, Archimedes Principle, density, time and how the modern calendar developed.)Do You Feel Lucky? (previously Do You Feel Lucky: The Secrets of Probability), (chance, tree diagrams, mutually exclusive and independent chances, Pascal's Triangle, permutations and combinations, sampling.)Savage Shapes (previously Vicious Circles and Other Savage Shapes), (signs in geometric diagrams, Loci, constructions: perpendicular bisectors; dropping perpendiculars; bisecting angles, triangles: similar; congruent; equal areas, polygons: regular; irregular; angle sizes and construction, tessellations and Penrose Tiles, origami, circles: chord; tangent; angle theorems, regular solids, Euler's formula, ellipses, Geometric proof of Pythagoras' Theorem.)The Key To The Universe (previously Numbers: The Key To The Universe), (phi, Fibonacci Series, Golden Ratio, properties of Square, Triangle, Cube, Centred Hexagon and Tetrahedral numbers, "difference of two squares", number superstitions, prime numbers, Mersenne primes, tests to see if a number will divide by anything from 2-13 and 19, finger multiplication, binary, octal, and hexadecimal, perfect numbers, tricks of the nine times table, irrational transcendental and imaginary numbers, infinity.)The Phantom X (previously The Phantom X: Algebra), (variables, elementary algebra, brackets, factorising, expanding, and simplifying expressions, solving quadratics and the quadratic formula, "Think of a number" tricks, difference of two squares, coefficients of (a-b)n, linear graphs: co-ordinates; gradients; y intercept, non-linear function graphs including parabolas, simultaneous equations: substitution and elimination, dividing by zero!.)The Fiendish Angletron (previously The Fiendish Angletron: Trigonometry), (scales and ratios in maps and diagrams, protractor and compass, SIN, COS and TAN ratios in right angled triangles, trig on a calculator; normal and inverse, sine and cosine formulas for non-right-angled triangles, triangulation, parallax angles and parsecs, sin/cos/tan relationships, sin wave, bearings.)The Perfect Sausages (previously The Perfect Sausage and other Fundamental Formulas), (areas and volumes, ellipsoids and toruses, number formulas (e.g. triangle, hexagonal), speed, acceleration, stopping time, distance, force, gravity, projectiles, Money: percentages; simple and compound interest, permutations and combinations.)The 5ecret L1fe of Code5 (previously Codes: How to Make Them and Break Them), (patterns, logic and deduction, prime numbers, high powers, modular arithmetic.) Easy Questions, Evil Answers, (formulas, working out square roots by hand, Ο, Pythagoras, paradoxes, problem solving, metric prefixes, large numbers, vectors.)
Related puzzle books have been published also:Professor Fiendish's Book of Diabolical Brain-benders, (mazes, logic, coin problems, number crosswords, shape cutting/rearranging, number squares.)Professor Fiendish's Book of Brain-benders (a smaller version of the above) (same as above)'Sudoku: 100 Fun Number Puzzles, Kakuro and Other Fiendish Number Puzzles, One title that covers many different areas of mathematics has also been released:The Most Epic Book of Maths Ever (previously The Murderous Maths of Everything), ' (prime numbers, Sieve of Eratosthenes, Pythagoras' Theorem, triangular numbers, square numbers, the International Date Line, geometry, geometric constructions, topology, MΓΆbius strips, curves (conic sections and cycloids Golomb Rulers, four-dimensional "Tic Tac Toe", The Golden Ratio, Fibonacci sequence, Logarithmic spirals, musical ratios, Theorems (including Ham sandwich theorem and Fixed point theorem), probability (cards, dice, cluedo etc.), Pascal's Triangle, Sierpinski Triangle, chess board, light years, size and distance of moon and planets, orbit, size of stars, shape of galaxy.)
|
wikipedia
|
wiki_21394_chunk_13
|
Rhind Mathematical Papyrus
|
Book III β Miscellany
The third part of the Rhind papyrus consists of the remainder of the 91 problems, being 61, 61B, 62β82, 82B, 83β84, and "numbers" 85β87, which are items that are not mathematical in nature. This final section contains more complicated tables of data (which frequently involve Horus eye fractions), several pefsu problems which are elementary algebraic problems concerning food preparation, and even an amusing problem (79) which is suggestive of geometric progressions, geometric series, and certain later problems and riddles in history. Problem 79 explicitly cites, "seven houses, 49 cats, 343 mice, 2401 ears of spelt, 16807 hekats." In particular problem 79 concerns a situation in which 7 houses each contain seven cats, which all eat seven mice, each of which would have eaten seven ears of grain, each of which would have produced seven measures of grain. The third part of the Rhind papyrus is therefore a kind of miscellany, building on what has already been presented.
Problem 61 is concerned with multiplications of fractions. Problem 61B, meanwhile, gives a general expression for computing 2/3 of 1/n, where n is odd. In modern notation the formula given is
The technique given in 61B is closely related to the derivation of the 2/n table.
|
wikipedia
|
wiki_918_chunk_19
|
MathML
|
would be marked up using LaTeX syntax like this:
x=\frac{-b \pm \sqrt{b^2 - 4ac}}{2a}
in troff/eqn like this:
x={-b +- sqrt{b sup 2 β 4ac}} over 2a
in Apache OpenOffice Math and LibreOffice Math like this (all three are valid):
x={-b plusminus sqrt {b^2 β 4 ac}} over {2 a}
x={-b +- sqrt {b^2 β 4ac}} over {2a}
x={-b Β± sqrt {b^2 β 4ac}} over {2a}
in AsciiMath like this:
x=(-b +- sqrt(b^2 - 4ac))/(2a)
The above equation could be represented in Presentation MathML as an expression tree made up from layout elements like mfrac or msqrt elements:
<math mode="display" xmlns="http://www.w3.org/1998/Math/MathML">
<semantics>
<mrow>
<mi>x</mi>
<mo>=</mo>
<mfrac>
<mrow>
<mo form="prefix">β</mo>
<mi>b</mi>
<mo>±</mo>
<msqrt>
<msup><mi>b</mi><mn>2</mn></msup>
<mo>β</mo>
<mn>4</mn><mo>⁢</mo><mi>a</mi><mo>⁢</mo><mi>c</mi>
</msqrt>
</mrow>
<mrow>
<mn>2</mn>
<mo>⁢</mo>
<mi>a</mi>
</mrow>
</mfrac>
</mrow>
<annotation encoding="application/x-tex"><!-- TeX -->
x=\frac{-b\pm\sqrt{b^2-4ac}}{2a}
</annotation>
<annotation encoding="StarMath 5.0">
x={-b plusminus sqrt {b^2 - 4 ac}} over {2 a}
</annotation>
<!-- More annotations can be written: application/x-troff-eqn for eqn, application/x-asciimath for AsciiMath... -->
<!-- Semantic MathML go under <annotation-xml encoding="MathML-Content">. -->
</semantics>
</math>
|
wikipedia
|
wiki_6682_chunk_21
|
Ancient Egyptian mathematics
|
Area:
Triangles: The scribes record problems computing the area of a triangle (RMP and MMP).
Rectangles: Problems regarding the area of a rectangular plot of land appear in the RMP and the MMP. A similar problem appears in the Lahun Mathematical Papyri in London.
Circles: Problem 48 of the RMP compares the area of a circle (approximated by an octagon) and its circumscribing square. This problem's result is used in problem 50, where the scribe finds the area of a round field of diameter 9 khet.
Hemisphere: Problem 10 in the MMP finds the area of a hemisphere.
Volumes:
Cylindrical granaries: Several problems compute the volume of cylindrical granaries (RMP 41β43), while problem 60 RMP seems to concern a pillar or a cone instead of a pyramid. It is rather small and steep, with a seked (reciprocal of slope) of four palms (per cubit). In section IV.3 of the Lahun Mathematical Papyri the volume of a granary with a circular base is found using the same procedure as RMP 43.
Rectangular granaries: Several problems in the Moscow Mathematical Papyrus (problem 14) and in the Rhind Mathematical Papyrus (numbers 44, 45, 46) compute the volume of a rectangular granary.
Truncated pyramid (frustum): The volume of a truncated pyramid is computed in MMP 14.
|
wikipedia
|
wiki_27525_chunk_7
|
Magic circle (mathematics)
|
Ding Yidong was a mathematician contemporary with Yang Hui. In his magic circle with 6 rings, the unit numbers of the 5 outer rings, combined with the unit number of the center ring, form the following magic square:
{| class="wikitable"
| 4 || 9 || 2
|-
| 3 || 5 || 7
|-
| 8 || 1 || 6
|}
Method of construction:
Let radial group 1 =1,11,21,31,41
Let radial group 2=2,12,22,32,42
Let radial group 3=3,13,23,33,43
Let radial group 4=4,14,24,34,44
Let radial group 6=6,16,26,36,46
Let radial group 7=7,17,27,37,47
Let radial group 8=8,18,28,38,48
Let radial group 9=9,19,29,39,49
Let center group =5,15,25,35,45
Arrange group 1,2,3,4,6,7,9 radially such that
each number occupies one position on circle
alternate the direction such that one radial has smallest number at the outside, the adjacent radial has largest number outside.
Each group occupies the radial position corresponding to the number on the Luoshu magic square, i.e., group 1 at 1 position, group 2 at 2 position etc.
Finally arrange center group at the center circle, such that
number 5 on group 1 radial
number 10 on group 2 radial
number 15 on group 3 radial
...
number 45 on group 9 radial
|
wikipedia
|
wiki_10935_chunk_9
|
XCOR Aerospace
|
The "multi-year projectβs main objective [was] to produce a flight-ready LOX/LH2 upper-stage engine in the -thrust class that costs significantly less to produce and is easier to operate and integrate than competing engine technologies"<ref name=aw20110323>
{{cite news |last=Morring |first=Frank, Jr. |title=ULA, XCOR to Develop Upper-Stage Engine |url=http://www.aviationweek.com/aw/generic/story.jsp?id=news/awx/2011/03/22/awx_03_22_2011_p0-299850.xml&headline=ULA,%20XCOR%20to%20Develop%20Upper-Stage%20Engine&channel=space |access-date=2011-03-25 |newspaper=Aviation Week |date=2011-03-23 |quote=United Launch Alliance (ULA) and XCOR Aerospace are planning a joint effort to develop a low-cost upper-stage engine in the same class as the venerable RL-10β¦" }}</ref>
|
wikipedia
|
wiki_12541_chunk_5
|
Mathematics in medieval Islam
|
Sharaf al-DΔ«n al-αΉ¬Ε«sΔ« (? in Tus, Iran β 1213/4) developed a novel approach to the investigation of cubic equationsβan approach which entailed finding the point at which a cubic polynomial obtains its maximum value. For example, to solve the equation , with a and b positive, he would note that the maximum point of the curve occurs at , and that the equation would have no solutions, one solution or two solutions, depending on whether the height of the curve at that point was less than, equal to, or greater than a. His surviving works give no indication of how he discovered his formulae for the maxima of these curves. Various conjectures have been proposed to account for his discovery of them.<ref>{{cite journal |last1=Berggren |first1=J. Lennart |title=Innovation and Tradition in Sharaf al-DΔ«n al-αΉ¬Ε«sΔ«'s al-MuΚΏΔdalΔt |jstor=604533 |journal=Journal of the American Oriental Society |volume=110 |issue=2 |year=1990 |pages=304β309 |doi=10.2307/604533 |last2=Al-TΕ«sΔ« |first2=Sharaf Al-DΔ«n |last3=Rashed |first3=Roshdi}}</ref>
|
wikipedia
|
wiki_20600_chunk_2
|
Lehmer's GCD algorithm
|
Say we want to obtain the GCD of the two integers a and b. Let a β₯ b.
If b contains only one digit (in the chosen base, say Ξ² = 1000 or Ξ² = 232), use some other method, such as the Euclidean algorithm, to obtain the result.
If a and b differ in the length of digits, perform a division so that a and b are equal in length, with length equal to m.
Outer loop: Iterate until one of a or b is zero:
Decrease m by one. Let x be the leading (most significant) digit in a, x = a div Ξ² m and y the leading digit in b, y = b div Ξ² m.
Initialize a 2 by 3 matrix
to an extended identity matrix
and perform the euclidean algorithm simultaneously on the pairs (x + A, y + C) and (x + B, y + D), until the quotients differ. That is, iterate as an inner loop:
Compute the quotients w1 of the long divisions of (x + A) by (y + C) and w2 of (x + B) by (y + D) respectively. Also let w be the (not computed) quotient from the current long division in the chain of long divisions of the euclidean algorithm.
If w1 β w2, then break out of the inner iteration. Else set w to w1 (or w2).
Replace the current matrix
|
wikipedia
|
wiki_13449_chunk_13
|
Turing's proof
|
An example to illustrate the first proof
An example: Suppose machine H has tested 13472 numbers and produced 5 satisfactory numbers, i.e. H has converted the numbers 1 through 13472 into S.D's (symbol strings) and passed them to D for test. As a consequence H has tallied 5 satisfactory numbers and run the first one to its 1st "figure", the second to its 2nd figure, the third to its 3rd figure, the fourth to its 4th figure, and the fifth to its 5th figure. The count now stands at N = 13472, R = 5, and B' = ".10011" (for example). H cleans up the mess on its tape, and proceeds:H increments N = 13473 and converts "13473" to symbol string ADRLD. If sub-machine D deems ADLRD unsatisfactory, then H leaves the tally-record R at 5. H will increment the number N to 13474 and proceed onward. On the other hand, if D deems ADRLD satisfactory then H will increment R to 6. H will convert N (again) into ADLRD [this is just an example, ADLRD is probably useless] and βrunβ it using the universal machine U until this machine-under-test (U "running" ADRLD) prints its 6th βfigureβ i.e. 1 or 0. H will print this 6th number (e.g. β0β) in the βoutputβ region of its tape (e.g. Bβ = β.100110β).
|
wikipedia
|
wiki_16770_chunk_9
|
Music and mathematics
|
{|class="wikitable"
!Commonterm
!Examplename
!Hz
!Multiple offundamental
!Ratio ofwithin octave
!Centswithin octave
|-
|Fundamental
|A2
|110
|
|
|
|-
|rowspan=2 style="text-align:center;" |Octave
|rowspan=2 style="text-align:center;" |A3
|rowspan=2 |220
|rowspan=2 style="text-align:center;" |
|
|
|-
|
|
|-
|Perfect Fifth
|E4
|330
|
|
|
|-
|rowspan=2 style="text-align:center;" |Octave
|rowspan=2 style="text-align:center;" |A4
|rowspan=2 |440
|rowspan=2 style="text-align:center;" |
|
|
|-
|
|
|-
|Major Third
|C5
|550
|
|
|
|-
|Perfect Fifth
|E5
|660
|
|
|
|-
|Harmonic seventh
|G5
|770
|
|
|
|-
|rowspan=2 style="text-align:center;" |Octave
|rowspan=2 style="text-align:center;" |A5
|rowspan=2 |880
|rowspan=2 style="text-align:center;" |
|
|
|-
|
|
|}
|
wikipedia
|
wiki_4553_chunk_7
|
American Invitational Mathematics Examination
|
Sample problems Given that where and are positive integers and is as large as possible, find (2003 AIME I #1)
Solution: 839 If the integer is added to each of the numbers , , and , one obtains the squares of three consecutive terms of an arithmetic series. Find . (1989 AIME #7)
Solution: 925 Complex numbers , and are the zeros of a polynomial , and . The points corresponding to , , and in the complex plane are the vertices of a right triangle with hypotenuse . Find . (2012 AIME I #14)
Solution: 375 Note
|
wikipedia
|
wiki_8588_chunk_42
|
Matrix calculus
|
{|class="wikitable" style="text-align: center;"
|+ Identities: scalar-by-matrix
! scope="col" width="175" | Condition
! scope="col" width="10" | Expression
! scope="col" width="100" | Numerator layout, i.e. by XT
! scope="col" width="100" | Denominator layout, i.e. by X
|-
| a is not a function of X ||
| ||
|-
| a is not a function of X, u = u(X) ||
| colspan=2|
|-
| u = u(X), v = v(X) ||
| colspan=2|
|-
| u = u(X), v = v(X) ||
| colspan=2|
|-
| u = u(X) ||
| colspan=2|
|-
| u = u(X) ||
| colspan=2|
|-
| rowspan=2|U = U(X) || rowspan=2|Β Β Β Β
||
||
|-
| colspan=2|Both forms assume numerator layout for
i.e. mixed layout if denominator layout for X is being used.
|- style="border-top: 3px solid;"
| a and b are not functions of X ||
|||
|-
| a and b are not functions of X ||
|||
|-
| a, b and C are not functions of X ||
|||
|-
| a, b and C are not functions of X ||
|||
|- style="border-top: 3px solid;"
| || || colspan=2|
|-
| U = U(X), V = V(X) || || colspan=2|
|-
| a is not a function of X, U = U(X) || || colspan=2|
|-
| 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. using a Taylor series); g(x) is the equivalent scalar function, gβ²(x) is its derivative, and gβ²(X) is the corresponding matrix function || || ||
|-
| A is not a function of X || Β Β Β Β || ||
|-
| A is not a function of X || Β Β Β Β || ||
|-
| A is not a function of X || Β Β Β Β || ||
|-
| A is not a function of X || Β Β Β Β || ||
|-
| A, B are not functions of X || || ||
|-
| A, B, C are not functions of X || || ||
|-
| n is a positive integer || Β Β Β Β || ||
|-
| A is not a function of X, n is a positive integer || Β Β Β Β || ||
|-
| || Β Β Β Β || ||
|-
| || Β Β Β Β || ||
|- style="border-top: 3px solid;"
| || Β Β Β Β || ||
|-
| a is not a function of X ||
|| ||
|-
| A, B are not functions of X || Β Β Β Β || ||
|-
| n is a positive integer || Β Β Β Β || ||
|-
| (see pseudo-inverse) || Β Β Β Β || ||
|-
| (see pseudo-inverse) || Β Β Β Β || ||
|-
| A is not a function of X,X is square and invertible || || ||
|-
| A is not a function of X,X is non-square,A is symmetric || || ||
|-
| A is not a function of X,X is non-square,A is non-symmetric ||
|
|
|}
|
wikipedia
|
wiki_38599_chunk_14
|
List of power stations in Ethiopia
|
{| class="wikitable sortable"
! ICS Solar park
! Location
!class="unsortable"|Coordinates
! Installedcapacity(MWac)
! Capacityfactor
! park size[km2]
! Operationalsince
! Status
! class="unsortable" |Notes
|-
| Metehara
|Metehara
|
|style="text-align:center" data-sort-value="100" | (100)
|style="text-align:center" data-sort-value="0.32"| (0.32)
|style="text-align:center" data-sort-value="2.5"| (2.5)
|style="text-align:center"|
| projectimplementation
| data-sort-value="0" | 1st solar park
|}
No solar-thermal power plants are planned. The first large solar park is considered to be operational by 2019. All solar parks will be operated by private owners equipped with a long-term power purchase agreement.
|
wikipedia
|
wiki_956_chunk_42
|
Unification (computer science)
|
{| style="border: 1px solid darkgray;"
|+ One-sided paramodulation rules
|- border="0"
| align="right" | G βͺ { f(s1,...,sn) β f(t1,...,tn) }
| ; S
| β
| align="right" | G βͺ { s1 β t1, ..., sn β tn }
| ; S|
| Β Β decompose
|-
| align="right" | G βͺ { x β t }
| ; S| β
| align="right" | G { x β¦ t }
|; S{xβ¦t} βͺ {xβ¦t}
| align="right" | if the variable x doesn't occur in t| Β Β eliminate
|-
| align="right" | G βͺ { f(s1,...,sn) β t }
| ; S| β
| align="right" | G βͺ { s1 β u1, ..., sn β un, r β t }
| ; S| align="right" | Β Β if f(u1,...,un) β r is a rule from R| Β Β mutate
|-
| align="right" | G βͺ { f(s1,...,sn) β y }
| ; S|β
| align="right" | G βͺ { s1 β y1, ..., sn β yn, y β f(y1,...,yn) }
| ; S| align="right" | if y1,...,yn are new variables
| Β Β imitate
|}
|
wikipedia
|
wiki_8879_chunk_12
|
HITS algorithm
|
Pseudocode
G := set of pages
for each page p in G do
p.auth = 1 // p.auth is the authority score of the page p
p.hub = 1 // p.hub is the hub score of the page p
for step from 1 to k do // run the algorithm for k steps
norm = 0
for each page p in G do // update all authority values first
p.auth = 0
for each page q in p.incomingNeighbors do // p.incomingNeighbors is the set of pages that link to p
p.auth += q.hub
norm += square(p.auth) // calculate the sum of the squared auth values to normalise
norm = sqrt(norm)
for each page p in G do // update the auth scores
p.auth = p.auth / norm // normalise the auth values
norm = 0
for each page p in G do // then update all hub values
p.hub = 0
for each page r in p.outgoingNeighbors do // p.outgoingNeighbors is the set of pages that p links to
p.hub += r.auth
norm += square(p.hub) // calculate the sum of the squared hub values to normalise
norm = sqrt(norm)
for each page p in G do // then update all hub values
p.hub = p.hub / norm // normalise the hub values
|
wikipedia
|
wiki_21415_chunk_2
|
Software analysis pattern
|
Describing an analysis pattern
While doing Analysis we are trying to understand the problem. Fowler does not detail in his book a formal way to write or to describe analysis patterns. Suggestions have been raised since to have a consistent and uniform format for describing them. Most of them are based on the work from Erich Gamma, Frank Buschmann and Christopher Alexander on patterns (in architecture or computer science). One of them, proposed by Hahsler, has the following structure:
|
wikipedia
|
wiki_80_chunk_40
|
Computer science
|
Overview
"Within more than 70 chapters, every one new or significantly revised, one can find any kind of information and references about computer science one can imagine. [β¦] all in all, there is absolute nothing about Computer Science that can not be found in the 2.5 kilogram-encyclopaedia with its 110 survey articles [β¦]." (Christoph Meinel, Zentralblatt MATH)
"[β¦] this set is the most unique and possibly the most useful to the [theoretical computer science] community, in support both of teaching and research [β¦]. The books can be used by anyone wanting simply to gain an understanding of one of these areas, or by someone desiring to be in research in a topic, or by instructors wishing to find timely information on a subject they are teaching outside their major areas of expertise." (Rocky Ross, SIGACT News)
"Since 1976, this has been the definitive reference work on computer, computing, and computer science. [β¦] Alphabetically arranged and classified into broad subject areas, the entries cover hardware, computer systems, information and data, software, the mathematics of computing, theory of computation, methodologies, applications, and computing milieu. The editors have done a commendable job of blending historical perspective and practical reference information. The encyclopedia remains essential for most public and academic library reference collections." (Joe Accardin, Northeastern Illinois Univ., Chicago)
|
wikipedia
|
wiki_3877_chunk_4
|
Azimuthal quantum number
|
{| class="wikitable"
|+ Quantum subshells for the azimuthal quantum number
|-
! style="text-align: center; vertical-align: bottom;"| AzimuthalnumberΒ (β)
! style="text-align: center; vertical-align: bottom;"| Historicalletter
! style="text-align: center; vertical-align: bottom;"| Maximumelectrons
! style="text-align: center; vertical-align: bottom;"| Historicalname
! style="text-align: left; vertical-align: bottom;"| Shape
|-
| style="text-align: center;"| 0
| style="text-align: center;"| s
| style="text-align: center;"| 2
| sharp || spherical
|-
| style="text-align: center;"| 1
| style="text-align: center;"| p
| style="text-align: center;"| 6
| principal
| three dumbbell-shaped polar-aligned orbitals; one lobe on each pole of the x, y, and z (+ and β axes)
|-
| style="text-align: center;"| 2
| style="text-align: center;"| d
| style="text-align: center;"| 10
| diffuse || nine dumbbells and one doughnut (or βunique shape #1β see this picture of spherical harmonics, third row center)
|-
| style="text-align: center;"| 3
| style="text-align: center;"| f
| style="text-align: center;"| 14
| fundamental || βunique shape #2β (see this picture of spherical harmonics, bottom row center)
|-
| style="text-align: center;"| 4
| style="text-align: center;"| g
| style="text-align: center;"| 18
| ||
|-
| style="text-align: center;"| 5
| style="text-align: center;"| h
| style="text-align: center;"| 22
| ||
|-
| style="text-align: center;"| 6
| style="text-align: center;"| i
| style="text-align: center;"| 26
| ||
|-
| colspan=5 style="text-align: left; text-align: center;" | The letters after the f sub-shell just follow letterΒ f in alphabetical order, except the letterΒ j and those already used.
|}
|
wikipedia
|
wiki_7104_chunk_5
|
Bridge (graph theory)
|
Tarjan's bridge-finding algorithm
The first linear time algorithm for finding the bridges in a graph was described by Robert Tarjan in 1974. It performs the following steps:
Find a spanning forest of
Create a rooted forest from the spanning forest
Traverse the forest in preorder and number the nodes. Parent nodes in the forest now have lower numbers than child nodes.
For each node in preorder (denoting each node using its preorder number), do:
Compute the number of forest descendants for this node, by adding one to the sum of its children's descendants.
Compute , the lowest preorder label reachable from by a path for which all but the last edge stays within the subtree rooted at . This is the minimum of the set consisting of the preorder label of , of the values of at child nodes of and of the preorder labels of nodes reachable from by edges that do not belong to .
Similarly, compute , the highest preorder label reachable by a path for which all but the last edge stays within the subtree rooted at . This is the maximum of the set consisting of the preorder label of , of the values of at child nodes of and of the preorder labels of nodes reachable from by edges that do not belong to .
For each node with parent node , if and then the edge from to is a bridge.
|
wikipedia
|
wiki_33567_chunk_2
|
Network of Conservation Educators and Practitioners
|
Each module includes a Synthesis document that brings together key concepts, applications, and literature for a topic, as well as an easily modified visual Presentation, and a practical Exercise for laboratory or field use. Exercise solutions and teaching notes are also provided for the instructor, as are learning goals and student assessment questions. In addition, interdisciplinary Case Studies integrate key concepts and questions that span the topics of more than one module. The modules are flexible and adaptable resources for professors and trainers in the field of biodiversity conservation and are tailored to the context where they will be used in terms of language and examples. They model the richly interconnected, interdisciplinary, and rapidly evolving nature of the field of conservation biology, and focus on developing the skills needed to decide when, how, and why a tool is the best choice for a particular conservation application. At present, more than 100 complete or partial modules are available for use and testing in several languages (English, Spanish, French, and Lao), and this number is expected to continue to grow. Modules are distributed free of cost to the users, and are available in printed form, on CD-ROM, and in electronic form via the Internet (http://ncep.amnh.org).
|
wikipedia
|
wiki_5483_chunk_23
|
Array programming
|
R
The R language supports array paradigm by default. The following example illustrates a process of multiplication of two matrices followed by an addition of a scalar (which is, in fact, a one-element vector) and a vector:
> A <- matrix(1:6, nrow=2) # !!this has nrow=2 ... and A has 2 rows
> A
[,1] [,2] [,3]
[1,] 1 3 5
[2,] 2 4 6
> B <- t( matrix(6:1, nrow=2) ) # t() is a transpose operator !!this has nrow=2 ... and B has 3 rows --- a clear contradiction to the definition of A
> B
[,1] [,2]
[1,] 6 5
[2,] 4 3
[3,] 2 1
> C <- A %*% B
> C
[,1] [,2]
[1,] 28 19
[2,] 40 28
> D <- C + 1
> D
[,1] [,2]
[1,] 29 20
[2,] 41 29
> D + c(1, 1) # c() creates a vector
[,1] [,2]
[1,] 30 21
[2,] 42 30
|
wikipedia
|
wiki_35152_chunk_16
|
IEEE Nanotechnology Council
|
The Nanotechnology community in Canada is very active. Many IEEE NTC conferences were recently hosted in Canada (e.g., IEEE NANO 2014 in Ottawa) and there is more to come (i.e., IEEE NANO 2021 in MontrΓ©al and IEEE NMDC 2021 in Vancouver). One of the goals of Mr. Berkenbrock is to connect with this dynamic community for supporting students and young professionals and strengthening the presence of the Council in the region. Seeking to achieve this goal, a webinar was co-hosted by IEEE North Saskatchewan Section on December 9th with the presence of speakers from across Canada. The theme of this inaugural webinar was βPerovskites for solar cellsβ with Dr. Saidaminov (University of Victoria, British Columbia) and Dr. Rosei (INRS, QuΓ©bec) as speakers and Mr. Kahwagi from the Koleilatβs research group (Dalhousie University, New Brunswick) as the Moderator. Briefly, in numbers, the event of about one and a half hours had 80 people interested to attend, 60 subscribed and 24 attendees. Afterwards, all those registered received the link to access the recording and a survey about the event. The survey (5) showed the event attracted people from countries beyond the Americas (e.g., Bangladesh, India, Malaysia, and Portugal) and exceeded peopleβs expectations. The next webinar is expected to happen in late January with the theme βMicrodevices and the Pandemicsβ (Please, follow our page on LinkedIn for more info).
|
wikipedia
|
wiki_28756_chunk_27
|
Computational creativity
|
Poetry
More than iron, more than lead, more than gold I need electricity.I need it more than I need lamb or pork or lettuce or cucumber.I need it for my dreams.
Racter, from The Policeman's Beard Is Half Constructed
Like jokes, poems involve a complex interaction of different constraints, and no general-purpose poem generator adequately combines the meaning, phrasing, structure and rhyme aspects of poetry. Nonetheless, Pablo GervΓ‘s has developed a noteworthy system called ASPERA that employs a case-based reasoning (CBR) approach to generating poetic formulations of a given input text via a composition of poetic fragments that are retrieved from a case-base of existing poems. Each poem fragment in the ASPERA case-base is annotated with a prose string that expresses the meaning of the fragment, and this prose string is used as the retrieval key for each fragment. Metrical rules are then used to combine these fragments into a well-formed poetic structure. Racter is an example of such a software project.
|
wikipedia
|
wiki_32762_chunk_7
|
FACT (computer language)
|
Source statements:
P 85 BOND PROCEDURE. WRITE BONDORDER AND SUBTRACT 1 FROM NUM.
P 86
P 87 NOTE. PHASE I OF SAMPLE PROGRAM. THE FOLLOWING PROCEDURES ARE USED TO
P 88 MAKE BATCH CHECKS DURING THE CARD READING PASS.
P 89
P 90 SUMMATION PROCEDURE. ADD RP HOURS TO SUM-OF-HOURS. ADD 1 TO CARDS-IN-
P 91 -BATCH.
P 92
P 93 BATCH-CHECK PROCEDURE. IF BATCH-SUM IS NOT EQUAL TO SUM-OF-HOURS OR BATCH-
P 94 -COUNT IS NOT EQUAL TO CARDS-IN-BATCH SEE BAD-BATCH. SET SUM-OF-HOURS
P 95 AND CARDS-IN-BATCH TO ZERO.
P 96
P 97 BAD-BATCH PROCEDURE. REVERSE NEW-MASTER. CLOSE PAGE OF ERROR-REPORT.
P 98
P 99 L. PUT ZEROS INTO PRINTLINE. SET NUM TO 8.
P 100
P 101 BUILD. PUT EMPLOYNO AND RP HOURS INTO (NUM)TH EN AND EH. SUB-
P 102 TRACT 1 FROM CARDS-IN-BATCH AND NUM. IF CARDS-IN-BATCH IS ZERO WRITE
P 103 ERROR-REPORT, REVERSE NEW-MASTER, LEAVE PROCEDURE. GET NEXT GROUP.
P 104 IF NUM IS ZERO WRITE ERROR-REPORT AND GO TO L, OTHERWISE RETURN TO
P 105 BUILD. END OF PROCEDURE.
|
wikipedia
|
wiki_11781_chunk_14
|
Distribution (differential geometry)
|
Non-integrable ones
The Martinet distribution on is given by , for ; equivalently, it is generated by the vector fields and . It is bracket-generating since , but it is not weakly regular: has rank 3 everywhere except on the surface .
The contact distribution on is given by , for ; equivalently, it is generated by the vector fields and , for . It is weakly regular, with grow vector , and bracket-generating, with . One can also define an abstract contact structures on a manifold as a hyperplane distribution which is maximally non-integrable, i.e. it is as far from being involutive as possible. An analogue of the Darboux theorem shows that such structure has the unique local model described above.
The Engel distribution on is given by , for and ; equivalently, it is generated by the vector fields and . It is weakly regular, with grow vector , and bracket-generating. One can also define an abstract Engel structure on a manifold as a weakly regular rank 2 distribution such that has rank 3 and has rank 4; Engel proved that such structure has the unique local model described above.
In general, a Goursat structure on a manifold is a rank 2 distribution which is weakly regular and bracket-generating, with grow vector . For and one recovers, respectively, contact distributions on 3-dimensional manifolds and Engel distributions. Goursat structures are locally diffeomorphic to the Cartan distribution of the jet bundles .
|
wikipedia
|
wiki_39905_chunk_10
|
Religious and political symbols in Unicode
|
Miscellaneous Symbols and Pictographs block
The Unicode chart for the Miscellaneous Symbols and Pictographs block notes many religious symbols:
{| class="wikitable" style="text-align:center"
! Text !! Emoji !! Code point !! Name and notes
|-
| || || U+1F4FF || style="text-align:left" | PRAYER BEADS
|-
| || || U+1F540 || style="text-align:left" | CIRCLED CROSS POMMEE (Orthodox typicon symbol for great feast service)
|-
| || || U+1F541 || style="text-align:left" | CROSS POMMEE WITH HALF-CIRCLE BELOW (Orthodox typicon symbol for vigil service)
|-
| || || U+1F542 || style="text-align:left" | CROSS POMMEE (Orthodox typicon symbol for Polyeleos)
|-
| || || U+1F543 || style="text-align:left" | NOTCHED LEFT SEMICIRCLE WITH THREE DOTS (Orthodox typicon symbol for lower rank feast)
|-
| || || U+1F544 || style="text-align:left" | NOTCHED RIGHT SEMICIRCLE WITH THREE DOTS (Orthodox typicon symbol for lower rank feast)
|-
| || || U+1F545 || style="text-align:left" | SYMBOL FOR MARKS CHAPTER (Orthodox typicon symbol for difficult sections)
|-
| || || U+1F546 || style="text-align:left" | WHITE LATIN CROSS = cross outline
|-
| || || U+1F547 || style="text-align:left" | HEAVY LATIN CROSS
|-
| || || U+1F548 || style="text-align:left" | CELTIC CROSS
|-
| || || U+1F549 || style="text-align:left" | OM SYMBOL (generic symbol independent of Devanagari font)
|-
| || || U+1F54A || style="text-align:left" | DOVE OF PEACE = peace
|-
| || || U+1F54B || style="text-align:left" | KAABA
|-
| || || U+1F54C || style="text-align:left" | MOSQUE
|-
| || || U+1F54D || style="text-align:left" | SYNAGOGUE
|-
| || || U+1F54E || style="text-align:left" | MENORAH WITH NINE BRANCHES = hanukiah
|}
|
wikipedia
|
wiki_6866_chunk_25
|
Energy return on investment
|
EROI and payback periods of some types of power plants
The following table is a compilation of sources of energy from German Wikipedia. The minimum requirement is a breakdown of the cumulative energy expenses according to material data. Frequently in literature harvest factors are reported, for which the origin of the values is not completely transparent. These are not included in this table. The bold numbers are those given in the respective literature source, the normal printed ones are derived (see Mathematical Description).
|
wikipedia
|
wiki_7922_chunk_14
|
La Selva Biological Station
|
There is a great amount of research conducted at La Selva Biological Station. Each year, more than 240 papers are published from studies performed there. The station has grown and expanded its facilities to include two laboratories, workspaces, an academic center, a workersβ lounge, a researchersβ lounge, a river station, an herbarium, and of course, the surrounding reserve all for research purposes. Researchers can live on site at the station for anywhere between a few days to several months. To accommodate researchers there are cabin dormitories, family housing, a laundry room, a dining hall, and even a gift shop.
Most of the tropical ecology research done by scientists at La Selva is related to one of these topics: interactions among interdependent species, carbon sequestration in forests, effects of climate change on ecosystems, mechanisms of speciation, food web dynamics, and maintenance of biodiversity Since there are many endangered species in tropical areas, a great amount of research is conducted on these species. Many researchers write papers analyzing data illustrating speciesβ decline, and often include thoughts on the conservation efforts needed to preserve them. And because humans are a major factor causing the endangerment of many of these species, mostly through habitat loss from human practices, there is extensive research done on impacts of humans in tropical forests. Research is done both on the effects of large companies conducting oil and mineral exploration, creating plantations, or cattle farming and also on local peoples who live in the forest and use its resources.
|
wikipedia
|
wiki_1739_chunk_16
|
Constraint programming
|
Example
The syntax for expressing constraints over finite domains depends on the host language. The following is a Prolog program that solves the classical alphametic puzzle SEND+MORE=MONEY in constraint logic programming:
% This code works in both YAP and SWI-Prolog using the environment-supplied
% CLPFD constraint solver library. It may require minor modifications to work
% in other Prolog environments or using other constraint solvers.
:- use_module(library(clpfd)).
sendmore(Digits) :-
Digits = [S,E,N,D,M,O,R,Y], % Create variables
Digits ins 0..9, % Associate domains to variables
S #\= 0, % Constraint: S must be different from 0
M #\= 0,
all_different(Digits), % all the elements must take different values
1000*S + 100*E + 10*N + D % Other constraints
+ 1000*M + 100*O + 10*R + E
#= 10000*M + 1000*O + 100*N + 10*E + Y,
label(Digits). % Start the search
|
wikipedia
|
wiki_11778_chunk_14
|
Computer facial animation
|
Face animation languages
Many face animation languages are used to describe the content of facial animation. They can be input to a compatible "player" software which then creates the requested actions. Face animation languages are closely related to other multimedia presentation languages such as SMIL and VRML. Due to the popularity and effectiveness of XML as a data representation mechanism, most face animation languages are XML-based. For instance, this is a sample from Virtual Human Markup Language (VHML):
<vhml>
<person disposition="angry">
First I speak with an angry voice and look very angry,
<surprised intensity="50">
but suddenly I change to look more surprised.
</surprised>
</person>
</vhml>
More advanced languages allow decision-making, event handling, and parallel and sequential actions. The Face Modeling Language (FML) is an XML-based language for describing face animation. FML supports MPEG-4 Face Animation Parameters (FAPS), decision-making and dynamic event handling, and typical programming constructs such as loops. It is part of the iFACE system. The following is an example from FML:
<fml>
<act>
<par>
<hdmv type="yaw" value="15" begin="0" end="2000" />
<expr type="joy" value="-60" begin="0" end="2000" />
</par>
<excl event_name="kbd" event_value="" repeat="kbd;F3_up" >
<hdmv type="yaw" value="40" begin="0" end="2000" event_value="F1_up" />
<hdmv type="yaw" value="-40" begin="0" end="2000" event_value="F2_up" />
</excl>
</act>
</fml>
|
wikipedia
|
wiki_35414_chunk_8
|
Mechanical systems drawing
|
Installation drawing
A drawing which based on the detailed drawing, installation drawing or co-ordination drawing (interface drawing) with the primary purpose of defining that information needed by the tradesmen on site to install the works or concurrently work among various engineering assembly. The main features of typical installation drawings are:
Plan layouts to a scale of at least 1:50, accompanied by cross-sections to a scale of at least 1:20 for all congested areas
A spatially coordinated drawing, i.e., show no physical location clashes between the system components
Allowance for inclusion of all supports and fixtures necessary to install the works
Allowance for the service at its widest point for spaces between pipe and duct runs, for insulation, standard fitting dimensions, and joint widths
Installation details provided from shop drawings
Installation working space; space to facilitate commissioning and space to allow on-going operation and maintenance in accordance with the relevant health and safety requirements
Plant and equipment including alternatives and options
Dimensions where services positioning is important enough not to installers
Plant room layouts to a scale of at least 1:20, accompanied by cross-sections and elevations to a scale of at least 1:20
|
wikipedia
|
wiki_8335_chunk_24
|
Physics (Aristotle)
|
Also includes On Coming-To-Be and Ceasing-To-Be I.4-5; On The Generation Of Animals I.22.
Includes Physics I-II, III.1, VIII.
This is the oldest of Loeb 255, reprinted or reissued many times subsequently under different subseries: Volume 5 of a 23-volume Aristotle set or Volume 2 of a 2-volume Aristotle Physics set. The terminology Volume 5, Volume 2, Volume 255 is apt to be confusing. Whatever the volume and printing date, Loeb 255 is still in copyright and therefore cannot be offered as a work in the public domain.
Scanned as is. Includes the translators' emphases and divisions within chapters.
Formatted text divided into books and chapters only.
Minimally formatted text divided into books and "parts." Book IV is incomplete.
Single text file arranged in paragraphs.
Minimally formatted single pages accessed one at a time.
Single pdf file of books and chapters.
This is the oldest of Loeb 228, reprinted or reissued many times subsequently under different subseries: Volume 4 of a 23-volume Aristotle set or Volume 1 of a 2-volume Aristotle Physics set. The terminology Volume 4, Volume 1, Volume 228 is apt to be confusing. Whatever the volume and printing date, Loeb 228 is still in copyright and therefore cannot be offered as a work in the public domain.
|
wikipedia
|
wiki_7775_chunk_4
|
Embodied energy
|
Methodologies
Embodied energy analysis is interested in what energy goes to supporting a consumer, and so all energy depreciation is assigned to the final demand of consumer. Different methodologies use different scales of data to calculate energy embodied in products and services of nature and human civilization. International consensus on the appropriateness of data scales and methodologies is pending. This difficulty can give a wide range in embodied energy values for any given material. In the absence of a comprehensive global embodied energy public dynamic database, embodied energy calculations may omit important data on, for example, the rural road/highway construction and maintenance needed to move a product, marketing, advertising, catering services, non-human services and the like. Such omissions can be a source of significant methodological error in embodied energy estimations. Without an estimation and declaration of the embodied energy error, it is difficult to calibrate the sustainability index, and so the value of any given material, process or service to environmental and economic processes.
|
wikipedia
|
wiki_21574_chunk_4
|
Fortune's algorithm
|
let be the transformation ,
where is the Euclidean distance between and the nearest site
let be the "beach line"
let be the region covered by site .
let be the boundary ray between sites and .
let be a set of sites on which this algorithm is to be applied.
let be the sites extracted from with minimal -coordinate, ordered by -coordinate
let DeleteMin() be the act of removing the lowest and leftmost site of (sort by y unless they're identical, in which case sort by x)
let be the Voronoi map of which is to be constructed by this algorithm
create initial vertical boundary rays
while not IsEmpty() do
β DeleteMin()
case of
is a site in :
find the occurrence of a region in containing ,
bracketed by on the left and on the right
create new boundary rays and with bases
replace with in
delete from any intersection between and
insert into any intersection between and
insert into any intersection between and
is a Voronoi vertex in :
let be the intersection of on the left and on the right
let be the left neighbor of and
let be the right neighbor of in
create a new boundary ray if ,
or create if is right of the higher of and ,
otherwise create
replace with newly created in
delete from any intersection between and
delete from any intersection between and
insert into any intersection between and
insert into any intersection between and
record as the summit of and and the base of
output the boundary segments and
endcase
endwhile
output the remaining boundary rays in
|
wikipedia
|
wiki_15788_chunk_0
|
List of MeSH codes
|
The following is a list of the codes for MeSH (Medical Subject Headings), a comprehensive controlled vocabulary for the purpose of indexing journal articles and books in the life sciences. It is a product of the United States National Library of Medicine (NLM). The prefixes (A01, etc.) are linked to more extensive sub-lists of codes; the medical terms are linked to articles on those topics. The source for this content is the set of 2006 MeSH Trees from NLM.
|
wikipedia
|
wiki_815_chunk_65
|
ReedβSolomon error correction
|
Decoder
Now the decoding part:
function [decoded, error_pos, error_mag, g, S] = rsDecoder(encoded, m, prim_poly, n, k)
% RSDECODER Decode a Reed-Solomon encoded message
% Example:
% [dec, ~, ~, ~, ~] = rsDecoder(enc_msg, 8, 301, 12, numel(msg))
max_errors = floor((n - k) / 2);
orig_vals = encoded.x;
% Initialize the error vector
errors = zeros(1, n);
g = [];
S = [];
% Get the alpha
alpha = gf(2, m, prim_poly);
% Find the syndromes (Check if dividing the message by the generator
% polynomial the result is zero)
Synd = polyval(encoded, alpha .^ (1:n - k));
Syndromes = trim(Synd);
% If all syndromes are zeros (perfectly divisible) there are no errors
if isempty(Syndromes.x)
decoded = orig_vals(1:k);
error_pos = [];
error_mag = [];
g = [];
S = Synd;
return;
end
% Prepare for the euclidean algorithm (Used to find the error locating
% polynomials)
r0 = [1, zeros(1, 2 * max_errors)]; r0 = gf(r0, m, prim_poly); r0 = trim(r0);
size_r0 = length(r0);
r1 = Syndromes;
f0 = gf([zeros(1, size_r0 - 1) 1], m, prim_poly);
f1 = gf(zeros(1, size_r0), m, prim_poly);
g0 = f1; g1 = f0;
% Do the euclidean algorithm on the polynomials r0(x) and Syndromes(x) in
% order to find the error locating polynomial
while true
% Do a long division
[quotient, remainder] = deconv(r0, r1);
% Add some zeros
quotient = pad(quotient, length(g1));
% Find quotient*g1 and pad
c = conv(quotient, g1);
c = trim(c);
c = pad(c, length(g0));
% Update g as g0-quotient*g1
g = g0 - c;
% Check if the degree of remainder(x) is less than max_errors
if all(remainder(1:end - max_errors) == 0)
break;
end
% Update r0, r1, g0, g1 and remove leading zeros
r0 = trim(r1); r1 = trim(remainder);
g0 = g1; g1 = g;
end
% Remove leading zeros
g = trim(g);
% Find the zeros of the error polynomial on this galois field
evalPoly = polyval(g, alpha .^ (n - 1 : - 1 : 0));
error_pos = gf(find(evalPoly == 0), m);
% If no error position is found we return the received work, because
% basically is nothing that we could do and we return the received message
if isempty(error_pos)
decoded = orig_vals(1:k);
error_mag = [];
return;
end
% Prepare a linear system to solve the error polynomial and find the error
% magnitudes
size_error = length(error_pos);
Syndrome_Vals = Syndromes.x;
b(:, 1) = Syndrome_Vals(1:size_error);
for idx = 1 : size_error
e = alpha .^ (idx * (n - error_pos.x));
err = e.x;
er(idx, :) = err;
end
% Solve the linear system
error_mag = (gf(er, m, prim_poly) \ gf(b, m, prim_poly))';
% Put the error magnitude on the error vector
errors(error_pos.x) = error_mag.x;
% Bring this vector to the galois field
errors_gf = gf(errors, m, prim_poly);
% Now to fix the errors just add with the encoded code
decoded_gf = encoded(1:k) + errors_gf(1:k);
decoded = decoded_gf.x;
end
|
wikipedia
|
wiki_31651_chunk_12
|
Functional flow block diagram
|
Contextual and administrative data
Each FFBD shall contain the following contextual and administrative data:
Date the diagram was created
Name of the engineer, organization, or working group that created the diagram
Unique decimal delimited number of the function being diagrammed
Unique function name of the function being diagrammed.
Figure 8 and Figure 9 present the data in an FFBD. Figure 9 is a decomposition of the function F2 contained in Figure 8 and illustrates the context between functions at different levels of the model.
|
wikipedia
|
wiki_28077_chunk_3
|
Tracker (business software)
|
Stang, D. (2011, June 13). MarketScope for Project and Portfolio Management Applications. Gartner. Retrieved May 5, 2012, from http://www.gartner.com/id=1724626.
Levine, R. (2011, February 26). TrackerSuite.Net 3.6 Review. Bright Hub. Retrieved March 8, 2011, from http://www.brighthub.com/office/project-management/reviews/108262.aspx.
(2009, August 17). Products to Watch. eWeek. Retrieved August 21, 2009, from http://www.eweek-digital.com/eweek/20090817/?pg=45#pg45.
Levine, R. (2009, July 30). Top 5 Project Management Cartoons. Bright Hub. Retrieved August 2, 2009, from http://www.brighthub.com/office/project-management/articles/13681.aspx.
(2007, May). Lotus Advisor Editors' Choice Awards 2007. IBM Lotus Advisor. Retrieved January 16, 2008, from https://web.archive.org/web/20080507192328/http://my.advisor.com/doc/18931.
(2006, May). Lotus Advisor Editors' Choice Awards 2006. IBM Lotus Advisor. Retrieved January 16, 2008, from https://web.archive.org/web/20090428015658/http://my.advisor.com/doc/18957.
Nelson, K. (2004, September 14). Bristol West Moves to PPM. Insurance & Technology Online. Retrieved January 16, 2008, from https://web.archive.org/web/20061019223414/http://www.insurancetech.com/news/showArticle.jhtml?articleID=47205294
Bonasia, J. (2004, August 5). Managers Cautiously Using Employee 'Tracking' Software. Investor's Business Daily. Retrieved January 16, 2008, from http://www.accessmylibrary.com/coms2/summary_0286-8786107_ITM.
Pickett, P. (2004, September 3). Drilling Down to the Heart of the Task. ITWorld Canada. Retrieved January 16, 2008, from http://www.itworldcanada.com/Pages/Docbase/ViewArticle.aspx?ID=idgml-766b7948-6411-4980-bf50-db9be02f93e3.
(2002, December). Lotus Advisor Excellence Awards. IBM Lotus Advisor. Retrieved January 16, 2008, from https://web.archive.org/web/20080930170548/http://my.advisor.com/doc/11420.
Lombardo, C. (2002, December). T&B Software: About Time- And More. Accounting Technology. Retrieved January 16, 2008, from http://www.accessmylibrary.com/coms2/summary_0286-26944159_ITM.
Dauten, D. (2002, November 3). Going With the Flow Innovative Way to Grow. Chicago Tribune. Retrieved January 16, 2008, from https://pqasb.pqarchiver.com/chicagotribune/access/230358361.html?dids=230358361:230358361&FMT=ABS&FMTS=ABS:FT.
George, T. (2002, June 10). DuPont Plays the Match Game. InformationWeek. Retrieved January 16, 2008, from http://www.informationweek.com/news/showArticle.jhtml?articleID=6504515.
Fox, P. (2002, April 22). Tapping the Right Tools. ComputerWorld.com. Retrieved January 16, 2008, from https://web.archive.org/web/20070302144543/http://www.computerworld.com/action/article.do?command=viewArticleBasic.
(2002, February). Sanyo Succeeds with Automation Centre's Personnel Tracker. EproMag.com.
Moore, C. (2002, January 30). Lotusphere Showcases Messaging, Collaboration Software. InfoWorld. Retrieved January 16, 2008, from https://web.archive.org/web/20080121101838/http://www.infoworld.com/articles/hn/xml/02/01/30/020130hnlotuswrap.html
Sullivan, Laurie. (2002, January 15). Pioneer-Standard Invests in Collaborative Software. EBN.com. Retrieved January 16, 2008, from http://www.alacrastore.com/storecontent/bni/25105125.
Tillet, S. (2002, January 7). Project Mgm't Automated. Internet Week. Retrieved January 16, 2008, from HighBeam.
Sanborn, S. and Moore, C. (2001, December 7). Collaboration Comes Together. InfoWorld. Retrieved January 16, 2008 from https://web.archive.org/web/20050223100842/http://www.infoworld.com/articles/fe/xml/01/12/10/011210fecollab.html.
Moore, C. (2001, October 22). Collaboration Burrows Into Biz Apps. InfoWorld. Retrieved January 16, 2008 from https://web.archive.org/web/20050325171048/http://www.infoworld.com/articles/fe/xml/01/10/22/011022feedge.html
|
wikipedia
|
wiki_37376_chunk_12
|
Speakeasy (computational environment)
|
Depending on a specific setting, missing values can be represented by the above notation, by a question mark symbol, or a blank (useful in tables). When used in input the question mark is interpreted as an N.A. missing value.
:_ b=timeseries(1,2,3,4 : 2010 1 4)
:_ b
B (A Time Series with 4 Components)
1 2 3 4
:_ b(2010 3) = ?
:_ showmval qmark
:_ b
B (A Time Series with 4 Components)
1 2 ? 4
:_ 1/b
1/B (A Time Series with 4 Components)
1 .5 ? .25
:_ showmval explain
:_ b
B (A Time Series with 4 Components)
1 2 N.A. 4
:_ 1/b
1/B (A Time Series with 4 Components)
1 .5 N.C. .25
|
wikipedia
|
wiki_2790_chunk_4
|
Binary Golay code
|
Constructions
Lexicographic code: Order the vectors in V lexicographically (i.e., interpret them as unsigned 24-bit binary integers and take the usual ordering). Starting with w0 = 0, define w1, w2, ..., w12 by the rule that wn is the smallest integer which differs from all linear combinations of previous elements in at least eight coordinates. Then W can be defined as the span of w1, ..., w12.
Mathieu group: Witt in 1938 published a construction of the largest Mathieu group that can be used to construct the extended binary Golay code.
Quadratic residue code: Consider the set N of quadratic non-residues (mod 23). This is an 11-element subset of the cyclic group Z/23Z. Consider the translates t+N of this subset. Augment each translate to a 12-element set St by adding an element β. Then labeling the basis elements of V by 0, 1, 2, ..., 22, β, W can be defined as the span of the words St together with the word consisting of all basis vectors. (The perfect code is obtained by leaving out β.)
As a cyclic code: The perfect G23 code can be constructed via the factorization of over the binary field GF(2):
|
wikipedia
|
wiki_15482_chunk_6
|
Human Protein Reference Database
|
There are other databases that deal with human proteome (e.g. BioGRID, BIND, DIP, HPRD, IntAct, MINT, MIPS, PDZBase and Reactome). Each database has its own style of presenting the data. It is a difficult task for most investigators to compare the voluminous data from these databases in order to conclude strengths and weaknesses of each database. Mathivanan and colleagues tried to address this issue while analyzing protein data by asking various questions. This analysis will help biologists to choose among these databases based on their needs. References
|
wikipedia
|
wiki_33960_chunk_28
|
Renewable energy in Canada
|
One consideration of ocean energy not to be overlooked is the concurrent development and use of the ocean and its resources by all manners of industries, hobbyists, and wildlife. Power production facilities require their own space and can become danger to the animals and humans that get too close. One proposed solution that is seeing success along the North-East coast of Europe is Marine Spatial Planning, where instead of the free for all that naturally developed as humans increased their use of the ocean through fishing, transportation and industry, the government steps in to assign distinguished areas for each of these activities. In an area as small and densely trafficked, Marine Spatial Planning could be a great tool in the development and testing of ocean energy technologies in Canada.
|
wikipedia
|
wiki_24026_chunk_21
|
Multiservice tactical brevity code
|
W
Wall Three or more groups or contacts primarily split in azimuth.
Warning (color) Hostile attack is
RED imminent or in progress.
YELLOW probable.
WHITE improbable (all clear).
Weapons (followed by appropriate modifier below) Fire only;
FREE at targets not identified as friendly in accordance with current rules of engagement (ROE).
TIGHT at targets positively identified as hostile in accordance with current ROE.
HOLD* (USA, USMC) in self-defense or in response to a formal order.
SAFE (USN) NOTE: USN and NATO use weapons safe to avoid confusion with the phrase hold fire.
Weeds Indicates that fixed-wing aircraft are operating below above ground level.
What luck Request for results of missions or tasks.
What state Report amount of fuel and missiles remaining. Ammunition and oxygen are reported only when specifically requested or critical.
Active = number of active radar missiles remaining.
Radar = number of semi-active radar missiles remaining.
Heat = number of IR missiles remaining.
Fuel = pounds of fuel or time remaining.
Wilco Will comply
Winchester No ordnance remaining, can be used to refer to specific types ordnance or all ordnance.
Woodpecker Close in weapons system (CIWS).
Words Directive or interrogative regarding further information or directives pertinent to mission.
Working
A suppression of enemy air defenses (SEAD) aircraft is gathering electronic order of battle (EOB) (which emitter controls the operations of other emitters) on a designated emitter; generally followed by signal type, (SAM/AAA/group) bearing, and range, if able.
Aircraft executing electronic identification (EID) on a specific aircraft/group to obtain identification necessary for beyond visual range (BVR) employment.
|
wikipedia
|
wiki_594_chunk_48
|
Tree (data structure)
|
In computing, a common way to define well-founded trees is via recursive ordered pairs
: a tree is a forest together with a "fresh" node . A forest in turn is a possibly empty set of trees with pairwise disjoint sets of nodes. For the precise definition, proceed similarly as in the construction of names used in the set-theoretic technique of forcing. Let be a set of nodes. In the superstructure over , define sets , of trees and forests, respectively, and a map assigning each tree its underlying set of nodes so that:
{| cellpadding=0 style="border:0;"
|- style="vertical-align:top;"
| (trees over )
|
|
| style="width: 3em; text-align: center;" | β
| is a pair from such that for all , ,
|- style="vertical-align:top;"
| (forests over )
|
|
| style="text-align: center;" | β
| is a subset of such that for every , ,
|- style="vertical-align:top;"
| (nodes of trees)
|
|
| style="text-align: center;" | β
| and either or for some .
|}
|
wikipedia
|
wiki_39905_chunk_8
|
Religious and political symbols in Unicode
|
Miscellaneous Symbols block
The Unicode chart for the Miscellaneous Symbols block has a section explicitly labelled "Religious and political symbols":
{| class="wikitable" style="text-align:center"
|-
! Text !! Emoji !! Code point !! Name and notes
|-
| || || U+2626 || style="text-align:left" | ORTHODOX CROSS
|-
| || || U+2627 || style="text-align:left" | CHI RHO = Constantine's cross, Christogram β 2CE9 coptic symbol khi ro
|-
| || || U+2628 || style="text-align:left" | CROSS OF LORRAINE
|-
| || || U+2629 || style="text-align:left" | CROSS OF JERUSALEM β 1F70A alchemical symbol for vinegar
|-
| || || U+262A || style="text-align:left" | STAR AND CRESCENT
|-
| || || U+262B || style="text-align:left" | FARSI SYMBOL = symbol of Iran (1.0)
|-
| || || U+262C || style="text-align:left" | ADI SHAKTI = Gurmukhi khanda - ΰ¨ΰ©°ΰ¨‘ΰ¨Ύ
|-
| || || U+262D || style="text-align:left" | HAMMER AND SICKLE
|-
| || || U+262E || style="text-align:left" | PEACE SYMBOL
|-
| || || U+262F || style="text-align:left" | YIN YANG β 0FCA Tibetan symbol nor bu nyis -khyil
|-
| || || U+26E7 || style="text-align:left" | INVERTED PENTAGRAM
|}
Elsewhere in the block is:
{| class="wikitable" style="text-align:center"
|-
! Text !! Emoji !! Code point !! Name and notes
|-
| || || U+26E9 || style="text-align:left" | SHINTO SHRINE
|}
|
wikipedia
|
wiki_12666_chunk_17
|
Dynamic energy budget theory
|
The general methodology of estimation of DEB parameters from data is described in van der Meer 2006; Kooijman et al 2008 shows which particular compound parameters can be estimated from a few simple observations at a single food density and how an increasing number of parameters can be estimated if more quantities are observed at several food densities. A natural sequence exists in which parameters can be known in principle. In addition, routines for data entry and scripts for parameter estimation are available as a free and documented software package DEBtool, aiming to provide a ready-to-use tool for users with less mathematical and programing background. Number of parameters, also pointed as relatively sparse for a bioenergetic model, vary depending on the main application and, because the whole life cycle of an organism is defined, the overall number of parameters per data-set ratio is relatively low. Linking the DEB (abstract) and measured properties is done by simple mathematical operations which include auxiliary parameters (also defined by the DEB theory and included in the DEBtool routines), and include also switching between energy-time and mass-time contexts. Add my pet (AmP) project explores parameter pattern values across taxa. The DEB notation is a result of combining the symbols from the main fields of science (biology, chemistry, physics, mathematics) used in the theory, while trying to keep the symbols consistent. As the symbols themselves contain a fair bit of information (see DEB notation document), they are kept in most of the DEB literature.
|
wikipedia
|
wiki_18998_chunk_4
|
The Engineering of Consent
|
The essay first appeared in the Annals of the American Academy of Political and Social Science. The author's observations in the essay include the following:
The United States has become a small room where a single whisper is magnified thousands of times.
There are two divisions in media: commercial and organized group information systems.
Todayβs leaders have become more remote physically from the public, yet, at the same time, the public has much greater familiarity with these leaders through the system of modern communications...Increased influence of mass media is due to widespread and enormously rapid diffusion of literacy.
With the aid of technicians in the field who have specialized in utilizing the channels of communications, [some leaders] have been able to achieve purposefully and scientifically what we have termed "the engineering of consent".
The freedoms of press, speech, petition and assembly, the freedoms which make the engineering of consent possible, are among the most cherished guarantees in the Constitution of the United States.
Under no circumstances should the engineering of consent supersede or displace the educational system, either formal or informal, in bringing about understanding by the people as the basis for their actions. The engineering of consent often does supplement the educational process.
The chief function [of the profession] is to analyze objectively and realistically the position of its client vis-a-vis a public, and to advise as to the necessary corrections in its clientβs attitudes towards and approaches to that public.
It must be remembered of course that good will, the basis of lasting adjustment, can be preserved in the long run, only by those whose actions warrant it... The public relations counsel has the professional responsibility to push only those ideas that he can respect, and not to promote causes or accept assignments for clients he considers anti-social.
As in physical engineering, a feasibility study must be done and a budget drawn up.
The engineer of consent must be powerfully equipped with facts, with truths, with evidence before he shows himself before a public.
Bernays recommends World Almanac with lists of thousands of associations across the United States β a cross-section of the country.
The publicβs attitudes, ideas, presumptions or prejudices result from definite influences. One must try to find out what they are in any situation in which one is working.
Democratic society is actually only a loose aggregate of constituent groups...To influence the public, the engineer of consent works with and through group leaders and opinion moulders on every level.
Research furnishes the equivalent of the mariner's chart, the architect's blue print, the traveler's road map.
Themes must appeal to the motives of the public. Motives are the activation of both conscious and subconscious pressure created by the force of desires
Organization also correlates the activities of any specialists who may be called upon from time to time, such as opinion researchers, fund raisers, publicity men, radio and motion picture experts, specialists for women's clubs or foreign language groups, and the like.
Set in motion a broad activity, the success of which depends on interlocking all phases and elements of the proposed strategy, implemented by tactics that are timed to the moment of maximum effectiveness.
The developing of events and circumstances that are not routine is one of the basic functions of the engineer of consent.
|
wikipedia
|
wiki_5545_chunk_5
|
Holland Codes
|
Tracey and Rounds's octagonal model
In the United States, the energetic trial is being made with the aim of the new model which surpasses Holland hexagon model in 1990's. Tracey & Rounds's octagonal model is one such example. Based on the empirical data, they argue that occupational interests can be placed circularly in a two-dimensional plane consisting of People/Things and Data/ldeas axes, and the number of regions can be arbitrarily determined. According to their model, only Holland's hexagonal model does not adequately represent the structure of occupational interest, and it is possible to retain validity as an octagonal or 16 square model if necessary.
|
wikipedia
|
wiki_16245_chunk_22
|
Gadfly (database)
|
Introspection
By default a gadfly database automatically includes "introspective" tables which allow a gadfly query to "query the shape of the database"βfor example to view table names and names of rows in tables:
>>> g = gadfly()
>>> g.startup("dbtest", "dbtest")
>>> c = g.cursor()
>>> c.execute("select * from __table_names__")
>>> print c.pp()
IS_VIEW | TABLE_NAME
=========================
1 | __TABLE_NAMES__
1 | DUAL
1 |
1 |
1 |
1 |
Here DUAL is a standard one row/one column test table (from the Oracle tradition) and the other tables provide information about the database schema:
>>> c.execute("create table t1 (a varchar, b varchar)")
>>> c.execute("create table t2 (b varchar, c varchar)")
>>> c.execute("create unique index t1a on t1(a)")
>>> c.execute("create index t1b on t1(b)")
>>> c.execute("select * from __table_names__")
>>> print c.pp()
IS_VIEW | TABLE_NAME
=========================
0 | T1
1 |
1 |
0 | T2
1 | __TABLE_NAMES__
1 |
1 | DUAL
1 |
>>> c.execute("select * from __columns__")
>>> print c.pp()
COLUMN_NAME | TABLE_NAME
=============================
A | T1
B | T1
NAME |
DEFN |
INDEX_NAME |
TABLE_NAME |
IS_UNIQUE |
TABLE_NAME | __TABLE_NAMES__
IS_VIEW | __TABLE_NAMES__
B | T2
C | T2
COLUMN1 | DUAL
TABLE_NAME |
COLUMN_NAME |
INDEX_NAME |
COLUMN_NAME |
>>> c.execute("select * from __indices__")
>>> print c.pp()
IS_UNIQUE | TABLE_NAME | INDEX_NAME
===================================
0 | T1 | T1B
1 | T1 | T1A
>>> c.execute("select * from __indexcols__")
>>> print c.pp()
COLUMN_NAME | INDEX_NAME
========================
B | T1B
A | T1A
>>> c.execute("select * from dual")
>>> print c.pp()
COLUMN1
=======
0
|
wikipedia
|
wiki_8588_chunk_49
|
Matrix calculus
|
{|class="wikitable" style="text-align: center;"
|+ Differential identities: matrix
! Condition !! Expression !! Result (numerator layout)
|-
|A is not a function of X || ||
|-
|a is not a function of X || ||
|-
| || ||
|-
| || ||
|-
| (Kronecker product) || ||
|-
| (Hadamard product) || ||
|-
| || ||
|-
|
|
|
|-
| (conjugate transpose) || ||
|-
| n is a positive integer || ||
|-
|
|
|
|-
|
|
|
|-
| is diagonalizable
f is differentiable at every eigenvalue
|
|
|}
In the last row, is the Kronecker delta and is the set of orthogonal projection operators that project onto the k-th eigenvector of X.
Q is the matrix of eigenvectors of , and are the eigenvalues.
The matrix function is defined in terms of the scalar function for diagonalizable matrices by
where with .
|
wikipedia
|
wiki_33196_chunk_17
|
Relationships among probability distributions
|
Consequences of the CLT:
If X is a Poisson random variable with large mean, then for integers j and k, P(j β€ X β€ k) approximately equals to P(j β 1/2 β€ Y β€ k + 1/2) where Y is a normal distribution with the same mean and variance as X.
If X is a binomial(n, p) random variable with large np and n(1Β βΒ p), then for integers j and k, P(j β€ X β€ k) approximately equals to P(j β 1/2 β€ Y β€ k + 1/2) where Y is a normal random variable with the same mean and variance as X, i.e. np and np(1Β βΒ p).
If X is a beta random variable with parameters Ξ± and Ξ² equal and large, then X approximately has a normal distribution with the same mean and variance, i. e. mean Ξ±/(Ξ± + Ξ²) and variance Ξ±Ξ²/((Ξ± + Ξ²)2(Ξ± + Ξ² + 1)).
If X is a gamma(Ξ±, Ξ²) random variable and the shape parameter Ξ± is large relative to the scale parameter Ξ², then X approximately has a normal random variable with the same mean and variance.
If X is a Student's t random variable with a large number of degrees of freedom Ξ½ then X approximately has a standard normal distribution.
If X is an F(Ξ½, Ο) random variable with Ο large, then Ξ½X is approximately distributed as a chi-squared random variable with Ξ½ degrees of freedom.
|
wikipedia
|
wiki_37773_chunk_16
|
Statistics education
|
United Kingdom
In the United Kingdom, at least some statistics has been taught in schools since the 1930s. At present, A-level qualifications (typically taken by 17- to 18-year-olds) are being developed in "Statistics" and "Further Statistics". The coverage of the former includes: Probability; Data Collection; Descriptive Statistics; Discrete Probability Distributions; Binomial Distribution; Poisson Distributions; Continuous Probability Distributions; The Normal Distribution; Estimation; Hypothesis Testing; Chi-Squared; Correlation and Regression. The coverage of "Further Statistics" includes: Continuous Probability Distributions; Estimation; Hypothesis Testing; One Sample Tests; Hypothesis Testing; Two Sample Tests; Goodness of Fit Tests; Experimental Design; Analysis of Variance (Anova); Statistical Process Control; Acceptance Sampling. The Centre for Innovation in Mathematics Teaching (CIMT) has online course notes for these sets of topics. Revision notes for an existing qualification indicate a similar coverage. At an earlier age (typically 15β16 years) GCSE qualifications in mathematics contain "Statistics and Probability" topics on: Probability; Averages; Standard Deviation; Sampling; Cumumulative Frequency Graphs (including median and quantiles); Representing Data; Histograms. The UK's Office for National Statistics has a webpage leading to material suitable for both teachers and students at school level. In 2004 the Smith inquiry made the following statement:
"There is much concern and debate about the positioning of Statistics and Data Handling within the current mathematics GCSE, where it occupies some 25 per cent of the timetable allocation. On the one hand, there is widespread agreement that the Key Stage 4 curriculum is over-crowded and that the introduction of Statistics and Data Handling may have been at the expense of time needed for practising and acquiring fluency in core mathematical manipulations. Many in higher education mathematics and engineering departments take this view. On the other hand, there is overwhelming recognition, shared by the Inquiry, of the vital importance of Statistics and Data Handling skills both for a number of other academic disciplines and in the workplace. The Inquiry recommends that there be a radical re-look at this issue and that much of the teaching and learning of Statistics and Data Handling would be better removed from the mathematics timetable and integrated with the teaching and learning of other disciplines (e.g. biology or geography). The time restored to the mathematics timetable should be used for acquiring greater mastery of core mathematical concepts and operations."
|
wikipedia
|
wiki_30520_chunk_7
|
Crossing number (graph theory)
|
During World War II, Hungarian mathematician PΓ‘l TurΓ‘n was forced to work in a brick factory, pushing wagon loads of bricks from kilns to storage sites. The factory had tracks from each kiln to each storage site, and the wagons were harder to push at the points where tracks crossed each other, from which TurΓ‘n was led to ask his brick factory problem: how can the kilns, storage sites, and tracks be arranged to minimize the total number of crossings? Mathematically, the kilns and storage sites can be formalized as the vertices of a complete bipartite graph, with the tracks as its edges. A factory layout can be represented as a drawing of this graph, so the problem becomes:
what is the minimum possible number of crossings in a drawing of a complete bipartite graph?
|
wikipedia
|
wiki_33342_chunk_21
|
Psychometric software
|
irtoys
irtoys is an R package first published in 2007 and supporting almost everything in the book but limited to one booklet of dichotomous items. It is good for teaching, smaller projects, as a psychometrician's Swiss knife
and as a source of building stones for other projects. The simple syntax files for ICL and BILOG-MG it writes can be studied and modified to handle more complicated problems.
|
wikipedia
|
wiki_8826_chunk_15
|
Internal Revenue Code
|
Subtitles
A. Income Taxes (sections 1 through 1564)As a further example, here are the chapters of this subtitle:
(sections 1 through 1400U3)
(sections 1401 through 1403)
(sections 1441 through 1464)
(sections 1471β1474)
(sections 1491-1494)
(sections 1501 through 1564)
B. Estate and Gift Taxes (sections 2001 through 2801)
C. Employment Taxes (sections 3101 through 3510)
D. Miscellaneous Excise Taxes (sections 4001 through 5000)
E. Alcohol, Tobacco, and Certain Other Excise Taxes (sections 5001 through 5891)
F. Procedure and Administration (sections 6001 through 7874)
G. The Joint Committee on Taxation (sections 8001 through 8023)
H. Financing of Presidential Election Campaigns (sections 9001 through 9042)
I. Trust Fund Code (sections 9500 through 9602) ("Trust Fund Code of 1981")
J. Coal Industry Health Benefits (sections 9701 through 9722)
K. Group Health Plan Requirements (sections 9801 through 9834)
|
wikipedia
|
wiki_2250_chunk_5
|
Oz (programming language)
|
Basic data structures:
Numbers: floating point or integer (real integer)
Records: for grouping data : circle(x:0 y:1 radius:3 color:blue style:dots). Here the terms x,y, radius etc. are called features and the data associated with the features (in this case 0,1,3 etc.) are the values.
Tuples: Records with integer features in ascending order: circle(1:0 2:1 3:3 4:blue 5:dots) .
Lists: a simple linear structure
'|'(2 '|'(4 '|'(6 '|'(8 nil)))) % as a record.
2|(4|(6|(8|nil))) % with some syntactic sugar
2|4|6|8|nil % more syntactic sugar
[2 4 6 8] % even more syntactic sugar
Those data structures are values (constant), first class and dynamically type checked. Variable names in Oz start with an uppercase letter to distinguish them from literals which always begin with a lowercase letter.
|
wikipedia
|
wiki_23161_chunk_6
|
FAME (database)
|
Toolkits and connectors
FAME Desktop Add-in for Excel:
FAME Desktop is an Excel add-in that supports the =FMD(expression,sd,ed,0,freq,orientation) and =FMS(expression,freq + date) formula, just as the 4GL command prompt does. These formulas can be placed in Excel spreadsheets and are linked to FAME objects and analytics stored on a FAME server. Sample excel templates for research and analytics, which act as accelerators for clients, are available in the template library.
The FAME Desktop Add-in was first renamed as FAME Populator, then MarketMap Analytics.
|
wikipedia
|
wiki_4_chunk_48
|
Algorithm
|
An elegant program for Euclid's algorithm
The flowchart of "Elegant" can be found at the top of this article. In the (unstructured) Basic language, the steps are numbered, and the instruction LET [] = [] is the assignment instruction symbolized by β.
5 REM Euclid's algorithm for greatest common divisor
6 PRINT "Type two integers greater than 0"
10 INPUT A,B
20 IF B=0 THEN GOTO 80
30 IF A > B THEN GOTO 60
40 LET B=B-A
50 GOTO 20
60 LET A=A-B
70 GOTO 20
80 PRINT A
90 END
How "Elegant" works: In place of an outer "Euclid loop", "Elegant" shifts back and forth between two "co-loops", an A > B loop that computes A β A β B, and a B β€ A loop that computes B β B β A. This works because, when at last the minuend M is less than or equal to the subtrahend S (Difference = Minuend β Subtrahend), the minuend can become s (the new measuring length) and the subtrahend can become the new r (the length to be measured); in other words the "sense" of the subtraction reverses.
|
wikipedia
|
wiki_2902_chunk_2
|
List of mathematical examples
|
Alexander horned sphere
All horses are the same color
Cantor function
Cantor set
Checking if a coin is biased
Concrete illustration of the central limit theorem
Differential equations of mathematical physics
Dirichlet function
Discontinuous linear map
Efron's non-transitive dice
Example of a game without a value
Examples of contour integration
Examples of differential equations
Examples of generating functions
Examples of groups
List of the 230 crystallographic 3D space groups
Examples of Markov chains
Examples of vector spaces
Fano plane
Frieze group
Gray graph
HallβJanko graph
HigmanβSims graph
Hilbert matrix
Illustration of a low-discrepancy sequence
Illustration of the central limit theorem
An infinitely differentiable function that is not analytic
Leech lattice
Lewy's example on PDEs
List of finite simple groups
Long line
Normally distributed and uncorrelated does not imply independent
Pairwise independence of random variables need not imply mutual independence.
Petersen graph
Sierpinski space
Simple example of Azuma's inequality for coin flips
Proof that 22/7 exceeds Ο
Solenoid (mathematics)
Sorgenfrey plane
Stein's example
Three cards and a top hat
Topologist's sine curve
Tsirelson space
Tutte eight cage
Weierstrass function
Wilkinson's polynomial
Wallpaper group
Uses of trigonometry (The "examples" in that article are not mathematical objects, i.e., numbers, functions, equations, sets, etc., but applications of trigonometry or scientific fields to which trigonometry is applied.)
|
wikipedia
|
wiki_10768_chunk_11
|
SteinhausβJohnsonβTrotter algorithm
|
Gray codes
A Gray code for numbers in a given radix is a sequence that contains each number up to a given limit exactly once, in such a way that each pair of consecutive numbers differs by one in a single digit. The n! permutations of the n numbers from 1 to n may be placed in one-to-one correspondence with the n! numbers from 0 to n!Β βΒ 1 by pairing each permutation with the sequence of numbers ci that count the number of positions in the permutation that are to the right of value i and that contain a value less thanΒ i (that is, the number of inversions for which i is the larger of the two inverted values), and then interpreting these sequences as numbers in the factorial number system, that is, the mixed radix system with radix sequence (1,2,3,4,...). For instance, the permutation (3,1,4,5,2) would give the values c1Β =Β 0, c2Β =Β 0, c3Β =Β 2, c4Β =Β 1, and c5Β =Β 1. The sequence of these values, (0,0,2,1,1), gives the number
|
wikipedia
|
wiki_37251_chunk_2
|
List of RCD Espanyol records and statistics
|
Overall seasons table in La Liga
{|class="wikitable"
|-bgcolor="#efefef"
! Pos.
! Club
! Season In D1
! Pl.
! W
! D
! L
! GS
! GA
! Dif.
! Pts
!Champion
!2nd place
!3rd place
!4th place
|-
|align=center|7
|Espanyol
|align=center|85
|align=center|2740
|align=center|979
|align=center|642
|align=center|1119
|align=center|3720
|align=center|4034
|align=center|-314
|align=center|2919
| align=center bgcolor=gold| 0
| align=center bgcolor=silver| 0
| align=center bgcolor=bronze| 4
| align=center | 5
|}
|
wikipedia
|
wiki_825_chunk_27
|
Lua (programming language)
|
Metatables
Extensible semantics is a key feature of Lua, and the metatable concept allows powerful customization of tables. The following example demonstrates an "infinite" table. For any n, fibs[n] will give the n-th Fibonacci number using dynamic programming and memoization.
fibs = { 1, 1 } -- Initial values for fibs[1] and fibs[2].
setmetatable(fibs, {
__index = function(values, n) --[[__index is a function predefined by Lua,
it is called if key "n" does not exist.]]
values[n] = values[n - 1] + values[n - 2] -- Calculate and memorize fibs[n].
return values[n]
end
})
|
wikipedia
|
wiki_956_chunk_44
|
Unification (computer science)
|
For an example, a term rewrite system R is used defining the append operator of lists built from cons and nil; where cons(x,y) is written in infix notation as x.y for brevity; e.g. app(a.b.nil,c.d.nil) β a.app(b.nil,c.d.nil) β a.b.app(nil,c.d.nil) β a.b.c.d.nil demonstrates the concatenation of the lists a.b.nil and c.d.nil, employing the rewrite rule 2,2, and 1. The equational theory E corresponding to R is the congruence closure of R, both viewed as binary relations on terms.
For example, app(a.b.nil,c.d.nil) β‘ a.b.c.d.nil β‘ app(a.b.c.d.nil,nil). The paramodulation algorithm enumerates solutions to equations with respect to that E when fed with the example R.
|
wikipedia
|
wiki_8380_chunk_6
|
Complex network
|
Interest in scale-free networks began in the late 1990s with the reporting of discoveries of power-law degree distributions in real world networks such as the World Wide Web, the network of Autonomous systems (ASs), some networks of Internet routers, protein interaction networks, email networks, etc. Most of these reported "power laws" fail when challenged with rigorous statistical testing, but the more general idea of heavy-tailed degree distributionsβwhich many of these networks do genuinely exhibit (before finite-size effects occur) -- are very different from what one would expect if edges existed independently and at random (i.e., if they followed a Poisson distribution). There are many different ways to build a network with a power-law degree distribution. The Yule process is a canonical generative process for power laws, and has been known since 1925. However, it is known by many other names due to its frequent reinvention, e.g., The Gibrat principle by Herbert A. Simon, the Matthew effect, cumulative advantage and, preferential attachment by BarabΓ‘si and Albert for power-law degree distributions. Recently, Hyperbolic Geometric Graphs have been suggested as yet another way of constructing scale-free networks.
|
wikipedia
|
wiki_27292_chunk_7
|
CuneiForm (software)
|
1999
New OEM contract with the Olivetti company on supplying the multi-function devices imported into Russia with the CuneiForm system;
Distribution agreement with a leading European distributor of software company WSKA (France) on the distribution of OCR Cuneiform Direct in Europe;
New version of the system released, Cuneiform 2000, that implements the method of "cognitive analysis TMβ: an expert system is integrated into the recognition core, which analyses of alternatives to the estimates on the output from each detection algorithm, and choose the best option.
The method of "Meridian table segmentation TM" is developed for the improvement of the accuracy of recreating the original form of the table in the output document;
The original document form recreation mechanism - "What you scan is what you get TM" is introduced. The technology was aimed at saving the scanned document's original form in terms of its components placement. This particularly important for the documents with complex topology: multicolumn texts with headings, annotations, graphic illustrations, tables, etc.
|
wikipedia
|
wiki_4_chunk_42
|
Algorithm
|
An inelegant program for Euclid's algorithm The following algorithm is framed as Knuth's four-step version of Euclid's and Nicomachus', but, rather than using division to find the remainder, it uses successive subtractions of the shorter length s from the remaining length r until r is less than s. The high-level description, shown in boldface, is adapted from Knuth 1973:2β4:
|
wikipedia
|
wiki_6166_chunk_26
|
Loop unrolling
|
Converting to MIPS assembly language
The following is MIPS assembly code that will compute the dot product of two 100-entry vectors, A and B, before implementing loop unrolling. The code below omits the loop initializations:
Initialize loop count ($7) to 100.
Initialize dot product ($f10) to 0.
Initialize A[i] pointer ($5) to the base address of A.
Initialize B[i] pointer ($6) to the base address of B.
Note that the size of one element of the arrays (a double) is 8 bytes. loop3:
l.d $f10, 0($5) ; $f10 β A[i]
l.d $f12, 0($6) ; $f12 β B[i]
mul.d $f10, $f10, $f12 ; $f10 β A[i]*B[i]
add.d $f8, $f8, $f10 ; $f8 β $f8 + A[i]*B[i]
addi $5, $5, 8 ; increment pointer for A[i] by the size
; of a double.
addi $6, $6, 8 ; increment pointer for B[i] by the size
; of a double.
addi $7, $7, -1 ; decrement loop count
test:
bgtz $7, loop3 ; Continue if loop count > 0
|
wikipedia
|
wiki_15398_chunk_12
|
Roxxon Energy Corporation
|
Hired agents
Thomas Agar -
Assault & Battery -
Anton Aubuisson - A mercenary of Roxxon who massacres a tribe of Anuquit natives in order to build an oil pipeline but gets thwarted by War Machine.
Coldblood-7 -
Firebolt - He was hired to destroy the experiments at Project: PEGASUS.
Fixer -
Flag-Smasher - A mind-controlled operative.
Dr. Jonas Harrow - scientist at Rye Research Facility and Roxxon's underground NYC facility.
Hellrazor -
Ivory -
Mad Dog / Col. Buzz Baxter -
Mycroft -
Omega Flight -
Overrider - Former S.H.I.E.L.D. agent with the ability to control machinery.
Smokescream -
Spymaster - He was hired by Roxxon to kill the Ghost. Was apparently killed by the Ghost, but later turned up alive.
Voice -
Jennifer Walters / She-Hulk - An attorney.
Ghost -
The Grapplers - They made an attempt to ransack Project: PEGASUS.
Modular Man - A physicist at Roxxon's Brand Corporation.
Nth Man - He was about to destroy what remained of the Project. He was also halted.
Orka - He battled the Avengers in Jamaica, Queens.
Squadron Supreme -
Sunturion / Arthur Dearborn -
Tarantula / Anton Miguel Rodriguez -
Will o' the Wisp - He had his molecules torn apart after Brand's experiment went haywire and was put together by Spider-Man and Dr. Marla Madison. He is still seeking revenge on Brand.
|
wikipedia
|
wiki_51_chunk_6
|
Biostatistics
|
Research planning Any research in life sciences is proposed to answer a scientific question we might have. To answer this question with a high certainty, we need accurate results. The correct definition of the main hypothesis and the research plan will reduce errors while taking a decision in understanding a phenomenon. The research plan might include the research question, the hypothesis to be tested, the experimental design, data collection methods, data analysis perspectives and costs evolved. It is essential to carry the study based on the three basic principles of experimental statistics: randomization, replication, and local control. Research question
|
wikipedia
|
wiki_471_chunk_40
|
Power law
|
Two-point fitting method
This criterion can be applied for the estimation of power-law exponent in the case of scale free distributions and provides a more convergent estimate than the maximum likelihood method. It has been applied to study probability distributions of fracture apertures. In some contexts the probability distribution is described, not by the cumulative distribution function, by the cumulative frequency of a property X, defined as the number of elements per meter (or area unit, second etc.) for which XΒ >Β x applies, where x is a variable real number. As an example, the cumulative distribution of the fracture aperture, X, for a sample of N elements is defined as 'the number of fractures per meter having aperture greater than x . Use of cumulative frequency has some advantages, e.g. it allows one to put on the same diagram data gathered from sample lines of different lengths at different scales (e.g. from outcrop and from microscope).
|
wikipedia
|
wiki_38744_chunk_6
|
Barcode Project
|
The Barcode buildings are, from west to east:
PriceWaterhouseCoopers (PWC) Building. 18 floors. Architects: a-lab. 12 floors. A glass structure of simple form with a central entrance five storeys high affording views through the building, and 3-storey voids within the building visible from the exterior. The first Barcode building to be completed. In April 2008 a-lab won the "Europe 40 under 40" prize in part on the basis of this design.
Kommunal Landspensjonskasse (KLP) Building. 2 overlapping segments in contrasting materials and of differing shapes separated by a column of glass, varying between 8 and 18 floors. 31,700 sq. m. Architects: Solheim & Jacobsen (SJ). The western tower will contain 54 luxury apartments and the eastern the KLP offices. The building will have 5 roof surfaces, 3 of which will be gardens, the other two passive planting.
Deloitte Building. 16,950 sq. m. Architects: SnΓΈhetta. This building will be between the KLP Building and the Station Common and will provide services associated with the station, probably including restaurants, on its lowest floors. It will be tall and narrow and the surface realized half in glass, half in dense elements. Its form was inspired by a calving glacier and it was initially referred to as "the Glacier."
Visma Building. Three office towers joined by two columnar glass atria, varying between 12 and 17 floors. 20,800 sq. m. Architects: Dark Arkitekter. The cladding is to make it hard to read the number of floors from the exterior, a so-called "pixel facade."
DnB NOR Building. Architects: MVRDV, Dark Arkitekter and a-lab. Three buildings linked by a below-ground "street" area, with restaurants and other shared areas on the first and second floors. Building A: 37,000 sq. m., architect: MVRDV and co-architects Dark Arkitekter. The center building and the new headquarters of the financial company. Offices will be grouped around voids and the exterior cladding will be 6-meter square "pixels." Building B: 22,500 sq. m. Architect: a-lab. The eastern building, on the longest site, will be set back behind a plaza on Dronning Eufemias gate and have offices on the lower floors, apartments with terraces on the upper floors. Building C: 14 floors, 13,000 sq. m. Architect: Dark Arkitekter. The western DnB NOR tower will be stepped, with a restaurant, bar, and terrace on the top floor accessible from Dronning Eufemias gate. The building will be clad in glass reflective panels tilted at slightly differing angles to reflect different fractions of the surrounding scenery. To open 2012.
|
wikipedia
|
wiki_3019_chunk_40
|
R (programming language)
|
use of community-developed external libraries (called packages), in this case caTools package
handling of complex numbers
multidimensional arrays of numbers used as basic data type, see variables C, Z and X.
install.packages("caTools") # install external package
library(caTools) # external package providing write.gif function
jet.colors <- colorRampPalette(c("red", "blue", "#007FFF", "cyan", "#7FFF7F",
"yellow", "#FF7F00", "red", "#7F0000"))
dx <- 1500 # define width
dy <- 1400 # define height
C <- complex(real = rep(seq(-2.2, 1.0, length.out = dx), each = dy),
imag = rep(seq(-1.2, 1.2, length.out = dy), dx))
C <- matrix(C, dy, dx) # reshape as square matrix of complex numbers
Z <- 0 # initialize Z to zero
X <- array(0, c(dy, dx, 20)) # initialize output 3D array
for (k in 1:20) { # loop with 20 iterations
Z <- Z^2 + C # the central difference equation
X[, , k] <- exp(-abs(Z)) # capture results
}
write.gif(X, "Mandelbrot.gif", col = jet.colors, delay = 100)
|
wikipedia
|
wiki_26407_chunk_24
|
Text Executive Programming Language
|
A list of star variables follows:
*account - user account number associated with the current userid
*cl - the current line of the current file being edited
*lcl - the length of the *cl value
*clvl - current depth of calls
*date - current date in the form of YY-MM-DD
*eof - T if positioned after the last line of the current file or when there is no current file
*in - contains the last response to an in or int TEX command execution
*lin - length of *in
*left or *l - left string from scan or split command execution
*lleft or *ll - length of *left
*middle or *m - middle string from scan or split command execution
*lmiddle or *lm - length of *middle
*right or *r - right string from scan or split command execution
*lright or *lr - length of *right
*null - represents the null string
*random - contains a randomly selected digit from 0 to 9
*rmdr - remainder of the last division operation
*snumb - system number of the last batch job run
*svmd - TEX commands to restore the TEX modes at the time of the last interfile call or goto
*sw00 to *sw35 - examines the TSS 36-bit switch word with 1 bit returning a T value and a 0 bit returning a F
*time - current time in hh:mm:ss always to the nearest second
*userid - current userid
|
wikipedia
|
wiki_26525_chunk_4
|
Materials science in science fiction
|
In real life, scientists have announced a plastic as strong as steel, but transparent.
|-
|Beryllium
|Galaxy Quest, The Shadow
|The starship NSEA Protector is powered by large spheres of beryllium. Also, beryllium is needed for the creation of a bomb and found by investigating the metal components of a supposed "beryllium coin" in The Shadow (1994). Critics have noted this similarity.
|Beryllium's use in these fictional applications may arise from its actual use in some types of nuclear bombs.
|-
|Calcium carbonate
|Stargate SG-1
|When made in suitable rocks such as calcium carbonate oxygen is produced as a by-product during the formation of Crystal tunnels by the Tokra allowing time to set up life support.
|There is serious work in extracting oxygen from moon rocks for life support and propulsion. NASA has sponsored a prize (MoonROx) for the first working prototype, and at least one has been built.
|-
|Cobalt
|Apocalyptic fiction such as The Moon is Green, "Exhibit Piece", and On the Beach.
|The 5.27 year half life of radioactive 60Co is short enough to produce intense radiation, but long enough for it to disperse world-wide, and impractical to wait in shelters for it to decay. This combination of properties makes a cobalt bomb an excellent doomsday weapon.
|The science here is realistic. Fortunately, cobalt bombs have remained in the domain of science fiction.
|-
|Copper and Copper(II) sulfate
|The Skylark of Space series by Edward E. "Doc" Smith
|In these stories, copper is used as spaceship fuel, being catalyzed by 'element X' directly into energy. When the ship's supply of copper is exhausted, it is able to refuel and return home by visiting the Green System, which has oceans containing copper sulfate.
|Copper is indeed used in rocket engines, but for its high thermal conductivity, not as a power source.
|-
|Dilithium
|Star Trek| Dilithium is fictionally used as shorthand for an extremely complex and hard crystalline structure (2(5)6 dilithium 2(:)l diallosilicate 1:9:1 heptoferranide), which occurs naturally on some planets. When placed in a high-frequency electromagnetic field, magnetic eddies are induced in its structure which keep charged particles away from the crystal lattice. This prevents it from reacting with antimatter when so energized, because the antimatter atoms never actually touch it. Therefore, it is used to contain and regulate the annihilation reaction of matter and antimatter in a starship's warp core, which otherwise would explode from the uncontrolled annihilation reaction. Though low-quality artificial crystals can be grown or replicated, they are limited in the power of the reaction they can regulate without fragmenting, and are therefore largely unsuitable for warp drive applications. Due to the need for natural dilithium crystals for interstellar travel, deposits of this material are a highly contested resource, and as such dilithium crystals have led to more interstellar conflict than all other reasons combined.
|In reality dilithium describes a biatomic gas.
|-
|Duralumin
|various
|The Marvel Comics character Captain America wears a suit of light weight duralumin mail beneath his costume for added protection.
|
wikipedia
|
wiki_23618_chunk_32
|
Biomolecular engineering
|
Scaling up a process involves using data from an experimental-scale operation (model or pilot plant) for the design of a large (scaled-up) unit, of commercial size. Scaling up is a crucial part of commercializing a process. For example, insulin produced by genetically modified Escherichia coli bacteria was initialized on a lab-scale, but to be made commercially viable had to be scaled up to an industrial level. In order to achieve this scale-up a lot of lab data had to be used to design commercial sized units. For example, one of the steps in insulin production involves the crystallization of high purity glargin insulin. In order to achieve this process on a large scale we want to keep the Power/Volume ratio of both the lab-scale and large-scale crystallizers the same in order to achieve homogeneous mixing.
We also assume the lab-scale crystallizer has geometric similarity to the large-scale crystallizer. Therefore,
|
wikipedia
|
wiki_18764_chunk_109
|
Anonymous function
|
irb(main):001:0> # Example 1:
irb(main):002:0* # Purely anonymous functions using blocks.
irb(main):003:0* ex = [16.2, 24.1, 48.3, 32.4, 8.5]
=> [16.2, 24.1, 48.3, 32.4, 8.5]
irb(main):004:0> ex.sort_by { |x| x - x.to_i } # Sort by fractional part, ignoring integer part.
=> [24.1, 16.2, 48.3, 32.4, 8.5]
irb(main):005:0> # Example 2:
irb(main):006:0* # First-class functions as an explicit object of Proc -
irb(main):007:0* ex = Proc.new { puts "Hello, world!" }
=> #<Proc:0x007ff4598705a0@(irb):7>
irb(main):008:0> ex.call
Hello, world!
=> nil
irb(main):009:0> # Example 3:
irb(main):010:0* # Function that returns lambda function object with parameters
irb(main):011:0* def is_multiple_of(n)
irb(main):012:1> lambda{|x| x % n == 0}
irb(main):013:1> end
=> nil
irb(main):014:0> multiple_four = is_multiple_of(4)
=> #<Proc:0x007ff458b45f88@(irb):12 (lambda)>
irb(main):015:0> multiple_four.call(16)
=> true
irb(main):016:0> multiple_four[15]
=> false
|
wikipedia
|
wiki_23735_chunk_3
|
BowyerβWatson algorithm
|
Pseudocode
The following pseudocode describes a basic implementation of the Bowyer-Watson algorithm. Its time complexity is . Efficiency can be improved in a number of ways. For example, the triangle connectivity can be used to locate the triangles which contain the new point in their circumcircle, without having to check all of the triangles - by doing so we can decrease time complexity to . Pre-computing the circumcircles can save time at the expense of additional memory usage. And if the points are uniformly distributed, sorting them along a space filling Hilbert curve prior to insertion can also speed point location.
|
wikipedia
|
wiki_3450_chunk_36
|
Jacobi elliptic functions
|
{| class="wikitable" style="text-align:center; width:200pxβ;
|+ Residues of Jacobi Elliptic Functions
!colspan="2" rowspan="2"|
!colspan="4"|q
|-
! width="40pt"|c
! width="40pt"|s
! width="40pt"|n
! width="40pt"|d
|-
!rowspan="6"|p
|-
! height="40pt" |c
| ||1||||
|-
! height="40pt" |s
| || ||||
|-
! height="40pt" |n
|||1|| ||
|-
! height="40pt" | d
| -1 || 1 || ||
|-
|}
|
wikipedia
|
wiki_16044_chunk_6
|
Math circle
|
Guided exploration circles use self-discovery and the Socratic method to probe deep questions. Robert & Ellen Kaplan, in their book Out of the Labyrinth: Setting Mathematics Free, make a case for this format describing the non-profit Cambridge/Boston Math Circle they founded in 1994 in the Harvard University. The book describes the classroom, organizational and practical issues the Kaplans faced in founding their Math Circle. The meetings encourage a free discussion of ideas; while the content is mathematically rigorous, the atmosphere is friendly and relaxed. The philosophy of the teachers is, "What you have been obliged to discover by yourself leaves a path in your mind which you can use again when the need arises" (G. C. Lichtenberg). Children are encouraged to ask exploratory questions. Are there numbers between numbers? What's a geometry like with no parallel lines? Can you tile a square with squares all of different sizes?
|
wikipedia
|
wiki_549_chunk_5
|
Search algorithm
|
Problems in combinatorial optimization, such as:
The vehicle routing problem, a form of shortest path problem
The knapsack problem: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
The nurse scheduling problem
Problems in constraint satisfaction, such as:
The map coloring problem
Filling in a sudoku or crossword puzzle
In game theory and especially combinatorial game theory, choosing the best move to make next (such as with the minmax algorithm)
Finding a combination or password from the whole set of possibilities
Factoring an integer (an important problem in cryptography)
Optimizing an industrial process, such as a chemical reaction, by changing the parameters of the process (like temperature, pressure, and pH)
Retrieving a record from a database
Finding the maximum or minimum value in a list or array
Checking to see if a given value is present in a set of values
|
wikipedia
|
wiki_7114_chunk_31
|
List of programs broadcast by Nine Network
|
1 vs. 100 (2007β2008)
All About Faces (1971)
Ampol Stamp Quiz (1964β1965)
Bert's Family Feud (2006β2007)
The Better Sex (1978)
The Big Game (1966)
Big Nine (1969β1970)
Blankety Blanks (1985β1986, 1996)
Burgo's Catch Phrase (1997β2001, 2002β2003)
Cash Bonanza (2001)
The Celebrity Game (1969)
Celebrity Squares (1975β1976)
Clever (2006)
Concentration (1950sβ1967)
Crossfire (1987β1988)
Do You Trust Your Wife? (1957β1958)
Don't Forget Your Toothbrush (1995)
Double Your Dollars (1965)
Download (2000-2002)
Fairway Fun (1960s)
Family Feud (1977β1984)
Fear Factor (2002)
Ford Superquiz (1981β1982)
Free for All (1973)
Gambit (1974)
The Golden Show (1960s)
Guess What? (1992β1993)
Happy Go Lucky (1961)
Hole in the Wall (2008)
Initial Reaction (Nine Network 2000)
It Could Be You (1960β1967, 1969, 1982)
Jackpot (1960-1961)
Jigsaw (1960s)
Keynotes (1964, 1992β1993)
Let's Make a Deal (1968β1969, 1977)
Letter Charades (1967)
Little Aussie Battlers (1998)
The Lucky Show (1959β1961)
Match Mates (1981β1982)
The Mint (2007β2008)
The Million Dollar Drop (2011)
Million Dollar Wheel of Fortune (2008)
My Generation (1995β1996)
Name That Tune (1956β1957, 1975)
The Newlywed Game (1987)
Now You See It (1998β1999)
Pass the Buck (2002)
Play Your Hunch (1962β1964)
Power of 10 (2008)
The Price Is Right (1958, 1993β1998, 2003β2005)
Quizmania (2006β2007)
Sale of the Century (1980β2001)
Say G'day (1987)
Say When!! (1962β1964)
Shafted (2002)
Show Me the Money
The Singing Bee (2008)
Spending Spree (1971β1976)
Split Second (1972β1973)
Strike It Lucky (1994)
Supermarket Sweep (1992β1994)
Surprise Package (1961)
Take the Hint (1962β1966)
Tell the Truth (1959β1965)
Temptation (2005β2009)
Tic-Tac-Dough (1960β1964)
The Tommy Hanlon Show (1967β1968)
Wheel of Fortune (1959β1962, no relation to later series of the same name)
Who Wants to Be a Millionaire? (1999β2007)
Who Wants to Be a Millionaire? Whizz Kids (2010)
Wipeout Australia (2009)
|
wikipedia
|
wiki_33655_chunk_7
|
Wind power in New York
|
A NYISO study conducted in 2010, Growing Wind: Final Report of the NYISO 2010 Wind Generation Study (Sept. 2010), found that the New York power system will allow for the integration of up to 8,000 MW of wind generation with no adverse reliability impacts. At higher levels of wind generation, due to increased variability, the analysis determined that for every 1,000 MW increase between the 4,250 MW and 8,000 MW wind penetration level, the average regulation requirement increases approximately 9 percent. Further, given existing transmission constraints, at the 6,000 MW scenario modeled, 8.8% of the energy production in three areas of upstate New York (Zones C - Central, D - North, and E - Mohawk) would be "bottled" or undeliverable. With upgrades, the amount of bottled wind energy could be reduced to less than 2 percent. A similar bottling pattern was found in the 8,000 MW model. Offshore wind energy, as modeled, is fully deliverable.
|
wikipedia
|
wiki_19227_chunk_2
|
Interactive Mathematics Program
|
Each book of the curriculum is divided into five- to eight-week units, each having a central problem or theme. This larger problem is intended to serve as motivation for students to develop the underlying skills and concepts needed to solve it, through solving a variety of smaller related problems.
There is an emphasis on asking students to work together in collaborative groups.
It is hoped that communication skills will be developed; exercises aimed at this goal are embedded throughout the curriculum, through the use of group and whole class discussions, the use of writing to present and clarify mathematical solutions; in some IEP classes, formal oral presentations are required.
The IMP curriculum expects students to make nearly daily use of a scientific graphing calculator.
|
wikipedia
|
wiki_269_chunk_11
|
Heap (data structure)
|
Construction of a binary (or d-ary) heap out of a given array of elements may be performed in linear time using the classic Floyd algorithm, with the worst-case number of comparisons equal to 2N β 2s2(N) β e2(N) (for a binary heap), where s2(N) is the sum of all digits of the binary representation of N and e2(N) is the exponent of 2 in the prime factorization of N. This is faster than a sequence of consecutive insertions into an originally empty heap, which is log-linear. Variants
|
wikipedia
|
wiki_13893_chunk_26
|
Building information modeling
|
There have been attempts at creating information models for older, pre-existing facilities. Approaches include referencing key metrics such as the Facility Condition Index (FCI), or using 3D laser-scanning surveys and photogrammetry techniques (separately or in combination) or digitizing traditional building surveying methodologies by using mobile technology to capture accurate measurements and operation-related information about the asset that can be used as the basis for a model. Trying to model a building constructed in, say 1927, requires numerous assumptions about design standards, building codes, construction methods, materials, etc., and is, therefore, more complex than building a model during design.
|
wikipedia
|
wiki_22421_chunk_5
|
DMS Software Reengineering Toolkit
|
Changes to ASTs can be accomplished by both procedural methods coded in PARLANSE and source-to-source tree transformations coded as rewrite rules using surface-syntax conditioned by any extracted program facts, using DMS's Rule Specification Language (RSL). The rewrite rule engine supporting RSL handles associative and commutative rules. A rewrite rule for C to replace a complex condition by the ?: operator be written as:
rule simplify_conditional_assignment(v:left_hand_side,e1:expression,e2:expression,e3:expression)
:statement->statement
= " if (\e1) \v=\e2; else \v=e3; "
-> " \v=\e1?\e2:\e3; "
if no_side_effects(v);
Rewrite rules have names, e.g. simplify_conditional_assignment. Each rule has a "match this" and "replace by that" pattern pair separated by ->, in our example, on separate lines for readability. The patterns must correspond to language syntax categories; in this case, both patterns must be of syntax category statement also separated in sympathy with the patterns by ->. Target language (e.g., C) surface syntax is coded inside meta-quotes ", to separate rewrite-rule syntax from that of the target language. Backslashes inside meta-quotes represent domain escapes, to indicate pattern meta variables (e.g., \v, \e1, \e2) that match any language construct corresponding to the metavariable declaration in the signature line, e.g., e1 must be of syntactic category: (any) expression. If a metavariable is mentioned multiple times in the match pattern, it must match to identical subtrees; the same identically shaped v must occur in both assignments in the match pattern in this example. Metavariables in the replace pattern are replaced by the corresponding matches from the left side. A conditional clause if provides an additional condition that must be met for the rule to apply, e.g., that the matched metavariable v, being an arbitrary left-hand side, must not have a side effect (e.g., cannot be of the form of a[i++]; the no_side_effects predicate is defined by an analyzer built with other DMS mechanisms).
|
wikipedia
|
wiki_15618_chunk_6
|
Software audit review
|
The financial context: Further transparency is needed to clarify whether the software has been developed commercially and whether the audit was funded commercially (paid Audit). It makes a difference whether it is a private hobby / community project or whether a commercial company is behind it.
Scientific referencing of learning perspectives: Each audit should describe the findings in detail within the context and also highlight progress and development needs constructively. An auditor is not the parent of the program, but serves in a role of a mentor if the auditor is regarded as part of a PDCA learning circle (PDCA = Plan-Do-Check-Act). There should be next to the description of the detected vulnerabilities also a description of the innovative opportunities and the development of the potentials.
Literature-inclusion: A reader should not rely solely on the results of one review, but also judge according to a loop of a management system (e.g. PDCA, see above), to ensure, that the development team or the reviewer was and is prepared to carry out further analysis, and also in the development and review process is open to learnings and to consider notes of others. A list of references should be accompanied in each case of an audit.
Inclusion of user manuals & documentation: Further a check should be done, whether there are manuals and technical documentations, and, if these are expanded.
Identify references to innovations: Applications that allow both, messaging to offline and online contacts, so considering chat and e-mail in one application - as it is also the case with GoldBug - should be tested with high priority (criterion of presence chats in addition to the e-mail function). The auditor should also highlight the references to innovations and underpin further research and development needs.
This list of audit principles for crypto applications describes - beyond the methods of technical analysis - particularly core values, that should be taken into account
|
wikipedia
|
wiki_17920_chunk_8
|
Origin (data analysis software)
|
Release history
2021/11/16 Origin 2022: Add Notes to Cells, Named Range, Image on Graph as Linked Files, Mini Toolbars on Object Manager, Connect to OneDrive and Google Drive for data.
2021/4/30 Origin 2021b: Mini toolbar for 3D graph, built-in Shapefile support, insert maps to graphs, NetCDF climate data, SQLite import export
2020/10/27 Origin 2021. Fully integrated Python support with new originpro package. New formula bar, color manager, chord diagram. New Apps including TDMS Connector, Import PDF Tables.
2020/4/30 Origin 2020b. Mini toolbar for worksheet & matrix, data connector navigator panel, browser graphs. Worksheet cells no longer showing ####. New Apps such as Canonical Correlation Analysis, Correlation plot etc.
2019/10/25 Origin 2020. Mini toolbars, much faster import and plotting of large dataset. Density dots, color dots, sankey diagram, improved pie and doughnut charts. Copy and Paste plot, Copy and Paste HTML or EMF table.
2019/04/24 Origin 2019b. HTML and Markdown reports. Web Data Connectors for CSV, JSON, Excel, MATLAB. Rug Plots, Split Heatmap Plot. Validation Reports using NIST data. New Apps for Quantile Regression, 2D Correlation, Isosurface Plot, etc.
2018/10/26 Origin 2019. Data Highlighter for data exploration, Windows-like search from Start menu, Conditional formatting of data cells, Violin plot, New apps like Stats Advisor, Image Object Counter, Design of Experiments, etc.
2018/4/24 Origin 2018b. Matrices embedded in workbook, Worksheet/matrix data preview, Dynamic graph preview in analysis, Distributed batch processing on multi-core CPU (app).
2017/11/9 Origin 2018. Cell formula, Unicode, Bridge chart, changed to a more compact file format (OPJU).
2016/11/10 Origin 2017. Trellis Plot, Geology fill patterns, JavaScript support from Origin C.
2015/10/23 Origin 2016. First version to support Apps in Origin, also added R support.
2014/10 Origin 2015 added graph thumbnail previews, project search, heat map, 2D kernel density plot and Python support.
2013/10 Origin 9.1 SR0 added support for Piper diagram, Ternary surface plot etc.
2012/10 Origin 9 with high performance OpenGL 3D Graphing, orthogonal regression for implicit/explicit functions
2011/11 Origin 8.6, first version in 64bit
2011/04 Origin 8.5.1
2010/09 Origin 8.5.0
2009/10 Origin 8.1
2009/08 Origin 8 SR6
2007/12 Origin 8 SR1
2007/10 Origin 8
2006/01 Origin 7.5 SR6
2003/10 Origin 7.5
2002/02 Origin 7.0
2000/09 Origin 6.1
1999/06 Origin 6.0
1997/08 Origin 5.0
1995/02 Origin 4.1
1994/07 Origin 3.5
1993/08 Origin 2.9
1993/?? Origin 2
|
wikipedia
|
wiki_19233_chunk_8
|
Spar Aerospace
|
Beckert, Beverly A., "Satellite Design Soars to New Heights", Computer-Aided Engineering, October 1993, p.Β 24.
Berman, David, "When Bad Companies Happen to Good People", Canadian Business, March 27, 1998, pp.Β 78β81.
Calamai, Peter, "Canada Mulls Shifting Space Contract to Europeans: U.S. Ban on Flow of Information, Technology Blamed", Toronto Star, May 29, 1999.
Covault, Craig, "Ariane Launches Canadian MSat-1", Aviation Week and Space Technology, April 29, 1996, p.Β 29.
De Santis, Solange, "In Reaching to Diversify, Spar Aerospace Loses Its GripβNew Chief at Maker of Canadarm Has Hands Full with Leftover Problems", Wall Street Journal, June 26, 1996, p. B4.
Hubbard, Craig, "Shuttle's Canadarm Earns Its 50-Mission Cap", Computing Canada, August 10, 1998, p.Β 4.
Knapp, Bill, "Masters of the Universe", Canadian Business, November 1992, pp.Β 119β24.
Litvak, Isaiah A., "Instant International: Strategic Reality for Small High-Technology Firms in Canada", Multinational Business, Summer 1990, pp.Β 1β12.
Morgan, Walter L., "The Olympus Family", Satellite Communications, June 1985, p.Β 35ff.
Savona, Dave, and Stephen W. Quickel, "Steel's New Gleam; Sparring Partner", International Business, March 1993, p.Β 126.
Southerst, John, "An Arm with a Mind of Its Own", Canadian Business, March 1992, pp.Β 60β64.
"Spar Aerospace Launches New Data Collection System", Plant Engineering & Maintenance, March/April 1993, pp.Β 15β18.
"The Year of Living Differently", Canadian Business, June 1997, p.Β 16.
Source: International Directory of Company Histories, Vol. 32. St. James Press, 2000.
|
wikipedia
|
wiki_9359_chunk_9
|
Computer-aided production engineering
|
The tools implementing these functions must be highly automated and integrated; and will need to provide quick access to a wide range of data. This data must be maintained in a format that is accessible and usable by the engineering tools. Some examples of the information that might be contained in these electronic libraries include:
production process models and data and generic manufacturing systems configurations;
machinery and equipment specifications, and vendor catalogs;
recommended methods, practices, algorithms, etc., and benchmarking data;
typical plant/system layouts,
cost estimation models, labor rates, other cost data and budget templates,
time standards, industrial standards, project plans, and laws/government regulations.
|
wikipedia
|
wiki_10480_chunk_29
|
List of programs broadcast by Seven Network
|
All-Star Squares (1999)
Australia's Brainiest Kid (Seven Network 2004; Network Ten 2005-2007 as Australia's Brainiest)
Beat The Star (2010)
Blind Date (1974)
Blockbusters (1990β1994)
Cannonball (2017)
Catch Us If You Can
Celebrity Tattletales (1980)
C'mon, Have A Go! (1985-1986)
Coles Β£3000 Question and Coles $6000 Question (1960β1971)
Concentration (1970s, 1997)
Sevenβs Deal Or No Deal (2003-2013)
Dog Eat Dog (2002β2003)
The Dulux Show (1957)
Family Feud (1988β1996)
Gladiators (1995β1996, 2008)
Great Temptation (1970β1976)
Have a Go (1987)
High Rollers (1975)
Hot Streak (1998)
It Pays to Be Funny (1957β1958)
Jeopardy! (1970-1978)
Letterbox and $50,000 Letterbox (1963, 1981)
The Love Game (1984)
The Main Event (1991β1992)
Man O Man (1994)
The Master (2006)
Midnight Zoo (2006)
Million Dollar Chance Of A Lifetime (1999β2000)
Million Dollar Minute (2013-2015)
Minute to Win It (2010)
National Bingo Night (2007)
Now You See It (1985β1996)
Opportunity Knocks (1977β1978)
Perfect Match (2002)
Pick a Box (1957β1971)
Play Your Cards Right (1984)
Press Your Luck (1987β1988)
The Pressure Pak Show (1957β1958)
The Price is Right (original format) (1957β1959, 1963)
The New Price is Right (1981-1985)
The Price is Right (2012-2013)
Quiz Master (2002)
The Rich List (2007-2008)
Stop the Music (1950s)
Take a Chance (1959)
Take Me Out (2018)
Talking Telephone Numbers (1996)
Total Recall (1994β1995)
The Trivial Video Show (1986)
TV Talent Scout (1957β1958)
Video Village (1962-1966)
The Wall (2017)
The Weakest Link (2001β2002)
Wheel of Fortune: The Original Series (1981β2004, 2006 [unscreened episodes])
Larry Emdur & Laura Csortan's Wheel of Fortune (2005-2006)
Who Dares Wins (1996β1998)
Win Roy and HG's Money (2000)
Wipeout (1999β2000)
|
wikipedia
|
wiki_2287_chunk_12
|
Perfect hash function
|
Pseudocode
algorithm hash, displace, and compress is
(1) Split S into buckets
(2) Sort buckets Bi in falling order according to size |Bi|
(3) Initialize array T[0...m-1] with 0's
(4) for all iβ[r], in the order from (2), do
(5) for lβ1,2,...
(6) repeat forming Kiβ{l(x)|xβBi}
(6) until |Ki|=|Bi| and Kiβ©{j|T[j]=1}=∅
(7) let Ο(i):= the successful l
(8) for all jβKi let T[j]:=1
(9) Transform (Οi)0β€i<r into compressed form, retaining access.
|
wikipedia
|
wiki_2443_chunk_39
|
Quantitative genetics
|
Extensive binomial sampling β is panmixia restored?
If the number of binomial samples is large (s β β ), then pβ’ β pg and qβ’ β qg. It might be queried whether panmixia would effectively re-appear under these circumstances. However, the sampling of allele frequencies has still occurred, with the result that Ο2p, q β 0. In fact, as s β β, the , which is the variance of the whole binomial distribution. Furthermore, the "Wahlund equations" show that the progeny-bulk homozygote frequencies can be obtained as the sums of their respective average values (p2β’ or q2β’) plus Ο2p, q. Likewise, the bulk heterozygote frequency is (2 pβ’ qβ’) minus twice the Ο2p, q. The variance arising from the binomial sampling is conspicuously present. Thus, even when s β β, the progeny-bulk genotype frequencies still reveal increased homozygosis, and decreased heterozygosis, there is still dispersion of progeny means, and still inbreeding and inbreeding depression. That is, panmixia is not re-attained once lost because of genetic drift (binomial sampling). However, a new potential panmixia can be initiated via an allogamous F2 following hybridization.
|
wikipedia
|
wiki_2443_chunk_124
|
Quantitative genetics
|
Following the hybridizing between A and R, the F1 (individual B) is crossed back (BC1) to an original parent (R) to produce the BC1 generation (individual C). [It is usual to use the same label for the act of making the back-cross and for the generation produced by it. The act of back-crossing is here in italics. ] Parent R is the recurrent parent. Two successive backcrosses are depicted, with individual D being the BC2 generation. These generations have been given t indices also, as indicated. As before, fD = ft = fCR = (1/2) [ fRB + fRR ] , using cross-multiplier 2 previously given. The fRB just defined is the one that involves generation (t-1) with (t-2). However, there is another such fRB contained wholly within generation (t-2) as well, and it is this one that is used now: as the co-ancestry of the parents of individual C in generation (t-1). As such, it is also the inbreeding coefficient of C, and hence is f(t-1). The remaining fRR is the coefficient of parentage of the recurrent parent, and so is (1/2) [1 + fR ] . Putting all this together : ft = (1/2) [ (1/2) [ 1 + fR ] + f(t-1) ] = (1/4) [ 1 + fR + 2 f(t-1) ] . The graphs at right illustrate Backcross inbreeding over twenty backcrosses for three different levels of (fixed) inbreeding in the Recurrent parent.
|
wikipedia
|
End of preview. Expand
in Data Studio
No dataset card yet
- Downloads last month
- 7