id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_7752_chunk_14
|
Food engineering
|
Food engineering is still growing and developing as a field of study, and academic curricula continue to evolve. Future food engineering programs are subject to change due to the current challenges in the food industry, including bio-economics, food security, population growth, food safety, changing eating behavior, globalization, climate change, energy cost and change in value chain, fossil fuel prices, and sustainability. To address these challenges, which require the development of new products, services, and processes, academic programs are incorporating innovative and practical forms of training. For example, innovation laboratories, research programs, and projects with food companies and equipment manufacturers are being adopted by some universities. In addition, food engineering competitions and competitions from other scientific disciplines are appearing.
|
wikipedia
|
wiki_29829_chunk_6
|
Open-source software security
|
Morningstar model
By comparing a large variety of open source and closed source projects a star system could be used to analyze the security of the project similar to how Morningstar, Inc. rates mutual funds. With a large enough data set, statistics could be used to measure the overall effectiveness of one group over the other. An example of such as system is as follows:
1 Star: Many security vulnerabilities.
2 Stars: Reliability issues.
3 Stars: Follows best security practices.
4 Stars: Documented secure development process.
5 Stars: Passed independent security review.
|
wikipedia
|
wiki_4001_chunk_1
|
Master theorem (analysis of algorithms)
|
Not all recurrence relations can be solved with the use of this theorem; its generalizations include the Akra–Bazzi method. Introduction
Consider a problem that can be solved using a recursive algorithm such as the following: procedure p(input x of size n):
if n < some constant k:
Solve x directly without recursion
else:
Create a subproblems of x, each having size n/b
Call procedure p recursively on each subproblem
Combine the results from the subproblems
|
wikipedia
|
wiki_8751_chunk_8
|
Reconciliation ecology
|
How can understanding of species' natural history aid their effective conservation in human-dominated ecosystems? Humans often conduct activities that allow for the incorporation of other species, whether as a by-product or as a result of a focus on nature. Traditional natural history can only inform how best to do this to a certain degree, because landscapes have been changed so dramatically. However, there is much more to learn through direct study of species' ecology in human-dominated ecosystems, through what is known as focused natural history. Rosenzweig cites four examples: shrikes (Laniidae) thrived in altered landscapes when wooden fence post perches allowed them easy access to pouncing on prey, but inhospitable steel fence posts contributed to their decline. Replacing steel fence posts with wood fence posts reverses the shrikes' decline and allows humans to determine the reasons for the distribution and abundance of shrikes. Additionally, the cirl bunting (Emberiza cirlus) thrived on farms when fields alternated between harvests and hay, but declined where farmers began to plant winter grain crops, natterjack toads (Bufo calamatus) declined when reductions in sheep grazing ceased to alter ponds to their preferred shape and depth, and longleaf pine (Pinus palustris) declined in the Southeastern United States when lack of wildfires prevented its return after timbering. Thus, applying focused natural history in human-dominated landscapes can contribute to conservation efforts.
|
wikipedia
|
wiki_27776_chunk_1
|
Computer Retrieval of Information on Scientific Projects
|
To facilitate indexing and searching, CRISP also contains a thesaurus and controlled vocabulary for terms used in biological and medical research. Each project is assigned three keywords from the thesaurus. All users, including the general public, can search through the CRISP interface for scientific concepts or emerging trends and techniques that are covered by federal funding. It can also be used to identify specific projects or investigators that receive, or have received, funding. RePORT Expenditures and Results
The CRISP system has been replaced by the RePORT Expenditures and Results (RePORTER) query tool. References External links
CRISP database overview at NIH
Querying CRISP
CRISP Thesaurus Public domain databases
|
wikipedia
|
wiki_32580_chunk_7
|
Circumarctic Environmental Observatories Network
|
Relative to other regions on the globe, the Arctic is experiencing dramatic changes in climate and patterns of human land use. Environmental and socioeconomic drivers associated with these changes originate both within and outside of the Arctic system.
Change detection & predictive power of these changes is low and are limited/ threatened by the lack of sustained environmental observation time series in northern high latitudes.
A circum-arctic environmental observatories network that can provide adequate, diverse and sustained time series observations has the potential to dramatically improve our understanding of the Arctic system and how it may continue to respond to a variety of environmental and societal changes forecast for the region.
There is a well-established science infrastructure and a tremendous amount of research and monitoring ongoing in the Arctic. Generally, the broader international and multidisciplinary impacts of these efforts are not fully tapped due to limitations associated with research exposure, communication, data availability, and differences in technologies and sampling methods between sites. Reinforcing and improving the broader impacts of existing and planned activities is the primary focus of CEON at present.
|
wikipedia
|
wiki_2100_chunk_27
|
Gibbs free energy
|
where
, Gibbs free energy change per mole of reaction,
, Gibbs free energy change per mole of reaction for unmixed reactants and products at standard conditions (i.e. 298K, 100kPa, 1M of each reactant and product),
, gas constant,
, absolute temperature,
, natural logarithm,
, reaction quotient (unitless),
, equilibrium constant (unitless),
, electrical work in a reversible process (chemistry sign convention),
, moles of electrons transferred in the reaction,
, Faraday constant (charge per mole of electrons),
, cell potential,
, standard cell potential.
|
wikipedia
|
wiki_6790_chunk_10
|
Ivanovo State University of Chemistry and Technology
|
Scientific infrastructure
The scientific infrastructure of ISUCT contains:
Testing and analytical centres (Center for collective use of research equipment, Testing center "Quality", Center for certification of goods and equipment "RegionTest")
Research Facilities (Institute of Macroheterocyclic Compounds Chemistry, Institute of Thermodynamics and Kinetics of Chemical Processes)
R & D and innovation centres (Research and Production Laboratory "Ion-plasma technological processes", RPL "Technology of processing of rubber-bituminous materials", Research and Production Enterprise "Synthesis", Production site "Complex", Educational, Research and Production Centre "Nail", Research and Production Centre "Potential", Research and Production Laboratory "Chlorine")
Scientific and Educational Centres ("Nanotechnologies", "Theoretical and Experimental Chemistry", Institute for the Development of Digital Economics, Centre for Innovative and Anti-crisis Technologies, SEC for Information, Linguistic and Educational Technologies, Practice-oriented Scientific and Engineering Club "Innovation", Research and Project Centre after A.A. Tarkovsky, Workshop of Contemporary Art "The Sixth Floor")
|
wikipedia
|
wiki_13315_chunk_6
|
Super Powers Collection
|
These comics were separate from the continuity of the regular comics featuring the characters. Hanna Barbera also produced two animated series (a refreshing of the venerable Super Friends concept), called Super Friends: The Legendary Super Powers Show and The Super Powers Team: Galactic Guardians. Warner Home Video used the opportunity to issue episodes of Superman, Batman, Superboy, and Aquaman produced by Filmation in 1966 on VHS and Betamax video cassette in 1985 under the Super Powers label (and also as part of the 50th anniversary celebrations of their sister company DC Comics), reissuing them again on VHS in 1996 (and were still available into the early 2000s until the end of the VHS format). Other tie-in products were produced, including lunchboxes, 3-D puffy stickers, party supplies, paintable figurines, Underoos, coloring and activity books (Secret of the Frozen City, Superman, Lex Luthor, The Joker, Batman, The Penguin, Wonder Woman, Villains, Superman and Batman, and Superman and the Super Powers), The Super Powers Anti-Coloring Book by Susan Striker, Stain-A-Sticker, Justice League of America Skyscraper Caper game, sunglasses, playhouses, belt buckles, sneakers, signature stamp sets, coloring play mats, drinking glasses/tumblers, model kits, soap, stain painting sets, calendars, Play-Doh sets, cube game, jointed wall figures, wrist watches, jigsaw puzzles (Jaymar and Craftmaster), Give-A-Show projectors, backpacks, gym bags, Valentine's Day paraphernalia, kites, pajamas, card games, sticker albums, sleeping bags, wall cling decorations, inflatable punching bop bags, bed sheets, clothes, windsocks, greeting cards, View-Master theatre sets, nut and fruit mix, sidewalk artist sets, temporary tattoos, SunShiners, galoshes, Nerf wrist flyers, duffel bags, lip balm, slippers, crayon sets, planners, school supplies, belts, baseball caps, flashlights, bumper stickers, pins, jewelry, embroidered patches, and posters. Kenner offered several mail-in promotions including a flexible vinyl record called The Darkseid Saga, child-size Superman plastic cape, and an 18" by 24 " color poster.
|
wikipedia
|
wiki_28982_chunk_8
|
Human–computer chess matches
|
The Harvard Cup Man versus Computer Chess Challenge was organized by Harvard University. There were six challenges from 1989 until 1995. They played in Boston and New York City. In each challenge the humans scored higher and the highest scorer was a human.
{| class="wikitable"
|-
!Year!!Men–Compu.!!Human points!!Compu. points!!Winner!!Points!!Best Program!!Points!!Rank
|-
|1989||4–4||13½||2½||Boris Gulko, Michael Rohde||4||Deep Thought||1||5
|-
|1991||4–4||12||4||Maxim Dlugy||3½||Heuristic Alpha||2||5
|-
|1992||5–5||18||7||Michael Rohde||5||Socrates||3||3
|-
|1993||6–6||27||9||Joel Benjamin||5||Socrates||3||6
|-
|1994||6–8||29½||18½||Joel Benjamin||6½||WChess||5||4
|-
|1995||6–6||23½||12½||Joel Benjamin||4½||Virtual Chess||3½||4
|}
|
wikipedia
|
wiki_20935_chunk_32
|
Phonological change
|
Examples
OE y and ý (short and long high front rounded vowels) fell together with i and í via a simple phonetic unrounding: OE hypp, cynn, cyssan, brycg, fyllan, fýr, mýs, brýd became modern hip, kin, kiss, bridge, fill, fire, mice, bride. There is no way to tell by inspection whether a modern /i ay/ goes back to a rounded or an unrounded vowel. The change is not even reflected in modern spelling since it took place too early to be captured in Middle English Spelling conventions. Of course, current spellings like type, thyme, psyche, etc., have nothing to do with OE y = /y/.
There is a massive, consistent body of evidence that PIE *l and *r merged totally in Proto-Indo-Iranian, as did PIE *e *o *a into Proto-Indo-Iranian *a.
The evolution of Romance shows a systematic collection of unconditioned mergers in connection with the loss of Latin vowel length. Latin had ten vowels, five long and five short (i, ī; e, ē; a, ā; and so on). In the variety of Romance underlying Sardo and some other dialects of the islands, the ten vowels simply fell together pairwise: in no way are Latin e, ē, say, reflected differently. In Proto-Western-Romance, the ancestor of French, Iberian, Italian north of the Spezia-Rimini line, etc., however, things happened differently: Latin /a ā/ merged totally, as in Sardo, but the other vowels all behaved differently. Upon losing the feature of length, Latin /ī ū/ merged with nothing, but the short high vowels, front and back, merged with the long mid vowels: thus, Latin /i ē/ are uniformly reflected as PWRom. *ẹ (in the standard Romance notation), and /u ō/ become *ọ. PWRom. *ẹ is reflected in French (in open syllables) as /wa/ (spelled oi); voile "sail", foin "hay", doigt "finger", quoi "what", are from Latin vēlum, fēnum, digitus (via *dictu), quid, respectively. There is no way of telling in French which one of the two Latin vowels is the source of any given /wa/.
|
wikipedia
|
wiki_32283_chunk_15
|
Dehn function
|
A finitely presented group is word-hyperbolic group if and only if its Dehn function is equivalent to n, that is, if and only if every finite presentation of this group satisfies a linear isoperimetric inequality.
Isoperimetric gap: If a finitely presented group satisfies a subquadratic isoperimetric inequality then it is word-hyperbolic. Thus there are no finitely presented groups with Dehn functions equivalent to nd with d ∈ (1,2).
Automatic groups and, more generally, combable groups satisfy quadratic isoperimetric inequalities.
A finitely generated nilpotent group has a Dehn function equivalent to nd where d ≥ 1 and all positive integers d are realized in this way. Moreover, every finitely generated nilpotent group G admits a polynomial isoperimetric inequality of degree c + 1, where c is the nilpotency class of G.
The set of real numbers d ≥ 1, such that there exists a finitely presented group with Dehn function equivalent to nd, is dense in the interval .
If all asymptotic cones of a finitely presented group are simply connected, then the group satisfies a polynomial isoperimetric inequality.
If a finitely presented group satisfies a quadratic isoperimetric inequality, then all asymptotic cones of this group are simply connected.
If (M,g) is a closed Riemannian manifold and G = π1(M) then the Dehn function of G is equivalent to the filling area function of the manifold.
If G is a group acting properly discontinuously and cocompactly by isometries on a CAT(0) space, then G satisfies a quadratic isoperimetric inequality. In particular, this applies to the case where G is the fundamental group of a closed Riemannian manifold of non-positive sectional curvature (not necessarily constant).
The Dehn function of SL(m, Z) is at most exponential for any m ≥ 3. For SL(3,Z) this bound is sharp and it is known in that case that the Dehn function does not admit a subexponential upper bound. The Dehn functions for SL(m,Z), where m > 4 are quadratic. The Dehn function of SL(4,Z), has been conjectured to be quadratic, by Thurston.
Mapping class groups of surfaces of finite type are automatic and satisfy quadratic isoperimetric inequalities.
The Dehn functions for the groups Aut(Fk) and Out(Fk) are exponential for every k ≥ 3. Exponential isoperimetric inequalities for Aut(Fk) and Out(Fk) when k ≥ 3 were found by Hatcher and Vogtmann. These bounds are sharp, and the groups Aut(Fk) and Out(Fk) do not satisfy subexponential isoperimetric inequalities, as shown for k = 3 by Bridson and Vogtmann, and for k ≥ 4 by Handel and Mosher.
For every automorphism φ of a finitely generated free group Fk the mapping torus group of φ satisfies a quadratic isoperimetric inequality.
Most "reasonable" computable functions that are ≥n4, can be realized, up to equivalence, as Dehn functions of finitely presented groups. In particular, if f(n) ≥ n4 is a superadditive function whose binary representation is computable in time by a Turing machine then f(n) is equivalent to the Dehn function of a finitely presented group.
Although one cannot reasonably bound the Dehn function of a group in terms of the complexity of its word problem, Birget, Olʹshanskii, Rips and Sapir obtained the following result, providing a far-reaching generalization of Higman's embedding theorem: The word problem of a finitely generated group is decidable in nondeterministic polynomial time if and only if this group can be embedded into a finitely presented group with a polynomial isoperimetric function. Moreover, every group with the word problem solvable in time T(n) can be embedded into a group with isoperimetric function equivalent to n2T(n2)4.
|
wikipedia
|
wiki_7997_chunk_31
|
Advanced Idea Mechanics
|
Members and agents
AD-45 Riot-Bots
Abu-Jamal Rodriguez –
Alexandre Copernicus –
Andrew Ritter –
Arthur Shaman – hypnotist, kidnapped Michael Barnett and attempted to force the Hulk to kill Ms. Marvel
B'Tumba – A Wakandan who is the son of N'Baza, and an old friend of T'Challa. He allied with A.I.M. to sell vibranium. B'Tumba eventually sacrificed his life to save T'Challa from A.I.M.
Baron Rolando Samedi – An A.I.M. agent who created pseudo-zuvembies and fought Brother Voodoo. He is not to be confused with the deity of the same name.
Bernard Worrell – – Member of A.I.M.'s Blue Faction; former apprentice of George Clinton; led the capture of the Cosmic Cube/Kubik, but was unable to control it once it began its metamorphosis into Kubik
Betty Sumitro
Betty Swanson
Brace –
Brendon Newton –
Cache – artificial intelligence.
Carl Alexis Lombardi – A.I.M. agent, sought Uni-Power, slew David Garrett when he had outlived his usefulness, confessed after being captured by Daredevil
Clete Billups – Infiltrated S.H.I.E.L.D.; revealed himself and killed his "partners" in order to steal the body of Protocide, he was duped by Captain America and Sharon Carter into leading them to A.I.M.'s headquarters.
Clytemnestra Erwin – infiltrated Stark Enterprises to gain revenge on Tony Stark for causing the death of her brother Morley. Killed by an out-of-control A.I.M. missile.
Commander Robert Cypher – Sought technology to take control of nuclear missiles
Count Bornag Royale –
Cyborg – hired assassin
David Garrett – ally of A.I.M., funded Gilbert Wiles to monitoring his tracking of the Uni-Power, slain by Lombardi after outliving his usefulness
Destructor (Kerwin Korman) – former premier weapons-maker, stumbled on and unleashed the power core of Kree Psyche-Magnitron, later built into the Doomsday Man by A.I.M. technicians and used as its power source, discovered and freed by Avengers, required continued connection to the remnants of the Doomsday Man for life support.
Doctor Nemesis (Michael Craig Stockton) –
Doomsday Man – virtually indestructible robot created by Dr. Kronton in order to steal cobalt bomb and blackmail the U.S., initially defeated by Silver Surfer, later revived by Kree Psyche-Magnitron, battled and destroyed by Ms. Marvel, rebuilt by A.I.M. and merged with Kerwin Korman, whom it used as a power source, battled Avengers, sought Warbird as replacement when Kerwin began to weaken, destroyed by Justice, remnants used as life support for Korman.
Dr. Cristiano Ryder – posed as a S.H.I.E.L.D. agent to regain control of Android X-4.
Dr. Ralph Rider – – brother of Charles Rider, uncle of Richard and Robert Rider, leading research scientist until killed by Photon (Jason Dean)
Evelyn Necker – Earth-8410 liaison
Fixer (Paul Norbert Ebersol) –
Grizzly – A.I.M. agent R-1, used by MODOK in a plot to capture atomic scientist Paul Fosgrave; not to be confused with the Spider-Man enemy or Cable's deceased teammate.
Harness (Erika Benson) – mother of Piecemeal; forced him to locate and absorb the energy of Proteus; wore an armored exo-skeleton.
Harold Bainbridge - An A.I.M. Agent that Mockingbird impersonated during the Secret Avengers' raid on A.I.M. Island.
Highwayman – English criminal, agent of A.I.M., attempted to steal the Cognium Steel from Oracle INC., but was defeated by Iron Fist.
Hyun Rahman –
Ian Fitzpatrick (Mr. Jinx)
James Hendrickson Jason Rilker –
Jethro Prufrock – father of George and Martha Prufock, was a perennial right-wing Libertarian candidate for President and a staunch advocate of arms-stockpiling; he was slain by a mutated George
Julia Black – adoptive mother of Carmilla Black, former ties to Symbionese Liberation Army, currently deceased
Lifeform (George Prufrock) – was mutated into a progressively larger carnivorous creature by exposure to experimental virus developed by his father, Jethro Prufock, at A.I.M.
MODAM (Olinka Barankova) – A creation of A.I.M. whose name is an acronym for Mobile Organism Designed for Aggressive Maneuvers, who also operated under the names "Maria Pym" and SODAM (an acronym for Specialized Organism Designed for Aggressive Maneuvers). Killed by MODOK
Marc Planck –
Mentallo (Marvin Flumm) Njeri Damphousse – currently still with A.I.M.
Paul Allen'<ref>Astonishing Tales #8. Marvel Comics.</ref> – He infiltrated S.H.I.E.L.D. His current whereabouts are unknown.
Peggy Park –
Professor Aaron Whyte –
Ramona Starr – shot Ka-Zar in the head and then forced him to perform a mission for A.I.M.; also known as Ramona Courtland
Red Skull (Johann Schmidt) –
Seekers –
Solemne Brannex – Possibly the sister of Allesandro Brannex, sought aid from S.H.I.E.L.D. when A.I.M. obtained a Shi'ar vessel
Stryke
Super-Adaptoid – A robot that can copy the appearance and superpowers of anyone.
Timekeeper – scientist and leader of an A.I.M. outpost in Venture Ridge, Wyoming; he attempted to tap into the power of Holly-Ann Ember
Timothy Black – adoptive father of Carmilla Black, former ties to Symbionese Liberation Army, currently deceased
Ultra-Adaptoid – A stronger version of the Super-Adaptoid.
Victorius (Victor Conrad)
Wakers – A.I.M. deep penetration agents under the leadership of Scorpion (Carmilla Black) and four others, genetically engineered to resist all chemical, biological, and nuclear weapons
Lars Branco – Waker agent; currently deceased
Warbot – A.I.M. weapon, used by Arthur Shaman to capture the Hulk to use against Ms. Marvel, destroyed by her
Yorgon Tykkio – brother of Valdemar; became a cyborg and led a revolt against his brother's rule; controlled the body of MODOK and destroyed it after he was defeated in battle against Iron Man; allied with Clytemnestra Erwin against Tony Stark/Iron Man; was killed by Clytemnestra when she was attempting to flee from him
|
wikipedia
|
wiki_10736_chunk_2
|
Unnatural Selection (Star Trek: The Next Generation)
|
Plot
The Federation starship Enterprise, under the command of Captain Jean-Luc Picard (Patrick Stewart), receives a distress call from the USS Lantree and arrives at the ship's last location to find it adrift. The Enterprise taps into the Lantrees viewer, and finds that the crew appear to have died from old age, even though many were as young as the Enterprise crew. The only evidence of any medical problems was a harmless case of Thelusian flu in one of the ship's officers. They discover that the Lantrees last port-of-call was the Darwin Genetic Research Station on Gagarin IV. Captain Picard orders a quarantine warning broadcast to be set on the Lantree, and orders the Enterprise to Gagarin IV. As they near the planet, they receive another distress call from the station's researchers, all of whom have started a rapid onset of geriatric phenomena they believe is tied to the Lantree.
|
wikipedia
|
wiki_8252_chunk_3
|
Steve Lawrence (computer scientist)
|
NEC Research Institute Excellence awards
NEC Research Impact awards
Queensland University of Technology university medal and award for excellence
ATERB scholarship
APRA priority scholarship,
Technology NJ Internet Innovator award
QEC and Telecom Australia Engineering prizes,
Three prizes in the Australian Mathematics Competition. External links The Internet Archive’s copy of Dr. Steve Lawrence’s old NEC Research homepage
"Online or Invisible?: Free online availability substantially increases a paper's impact" -(open access)
CiteSeer Living people
Australian computer scientists
Google employees
Queensland University of Technology alumni
University of Queensland alumni
Year of birth missing (living people)
|
wikipedia
|
wiki_21132_chunk_37
|
Quantum nonlocality
|
In view of this mismatch, Popescu and Rohrlich pose the problem of identifying a physical principle, stronger than the no-signalling conditions, that allows deriving the set of quantum correlations. Several proposals followed:
Non-trivial communication complexity (NTCC). This principle stipulates that nonlocal correlations should not be so strong as to allow two parties to solve all 1-way communication problems with some probability using just one bit of communication. It can be proven that any box violating Tsirelson's bound by more than is incompatible with NTCC.
No Advantage for Nonlocal Computation (NANLC). The following scenario is considered: given a function , two parties are distributed the strings of bits and asked to output the bits so that is a good guess for . The principle of NANLC states that non-local boxes should not give the two parties any advantage to play this game. It is proven that any box violating Tsirelson's bound would provide such an advantage.
Information Causality (IC). The starting point is a bipartite communication scenario where one of the parts (Alice) is handed a random string of bits. The second part, Bob, receives a random number . Their goal is to transmit Bob the bit , for which purpose Alice is allowed to transmit Bob bits. The principle of IC states that the sum over of the mutual information between Alice's bit and Bob's guess cannot exceed the number of bits transmitted by Alice. It is shown that any box violating Tsirelson's bound would allow two parties to violate IC.
Macroscopic Locality (ML). In the considered setup, two separate parties conduct extensive low-resolution measurements over a large number of independently prepared pairs of correlated particles. ML states that any such “macroscopic” experiment must admit a local hidden variable model. It is proven that any microscopic experiment capable of violating Tsirelson's bound would also violate standard Bell nonlocality when brought to the macroscopic scale. Besides Tsirelson's bound, the principle of ML fully recovers the set of all two-point quantum correlators.
Local Orthogonality (LO). This principle applies to multipartite Bell scenarios, where parties respectively conduct experiments in their local labs. They respectively obtain the outcomes . The pair of vectors is called an event. Two events , are said to be locally orthogonal if there exists such that and . The principle of LO states that, for any multipartite box, the sum of the probabilities of any set of pair-wise locally orthogonal events cannot exceed 1. It is proven that any bipartite box violating Tsirelson's bound by an amount of violates LO.
|
wikipedia
|
wiki_51_chunk_47
|
Biostatistics
|
Studies for differential expression of genes from RNA-Seq data, as for RT-qPCR and microarrays, demands comparison of conditions. The goal is to identify genes which have a significant change in abundance between different conditions. Then, experiments are designed appropriately, with replicates for each condition/treatment, randomization and blocking, when necessary. In RNA-Seq, the quantification of expression uses the information of mapped reads that are summarized in some genetic unit, as exons that are part of a gene sequence. As microarray results can be approximated by a normal distribution, RNA-Seq counts data are better explained by other distributions. The first used distribution was the Poisson one, but it underestimate the sample error, leading to false positives. Currently, biological variation is considered by methods that estimate a dispersion parameter of a negative binomial distribution. Generalized linear models are used to perform the tests for statistical significance and as the number of genes is high, multiple tests correction have to be considered. Some examples of other analysis on genomics data comes from microarray or proteomics experiments. Often concerning diseases or disease stages.
|
wikipedia
|
wiki_3817_chunk_14
|
Air America (radio network)
|
Former programs
The Al Franken Show (noon–3p.m. ET) Aired March 31, 2004 – February 14, 2007. Originally called The O'Franken Factor. Franken left the show in order to run for the U.S. Senate from Minnesota.
The Majority Report (7–10p.m. ET) Aired March 31, 2004 – September 15, 2006. Co-hosted by Sam Seder and Janeane Garofalo
The Randi Rhodes Show (3–7p.m. ET, later shortened to 3–6p.m. ET) Aired March 31, 2004 – April 3, 2008. Moved to Nova M Radio on April 10, 2008.
Morning Sedition with Marc Maron, Sue Ellicott, and Mark Riley (6–9a.m. ET) Aired April 1, 2004 – December 16, 2005.
Unfiltered with Chuck D, Lizz Winstead, and Rachel Maddow (9a.m.–noon ET) Aired April 1, 2004 – April 1, 2005.
The Mike Malloy Show (10p.m.–1a.m. ET), Aired August 2, 2004 – August 30, 2006. Moved to Nova M Radio on October 30, 2006.
Springer on the Radio with Jerry Springer (9pm- midnight ET), Aired April 1, 2005 – September 18, 2006. Broadcast via Air America Syndication until December 8, 2006.
Politically Direct with David Bender (8–9p.m. ET) Aired 2005 – May 2007, then combined with The Mark Riley Show into The Air Americans.
Air America Mornings (5–9a.m. ET) umbrella name for Air America's morning drive-time shows: The Mark Riley Show and The Rachel Maddow Show.
The Mark Riley Show (5–6a.m. ET) Aired January 2006 – May 2007, then combined with Politically Direct into The Air Americans.
This Is America with Jon Elliott with Jon Elliott, (11p.m. – 1a.m. ET) Aired September 2006 – May 15, 2009.
The Young Turks with Cenk Uygur (6–9a.m. ET), Aired September 18, 2006 – January 15, 2008.
The Thom Hartmann Show (noon–3p.m. ET) Aired March 2007 – February 28, 2009. Replaced the Al Franken Show. Moved to the Dial Global network.
The Air Americans, hosted by Mark Riley with contributors David Bender, Laura Flanders, Robert F. Kennedy Jr., and Mike Papantonio. (8pm-midnight ET) Aired May 21, 2007 – August 2007.
American Afternoon, featuring revolving celebrity guest hosts such as Richard Belzer, Joy Behar, Ron Reagan, and Roseanne Barr. (3–6p.m. ET) Aired April–June, 2008. Aired as a replacement for Randi Rhodes, later replaced by Doin' Time with Ron Kuby.*
EcoTalk with Betsy Rosenberg (9–10p.m. ET), the show moved from the weekends to weeknights effective September 18, 2006. Show removed from weekday schedule May 18, 2007, and may resurface eventually on Sunday mornings.
The Kyle Jason Show (two hours)
Liberal Arts with Katherine Lanpher (one hour)
Mother Jones Radio with Angie Coiro (one hour)
So What Else Is News? with Marty Kaplan (first daily for one hour; later weekends for two hours)
The Time Is Now with Rev. Dr. James Forbes
|
wikipedia
|
wiki_13904_chunk_4
|
AP Computer Science A
|
Marine Biology case study (2000-2007)
The Marine Biology Case Study (MBCS) was a program written in C++ until 2003, then in Java, for use with the A and AB examinations. It served as an example of object-oriented programming (OOP) embedded in a more complicated design project than most students had worked with before.
The case study was designed to allow the College Board to quickly test a student's knowledge of object oriented programming ideas such as inheritance and encapsulation while requiring students to understand how objects such as "the environment", "the fish", and the simulation's control module interact with each other without having to develop the entire environment independently, which would be quite time-consuming. The case study also gives all students taking the AP Computer Science exams with a common experience from which to draw additional test questions.
On each of the exams, at least one free-response question was derived from the case study. There were also five multiple-choice questions that are derived from the case study.
This case study was discontinued from 2007, and was replaced by GridWorld.
|
wikipedia
|
wiki_8121_chunk_14
|
Asynchronous circuit
|
Robust and cheap handling of metastability of arbiters.
Average-case performance: an average-case time (delay) of operation is not limited to the worst-case completion time of component (gate, wire, block etc.) as it is in synchronous circuits. This results in better latency and throughput performance. Examples include speculative completion which has been applied to design parallel prefix adders faster than synchronous ones, and a high-performance double-precision floating point adder which outperforms leading synchronous designs.
Early completion: the output may be generated ahead of time, when result of input processing is predictable or irrelevant.
Inherent elasticity: variable number of data items may appear in pipeline inputs at any time (pipeline means a cascade of linked functional blocks). This contributes to high performance while gracefully handling variable input and output rates due to unclocked pipeline stages (functional blocks) delays (congestions may still be possible however and input-output gates delay should be also taken into account).
No need for timing-matching between functional blocks either. Though given different delay models (predictions of gate/wire delay times) this depends on actual approach of asynchronous circuit implementation.
Freedom from the ever-worsening difficulties of distributing a high-fan-out, timing-sensitive clock signal.
Circuit speed adapts to changing temperature and voltage conditions rather than being locked at the speed mandated by worst-case assumptions.
Lower, on-demand power consumption; zero standby power consumption. In 2005 Epson has reported 70% lower power consumption compared to synchronous design. Also, clock drivers can be removed which can significantly reduce power consumption. However, when using certain encodings, asynchronous circuits may require more area, adding similar power overhead if the underlying process has poor leakage properties (for example, deep submicrometer processes used prior to the introduction of high-κ dielectrics).
No need for power-matching between local asynchronous functional domains of circuitry. Synchronous circuits tend to draw a large amount of current right at the clock edge and shortly thereafter. The number of nodes switching (and hence, the amount of current drawn) drops off rapidly after the clock edge, reaching zero just before the next clock edge. In an asynchronous circuit, the switching times of the nodes does not correlated in this manner, so the current draw tends to be more uniform and less bursty.
Robustness toward transistor-to-transistor variability in the manufacturing transfer process (which is one of the most serious problems facing the semiconductor industry as dies shrink), variations of voltage supply, temperature, and fabrication process parameters.
Less severe electromagnetic interference (EMI). Synchronous circuits create a great deal of EMI in the frequency band at (or very near) their clock frequency and its harmonics; asynchronous circuits generate EMI patterns which are much more evenly spread across the spectrum.
Design modularity (reuse), improved noise immunity and electromagnetic compatibility. Asynchronous circuits are more tolerant to process variations and external voltage fluctuations.
|
wikipedia
|
wiki_26671_chunk_3
|
Civil engineering software
|
Another specific subset, infrastructure design, relies heavily on estimates of load, pressure, drainage and flow. Some software houses have attempted to provide design software catering for the variety of infrastructure design fields in an integrated manner. However, general-purpose software may be used in the same manner at a fraction of the cost of design software. When planning the construction phase, various project management methods are used to estimate factors such as cost, schedule and resourcing. Different software packages rely on different formulas and theories as the basis for these calculations. Consulting engineers also take advantage of the insight software can provide as far as crossing services are concerned. A road design may have to accommodate the presence of underground pipes for example. Civil Designer is an example of a design package which forms an integrated data gathering, drawing, surface modeling and design system for civil engineering infrastructure.
|
wikipedia
|
wiki_21733_chunk_49
|
European History Network
|
It is easy to assume that engagement with digital and e-learning resources is universal and at the same level, yet many universities, and departments within them, are at different stages of taking advantage of the opportunities such resources offer. The Working Group is mapping the use of digital and e-learning resources in the universities of CLIOHWORLD partners using an online survey. We hope to identify what digital resources are being used by individuals and their colleagues to support their teaching; get a sense of the way in which e-learning tools are being utilised to facilitate and enhance student experience; and explore the extent to which such endeavours are supported at a departmental, faculty and institutional level.
|
wikipedia
|
wiki_29005_chunk_34
|
IUPAC nomenclature of inorganic chemistry 2005
|
Bridging index
Where there are more than two centres that are bridged a bridging index is added as a subscript. For example in basic beryllium acetate which can be visualised as a tetrahedral arrangement of Be atoms linked by 6 acetate ions forming a cage with a central oxide anion, the formula and name are as follows: [Be4(μ4-O)(μ-O2CMe)6] hexakis(μ-acetato-κO:κO′)-μ4-oxido-tetrahedro-tetraberyllium
|
wikipedia
|
wiki_30185_chunk_6
|
Crystallographic database
|
Crystal structure data in CIF format are linked to scientific articles as supplementary material. CIFs may be accessible directly from the publisher’s website, crystallographic databases, or both. In recent years, many publishers of crystallographic journals have come to interpret CIFs as formatted versions of open data, i.e. representing non-copyrightable facts, and therefore tend to make them freely available online, independent of the accessibility status of linked scientific articles. Trends
|
wikipedia
|
wiki_1878_chunk_33
|
Density functional theory
|
In practice, Kohn–Sham theory can be applied in several distinct ways, depending on what is being investigated. In solid-state calculations, the local density approximations are still commonly used along with plane-wave basis sets, as an electron-gas approach is more appropriate for electrons delocalised through an infinite solid. In molecular calculations, however, more sophisticated functionals are needed, and a huge variety of exchange–correlation functionals have been developed for chemical applications. Some of these are inconsistent with the uniform electron-gas approximation; however, they must reduce to LDA in the electron-gas limit. Among physicists, one of the most widely used functionals is the revised Perdew–Burke–Ernzerhof exchange model (a direct generalized gradient parameterization of the free-electron gas with no free parameters); however, this is not sufficiently calorimetrically accurate for gas-phase molecular calculations. In the chemistry community, one popular functional is known as BLYP (from the name Becke for the exchange part and Lee, Yang and Parr for the correlation part). Even more widely used is B3LYP, which is a hybrid functional in which the exchange energy, in this case from Becke's exchange functional, is combined with the exact energy from Hartree–Fock theory. Along with the component exchange and correlation funсtionals, three parameters define the hybrid functional, specifying how much of the exact exchange is mixed in. The adjustable parameters in hybrid functionals are generally fitted to a "training set" of molecules. Although the results obtained with these functionals are usually sufficiently accurate for most applications, there is no systematic way of improving them (in contrast to some of the traditional wavefunction-based methods like configuration interaction or coupled cluster theory). In the current DFT approach it is not possible to estimate the error of the calculations without comparing them to other methods or experiments.
|
wikipedia
|
wiki_3834_chunk_15
|
International Chemistry Olympiad
|
The current ten countries with the best all-time results are as follows: Summary Remote IChO
Due to the COVID-19 pandemic, IChO 2020 and 2021 were organized remotely without a laboratory exam in order to keeping the Olympic spirit of collaboration and peace even in harsh times. See also
Asian Physics Olympiad
International Physics Olympiad
International Astronomy Olympiad
International Biology Olympiad
List of chemistry awards References External links The official site of the IChO Steering Committee with uptodate rules and data
Official site of the International Chemistry Olympiad International Information Center
A short review on the development of the International Chemistry Olympiads
A database of all past IChO participants
|
wikipedia
|
wiki_28772_chunk_10
|
Bentley–Ottmann algorithm
|
Detailed algorithm
The Bentley–Ottmann algorithm performs the following steps.
Initialize a priority queue Q of potential future events, each associated with a point in the plane and prioritized by the x-coordinate of the point. So, initially, Q contains an event for each of the endpoints of the input segments.
Initialize a self-balancing binary search tree T of the line segments that cross the sweep line L, ordered by the y-coordinates of the crossing points. Initially, T is empty. (Even though the line sweep L is not explicitly represented, it may be helpful to imagine it as a vertical line which, initially, is at the left of all input segments.)
While Q is nonempty, find and remove the event from Q associated with a point p with minimum x-coordinate. Determine what type of event this is and process it according to the following case analysis:
If p is the left endpoint of a line segment s, insert s into T. Find the line-segments r and t that are respectively immediately above and below s in T (if they exist); if the crossing of r and t (the neighbours of s in the status data structure) forms a potential future event in the event queue, remove this possible future event from the event queue. If s crosses r or t, add those crossing points as potential future events in the event queue.
If p is the right endpoint of a line segment s, remove s from T. Find the segments r and t that (prior to the removal of s) were respectively immediately above and below it in T (if they exist). If r and t cross, add that crossing point as a potential future event in the event queue.
If p is the crossing point of two segments s and t (with s below t to the left of the crossing), swap the positions of s and t in T. After the swap, find the segments r and u (if they exist) that are immediately below and above t and s, respectively. Remove any crossing points rs (i.e. a crossing point between r and s) and tu (i.e. a crossing point between t and u) from the event queue, and, if r and t cross or s and u cross, add those crossing points to the event queue.
|
wikipedia
|
wiki_13301_chunk_5
|
Aspects of Physics
|
Marginalized Information Forms Two: (2007)
"Logo (Medium)"
" "
"Monumentum"
"Unthousand Done"
"Recall Seaqence"
"Intrastrings"
"Blipsklippel"
"Bitty Odissey"
"E2 (Crushendo Mix)"
"Vortex Methods"
"Slow Grey Sun"
"Cut and Pastie"
|
wikipedia
|
wiki_26668_chunk_2
|
Los Amigos Biological Station
|
Research and training facilities at CICRA include lodging for 50 visitors, 250 m² of laboratory space, a lecture hall, a >50-km trail system, a 60-m radio tower, satellite internet access, access to online scientific literature and databases, high-resolution digital aerial photos of >200,000 ha of surrounding forests, a digital flora of >2,500 plant species collected on-site, a 470-volume scientific library, a weather station dating to 2000, and field guides to fish, amphibians and reptiles, and plants. Off-site resources include two smaller satellite stations, each with their own laboratories and lodging, 3 and 25 km from the main station; a GIS laboratory in nearby Puerto Maldonado; and two additional 60-m radio towers inside the conservation concession.
|
wikipedia
|
wiki_28816_chunk_24
|
MIREA – Russian Technological University
|
Altair Children’s Technopark
Since August 2019, the Altair Children’s Technopark has been operating on the premises of RTU MIREA for inquisitive and motivated high school students. The Technopark is equipped with unique high-tech facilities and devices. Its training programs were developed with the participation of industrial partners, such as Yandex, Mail.ru Group, Rostelecom Solar, Samsung Electronics, Oracle, Roselectronics, Generium, etc.
The training is free of charge. Short-term courses are also provided in the form of popular science lectures, master classes, excursions; and long-term programs (at least 36 academic hours), the result of which is contests and competitions, project defense or case solution developed together with industrial partners.
Prize-winning places in competitions, conferences and Olympiads based on the results of training score additional points for admission to specialized universities. The best and most able graduates have an advantage in selecting targeted training programs of industrial partners and the opportunity to internships in companies concluding at the same time a deferred employment contract.
The Technopark received a special Digital Volunteer award of the Digital Summits 2020 national award which was granted as an appreciation of its activity at the time of quarantine when all the programs were transferred expeditiously to the VKontakte platform. In March 2021, it received the status of a Federal innovation platform.
|
wikipedia
|
wiki_322_chunk_38
|
Logic programming
|
The following constraint logic program represents a toy temporal database of john's history as a teacher:
teaches(john, hardware, T) :- 1990 ≤ T, T < 1999.
teaches(john, software, T) :- 1999 ≤ T, T < 2005.
teaches(john, logic, T) :- 2005 ≤ T, T ≤ 2012.
rank(john, instructor, T) :- 1990 ≤ T, T < 2010.
rank(john, professor, T) :- 2010 ≤ T, T < 2014.
Here ≤ and < are constraint predicates, with their usual intended semantics. The following goal clause queries the database to find out when john both taught logic and was a professor:
|
wikipedia
|
wiki_29328_chunk_18
|
JaVale McGee
|
|-
| style="text-align:left;"| 2012
| style="text-align:left;"| Denver
| 7 || 0 || 25.9 || .434 || – || .538 || 9.6 || .7 || .7 || 3.1 || 8.6
|-
| style="text-align:left;"| 2013
| style="text-align:left;"| Denver
| 6 || 2 || 18.7 || .581 || – || .389 || 5.2 || .0 || .7 || 1.0 || 7.2
|-
| style="text-align:left;"| 2016
| style="text-align:left;"| Dallas
| 2 || 0 || 7.0 || .500 || – || .333 || 1.5 || .0 || .5 || .0 || 2.0
|-
| style="text-align:left;background:#afe6ba;"| 2017
| style="text-align:left;"| Golden State
| 16 || 1 || 9.3 || style="background:#cfecec;"| .732*|| – || .722 || 3.0 || .3 || .1 || .9 || 5.9
|-
| style="text-align:left;background:#afe6ba;"| 2018
| style="text-align:left;"| Golden State
| 13 || 9 || 12.2 || .672 || .000 || .684 || 3.2 || .3 || .2 || 1.3 || 6.5
|-
| style="text-align:left;background:#afe6ba;"| 2020
| style="text-align:left;"| L.A. Lakers
| 14 || 11 || 9.6 || .625 || .000 || .500 || 3.1 || .5 || .1 || .7 || 2.9
|-
| style="text-align:left;"| 2021
| style="text-align:left;"| Denver
| 4 || 0 || 8.5 || .300 || .000 || .333 || 3.0 || .8 || .3 || 1.3 || 2.0
|- class="sortbottom"
| style="text-align:center;" colspan="2" | Career
| 62 || 23 || 12.6 || .599 || .000 || .529 || 4.0 || .4 || .3 || 1.1 || 5.4
|
wikipedia
|
wiki_819_chunk_19
|
Dijkstra's algorithm
|
Using a priority queue A min-priority queue is an abstract data type that provides 3 basic operations: , and . As mentioned earlier, using such a data structure can lead to faster computing times than using a basic queue. Notably, Fibonacci heap or Brodal queue offer optimal implementations for those 3 operations. As the algorithm is slightly different, we mention it here, in pseudo-code as well :
|
wikipedia
|
wiki_18633_chunk_94
|
Algorithm characterizations
|
Van Emde Boas comments on a similar problem with respect to the random-access machine (RAM) abstract model of computation sometimes used in place of the Turing machine when doing "analysis of algorithms":
"The absence or presence of multiplicative and parallel bit manipulation operations is of relevance for the correct understanding of some results in the analysis of algorithms.
|
wikipedia
|
wiki_6117_chunk_13
|
Database design
|
The physical design of the database specifies the physical configuration of the database on the storage media. This includes detailed specification of data elements, data types, indexing options and other parameters residing in the DBMS data dictionary. It is the detailed design of a system that includes modules & the database's hardware & software specifications of the system. Some aspects that are addressed at the physical layer:
Security - end-user, as well as administrative security.
Replication - what pieces of data get copied over into another database, and how often. Are there multiple-masters, or a single one?
High-availability - whether the configuration is active-passive, or active-active, the topology, coordination scheme, reliability targets, etc all have to be defined.
Partitioning - if the database is distributed, then for a single entity, how is the data distributed amongst all the partitions of the database, and how is partition failure taken into account.
Backup and restore schemes.
|
wikipedia
|
wiki_1565_chunk_7
|
Incidence algebra
|
Examples
Positive integers ordered by divisibility
The convolution associated to the incidence algebra for intervals [1, n] becomes the Dirichlet convolution, hence the Möbius function is μ(a, b) = μ(b/a), where the second "μ" is the classical Möbius function introduced into number theory in the 19th century.
Finite subsets of some set E, ordered by inclusion
The Möbius function is
whenever S and T are finite subsets of E with S ⊆ T, and Möbius inversion is called the principle of inclusion-exclusion.
Geometrically, this is a hypercube:
Natural numbers with their usual order
The Möbius function is and Möbius inversion is called the (backwards) difference operator.
Geometrically, this corresponds to the discrete number line.
The convolution of functions in the incidence algebra corresponds to multiplication of formal power series: see the discussion of reduced incidence algebras below. The Möbius function corresponds to the sequence (1, −1, 0, 0, 0, ... ) of coefficients of the formal power series 1 − t, and the zeta function corresponds to the sequence of coefficients (1, 1, 1, 1, ...) of the formal power series , which is inverse. The delta function in this incidence algebra similarly corresponds to the formal power series 1.
Finite sub-multisets of some multiset E, ordered by inclusion
The above three examples can be unified and generalized by considering a multiset E, and finite sub-multisets S and T of E. The Möbius function is
This generalizes the positive integers ordered by divisibility by a positive integer corresponding to its multiset of prime divisors with multiplicity, e.g., 12 corresponds to the multiset
This generalizes the natural numbers with their usual order by a natural number corresponding to a multiset of one underlying element and cardinality equal to that number, e.g., 3 corresponds to the multiset
Subgroups of a finite p-group G, ordered by inclusion
The Möbius function is if is a normal subgroup of and and it is 0 otherwise. This is a theorem of Weisner (1935).
Partitions of a set
Partially order the set of all partitions of a finite set by saying σ ≤ τ if σ is a finer partition than τ. In particular, let τ have t blocks which respectively split into s1, ..., st finer blocks of σ, which has a total of s = s1 + ··· + st blocks. Then the Möbius function is:
|
wikipedia
|
wiki_1279_chunk_7
|
List of fictional computers
|
1990s
Thing, a very small box shaped computer owned by the Nomes, from Terry Pratchett's The Nome Trilogy (1990)
Grand Napoleon, a Charles Babbage-style mechanical supercomputer from the alternate history novel The Difference Engine by William Gibson and Bruce Sterling (1990)
Yggdrasil, a vastly intelligent AI which effectively runs the world, including many virtual environments and subordinate AIs, in Kim Newman's The Night Mayor (1990)
Jill, a computer reaching self-awareness in Greg Bear's Queen of Angels and Slant novels (1990 and 1997)
Aleph, the computer which not only operates a space station but also houses the personality of a human character whose body became malfunction, from the Tom Maddox novel Halo (1991)
Art Fish, a.k.a. Dr. Fish, later fused with a human to become Markt, from Pat Cadigan's novel Synners (1991)
Blaine the Mono, from Stephen King's The Dark Tower, a control system for the City of Lud and monorail service; also Little Blaine and Patricia (1991)
Center, from S. M. Stirling and David Drake's The General series, an AI tasked to indirectly unite planet Bellevue and restore its civilization, with the eventual goal of restoration of FTL travel and of civilization to the collapsed interplanetary federation; also Sector Command and Control Unit AZ12-b14-c000 Mk. XIV and Center (1991)
Dahak, from David Weber's Mutineer's Moon and its sequels, later republished inomnibus format Empire from the Ashes.
The Oversoul, a supercomputer and satellite network from Orson Scott Card's Homecoming Saga, first introduced in The Memory of Earth (1992)
FLORANCE, spontaneously generated AI from Doctor Who Virgin New Adventures (1992)
David and Jonathon, from Arthur C. Clarke's The Hammer of God (1993)
Hex, from Terry Pratchett's Discworld (1994)
Prime Intellect, the computer controlling the universe in the Internet novel The Metamorphosis of Prime Intellect by Roger Williams (1994)
FIDO (Foreign Intruder Defense Organism), a semi-organic droid defensive system first mentioned in Champions of the Force, a Star Wars novel by Kevin J. Anderson (1994)
Abraham, from Philip Kerr's novel Gridiron, is a superintelligent program designed to operate a large office building. Abraham is capable of improving his own code, and eventually kills humans and creates his own replacement "Isaac" (1995)
Helen, sentient AI from Richard Powers' Galatea 2.2 (1995)
Illustrated primer, a book-like computer found at Neal Stephenson's novel The Diamond Age, which was first designed to aid a rich girl on her education, but gets lost, and instructs a poor Chinese girl named Nell. It has no proprietary AI inside, but learns about the user's circumstance, adapts, and creates characters that act accordingly with the user's surroundings. (1995)
wizard 0.2, the most complex Turing machine found at the fictional primer's universe from The Diamond Age by Neal Stephenson. Supposedly used to verify information that gets to King Coyote's castle at the primer's story, but later revealed to check no information; that task was made by King Coyote himself, who personally read every piece he was to add to his library. (1995)
Ozymandias, a recurring artificial intelligence in Deathstalker and its sequels, by Simon R. Green (1995)
Ordinator, the name used for any computer in the parallel universe occupied by Lyra in the novel Northern Lights by Philip Pullman (1995)
Teleputer, the replacement for television and computers that has on demand video via dial up internet from David Foster Wallace's Infinite Jest (1996)
GRUMPY/SLEEPY, psychic AI in the Doctor Who New Adventures novel Sleepy by Kate Orman (1996)
Rei Toei, an artificial singer from William Gibson's novels Idoru and All Tomorrow's Parties (1996)
Titania, a female computer providing the personality to the Starship Titanic from the Terry Jones novel Douglas Adams' Starship Titanic: A Novel (1997).
DOCTOR, AI designed to duplicate the Doctor's reactions in the Doctor Who Eighth Doctor Adventures novel Seeing I by Kate Orman and Jon Blum, eventually became an explorer with FLORANCE as its "companion" (1998)
TRANSLTR, NSA supercomputer from Dan Brown's Digital Fortress (1998)
Engine for the Neutralising of Information by the Generation of Miasmic Alphabets, an advanced cryptographic machine created by Leonard of Quirm, Discworld (1999) (compare with the actual Enigma machine)
"Luminous", from Greg Egan's short story, a computer that uses a diffraction grating created by lasers to diffract electrons and make calculations (1999)
|
wikipedia
|
wiki_35500_chunk_6
|
International Commission of Agricultural and Biosystems Engineering
|
Fellows
The title of Fellow is the highest honour in CIGR. The title of Fellow is conferred to individuals who have made sustained, outstanding contributions world-wide, and that continue to improve the outcomes of the Agricultural and Bio-systems Engineering profession.
2000: P. Abeels (Belgium), J. De Baerdemaeker (Belgium), E. Berge (Norway), J. Daelemans (Belgium), G. Pellizzi (Italy), Z. Sibalszky (Hungary), G. Singh (Thailand), J. Souty (France), H.van Lier (The Netherlands), H. Heege (Germany)
2002: A. Kamaruddin, G. Papadakis, J. Ortiz-Canavate, O. Marchenko, Y. Kishida, F. Bakker-Arkema, C. Hall, F. Coolman, A. Musy
2006: El Hassan Bourarach, Bill Stout, El Houssine Bartali, Makoto Hoki, Maohua Wang, Osamu Kitani
|
wikipedia
|
wiki_26038_chunk_5
|
List of programs broadcast by USA Network
|
Syndicated programmingCoronation Street (1982–83)Adventures in Paradise (1983–84)The Alfred Hitchcock Hour (1983–93)Dragnet (1983–90)Bob & Carol & Ted & Alice (1984–85)Bridget Loves Bernie (1984–85)Candid Camera (1984–88)The Flying Nun (1984–85)Gidget (1984–85)The Gong Show (1984–87)Lancer (1984–86)Laverne & Shirley (1984–1997)Make Me Laugh (1984–86)Tales of the Unexpected (1984–85)The Virginian (1984–87)Bullseye (1985–87)Chain Reaction (1985–91)The Edge of Night (1985–89)He & She (1985–87)The Joker's Wild (1985–87, 1991–94)The Master (1985, 1989)All-Star Blitz (1986)Alice (1986–1993)Anything for Money (1986–88)The Girl with Something Extra (1986–88)Good Morning World (1986)Let's Make a Deal (1986–88)Liar's Club (1986–87)Madame's Place (1986–91)The Monroes (1986)Mr. Merlin (1986–88)Oh Madeline (1986–88)Riptide (1986–88)Room 222 (1986–88)The Second Hundred Years (1986–87)That Girl (1986–88)Wanted: Dead or Alive (1986–87)The Benny Hill Show (1987)Code Red (1987–88)The Great Space Coaster (1987)Hot Potato (1987–90)The New Mike Hammer (1987–92)Play the Percentages (1987–89)Press Your Luck (1987–95)Search for Tomorrow (1987–89)Temperatures Rising (1987–88)Tic-Tac-Dough (1987–90, 1993–94)$25,000/$100,000 Pyramid (1988–95)Diamonds (1988–91)The Buckle Family and Friends (1987–1998)Bustin' Loose (1988–89)Double Trouble (1988–91)High Rollers (1988–91)The Law & Harry McGraw (1988, 1991)Miami Vice (1988–91)Murder, She Wrote (1988–97)Otherworld (1988)Private Eye (1988–91)Street Hawk (1988–90)Tales of the Gold Monkey (1988)The Equalizer (1989–91)Face the Music (1989–90)Hollywood Squares (1989–93)It's Your Move (1989–92)Land of the Giants (1989, 1992)Lost in Space (1989–90)My Sister Sam (1989–93)Name That Tune (1989–91)Philip Marlowe, Private Eye (1989–90)Rita and Spot (1989–1997)The Three Stooges (1989)Werewolf (1989–91)Wipeout (1989–91)Counterstrike (1990–93)Divorce Court (1990–93)Dog House (1990–93)Just the Ten of Us (1990–95)MacGyver (1990–97)The Partridge Family (1990)Rosie (1990–1998)Swamp Thing: The Series (1990–93)Win, Lose or Draw (1990–92)Beyond Reality (1991–93)Darkroom (1991)The Judge (1991–93)My Two Dads (1991–95, 2002)Scrabble (1991–95)Superior Court (1991–93)Welcome Back, Kotter (1991–94)American Gladiators (1992–96)Bosom Buddies (1992–95)First Business (1992–96)Quantum Leap (1992–96)Sale of the Century (1992–94)The Facts of Life (1993–98)Major Dad (1993–97, 1999)The Odd Couple (1993–94)Swans Crossing (1993–94)Talk About (1993)Wings (1993–2002, 2008–2011)Bloomberg Television (1994–2004)Caesars Challenge (1994)Knight Rider (1994–96)Magnum, P.I. (1994–99)Forever Knight (1995–96)Highlander: The Series (1995–98)Love Connection (1995–97)The People's Court (1995–97)Renegade (1995–2001)America's Most Wanted (1996–97)Hercules: The Legendary Journeys (1996–2001)Top Cops (1996–97)Walker, Texas Ranger (1996–2011)Xena: Warrior Princess (1996–2001)Baywatch (1997–2001)Gimme a Break! (1997–98)Perfect Strangers (1997–98)Saved by the Bell: The New Class (1997–2001)Sirens (1997)Webster (1997–98)Boston Common (1998–2000)America's Funniest Home Videos (1998–2001)The Jeff Foxworthy Show (1998–99)New York Undercover (1998–2001)The Single Guy (1998–2000)Something So Right (1998–2001)Almost Perfect (1999–2002)Fired Up (1999–2002)JAG (1999–2011)The Naked Truth (1999–2000)Ned and Stacy (1999–2001)Viper (1999–2001)Working (1999–2001)Carol Burnett and Friends (2000–01)Doctor Doctor (2000–01)Hearts Afire (2000–01)Jesse (2000–02)The John Larroquette Show (2000–02)Martin (2000–04)Nash Bridges (2000–06)Veronica's Closet (2000–02)Living Single (2001–03)Coach (2004–07)The District (2004–06)Without a Trace (2004-10)Crossing Jordan (2006-2016)House M.D. (2006–18)The Practice (2006-11)CSI: Miami (2006-2012)Becker (2008–11)Cold Case (2010-17)Boston Legal (2011-15)CSI: Crime Scene Investigation (2011–2020)The Mentalist (2011-18)The Closer (2012-2019)The X-Files (2012-15)Cheers (2012)Bones (2012-2020)Scandal (2013-2020)Modern Family (2013–2021)Leverage (2015-19) Rizzoli & Isles (2016-2020) Broadchurch (2017-18)Major Crimes (2017-2021)Blindspot (2018-20)Las Vegas (2020)New Amsterdam (2020)Sex and the City (2020)Zoey's Extraordinary Playlist (2020)Law & Order: Organized Crime (2021)Ordinary Joe (2021)Resident Alien (2021)Young Rock (2021)
|
wikipedia
|
wiki_8619_chunk_27
|
K-nearest neighbors algorithm
|
Below is an illustration of CNN in a series of figures. There are three classes (red, green and blue). Fig. 1: initially there are 60 points in each class. Fig. 2 shows the 1NN classification map: each pixel is classified by 1NN using all the data. Fig. 3 shows the 5NN classification map. White areas correspond to the unclassified regions, where 5NN voting is tied (for example, if there are two green, two red and one blue points among 5 nearest neighbors). Fig. 4 shows the reduced data set. The crosses are the class-outliers selected by the (3,2)NN rule (all the three nearest neighbors of these instances belong to other classes); the squares are the prototypes, and the empty circles are the absorbed points. The left bottom corner shows the numbers of the class-outliers, prototypes and absorbed points for all three classes. The number of prototypes varies from 15% to 20% for different classes in this example. Fig. 5 shows that the 1NN classification map with the prototypes is very similar to that with the initial data set. The figures were produced using the Mirkes applet.
|
wikipedia
|
wiki_194_chunk_68
|
Ecology
|
The ecological complexities human beings are facing through the technological transformation of the planetary biome has brought on the Anthropocene. The unique set of circumstances has generated the need for a new unifying science called coupled human and natural systems that builds upon, but moves beyond the field of human ecology. Ecosystems tie into human societies through the critical and all-encompassing life-supporting functions they sustain. In recognition of these functions and the incapability of traditional economic valuation methods to see the value in ecosystems, there has been a surge of interest in social-natural capital, which provides the means to put a value on the stock and use of information and materials stemming from ecosystem goods and services. Ecosystems produce, regulate, maintain, and supply services of critical necessity and beneficial to human health (cognitive and physiological), economies, and they even provide an information or reference function as a living library giving opportunities for science and cognitive development in children engaged in the complexity of the natural world. Ecosystems relate importantly to human ecology as they are the ultimate base foundation of global economics as every commodity, and the capacity for exchange ultimately stems from the ecosystems on Earth.
|
wikipedia
|
wiki_30004_chunk_0
|
Navigational Algorithms
|
The navigational algorithms are the quintessence of the executable software on portable calculators or PDA as an aid to the art of navigation, this attempt article describe both algorithms and software for "PC-PDA" implementing different calculation procedures for navigation .
The calculation power obtained by the languages: Basic, "C", Java, etc. .., from portable calculators or PDAs , has made it possible to develop programs that allow calculating the position without the need for tables, in fact they have some basic tables with the correction factors for each year and calculate the values "on the fly" at runtime .
|
wikipedia
|
wiki_18517_chunk_1
|
Comparison of genealogy software
|
Genealogy software products differ in the way they support data acquisition (e.g. drag and drop data entry for images, flexible data formats, free defined custom attributes for persons and connections between persons, rating of sources) and interaction (e.g. 3D-view, name filters, full text search and dynamic pan and zoom navigation), in reporting (e.g.: fan charts, automatic narratives, relationship between arbitrary people, place of birth on virtual globes, statistics about number of children per family), validation (e.g.: consistency checks, research assistants connected to online genealogy databases), exporting (e.g.: export as web page, book or wall chart) and integration (e.g.: synchronisation with tablet version). Some software might include also fun and entertainment features (e.g. quizzes or slideshows).
|
wikipedia
|
wiki_33712_chunk_9
|
Inversion (discrete mathematics)
|
The following sortable table shows the 24 permutations of four elements with their place-based inversion sets, inversion related vectors and inversion numbers. (The small columns are reflections of the columns next to them, and can be used to sort them in colexicographic order.)
|
wikipedia
|
wiki_7690_chunk_16
|
DeCODE genetics
|
deCODE's vast collection of DNA, medical and genealogical data that could be mined together - and enriched through repeated querying and imputation - was almost perfectly suited to this type of study. Since 2003, the company has discovered and published hundreds of variants linked to susceptibility to scores of diseases and conditions, including major ongoing contributions to understanding inherited risk for Alzheimer's disease, schizophrenia and other psychiatric disorders; a dozen common forms of cancer; coronary artery disease, stroke atrial fibrillation and the other most common cardiovascular diseases; as well as traits and phenotypes ranging from drug response to cognition and hair and eye color. The company publishes its discoveries in peer-reviewed journals, and many, such as the TCF7L2 variants in type 2 diabetes, are used as standard risk markers in polygenic risk modeling and in research.
|
wikipedia
|
wiki_154_chunk_2
|
Cyclone (programming language)
|
To maintain the tool set that C programmers are used to, Cyclone provides the following extensions:
Never-NULL pointers do not require NULL checks
"Fat" pointers support pointer arithmetic with run-time bounds checking
Growable regions support a form of safe manual memory management
Garbage collection for heap-allocated values
Tagged unions support type-varying arguments
Injections help automate the use of tagged unions for programmers
Polymorphism replaces some uses of void *
varargs are implemented as fat pointers
Exceptions replace some uses of setjmp and longjmp
|
wikipedia
|
wiki_14725_chunk_2
|
Georges Matheron
|
Matheron’s [Formule des Minerais Connexes] became his Note Statistique No 1. In this paper of November 25, 1954, Matheron derived the degree of associative dependence between lead and silver grades of core samples. In his Rectificatif of January 13, 1955, he revised the arithmetic mean lead and silver grades because his core samples varied in length. He did derive the length-weighted average lead and silver grades but failed to derive the variances of his weighted averages. Neither did he derive the degree of associative dependence between metal grades of ordered core samples as a measure for spatial dependence between ordered core samples. He did not disclose his primary data set and worked mostly with symbols rather than real measured values such test results for lead and silver in Matheron's core samples. Matheron's Interprétations des corrélations entre variables aléatoires lognormales of November 29, 1954, was marked Note statistisque No 2. In this paper, Matheron explored lognormal variables and set the stage for statistics by symbols. Primary data would have allowed him to assess whether or not lead and silver grades departed from the lognormal distribution, or displayed spatial dependence along core samples in his borehole.
|
wikipedia
|
wiki_35786_chunk_27
|
Software development process
|
A decades-long goal has been to find repeatable, predictable processes that improve productivity and quality. Some try to systematize or formalize the seemingly unruly task of designing software. Others apply project management techniques to designing software. Large numbers of software projects do not meet their expectations in terms of functionality, cost, or delivery schedule - see List of failed and overbudget custom software projects for some notable examples.
|
wikipedia
|
wiki_19787_chunk_2
|
Bonferroni correction
|
Background
The method is named for its use of the Bonferroni inequalities.
An extension of the method to confidence intervals was proposed by Olive Jean Dunn. Statistical hypothesis testing is based on rejecting the null hypothesis if the likelihood of the observed data under the null hypotheses is low. If multiple hypotheses are tested, the chance of observing a rare event increases, and therefore, the likelihood of incorrectly rejecting a null hypothesis (i.e., making a Type I error) increases.
|
wikipedia
|
wiki_11990_chunk_6
|
Anonymous recursion
|
For example, in JavaScript the factorial function can be defined via anonymous recursion as such:<ref name=olliej>answer by olliej, Oct 25 '08 to "Why was the arguments.callee.caller property deprecated in JavaScript?", StackOverflow</ref>
[1, 2, 3, 4, 5].map(function(n) {
return (!(n > 1)) ? 1 : arguments.callee(n-1) * n;
});
Rewritten to use a named function expression yields:
[1, 2, 3, 4, 5].map(function factorial(n) {
return (!(n > 1)) ? 1 : factorial(n-1) * n;
});
|
wikipedia
|
wiki_18997_chunk_8
|
Cúram Software
|
External links
Cúram Software home page
Smarter Cities
Article on use of Cúram products by New Zealand Government from The Dominion Post
Cúram Software Utah state implementation featured in Government Technology magazine annual list of 'Doers, Dreamers and Drivers
Story in Government Technology on use of Cúram products being used to simplify social services in Indiana
HPtoday announced a new global agreement
Ontario government, IBM smacked for bungled software project
Gov. Hutchinson Tells DHS To Pause Over-Budget Medicaid Computer System
Systems failure - Our view: We don't excuse state officials for oversight of the health exchange, but IBM also needs to be held to public account for its faulty software
EXCLUSIVE: IBM wins $32M Ontario government contract despite delivering problem-riddled software
SAMS: More Than A "Glitch"
IBM Cúram Mobile
|
wikipedia
|
wiki_27712_chunk_3
|
Hawkins Electrical Guide
|
Google Books Volume Links
As of September 2008, Google Books does not provide a simple, direct means to find each volume of this media set, and appears to include scanned copies of different volumes from different libraries and copyright dates from 1914-1917. Scan quality varies from one volume to the next. For your convenience, links to the available scanned media are provided here:
Volume 1, Copyright 1917, Impression 1921, from the University of California
Volume 2, Copyright 1917, from the University of Wisconsin - Madison, General Library System
Volume 3, Copyright 1917, Impression 1926, from the Harvard College Library
Volume 4, Copyright 1917, from the University of Wisconsin - Madison, General Library System,
Volume 5, Copyright 1917, from the University of Wisconsin - Madison, General Library System
Volume 6, Copyright 1917, from the Harvard College Library
Volume 7 & 8, Copyright 1914, from the New York Public Library
Volume 9, Copyright 1917, Impression 1926, from the Harvard College Library
Volume 10, Copyright 1917, Impression 1924-1925, from the Harvard College Library
|
wikipedia
|
wiki_31745_chunk_2
|
Decagram (geometry)
|
Related figures
A regular decagram is a 10-sided polygram, represented by symbol {10/n}, containing the same vertices as regular decagon. Only one of these polygrams, {10/3} (connecting every third point), forms a regular star polygon, but there are also three ten-vertex polygrams which can be interpreted as regular compounds:
{10/5} is a compound of five degenerate digons 5{2}
{10/4} is a compound of two pentagrams 2{5/2}
{10/2} is a compound of two pentagons 2{5}.
|
wikipedia
|
wiki_14305_chunk_3
|
Advancing Chemistry by Enhancing Learning in the Laboratory
|
At this workshop staff and students reviewed 33 experiments submitted by the different participating universities. After completing the activities there were debrief sessions in the evening. All those who completed experiments also completed surveys on the experiment and the documentation behind it. Another (smaller) workshop was run in February 2007 as a satellite activity of the Royal Australian Chemical Institute (RACI) joint Organic and Physical Chemistry Division Conference OPC07. This workshop will be hosted by the University of Adelaide. See also
Royal Australian Chemical Institute (RACI)
|
wikipedia
|
wiki_18473_chunk_7
|
NASA Exceptional Engineering Achievement Medal
|
Timothy C. Adams
Steve N. Beck
Ed Cheung
Myron A. Diftler
Thomas Friedmann
Martin B. Houghton
Eugene A. Morelli
Paul W. Roberts
James Taylor
Dennis Albaijes
Daniel L. Berry
D. Steven Cooley
Marcia S. Domack
Daniel B. Gazda
Young K. Kim
David E. Myers
Jose I. Rodriguez
John C. Thesken
Christian C. Bechtold
Kevin R. Boyce
Mark G. D’Agostino
Richard E. Dyke
Michael G. Gilbert
Darlene S. Lee
Janiene Pape
Don J. Roth
Jirong Yu
Robin A. Beck
Scott C. Burleigh
Paul M. Danehy
David F. Everett
Mark W. Hilburger
Joseph C. Lewiz
John C. Pearson
Henry P. Sampler
Daniel E. Yuchnovicz
|
wikipedia
|
wiki_8148_chunk_9
|
Ecological engineering
|
Mitsch and Jorgensen identified 19 Design Principles for ecological engineering, yet not all are expected to contribute to any single design:
Ecosystem structure & function are determined by forcing functions of the system;
Energy inputs to the ecosystems and available storage of the ecosystem is limited;
Ecosystems are open and dissipative systems (not thermodynamic balance of energy, matter, entropy, but spontaneous appearance of complex, chaotic structure);
Attention to a limited number of governing/controlling factors is most strategic in preventing pollution or restoring ecosystems;
Ecosystem have some homeostatic capability that results in smoothing out and depressing the effects of strongly variable inputs;
Match recycling pathways to the rates of ecosystems and reduce pollution effects;
Design for pulsing systems wherever possible;
Ecosystems are self-designing systems;
Processes of ecosystems have characteristic time and space scales that should be accounted for in environmental management;
Biodiversity should be championed to maintain an ecosystem's self design capacity;
Ecotones, transition zones, are as important for ecosystems as membranes for cells;
Coupling between ecosystems should be utilized wherever possible;
The components of an ecosystem are interconnected, interrelated, and form a network; consider direct as well as indirect efforts of ecosystem development;
An ecosystem has a history of development;
Ecosystems and species are most vulnerable at their geographical edges;
Ecosystems are hierarchical systems and are parts of a larger landscape;
Physical and biological processes are interactive, it is important to know both physical and biological interactions and to interpret them properly;
Eco-technology requires a holistic approach that integrates all interacting parts and processes as far as possible;
Information in ecosystems is stored in structures.
|
wikipedia
|
wiki_2677_chunk_25
|
Orthomolecular medicine
|
Proponents of orthomolecular medicine counter that some vitamins and nutrients are now used in medicine as treatments for specific diseases, such as megadose niacin and fish oil for dyslipidemias, and megavitamin therapies for a group of rare inborn errors of metabolism. A review in the Annals of Internal Medicine concluded that while some therapies might be beneficial, others might be harmful or interfere with effective medical therapy. A recent study of over 161,000 individuals provided, in the words of the authors, "convincing evidence that multivitamin use has little or no influence on the risk of common cancers, cardiovascular disease, or total mortality in postmenopausal women." A recent meta-analysis in JAMA suggested that supplementation with combinations of antioxidant vitamins (beta-carotene, vitamin A, and vitamin E) may increase mortality, although with respect to beta-carotene this conclusion may be due to the known harmful effect in smokers.
|
wikipedia
|
wiki_2443_chunk_112
|
Quantitative genetics
|
Cross-multiplication rules
In the following sections on sib-crossing and similar topics, a number of "averaging rules" are useful. These derive from path analysis. The rules show that any co-ancestry coefficient can be obtained as the average of cross-over co-ancestries between appropriate grand-parental and parental combinations. Thus, referring to the adjacent diagram, Cross-multiplier 1 is that fPQ = average of ( fAC , fAD , fBC , fBD ) = (1/4) [fAC + fAD + fBC + fBD ] = fY . In a similar fashion, cross-multiplier 2 states that fPC = (1/2) [ fAC + fBC ]—while cross-multiplier 3 states that fPD = (1/2) [ fAD + fBD ] . Returning to the first multiplier, it can now be seen also to be fPQ = (1/2) [ fPC + fPD ], which, after substituting multipliers 2 and 3, resumes its original form.
|
wikipedia
|
wiki_30079_chunk_10
|
Autonomic Network Architecture
|
These two (scientific and technical) objectives complement and reinforce each other in a tight feedback loop: Prototypes of research results will be implemented in the testbed at an early stage, such that preliminary experimental results can be used as a feedback to steer and refine the architectural design and to obtain more accurate and realistic research results. The research part will shape the testbed in order to maintain it at the fore-front of technology. To help the long term visions to materialize, ANA uses the testbed as an investigative research vehicle while remaining committed to the far looking character of the situated and autonomic networking initiative.
|
wikipedia
|
wiki_5541_chunk_12
|
Electrical impedance tomography
|
If images are to be displayed in real time a typical approach is the application of some form of regularized inverse of a linearization of the forward problem or a fast version of a direct reconstruction method such as the D-bar method. Most practical systems used in the medical environment generate a 'difference image', i.e. differences in voltage between two time points are left-multiplied by the regularized inverse to calculate an approximate difference between permittivity and conductivity images. Another approach is to construct a finite element model of the body and adjust the conductivities (for example using a variant of Levenburg–Marquart method) to fit the measured data. This is more challenging as it requires an accurate body shape and the exact position of the electrodes.
|
wikipedia
|
wiki_14311_chunk_3
|
Hybrid algorithm (constraint satisfaction)
|
find a cycle cutset of the graph of the problem
run search on the variables of the cutset
when a consistent partial assignment to all variables are found,
replace each variable of the cutset with a new variable for each constraint;
set the domains of these new variables to the value of the old variable in the partial assignment
solve the problem using inference
|
wikipedia
|
wiki_26704_chunk_2
|
Electric Dreams Software
|
List of releases
Riddler's Den (1985), David Harper
I, of the Mask (1985), Spaceman Ltd
Back to the Future (1985), Software Images
Winter Sports (video game) (1985), Software Images
Zaxxon (1985); under license from Sega
Aliens: The Computer Game (1986), Software Studios
Big Trouble in Little China (1986), Software Studios
Dandy (1986), The RamJam Corporation
Explorer (1986), The RamJam Corporation
Hijack (1986), Paradise Software
Mermaid Madness (1986), Soft Design
Prodigy (1986), MD Software
Spindizzy (1986), Paul Shirley and Phil Churchyard
Xarq (1986), The RamJam Corporation
Aliens: The Computer Game (1987), Mr. Micro
Firetrack (1987), Aardvark Software
FireTrap (1987), Source Software; under license from Data East USA
Nihilist (1987), Shahid Ahmad
RMS Titanic
Starblade (1986), Bob Duncan and Gary Stark
Star Raiders II (1987), Simon Freeman, Gary Stark and Bruce Poelman; under license from Atari
Super Sprint (1987), Software Studios; under license from Atari
Tempest (1987), David Pridmore; under license from Atari
Super Hang-On (1986), Software Studios; under license from Sega
Championship Sprint (1988), Catalyst Coders; under license from Atari
Karnov (1988), Mr. Micro; under license from Data East USA
R-Type (1988), Manfred Trenz and Andreas Escher; under license from Irem
Incredible Shrinking Sphere (1989), Foursfield
Wicked (1989)
Millennium 2.2 (1989), Ian Bird
|
wikipedia
|
wiki_33588_chunk_31
|
Kernel (operating system)
|
Process cooperation
Edsger Dijkstra proved that from a logical point of view, atomic lock and unlock operations operating on binary semaphores are sufficient primitives to express any functionality of process cooperation. However this approach is generally held to be lacking in terms of safety and efficiency, whereas a message passing approach is more flexible. A number of other approaches (either lower- or higher-level) are available as well, with many modern kernels providing support for systems such as shared memory and remote procedure calls.
|
wikipedia
|
wiki_2437_chunk_15
|
Word problem (mathematics education)
|
Ancient Egyptian mathematics also has examples of word problems. The Rhind Mathematical Papyrus includes a problem that can be translated as:There are seven houses; in each house there are seven cats; each cat kills seven mice; each mouse has eaten seven grains of barley; each grain would have produced seven hekat. What is the sum of all the enumerated things?In more modern times the sometimes confusing and arbitrary nature of word problems has been the subject of satire. Gustave Flaubert wrote this nonsensical problem, now known as the Age of the captain:Since you are now studying geometry and trigonometry, I will give you a problem. A ship sails the ocean. It left Boston with a cargo of wool. It grosses 200 tons. It is bound for Le Havre. The mainmast is broken, the cabin boy is on deck, there are 12 passengers aboard, the wind is blowing East-North-East, the clock points to a quarter past three in the afternoon. It is the month of May. How old is the captain? Word problems have also been satirised in The Simpsons, when a lengthy word problem ("An express train traveling 60 miles per hour leaves Santa Fe bound for Phoenix, 520 miles away. At the same time, a local train traveling 30 miles an hour carrying 40 passengers leaves Phoenix bound for Santa Fe...") trails off with a schoolboy character instead imagining that he is on the train.
|
wikipedia
|
wiki_11622_chunk_2
|
Lockheed Martin Solar and Astrophysics Laboratory
|
In October 2011 the ATC co-sponsored a workshop entitled "Space Weather Risks and Society" that brought together a broad international spectrum of experts in solar and space weather, industry, economics, regulatory bodies, and emergency management to discuss the societal impacts of space weather, how to avoid or mitigate such impacts, and how to respond to them.
An understanding of space weather and – in particular – its impacts on society are in their infancy, but there is broad agreement that societal sensitivity to high-impact, low-frequency events is obviously substantial. Equally important is the need to thoroughly investigate how space weather impacts various components of our high-tech society, and identify the mechanisms by which it does so.
|
wikipedia
|
wiki_2115_chunk_43
|
Software patents under the European Patent Convention
|
External links
For more external links, including links to lobbying organizations, see Software patent debate.
, the central legal provision on patentability under the European Patent Convention
Patents for software? European law and practice at the European Patent Office (EPO)
Old brochure edited by the EPO: "Computer-implemented Inventions and Patents, Law and Practice at the European Patent Office" (on the Internet Archive, pdf document, 400KB)
E-learning modules on the "Patentability of computer-implemented inventions at the EPO": Module 1 (15 min) and Module 2 (20 min)
"Programs for computers"
Prof. Lenz: Interpretation of Art 52 of the European Patent Convention regarding the question to what extent software is patentable (translation from German)
|
wikipedia
|
wiki_10088_chunk_6
|
Coordination geometry
|
Naming of inorganic compounds
IUPAC have introduced the polyhedral symbol as part of their IUPAC nomenclature of inorganic chemistry 2005 recommendations to describe the geometry around an atom in a compound.
IUCr have proposed a symbol which is shown as a superscript in square brackets in the chemical formula. For example, CaF2 would be Ca[8cb]F2[4t], where [8cb] means cubic coordination and [4t] means tetrahedral. The equivalent symbols in IUPAC are CU−8 and T−4 respectively.
The IUPAC symbol is applicable to complexes and molecules whereas the IUCr proposal applies to crystalline solids.
|
wikipedia
|
wiki_1465_chunk_2
|
Line drawing algorithm
|
The following is a partial list of line drawing algorithms:
naive algorithm
Digital Differential Analyzer (graphics algorithm) — Similar to the naive line-drawing algorithm, with minor variations.
Bresenham's line algorithm — optimized to use only additions (i.e. no divisions or multiplications); it also avoids floating-point computations.
Xiaolin Wu's line algorithm — can perform spatial anti-aliasing, appears "ropey" from brightness varying along the length of the line, though this effect may be greatly reduced by pre-compensating the pixel values for the target display's gamma curve, e.g. out = in ^ (1/2.4).
Gupta-Sproull algorithm
|
wikipedia
|
wiki_7938_chunk_9
|
African Institute for Mathematical Sciences
|
Visiting faculty have included David MacKay, Bernt Øksendal, David Aschman (Cape Town), Alan Beardon (Cambridge), Jordi Campos (Barcelona), Jesus Cerquides (Spanish National Research Council), Patrick Dorey (Durham), Pedro Ferreira (Oxford), Jan Govaerts (Leuven), Barry Green (Stellenbosch), Gordon Johnson (Houston), Dirk Laurie (Stellenbosch), Sanjoy Mahajan (MIT, Olin), Vincent Rivasseau (University of Paris), Bernd Schroers (Heriot-Watt), Robert de Mello Koch (Witwatersrand), Rob Beezer (University of Puget Sound), Jeff Sanders (United Nations University International Institute for Software Technology), and Tadashi Tokieda (Stanford). Each visiting lecturer teaches an intensive three-week-long module.
|
wikipedia
|
wiki_33072_chunk_11
|
Pleiades (supercomputer)
|
Some of the scientific and engineering projects run on Pleiades include:
The Kepler Mission, a space observatory launched in March 2009 to locate Earth-like planets, monitors a section of space containing more than 200,000 stars and takes high-resolution images every 30 minutes. After the operations center gathers this data, it is pipelined to Pleiades in order to calculate the size, orbit, and location of the planets surrounding these stars. As of February 2012, the Kepler mission has discovered 1,235 planets, 5 of which are approximately Earth-sized and orbit within the "habitable zone" where water can exist in all three forms (solid, liquid, gas). After setbacks following the failure of two of Kepler's four reaction wheels, responsible for keeping the spacecraft pointed in the correct direction, in 2013, the Kepler team moved the entire data pipeline to Pleiades, which continues to run light curve analyses from the existing Kepler data.
Research and development of next generation space launch vehicles is done on Pleiades using cutting-edge analysis tools and computational fluid dynamics (CFD) modeling and simulation in order to create more efficient and affordable space launch system and vehicle designs. Research has also been done on reducing noise created by the landing gear of aircraft using CFD code application to detect where the sources of noise are within the structures.
Astrophysics research into the formation of galaxies is run on Pleiades to create simulations of how our own Milky Way Galaxy was formed and what forces might have caused it to form in its signature disk-shape. Pleiades has also been the supercomputing resource for dark matter research and simulation, helping to discover gravitationally bound "clumps" of dark matter within galaxies in one of the largest simulations ever done, in terms of particle numbers.
Visualization of the Earth's ocean currents using a NASA-built data synthesis model for the Estimating the Circulation and Climate of the Ocean (ECCO) Project between MIT and the NASA Jet Propulsion Laboratory in Pasadena, California. According to NASA, the "ECCO model-data syntheses are being used to quantify the ocean's role in the global carbon cycle, to understand the recent evolution of the polar oceans, to monitor time-evolving heat, water, and chemical exchanges within and between different components of the Earth system, and for many other science applications."
|
wikipedia
|
wiki_29182_chunk_8
|
Bolometric correction
|
External links
https://github.com/casaluca/bolometric-corrections - most up to date tables of bolometric corrections across the HR diagram and interpolation routines in different photometric filters
https://web.archive.org/web/20080312151621/http://www.peripatus.gen.nz/Astronomy/SteMag.html - contains table of bolometric corrections
http://articles.adsabs.harvard.edu//full/1996ApJ...469..355F/0000360.000.html - contains detailed tables of bolometric corrections (note that these second set of tables are consistent with a bolometric magnitude of 4.73 for the Sun and also be aware that there are misprint errors for a few of the figures in the tables)
|
wikipedia
|
wiki_22471_chunk_2
|
Hirschberg's algorithm
|
The Hirschberg algorithm can be derived from the Needleman–Wunsch algorithm by observing that:
one can compute the optimal alignment score by only storing the current and previous row of the Needleman–Wunsch score matrix;
if is the optimal alignment of , and is an arbitrary partition of , there exists a partition of such that . Algorithm description denotes the i-th character of , where . denotes a substring of size , ranging from the i-th to the j-th character of . is the reversed version of .
|
wikipedia
|
wiki_10781_chunk_2
|
List of software development philosophies
|
Rules of thumb, laws, guidelines and principles
300 Rules of Thumb and Nuggets of Wisdom (excerpt from Managing the Unmanageable - Rules, Tools, and Insights for Managing Software People and Teams by Mickey W. Mantle, Ron Lichty)
Karpov's 42 Ultimate Question of Programming, Refactoring, and Everything
Big ball of mud
Brooks's law
C++ Core Guidelines (Stroustrup/Sutter) P1 - P13 Philosophy rules
Command–query separation (CQS)
Cowboy coding
Do what I mean (DWIM)
Don't repeat yourself (DRY)
Egoless programming
Fail-fast
Gall's law
If it ain't broke, don't fix it
KISS principle
Law of Demeter, also known as the principle of least knowledge
Law of conservation of complexity, also known as Tesler's Law
Lehman's laws of software evolution
Minimalism (computing)
Ninety-ninety rule
Open–closed principle
Pareto Principle
Parkinson's law
Principle of least astonishment (POLA)
Release early, release often
Robustness principle, also known as Postel's law
Rule of least power
Separation of mechanism and policy
Service loose coupling principle
Single source of truth (SSOT)
Single version of the truth (SVOT)
SOLID (object-oriented design)
There's more than one way to do it
Uniform access principle
Unix philosophy
Worse is better
You aren't gonna need it (YAGNI)
General Responsibility Assignment Software Patterns (GRASP)
|
wikipedia
|
wiki_32075_chunk_27
|
Small cancellation theory
|
A version of small cancellation theory for quotient groups of amalgamated free products and HNN extensions was developed in the paper of Sacerdote and Schupp and then in the book of Lyndon and Schupp.
Rips and Ol'shanskii developed a "stratified" version of small cancellation theory where the set of relators is filtered as an ascending union of strata (each stratum satisfying a small cancellation condition) and for a relator r from some stratum and a relator s from a higher stratum their overlap is required to be small with respect to |s| but is allowed to have a large with respect to |r|. This theory allowed Ol'shanskii to construct various "monster" groups including the Tarski monster and to give a new proof that free Burnside groups of large odd exponent are infinite.
Ol'shanskii and Delzant later on developed versions of small cancellation theory for quotients of word-hyperbolic groups.
McCammond provided a higher-dimensional version of small cancellation theory.
McCammond and Wise pushed substantially further the basic results of the standard small cancellation theory (such as Greendlinger's lemma) regarding the geometry of van Kampen diagrams over small cancellation presentations.
Gromov used a version of small cancellation theory with respect to a graph to prove the existence of a finitely presented group that "contains" (in the appropriate sense) an infinite sequence of expanders and therefore does not admit a uniform embedding into a Hilbert space.
Osin gave a version of small cancellation theory for quotiens of relatively hyperbolic groups and used it to obtain a relatively hyperbolic generalization of Thurston's hyperbolic Dehn surgery theorem.
|
wikipedia
|
wiki_34101_chunk_2
|
Genius (mathematics software)
|
Here is a sample definition of a function calculating the factorial recursively
function f(x) = (
if x <= 1 then
1
else
(f(x-1)*x)
)
GEL contains primitives for writing the product iteratively and hence we can get the following iterative
version
function f(x) = prod k=1 to x do k See also Comparison of numerical analysis software Notes Array programming languages
Free educational software
Free mathematics software
Free software programmed in C
Numerical analysis software for Linux
Numerical analysis software for MacOS
Numerical programming languages
Science software that uses GTK
Unix programming tools
|
wikipedia
|
wiki_1994_chunk_6
|
Industrial ecology
|
Industrial ecology was popularized in 1989 in a Scientific American article by Robert Frosch and Nicholas E. Gallopoulos. Frosch and Gallopoulos' vision was "why would not our industrial system behave like an ecosystem, where the wastes of a species may be resource to another species? Why would not the outputs of an industry be the inputs of another, thus reducing use of raw materials, pollution, and saving on waste treatment?" A notable example resides in a Danish industrial park in the city of Kalundborg. Here several linkages of byproducts and waste heat can be found between numerous entities such as a large power plant, an oil refinery, a pharmaceutical plant, a plasterboard factory, an enzyme manufacturer, a waste company and the city itself. Another example is the Rantasalmi EIP in Rantasalmi, Finland. While this country has had previous organically formed EIP's, the park at Rantasalmi is Finland's first planned EIP.
|
wikipedia
|
wiki_18985_chunk_31
|
Reader's Digest Select Editions
|
2018Volume 355 - #1 A Dog's Way Home - W. Bruce Cameron
Down a Dark Road - Linda Castillo
Virtually Perfect - Paige Roberts
Knife Creek - Paul DoironVolume 356 - #2 The Switch - Joseph Finder
Beach House for Rent - Mary Alice Monroe
You'll Never Know Dear - Hallie Ephron
Before You Go - Clare SwatmanVolume 357 - #3 The Wanted - Robert Crais
Rise & Shine, Benedict Stone - Phaedra Patrick
The Vanishing Season - Joanna Schaffhausen
Talk to the Paw - Melinda MetzVolume 358 - #4 The Midnight Line - Lee Child
The Address - Fiona Davis
Another Man's Ground - Claire Booth
And All the Phases of the Moon - Judy Reene SingerVolume 359 - #5 Two Kinds of Truth - Michael Connelly
The Noel Diary - Richard Paul Evans
Sulfur Springs - William Kent Krueger
Dreaming in Chocolate - Susan Bishop CrispellVolume 360 - #6 The Bad Daughter - Joy Fielding
The Recipe Box - Viola Shipman
The First Family - Michael and Daniel Palmer
Collared - David RosenfeltVolume 361 - #7 The Disappeared - C. J. Box
Dear Mrs. Bird - A. J. Pearce
The Echo Killing - Christi Daugherty
Between You and Me - Susan WiggsVolume 362 - #8 Stay Hidden - Paul Doiron
The Late Bloomers Club - Louise Miller
The Girl in the Woods - Patricia MacDonald
The Light Over London - Julia Kelly
|
wikipedia
|
wiki_12422_chunk_41
|
Scala (programming language)
|
An example of a definition of the quicksort algorithm using pattern matching is this:
def qsort(list: List[Int]): List[Int] = list match {
case Nil => Nil
case pivot :: tail =>
val (smaller, rest) = tail.partition(_ < pivot)
qsort(smaller) ::: pivot :: qsort(rest)
}
|
wikipedia
|
wiki_23074_chunk_3
|
New York Number Theory Seminar
|
Support from third parties
The seminar is awarded support by the National Science Foundation (NSF). The NSF runs a program called the Research Training Group which the aim is to encourage more individuals to pursue a career in mathematics so that there can be more in-depth scientific research, the idea revolves around a competitiveness between mathematicians to pursue great achievements. The Research Training Group involves a variety of people with different educational background ranging from undergraduate students to postdoctoral associates. The NSF funds the Research Training Group program which supports the New York Number Theory Seminar. This support is provided directly through the universities collaborating in this seminar, those three different universities working in Number Theory: City University of New York (CUNY), University of New York (UNY) and Columbia University. These universities qualify for the help from the program as they organise the New York Number Theory seminar which is a research group in Number Theory.
|
wikipedia
|
wiki_31408_chunk_3
|
Ecological forecasting
|
Population models may be used to generate short-term abundance forecasts using knowledge of population dynamics and recent environmental conditions. These models are used especially in fisheries and disease forecasting.
Species distribution models (SDMs) may be used to forecast species distribution (presence or abundance) over longer ecological time scales using information about past and projected environmental conditions across the landscape.
Correlative SDMs, also known as climate envelope models, rely on statistical correlations between existing species distributions (range boundaries) and environmental variables to outline a range (envelope) of environmental conditions within which a species can exist. New range boundaries can then be forecast using future levels of environmental factors such as temperature, rainfall, and salinity from climate model projections. These methods are good for examining large numbers of species, but are likely not a good means of predicting effects at fine scales.
Mechanistic SDMs use information about a species' physiological tolerances and constraints, as well as models of organismal body temperature and other biophysical properties, to define the range of environmental conditions within which a species can exist. These tolerances are mapped onto current and projected environmental conditions in the landscape to outline current and forecasted ranges for the species. In contrast to "climate envelope" approaches, mechanistic SDMs model the fundamental niche directly, and are therefore much more exact. However, the approach requires more information is also usually more time-consuming.
Other types of models may be used to forecast (or hindcast) biodiversity over evolutionary time scales. Palaeobiology modeling uses fossil and phylogenetic evidence of biodiversity in the past to project the trajectory of biodiversity in the future. Simple plots can be constructed and then adjusted based on the varying quality of the fossil record.
|
wikipedia
|
wiki_30906_chunk_25
|
Official statistics
|
Users can gather information making use of the services of the National Statistical Offices. They can easily find it on the agency's website.
The development of computing technologies and the Internet has enabled users - businesses, educational institutions and households among others- to have access to statistical information. The Internet has become an important tool for statistical producers to disseminate their data and information. People are able to access information online. The supply of information from statistical agencies has increased. Today the advanced agencies provide the information on their websites in an understandable way, often categorized for different groups of users.
Several glossaries have been set up by different organizations or statistical offices to provide more information and definitions in the field of statistics and consequently official statistics.
|
wikipedia
|
wiki_246_chunk_53
|
Geotechnical engineering
|
The observational method may be described as follows:
Exploration sufficient to establish the general nature, pattern and properties of the deposits (not necessarily in detail)
Assessment of the most probable conditions, and the most unfavorable conceivable deviations from these conditions. Geology plays a major role.
Creating the design, based on a working hypothesis of behavior anticipated under the most-probable conditions
Selection of quantities to be observed as construction proceeds, and calculation of their anticipated values based on the working hypothesis
Calculation of values of the same quantities under the most unfavorable conditions compatible with the available data concerning subsurface conditions
Selection (in advance) of a course of action or design modification for every foreseeable significant deviation of the observational findings from those predicted based on the working hypothesis
Measurement of quantities to be observed and evaluation of actual conditions
Design modification in accordance with actual conditions
|
wikipedia
|
wiki_5931_chunk_4
|
Country code top-level domain
|
Latin Character ccTLDs
{|
|+
|- style="vertical-align:top;"
!style="text-align:right;"| Name
| DNS name of the two-letter country-code top-level domain. They follow ISO 3166-1 alpha-2, with some exceptions such as ".ac" for Ascension Island, ".eu" for the European Union, or ".uk" for United Kingdom of Great Britain and Northern Ireland instead of ".gb". ISO codes , , , , , and are not used for country code top-level domains.
|- style="vertical-align:top;"
!style="text-align:right;"| Entity
| Country, dependency, or region
|- style="vertical-align:top;"
!style="text-align:right;"| Explanation
| Explanation of the code when it is not self-evident from the English name of the country. These are usually domains that arise from native name of the country (e.g. .de for Deutschland, German language name for Germany).
|- style="vertical-align:top;"
!style="text-align:right;"| Notes
| General remarks
|- style="vertical-align:top;"
!style="text-align:right;"| Registry
| Domain name registry operator, sometimes called a network information center (NIC)
|- style="vertical-align:top;"
!style="text-align:right;"| IDN
| Support for internationalized domain names (IDN)
|- style="vertical-align:top;"
!style="text-align:right;"| DNSSEC
| Presence of DS records for Domain Name System Security Extensions
|- style="vertical-align:top;"
!style="text-align:right;"| SLD
| Allows second-level domain registration (restrictions may apply)
|- style="vertical-align:top;"
!style="text-align:right;"| IPv6
| Registry fully supports IPv6 access
|}
|
wikipedia
|
wiki_37289_chunk_3
|
Activity selection problem
|
Optimal solution
The activity selection problem is notable in that using a greedy algorithm to find a solution will always result in an optimal solution. A pseudocode sketch of the iterative version of the algorithm and a proof of the optimality of its result are included below. Algorithm Greedy-Iterative-Activity-Selector(A, s, f): Sort A by finish times stored in f
S = {A[1]}
k = 1
n = A.length
for i = 2 to n:
if s[i] ≥ f[k]:
S = S U {A[i]}
k = i
return S Explanation
|
wikipedia
|
wiki_1198_chunk_37
|
Logistic function
|
L.J. Linacre, Why logistic ogive and not autocatalytic curve?, accessed 2009-09-12.
https://web.archive.org/web/20060914155939/http://luna.cas.usf.edu/~mbrannic/files/regression/Logistic.html
Online experiments with JSXGraph
Esses are everywhere.
Seeing the s-curve is everything.
Restricted Logarithmic Growth with Injection Special functions
Differential equations
Population
Population ecology
Logistic regression
Growth curves
|
wikipedia
|
wiki_4687_chunk_7
|
Answer Me!
|
References External links
Short survey with images from The First Three
Review of The First Three
Amazon.com page for The First Three
"A Little 'zine Called ANSWER Me! Demands a Verdict by Bob Armstrong, an article covering the obscenity trial in Bellingham, from X Magazine
"Zines, etc." by Carrie McLaren, a review of ANSWER Me! in Stay Free! (#10). Letter to the editor from Jim Goad in response.
|
wikipedia
|
wiki_39141_chunk_1
|
PROFIenergy
|
Background
The idea for a standardized energy efficiency profile came from Juergen Kuebler an employee of Mercedes-Benz and was motivated by the AIDA group of automotive manufacturers in Germany. AIDA companies comprise Audi, BMW, Mercedes-Benz, Porsche and VW. A PI Working Group set up to develop the new profile is about to publish the specification. The PI Working Group comprises ABB, AIT, Bosch, Danfoss, Hilscher, ifak, Lenze, Murr Elektronik, Phoenix Contact, SEW Eurodrive, SCA Schucker, Rexroth, Siemens, KUKA and WZL.
|
wikipedia
|
wiki_3497_chunk_5
|
Solid modeling
|
The combinatorial characterization of a set X ⊂ ℝ3 as a solid involves representing X as an orientable cell complex so that the cells provide finite spatial addresses for points in an otherwise innumerable continuum. The class of semi-analytic bounded subsets of Euclidean space is closed under Boolean operations (standard and regularized) and exhibits the additional property that every semi-analytic set can be stratified into a collection of disjoint cells of dimensions 0,1,2,3. A triangulation of a semi-analytic set into a collection of points, line segments, triangular faces, and tetrahedral elements is an example of a stratification that is commonly used. The combinatorial model of solidity is then summarized by saying that in addition to being semi-analytic bounded subsets, solids are three-dimensional topological polyhedra, specifically three-dimensional orientable manifolds with boundary. In particular this implies the Euler characteristic of the combinatorial boundary of the polyhedron is 2. The combinatorial manifold model of solidity also guarantees the boundary of a solid separates space into exactly two components as a consequence of the Jordan-Brouwer theorem, thus eliminating sets with non-manifold neighborhoods that are deemed impossible to manufacture.
|
wikipedia
|
wiki_984_chunk_27
|
Multiplication algorithm
|
For systems that need to multiply numbers in the range of several thousand digits, such as computer algebra systems and bignum libraries, long multiplication is too slow. These systems may employ Karatsuba multiplication, which was discovered in 1960 (published in 1962). The heart of Karatsuba's method lies in the observation that two-digit multiplication can be done with only three rather than the four multiplications classically required. This is an example of what is now called a divide-and-conquer algorithm. Suppose we want to multiply two 2-digit base-m numbers: x1 m + x2 and y1 m + y2:
|
wikipedia
|
wiki_19641_chunk_3
|
Laboratório Nacional de Engenharia Civil
|
Those activities are as follows:
Planned research of a strategic nature, developed within research lines considered as priority due to their relevance for the country.
Studies and expert reports under contract: advanced expert advisory services to public and private bodies, both national and foreign.
Promotion of quality in construction: preparation of specifications, norms and regulations, approval and classification of new building materials and components, observation of the performance of works, certification of building projects by LNEC "Quality Mark" and normal tests.
Dissemination of knowledge, as well as technical and scientific training: preparation of scientific and technical documents, organisation of technical courses or other training actions, organisation of scientific and technical meetings, both national and foreign, complemented by the publishing activity and by the Library.
Co-operation with other bodies: activities of co-operation with various Portuguese and foreign bodies, namely with associations of a scientific and technical character, universities, laboratories and other institutions.
|
wikipedia
|
wiki_28990_chunk_8
|
Network Centric Product Support
|
Flight Global Article, Farnborough Air Show, July 2002: Server is Like Having an Onboard Engineer
Aviation Week Article, Farnborough Air Show, July 2004: Onboard Internet Microserver
Aviation Today Article, Nov 2004: Right Hemisphere Pioneers "Just in Time" Training
Desktop Engineering Article, April 2005: Interactive 3D Visualization Heats Up
BNET Article, Oct 2006, Data Transmission Units on Falcon 2000EX and Falcon 7X Business Jets
Network Centric Industry Association (NCOIC)
AutoID Labs, Cambridge University June 2005: Networked RFID Research at Pratt & Whitney
RFID Aerospace Alignment Minutes, Nov 2006
Consensus Software Awards, Right Hemisphere, 2006: Product Graphics Management
NCOIC Report: Comparison of SESAR & NEXTGEN Concept of Operations
FAA CRADA Award Oct 2008: Network Centric Airborne Web Server Test Capability on an FAA Technical Center Aircraft for use in NextGen
Report to FAA May 2010: SWIMLINK Secure Airborne HTTP Data Communications
Aviation International News Article, May 2014: Pratt & Whitney Canada's FAST Systems Earns STC
Related US Patents, filings/issued 2001-2014
Related European Patents, filings/issued 2001-2014
|
wikipedia
|
wiki_3779_chunk_2
|
Berlekamp–Massey algorithm
|
Description of algorithm
The Berlekamp–Massey algorithm is an alternative to the Reed–Solomon Peterson decoder for solving the set of linear equations. It can be summarized as finding the coefficients Λj of a polynomial Λ(x) so that for all positions i in an input stream S: In the code examples below, C(x) is a potential instance of Λ(x). The error locator polynomial C(x) for L errors is defined as: or reversed: The goal of the algorithm is to determine the minimal degree L and C(x) which results in all syndromes being equal to 0:
|
wikipedia
|
wiki_10009_chunk_11
|
Bitap algorithm
|
#include <stdlib.h>
#include <string.h>
#include <limits.h>
const char *bitap_fuzzy_bitwise_search(const char *text, const char *pattern, int k)
{
const char *result = NULL;
int m = strlen(pattern);
unsigned long *R;
unsigned long pattern_mask[CHAR_MAX+1];
int i, d;
if (pattern[0] == '\0') return text;
if (m > 31) return "The pattern is too long!";
/* Initialize the bit array R */
R = malloc((k+1) * sizeof *R);
for (i=0; i <= k; ++i)
R[i] = ~1;
/* Initialize the pattern bitmasks */
for (i=0; i <= CHAR_MAX; ++i)
pattern_mask[i] = ~0;
for (i=0; i < m; ++i)
pattern_mask[pattern[i]] &= ~(1UL << i);
for (i=0; text[i] != '\0'; ++i) {
/* Update the bit arrays */
unsigned long old_Rd1 = R[0];
R[0] |= pattern_mask[text[i]];
R[0] <<= 1;
for (d=1; d <= k; ++d) {
unsigned long tmp = R[d];
/* Substitution is all we care about */
R[d] = (old_Rd1 & (R[d] | pattern_mask[text[i]])) << 1;
old_Rd1 = tmp;
}
if (0 == (R[k] & (1UL << m))) {
result = (text+i - m) + 1;
break;
}
}
free(R);
return result;
}
|
wikipedia
|
wiki_2247_chunk_4
|
Experimental mathematics
|
Objectives and uses
The objectives of experimental mathematics are "to generate understanding and insight; to generate and confirm or confront conjectures; and generally to make mathematics more tangible, lively and fun for both the professional researcher and the novice". The uses of experimental mathematics have been defined as follows: Gaining insight and intuition.
Discovering new patterns and relationships.
Using graphical displays to suggest underlying mathematical principles.
Testing and especially falsifying conjectures.
Exploring a possible result to see if it is worth formal proof.
Suggesting approaches for formal proof.
Replacing lengthy hand derivations with computer-based derivations.
Confirming analytically derived results.
|
wikipedia
|
wiki_5528_chunk_43
|
Hyperpolarization (physics)
|
83Kr stable isotope has spin I=9/2 and has larger Van der Waals size 2.02A0 . It has quadrupolar effect can be diffuse to nearby environment shortly & distinctively (polar to nonpolar media in vivo system).
Chemical composition of materials can influence the longitudinal relaxation of hyperpolarized 83Kr.
The relaxation can distinguish among the hydrophobic and hydrophilic substrate. Although 3He and 129Xe have spin half but they are not quadrupolar active.
However, the 21Ne (I=3/2), 83Kr(I=9/2) and 131Xe (I=3/2) have Quadrupolar moment.34 Quadrupolar interactions make these isotopes having spin relaxation.
Due to this spin relaxation and evolution, these isotopes can be used as contrasting agents to say about the probe can determine the structural feature and chemical compositions of the surfaces for a permeable media.
SEOP can calculate the relaxation of spin T1 by using the equation nonlinear least-squares fitting for 83Kr signal as a function of time as well as experimental number of media flip angle (≈12°) for NMR experimenting radio frequency pulses.
Hyperpolarized 83Kr is being separated from 87Rb gases after spin exchanging in the optical pumping process and then used in variety of in vivo system to get MRI signal. This is the first isotope showed lots of applicability for MRI technique even though has the spin is 9½.
During experiment of canine lung tissue, the using magnet was 9.4 T, media was porous and similar porosity to alveolar dimensions which is disseminated at atmospheric pressure. Spin lattice relaxation was reasonably long enough so it is applicable in vivo system although the oxygen level could be 20%.
As 83Kr contrasting agent is promising to develop pristine in vivo MRI methodology to identify the lung diseases epically those effect have been caused in parenchyma surface due to the surfactant concentration.
Boyed the boundary this particular contrasting agent can work to figure out the size of pour of porous media in materials science.
In addition, this technique can take us about to prepare the surface coating, spatial fluctuations of surfaces. Eventually, never ending the good sign of this contrasting agent like natural abundance (11.5% of 83Kr) makes it easy to get with reasonable price $5/L.
|
wikipedia
|
wiki_4282_chunk_4
|
Knuth–Bendix completion algorithm
|
Given a set E of equations between terms, the following inference rules can be used to transform it into an equivalent convergent term rewrite system (if possible): Here: sect.8.1, p.293
They are based on a user-given reduction ordering (>) on the set of all terms; it is lifted to a well-founded ordering (▻) on the set of rewrite rules by defining if
in the encompassment ordering, or
and are literally similar and . Example
|
wikipedia
|
wiki_2577_chunk_36
|
Quantization (signal processing)
|
Finding an optimal solution to the above problem results in a quantizer sometimes called a MMSQE (minimum mean-square quantization error) solution, and the resulting PDF-optimized (non-uniform) quantizer is referred to as a Lloyd–Max quantizer, named after two people who independently developed iterative methods to solve the two sets of simultaneous equations resulting from and , as follows:
,
which places each threshold at the midpoint between each pair of reconstruction values, and which places each reconstruction value at the centroid (conditional expected value) of its associated classification interval.
|
wikipedia
|
wiki_1696_chunk_20
|
Relevance logic
|
Algebraic models
Some relevance logics can be given algebraic models, such as the logic R. The algebraic structures for R are de Morgan monoids, which are sextuples where
is a distributive lattice with a unary operation, obeying the laws and if then ;
, the binary operation is commutative () and associative (), and , i.e. is an Abelian monoid with identity ;
the monoid is lattice-ordered and satisfies ;
; and
if , then .
The operation interpreting the conditional of R is defined as .
A de Morgan monoid is a residuated lattice, obeying the following residuation condition.
|
wikipedia
|
wiki_22062_chunk_1
|
Vegetable oils as alternative energy
|
Concerns have been expressed about growing crops for fuel use rather than food and the environmental impacts of large-scale agriculture and land clearing required to expand the production of vegetable oil for fuel use. These effects/impacts would need to be specifically researched and evaluated, economically and ecologically, and weighed in balance with the proposed benefits of vegetable oil fuel in relation to the use of other fuel sources.
|
wikipedia
|
wiki_12036_chunk_9
|
Software assurance
|
Establish a common framework of software properties that can be used to represent any/all classes of software so software suppliers and acquirers can represent their claims and arguments(respectively), along with the corresponding evidence, employing automated tools (to address scale)
Verify that products have sufficiently satisfied these characteristics in advance of product acquisition, so that system engineers/integrators can use these products to build (compose) larger assured systems with them
Enable industry to improve visibility into the current status of software assurance during development of its software
Enable industry to develop automated tools that support the common framework.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.