id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_2747_chunk_5
|
Shifting nth root algorithm
|
Summary
Initialize and to 0.
Repeat until desired precision is obtained:
Let be the next aligned block of digits from the radicand.
Let be the largest such that
Let .
Let
Assign and
is the largest integer such that , and , where is the number of digits of the radicand after the decimal point that have been consumed (a negative number if the algorithm has not reached the decimal point yet). Paper-and-pencil nth roots
As noted above, this algorithm is similar to long division, and it lends itself to the same notation:
|
wikipedia
|
wiki_1595_chunk_7
|
Computational archaeology
|
There is already a large body of literature on the use of quantitative methods and computer-based analysis in archaeology. The development of methods and applications is best reflected in the annual publications of the CAA conference (see external links section at bottom). At least two journals, the Italian Archeologia e Calcolatori and the British Archaeological Computing Newsletter, are dedicated to archaeological computing methods. AI Science contributes to many fundamental research topics, including but not limited to:
|
wikipedia
|
wiki_23288_chunk_2
|
SPRESI database
|
Database Content
The SPRESI database contains information on organic substances, including coverage of reactions, structures and properties. Over 32 million records of factual data, such as physical properties (boiling/melting points, refractive indexes, etc.), reaction conditions (catalysts, yields, etc.) and keywords have also been abstracted. Links to the literature in which the substances are described are also given.
|
wikipedia
|
wiki_5577_chunk_12
|
Biological small-angle scattering
|
Data analysis
In a good quality SAS experiment, several solutions with varying concentrations of the macromolecule under investigation are measured. By extrapolating the scattering curves measured at different concentrations to zero concentration, one is able to obtain a scattering curve that represents infinite dilution. Then concentration effects should not affect the scattering curve. Data analysis of the extrapolated scattering curve begins with the inspection of the start of the scattering curve in the region around s = 0. If the region follows the Guinier approximation (also known as Guinier law), the sample is not aggregated. Then the shape of the particle in question can be determined by various methods, of which some are described in the following reference.
|
wikipedia
|
wiki_33113_chunk_8
|
Instructional simulation
|
A widely used format for designing online learning environments is WebQuest. However, there are today on the market newer models for instruction that are more interactive and integrated, such as Project Page, MiniQuest, CuriculumQuest, DecisionQuest.
Reference: Jakes, D. (2003). "Creating Virtual Workspaces: New Models for Developing Online Curriculum". teachForum: Breakthrough Technologies for 21st century Schools, Chicago, Illinois. April 29, 2003. Retrieved on 6/28/09: http://www.biopoint.com/ibr/techforum.htm
|
wikipedia
|
wiki_10017_chunk_9
|
Mathematics (producer)
|
Production credits
America Is Dying Slowly - Red Hot AIDS Benefit Series, Red Hot Organization, Smoke One Productions
NFL Jams - "Fast Life"
Wu-Syndicate - "Pointin' Fingers", "Muzzle Toe"
Dirty Weaponry - "Galactics", "Bastard Swordsman"
Wu-Tang Killa Bees: The Swarm - "Cobra Clutch", "Punishment", "Fatal Sting"
The Pillage - "Oh Donna"
Tical 2000 Judgement Day - "Snuffed Out"
Beneath the Surface - "Amplified Sample", "High Price Small Reward", "Publicity", "Feel Like An Enemy", "Mic Trippin’"
Uncontrolled Substance - "Uncontrolled Substance"
Blackout! - "Dat's Dat Shit", "Fire Ina Hole"
The W - "Do You Really (Thang Thang)"
Supreme Clientele - "Mighty Healthy", "Wu-Banga 101"
Iron Flag - "Rules"
Digital Bullet - "Must Be Bobby", "Cousins"
Next Friday - "Shaolin Worldwide"
Bulletproof Wallets - "Theodore", "Strawberry"
Legend of the Liquid Sword - "Fam (Members Only)"
Tera Iz Him - "Roll With The Rush"
Northstar - "Duckie", "We Got It"
No Said Date - "Last Drink", "Do That Dance", "Whatever"
Street Education - "FANZ", "Who Want To Rap?", "Sweetest Pain"
Wu-Tang Meets the Indie Culture - "Cars On the Interstate"
4:21...The Day After - "Dirty Mef", "Everything"
I - "Two Missed Calls"
8 Diagrams - "Stick Me for My Riches"
Pro Tools - "Pencil"
Blackout! 2 - "BO2 (Intro)"
Only Built 4 Cuban Linx... Pt. II - "Mean Streets"
Wu-Massacre - "Meth vs. Chef Part II", "Miranda", "Dangerous"
Heaven Razah - "Raised In Hell"
Shaolin vs. Wu-Tang - "Dart School"
Gold Cobra - "Middle Finger", "Combat Jazz"
Selling My Soul - "Intro", "Part 2", "All Natural" & "Wisdom"
The Saga Continues - entire album
|
wikipedia
|
wiki_5483_chunk_1
|
Array programming
|
Modern programming languages that support array programming (also known as vector or multidimensional languages) have been engineered specifically to generalize operations on scalars to apply transparently to vectors, matrices, and higher-dimensional arrays. These include APL, J, Fortran 90, MATLAB, Analytica, TK Solver (as lists), Octave, R, Cilk Plus, Julia, Perl Data Language (PDL). In these languages, an operation that operates on entire arrays can be called a vectorized operation, regardless of whether it is executed on a vector processor, which implements vector instructions. Array programming primitives concisely express broad ideas about data manipulation. The level of concision can be dramatic in certain cases: it is not uncommon to find array programming language one-liners that require several pages of object-oriented code.
|
wikipedia
|
wiki_11832_chunk_4
|
ICFP Programming Contest
|
External links
Contest at ICFP site
1998 contest site
Mirror of 1998 contest task
(Partial) mirror of the 1999 contest site
2000 contest site
2001 contest site
2002 contest site
2003 contest site
2004 contest site
2005 contest site
2006 contest site
2007 contest site
2008 contest site
2009 contest site
2010 contest site
2011 contest site
2012 contest site
2013 contest site
2014 contest site
2015 contest site
2016 contest site
2017 contest site
2018 contest site
2019 contest site
2020 contest site
2021 contest site
ICFP Programming Contest History (Ward Cunningham's Wiki)
(CNET)
Fiction-filled computer code mystery peppered with 'ancient' puzzles (Pittsburgh Post-Gazette)
Video of 2006 contest results
Video of 2007 contest results
Video of 2008 contest results
2007 contest written report
Ant War game
https://web.archive.org/web/20110723014332/http://www.ant-wars.net/ - Homepage
http://sourceforge.net/projects/formicidae/ - The project at sourceforge.net
https://web.archive.org/web/20071125152658/http://alliance.seas.upenn.edu/~plclub/cgi-bin/contest/ The official page for the task at the 2004 ICFP Programming Contest
|
wikipedia
|
wiki_2443_chunk_118
|
Quantitative genetics
|
The pedigree for First Cousins (FC) is given to the right. The prime equation is fY = ft = fP1,P2 = (1/4) [ f1D + f12 + fCD + fC2 ]. After substitution with corresponding inbreeding coefficients, gathering of terms and simplifying, this becomes ft = (1/4) [ 3 f(t-1) + (1/4) [2 f(t-2) + f(t-3) + 1 ]] , which is a version for iteration—useful for observing the general pattern, and for computer programming. A "final" version is ft = (1/16) [ 12 f(t-1) + 2 f(t-2) + f(t-3) + 1 ] .
|
wikipedia
|
wiki_17153_chunk_4
|
Centre for Cellular and Molecular Biology
|
The Laboratory for Conservation of Endangered Species is an annexe with the aim to conserve the Indian wildlife by using modern biological techniques and assisted reproductive technologies. It has worked extensively with various departments of the Government of India to curb wildlife crime. They have helped identify the source of animal meat in cases of doubt, sources of smuggled animals, and study stress among wild animals via non-invasive measures. They have helped the Directorate of Aerospace Safety to identify the reason on bird hits, and help them in canopy engineering of their airports. They host the National Wildlife Genetic Resource Bank with currently 250 genetic samples of animals, collected from zoos across the country. They can contain up to 17,000 samples. In the past few years, they have worked with the Nehru Zoological Park, Hyderabad to protect the mouse deer from extinction. In August 2018, they started with the phased release of these animals into their original habitats of Amrabad Tiger Reserve.
|
wikipedia
|
wiki_9879_chunk_3
|
Software Bisque
|
Amateurs have discovered over 500 new objects (including comets, minor planets, supernovas, and cataclysmic variable stars) using these products. References External links Software companies based in Colorado
Companies based in Golden, Colorado
Software companies of the United States
|
wikipedia
|
wiki_7690_chunk_21
|
DeCODE genetics
|
Because of its singular population resources and the questions its scientists can ask and answer, many of deCODE's most remarkable findings have been in basic science. One notable focus has been on elucidating how variation in the sequence of the genome is generated. Following its microsatellite-based genetic map of the genome in 2002, the company created and made available to the scientific community two more: one in 2010 built on 300,000 SNPs, and another in 2019 built on WGS data. Recombination - the reshuffling of chromosomes that takes place in the making of eggs and sperm - is a primary mechanism for generating diversity and to build these maps. Over fifteen years deCODE has published a series of breakthrough papers detailing in a real human population how recombination rate varies according to sex, age and other characteristics, and how these differences impact the generation of genomic diversity and variation of many kinds. The general picture that has emerged is that the genome is generating diversity but within certain bounds, providing a dynamic but generally stable substrate for natural selection and evolution.
|
wikipedia
|
wiki_38730_chunk_3
|
MAPS (software)
|
User portfolios can also be accessed using a syndicated RSS newsfeed. This allows controlled access to user eportfolios by other interested parties. An integrated CV tool allows users to provide controlled access to their CVs for the purpose of employment. MAPS also incorporates a suite of tool entitled LiveAssess which are the commercial version of those developed by Goldsmiths University in a project entitled e-scape. Since MAPS is 100% a web service it can be integrated into any other platform. Background The team behind MAPS are all educators and advocates of evidence based assessment and have been involved in education technology research for over 20 years.
|
wikipedia
|
wiki_28555_chunk_11
|
Qualifications-Based Selection
|
Electronic Submittal Process
Until recently the evaluations of qualifications submittals was a completely manual process. This meant that each firm submitting on specific projects would typically need to include multiple copies of the requested items for each selection committee member as well as a copy that would remain on file with the agency. With the release of GSA's Standard Form (SF) 330 in 2004, agencies now have the capability to request that a submittal be performed in an entirely paperless environment with the use of an Electronic Submittal Process (ESP). Beyond a simple document management system, a true ESP will extract essential information from submitted items, maintain lists of projects and specific evaluation criteria, and provide tools for committees to objectively compare, score and rank firms in an efficient manner. A specific tool, GovernmentForms.manager™, was designed to adhere to this process is available from Enlightened Software, Inc..
|
wikipedia
|
wiki_32739_chunk_2
|
Simulation Open Framework Architecture
|
Scene graph
A key aspect of SOFA is the use of a scene graph to organize and process the elements of a simulation while clearly separating the computation tasks from their possibly parallel scheduling. The description of a SOFA simulation can easily be done in an XML file. For even more flexibility, a Python plugin allows scripting simulations using the Python language.
Basically, a SOFA scene-graph is composed with:
Nodes: used to categorise the components and keep the XML file clean (mechanical node, collision node, visual node, ...)
Components: main elements used to build a scene (solver component, forcefield component, rendering component, ...)
Datas: everything that components have to deal with (forces, velocities, positions, ratios, ...)
|
wikipedia
|
wiki_25254_chunk_6
|
Research Institute for Advanced Computer Science
|
Purpose and Charter
The stated purpose of RIACS since its formation is to:
Provide an interface between the NASA Ames Research Center and the academic community and serve as a center of cooperation for activities conducted in areas of advanced computer science and engineering, applied mathematics, and the application of computers to NASA’s scientific and engineering challenges.
Conduct independent research activities with the objective of developing concepts, techniques, or prototypes in computationally related disciplines to enhance problem-solving capabilities in scientific and engineering fields of interest to the aerospace community.
Improve cooperative research efforts of government, industry, and academia toward the solution of problems requiring advanced computational facilities.
Enhance technology transfer between universities, industry and other government agencies by conventional means, including encouragement of the rapid dissemination of preprint reports by institute personnel, presentations at symposia and publications in appropriate journals.
Strengthen ties between the general academic and industrial communities and NASA’s Ames Research Center to further develop in-house programmatic activities in computer science and technology.
Carry out a variety of additional activities, including lecture programs and visiting scientist programs, as well as provide consultation and collaboration with NASA Ames on topics in the fields of computer science and applied mathematics. RIACS personnel may lend support to local universities through the direction of dissertations, service on research committees, and participation in research seminars.
Engage and leverage an eminent Science Council appointed by USRA to review progress of RIACS, including its research, reports, publications, and other matters that would affect or influence the purpose of the Institute. The Science Council also advises the RIACS Director on research projects, priorities, and resource requirements, and reports to USRA on the scientific activity of the Institute.
|
wikipedia
|
wiki_4_chunk_64
|
Algorithm
|
Brute-force or exhaustive search
This is the naive method of trying every possible solution to see which is best.
Divide and conquer
A divide and conquer algorithm repeatedly reduces an instance of a problem to one or more smaller instances of the same problem (usually recursively) until the instances are small enough to solve easily. One such example of divide and conquer is merge sorting. Sorting can be done on each segment of data after dividing data into segments and sorting of entire data can be obtained in the conquer phase by merging the segments. A simpler variant of divide and conquer is called a decrease and conquer algorithm, which solves an identical subproblem and uses the solution of this subproblem to solve the bigger problem. Divide and conquer divides the problem into multiple subproblems and so the conquer stage is more complex than decrease and conquer algorithms. An example of a decrease and conquer algorithm is the binary search algorithm.
Search and enumeration
Many problems (such as playing chess) can be modeled as problems on graphs. A graph exploration algorithm specifies rules for moving around a graph and is useful for such problems. This category also includes search algorithms, branch and bound enumeration and backtracking.
Randomized algorithm
Such algorithms make some choices randomly (or pseudo-randomly). They can be very useful in finding approximate solutions for problems where finding exact solutions can be impractical (see heuristic method below). For some of these problems, it is known that the fastest approximations must involve some randomness. Whether randomized algorithms with polynomial time complexity can be the fastest algorithms for some problems is an open question known as the P versus NP problem. There are two large classes of such algorithms:
Monte Carlo algorithms return a correct answer with high-probability. E.g. RP is the subclass of these that run in polynomial time.
Las Vegas algorithms always return the correct answer, but their running time is only probabilistically bound, e.g. ZPP.
Reduction of complexity
This technique involves solving a difficult problem by transforming it into a better-known problem for which we have (hopefully) asymptotically optimal algorithms. The goal is to find a reducing algorithm whose complexity is not dominated by the resulting reduced algorithm's. For example, one selection algorithm for finding the median in an unsorted list involves first sorting the list (the expensive portion) and then pulling out the middle element in the sorted list (the cheap portion). This technique is also known as transform and conquer.
Back tracking
In this approach, multiple solutions are built incrementally and abandoned when it is determined that they cannot lead to a valid full solution.
|
wikipedia
|
wiki_39905_chunk_6
|
Religious and political symbols in Unicode
|
{| class="wikitable" style="text-align:center"
|-
! Symbol !! Code point !! Name
|-
| || U+1F7A1 || style="text-align:left" | THIN GREEK CROSS
|-
| || U+1F7A2 || style="text-align:left" | LIGHT GREEK CROSS
|-
| || U+1F7A3 || style="text-align:left" | MEDIUM GREEK CROSS
|-
| || U+1F7A4 || style="text-align:left" | BOLD GREEK CROSS
|-
| || U+1F7A5 || style="text-align:left" | VERY BOLD GREEK CROSS
|-
| || U+1F7A6 || style="text-align:left" | VERY HEAVY GREEK CROSS
|-
| || U+1F7A7 || style="text-align:left" | EXTREMELY HEAVY GREEK CROSS
|}
|
wikipedia
|
wiki_29364_chunk_3
|
Ellen Buckingham Mathews
|
Bibliography
Comin’ Thro' the Rye, 1875
The Token of the Silver Lily, 1877. Poetry
Cherry Ripe!: A Romance, 1878
Land o' the Leal, 1878
As He Comes up the Stair, 1878
My Lady Greensleeves, 1879
Story of a Sin, 1882
Eyre's Acquittal, 1883
Sam's Sweetheart, 1883
Jock o' Hazelgreen, 1884 (also contains "The Land o' the Leal" and other stories)
Found Out: A Story, 1885
Murder or Manslaughter, 1885
The Fashion of this World, 1886
Blind Justice, 1890
The Mystery of No 13, 1891
My Jo, John: A Novel, 1891
T'other Dear Charmer, 1892
The Fate of Fenella, 1892. Mathers contributed one chapter to this multi-author novel.
A Study of a Woman, 1893
What the Glass Told, 1893
A Man of Today, 1894
The Lovely Malincourt: A Novel, 1895
The Rebel, 1896
The Juggler and the Soul, 1896
The Sin of Hagar, 1896
Bam Wildfire: A Character Sketch, 1898
Becky, 1900
Cinders: A Novel, 1901
Honey, 1902
Venus Victrix (What the Glass Told; The Mystery of No. 13; What the Glass Told; My Jo, John), 1902
Dahlia and Other Stories, 1903
Dimples, 1903
Griff of Griffithscourt, 1903
The Face in the Mirror and Other Stories, 1903
The New Lady Teazle and other stories, 1903
Side-shows, 1904
The Ferryman, 1905
Tally, Ho!, 1906
Pigskin and Petticoat, 1907
The Pirouette and Other Stories (2nd edition, 1907)
Gay Lawless, 1908
Love the Thief, 1909
Man is Fire, Woman is Tow and Other Stories, 1912
|
wikipedia
|
wiki_39854_chunk_2
|
Yerevan Computer Research and Development Institute
|
Portfolio includes the following products:
Measurement and control system used at various utility distribution networks, such as electrical, natural gas, water, and thermal energy, for measurement, control, and management purposes;
Communication security systems implemented at a number of government agencies and commercial banks;
Management information systems used by social security, health care, pension, and other government agencies and organizations;
Optical character recognition and text-to-speech systems.
Yerevan Computer Research and Development Institute has extensive experience in the design, development, and implementation of large computerized systems, software and hardware solutions for radio electronics industry, specialized systems, and customized software products.
|
wikipedia
|
wiki_16318_chunk_1
|
List of films about computers
|
Artificial intelligence
2001: A Space Odyssey (1968)
HAL 9000
The Computer Wore Tennis Shoes (1969)
Colossus: The Forbin Project (1970)
The Aries Computer (1972)
The Questor Tapes (1974)
Demon Seed (1977)
Blade Runner (1982)
Tron (1982)
WarGames (1983)
Brainstorm (1983)
2010 (1984)
HAL 9000
SAL 9000
Hide and Seek (1984, TV movie)
Electric Dreams (1984)
The Terminator (1984)
Terminator
Skynet
D.A.R.Y.L. (1985)
Flight of the Navigator (1986)
Short Circuit (1986)
Not Quite Human (1987)
Short Circuit 2 (1988)
Not Quite Human II (1989)
Still Not Quite Human (1992)
Arcade (1993)
Star Trek Generations (1994)
Hackers (1995)
Johnny Mnemonic (1995)
The Net (1995)
Star Trek: First Contact (1996)
Enemy of the State (1998)
Lost in Space (1998)
Star Trek: Insurrection (1998)
Bicentennial Man (1999)
The Matrix (1999)
The Thirteenth Floor (1999)
Universal Soldier: The Return (1999)
Virus (1999)
A.I. Artificial Intelligence (2001)
How to Make a Monster (2001)
Swordfish (2001)
S1M0NE (2002)
Star Trek: Nemesis (2002)
The Matrix Reloaded (2003)
The Matrix Revolutions (2003)
I Robot (2004)
The Hitchhiker's Guide to the Galaxy (2005)
Live Free or Die Hard (2007)
Eagle Eye (2008)
Iron Man (2008)
Moon (2009)
GERTY 3000
Iron Man 2 (2010)
Person Of Interest (2011-2016)
Wreck-It Ralph (2012)
Computer Chess (2013)
Her (2013)
Iron Man 3 (2013)
The Machine (2013)
Automata (2014)
Transcendence (2014)
Interstellar (2014).
Vice (2015)
Ex Machina (2015).
Avengers: Age of Ultron (2015).
Morgan (2016) Computers
Motion pictureDesk Set (1957)The Honeymoon Machine (1961)Alphaville (1965)Billion Dollar Brain (1967)The Andromeda Strain (1971)Revenge of the Nerds (1984)The Machine That Changed the World (1992, TV miniseries)The Tower (1993, TV movie)Code Rush (2000)The Code (2001 film) (2001)Revolution OS (2001)The First $20 Million Is Always the Hardest (2002)Micro Men (2009)Jobs (2013)The Imitation Game (2014)Steve Jobs (2015)
|
wikipedia
|
wiki_25050_chunk_2
|
Sums of powers
|
Newton's identities express the sum of the kth powers of all the roots of a polynomial in terms of the coefficients in the polynomial.
The sum of cubes of numbers in arithmetic progression is sometimes another cube.
The Fermat cubic, in which the sum of three cubes equals another cube, has a general solution.
The power sum symmetric polynomial is a building block for symmetric polynomials.
The sum of the reciprocals of all perfect powers including duplicates (but not including 1) equals 1.
The Erdős–Moser equation, where and are positive integers, is conjectured to have no solutions other than 11 + 21 = 31.
The sums of three cubes cannot equal 4 or 5 modulo 9, but it is unknown whether all remaining integers can be expressed in this form.
The sums of powers Sm(z, n) = zm + (z+1)m + ... + (z+n−1)m is related to the Bernoulli polynomials Bm(z) by (∂n−∂z) Sm(z, n) = Bm(z) and (∂2λ−∂Z) S2k+1(z, n) = Ŝ′k+1(Z) where Z = z(z−1), λ = S1(z, n), Ŝk+1(Z) ≡ S2k+1(0, z).
The sum of the terms in the geometric series is
|
wikipedia
|
wiki_11487_chunk_2
|
SIESTA (computer program)
|
Features
SIESTA has these main characteristics:
It uses the standard Kohn-Sham selfconsistent density functional method in the local density (LDA-LSD) and generalized gradient (GGA) approximations, as well as in a non local functional that includes van der Waals interactions (VDW-DF).
It uses norm-conserving pseudopotentials in their fully nonlocal (Kleinman-Bylander) form.
It uses atomic orbitals as a basis set, allowing unlimited multiple-zeta and angular momenta, polarization and off-site orbitals. The radial shape of every orbital is numerical and any shape can be used and provided by the user, with the only condition that it has to be of finite support, i.e., it has to be strictly zero beyond a user-provided distance from the corresponding nucleus. Finite-support basis sets are the key for calculating the Hamiltonian and overlap matrices in O(N) operations.
Projects the electron wavefunctions and density onto a real-space grid in order to calculate the Hartree and exchange-correlation potentials and their matrix elements.
Besides the standard Rayleigh-Ritz eigenstate method, it allows the use of localized linear combinations of the occupied orbitals (valence-bond or Wannier-like functions), making the computer time and memory scale linearly with the number of atoms. Simulations with several hundred atoms are feasible with modest workstations.
It is written in Fortran 95 and memory is allocated dynamically.
It may be compiled for serial or parallel execution (under MPI).
|
wikipedia
|
wiki_24855_chunk_4
|
Government College of Engineering, Tirunelveli
|
Chemistry
Analytical and applied chemistry and forms an integral part of the first year curriculum led by Dr. Sophie Beulah. Some of the research equipment available are: B.O.D., Photo calorimeter, Water and soil analysis kit and Muffle furnace Physics
Equipment available: mechanical shaker, Flash and fire point apparatus, Electronic weighing balance etc., Spectrophotometer, Spectrometer, Electron microscope, Sonometer, Deflection magnetometer,
Ultrasonic interferometer.
|
wikipedia
|
wiki_11318_chunk_3
|
Carboxymethyl cellulose
|
The functional properties of CMC depend on the degree of substitution of the cellulose structure (i.e., how many of the hydroxyl groups have taken part in the substitution reaction), as well as the chain length of the cellulose backbone structure and the degree of clustering of the carboxymethyl substituents. Uses
|
wikipedia
|
wiki_1240_chunk_23
|
Lambert W function
|
Bernoulli numbers and Todd genus
The equation (linked with the generating functions of Bernoulli numbers and Todd genus): can be solved by means of the two real branches and : This application shows that the branch difference of the function can be employed in order to solve other transcendental equations. Statistics
The centroid of a set of histograms defined with respect to the symmetrized Kullback–Leibler divergence (also called the Jeffreys divergence ) has a closed form using the Lambert function.
|
wikipedia
|
wiki_17268_chunk_9
|
Pendulum (mechanics)
|
Figure 4 shows the relative errors using the power series. is the linear approximation, and to include respectively the terms up to the 2nd to the 10th powers. Power series solution for the elliptic integral
Another formulation of the above solution can be found if the following Maclaurin series: is used in the Legendre polynomial solution above.
The resulting power series is: more fractions available in the On-Line Encyclopedia of Integer Sequences with having the numerators and having the denominators. Arithmetic-geometric mean solution for elliptic integral
Given and the arithmetic–geometric mean solution of the elliptic integral:
|
wikipedia
|
wiki_26493_chunk_18
|
Comparison of programming languages (associative array)
|
CFML
A structure in CFML is equivalent to an associative array: dynamicKeyName = "John Doe";
phoneBook = {
"Sally Smart" = "555-9999",
"#dynamicKeyName#" = "555-4321",
"J. Random Hacker" = "555-1337",
UnknownComic = "???"
};
writeOutput(phoneBook.UnknownComic); // ???
writeDump(phoneBook); // entire struct Cobra
Initializing an empty dictionary and adding items in Cobra:
|
wikipedia
|
wiki_2604_chunk_12
|
Quine–McCluskey algorithm
|
{| class="wikitable"
|-
! Numberof 1s !! Minterm !! 0-Cube !! colspan = "2" | Size 2 Implicants !! colspan = "2" | Size 4 Implicants
|-
| rowspan="4" | 1
| m4 || || m(4,12) || || m(8,9,10,11) ||
|-
| m8 || || m(8,9) || || m(8,10,12,14) ||
|-
| || || m(8,10) || ||colspan = "2"
|-
| || || m(8,12) || ||colspan = "2"
|-
| rowspan="4" | 2
| m9 || || m(9,11) || || m(10,11,14,15) ||
|-
| m10 || || m(10,11) || ||colspan = "2"
|-
| || || m(10,14) || ||colspan = "2"
|-
| m12 || || m(12,14) || ||colspan = "2"
|-
| rowspan="2" | 3
| m11 || || m(11,15) || ||colspan = "2"
|-
| m14 || || m(14,15) || ||colspan = "2"
|-
| rowspan="1" | 4
| m15 || ||
|
| colspan = "2"
|}
|
wikipedia
|
wiki_18_chunk_47
|
APL (programming language)
|
Sorting
The following expression sorts a word list stored in matrix X according to word length: X[⍋X+.≠' ';] Game of Life
The following function "life", written in Dyalog APL, takes a boolean matrix and calculates the new generation according to Conway's Game of Life. It demonstrates the power of APL to implement a complex algorithm in very little code, but it is also very hard to follow unless one has advanced knowledge of APL. life ← {⊃1 ⍵ ∨.∧ 3 4 = +/ +⌿ ¯1 0 1 ∘.⊖ ¯1 0 1 ⌽¨ ⊂⍵}
|
wikipedia
|
wiki_5030_chunk_2
|
1969–70 United States network television schedule
|
Tuesday
{| class="wikitable" style="width:100%;margin-right:0;text-align:center"
|-
! style="background-color:#C0C0C0;text-align:center"| Network
! style="background-color:#C0C0C0;text-align:center"| 7:30 PM
! style="background-color:#C0C0C0;text-align:center"| 8:00 PM
! style="background-color:#C0C0C0;text-align:center"| 8:30 PM
! style="background-color:#C0C0C0;text-align:center"| 9:00 PM
! style="background-color:#C0C0C0;text-align:center"| 9:30 PM
! style="background-color:#C0C0C0;text-align:center"| 10:00 PM
! style="background-color:#C0C0C0;text-align:center"| 10:30 PM
|-
! ABC
| bgcolor="#FF00FF" colspan="2" | The Mod Squad (23/20.8)
| bgcolor="#FF00FF" colspan="3" | ABC Movie of the Week (22/20.9)
| bgcolor="#FFFF00" colspan="2" | Marcus Welby, M.D. (8/23.7)
|-
! CBS
| colspan="2" bgcolor="#F0F0F0" |Lancer
| bgcolor="#FFFF00" colspan="2"|The Red Skelton Hour (7/23.8)
| bgcolor="#F0F0F0" | The Governor & J.J.
| bgcolor="#F0F0F0" colspan="2" | CBS News Hour / 60 Minutes
|-
! NBC
| bgcolor="#F0F0F0" | I Dream of Jeannie
| bgcolor="#F0F0F0" | The Debbie Reynolds Show| bgcolor="#FF00FF" | Julia (28/20.1)
| bgcolor="#F0F0F0" colspan="4" | NBC Tuesday Night at the Movies / First Tuesday (once a month)
|}
|
wikipedia
|
wiki_1791_chunk_2
|
Borůvka's algorithm
|
The following pseudocode illustrates a basic implementation of Borůvka's algorithm.
In the conditional clauses, every edge uv is considered cheaper than "None". The purpose of the completed variable is to determine whether the forest F is yet a spanning forest.
|
wikipedia
|
wiki_16987_chunk_6
|
Turnpike (software)
|
The British Science Museum Group has among its collection a copy of an early version of the software in its original packaging. References External links
Unofficial FAQ for users of Turnpike Six (2001)
Demon.ip.support.turnpike newsgroup Usenet clients
Email clients
Discontinued internet suites
|
wikipedia
|
wiki_24026_chunk_19
|
Multiservice tactical brevity code
|
T
Tactical Request/directive to switch to tactical control.
Tag (system Known identification of a specific (system) at the stated location; may be used w/position) with IDM data message, (for example, tag data).
Tally Sighting of a target, bandit, bogey, or enemy position; opposite of no joy.
Target () Directive to assign group responsibility to aircraft in a flight.
Targeted () Group responsibility has been met.
Ten seconds Directive to terminal controller to stand by for laser on call in approximately 10 seconds.
Terminate
Stop laser illumination of a target.
Cease local engagement without affecting the overall exercise.
Threat Untargeted hostile/bandit/bogey within pre-briefed range/aspect of a (direction) friendly.
Throttles Reduction in power to decrease IR signature.
Tied Positive radar contact with element/aircraft.
Tiger Enough fuel and ordnance to accept a commit.
Timber Air control network participating group (NPG) of tactical digital information links (Link 16/TADIL J).
Track Any detected point of contact visible on a radar or sonar display console, each identified by a unique number.
Tracking
Fire control system has solid lock on target (aka a "stabilized gun solution").
Continuous illumination of a target.
Contact heading.
Trailer The last aircraft within a group(s).
Trashed Informative call that missile has been defeated.
Trespass The addressed flight is entering a surface/air threat ring of a specific system at the stated (position) location.
Tucker 76mm gun.
Tumbleweed Indicates limited situational awareness; no joy, blind; a request for information.
|
wikipedia
|
wiki_15919_chunk_0
|
List of MeSH codes (B08)
|
The following is a partial list of the "B" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (B07). Codes following these are found at List of MeSH codes (C01). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – mesomycetozoea – rhinosporidium The list continues at List of MeSH codes (C01). B08
|
wikipedia
|
wiki_22361_chunk_2
|
Catholic Faith Network
|
Program titles
A partial listing of CFN's programs:
CFN News
Catholic Preservatives - with Bishop William Murphy
Chaplet of Divine Mercy
Choices We Face
Conversation with Cardinal Dolan
CHS Presents: Lifestyles
CHS Presents: Dr. O: Faithfully Transforming Health Care
Daily Mass from St. Agnes Cathedral (Rockville Centre, New York) (Long Island, New York)
Daily Mass from St. Patrick's Cathedral (New York City)
Encounter - with Bishop John Barres
Family Comes First - Hosted by Vincent J. Russo and Victoria Roberts Drogin. Looks at the challenge of real-life families and offers resources and advice from experts.
God Is Good - Hosted by Father Charles Mangano and his sister Laurie who share their gifts of song and prayer.
Guided by Grace - Panel discussion where Catholic women discuss experiences of faith and spirituality while exploring issues of Catholicism.
Holy Rosary
Hope & Mercy
It's a Wonderful Life...
Joy of Music
La Santa Misa
Life is Worth Living
Living Scripture - Reflections of meaning and message on the Holy Scripture.
Living Your Faith
Miraculous Medal Novena - Devotion to Our Lady of the Miraculous Medal, hosted by Monsignor Jim Vlaun.
Molloy College - The Public Square 2.0
Papal Audience
Real Food - Hosted by Monsignor Jim Vlaun, bringing faith into the kitchen discussing things like faith, family, and the importance of breaking bread together. Includes special guest chefs.
Spanish Rosary
St. Ann's Novena
Sharing Knowledge: St. John's University
Transforming Communities - Explores how St. Joseph's College (New York) works to uphold positive values and reach out to their community.
Tomorrow's Hope
Word: Alive and Well
Word On Fire Hosted by Robert Barron
The Word
World Seen From The Vatican (Rome Reports)
|
wikipedia
|
wiki_6940_chunk_6
|
The Monty Python Instant Record Collection
|
Faux album titles listed on packaging
As mentioned above, the record jacket packaging folds out into the shape of a box, with the actual record sleeve being the lid of the box. The remainder of the box appears as a stack of records (the "instant record collection") with one face of the box displaying all the album titles, as listed here:
ROCK AND ROLL IS HERE TO STAY AGAIN!
The Beatles Chauffeurs Live!
RUNNING SONGS AND SURRENDERING BALLADS: THE MASSED BANDS OF THE QUEENS OWN COWARDS (OR SOME OF THEM)
ETERNALLY YOURS - THE MASSED WINDSCALE MARCHING SCIENTISTS
Ron Simon and Geoff Garunkel: Live From The Tennis Club Purley (shows as gold lettering on black record jacket)
TOGETHER AGAIN - FRANK AND IFIELD
My Brain Hurts - THE MORON TABERNACLE CHOIR
THE MILKMAN WHISTLES STOCKHAUSEN - 'A' MILKMAN
When We're Apart The Legs
Friday Night Is Bath Night, J.P.Gumby
WHEN THE CHICKENS ARE ASLEEP - Ramon And Ted
NIXON'S SOLID GOLD DENIALS
Norma Shearer Whistles Duane Eddie
TEACH YOURSELF POWER
THE BEST BITS OF ROLF HARRIS
MONTY PYTHON'S BEST SKETCHES BEGINNING WITH 'R'
HITTING OURSELVES WITH THE LITTLE CURVED BIT ON THE END OF A SHAVING BRUSH - ERIC AND THE LOONIES
MY BRAIN HURTS AND OTHER NATIONAL FRONT MARCHING SONGS
The Best of the Ozmonds Teeth - Vol XI
An Evening with Martin Bormann (and the Trio los Paraguayos)
A NIGHT IN CASABLANCA - THE EVERLY SISTERS
Ron Simon and Geoff Garfunkel: Live From The Tennis Club Purley (shows as black lettering on cream record jacket)
GIVE ME THE MOONLIGHT AND THE GOATS - RAMON AND TED
A MAN WHO ONCE SOLD PAUL MCARTNEY A NEWSPAPER - LIVE!
RAW POWER PUNK KILL BLAST THROTTLE DESTROY - CLODAGH ROTTEN
THE DAVE CLARK FIVE'S WAR SPEECHES
THE BEST OF REGGAE MAUDLING (RASTATORY LABEL)
The Wonderful Sound of Hip Injuries
BEETHOVEN'S PUNK SYMPHONY, IN B FLAT - "THE STINKING BASTARD" (BANDAGES SUPPLIED)
The Horrid Brothers Kill Anyone in Sight
Party Time, Princess "Piano" Margaret
YOUNG, GIFTED, BLACK AND FURRY: RAMON & TED
My Way Or Else - Frank Sinatra
ITS ALL OVER MY FRIEND - EARL k VOMIT AND THE METABOLIC PROCESSES
John, Paul, George And Ringo - The Davenport Brothers
Scottish Airs - The Hamish McFart Singers
I LEFT MY PACEMAKER IN SAN FRANCISCO - DR DeBAKEY
More Songs from the Goole and District Catholic River Wideners Club
BERNARD DELPONT LIVE AT THE BANK NEXT TO THE LONDON PALLADIUM
BRIGHT LIGHTS, SOFT MUSIC, LIVE GOATS - RAMON & TED
FOOTLOOSE AND FANCY FREE - BRITT ECKLAND
A NIGHT ON THE TOWN - BRITT ECKLAND
SMILER - BRITT ECKLAND
GASOLINE ALLEY - BRITT ECKLAND
NEVER A FULL MOMENT - BRITT ECKLAND
AN OLD RAINCOAT WON'T EVER LET YOU DOWN - BRITT ECKLAND
EVERY PICTURE TELLS A STORY - BRITT ECKLAND (shows as black lettering on a yellow record jacket)
ATLANTIC CROSSING - BRITT ECKLAND
EVERY PICTURE TELLS A STORY - BRITT ECKLAND (shows as white letting on a black record jacket)
RASTAMAN - SIR KEITH JOSEPH (deleted)
I'VE GOT A BEER GLASS STICKING IN MY HEAD AND OTHER RUGBY SONGS
ACCOUNTANTS WORK SONGS
RULING SONGS AND BALLADS - H.M. THE QUEEN AND THE JORDANAIRES
I'M IN THE MOOD FOR LOVE AND GOATS AND CHICKENS: RAMON AND TED
Pet Smells - The Beach Boys
MONTY PYTHON TRIES IT ON AGAIN
BOEING BOEING (cast album)
BONG BANGY BING!
BANG GOES BOING!
BACK IS BING!
BING IS BACK!
Tom Jones Hits Frank Sinatra While Vic Damone And Mel Torme Grab Englebert Humberdink, At Las Vegas
YOU AND THE NIGHT AND THE MUSIC AND THE CHICKEN: RAMON AND TED
Get Bach - The Best Of The Welsh Beatles
THE PIC OF THE BEST OF SOME RECENTLY REPEATED PYTHON HITS AGAIN, VOL II
|
wikipedia
|
wiki_387_chunk_35
|
Mathematical model
|
Model of rational behavior for a consumer. In this model we assume a consumer faces a choice of n commodities labeled 1,2,...,n each with a market price p1, p2,..., pn. The consumer is assumed to have an ordinal utility function U (ordinal in the sense that only the sign of the differences between two utilities, and not the level of each utility, is meaningful), depending on the amounts of commodities x1, x2,..., xn consumed. The model further assumes that the consumer has a budget M which is used to purchase a vector x1, x2,..., xn in such a way as to maximize U(x1, x2,..., xn). The problem of rational behavior in this model then becomes a mathematical optimization problem, that is:
subject to:
This model has been used in a wide variety of economic contexts, such as in general equilibrium theory to show existence and Pareto efficiency of economic equilibria.
Neighbour-sensing model is a model that explains the mushroom formation from the initially chaotic fungal network.
In computer science, mathematical models may be used to simulate computer networks.
In mechanics, mathematical models may be used to analyze the movement of a rocket model.
|
wikipedia
|
wiki_18775_chunk_3
|
Models of DNA evolution
|
The models described on this page describe the evolution of a single site within a set of sequences. They are often used for analyzing the evolution of an entire locus by making the simplifying assumption that different sites evolve independently and are identically distributed. This assumption may be justifiable if the sites can be assumed to be evolving neutrally. If the primary effect of natural selection on the evolution of the sequences is to constrain some sites, then models of among-site rate-heterogeneity can be used. This approach allows one to estimate only one matrix of relative rates of substitution, and another set of parameters describing the variance in the total rate of substitution across sites.
|
wikipedia
|
wiki_14573_chunk_4
|
Function point
|
There is currently no ISO recognized FSM Method that includes algorithmic complexity in the sizing result. Recently there have been different approaches proposed to deal with this perceived weakness, implemented in several commercial software products. The variations of the Albrecht-based IFPUG method designed to make up for this (and other weaknesses) include:
|
wikipedia
|
wiki_4702_chunk_13
|
Sri Venkateswara College of Engineering
|
The Department of Information Technology (Dr C Yaaswanth, Associate Professor-PI), received a research grant of Rs.17.27 Lakhs from ISRO under RESPOND JRF scheme for the period of three years (2021-2024). Recently, the Department of Biotechnology (Dr P K Praveen Kumar , Associate Professor and Dr Michael Gromiha, Professor, IITM ) received a grant of Rs 18.30 lakhs from SERB-DST under the scheme Teacher Associateship for Research Excellance (TARE) for the period of three years (2021-2024).
|
wikipedia
|
wiki_25414_chunk_9
|
Power system simulation
|
Models typically use the following inputs:
Number, size and type of generators with any available mechanical, electrical, and control (governor, voltage regulation, etc.) parameters,
a mix of residential, commercial and industrial load at each bus,
location and specifications for distributed control devices such as tap-changing transformers, switched shunt compensation, static Var compensators, flexible AC transmission systems, etc.,
location and specifications for protection devices such as relays and load shedding, and
location and specifications of any other relevant control and/or protection devices.
The acceptable amount of time it takes grid voltages return to their intended levels is dependent on the magnitude of voltage disturbance, and the most common standard is specified by the CBEMA curve in Figure. 1. This curve informs both electronic equipment design and grid stability data reporting.
|
wikipedia
|
wiki_35356_chunk_12
|
Resilient control systems
|
Resilience Manifold for Design and Operation
The very nature of control systems implies a starting point for the development of resilience metrics. That is, the control of a physical process is based upon quantifiable performance and measures, including first principles and stochastic. The ability to provide this measurement, which is the basis for correlating operational performance and adaptation, then also becomes the starting point for correlation of the data and time variations that can come from the cognitive, cyber-physical sources. Effective understanding is based upon developing a manifold of adaptive capacity that correlates the design (and operational) buffer. For a power system, this manifold is based upon the real and reactive power assets, the controllable having the latitude to maneuver, and the impact of disturbances over time. For a modern distribution system (MDS), these assets can be aggregated from the individual contributions as shown in Fig. 3. For this figure, these assets include: a) a battery, b) an alternate tie line source, c) an asymmetric P/Q-conjectured source, d) a distribution static synchronous compensator (DSTATCOM), and e) low latency, four quadrant source with no energy limit.
|
wikipedia
|
wiki_585_chunk_50
|
The Evolution of Cooperation
|
Software Several software packages have been created to run prisoner's dilemma simulations and tournaments, some of which have available source code. The source code for the second tournament run by Robert Axelrod (written by Axelrod and many contributors in Fortran) is available online
PRISON, a library written in Java, last updated in 1999
Axelrod-Python, written in Python Recommended reading See also Co-operation (evolution) References Bibliography
Most of these references are to the scientific literature, to establish the authority of various points in the article. A few references of lesser authority, but greater accessibility are also included.
|
wikipedia
|
wiki_3778_chunk_8
|
IUPAC nomenclature of organic chemistry
|
Now, following the above steps:
The parent hydrocarbon chain has 23 carbons. It is called tricosa-.
The functional groups with the highest precedence are the two ketone groups.
The groups are on carbon atoms 3 and 9. As there are two, we write 3,9-dione.
The numbering of the molecule is based on the ketone groups. When numbering from left to right, the ketone groups are numbered 3 and 9. When numbering from right to left, the ketone groups are numbered 15 and 21. 3 is less than 15, therefore the ketones are numbered 3 and 9. The smaller number is always used, not the sum of the constituents numbers.
The side chains are: an ethyl- at carbon 4, an ethyl- at carbon 8, and a butyl- at carbon 12. Note: the at carbon atom 15 is not a side chain, but it is a methoxy functional group.
There are two ethyl- groups. They are combined to create, 4,8-diethyl.
The side chains are grouped like this: 12-butyl-4,8-diethyl. (But this is not necessarily the final grouping, as functional groups may be added in between to ensure all groups are listed alphabetically.)
The secondary functional groups are: a hydroxy- at carbon 5, a chloro- at carbon 11, a methoxy- at carbon 15, and a bromo- at carbon 18. Grouped with the side chains, this gives 18-bromo-12-butyl-11-chloro-4,8-diethyl-5-hydroxy-15-methoxy.
There are two double bonds: one between carbons 6 and 7, and one between carbons 13 and 14. They would be called "6,13-diene", but the presence of alkynes switches it to 6,13-dien. There is one triple bond between carbon atoms 19 and 20. It will be called 19-yne.
The arrangement (with punctuation) is: 18-bromo-12-butyl-11-chloro-4,8-diethyl-5-hydroxy-15-methoxytricosa-6,13-dien-19-yne-3,9-dione
Finally, due to cis-trans isomerism, we have to specify the relative orientation of functional groups around each double bond. For this example, we have (6E,13E)
|
wikipedia
|
wiki_3922_chunk_6
|
Locus (mathematics)
|
Examples in plane geometry
Examples from plane geometry include:
The set of points equidistant from two points is a perpendicular bisector to the line segment connecting the two points.
The set of points equidistant from two lines that cross is the angle bisector.
All conic sections are loci:
Circle: the set of points for which the distance from a single point is constant (the radius).
Parabola: the set of points equidistant from a fixed point (the focus) and a line (the directrix).
Hyperbola: the set of points for each of which the absolute value of the difference between the distances to two given foci is a constant.
Ellipse: the set of points for each of which the sum of the distances to two given foci is a constant
|
wikipedia
|
wiki_39150_chunk_1
|
Brooks–Iyengar algorithm
|
Background
The Brooks–Iyengar hybrid algorithm for distributed control in the presence of noisy data combines Byzantine agreement with sensor fusion. It bridges the gap between sensor fusion and Byzantine fault tolerance. This seminal algorithm unified these disparate fields for the first time. Essentially, it combines Dolev's algorithm for approximate agreement with Mahaney and Schneider's fast convergence algorithm (FCA). The algorithm assumes N processing elements (PEs), t of which are faulty and can behave maliciously. It takes as input either real values with inherent inaccuracy or noise (which can be unknown), or a real value with apriori defined uncertainty, or an interval. The output of the algorithm is a real value with an explicitly specified accuracy. The algorithm runs in O(NlogN) where N is the number of PEs. It is possible to modify this algorithm to correspond to Crusader's Convergence Algorithm (CCA), however, the bandwidth requirement will also increase. The algorithm has applications in distributed control, software reliability, High-performance computing, etc.
|
wikipedia
|
wiki_414_chunk_86
|
Nuclear power
|
Overall, many opponents find that nuclear energy cannot meaningfully contribute to climate change mitigation as they find it to be, in overall summary, too dangerous, too expensive, to take too long for deployment and to be an obstacle to achieving a transition towards sustainability and carbon-neutrality, effectively being a distracting competition for resources (i.e. human, financial, time, infrastructure and expertise) for the deployment and development of alternative, sustainable, energy system technologies (such as for wind, ocean and solar–including e.g. floating solar–as well as ways to manage their intermittency other than nuclear baseload generation such as dispatchable generation, renewables-diversification, super grids, flexible energy demand and supply regulating smart grids and energy storage technologies).
|
wikipedia
|
wiki_6675_chunk_9
|
IronPython
|
Examples
The following IronPython script manipulates .NET Framework objects. This script can be supplied by a third-party client-side application developer and passed into the server-side framework through an interface. Note that neither the interface, nor the server-side code is modified to support the analytics required by the client application.
from BookService import BookDictionary
booksWrittenByBookerPrizeWinners = [book.Title for book in BookDictionary.GetAllBooks()
if "Booker Prize" in book.Author.MajorAwards]
In this case, assume that the .NET Framework implements a class, BookDictionary, in a module called BookService, and publishes an interface into which IronPython scripts can be sent and executed.
|
wikipedia
|
wiki_26658_chunk_3
|
XDAIS algorithms
|
Significant reduction in integration time as algorithms do not trash each other's resources
Easy comparison of algorithms from multiple different sources in the same application
Access to broad range of compliant algorithms available from multiple TI DSP Third Parties eliminates need to custom develop complex algorithms
Algorithms work out-of-the-box with eXpressDSP Multimedia Framework Products, such as Codec Engine (TI) See also
eXpressDsp External links
XpressDSP Algorithm Standard – xDAIS Developer’s Kit and xDM
TMS320 DSP Algorithm Standard Developer’s Guide Texas Instruments
Digital signal processing
|
wikipedia
|
wiki_38007_chunk_2
|
Ometepe Biological Field School
|
The conservancy runs a primate field school at Ometepe which has such courses as "Primate Behavior and Ecology", "Advanced Primate Behavior and Ecology", "Primate Conservation", and "Primate Communication". The courses center on the two native primate species of the area: white-faced capuchin monkeys (Cebus capucinus) and Mantled Black Howler Monkeys (Alouatta palliata).
Daily lectures cover a variety of subjects in primatology. Students are divided into small groups to learn skills important to primate field research. Using the forests of Ometepe as classrooms, students learn how to map a trail system; how to conduct vegetation sampling and analysis; methods of assessing food availability; and observation techniques to study the social, feeding, and ranging behavior of primates. Independent Research Projects After completing the field methods section of the class, students begin work on their own projects. Faculty members work closely with students as they undertake this portion of the course. First, each student develops a research proposal detailing the subject to be investigated and the methods to be used. Each student presents his or her proposal to the class. Next, each student must collect data for his or her project; data analysis follows. Finally, students write a final paper on their project and make an oral presentation to the class.
|
wikipedia
|
wiki_1447_chunk_15
|
Computational biology
|
Analysts project that if major medications fail due to patents, that computational biology will be necessary to replace current drugs on the market. Doctoral students in computational biology are being encouraged to pursue careers in industry rather than take Post-Doctoral positions. This is a direct result of major pharmaceutical companies needing more qualified analysts of the large data sets required for producing new drugs. Software and tools
Computational Biologists use a wide range of software. These range from command line programs to graphical and web-based programs.
|
wikipedia
|
wiki_15308_chunk_2
|
Little b (programming language)
|
References
Krieger K "Life in Silico: A Different Kind of Intelligent Design" Science 312(5771):189-190
https://arstechnica.com/uncategorized/2008/07/little-b-project-creates-biology-specific-programming-system/
https://www.computerworld.com/article/2551598/big-things-from-little-b.html External links
Biology enters 'The Matrix' through new computer language EurekAlert article
|
wikipedia
|
wiki_3639_chunk_20
|
Statistics New Zealand
|
All statistical work presents opportunities for error, but it's possible to reduce error to manageable amounts. A statement reads: "An important aim of our ongoing work is to understand, manage, control and report on all known sources of error... which simply reflect the inherent variability that exists among the units we are seeking to measure... This variability manifests itself in sampling error when we use samples for cost-effectiveness reasons to estimate characteristics about a population. Sampling errors are relatively easy to measure.... Other sources reflect process, measurement and inference errors, and are referred to as non-sampling error. It is not possible to eliminate all sources of error. However, our continued efforts at understanding and managing variability and error ensure we are exercising a high level of control on all known sources of error."
|
wikipedia
|
wiki_9280_chunk_3
|
Codd's cellular automaton
|
Comparison of CA rulesets Specification Codd's CA has eight states determined by a von Neumann neighborhood with rotational symmetry. The table below shows the signal-trains needed to accomplish different tasks. Some of the signal trains need to be separated by two blanks (state 1) on the wire to avoid interference, so the 'extend' signal-train used in the image at the top appears here as '70116011'. Universal computer-constructor
|
wikipedia
|
wiki_6147_chunk_8
|
Supramolecular chemistry
|
The value of the equilibrium constant, K, for this reaction can, in principle, be determined by any of the techniques described below. Some examples are shown in the following table. (Steed&Atwood, p.57)
{| class="wikitable"
|+ Log K1,1 values for complexes of medicinal interest in methanol at 25°C
|-
! !! Li+ !! Na+ !! K+ !! Rb+ !! Cs+
|-
! Valinomycin
|| <0.7 || 0.67 || 4.9 || 5.26 || 4.42
|-
! Enniatin
|| 1.28|| 2.42||2.92||2.24|| 2.34
|-
! Nigericin
|| -|| 4.7|| 5.6|| 5.0 || -
|-
!Monensin
|| 3.6 || 6.5|| 5.0||4.3|| 3.6
|}
|
wikipedia
|
wiki_2503_chunk_15
|
Computational fluid dynamics
|
Continuum conservation laws (CCL): Start with the CL. Assume that mass, momentum and energy are locally conserved: These quantities are conserved and cannot "teleport" from one place to another but can only move by a continuous flow (see continuity equation). Another interpretation is that one starts with the CL and assumes a continuum medium (see continuum mechanics). The resulting system of equations is unclosed since to solve it one needs further relationships/equations: (a) constitutive relationships for the viscous stress tensor; (b) constitutive relationships for the diffusive heat flux; (c) an equation of state (EOS), such as the ideal gas law; and, (d) a caloric equation of state relating temperature with quantities such as enthalpy or internal energy.
Compressible Navier-Stokes equations (C-NS): Start with the CCL. Assume a Newtonian viscous stress tensor (see Newtonian fluid) and a Fourier heat flux (see heat flux). The C-NS need to be augmented with a EOS and a caloric EOS to have a closed system of equations.
Incompressible Navier-Stokes equations (I-NS): Start with the C-NS. Assume that density is always and everywhere constant. Another way to obtain the I-NS is to assume that the Mach number is very small and that temperature differences in the fluid are very small as well. As a result, the mass-conservation and momentum-conservation equations are decoupled from the energy-conservation equation, so one only needs to solve for the first two equations.
Compressible Euler equations (EE): Start with the C-NS. Assume a frictionless flow with no diffusive heat flux.
|
wikipedia
|
wiki_29410_chunk_9
|
Network of Disclosure
|
Members who provide a conservation, restoration, or enhancement service must be conducting business under a company name.
Members must clearly advertise their Terms of Service to prospective customers and provide a numerically serialized certificate for each book once services are completed. The certificate shall contain, at a minimum, the following information: issue title, issue number, publication date, and provenance (pedigree, file copy, or collection designation if applicable) along with a description of any and all treatments performed.
Members who provide these services must maintain a database of certificate numbers corresponding to each customer's name, the date services were performed, and before and after high-resolution digital images of the front and rear cover of each book.
|
wikipedia
|
wiki_38266_chunk_3
|
PPA (complexity)
|
There is an un-oriented version of the Sperner lemma known to be complete for PPA.
The consensus-halving problem is known to be complete for PPA.
The problem of searching for a second Hamiltonian cycle on a 3-regular graph is a member of PPA, but is not known to be complete for PPA.
There is a randomized polynomial-time reduction from the problem of integer factorization to problems complete for PPA. References Complexity classes
|
wikipedia
|
wiki_36646_chunk_1
|
GREEN Cell Shipping
|
Background
The propulsion of merchant ships is responsible for approximately 4% of global carbon-dioxide emissions. The industry itself estimated its carbon footprint at 3.3% in 2007. The industry responded officially as early as 2003 by calling for measures to limit or reduce the emissions from international shipping. In order to envision solutions to this challenge, a team of engineers and consultants associated with ABB set up a thought experiment that would pose the question: "How could you power the commercial fleet without fossil fuels?" The core team consisted of three electrical engineers: Jaakko Aho, Jukka Varis and Klaus Vänska, all of Finland. This group laid down a core set of design principles around fossil-free marine propulsion, and described a hypothetical system that was later called the GREEN Cell shipping concept.
|
wikipedia
|
wiki_39130_chunk_9
|
Mama (software)
|
The control instructions available in the bottom of the editor area are:
doInOrder - execute a sequence of instructions sequentially
doTogether - execute a sequence of instructions simultaneously
if - execute a sequence of instructions sequentially only under a given condition
while - execute a sequence of instructions sequentially while a given condition holds
for - execute a sequence of instructions sequentially a given number of times
forAllInOrder - execute a sequence of instructions sequentially iterating over the given collection
forAllTogether - execute a sequence of instructions simultaneously iterating over the given collection
wait - wait a given number of seconds
print - print the given data to the output console
assert - assert that a condition is true, display a message if the condition is false (new in Mama 1.5)
Script - add a free Mama script to the program
# - add a comment to the program
|
wikipedia
|
wiki_1270_chunk_46
|
National Science Foundation Network
|
The Internet - the Launch of NSFNET, National Science Foundation
NSFNET: A Partnership for High-Speed Networking, Final Report 1987-1995, Karen D. Frazer, Merit Network, Inc., 1995
NSF and the Birth of the Internet, National Science Foundation, December 2007
NSFNET notes, summary, photos, reflections, and a video, from Hans-Werner Braun, Co-Principal Investigator for the NSFNET Project at Merit Network, and later, Research Scientist at the University of California, San Diego, and Adjunct Professor at San Diego State University
"Fool Us Once Shame on You—Fool Us Twice Shame on Us: What We Can Learn from the Privatizations of the Internet Backbone Network and the Domain Name System", Jay P. Kesan and Rajiv C. Shah, Washington University Law Review, Volume 79, Issue 1 (2001)
"The Rise of the Internet", one of IBM’s 100 Icons of Progress, by Stephen Grillo, February 11, 2011, highlights IBM's contribution to NSFNET as part of its celebration of IBM's centennial year
Merit Network: A history
NSFNET Link Letter Archive, April 1988 (Vol. 1 No. 1) to July 1994 (Vol. 7 No. 1), text only, a web and FTP site provided by the Finnish IT center for science
Full copies of volumes 4-7, 1991-1994 are also available from the Hathi Trust Digital Library
Reflection on NSFNet
|
wikipedia
|
wiki_1791_chunk_4
|
Borůvka's algorithm
|
algorithm Borůvka is
input: A weighted undirected graph G = (V, E).
output: F, a minimum spanning forest of G.
Initialize a forest F to (V, E') where E' = {}.
completed := false
while not completed do
Find the connected components of F and assign to each vertex its component
Initialize the cheapest edge for each component to "None"
for each edge uv in E, where u and v are in different components of F:
let wx be the cheapest edge for the component of u
if is-preferred-over(uv, wx) then
Set uv as the cheapest edge for the component of u
let yz be the cheapest edge for the component of v
if is-preferred-over(uv, yz) then
Set uv as the cheapest edge for the component of v
if all components have cheapest edge set to "None" then
// no more trees can be merged -- we are finished
completed := true
else
completed := false
for each component whose cheapest edge is not "None" do
Add its cheapest edge to E
function is-preferred-over(edge1, edge2) is return (edge2 is "None") or
(weight(edge1) < weight(edge2)) or
(weight(edge1) = weight(edge2) and tie-breaking-rule(edge1, edge2))
function tie-breaking-rule(edge1, edge2) is The tie-breaking rule; returns true''' if and only if edge1 is preferred over edge2 in the case of a tie.
|
wikipedia
|
wiki_22196_chunk_2
|
FIU College of Engineering and Computing
|
Knight Foundation School of Computing and Information Sciences
Moss School of Construction, Infrastructure and Sustainability
Moss Department of Construction Management
Department of Civil and Environmental Engineering
School of Universal Computing, Construction and Engineering Education
School of Electrical, Computer and Enterprise Engineering
Department of Electrical and Computer Engineering
Department of Enterprise and Logistics Engineering
School of Biomedical, Materials and Mechanical Engineering
Department of Biomedical Engineering
Department of Mechanical and Materials Engineering The College of Engineering and Computing houses 25 facilities, including research centers, institutes and laboratories. Research is conducted both independently and in cooperation with industry leaders and academic institutions, with nearly $50 million in external funding over the last five years from a variety of government and corporate sources
|
wikipedia
|
wiki_7791_chunk_59
|
Chinese mathematics
|
ch.1, computational algorithm, area of plane figures, GCF, LCD
ch.2, proportions
ch.3, proportions
ch.4, square, cube roots, finding unknowns
ch.5, volume and usage of pi as 3
ch.6, proportions
ch,7, interdeterminate equations
ch.8, Gaussian elimination and matrices
ch.9, Pythagorean theorem (Gougu Theorem) Han Dynasty Book on Numbers and Computation 202 BC-186 BC
|
wikipedia
|
wiki_2642_chunk_2
|
Io (programming language)
|
Pure object-oriented based on prototypes
Code-as-data / homoiconic
Lazy evaluation of function parameters
Higher-order functions
Introspection, reflection and metaprogramming
Actor-based concurrency
Coroutines
Exception handling
Incremental garbage collecting supporting weak links
Highly portable
DLL/shared library dynamic loading on most platforms
Small virtual machine Syntax In its simplest form, it is composed of a single identifier:
doStuff
Assuming the above doStuff is a method, it is being called with zero arguments and as a result, explicit parentheses are not required.
|
wikipedia
|
wiki_6537_chunk_176
|
List of dialling codes in Germany
|
090
0900
0900-1 premium-rate information services
0900-3 premium-rate entertainment services
0900-5 premium-rate services (miscellaneous)
0900-9 premium-rate dialer
0901 premium-rate numbers, reserved
0902 replacement for 0137/0138, planned
0906 Donauwörth
0907
09070 Tapfheim
09071 Dillingen
09072 Lauingen
09073 Gundelfingen
09074 Höchstädt
09075 Glött
09076 Wittislingen
09077 Bachhagel
09078 Mertingen
0908
09080 Harburg
09081 Nördlingen
09082 Oettingen
09083 Möttingen
09084 Bissingen
09085 Alerheim
09086 Fremdingen
09087 Marktoffingen
09088 Mönchsdeggingen
09089 Bissingen-Unterringingen
0909
09090 Rain
09091 Monheim
09092 Wemding
09093 Polsingen
09094 Tagmersheim
09097 Marxheim
09099 Kaisheim
|
wikipedia
|
wiki_8401_chunk_6
|
AC-3 algorithm
|
Input:
A set of variables X
A set of domains D(x) for each variable x in X. D(x) contains vx0, vx1... vxn, the possible values of x
A set of unary constraints R1(x) on variable x that must be satisfied
A set of binary constraints R2(x, y) on variables x and y that must be satisfied
Output:
Arc consistent domains for each variable.
function ac3 (X, D, R1, R2)
// Initial domains are made consistent with unary constraints.
for each x in X
D(x) := { vx in D(x) | vx satisfies R1(x) }
// 'worklist' contains all arcs we wish to prove consistent or not.
worklist := { (x, y) | there exists a relation R2(x, y) or a relation R2(y, x) }
do
select any arc (x, y) from worklist
worklist := worklist - (x, y)
if arc-reduce (x, y)
if D(x) is empty
return failure
else
worklist := worklist + { (z, x) | z != y and there exists a relation R2(x, z) or a relation R2(z, x) }
while worklist not empty
function arc-reduce (x, y)
bool change = false
for each vx in D(x)
find a value vy in D(y) such that vx and vy satisfy the constraint R2(x, y)
if there is no such vy {
D(x) := D(x) - vx
change := true
}
return change
|
wikipedia
|
wiki_26153_chunk_1
|
Administrative Controlled Substances Code Number
|
ACSCN tables include the CSA schedule, common alternative chemical and trade names, and the free base conversion ratio (the molecular mass of the substance in question divided by the molecular mass of the free base). This is used to make meaningful qualitative comparisons between substances, and labeling of the end product may, as is required in many European countries, list the active substance using both (e.g. "each tablet contains 120 mg dihydrocodeine bitartrate, representing 80 mg dihydrocodeine base"). This method of citation is in theory compulsory worldwide for substances in Schedule I of the Single Convention on Narcotic Drugs 1961, a classification corresponding to opioids in US Schedule II with Narcotic classification plus cocaine (which inherited a narcotic designation from the 1931 Convention for Limiting the Manufacture and Regulating the Distribution of Narcotic Drugs and preceding treaties and national laws including the 1914 Harrison Narcotics Tax Act) and German Betäubungsmittelgesetz (BtMG) Schedule I and so on. This is also the case for Single Convention Schedule IV, which roughly corresponds to the United States' CSA Schedule I. and CSU Schedule
|
wikipedia
|
wiki_4566_chunk_10
|
Econophysics
|
For potential games, it has been shown that an emergence-producing equilibrium based on information via Shannon information entropy produces the same equilibrium measure (Gibbs measure from statistical mechanics) as a stochastic dynamical equation which represents noisy decisions, both of which are based on bounded rationality models used by economists. The fluctuation-dissipation theorem connects the two to establish a concrete correspondence of "temperature", "entropy", "free potential/energy", and other physics notions to an economics system. The statistical mechanics model is not constructed a-priori - it is a result of a boundedly rational assumption and modeling on existing neoclassical models. It has been used to prove the "inevitability of collusion" result of Huw Dixon in a case for which the neoclassical version of the model does not predict collusion. Here the demand is increasing, as with Veblen goods, stock buyers with the "hot hand" fallacy preferring to buy more successful stocks and sell those that are less successful, or among short traders during a short squeeze as occurred with the WallStreetBets group's collusion to drive up GameStop stock price in 2021.
|
wikipedia
|
wiki_16950_chunk_7
|
Confederate Government Civil War units
|
Misc
Bands, C.S.A.
Bell's Battalion, C.S.A.
Brush Battalion, C.S.A.
Burrough's Battalion, Partisan Rangers (Princess Anne Partisan Rangers)
Click's Company, Ordnance Scouts and Guards, C.S.A.
Confederate Infantry
Cunningham's Ordnance Detachment (Cuyler's Ordnance Detachment)
Davis' Company of Guides, C.S.A.
Engineers, C.S.A.
Exchanged Battalion, C.S.A. (Trans-Mississippi Battalion; Western Battalion)
Gillum's Regiment (Henry Gillum's Regiment; Gillum's Regiment, Mounted Infantry; Gillum's Regiment, Mounted Riflemen)
Infantry School of Practice
Invalid Corps
Jackson's Company, C.S.A.
Lyon's Escort, Forrest's Cavalry, C.S.A.
Madison's Company, Mounted Spies and Guides (Phillips' Mtd. Spies and Guides)
Martin's Escort, C.S.A.
McDaniel's (Captain) Company, Secret Service
Mead's Confederate Cavalry (Mead's Regiment of Partisan Rangers)
Miscellaneous Indian Records
Nitre and Mining Bureau, War Department, C.S.A.,
Ochiltree's Detachment of Recruits (Detachment of Regulars)
President's Guard, C.S.A.
Reserve Corps Artillery, Army of Northern Virginia)
Sappers and Miners
Signal Corps, C.S.A.
Stirman's Regiment, Sharp Shooters
Young's (5th) Company, Retributors
|
wikipedia
|
wiki_14344_chunk_6
|
Blake Caracella
|
|- style="background-color: #EAEAEA"
! scope="row" style="text-align:center" | 1997
|style="text-align:center;"|
| 33 || 17 || 25 || 18 || 187 || 103 || 290 || 84 || 15 || 1.5 || 1.1 || 11.0 || 6.1 || 17.1 || 4.9 || 0.9
|-
! scope="row" style="text-align:center" | 1998
|style="text-align:center;"|
| 33 || 16 || 13 || 7 || 149 || 97 || 246 || 78 || 24 || 0.8 || 0.4 || 9.3 || 6.1 || 15.4 || 4.9 || 1.5
|-style="background:#eaeaea;"
! scope="row" style="text-align:center" | 1999
|style="text-align:center;"|
| 33 || 24 || 31 || 26 || 210 || 122 || 332 || 77 || 26 || 1.3 || 1.1 || 8.8 || 5.1 || 13.8 || 3.2 || 1.1
|-
! scope="row" style="text-align:center" | 2000
|style="text-align:center;"|
| 33 || 24 || 35 || 17 || 270 || 219 || 489 || 138 || 43 || 1.5 || 0.7 || 11.3 || 9.1 || 20.4 || 5.8 || 1.8
|-style="background:#eaeaea;"
! scope="row" style="text-align:center" | 2001
|style="text-align:center;"|
| 33 || 21 || 25 || 11 || 256 || 177 || 433 || 120 || 29 || 1.2 || 0.5 || 12.2 || 8.4 || 20.6 || 5.7 || 1.4
|-
! scope="row" style="text-align:center" | 2002
|style="text-align:center;"|
| 33 || 24 || 22 || 14 || 287 || 151 || 438 || 111 || 43 || 0.9 || 0.6 || 12.0 || 6.3 || 18.3 || 4.6 || 1.8
|-style="background:#eaeaea;"
! scope="row" style="text-align:center" | 2003
|style="text-align:center;"|
| 1 || 18 || 17 || 16 || 177 || 95 || 272 || 86 || 33 || 0.9 || 0.9 || 9.8 || 5.3 || 15.1 || 4.8 || 1.8
|-
! scope="row" style="text-align:center" | 2004
|style="text-align:center;"|
| 1 || 16 || 16 || 11 || 139 || 86 || 225 || 61 || 25 || 1.0 || 0.7 || 8.7 || 5.4 || 14.1 || 3.8 || 1.6
|-style="background:#eaeaea;"
! scope="row" style="text-align:center" | 2005
|style="text-align:center;"|
| 10 || 21 || 34 || 19 || 155 || 101 || 256 || 88 || 22 || 1.6 || 0.9 || 7.4 || 4.8 || 12.2 || 4.2 || 1.0
|-
! scope="row" style="text-align:center" | 2006
|style="text-align:center;"|
| 10 || 6 || 0 || 2 || 65 || 44 || 109 || 33 || 8 || 0.0 || 0.3 || 10.8 || 7.3 || 18.2 || 5.5 || 1.3
|- class="sortbottom"
! colspan=3| Career
! 187
! 218
! 141
! 1895
! 1195
! 3090
! 876
! 268
! 1.2
! 0.8
! 10.1
! 6.4
! 16.5
! 4.7
! 1.4
|}
|
wikipedia
|
wiki_23772_chunk_18
|
Renewable energy in Africa
|
Energy sector regulators as facilitators
The funding of renewable energy (RE) projects is dependent on the credibility of the institutions developing and implementing RE policy. This places a particular burden on the energy regulators in Africa, whose professional staff may be few in number and who have track records of only a decade or so. Rules (micro policies) made by regulators are subsidiary to overall government RE policy and depend on some delegation of authority from the state. Nevertheless, there are instances when the sector regulator can pro-active on behalf of customer and utility concerns—providing facts, reports, and public statements that build a case for care in the design of public policy towards RE. Clean and renewable energy is likely to be of concern to a number of organizations. Interaction between multiple authorities requires coordination to align policies, incentives, and administrative processes (including licensing and permitting). Of course, the making of policy by regulators is incidental to and inherent in their duty to decide specific cases or disputes. This micro policy-making role is derived from the fact that macro RE policy cannot reasonably be expected to anticipate all aspects of policy that will have to evolve for the regulatory process to be fully functional. This point is particularly important in the area of renewable energy, with its rapidly changing technologies and ever-changing public (and political) attitudes. Gaps will have to be filled and it is the regulators, with their functional responsibilities, technical expertise, and hands-on experience that are best positioned to accomplish that task in developing countries. Thus, for designing auctions for purchasing power, for establishing feed-in tariffs, or other instruments promoting RE, the energy sector regulator has a significant impact on the penetration of RE in Africa and other regions.
|
wikipedia
|
wiki_281_chunk_61
|
Icon (programming language)
|
procedure main()
s := "Mon Dec 8"
s ? write(Mdate() | "not a valid date")
end
# Define a matching function that returns
# a string that matches a day month dayofmonth
procedure Mdate()
# Define some initial values
static dates
static days
initial {
days := ["Mon","Tue","Wed","Thr","Fri","Sat","Sun"]
months := ["Jan","Feb","Mar","Apr","May","Jun",
"Jul","Aug","Sep","Oct","Nov","Dec"]
}
every suspend (retval <- tab(match(!days)) || # Match a day
=" " || # Followed by a blank
tab(match(!months)) || # Followed by the month
=" " || # Followed by a blank
matchdigits(2) # Followed by at least 2 digits
) &
(=" " | pos(0) ) & # Either a blank or the end of the string
retval # And finally return the string
end
# Matching function that returns a string of n digits
procedure matchdigits(n)
suspend (v := tab(many(&digits)) & *v <= n) & v
end
|
wikipedia
|
wiki_13631_chunk_2
|
Trace vector decoder
|
Motorola 680x0
The Motorola 68000 has an instruction-by-instruction tracing facility. When its trace state is enabled, the processor automatically forces a trace exception after each (non-exception) instruction is executed. The following assembly code snippet is an example of a program initializing a trace exception handler on a 68000 system.
InstallHandler: MOVE.L #$4E730000,-(SP) ; Push trace exception handler on to stack
MOVE.L #$00000010,-(SP)
MOVE.L #$0004DDB9,-(SP)
MOVE.L #$BD96BDAE,-(SP)
MOVE.L #$B386B586,-(SP)
MOVE.L #$D046D246,-(SP)
MOVE.L #$0246A71F,-(SP)
MOVE.L #$00023C17,-(SP)
MOVE.W #$2C6F,-(SP)
MOVE.L SP,($24).W ; Set trace exception handler vector
ORI.W #$A71F,SR ; Enable trace state
NOP ; CPU generates a trace exception after executing this NOP
;------------------------
... ; Code from this line would be encrypted
|
wikipedia
|
wiki_97_chunk_59
|
C (programming language)
|
The following example using modern C (C99 or later) shows allocation of a two-dimensional array on the heap and the use of multi-dimensional array indexing for accesses (which can use bounds-checking on many C compilers):
int func(int N, int M)
{
float (*p)[N][M] = malloc(sizeof *p);
if (!p)
return -1;
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
(*p)[i][j] = i + j;
print_array(N, M, p);
free(p);
return 1;
}
|
wikipedia
|
wiki_3901_chunk_12
|
Building code
|
The purpose of building codes is to provide minimum standards for safety, health, and general welfare including structural integrity, mechanical integrity (including sanitation, water supply, light, and ventilation), means of egress, fire prevention and control, and energy conservation.
Building codes generally include:
Standards for structure, placement, size, usage, wall assemblies, fenestration size/locations, egress rules, size/location of rooms, foundations, floor assemblies, roof structures/assemblies, energy efficiency, stairs and halls, mechanical, electrical, plumbing, site drainage & storage, appliance, lighting, fixtures standards, occupancy rules, and swimming pool regulations
Rules regarding parking and traffic impact
Fire code rules to minimize the risk of a fire and to ensure safe evacuation in the event of such an emergency
Requirements for earthquake (seismic code), hurricane, flood, and tsunami resistance, especially in disaster prone areas or for very large buildings where a failure would be catastrophic
Requirements for specific building uses (for example, storage of flammable substances, or housing a large number of people)
Energy provisions and consumption
Grandfather clauses: Unless the building is being renovated, the building code usually does not apply to existing buildings.
Specifications on components
Allowable installation methodologies
Minimum and maximum room ceiling heights, exit sizes and location
Qualification of individuals or corporations doing the work
For high structures, anti-collision markers for the benefit of aircraft
|
wikipedia
|
wiki_964_chunk_27
|
Fusion power
|
Measurement
The diagnostics of a fusion scientific reactor are extremely complex and varied. The diagnostics required for a fusion power reactor will be various but less complicated than those of a scientific reactor as by the time of commercialization, many real-time feedback and control diagnostics will have been perfected. However, the operating environment of a commercial fusion reactor will be harsher for diagnostic systems than in a scientific reactor because continuous operations may involve higher plasma temperatures and higher levels of neutron irradiation. In many proposed approaches, commercialization will require the additional ability to measure and separate diverter gases, for example helium and impurities, and to monitor fuel breeding, for instance the state of a tritium breeding liquid lithium liner. The following are some basic techniques.
Flux loop: a loop of wire is inserted into the magnetic field. As the field passes through the loop, a current is made. The current measures the total magnetic flux through that loop. This has been used on the National Compact Stellarator Experiment, the polywell, and the LDX machines. A Langmuir probe, a metal object placed in a plasma, can be employed. A potential is applied to it, giving it a voltage against the surrounding plasma. The metal collects charged particles, drawing a current. As the voltage changes, the current changes. This makes an IV Curve. The IV-curve can be used to determine the local plasma density, potential and temperature.
Thomson scattering: 'Light scatters' from plasma can be used to reconstruct plasma behavior, including density and temperature. It is common in Inertial confinement fusion, Tokamaks, and fusors. In ICF systems, firing a second beam into a gold foil adjacent to the target makes x-rays that traverse the plasma. In tokamaks, this can be done using mirrors and detectors to reflect light.
Neutron detectors: Several types of neutron detectors can record the rate at which neutrons are produced.
X-ray detectors Visible, IR, UV, and X-rays are emitted anytime a particle changes velocity. If the reason is deflection by a magnetic field, the radiation is cyclotron radiation at low speeds and synchrotron radiation at high speeds. If the reason is deflection by another particle, plasma radiates X-rays, known as Bremsstrahlung radiation.
|
wikipedia
|
wiki_37237_chunk_2
|
Archive of Applied Mechanics
|
New analytical, numerical and experimental methods suited to research in the above mentioned subjects are welcome. Manuscripts reporting results obtained with established methods, without contributing to scientific knowledge, are not encouraged. Abstracting and indexing
The journal is abstracted and indexed in: Academic OneFile, Academic Search, Compendex, ProQuest, Current Contents/Engineering, Computing and Technology, INIS Atomindex, Journal Citation Reports, Materials Science Citation Index, Science Citation Index Expanded, Scopus, and Zentralblatt MATH. References External links English-language journals
Engineering journals
Publications established in 1929
Monthly journals
Springer Science+Business Media academic journals
|
wikipedia
|
wiki_29005_chunk_41
|
IUPAC nomenclature of inorganic chemistry 2005
|
Coordination geometry
For any coordination number above 2 more than one coordination geometry is possible. For example four coordinate coordination compounds can be tetrahedral, square planar, square pyramidal or see-saw shaped. The polyhedral symbol is used to describe the geometry. A configuration index is determined from the positions of the ligands and together with the polyhedral symbol is placed at the beginning of the name. For example in the complex (SP-4-3)-(acetonitrile)dichlorido(pyridine)platinum(II) the (SP-4-3) at the beginning of the name describes a square planar geometry, 4 coordinate with a configuration index of 3 indicating the position of the ligands around the central atom. For more detail see polyhedral symbol.
|
wikipedia
|
wiki_9593_chunk_12
|
Lazarus (software)
|
Examples of applications produced with Lazarus
ASuite is a free open-source application launcher for Windows. From 2.1 Alpha 1, it's fully written in Lazarus/FPC.
Beyond Compare is a data comparison utility for Windows, macOS, and Linux. The macOS and Linux versions are compiled using Lazarus/FPC.
Cartes du Ciel is a free planetarium program for Linux, macOS and Windows. The software maps out and labels most of the constellations, planets, and objects you can see with a telescope. It is fully written in Lazarus/FPC and released under GPL.
C-evo is an open source turn-based strategy game that has been ported from Delphi to Lazarus.
Cheat Engine is an open-source memory scanner/hex editor/debugger. It is useful for cheating in computer games. Since version 6.0 it is compiled with Lazarus/FPC.
EPANET, a software package for modelling water-distribution systems.
HNSKY, Hallo Northern Sky is a free planetarium program for Windows and Linux. Since version 3.4.0 written and compiled with Lazarus/FPC.
MyNotex is a free software for Linux useful to take and manage textual notes.
PeaZip is an open-source archiver, made with Lazarus/FPC.
TorChat is moving away from Python and is being rewritten in Lazarus + Free Pascal.
Total Commander 64-bit version.
Double Commander is a cross-platform open-source file manager with two panels side by side. It is inspired by Total Commander, plus some new ideas.
CudaText is a cross-platform open-source text editor.
Coedit (renamed to Dexed) is an IDE for the D programming language.
SimThyr is a continuous simulation program for thyroid homeostasis.
Tomboy-ng, the currently active manifestation of Tomboy.
Tranzistow is a 32/64-bit software synthesizer for Windows and Linux developed with FreePascal/Lazarus.
|
wikipedia
|
wiki_25236_chunk_1
|
Project Superpowers
|
| image = Superpowers-Ross-Painting.jpg
| caption = Promotional image by Alex Ross.
| schedule = Monthly
| limited = y
| Superhero = y
| publisher = Dynamite Entertainment
| date = (vol. 1)January–October 2008(vol. 2)June 2009 – September 2010(Vol.3)July 2018 January - 2019
| issues = (vol. 1)9(vol. 2)12(vol.3)7| main_char_team =
| writers = Jim Krueger
| artists = Alex Ross (co-plotter and covers)
| pencillers = Doug Klauba
| inkers = Stephen Sadowski
| colorists = Adrian Moreno
| letterers = Simon Bowland
| editors =
| creative_team_month =
| creative_team_year =
| creators = Jim KruegerAlex Ross
| TPB = Hardcover
| ISBN = 1-933305-91-6
| TPB1 = Softcover
| ISBN1 = 1606900145
| subcat = Dynamite Entertainment
| sort = Project Superpowers
}}Project Superpowers' is a comic book limited series published by Dynamite Entertainment beginning January 2008. It was co-plotted by Jim Krueger and Alex Ross, with scripts by Jim Krueger, covers by Alex Ross, and interior art by Doug Klauba and Stephen Sadowski for issue #0, and Carlos Paul for the remainder of the series. Ross is also art director, which includes sketched pages, color guides, and redesigns of most of the characters. There was a new series in 2018 with Rob Williams as the writers and Sergio Davila as the artist. A new series called Project Superpowers: Fractured States will debut in April with writers Ron Marz, Andy Lanning and artist Emilio Utrera.
|
wikipedia
|
wiki_22631_chunk_16
|
MEMO model (wind-flow simulation)
|
Topography and surface type
For calculations with MEMO, a file must be provided which contains orography height and surface type for each grid location The following surface types are distinguished and must be stored as percentage: water (type: 1)
arid land (type: 2)
few vegetation (type: 3)
farmland (type: 4)
forest (type: 5)
suburban area (type: 6)
urban area (type: 7)
|
wikipedia
|
wiki_8222_chunk_6
|
Code of Points (gymnastics)
|
The Table of Elements is the section of the Code of Points used to identify, classify and assign value to gymnastics elements. Every acrobatic and dance skill is listed, illustrated and assigned a difficulty rating. For all apparatus except vault, difficulty ratings for both the women's and men's elements range from A (easiest) to J (most difficult). Difficulty ratings are valued as follows: A (.10), B (.20), C (.30), D (.40), E (.50), F (.60), G (.70), H (.80), I (.90), and J (1.0). The values are used to tabulate the gymnast's score. Each vault is assigned a difficulty value ranging from 2.0 (easiest) to 6.4 (most difficult). The Table of Elements did not undergo major changes in the 2006 Code overhaul.
|
wikipedia
|
wiki_35414_chunk_11
|
Mechanical systems drawing
|
Installation stage
These drawings show requirements for building works necessary to facilitate installing the engineering services (other than where it is appropriate to mark out on site). Information on these drawing includes details of all:
Bases for plant formed in concrete, brickwork or blockwork, to a scale of not less than 1:20
Attendant builders work, holes, chases, etc. for conduits, cables and trunking etc. and any item where access for a function of the installation is required to a scale of not less than 1:100
Purpose made brackets for supporting service or plant/equipment to a scale of not less than 1:50
Accesses into ceilings, ducts, etc. at a scale of not less than 1:50
Special fixings, inserts, brackets, anchors, suspensions, supports etc. at a scale of not less than 1:20
Sleeves, puddle flanges, access chambers at a scale not less than 1:20
|
wikipedia
|
wiki_2113_chunk_20
|
Validity (statistics)
|
History, the specific events occurring between the first and second measurements in addition to the experimental variables
Maturation, processes within the participants as a function of the passage of time (not specific to particular events), e.g., growing older, hungrier, more tired, and so on.
Testing, the effects of taking a test upon the scores of a second testing.
Instrumentation, changes in calibration of a measurement tool or changes in the observers or scorers may produce changes in the obtained measurements.
Statistical regression, operating where groups have been selected on the basis of their extreme scores.
Selection, biases resulting from differential selection of respondents for the comparison groups.
Experimental mortality, or differential loss of respondents from the comparison groups.
Selection-maturation interaction, etc. e.g., in multiple-group quasi-experimental designs
|
wikipedia
|
wiki_17904_chunk_25
|
Fold (higher-order function)
|
Infinite tree-like folding is demonstrated e.g., in recursive primes production by unbounded sieve of Eratosthenes in Haskell:
primes = 2 : _Y ((3 :) . minus [5,7..] . foldi (\(x:xs) ys -> x : union xs ys) []
. map (\p-> [p*p, p*p+2*p..]))
_Y g = g (_Y g) -- = g . g . g . g . ...
where the function union operates on ordered lists in a local manner to efficiently produce their set union, and minus their set difference.
|
wikipedia
|
wiki_471_chunk_46
|
Power law
|
Zipf, Power-laws, and Pareto – a ranking tutorial
Stream Morphometry and Horton's Laws
"How the Finance Gurus Get Risk All Wrong" by Benoit Mandelbrot & Nassim Nicholas Taleb. Fortune, July 11, 2005.
"Million-dollar Murray": power-law distributions in homelessness and other social problems; by Malcolm Gladwell. The New Yorker, February 13, 2006.
Benoit Mandelbrot & Richard Hudson: The Misbehaviour of Markets (2004)
Philip Ball: Critical Mass: How one thing leads to another (2005)
Tyranny of the Power Law from The Econophysics Blog
So You Think You Have a Power Law – Well Isn't That Special? from Three-Toed Sloth, the blog of Cosma Shalizi, Professor of Statistics at Carnegie-Mellon University.
Simple MATLAB script which bins data to illustrate power-law distributions (if any) in the data.
The Erdős Webgraph Server visualizes the distribution of the degrees of the webgraph on the download page.
|
wikipedia
|
wiki_9661_chunk_13
|
Earthquake engineering
|
The NEES network features 14 geographically-distributed, shared-use laboratories that support several types of experimental work: geotechnical centrifuge research, shake-table tests, large-scale structural testing, tsunami wave basin experiments, and field site research. Participating universities include: Cornell University; Lehigh University; Oregon State University; Rensselaer Polytechnic Institute; University at Buffalo, State University of New York; University of California, Berkeley; University of California, Davis; University of California, Los Angeles; University of California, San Diego; University of California, Santa Barbara; University of Illinois, Urbana-Champaign; University of Minnesota; University of Nevada, Reno; and the University of Texas, Austin.
|
wikipedia
|
wiki_30408_chunk_9
|
Neurogenetics
|
Human research
Many research facilities seek out volunteers with certain conditions or illnesses to participate in studies. Model organisms, while important, cannot completely model the complexity of the human body, making volunteers a key part to the progression of research. Along with gathering some basic information about medical history and the extent of their symptoms, samples are taken from the participants, including blood, cerebrospinal fluid, and/or muscle tissue. These tissue samples are then genetically sequenced, and the genomes are added to current database collections. The growth of these data bases will eventually allow researchers to better understand the genetic nuances of these conditions and bring therapy treatments closer to reality. Current areas of interest in this field have a wide range, spanning anywhere from the maintenance of circadian rhythms, the progression of neurodegenerative disorders, the persistence of periodic disorders, and the effects of mitochondrial decay on metabolism.
|
wikipedia
|
wiki_1832_chunk_5
|
Bayesian network
|
Using the expansion for the joint probability function and the conditional probabilities from the conditional probability tables (CPTs) stated in the diagram, one can evaluate each term in the sums in the numerator and denominator. For example, Then the numerical results (subscripted by the associated variable values) are To answer an interventional question, such as "What is the probability that it would rain, given that we wet the grass?" the answer is governed by the post-intervention joint distribution function
|
wikipedia
|
wiki_15804_chunk_2
|
Molecular model
|
The construction of physical models is often a creative act, and many bespoke examples have been carefully created in the workshops of science departments. There is a very wide range of approaches to physical modelling, and this article lists only the most common or historically important. The main strategi, initially in textbooks and research articles and more recently on computers. Molecular graphics has replaced some functions of physical molecular models, but physical kits continue to be very popular and are sold in large numbers. Their unique strengths include:
cheapness and portability;
immediate tactile and visual messages;
easy interactivity for many processes (e.g., conformational analysis and pseudorotation).
|
wikipedia
|
wiki_9862_chunk_3
|
List of Discovery Channel original programming
|
2057 (2007)
9/11 Firehouse (2013)
A Fishing Story with Ronnie Green (2017)
Adrenaline Rush Hour (2009)
After the Climb (2007)
Africa (2013)
Air Pressure (2015)
Aircrash Confidential (2011–12)
Airplane Repo (2010–15)
Airshow (2015)
Alaskan Steel Men (2013)
Alien Planet (2005 special)
American Casino (2004–05)
American Guns (2011–12)
American Hot Rod (2004–08)
American Loggers (2009–11)
American Made Inventors (2017)
American Muscle (2014)
American Tarzan (2016)
American Treasures (2011)
American Underworld (2011)
Amish Mafia (2012–15)
Animal Face-Off (2004)
Apocalipse Preppers (2013)
Arctic Rescue (2015)
Argo: Inside Story (2013)
Arthur C. Clarke's Mysterious Universe (1994–95)
Assignment Discovery
Atlas (2006–08)
Atlas 4D (2010)
Auction Kings (2010–13)
Backyard Oil (2013)
Bad Universe
Barbarians – Secrets of the Dark Ages (2002)
The Battle for Rome (2006)
Battlefield Detectives (2003)
Beast Tracker
Beachbody
Before the Dinosaurs (2005)
Before We Ruled the Earth (2003)
Bermuda Triangle Exposed
Beyond 2000
Beyond Tomorrow
Big! (2004)
The Big Brain Theory (2013)
Biker Build-Off (2002–07)
Billion Dollar Secret
Bizarre Dinosaurs
Blood and Oil (2013)
Blue Collar Bankers
The Blue Planet (2001)
Blueprint for Disaster (2004–08)
Bone Detectives (2007–08)
Brainiac
Breakout
Brew Masters (2010)
Building the Future
Building the Ultimate (2005)
Built for Champions
Bush Tucker Man (c. 1992)
Canada's Worst Driver (2005–18)
Canada's Worst Handyman (2006–11)
Carfellas
Chop Shop London
Choppers
The Colony (2009–2010)
Connect
Crash of the Century
Curiosity (2011–13)
Curious and Unusual Deaths
The Curse Of Tutankhamen (1999)
Daily Planet (1995–2018)
Dangerman (Geoff Mackley)
Darcy's Wild Life
Daring Capers (1999–2001)
Dark Fellowships: The Vril
Dead Men's Tales
Deadly Women
Dealers (2012)
Deception with Keith Barry
Decoding Disaster
Designer Guys
Destroyed in Seconds (2008–09)
The Detonators
The Devil's Ride
Diagnosis: Unknown
Dinosaur Planet (2003)
Dinosaur Revolution (2011)
Dirty Jobs (2003–12)
Disaster Detective
Disaster Eyewitness (2011)
Discovery Atlas (2006–08)
Discover Magazine (1992–2000)
Discovery News
Discovery Profile
Discovery Sport
Discovery Sunday
Doctorology (2007)
Doing DaVinci (2009–10)
Doomsday 2012 (2008 special)
Doomsday Bunkers
Double Agents
Download: The True Story of the Internet (2008)
Dragons: A Fantasy Made Real
Dual Survival (2010–16)
Dude, You%27re Screwed (2013–14)
Daily Planet (TV series)
Easy Does It (1991–96)
Eco-Challenge (2001)
Eco-Tech (2003)
End Day
Endurance
Engineering Volcanoes
Equinox
Escape Stories (2001)
Everest: Beyond the Limit (2006–09)
Everything You Need To Know
Exhibit A: Secrets of Forensic Science
Expedition Borneo
Explosions Gone Wrong
Extreme Engineering (2003–11)
Extreme Machines (1997)
Edge of Alaska (2014–17)
Extreme Peril
Extreme Smuggling (2013)
Extreme Survival
The FBI Files (1998–2006)
Fearless Planet (2007)
The Feuding Tombs of Christopher Columbus
Fields of Armor
Fight or Die
Fight Quest (2007–08)
The Final 24
Fireballs from Space
Firehouse USA: Boston (2005)
Firepower
Flying Heavy Metal (2005)
Flying Wild Alaska (2011–12)
Forensic Detectives (1999–2001)
Frontiers of Construction
Frontiers of Flight
Frozen Planet
Full Force Nature
Full Metal Challenge
The Future Is Wild
Future Weapons (2006–08)
FutureCar
Game of Stones
Garage Takeover
Ghost Lab (2009–11)
Ghosthunters (1996–97)
Giant Squid: Caught On Camera
Globe Trekker
Going Tribal
Gold Star Racing
Great Bear Stakeout (special; premiered May 12, 2013)
The Great Biker Build Off
The Greatest Ever (2005)
Green Village
Guinea Pig
Gutbusters (2002 special)
Harley and the Davidsons (2016)
A Haunting (2005–07 on Discovery, 2011–present on Destination America)
The Haunting in Connecticut (2003 film)
Hazard Pay
Heirs to the Dare (2014)
Heroes (2006)
Hidden
Hijack El Al Flight 426
Hogs Gone Wild
The Holocaust: In Memory of Millions
Home Matters
Hooked on Fishing (1999–unknown)
How Beer Saved the World (2011)
How Booze Built America (2012)
How Do They Do It?
How Does It Work?
How It's Made
How to Survive
How The Universe Works (2010)
How We Invented the World (miniseries; 2013)
Howe & Howe Tech (2010–11)
Huge Moves
Human Body: Pushing the Limits (2008)
I, VIDEOGAME
I Shouldn't Be Alive (2005–06)
I Was Bitten
Iditarod: Toughest Race on Earth (2008)
In the Wild with Harry Butler
Incredible India!
India with Sanjeev Bhaskar
Industrial Revelations (2002–04)
Inside Planet Earth
Instinto Asesino
Interior Motives
Into Alaska with Jeff Corwin
Into the Lion's Den
Into the Universe with Stephen Hawking (2010)
Into the Unknown with Josh Bernstein (2008)
Invention
Is Born
Is It Possible? (2010)
It Takes a Thief (2005–07)
JFK: The End Of Camelot
Jungle Gold (2012–13)
Junkyard Wars (2001–03)
Justice Files
Klondike (2014)
The Know Zone (1995)
Korea: The Forgotten War
LA Ink (2007–11)
Last Day of the Dinosaurs (2010 special)
The Last Huntsmen (2013)
Last One Standing
Legend Detectives (2005 miniseries)
Licence to Drill
Life (2010)
Lobster Wars (2007)
Lost Animals of the 20th Century
The Lost Ship of Venice (2006 special)
The Lost Tomb of Jesus (2007 special)
Lunar Jim (August 5, 2006 – June 25, 2011)
Lynette Jennings Design
Magic of Science
Mammals Vs. Dinosaurs
Man vs. Wild (2006–11)
Man, Woman, Wild (2010–12)
Manhunt: Unabomber (2017 miniseries)
Massive Engines
Massive Machines
Mayday
Mega Builders (2005–10)
Mega Engineering
Miami Ink
Mind, Body & Kick Ass Moves
Miracle Planet
Modern Gladiators
Moment of Impact
Mongrel Nation (2003)
Monkey Business
Monster Garage (2002–06)
Monster House (2003–06)
Monster: A Portrait Of Stalin In Blood
Monsters Inside Me
Monsters Resurrected (2009)
Most Evil (2006–08)
Mostly True Stories: Urban Legends Revealed
Mummy Detective with Bob Brier (2004 miniseries)
My Shocking Story
The Mysterious Death of Cleopatra (2006)
MythBusters (2003–16)
Naked Castaway (2013)
Nasty by Nature'''Nature by DesignNature's DeadliestNature's Most Amazing EventsThe New Al-QaedaThe New Detectives: Case Studies in Forensic Science (1996–2005)The Next Step (1991–96)NextWorldNightmare Next DoorNormandy: The Great CrusadeNorth America (2013 miniseries)OdditiesOn the RunOne Car Too Far (2012)One Man Army (2011)One Step BeyondOne Way Out (2008–09)Out In The ColdOutlaw Empires (2012 miniseries)Overhaulin' (2004–09 on TLC, 2012–15 on Discovery)PagansPassport to SpacePatent Bending (2006)The Patiala Necklace (2004)People WatchPerfect Disaster (2006)Pitchmen (2009–11)Planes That Never FlewPlanet EarthPoint of No Return (2002)Pompeii – Killer In Our Midst (2005)Pompeii: The Last Day (2003)Pompeii of the East (2005 special)Pop NationPortraitsProfiles of NatureProperty Wars (2012–13)The Prosecutors: In Pursuit of JusticePrototype This! (2008–09)PrehistoricPrehistoric PlanetPrehistoric ParkPyramid Beyond Imagination (2002)Ragin' Cajuns (2012)Raging PlanetRally Round the HouseRaw NatureRay Mears' The Real Heroes of Telemark (2003 special)Ray Mears' World of Survival (1997–98)The Reagan LegacyThe Real American CowboyReally Big ThingsReporters At War (2003 miniseries)Rex Hunt's Fishing Adventure (1991–2004)RidesRise of the Video Game (2007)RivalsRoad Trip USARoboticaRocket ScienceRoyal Deaths & Diseases (2003–04)RTL AutowereldSacred Steel BikesSaint Hoods (2013)Salvage SquadSasquatch: Legend Meets ScienceSci-Fi Saved My LifeSci-TrekThe Science of Sex AppealThe Science of Star WarsScrapheap ChallengeSeven Wonders Of ...Sex Sense (miniseries)Shark Week (annual program)Siberian Cut (2014)Silver Rush (2013)The Sinking of the Lusitania: Terror at SeaSkywire LiveSmash Lab (2007–08)Solving History with Olly Steeds (2010)Some Assembly Required (2007–08)Sons of GunsStealth Secrets (2005)Storm Chasers (2007–11)Storm WarningStory of IndiaStranded: With Cash Peters (Travel Channel)Strange Days at Blake Holsey High (2009)Street OutlawsStunt JunkiesThe SunSuper Structures of the World (1998–)Super Weapons of the Ancient World (2005 series)SuperstormSupervolcanoSurprise by DesignSurvive ThisSurvivormanSwamp Brothers (2011–12)Swamp Loggers (2009–12)Swords: Life on the Line (2009–12)TanksTanks! The Aces (2005)Test Case (2006)Texas Car Wars (2012)Tilt 23 1/2Time Warp (2008–09)Titanic: Anatomy of a DisasterTop GearTop MarquesTop Ten (2004–05)TournamentTravelersTreasure!True Horror with Anthony Head (2004)Ultimate Car Build-OffUltimate CarsThe Ultimate GuideThe Ultimate TenUnchained Reaction (2012)Under Siege: America's Northern Border (2013 special)UnderstandingUniverseUnsolved History (2002–05)Untamed AfricaValley of the T-Rex (2001 special)Verminators (2008–09)Viking Voyages: Wings of the Dragon (2005)Walking with BeastsWalking with CavemenWalking with DinosaursA Walking With Dinosaurs Trilogy: Sea Monsters (2003 trilogy)Walking with MonstersWarlocks Rising (premiered July 5, 2013)Warrior WomenWeapon Masters (2007)WeaponizersWeapons of War (series)Weed Country (2013)Weird or What?What's That About?Wheeler Dealers (2011–15)When Dinosaurs Roamed America (2001)When Dinosaurs RuledWhen We Left Earth: The NASA Missions (2008)Why Didn't I Think of That?Wild Discovery (1995–2002)Wild PacificWild Weather (2002 miniseries)Wildlife ChroniclesWingsWolves at Our Door (1997)A World AwayWorld Birth Day (2002–03)World Class CuisineWorld of WonderWorld's Biggest And Baddest Bugs (2004)The World's Strangest UFO StoriesWorld's Toughest FixesThe World's Toughest Tunnel (2005)Wreckreation Nation (2009)X-MachinesX-Ray Mega Airport (2015)You Have Been WarnedYou Spoof Discovery (2007 special)Yukon MenZero Hour''
|
wikipedia
|
wiki_1810_chunk_15
|
Predication (computer architecture)
|
SIMD, SIMT and Vector Predication Some SIMD instruction sets, like AVX2, have the ability to use a logical mask to conditionally load/store values to memory, a parallel form of the conditional move, and may also apply individual mask bits to individual arithmetic units executing a parallel operation. The technique is known as "Associative Processing" in Flynn's Taxonomy. This form of predication is also used in Vector processors and single instruction, multiple threads GPU computing. All the techniques, advantages and disadvantages of single scalar predication apply just as well to the parallel processing case. See also
|
wikipedia
|
wiki_23109_chunk_28
|
List of Philippine mythological figures
|
Delan: deity of the moon, worshiped with the sun and stars; congenial with Elag; during quarrels, Elag sometimes covers Delan's face, causing the different phases of the moon; giver of light and growth
Elag: deity of the sun, worshiped with the moon and stars; has a magnificent house in the sky realm called Gacay; retreats to his home during nights; giver of light and growth
Pandac: deity of the stars, worshiped with the sun and moon; giver of light and growth
Cain: the headhunter creator of mankind; gave customs to the people; lived together with Abel in the sky but separated due to a quarrel
Abel: prayed to when wishing long lives for children; lived together with Cain in the sky but separated due to a quarrel
Keat: personification of lightning, depicted as the road of Cain and Abel
Kidu: personification of thunder, which follows Keat
Gemang: guardian of wild beasts
Oden: deity of the rain, worshiped for its life-giving waters
Tawen: personification of the sky
Kalao: spirit birds; depicted as red hornbills who guide and protect hunters and their soul
Be’tang: unpredictable shape-shifting spirit-creatures living in the forests or wilderness called Gongot; youth and softness are their properties, while they can also alter a human's sense of time; they may take the form of a white dog, a large deer, a horse with a hanging tongue, a naked woman, or beings with grotesque shapes, whose attributes range from long arms and legs, small heads, oversized feet, fur bodies, to hairless bodies; they may also enter a person's dreams or paralyze a human
Ga’ek Spirits: spirits in the Ga’ek magic plant used in relation to hunting and fishing; the naw-naw prayer is given to them
|
wikipedia
|
wiki_38249_chunk_37
|
Algorithmic skeleton
|
Muesli
The Muenster Skeleton Library Muesli is a C++ template library which re-implements many of the ideas and concepts introduced in Skil, e.g. higher order functions, currying, and polymorphic types . It is built on top of MPI 1.2 and OpenMP 2.5 and supports, unlike many other skeleton libraries, both task and data parallel skeletons. Skeleton nesting (composition) is similar to the two tier approach of P3L, i.e. task parallel skeletons can be nested arbitrarily while data parallel skeletons cannot, but may be used at the leaves of a task parallel nesting tree. C++ templates are used to render skeletons polymorphic, but no type system is enforced. However, the library implements an automated serialization mechanism inspired by such that, in addition to the standard MPI data types, arbitrary user-defined data types can be used within the skeletons. The supported task parallel skeletons are Branch & Bound, Divide & Conquer, Farm, and Pipe, auxiliary skeletons are Filter, Final, and Initial. Data parallel skeletons, such as fold (reduce), map, permute, zip, and their variants are implemented as higher order member functions of a distributed data structure. Currently, Muesli supports distributed data structures for arrays, matrices, and sparse matrices.
|
wikipedia
|
wiki_37418_chunk_1
|
Project Mathematics!
|
Overview
The Project Mathematics! series of videos is a teaching aid for teachers to help students understand the basics of geometry and trigonometry. The series was developed by Tom M. Apostol and James F. Blinn, both from the California Institute of Technology. Apostol led the production of the series, while Blinn provided the computer animation used to depict the ideas beings discussed. Blinn mentioned that part of his inspiration was the Bell science series of films from the 1950s.
|
wikipedia
|
wiki_4_chunk_33
|
Algorithm
|
Canonical flowchart symbols: The graphical aide called a flowchart, offers a way to describe and document an algorithm (and a computer program of one). Like the program flow of a Minsky machine, a flowchart always starts at the top of a page and proceeds down. Its primary symbols are only four: the directed arrow showing program flow, the rectangle (SEQUENCE, GOTO), the diamond (IF-THEN-ELSE), and the dot (OR-tie). The Böhm–Jacopini canonical structures are made of these primitive shapes. Sub-structures can "nest" in rectangles, but only if a single exit occurs from the superstructure. The symbols, and their use to build the canonical structures are shown in the diagram.
|
wikipedia
|
wiki_12070_chunk_16
|
Block-matching algorithm
|
• First Phase :
• Divide the area of search in four quadrants
• Start search with three locations, one at center (A) and others (B and C), S=4 locations away from A in orthogonal directions
• Find points in search quadrant for second phase using the weight distribution for A, B, C:
• If (MAD(A)>=MAD(B) and MAD(A)>=MAD(C)), select points in second phase quadrant IV
• If (MAD(A)>=MAD(B) and MAD(A)<=MAD(C)), select points in second phase quadrant I
• If (MAD(A)<MAD(B) and MAD(A)<MAD(C)), select points in second phase quadrant II
• If (MAD(A)<MAD(B) and MAD(A)>=MAD(C)), select points in second phase quadrant III
|
wikipedia
|
wiki_5093_chunk_24
|
List of important publications in chemistry
|
Description: Starting with examples comparing two sets of experimental data, this text explains variance and the calculation of standard deviations, degrees of freedom, the null hypothesis and the "Student's" t-Test by William J. Gosset. Further chapters discuss the importance of randomization and the analysis of variance (ANOVA) using F distributions before delving into the use of statistically designed experiments including block and factorial designs. The book finishes with least squares regression analysis along with response surface and mechanistic modeling.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.