id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_33074_chunk_4
|
International Requirements Engineering Board
|
CPRE Foundation Level
The IREB Syllabus for the CPRE Foundation Level of the IREB Certified Professional for Requirements Engineering
sets the following priorities:
The focus is on acquiring the necessary practical knowledge and learning the basic concepts in Requirements Engineering, with reinforcement through practical exercises. There is no intention of presenting the complete theoretical framework or current and future research activities.
The Foundation Level seeks to convey fundamentals that are equally valid for any domain, e.g. for embedded systems, security systems, classic information systems, etc. In addition, the training can cover the suitability of the presented approaches for the various domains based on their special characteristics. However, it is not a goal to present specific Requirements Engineering for a given domain.
The syllabus is not based on a specific procedural model and an associated process model that stipulate the planning, control and order of carrying out the learned concepts in actual practice. No specific Requirements Engineering or even software engineering process is emphasized.
The syllabus defines necessary knowledge of a Requirements Engineer. However, it does not elaborate on the exact interfaces between this field and other software engineering disciplines and processes. Nor is any attempt made to define other roles occurring in IT projects.
The syllabus does not attempt to convey all methods and techniques that are used in Requirements Engineering. Rather, the course represents today’s most commonly used set of methods and techniques. Above all, the course intends to inspire attendees to actively gain for more experience in Requirements Engineering on their own authority
|
wikipedia
|
wiki_164_chunk_4
|
Descriptive statistics
|
The use of descriptive and summary statistics has an extensive history and, indeed, the simple tabulation of populations and of economic data was the first way the topic of statistics appeared. More recently, a collection of summarisation techniques has been formulated under the heading of exploratory data analysis: an example of such a technique is the box plot. In the business world, descriptive statistics provides a useful summary of many types of data. For example, investors and brokers may use a historical account of return behaviour by performing empirical and analytical analyses on their investments in order to make better investing decisions in the future.
|
wikipedia
|
wiki_19012_chunk_27
|
Impact of nanotechnology
|
Regulatory bodies such as the United States Environmental Protection Agency and the Food and Drug Administration in the U.S. or the Health & Consumer Protection Directorate of the European Commission have started dealing with the potential risks posed by nanoparticles. So far, neither engineered nanoparticles nor the products and materials that contain them are subject to any special regulation regarding production, handling or labelling. The Material Safety Data Sheet that must be issued for some materials often does not differentiate between bulk and nanoscale size of the material in question and even when it does these MSDS are advisory only. The new advances and rapid growth within the field of nanotechnology have large implications, which in turn will lead to regulations, on the traditional food and agriculture sectors of the world, in particular the invention of smart and active packaging, nano sensors, nano pesticides, and nano fertilizers.
|
wikipedia
|
wiki_36883_chunk_1
|
Laboratory for Computational Cultural Dynamics
|
Motivation
The overall goal of the LCCD is to develop the computational infrastructure needed to help others when decision making in a cultural situation is required.
The technologies developed at the lab see potential application in:
understanding terrorist organizations and predicting terrorist behavior;
understanding other cultures in order to facilitate international collaboration;
preventing crime and reducing conflict;
enhancing the performance of governmental and non-governmental organizations;
improving the quality of life among groups in diverse multi-ethnic societies;
assessing the effectiveness of aid programs in a cultural context;
aiding governmental missions that involve contact with diverse cultural groups;
recovery from conflicts and disasters.
|
wikipedia
|
wiki_155_chunk_6
|
Clay Mathematics Institute
|
In recognition of major breakthroughs in mathematical research, the institute has an annual prize — the Clay Research Award. Its recipients to date are Ian Agol, Manindra Agrawal, Yves Benoist, Manjul Bhargava, Tristan Buckmaster, Danny Calegari, Alain Connes, Nils Dencker, Alex Eskin, David Gabai, Ben Green, Mark Gross, Larry Guth, Christopher Hacon, Richard S. Hamilton, Michael Harris, Philip Isett, Jeremy Kahn, Nets Katz, Laurent Lafforgue, Gérard Laumon, Aleksandr Logunov, Eugenia Malinnikova, Vladimir Markovic, James McKernan, Jason Miller, Maryam Mirzakhani, Ngô Bảo Châu, Rahul Pandharipande, Jonathan Pila, Jean-François Quint, Peter Scholze, Oded Schramm, Scott Sheffield, Bernd Siebert, Stanislav Smirnov, Terence Tao, Clifford Taubes, Richard Taylor, Maryna Viazovska, Vlad Vicol, Claire Voisin, Jean-Loup Waldspurger, Andrew Wiles, Geordie Williamson, Edward Witten and Wei Zhang.
|
wikipedia
|
wiki_591_chunk_28
|
Temporomandibular joint dysfunction
|
Possible associations
TMD has been suggested to be associated with other conditions or factors, with varying degrees evidence and some more commonly than others. E.g. It has been shown that 75% of people with TMD could also be diagnosed with fibromyalgia, since they met the diagnostic criteria, and that conversely, 18% of people with fibromyalgia met diagnostic criteria for TMD. A possible link between many of these chronic pain conditions has been hypothesized to be due to shared pathophysiological mechanisms, and they have been collectively termed "central sensitivity syndromes", although other apparent associations cannot be explained in this manner. Recently a plethora of research has substantiated a causal relationship between TMD and Obstructive Sleep Apnea (OSA). Severe TMD restricts oral airway opening, and can result in a retrognathic posture that results in glossal blockage of the oropharynx as the tongue relaxes in sleep. This mechanism is exacerbated by alcohol consumption, as well as other chemicals that result in reduced myotonic status of the oropharynx.
|
wikipedia
|
wiki_24985_chunk_3
|
Computer Task Group
|
Diversified Systems Inc. (1983)
Automated Business Systems, Inc. (1983)
Berger, Vernay & Co. (1985)
Delta Force Inc. (1985)
Documentation Resources, Inc. (1986)
Shubrooks International, Ltd. (1986)
Applied Management Systems, Inc. (1988)
Connolly Data Systems Inc. (1990)
Telecommunications Management Consultants (1990)
Rendeck International N.V. (1990)
Elumen Solutions Inc. (1999)
etrinity N.V. (2013)
Soft Company (2018)
Tech-IT (2019) Divestitures Profimatics Inc. (1994)
|
wikipedia
|
wiki_862_chunk_56
|
Philosophiæ Naturalis Principia Mathematica
|
Cambridge University Library has Newton's own copy of the first edition, with handwritten notes for the second edition.
The Earl Gregg Swem Library at the College of William & Mary has a first edition copy of the Principia. Throughout are Latin annotations written by Thomas S. Savage. These handwritten notes are currently being researched at The College.
The Frederick E. Brasch Collection of Newton and Newtoniana in Stanford University also has a first edition of the Principia.
A first edition forms part of the Crawford Collection, housed at the Royal Observatory, Edinburgh.
The Uppsala University Library owns a first edition copy, which was stolen in the 1960s and returned to the library in 2009.
The Folger Shakespeare Library in Washington, D.C. owns a first edition, as well as a 1713 second edition.
The Huntington Library in San Marino, California owns Isaac Newton's personal copy, with annotations in Newton's own hand.
The Martin Bodmer Library keeps a copy of the original edition that was owned by Leibniz. It contains handwritten notes by Leibniz, in particular concerning the controversy of who first formulated calculus (although he published it later, Newton argued that he developed it earlier).
The University of St Andrews Library holds both variants of the first edition, as well as copies of the 1713 and 1726 editions.
Fisher Library in the University of Sydney has a first-edition copy, annotated by a mathematician of uncertain identity and corresponding notes from Newton himself.
The Linda Hall Library holds the first edition, as well as a copy of the 1713 and 1726 editions.
The Teleki-Bolyai Library of Târgu-Mureș holds a 2-line imprint first edition.
One book is also located at Vasaskolan, Gävle, in Sweden.
Dalhousie University has a copy as part of the William I. Morse collection.
McGill University in Montreal has the copy once owned by Sir William Osler.
The University of Toronto has a copy in the Thomas Fisher Rare Book Collection.
|
wikipedia
|
wiki_22679_chunk_6
|
The Zoological Record
|
Online availability
The Zoological Record is one of the few extremely important historical publications in the field of zoological nomenclature that are not available at open access to the public in a digitised image format, for example at the Biodiversity Heritage Library or the Internet Archive. In the United States there are however no legal restrictions to digitisation for the volumes that appeared prior to 1923, since their copyrights have expired and they are in the public domain. References External links
Official website Clarivate
Biodiversity databases
Publications established in 1865
Bibliographic databases and indexes
|
wikipedia
|
wiki_26525_chunk_6
|
Materials science in science fiction
|
|Duralumin is a rather old aluminum alloy with unexceptional properties by modern standards. Furthermore, other metals such as titanium are much stronger and about the same weight.
|-
|Einsteinium
|The Tashkent Crisis|In William Craig's Cold War novel, einsteinium-119 is used to build a nuclear warhead into the casing of a Colt .45 pistol.
|This element possesses isotopes with very low critical masses. Values as low as 32 grams have been reported in the literature. However, an isotope of Einsteinium with an atomic weight of 119 is unrealistic - real-life mass numbers range from 245 to 257.
|-
|Carbon, as Fullerenes and Carbon nanotubes
|The Fountains of Paradise, many others
|See fullerenes in popular culture.
|In real life, fullerenes and nanotubes have rather exceptional mechanical, electrical, and thermal properties. See, for example Potential applications of carbon nanotubes.
|-
|Hard water
|The Flash comics
|Electrically charged hard water was the item that gave the first Flash (Jay Garrick) his superspeed. However, critics and even the authors realized this was unlikely, and his origin was retconned into heavy water.
|Heavy water, or water made with deuterium, has some high tech uses, including use a moderator in nuclear reactors. Hard water, on the other hand, is just water with many dissolved minerals.
|-
|Helium-3
|films Moon and Iron Sky, video game Anno 2205, novels Luna: New Moon, Morning Star, Red Rising, and others.
|Several science fiction works have featured helium-3 extraction on the Moon, including Moon, Iron Sky, Anno 2205, and Luna: New Moon. Morning Star features helium-3 mining on Phobos (a moon of Mars), while the novel Red Rising features helium-3 extraction from Mars itself. The helium-3 is valuable since it can be used to power fusion
|Materials on the Moon's surface contain helium-3 at concentrations on the order of between 1.4 and 15 ppb in sunlit areas, and may contain concentrations as much as 50 ppb in permanently shadowed regions. A number of people, starting with Gerald Kulcinski in 1986, have proposed to mine lunar regolith.
|-
|Hydrogen-4
|The Mouse That Roared|This isotope of hydrogen is referred to as Quadium and powers a thermonuclear doomsday device called the Q-bomb, which is captured by the Duchy of Grand Fenwick.
|Hydrogen-4 really exists, but it is very unstable with a lifetime of about 2 x 10−22 seconds. The other more stable isotopes of hydrogen, deuterium and tritium, are really used in hydrogen bombs.
|-
|Lead
|DC Universe
|Superman's X-Ray vision is unable to penetrate lead. Additionally, kryptonite radiation can be blocked by this material.
|
wikipedia
|
wiki_37811_chunk_7
|
Go (programming language)
|
Design
Go is influenced by C (especially the Plan 9 dialect ), but with an emphasis on greater simplicity and safety. The language consists of:
A syntax and environment adopting patterns more common in dynamic languages:
Optional concise variable declaration and initialization through type inference (x := 0 instead of int x = 0; or var x = 0;).
Fast compilation.
Remote package management (go get) and online package documentation.
Distinctive approaches to particular problems:
Built-in concurrency primitives: light-weight processes (goroutines), channels, and the select statement.
An interface system in place of virtual inheritance, and type embedding instead of non-virtual inheritance.
A toolchain that, by default, produces statically linked native binaries without external dependencies.
A desire to keep the language specification simple enough to hold in a programmer's head, in part by omitting features that are common in similar languages.
|
wikipedia
|
wiki_6057_chunk_9
|
List of 7400-series integrated circuits
|
Normal inputs / push–pull outputs
{| class="wikitable"
|-
! Configuration !! Buffer !! Inverter
|-
| Hex 1-input || 74x34 || 74x04
|}
{| class="wikitable"
|-
! Configuration !! AND !! NAND !! OR !! NOR !! XOR !! XNOR
|-
| Quad 2-input || 74x08 || 74x00 || 74x32 || 74x02 || 74x86 || 74x7266
|-
| Triple 3-Input || 74x11 || 74x10 || 74x4075 || 74x27 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|-
| Dual 4-input || 74x21 || 74x20 || 74x4072 || 74x29 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|-
| Single 8-input || style="background: grey; text-align: center;" | n/a || 74x30 || 74x4078 || 74x4078 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|}
|
wikipedia
|
wiki_16545_chunk_1
|
Cell software development
|
Adapting VMX for SPU Differences between VMX and SPU
The VMX (Vector Multimedia Extensions) technology is conceptually similar to the vector model provided by the SPU processors, but there are many significant differences. The VMX Java mode conforms to the Java Language Specification 1 subset of the default IEEE Standard, extended to include IEEE and C9X compliance where the Java standard falls silent. In a typical implementation, non-Java mode converts denormal values to zero but Java mode traps into an emulator when the processor encounters such a value.
|
wikipedia
|
wiki_4902_chunk_2
|
Moufang loop
|
Examples
Any group is an associative loop and therefore a Moufang loop.
The nonzero octonions form a nonassociative Moufang loop under octonion multiplication.
The subset of unit norm octonions (forming a 7-sphere in O) is closed under multiplication and therefore forms a Moufang loop.
The subset of unit norm integral octonions is a finite Moufang loop of order 240.
The basis octonions and their additive inverses form a finite Moufang loop of order 16.
The set of invertible split-octonions forms a nonassociative Moufang loop, as does the set of unit norm split-octonions. More generally, the set of invertible elements in any octonion algebra over a field F forms a Moufang loop, as does the subset of unit norm elements.
The set of all invertible elements in an alternative ring R forms a Moufang loop called the loop of units in R.
For any field F let M(F) denote the Moufang loop of unit norm elements in the (unique) split-octonion algebra over F. Let Z denote the center of M(F). If the characteristic of F is 2 then Z = {e}, otherwise Z = {±e}. The Paige loop over F is the loop M*(F) = M(F)/Z. Paige loops are nonassociative simple Moufang loops. All finite nonassociative simple Moufang loops are Paige loops over finite fields. The smallest Paige loop M*(2) has order 120.
A large class of nonassociative Moufang loops can be constructed as follows. Let G be an arbitrary group. Define a new element u not in G and let M(G,2) = G ∪ (G u). The product in M(G,2) is given by the usual product of elements in G together with
|
wikipedia
|
wiki_414_chunk_91
|
Nuclear power
|
Speed of transition and investment needed
Analysis in 2015 by professor Barry W. Brook and colleagues found that nuclear energy could displace or remove fossil fuels from the electric grid completely within 10 years. This finding was based on the historically modest and proven rate at which nuclear energy was added in France and Sweden during their building programs in the 1980s. In a similar analysis, Brook had earlier determined that 50% of all global energy, including transportation synthetic fuels etc., could be generated within approximately 30 years if the global nuclear fission build rate was identical to historical proven installation rates calculated in GW per year per unit of global GDP (GW/year/$).
This is in contrast to the conceptual studies for 100% renewable energy systems, which would require an orders of magnitude more costly global investment per year, which has no historical precedent. These renewable scenarios would also need far greater land devoted to onshore wind and onshore solar projects. Brook notes that the "principal limitations on nuclear fission are not technical, economic or fuel-related, but are instead linked to complex issues of societal acceptance, fiscal and political inertia, and inadequate critical evaluation of the real-world constraints facing [the other] low-carbon alternatives." Contrary to his views, the construction and operating costs of nuclear are very large when compared to alternatives of sustainable energy sources whose costs are decreasing and which are the fastest-growing source of electricity generation with there being ongoing research and development into options to move beyond current constraints in a highly decarbonized energy system without reliance on new nuclear. The costs and the increasing competition from sustainable energy technologies may be main drivers of an apparent decline of nuclear. Some have argued that recent publicity of nuclear energy – including for novel reactor designs like "small modular reactors" – is driven in part or mostly by a "declining industry's desperation for capital and its related lobby depicting it as a solution for climate change".
|
wikipedia
|
wiki_1270_chunk_19
|
National Science Foundation Network
|
In addition to the five NSF supercomputer centers, NSFNET provided connectivity to eleven regional networks and through these networks to many smaller regional and campus networks. The NSFNET regional networks were:
BARRNet, the Bay Area Regional Research Network in Palo Alto, California;
CERFnet, California Education and Research Federation Network in San Diego, California, serving California and Nevada;
CICNet, the Committee on Institutional Cooperation Network via the Merit Network in Ann Arbor, Michigan and later as part of the T-3 upgrade via Argonne National Laboratory outside of Chicago, serving the Big Ten Universities and the University of Chicago in Illinois, Indiana, Iowa, Michigan, Minnesota, Ohio, and Wisconsin;
JVNCNet, the John von Neumann National Supercomputer Center Network in Princeton, New Jersey, connected the universities that made up the Consortium for Scientific Computing as well as a few New Jersey Universities. There were 1.5Mbit/s (T-1) links to Princeton University, Rutgers University, Massachusetts Institute of Technology, Harvard University, Brown University, University of Pennsylvania, University of Pittsburgh, Yale University, The Institute for Advanced Study, Pennsylvania State University, Rochester Institute of Technology, New York University, The University of Colorado and The University of Arizona.
Merit/MichNet in Ann Arbor, Michigan serving Michigan, formed in 1966, still in operation as of 2013;
MIDnet in Lincoln, Nebraska the first NSFNET regional backbone to become operational in the Summer of 1986, serving Arkansas, Iowa, Kansas, Missouri, Nebraska, Oklahoma, and South Dakota, later acquired by Global Internet, which was acquired by Verio, Inc.;
NEARNET, the New England Academic and Research Network in Cambridge, Massachusetts, added as part of the upgrade to T-3, serving Connecticut, Maine, Massachusetts, New Hampshire, Rhode Island, and Vermont, established in late 1988, operated by BBN under contract to MIT, BBN assumed responsibility for NEARNET on 1 July 1993;
NorthWestNet in Seattle, Washington, serving Alaska, Idaho, Montana, North Dakota, Oregon, and Washington, founded in 1987;
NYSERNet, New York State Education and Research Network in Ithaca, New York;
SESQUINET, the Sesquicentennial Network in Houston, Texas, founded during the 150th anniversary of the State of Texas;
SURAnet, the Southeastern Universities Research Association network in College Park, Maryland and later as part of the T-3 upgrade in Atlanta, Georgia serving Alabama, Florida, Georgia, Kentucky, Louisiana, Maryland, Mississippi, North Carolina, South Carolina, Tennessee, Virginia, and West Virginia, sold to BBN in 1994; and
Westnet in Salt Lake City, Utah and Boulder, Colorado, serving Arizona, Colorado, New Mexico, Utah, and Wyoming.
|
wikipedia
|
wiki_23109_chunk_9
|
List of Philippine mythological figures
|
Chief Spirits: may take the form of human beings, former mortals who mix with the living, and reside in bathing places
Anlabban: looks after the general welfare of the people; special protector of hunters
Bago: the spirit of the forest
Sirinan: the spirit of the river
Landusan: responsible for some cases of extreme poverty; like all evil spirits, Landusan can also be countered by the rare tagarut herb-amulet
Helpful Harvest Spirits
Abad
Aglalannawan
Anat
Binusilan
Dawiliyan
Dekat
Dumingiw
Imbanon
Gimbanonan
Ginalinan
Sibo
llanit: a group of sky dwellers
Spirits Who Harm the Harvest
Alupundan: causes the reapers’ toes to get sore all over and swell
Arurin: deity who sees to it that the harvest is bad if farmers fail to offer to her a share of the harvest
Dagdagamiyan: a female spirit who causes sickness in children for playing in places where the harvest is being done
Darupaypay: devours the palay stored in the hut before it is transferred to the granary
Ginuudan: comes to measure the containers of palay, and causes it to dwindle
Sildado: resembles a horse, and kills children who play noisily outside the house
Inargay: kills people during harvest time; the inapugan ritual of offered to the deity to appease him not to kill anyone
Alipugpug: spirit of the little whirlwind from the burned field, who portends a good harvest
Pilay: spirit of the rice, who resides on the paga, a shelf above the hearth; the pisi ritual is offered to the deity to ensure that children won't get hungry
Unnamed Man: held the world on his hands; produced a spark using a flint and a steel, causing Sal-it (lightning); in contrast, Addug (thunder) is the water roaring in the sky
|
wikipedia
|
wiki_9392_chunk_40
|
Galactic Civilizations II: Dread Lords
|
Two new civilizations: a genocidal Drengin offshoot called the Korath and a civilization called the Krynn
A new campaign in which the player leads the Drengin Empire
The ability to create custom opponents
An "environment" statistic to planets, which will determine which civilization can innately colonize or what technologies will be necessary for other civilizations to colonize different planets
An enhanced role for espionage, special "Agents" being hired that can conduct various missions, such as sabotage or destabilization, on rival worlds, or act as counter-agents against rival agents attempting to conduct missions on the player's worlds
Asteroid fields to the space map, for players to mine for resources. Resources from asteroid fields are directed to planets where they increase manufacturing capacity.
A great deal of new ship hulls and jewelry
The extermination of two civilizations during the campaign - the two exterminated civilizations will still be available in "sandbox" mode, but will not appear in the future releases of the game.
|
wikipedia
|
wiki_28990_chunk_4
|
Network Centric Product Support
|
Typical Usage
The extension of the World Wide Web architecture into the product is important to understand, as all decisions for manufacturing of spare parts, scheduling for flights, and other factory OEM and airline operator functions, are driven primarily by what happens to the product in the field (rate of wear and impending failure, primarily). Predicting the rate of wear, and hence the impact on operations and forecasting for producing spare parts in the future, is critical for optimizing operations for all involved. Managing a complex system such as a fleet of aircraft, vehicles or fixed location products can be accomplished in this manner. For example, coupled with technologies such as RFID, the system could track parts from the factory to the aircraft on board, then continue to read the configuration of the subsystem’s replaceable tagged parts, map their configuration to hours run and duty cycles, then process/communicate the projected wear rate through the World Wide Web back to the operator or factory. In this way mechanical wear rates and future failures can be predicted more accurately and the forecasting of spare parts manufacturing and shipment can be significantly improved. This is called Prognostics Health Monitoring (PHM), which has become possible in recent years with the advent of electronic controllers, and is a recent evolutionary step in aircraft support and maintenance management that began as individual processes prior to World War II and solidified into a manual tracking system to support aircraft fleets in the Korean War. Support for the mechanic comes in local wireless access to technical information stored and remotely updated on board the micro-webserver component relevant to that product, such as service bulletins, factory updates, fault code driven, intelligent 3D computer game-like maintenance procedures, and social media applications for sharing of product issues and maintenance procedure improvements in the field to include collaborative 2-way voice, text and image communications. Note that this architecture can be utilized on any system that requires monitoring and trending, to include mobile medical applications for monitoring functionality of human systems when the subject is equipped with data sensors.
|
wikipedia
|
wiki_33201_chunk_7
|
List of surviving DuMont Television Network broadcasts
|
The Admiral Broadway Revue – three half-hour segments
The Adventures of Ellery Queen – one episode (December 21, 1950)
The Alan Dale Show – one episode (June 1948 )
The Armed Forces Hour – two 15-minute segments
The Arthur Murray Party – one hour-long episode, one half-hour episode, and four half-hour segments
The Bigelow Theatre (a.k.a. Hollywood Half Hour and Marquee Theatre in syndication) – one CBS episode from February 11, 1951 ("Agent from Scotland Yard"), may have aired on DuMont during the fall of 1951
Captain Video and His Video Rangers – one episode
Cavalcade of Stars – one full Gleason episode and three segments
Chance of a Lifetime – one episode
Dilemma – one episode
Easy Aces – one episode
Eloise Salutes the Stars – two episodes, weekly series hosted by Eloise McElhone
Fashions on Parade – two episodes
Flash Gordon – two episodes, "Escape into Time" (October 8, 1954) and "The Witch of Neptune" (March 4, 1955)
Hold That Camera – one episode (October 20, 1950)
It's a Small World – one episode from 1953
Life Begins at Eighty – two episodes
Life Is Worth Living – six episodes
The Morey Amsterdam Show – two half-hour segments
Night Editor – entire series (46 episodes)
The Old American Barn Dance – three episodes
Pentagon Washington – one episode (series finale from November 24, 1952)
The Plainclothesman – one episode
Rebound (a.k.a. Counterpoint in syndication) – two episodes
Rocky King, Inside Detective – two episodes
Sports for All – one episode
Star Time – five half-hour segments
Stars on Parade – two episodes
Steve Randall (a.k.a. Hollywood Off-Beat) – four episodes from 1952 (June 12, July 3, August 14, and September 11)
They Stand Accused – one episode (December 23, 1950)
Twenty Questions – one episode (January 18, 1952)
What's the Story – one episode (December 1953), featuring interviews with Allen B. DuMont and Dr. Thomas T. Goldsmith Jr.
Who's Who With Wendy Barrie – one episode (June 1949)
|
wikipedia
|
wiki_2017_chunk_12
|
Scale-free network
|
Immunization
The question of how to immunize efficiently scale free networks which represent realistic networks such as the Internet and social networks has been studied extensively. One such strategy is to immunize the largest degree nodes, i.e., targeted (intentional) attacks since for this case p is relatively high and less nodes are needed to be immunized.
However, in many realistic cases the global structure is not available and the largest degree nodes are not known.
|
wikipedia
|
wiki_1229_chunk_5
|
Bytecode
|
More recently, the authors of V8 and Dart have challenged the notion that intermediate bytecode is needed for fast and efficient VM implementation. Both of these language implementations currently do direct JIT compiling from source code to machine code with no bytecode intermediary.
|
wikipedia
|
wiki_9084_chunk_19
|
SK8 (programming language)
|
References Citations Bibliography Related patents
System and method of using object sensitivity for selecting computer-generated objects, United States Patent 5737554
Graphical interface for interacting constrained actors, United States Patent 5450540 Further reading
How to make complex software customizable, Systems, Man, and Cybernetics, 1994. Humans, Information and Technology, 1994 IEEE International Conference, October 1994
Educational Authoring Tools and the Educational Object Economy, Journal of Interactive Media in Education, 98(10), October 1998 External links
SK8 Source Code (zip format)
SK8 Source Code (StuffIt format), mirror of Apple's research FTP server
|
wikipedia
|
wiki_7192_chunk_12
|
Deontic logic
|
Mally's first deontic logic and von Wright's first plausible deontic logic
Ernst Mally, a pupil of Alexius Meinong, was the first to propose a formal system of deontic logic in his Grundgesetze des Sollens (1926) and he founded it on the syntax of Whitehead's and Russell's propositional calculus. Mally's deontic vocabulary consisted of the logical constants U and ∩, unary connective !, and binary connectives f and ∞.
* Mally read !A as "A ought to be the case".* He read A f B as "A requires B" .* He read A ∞ B as "A and B require each other."* He read U as "the unconditionally obligatory" .* He read ∩ as "the unconditionally forbidden".
Mally defined f, ∞, and ∩ as follows:
Def. f. A f B = A → !BDef. ∞. A ∞ B = (A f B) & (B f A)Def. ∩. ∩ = ¬U
Mally proposed five informal principles:
(i) If A requires B and if B requires C, then A requires C.(ii) If A requires B and if A requires C, then A requires B and C.(iii) A requires B if and only if it is obligatory that if A then B.(iv) The unconditionally obligatory is obligatory.(v) The unconditionally obligatory does not require its own negation.
He formalized these principles and took them as his axioms:
I. ((A f B) & (B → C)) → (A f C)II. ((A f B) & (A f C)) → (A f (B & C))III. (A f B) ↔ !(A → B)IV. ∃U !UV. ¬(U f ∩)
From these axioms Mally deduced 35 theorems, many of which he rightly considered strange. Karl Menger showed that !A ↔ A is a theorem and thus that the introduction of the ! sign is irrelevant and that A ought to be the case if A is the case. After Menger, philosophers no longer considered Mally's system viable. Gert Lokhorst lists Mally's 35 theorems and gives a proof for Menger's theorem at the Stanford Encyclopedia of Philosophy under Mally's Deontic Logic.
|
wikipedia
|
wiki_30183_chunk_7
|
Integrated Space Cell
|
Technology Experiment Satellite or (TES) is an experimental satellite to demonstrate and validate, in orbit, technologies that could be used in the future satellites of Indian Space Research Organisation (ISRO). The Technology Experiment Satellite (TES) has a panchromatic camera capable of producing images of 1 meter resolution for remote sensing. The launch of TES made India the second country in the world after the United States that can commercially offer images with one meter resolution. It is used for remote sensing of civilian areas, mapping industry and geographical information services.
RISAT-2, or Radar Imaging Satellite 2 has a primary sensor, the synthetic aperture radar from Israel Aerospace Industries (IAI). RISAT-2 is India's first satellite with a synthetic aperture radar. It has a day-night, all-weather monitoring capability and has a resolution of one metre. Potential applications include tracking hostile ships at sea. Though the Indian Space Research Organisation sought to underplay the satellite's defence capabilities in its website and in its announcements, a majority of the media preferred to classify it as a spy satellite. ISRO claims that the satellite will enhance ISRO's capability for earth observation, especially during floods, cyclones, landslides and in disaster management in a more effective way.
CARTOSAT-2 carries a state-of-the-art panchromatic (PAN) camera that take black and white pictures of the earth in the visible region of the electromagnetic spectrum. The swath covered by these high resolution PAN cameras is 9.6 km and their spatial resolution is 80 centimetres. The satellite can be steered up to 45 degrees along as well as across the track. CARTOSAT-2 is an advanced remote sensing satellite capable of providing scene-specific spot imagery. The data from the satellite will be used for detailed mapping and other cartographic applications at cadastral level, urban and rural infrastructure development and management, as well as applications in Land Information System (LIS) and Geographical Information System (GIS).
CARTOSAT-2A is a dedicated satellite for the Indian Armed Forces. The satellite carries a panchromatic (PAN) camera capable of taking black-and-white pictures in the visible region of electromagnetic spectrum. The highly agile Cartosat-2A can be steered up to 45 deg along as well as across the direction of its movement to facilitate imaging of any area more frequently.
CARTOSAT-2B carries a panchromatic (PAN) camera capable of taking black-and-white pictures in the visible region of electromagnetic spectrum which has a resolution of 80 centimetres. The highly agile CARTOSAT-2B can be steered up to 45 deg along as well as across the direction of its movement to facilitate imaging of any area more frequently and offers multiple spot scene imagery.
GSAT-6A is a dedicated satellite for army as a replacement for GSAT-6 which lost communication after its launch.
GSAT-7 was launched in 2013 for the exclusive use of the Indian Navy to monitor the Indian Ocean Region (IOR) with the satellite's 2,000 nautical mile ‘footprint’ and real-time input capabilities to Indian warships, submarines and maritime aircraft. To boost its network-centric operations, the IAF is also likely to get another satellite GSAT-7C within a few years.
HySIS, a dual use satellite, was also launched in November 2013, which is used by the navy. HySIS carries two payloads, the first in the Visible Near Infrared (VNIR) spectral range of 0.4 to 0.95 micrometers with 60 contiguous spectral bands and the second in the Shortwave Infrared Range (SWIR) spectral range of 0.85 to 2.4 micrometres with a 10 nanometre bandwidth and 256 contiguous spectral bands. The satellite will have a spatial resolution of 30 meters and a swath of 30 km from its 630 km sun-synchronous orbit.
GSAT-7A, launched in December 2018 for the exclusive military use for the Indian Air Force, GSAT-7A, an advanced military communications satellite exclusively for the Indian Air Force, is similar to Indian navy's GSAT-7, and GSAT-7A will enhance Network-centric warfare capabilities of the Indian Air Force by interlinking different ground radar stations, ground airbase and Airborne early warning and control (AWACS) aircraft such as Beriev A-50 Phalcon and DRDO AEW&CS. GSAT-7A will also be used by Indian Army's Aviation Corps for its helicopters and UAV's operations.
HySIS, dual use satellite launched in 2018 is also accessible to India's defence forces.
Microsat-R satellite, a dedicated military satellite for the Indian Armed Forces, was launched on 24 January 2019. The 760 kg imaging satellite was launched using PSLV C-44 rocket.
EMISAT, launched on 1 April 2019, is a reconnaissance satellite under DRDO's project Kautilya which will provide space-based electronic intelligence or ELINT, especially to improve the situational awareness of the Indian Armed Forces by providing information and location of enemy radars.
|
wikipedia
|
wiki_89_chunk_92
|
Computer program
|
Here is a C programming language source code for the PERSON abstract datatype in a simple school application: /* person.c */
/* -------- */
#include "person.h" PERSON *person_new( char *name )
{
PERSON *person; if ( ! ( person = calloc( 1, sizeof( PERSON ) ) ) )
{
fprintf(stderr,
"ERROR in %s/%s/%d: calloc() returned empty.\n",
,
,
);
exit( 1 );
}
|
wikipedia
|
wiki_20067_chunk_5
|
K-set (geometry)
|
Construction algorithms
Edelsbrunner and Welzl first studied the problem of constructing all k-sets of an input point set, or dually of constructing the k-level of an arrangement. The k-level version of their algorithm can be viewed as a plane sweep algorithm that constructs the level in left-to-right order. Viewed in terms of k-sets of point sets, their algorithm maintains a dynamic convex hull for the points on each side of a separating line, repeatedly finds a bitangent of these two hulls, and moves each of the two points of tangency to the opposite hull. Chan surveys subsequent results on this problem, and shows that it can be solved in time proportional to Dey's O(nk1/3) bound on the complexity of the k-level.
|
wikipedia
|
wiki_33177_chunk_87
|
Robotics
|
Moreover, there are certain skills to which humans will be better suited than machines for some time to come and the question is how to achieve the best combination of human and robot skills. The advantages of robotics include heavy-duty jobs with precision and repeatability, whereas the advantages of humans include creativity, decision-making, flexibility, and adaptability. This need to combine optimal skills has resulted in collaborative robots and humans sharing a common workspace more closely and led to the development of new approaches and standards to guarantee the safety of the "man-robot merger". Some European countries are including robotics in their national programmes and trying to promote a safe and flexible co-operation between robots and operators to achieve better productivity. For example, the German Federal Institute for Occupational Safety and Health (BAuA) organises annual workshops on the topic "human-robot collaboration".
|
wikipedia
|
wiki_9_chunk_10
|
Algorithms for calculating variance
|
The following formulas can be used to update the mean and (estimated) variance of the sequence, for an additional element xn. Here, denotes the sample mean of the first n samples , their biased sample variance, and their unbiased sample variance. These formulas suffer from numerical instability, as they repeatedly subtract a small number from a big number which scales with n. A better quantity for updating is the sum of squares of differences from the current mean, , here denoted : This algorithm was found by Welford, and it has been thoroughly analyzed. It is also common to denote and .
|
wikipedia
|
wiki_31320_chunk_19
|
Topology (electrical circuits)
|
Comprehensive cataloguing of network graphs as they apply to electrical circuits began with Percy MacMahon in 1891 (with an engineer friendly article in The Electrician in 1892) who limited his survey to series and parallel combinations. MacMahon called these graphs yoke-chains. Ronald M. Foster in 1932 categorised graphs by their nullity or rank and provided charts of all those with a small number of nodes. This work grew out of an earlier survey by Foster while collaborating with George Campbell in 1920 on 4-port telephone repeaters and produced 83,539 distinct graphs.
|
wikipedia
|
wiki_38249_chunk_2
|
Algorithmic skeleton
|
Example program
The following example is based on the Java Skandium library for parallel programming. The objective is to implement an Algorithmic Skeleton-based parallel version of the QuickSort algorithm using the Divide and Conquer pattern. Notice that the high-level approach hides Thread management from the programmer.
|
wikipedia
|
wiki_918_chunk_13
|
MathML
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE math PUBLIC "-//W3C//DTD MathML 2.0//EN"
"http://www.w3.org/Math/DTD/mathml2/mathml2.dtd">
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mrow>
<mi>a</mi> <mo>⁢</mo> <msup><mi>x</mi><mn>2</mn></msup>
<mo>+</mo><mi>b</mi><mo>⁢</mo><mi>x</mi>
<mo>+</mo><mi>c</mi>
</mrow>
</math>
|
wikipedia
|
wiki_8345_chunk_3
|
Intrinsic function
|
C and C++
Compilers for C and C++, of Microsoft,
Intel, and the GNU Compiler Collection (GCC)
implement intrinsics that map directly to the x86 single instruction, multiple data (SIMD) instructions (MMX, Streaming SIMD Extensions (SSE), SSE2, SSE3, SSSE3, SSE4, AVX, AVX2, AVX512, FMA, ...). The Microsoft Visual C++ compiler of Microsoft Visual Studio does not support inline assembly for x86-64. To compensate for this, new intrinsics have been added that map to standard assembly instructions that are not normally accessible through C/C++, e.g., bit scan.
|
wikipedia
|
wiki_24497_chunk_15
|
List of problems in loop theory and quasigroup theory
|
Loops with abelian inner mapping group
Let Q be a loop with abelian inner mapping group. Is Q nilpotent? If so, is there a bound on the nilpotency class of Q? In particular, can the nilpotency class of Q be higher than 3?
Proposed: at Loops '07, Prague 2007
Comments: When the inner mapping group Inn(Q) is finite and abelian, then Q is nilpotent (Niemenaa and Kepka). The first question is therefore open only in the infinite case. Call loop Q of Csörgõ type if it is nilpotent of class at least 3, and Inn(Q) is abelian. No loop of Csörgõ type of nilpotency class higher than 3 is known. Loops of Csörgõ type exist (Csörgõ, 2004), Buchsteiner loops of Csörgõ type exist (Csörgõ, Drápal and Kinyon, 2007), and Moufang loops of Csörgõ type exist (Nagy and Vojtěchovský, 2007). On the other hand, there are no groups of Csörgõ type (folklore), there are no commutative Moufang loops of Csörgõ type (Bruck), and there are no Moufang p-loops of Csörgõ type for p > 3 (Nagy and Vojtěchovský, 2007).
|
wikipedia
|
wiki_8969_chunk_12
|
Combat flight simulation game
|
Survey
A survey simulation is a classification of simulator that includes a variety (or survey) of aircraft from the period in question. This type of classification applies to many historical combat simulators, and typically includes aircraft from all nations participating in the conflict. Early simulators suffered from flight models and instrument panels that differed little between aircraft. As the technology got better, so did the diversity of aircraft, which forced the virtual pilot to learn the carefully modelled strengths and weaknesses of the various types of aircraft (e.g. the different fighting and flying styles of a Spitfire versus a Messerschmitt 109 in IL-2 Sturmovik or a Mitsubishi Zero versus a US Navy F4F Wildcat in Combat Flight Simulator 2).
|
wikipedia
|
wiki_24205_chunk_15
|
Rod calculus
|
Sunzi Suanjing described in detail the algorithm of multiplication. On the left are the steps to calculate 38×76:
Place the multiplicand on top, the multiplier on bottom. Line up the units place of the multiplier with the highest place of the multiplicand. Leave room in the middle for recording.
Start calculating from the highest place of the multiplicand (in the example, calculate 30×76, and then 8×76). Using the multiplication table 3 times 7 is 21. Place 21 in rods in the middle, with 1 aligned with the tens place of the multiplier (on top of 7). Then, 3 times 6 equals 18, place 18 as it is shown in the image. With the 3 in the multiplicand multiplied totally, take the rods off.
Move the multiplier one place to the right. Change 7 to horizontal form, 6 to vertical.
8×7 = 56, place 56 in the second row in the middle, with the units place aligned with the digits multiplied in the multiplier. Take 7 out of the multiplier since it has been multiplied.
8×6 = 48, 4 added to the 6 of the last step makes 10, carry 1 over. Take off 8 of the units place in the multiplicand, and take off 6 in the units place of the multiplier.
Sum the 2380 and 508 in the middle, which results in 2888: the product.
|
wikipedia
|
wiki_19298_chunk_9
|
1950–51 United States network television schedule
|
NBCReturning SeriesThe Aldrich Family
Armstrong Circle Theatre
Bonny Maid Versatile Varieties
Break the Bank
Camel News Caravan
Cameo Theatre
Candid Camera
The Clock
Duffy's Tavern
Fireside Theatre
Garroway at Large
Gillette Cavalcade of Sports
Greatest Fights of the Century
The Halls of Ivy
Hawkins Falls
The Jack Carter Show
Kay Kyser's Kollege of Musical Knowledge
Kraft Television Theatre
Kukla, Fran and Ollie
Leave It to the Girls
Lights Out
The Little Show
Martin Kane, Private Eye
The Mohawk Showroom
One Man's Family
The Original Amateur Hour
Quiz Kids
The Philco Television Playhouse
Robert Montgomery Presents
Screen Directors Playhouse
The Texaco Star Theater
The Voice of Firestone
The Wayne King Show
We, the People
Who Said That?
Your Hit Parade
Your Show of ShowsNew SeriesThe Colgate Comedy HourFour Star RevueThe Hank McCune ShowHenry Morgan's Great Talent Hunt *The Jack Benny ProgramThe Kate Smith Evening HourMusical Comedy TimeRobert Montgomery PresentsSaturday Roundup *Seven at Eleven *Short Story Playhouse *Somerset Maugham TV TheatreThe Speidel Show *Stars Over HollywoodThe Straw Hat Matinee *Tag the Gag *Take a ChanceWatch Mr. Wizard *You Bet Your LifeYour Hit Parade *Not returning from 1949–50:'''The Black RobeChevrolet Tele-TheaterCities Service Band of AmericaThe CrisisFireball Fun-For-AllHopalong CassidyLeon Pearson and the NewsThe Marshal of Gunsight PassMary Kay and JohnnyMasterpiece PlayhouseMeet the PressMeet Your CongressMixed DoublesThe Nature of ThingsTheatre of the MindNote: The * indicates that the program was introduced in midseason.
|
wikipedia
|
wiki_23909_chunk_4
|
European Sensory Network
|
ESN Studies
Some examples:
Proficiency Testing in Sensory Analysis : within the frame of the EU-funded project "ProfiSens", ESN has contributed to the development of international guidelines on how to evaluate panel performance and on how to monitor the consistency and comparability of test data in sensory laboratories.
Calibration methods: ESN members took part in the EU-funded project "Calibsensory", which developed reference samples and calibration procedures for sensory testing of food contact materials (paper and board).
By its participation in the EU study „Healthy aging“ (HealthSense), ESN members have contributed to new findings on how changes in sensory physiology, sensory psychology and socio-cognitive factors influence food choice in old age.
In the EU-project „Healthy Lifestyle in Europe by Nutrition in Adolescence (HELENA) ESN members have compared eating habits of young people in five different European countries and identified barriers to healthy eating. They are involved in the development of new appealing healthy foods for young European consumers.
|
wikipedia
|
wiki_27985_chunk_4
|
Bees algorithm
|
Pseudocode for the standard bees algorithm
1 for i=1,…,ns
i scout[i]=Initialise_scout()
ii flower_patch[i]=Initialise_flower_patch(scout[i])
2 do until stopping_condition=TRUE
i Recruitment()
ii for i =1,...,na
1 flower_patch[i]=Local_search(flower_patch[i])
2 flower_patch[i]=Site_abandonment(flower_patch[i])
3 flower_patch[i]=Neighbourhood_shrinking(flower_patch[i])
iii for i = nb,...,ns
1 flower_patch[i]=Global_search(flower_patch[i])}
|
wikipedia
|
wiki_14705_chunk_8
|
Extreme Networks
|
Therefore, through a series of historical and contemporary merger and acquisition activity, Extreme Networks claims an industry lineage that includes, at a minimum, the networking-focused elements of the following companies: Digital, Chantry, Siemens, Cabletron, Enterasys, AirDefense, Symbol, Motorola, Zebra, Wellfleet, SynOptics, Bay Networks, Nortel Networks, Avaya, Vistapointe, StackStorm, Foundry Networks, Brocade, and Aerohive Networks. Extreme Networks itself claims that the combined entity should now be able to generate annual revenues in the region of US $1 billion and to now rank in the top three enterprise networking companies (measured by revenue), and Zeus Kerravala, an industry pundit, has observed that "a bigger, more profitable Extreme will have more money to invest in R&D, fueling further innovation."
|
wikipedia
|
wiki_30342_chunk_17
|
List of renewable energy companies by stock exchange
|
|-
|Iberdrola Renovables, SA
| style="text-align:center;"| Madrid
| style="text-align:center;"|
| style="text-align:center;"| 2007
| style="text-align:center;"| Wind, solar, biomass |-
|Infigen Energy
| style="text-align:center;"| Sydney
| style="text-align:center;"|
| style="text-align:center;"| 2003
| style="text-align:center;"| Wind, solar
|
wikipedia
|
wiki_32051_chunk_39
|
Introduction to evolution
|
Biogeography is the study of the geographical distribution of species. Evidence from biogeography, especially from the biogeography of oceanic islands, played a key role in convincing both Darwin and Alfred Russel Wallace that species evolved with a branching pattern of common descent. Islands often contain endemic species, species not found anywhere else, but those species are often related to species found on the nearest continent. Furthermore, islands often contain clusters of closely related species that have very different ecological niches, that is have different ways of making a living in the environment. Such clusters form through a process of adaptive radiation where a single ancestral species colonises an island that has a variety of open ecological niches and then diversifies by evolving into different species adapted to fill those empty niches. Well-studied examples include Darwin's finches, a group of 13 finch species endemic to the Galápagos Islands, and the Hawaiian honeycreepers, a group of birds that once, before extinctions caused by humans, numbered 60 species filling diverse ecological roles, all descended from a single finch like ancestor that arrived on the Hawaiian Islands some 4 million years ago. Another example is the Silversword alliance, a group of perennial plant species, also endemic to the Hawaiian Islands, that inhabit a variety of habitats and come in a variety of shapes and sizes that include trees, shrubs, and ground hugging mats, but which can be hybridised with one another and with certain tarweed species found on the west coast of North America; it appears that one of those tarweeds colonised Hawaii in the past, and gave rise to the entire Silversword alliance.
|
wikipedia
|
wiki_8093_chunk_3
|
Autocode
|
Below is an example of Glennie's Autocode function which calculates the formula: . The example omits necessary scaling instruction needed to place integers into variables and assumes that results of multiplication fit into lower accumulator.
|
wikipedia
|
wiki_22603_chunk_17
|
Harvard John A. Paulson School of Engineering and Applied Sciences
|
Howard H. Aiken (AM '37, PhD '39) - computer scientist and designer of the Harvard Mark I
Hardy Cross (MCE '11) - American structural engineer and developer of the moment distribution method for structural analysis of statically indeterminate structures
Howard Wilson Emmons (PhD '38) - mechanical engineer considered "the father of modern fire science" for his contribution to the understanding of flame propagation and fire dynamics, helped design the first supersonic wind tunnel, identified a signature of the transition to turbulence in boundary layer flows (now known as "Emmons spots"), and was the first to observe compressor stall in a gas turbine compressor
Simon Newcomb (SB 1858) - Rear Admiral in the United States Navy and a leader in mathematical astronomy
Charles Sanders Peirce (SB 1862) - known as the "father of pragmatism"
Trip Adler (AB '06) - CEO and co-founder of digital library and document sharing platform Scribd
Robert Berger (PhD '65) - invented the first aperiodic tiling
Fred Brooks (PhD '56) - Turing Award winner, managed the development of IBM's System/360 family of computers and the OS/360 software support package, and wrote about the process in the well-regarded book The Mythical Man-Month
Don Coppersmith (SM '75, PhD '77) - developed Coppersmith-Winograd algorithm for rapid matrix multiplication
Danny Cohen (PhD '69) - internet pioneer, developed the first real-time visual flight simulator and the Cohen-Sutherland line clipping algorithm
E. Allen Emerson (PhD '81) - Turing Award winner for developing model checking
John Fawcett (AB '99) - entrepreneur and co-founder of hedge fund software companies Tamale Software and Quantopian
Danielle Feinberg (AB '96) - cinematographer and Director of Photography for Lighting at Pixar Animation Studios
Shih Choon Fong (PhD '73) - founding president of the King Abdullah University of Science and Technology
Paul Graham (SM '88, PhD '90) - Y Combinator cofounder, introduced the Blub paradox
Martha Crawford Heitzmann (PhD '97) - former head of research at French nuclear power conglomerate Areva, senior vice president of research at L'Oréal
Tony Hsieh (AB '95) - internet entrepreneur and venture capitalist, CEO of online shoe and clothing shop Zappos
Marco Iansiti (AB '83, PhD '88) - microelectronics engineer and Harvard Business School professor
Kenneth E. Iverson (PhD '54) - Turing Award winner for developing the APL programming language
Richard M. Karp (AB '55, PhD '59) - Turing Award winner for contributions to the theory of NP-completeness
Iris Mack (PhD '86) - applied mathematician in quantitative finance, MIT professor, and author
Marvin Minsky (AB '50) - Turing Award winner for co-founding the field of artificial intelligence
Robert Tappan Morris (AB '87, SM '93, PhD '99) - creator of the Morris Worm, the first computer worm on the internet and first person convicted under the Computer Fraud and Abuse Act, co-founded Y-Combinator, professor at MIT
Dennis Ritchie (AB '63, PhD '68) - Turing Award winner, created the C programming language and Unix operating system
Don Ross (PhD '53) - recipient of the Navy Distinguished Civilian Service Award, made important developments in reduction of submarine noise
Donald Rubin (SM '66, PhD '70) - statistician known for the Rubin Causal Model
Steven Salzberg (PhD '89) - computational biologist who made significant contributions to gene finding and sequence alignment bioinformatics algorithms, notably GLIMMER, MUMmer, and Bowtie
Alfred Spector (AB '76) - co-founder of Transarc, former vice president of research at Google, and CTO of Two Sigma Investments
Richard Stallman (AB '74) - founder of the Free Software Foundation
Guy L. Steele Jr. (AB '75) - made significant contributions to the design and documentation of several programming languages
Marius Vassiliou (AB '78) - computational physicist known for introducing Rokhlin's fast multipole method to computational electromagnetics
An Wang (PhD '48) - invented magnetic core memory
Stephanie Wilson (SB '88) - NASA astronaut
Jane Willis (AB '91, JD '94) - member of the MIT Blackjack Team
Tai Tsun Wu (SM '54, PhD '56) - physicist known for significant contributions in high-energy nuclear physics and statistical mechanics
Harold Zirin (SB '50, PhD '53) - astrophysicist known as "Captain Corona"
|
wikipedia
|
wiki_34580_chunk_0
|
Common modeling infrastructure
|
Common modeling infrastructure refers to software libraries that can be shared across multiple institutions in order to increase software reuse and interoperability in complex modeling systems. Early initiatives were in the climate and weather domain, where software components representing distinct physical domains (for example, ocean or atmosphere) tended to be developed by domain specialists, often at different organizations. In order to create complete applications, these needed to be combined, using for instance a general circulation model, that transfers data between different components. An additional challenge is that these models generally require supercomputers to run, to account for the collected data and for data analyses. Thus, it was important to provide an efficient massively parallel computer system, and the processing hardware and software, to account for all the different workloads and communication channels.
|
wikipedia
|
wiki_17797_chunk_11
|
Armed Forces Radiobiology Research Institute
|
Operating research facilities for and disseminate results from the study of radiobiology and ionizing radiation bioeffects and the development of medical countermeasures against ionizing radiation
Providing analysis, study, and consultation on the impact of the biological effects of ionizing radiation on the organizational efficiency of the U.S. military services and their members
Conducting cooperative research with military medical departments in those aspects of military and operational and medical support considerations related to nuclear weapons effects and the radiobiological hazards of space operations
Conducting advanced training in the field of radiobiology and the biological effects of nuclear and radiobiological weapons to meet the internal requirements of AFRRI, the military services, and other DoD components and organizations
Participating in cooperative research and other enterprises, consistent with the AFRRI mission and applicable authorities, with other federal agencies involved in homeland security and emergency medical preparedness
Informing and appraising Department, government, academic, corporate, and other nongovernmental organizations of its (AFRRI's) activities
Performing other such functions as may be assigned by the Assistant Secretary of Defense for Health Affairs (ASD(HA))
Overseeing DoD's Medical Radiological Defense Research Program
|
wikipedia
|
wiki_5511_chunk_15
|
Topological sorting
|
Application to shortest path finding
The topological ordering can also be used to quickly compute shortest paths through a weighted directed acyclic graph. Let be the list of vertices in such a graph, in topological order. Then the following algorithm computes the shortest path from some source vertex to all other vertices:
|
wikipedia
|
wiki_2247_chunk_8
|
Experimental mathematics
|
Visual investigations
In Indra's Pearls, David Mumford and others investigated various properties of Möbius transformation and the Schottky group using computer generated images of the groups which: furnished convincing evidence for many conjectures and lures to further exploration. Plausible but false examples Some plausible relations hold to a high degree of accuracy, but are still not true. One example is: The two sides of this expression actually differ after the 42nd decimal place.
|
wikipedia
|
wiki_35939_chunk_12
|
Human–computer interaction
|
The following experimental design principles are considered, when evaluating a current user interface, or designing a new user interface:
Early focus is placed on the user(s) and task(s): How many users are needed to perform the task(s) is established and who the appropriate users should be is determined (someone who has never used the interface, and will not use the interface in the future, is most likely not a valid user). In addition, the task(s) the users will be performing and how often the task(s) need to be performed is defined.
Empirical measurement: the interface is tested with real users who come in contact with the interface daily. The results can vary with the performance level of the user and the typical human–computer interaction may not always be represented. Quantitative usability specifics, such as the number of users performing the task(s), the time to complete the task(s), and the number of errors made during the task(s) are determined.
Iterative design: After determining what users, tasks, and empirical measurements to include, the following iterative design steps are performed:
Design the user interface
Test
Analyze results
Repeat
The iterative design process is repeated until a sensible, user-friendly interface is created.
|
wikipedia
|
wiki_30027_chunk_26
|
Zonal spherical function
|
Computing the inner product above leads to Harish-Chandra's formula for the zonal spherical function {| border="1" cellspacing="0" cellpadding="5" |
|} as an integral over K.
|
wikipedia
|
wiki_4824_chunk_7
|
National Cryptologic Museum
|
Early Cryptology, which deals with cryptologic history prior to the formation of NSA, with exhibits dating back to the 16th century (the Renaissance-era book Polygraphiae) forward to the early 1950s, focusing on artifacts from the Founding Fathers of the United States, the American Civil War, the United States Army Code talkers, World War I, World War II, and the Korean War
Cold War/Information Age, which deals with cryptology and cryptanalysis on both sides of the Cold War, the early years of NSA, and the rise of the modern age of computers, including the development of supercomputers
Information Assurance, which deals with the rise of satellite technology, secure voice communications, tamper-evident technologies, and use of biometrics in data protection
Memorial Hall, one side of which features the NSA Hall of Honor, and the other side of which features exhibits honoring those who lost their lives in cryptologic missions represented by the aircraft at NVP as well as others who lost their lives in cryptologic service to America (USS Pueblo, USS Liberty, The Pentagon on September 11, 2001, and a replica of NSA's National Cryptologic Memorial)
|
wikipedia
|
wiki_18764_chunk_126
|
Anonymous function
|
Visual Basic .NET
Visual Basic .NET 2008 introduced anonymous functions through the lambda form. Combined with implicit typing, VB provides an economical syntax for anonymous functions. As with Python, in VB.NET, anonymous functions must be defined on one line; they cannot be compound statements. Further, an anonymous function in VB.NET must truly be a VB.NET Function - it must return a value.
Dim foo = Function(x) x * x
Console.WriteLine(foo(10))
Visual Basic.NET 2010 added support for multiline lambda expressions and anonymous functions without a return value. For example, a function for use in a Thread.
Dim t As New System.Threading.Thread(Sub ()
For n As Integer = 0 To 10 'Count to 10
Console.WriteLine(n) 'Print each number
Next
End Sub
)
t.Start()
|
wikipedia
|
wiki_7478_chunk_4
|
General Algebraic Modeling System
|
Background
The driving force behind the development of GAMS were the users of mathematical programming who believed in optimization as a powerful and elegant framework for solving real life problems in science and engineering. At the same time, these users were frustrated by high costs, skill requirements, and an overall low reliability of applying optimization tools. Most of the system's initiatives and support for new development arose in response to problems in the fields of economics, finance, and chemical engineering, since these disciplines view and understand the world as a mathematical program.
|
wikipedia
|
wiki_36728_chunk_20
|
List of important publications in theoretical computer science
|
Description: A very popular text on algorithms in the late 1980s. It was more accessible and readable (but more elementary) than Aho, Hopcroft, and Ullman. There are more recent editions. Introduction to Algorithms Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
3rd Edition, MIT Press, 2009, . Description: This textbook has become so popular that it is almost the de facto standard for teaching basic algorithms. The 1st edition (with first three authors) was published in 1990, the 2nd edition in 2001, and the 3rd in 2009.
|
wikipedia
|
wiki_32722_chunk_12
|
Pure (programming language)
|
let x = dmatrix {2,1,-1,8; -3,-1,2,-11; -2,1,2,-3};
x; gauss_elimination x; As a language based on term rewriting, Pure fully supports symbolic computation with expressions. Here is an example showing the use of local rewriting rules to expand and factor simple arithmetic expressions: expand = reduce with
(a+b)*c = a*c+b*c;
a*(b+c) = a*b+a*c;
end;
|
wikipedia
|
wiki_12627_chunk_11
|
Gompertz function
|
Growth of tumors
In the 1960s A.K. Laird for the first time successfully used the Gompertz curve to fit data of growth of tumors. In fact, tumors are cellular populations growing in a confined space where the availability of nutrients is limited. Denoting the tumor size as X(t) it is useful to write the Gompertz Curve as follows: where:
|
wikipedia
|
wiki_27152_chunk_3
|
Hardware scout
|
References
Improving data cache performance by pre-executing instructions under a cache miss
Improving processor performance by dynamically preprocessing the instruction stream
High Performance Throughput Computing
Runahead execution: an alternative to very large instruction windows for out-of-order processors
Sun: Can you smell what the Rock is Cookin'
Instruction processing
|
wikipedia
|
wiki_2158_chunk_19
|
Lock (computer science)
|
Lack of composability
One of lock-based programming's biggest problems is that "locks don't compose": it is hard to combine small, correct lock-based modules into equally correct larger programs without modifying the modules or at least knowing about their internals. Simon Peyton Jones (an advocate of software transactional memory) gives the following example of a banking application:
design a class that allows multiple concurrent clients to deposit or withdraw money to an account; and give an algorithm to transfer money from one account to another. The lock-based solution to the first part of the problem is:
|
wikipedia
|
wiki_14084_chunk_4
|
Tridiagonal matrix algorithm
|
The implementation in a VBA subroutine without preserving the coefficient vectors:
Sub TriDiagonal_Matrix_Algorithm(N%, A#(), B#(), C#(), D#(), X#())
Dim i%, W#
For i = 2 To N
W = A(i) / B(i - 1)
B(i) = B(i) - W * C(i - 1)
D(i) = D(i) - W * D(i - 1)
Next i
X(N) = D(N) / B(N)
For i = N - 1 To 1 Step -1
X(i) = (D(i) - C(i) * X(i + 1)) / B(i)
Next i
End Sub
|
wikipedia
|
wiki_25402_chunk_12
|
Beznau Nuclear Power Plant
|
Furthermore, each reactor unit has been equipped with an emergency building (NANO, NAchrüstung NOtstandsystem). These contain additional safety systems for the reactor emergency shutdown and for the feeding of the steam generators, a 50 kV emergency power line, and a diesel electricity generator. They are heavily protected (bunkerised) from external hazards and, if needed, are able to cool and shut down the power plant without human intervention for 72 hours.<ref>[http://woody.com/2012/05/07/not-losing-to-the-rain/ The Notstand building, a bunkered facility which could support all of the plant systems for at least 72 hours. I asked Martin Richner, the head of risk assessment, why Beznau spent so much money on the Notstand building when there was no regulation or government directive to do so. Martin answered me, “Woody, we live here.”]</ref> The at least 1.5 m thick concrete-steel housings protect the critical systems from external agents like earthquakes or plane crashes. Each unit of the KKB has a large dry type containment in steel and concrete.
|
wikipedia
|
wiki_35603_chunk_1
|
Mia's Math Adventure: Just in Time!
|
Activities
The game's 12 educational activities teach arithmetic (addition, subtraction, multiplication and division) geometry (circle, square, rectangle, triangle, closed and broken lines) logic, place value, fractions, measures, etc. Critical reception
Mia's Math Adventure received positive reviews from the National Parenting Center, USA Today, MacAddict, ReviewCorner.com, Maccentral.com, Houston Chronicle, Chicago Parent, and Los Angeles Times. Reception The game received several awards from various organizations such as Parents' Choice, National Parenting Center, Coalition for Quality Children's Media and iParenting Media Award.
|
wikipedia
|
wiki_32367_chunk_18
|
Z88 FEM software
|
Application in the industry
Due to the Open Source approach many applications use the Z88 solver, its plot output, etc. Among other things Z88 has been adapted into a program to calculate point concentrated and linear loads on glass panes in building construction. Routines have been implemented to determine the Young's modulus and flexural strength of wood and a sub-application has been developed to calculate pressure vessels.
Examples of companies using Z88 are
Boeing: Missile Defense Systems (USA),
Teledyne Brown Engineering (USA),
Winimac Coil Spring Inc. (USA),
Double D Design Ltd. (New Zealand),
RINGSPANN GmbH (Germany),
KTR Kupplungstechnik GmbH (Germany) und
Neuson Hydrotec GmbH (Austria).
|
wikipedia
|
wiki_2671_chunk_37
|
Reverse mathematics
|
Weaker systems than recursive comprehension can be defined. The weak system RCA consists of elementary function arithmetic EFA (the basic axioms plus Δ induction in the enriched language with an exponential operation) plus Δ comprehension. Over RCA, recursive comprehension as defined earlier (that is, with Σ induction) is equivalent to the statement that a polynomial (over a countable field) has only finitely many roots and to the classification theorem for finitely generated Abelian groups. The system RCA has the same proof theoretic ordinal ω3 as EFA and is conservative over EFA for Π sentences.
Weak Weak Kőnig's Lemma is the statement that a subtree of the infinite binary tree having no infinite paths has an asymptotically vanishing proportion of the leaves at length n (with a uniform estimate as to how many leaves of length n exist). An equivalent formulation is that any subset of Cantor space that has positive measure is nonempty (this is not provable in RCA0). WWKL0 is obtained by adjoining this axiom to RCA0. It is equivalent to the statement that if the unit real interval is covered by a sequence of intervals then the sum of their lengths is at least one. The model theory of WWKL0 is closely connected to the theory of algorithmically random sequences. In particular, an ω-model of RCA0 satisfies weak weak Kőnig's lemma if and only if for every set X there is a set Y that is 1-random relative to X.
DNR (short for "diagonally non-recursive") adds to RCA0 an axiom asserting the existence of a diagonally non-recursive function relative to every set. That is, DNR states that, for any set A, there exists a total function f such that for all e the eth partial recursive function with oracle A is not equal to f. DNR is strictly weaker than WWKL (Lempp et al., 2004).
Δ-comprehension is in certain ways analogous to arithmetical transfinite recursion as recursive comprehension is to weak Kőnig's lemma. It has the hyperarithmetical sets as minimal ω-model. Arithmetical transfinite recursion proves Δ-comprehension but not the other way around.
Σ-choice is the statement that if η(n,X) is a Σ formula such that for each n there exists an X satisfying η then there is a sequence of sets Xn such that η(n,Xn) holds for each n. Σ-choice also has the hyperarithmetical sets as minimal ω-model. Arithmetical transfinite recursion proves Σ-choice but not the other way around.
HBU (short for "uncountable Heine-Borel") expresses the (open-cover) compactness of the unit interval, involving uncountable covers. The latter aspect of HBU makes it only expressible in the language of third-order arithmetic. Cousin's theorem (1895) implies HBU, and these theorems use the same notion of cover due to Cousin and Lindelöf. HBU is hard to prove: in terms of the usual hierarchy of comprehension axioms, a proof of HBU requires full second-order arithmetic.
Ramsey's theorem for infinite graphs does not fall into one of the big five subsystems, and there are many other weaker variants with varying proof strengths.
|
wikipedia
|
wiki_30692_chunk_68
|
Personal computer
|
See also List of home computers
Public computer
Portable computer
Desktop replacement computer
Quiet PC
Pocket PC
Market share of personal computer vendors
Personal Computer Museum
Enthusiast computer References Further reading
Accidental Empires: How the boys of Silicon Valley make their millions, battle foreign competition, and still can't get a date, Robert X. Cringely, Addison-Wesley Publishing, (1992),
PC Magazine, Vol. 2, No. 6, November 1983, ‘'SCAMP: The Missing Link in the PC's Past?‘’ External links
|
wikipedia
|
wiki_7943_chunk_5
|
Paul Seymour (mathematician)
|
Major contributions
Combinatorics in Oxford in the 1970s was dominated by matroid theory, due to the influence of Dominic Welsh and Aubrey William Ingleton. Much of Seymour's early work, up to about 1980, was on matroid theory, and included three important matroid results: his D.Phil. thesis on matroids with the max-flow min-cut property (for which he won his first Fulkerson prize); a characterisation by excluded minors of the matroids representable over the three-element field; and a theorem that all regular matroids consist of graphic and cographic matroids pieced together in a simple way (which won his first Pólya prize). There were several other significant papers from this period: a paper with Welsh on the critical probabilities for bond percolation on the square lattice; a paper in which
the cycle double cover conjecture was introduced; a paper on edge-multicolouring of cubic graphs, which foreshadows the matching lattice theorem of László Lovász; a paper proving that all bridgeless graphs admit nowhere-zero 6-flows, a step towards Tutte's nowhere-zero 5-flow conjecture; and a paper solving the two-paths problem, which was the engine behind much of Seymour's future work.
|
wikipedia
|
wiki_2804_chunk_12
|
Berkeley Open Infrastructure for Network Computing
|
Projects
There are 32 active projects listed in the BOINC official website:
Amicable Numbers – Mathematics
Asteroids@home – Astrophysics
BOINC@TACC – Multiple scientific areas
Climateprediction.net – Climate study
Collatz Conjecture – Mathematics
Cosmology@Home – Astronomy
Einstein@home – Astrophysics
Gerasim@Home – Computer engineering
GPUGrid.net – Molecular simulations of proteins
iThena - Computer science, computer networks
LHC@home – Physics
Milkyway@home – Astronomy
Minecraft@Home – Games
MLC@Home – Artificial Intelligence
Moo! Wrapper – Cryptography and combinatorics
nanoHUB@Home – Nanoscience
NFS@home – Factorization of large integers
NumberFields@home – Mathematics
OLDK – Mathematics
ODLK1 – Mathematics
PrimeGrid – Mathematics
QuChemPedIA@home – Molecular Chemistry
Radioactive@Home – Environmental research
RakeSearch – Mathematics
RNA World – Molecular biology
Rosetta@home – Biology
SIDock@home - Biology and Medicine
SRBase – Mathematics
Universe@Home – Astronomy
World Community Grid – Medical, environmental and other humanitarian research
Yoyo@home – Mathematics
|
wikipedia
|
wiki_12260_chunk_11
|
Microelectronics and Computer Technology Corporation
|
External links
Oral history interview with Laszlo A. Belady, Charles Babbage Institute, University of Minnesota. Discusses his tenure as Vice President and Program Director of the Microelectronics and Computer Technology Corporation (MCC); as Chairman, CTO, and CEO of the Mitsubishi Electric Research Laboratories, Inc. (MERL); and as Executive Director of the Austin Software Council.
Microelectronics and Computer Technology Corporation. FOLDOC. Retrieved Nov. 17, 2005.
Microelectronics and Computer Technology Corporation, from The Free Online Dictionary of Computing.
|
wikipedia
|
wiki_14160_chunk_4
|
Logical matrix
|
A permutation matrix is a (0, 1)-matrix, all of whose columns and rows each have exactly one nonzero element.
A Costas array is a special case of a permutation matrix.
An incidence matrix in combinatorics and finite geometry has ones to indicate incidence between points (or vertices) and lines of a geometry, blocks of a block design, or edges of a graph (discrete mathematics).
A design matrix in analysis of variance is a (0, 1)-matrix with constant row sums.
A logical matrix may represent an adjacency matrix in graph theory: non-symmetric matrices correspond to directed graphs, symmetric matrices to ordinary graphs, and a 1 on the diagonal corresponds to a loop at the corresponding vertex.
The biadjacency matrix of a simple, undirected bipartite graph is a (0, 1)-matrix, and any (0, 1)-matrix arises in this way.
The prime factors of a list of m square-free, n-smooth numbers can be described as a m × π(n) (0, 1)-matrix, where π is the prime-counting function, and aij is 1 if and only if the jth prime divides the ith number. This representation is useful in the quadratic sieve factoring algorithm.
A bitmap image containing pixels in only two colors can be represented as a (0, 1)-matrix in which the zeros represent pixels of one color and the ones represent pixels of the other color.
A binary matrix can be used to check the game rules in the game of Go
|
wikipedia
|
wiki_4231_chunk_16
|
Truth function
|
Instead of using truth tables, logical connective symbols can be interpreted by means of an interpretation function and a functionally complete set of truth-functions (Gamut 1991), as detailed by the principle of compositionality of meaning.
Let I be an interpretation function, let Φ, Ψ be any two sentences and let the truth function fnand be defined as:
fnand(T,T) = F; fnand(T,F) = fnand(F,T) = fnand(F,F) = T
|
wikipedia
|
wiki_37773_chunk_34
|
Statistics education
|
Graduate coursework and programs
Only three universities currently offer graduate programs in statistics education: the University of Granada, the University of Minnesota, and the University of Florida. However, graduate students in a variety of disciplines (e.g., mathematics education, psychology, educational psychology) have been finding ways to complete dissertations on topics related to teaching and learning statistics. These dissertations are archived on the IASE web site.
|
wikipedia
|
wiki_9209_chunk_13
|
Renewable Energy Certificate (United States)
|
Whereas air and water pollution travels across state and national boundaries irrespective of its origin, the value of RECs and the emergence of RECs markets depend very much on the markets created state by state through legislative action to mandate a Renewable Portfolio Standard. Such a balkanized approach to establishing RECs markets and incentives state by state creates issues of equity as some states could legitimately claim that their neighboring states (and their electricity consumers) with voluntary RPS are operating as free riders of pollution prevention, paid for by states (and their electricity consumers) with mandatory RPS. We can learn from EPA's SOx and NOx cap and trade program regarding how the principle of additionality with a national standard provided a benchmark for measuring and validating the commodification of pollution prevention credits that lead to market-driven initiatives with proven results in improving regional and national air quality.
|
wikipedia
|
wiki_4039_chunk_13
|
Simplified Instructional Computer
|
Emulating the SIC System
Since the SIC and SIC/XE machines are not real machines, the task of actually constructing a SIC emulator is often part of coursework in a systems programming class. The purpose of SIC is to teach introductory-level systems programmers or collegiate students how to write and assemble code below higher-level languages like C and C++. With that being said, there are some sources of SIC-emulating programs across the web, however infrequent they may be.
An assembler and a simulator written by the author, Leland in Pascal is available on his educational home page at ftp://rohan.sdsu.edu/faculty/beck
SIC/XE Simulator And Assembler downloadable at https://sites.google.com/site/sarimohsultan/Projects/sic-xe-simulator-and-assembler
SIC Emulator, Assembler and some example programs written for SIC downloadable at http://sicvm.sourceforge.net/home.php
SicTools - virtual machine, simulator, assembler and linker for the SIC/XE computer available at https://jurem.github.io/SicTools/
|
wikipedia
|
wiki_1067_chunk_41
|
Civil Service (United Kingdom)
|
Professions
The lingua franca is to describe civil servants, and in particular their grades, predominantly through a lens of administrative activity (as in the current structure of the table above), but in practice the civil service has, and always had, a number of subdivisions, with the Historic Grades having an additional designator (usually omitted for senior managers, but included from middle and junior managers) as shown as "xxx", with the major groupings being:
Executive ([x]EO)
Scientific ([x]SO)
Professional and Technology ([x]PTO)
The Current Structure identifies a number of distinct professional groupings:
Communications and Marketing
Economics
Engineering
Finance
Human Resources
Digital, Data and Technology (formerly Information Technology)
Inspector of Education and Training
Internal Audit
Knowledge and Information Management
Law
Medicine
Operational Delivery
Operational Research
Policy Delivery
Procurement and Contract Management
Programme and Project Management
Property Asset Management
Psychology
Science
Social Research
Statistics
Tax Professionals
Veterinarian
Other (for minority groups, such as Investigating Officers)
|
wikipedia
|
wiki_4415_chunk_1
|
Embedded software
|
Manufacturers build embedded software into the electronics of cars, telephones, modems, robots, appliances, toys, security systems, pacemakers, televisions and set-top boxes, and digital watches, for example. This software can be very simple, such as lighting controls running on an 8-bit microcontroller with a few kilobytes of memory with the suitable level of processing complexity determined with a Probably Approximately Correct Computation framework (a methodology based on randomized algorithms). However, embedded software can become very sophisticated in applications such as routers, optical network elements，airplanes, missiles, and process control systems.
|
wikipedia
|
wiki_31260_chunk_3
|
Sexological testing
|
What is expected of psychological measurements is "sufficient" accuracy and reliability, i.e. capability to express an indication or focus which clinicians can use as a "guideline" to rapidly and accurately deepen the aspects highlighted by the measurements and check them together with their patients. For this purpose, several statistical validation indexes of psychodiagnostic tests are provided: from standardization to various constructions of validity (internal, external, face, construct, convergent, content, discriminant, etc.).
|
wikipedia
|
wiki_410_chunk_3
|
List of NATO reporting names for miscellaneous aircraft
|
Aero L-29 "Maya"
Antonov An-71 "Madcap"
Beriev A-50 "Mainstay"
Beriev Be-2 "Mote"
Beriev Be-4 "Mug"
Beriev Be-6 "Madge"
Beriev Be-8 "Mole"
Beriev Be-10 "Mallow"
Beriev Be-12 "Mail"
Beriev Be-40 "Mermaid"
Beriev MBR-2 "Mote"
Ilyushin Il-28U "Mascot"
Ilyushin Il-38 "May"
Ilyushin Il-78 "Midas"
Ilyushin Il-86VKP "Maxdome"
Myasishchev M-17/M-55 "Mystic"
Mikoyan-Gurevich MiG-15UTI "Midget"
Mikoyan-Gurevich MiG-21 "Mongol" two-seat trainer version
PBY Catalina "Mop"
Po-2 (U-2) "Mule"
Sukhoi Su-7U "Moujik"
Sukhoi Su-9U "Maiden"
Tsibyn Ts-25 "Mist"
Tupolev Tu-126 "Moss"
Yakovlev UT-2 "Mink"
Yakovlev Yak-7V "Mark"
Yakovlev Yak-11 "Moose"
Yakovlev Yak-14 "Mare"
Yakovlev Yak-17UTI "Magnet"
Yakovlev Yak-18 "Max"
Yakovlev Yak-28U "Maestro"
Yakovlev Yak-25RV "Mandrake"
Yakovlev Yak-27R "Mangrove"
Yakovlev Yak-30 "Magnum"
Yakovlev Yak-32 "Mantis"
Yakovlev Yak-130 "Mitten"
|
wikipedia
|
wiki_27_chunk_22
|
Automatic number announcement circuit
|
Local numbers These are regular numbers within valid local exchanges in the communities listed. Many belong to competitive local exchange carriers or independent telephone company exchanges. Supposedly, a test call gives an automatic announcement. Some may announce caller ID instead of ANI; these will incur a toll (if they work at all) for calls outside their home area. These are unverified; there is a risk these will be reassigned to individual subscribers:
209: 888-6945 Stockton, California (Reads ANAC and CNAM) (out of service, returns false answer supervision 2014)
334: 557-2311 Montgomery, Alabama (CLEC) (no answer, 2014)
334: 557-2411 Montgomery, Alabama (CLEC) (busy/no answer, 2013)
419: 353-1206 Bowling Green, Ohio (Frontier) (Verified April 2018)
503: 266-1021 Canby-Needy, Oregon (Canby Telephone Association, independent, returns ANI) (Verified November 2021, but does not supervise; will not work via Google Voice)
503: 697-0053 Clackamas/Lake Oswego, Oregon (Qwest, returns Caller ID) (Verified May 2018, but will only work when calling from the Centurylink Lake Oswego exchange)
505: 243-0049 Albuquerque, New Mexico (Quest, returns Caller ID) (Verified November 2021)
508: 200-5555 Worcester, Massachusetts (Dial 7 digits—City VZ landlines only?) (Verified September 2019 via Worcester 5ESS)
515: 280-1241 Des Moines, Iowa (Qwest, returns Caller ID, additional test menu) (Verified November 2021)
541: 330-0024 Bend, Oregon (Qwest) (Verified November 2021)
561: 364-1781 Boynton Beach, Florida (Bellsouth, West Palm Beach/Jupiter/Juno Beach, returns Caller ID) (Verified November 2021)
570: 674-0086 Dallas, Pennsylvania (Frontier/Commonwealth Telephone) (Verified November 2021)
602: 253-0227 Phoenix, Arizona (Qwest) (No answer, February 2018) (Reassigned to customer December 2019)
608: 884-1206 Edgerton, Wisconsin (Frontier North, returns Caller ID) (Verified November 2021)
702: 889-4579 Las Vegas, Nevada (CenturyLink) (no answer, 2014) (No answer, February 2018)
712: 563-1206 Audubon, Iowa (Windstream) (Verified November 2021)
747: 268-1966 La Cañada Flintridge, California (FPPTN/California Bell) (Verified November 2021)
806: 863-9999 Woodrow, Texas (South Plains Telephone Co-Op) (Verified May 2018, but does not supervise; will not work via Google Voice)
812: 462-1218 Terre Haute, Indiana (Frontier North) (no answer, 2014)
|
wikipedia
|
wiki_1926_chunk_28
|
Conservation biology
|
Conservation physiology was defined by Steven J. Cooke and colleagues as: "An integrative scientific discipline applying physiological concepts, tools, and knowledge to characterizing biological diversity and its ecological implications; understanding and predicting how organisms, populations, and ecosystems respond to environmental change and stressors; and solving conservation problems across the broad range of taxa (i.e. including microbes, plants, and animals). Physiology is considered in the broadest possible terms to include functional and mechanistic responses at all scales, and conservation includes the development and refinement of strategies to rebuild populations, restore ecosystems, inform conservation policy, generate decision-support tools, and manage natural resources." Conservation physiology is particularly relevant to practitioners in that it has the potential to generate cause-and-effect relationships and reveal the factors that contribute to population declines.
|
wikipedia
|
wiki_4142_chunk_22
|
Ant colony optimization algorithms
|
Convergence
For some versions of the algorithm, it is possible to prove that it is convergent (i.e., it is able to find the global optimum in finite time). The first evidence of convergence for an ant colony algorithm was made in 2000, the graph-based ant system algorithm, and later on for the ACS and MMAS algorithms. Like most metaheuristics, it is very difficult to estimate the theoretical speed of convergence. A performance analysis of a continuous ant colony algorithm with respect to its various parameters (edge selection strategy, distance measure metric, and pheromone evaporation rate) showed that its performance and rate of convergence are sensitive to the chosen parameter values, and especially to the value of the pheromone evaporation rate. In 2004, Zlochin and his colleagues showed that COAC-type algorithms could be assimilated methods of stochastic gradient descent, on the cross-entropy and estimation of distribution algorithm. They proposed these metaheuristics as a "research-based model".
|
wikipedia
|
wiki_34956_chunk_2
|
Trapeze Software
|
2013 Acquired Mentor Engineering Inc.
2011 Created Cultura Technologies, bringing together the acquired Agri-Food software businesses.
2010 Acquired BMS Computer Solutions Ltd, a provider of software to the Agriculture industry.
2010 Acquired AGRIS and ExtendAg product suites from John Deere Agri Services, Inc., a division of Deere & Company
2008 Acquired Assets and Liabilities from MAXIMUS
2008 Acquired Cal Software, including Kinross Software
2008 Acquired Southern Computer Systems a privately held company providing fleet management software to Local Authorities, bus companies and coach operators throughout the UK.
2008 Acquired Solutions by Computer which provides business management software to the equipment, tool, and event rental industry
2007 Acquired the Fleet Runner solution suite from Data Futures
2007 Acquired Grampian Software Holdings Ltd in the UK adding Duty Allocation and Distillery Records and Management products to the Trapeze portfolio
2006 Acquired Action Information Management (AIM) an established leader in RTPI, ITS and PTI
2006 Acquired assets of Inovas and its product lines including VRT, EcoRoute Trainer (ert), Aerial Asset Survey, Pipe Inspect and Fusion
2005 Acquired AUSTRICS software and intellectual property from TransAdelaide, a public transport provider based in Australia
2005 Acquired Education Planning Solutions, a provider of planning software for school districts
2004 Created Trapeze ITS, a new division providing intelligent transportation systems
2004 Acquired Public Transport Sector division of Anite, based in the United Kingdom
2002 Acquired ATIS division of ManTech
2002 Acquired Multisystems Information Technology Group, a division of Multisystems, Inc.
2001 Acquired Cerney Computer Services (UK), a provider of demand response software for community transport
2000 Acquired Traffic Partners, Denmark, a European software provider for transport planning, operations, management
1998 Acquired Ecotran Corp, entered school transit market
1996 Merged with Online Data Products, Scottsdale AZ, a company focusing on paratransit software
|
wikipedia
|
wiki_2827_chunk_32
|
Simplex algorithm
|
In 2014, it was proved that a particular variant of the simplex method is NP-mighty, i.e., it can be used to solve, with polynomial overhead, any problem in NP implicitly during the algorithm's execution. Moreover, deciding whether a given variable ever enters the basis during the algorithm's execution on a given input, and determining the number of iterations needed for solving a given problem, are both NP-hard problems. At about the same time it was shown that there exists an artificial pivot rule for which computing its output is PSPACE-complete. In 2015, this was strengthened to show that computing the output of Dantzig's pivot rule is PSPACE-complete.
|
wikipedia
|
wiki_20512_chunk_8
|
Unicode equivalence
|
Example
{| class="wikitable" align="center" width="50%" style="text-align: center;"
|+ |Amélie with its two canonically equivalent Unicode forms (NFC and NFD)|- style="background-color:#ffeaea"
! style="width: 10em;" | NFC character
| | A || m || colspan="2" | é || l || i || e
|- style="background-color:#ffc6c6"
! NFC code point
| 0041 ||006d || colspan="2" |00e9 ||006c ||0069 ||0065
|- style="background-color:#c6efff"
! NFD code point
| 0041 ||006d ||0065 ||0301 ||006c ||0069 ||0065
|- style="background-color:#eaf9ff"
! NFD character
| A || m || e || ◌́ || l || i ||e
|}
|
wikipedia
|
wiki_24354_chunk_3
|
Shapley–Shubik power index
|
There are some algorithms for calculating the power index, e.g., dynamic programming techniques, enumeration methods and Monte Carlo methods. Since Shapley and Shubik have published their paper, several axiomatic approaches have been used to mathematically study the Shapley–Shubik power index, with the anonymity axiom, the null player axiom, the efficiency axiom and the transfer axiom being the most widely used. However, these have been criticised, especially the transfer axiom, which has led to other axioms being proposed as a replacement.
|
wikipedia
|
wiki_28036_chunk_4
|
Clone (algebra)
|
Abstract clones
Philip Hall introduced the concept of abstract clone. An abstract clone is different from a concrete clone in that the set A is not given.
Formally, an abstract clone comprises
a set Cn for each natural number n,
elements k,n in Cn for all k ≤ n, and
a family of functions ∗:Cm × (Cn)m → Cn for all m and n
such that
c * (1,n, …, n,n) = c
k,m * (c1, …, cm) = ck
c * (d1 * (e1, …, en), …, dm * (e1, …, en)) = (c * (d1, …, dm)) * (e1, …, en).
|
wikipedia
|
wiki_38422_chunk_5
|
Tensor software
|
Software for use with Maxima
Maxima is a free open source general purpose computer algebra system which includes several packages for tensor algebra calculations in its core distribution.
It is particularly useful for calculations with abstract tensors, i.e., when one wishes to do calculations without defining all components of the tensor explicitly. It comes with three tensor packages:
itensor for abstract (indicial) tensor manipulation,
ctensor for component-defined tensors, and
atensor for algebraic tensor manipulation.
|
wikipedia
|
wiki_23470_chunk_1
|
List of solar thermal power stations
|
Operational
{| class="wikitable sortable"
|+ Operational solar thermal power stations (of at least 50 MW capacity)
|-
!Name!!Country!!Location!!Coordinates
!Electrical capacity (MW)!!Technology type
!Storage hours!!Notes and references
|-
| Noor / Ouarzazate Solar Power Station || || Ghassate (Ouarzazate province) ||
| align="right" | 510|| Parabolic trough and solar power tower (Phase 3)
|3 / 7 / 7.5|| 160 MW Phase 1 with 3 hours heat storage. 200 MW phase 2 with 7 hours heat storage is online from January 2018. 150 MW (Phase 3) with 7.5 hours storage is online from November 2018
|-
|Ivanpah Solar Power Facility || || San Bernardino County, California ||
| align="right" |392||Solar power tower
| || Completed on February 13, 2014
|-
|Mojave Solar Project || || Barstow, California ||
| align="right" | 280 || Parabolic trough
| || Completed December 2014. Gross capacity of 280 MW corresponds to net capacity of 250 MW
|-
|Solana Generating Station || || Gila Bend, Arizona ||
| align="right" |280|| Parabolic trough
|6|| Completed in October 2013, with 6 hours thermal energy storage
|-
|Genesis Solar Energy Project || || Blythe, California ||
| align="right" |280 || Parabolic trough
| ||Online April 24, 2014
|-
|Solaben Solar Power Station || || Logrosán ||
| align="right" |200|| Parabolic trough
| || Solaben 3 completed June 2012Solaben 2 completed October 2012Solaben 1 and 6 completed September 2013
|-
|Solar Energy Generating Systems (SEGS) || || Mojave Desert, California ||
| align="right" | 160 ||Parabolic trough
| || Originally collection of 9 units 1984-1990 with 354 MW. Seven units were decommissioned and replaced by solar PV.
|-
|Solnova Solar Power Station || || Sanlúcar la Mayor ||
| align="right" | 150|| Parabolic trough
| || Solnova 1 completed May 2010 Solnova 3 completed May 2010 Solnova 4 completed August 2010
|-
|Andasol solar power station || || Guadix ||
| align="right" | 150 || Parabolic trough
|7.5|| Completed: Andasol 1 (2008), Andasol 2 (2009), Andasol 3 (2011). Each equipped with a 7.5 hour thermal energy storage.
|-
|Extresol Solar Power Station || ||Torre de Miguel Sesmero ||
| align="right" |150|| Parabolic trough
|7.5||Completed: Extresol 1 and 2 (2010), Extresol 3 (2012). Each equipped with a 7.5-hour thermal energy storage.
|-
| Dhursar || || Dhursar, Jaisalmer district ||
| align="right" | 125 || Fresnel reflector
| || Completed November 2014, referred as 125 MW is some sources
|-
|Ashalim Power Station (Negev Energy) || || Ashalim ||
| align="right" | 121 || Parabolic trough
|4.5|| 4.5h heat storage. Completed August 2019 and located in Negev desert
|-
| Megalim Power Station (Negev Energy) || || Ashalim ||
| align="right" | 121 || Solar power tower
| || Completed April 2019 and located in Negev desert
|-
|Crescent Dunes Solar Energy Project|| || Nye County, Nevada ||
| align="right" | 110 || Solar power tower
|10||with 10h heat storage; commercial operation began September 2015, mothballed since May 2019
|-
|Cerro Dominador Solar Thermal Plant (Atacama 1) || || María Elena, Antofagasta |||| align="right" | 110 || Solar power tower || 17.5 ||Completed April 2021, with 17.5h heat storage
|-
| Shouhang Dunhuang || || Dunhuang (Gansu Province) ||
| align="right" |110|| Solar power tower
|15 / 7.5|| Phase I compleded in 2016, Phase II with 7.5h heat storage. Operational since end of December 2018
|-
|Kathu Solar Park || || Northern Cape ||
| align="right" |100|| Parabolic trough
|4.5|| completed February 2018, With 4.5h heat storage
|
wikipedia
|
wiki_16607_chunk_6
|
Bruce Woodcock (computer games analyst)
|
Works
"An Analysis of MMOG Subscription Growth", MMOGCHART.COM, 2002 - 2008
"Confessions of an MMOG Cross-Dresser", The Escapist #77, December, 2006
"Is Rape Wrong on Azeroth?", The Escapist #69, October, 2006
"IGDA 2004 Persistent Worlds Whitepaper", contributor, January, 2005
"Illusions of Reality", Quanta #3, February, 1990
Grimtooth's Traps Too, December 1982, Flying Buffalo Computer-Conflict Simulation, contributor, The Catastrophic Keyhole,
|
wikipedia
|
wiki_35666_chunk_33
|
Format-preserving encryption
|
Another mode was included in the draft NIST guidance but was removed before final publication. FF2 is VAES3 scheme for FFX: An addendum to "The FFX Mode of Operation for Preserving Encryption": A parameter collection for encipher strings of arbitrary radix with subkey operation to lengthen life of the enciphering key. It was submitted to NIST by Joachim Vance of VeriFone Systems Inc. Test vectors are not supplied separately from FF1 and parts of it are patented. Authors have submitted a modified algorithm as DFF which is under active consideration by NIST.
|
wikipedia
|
wiki_6230_chunk_26
|
Code injection
|
External links
Article "Three Ways to Inject Your Code into Another Process" by Robert Kuster
Article "Inject your code to a Portable Executable file" by A. Danehkar
Article "Injective Code inside Import Table" by A. Danehkar
Article "Defending against Injection Attacks through Context-Sensitive String Evaluation (CSSE)" by Tadeusz Pietraszek and Chris Vanden Berghe
News article "Flux spreads wider" - First Trojan horse to make use of code injection to prevent detection from a firewall
The Daily WTF regularly reports real-world incidences of susceptibility to code injection in software.
|
wikipedia
|
wiki_11900_chunk_5
|
Software factory
|
Components
Software factories are unique and therefore contain a unique set of assets designed to help build a specific type of application. In general, most software factories contain interrelated assets of the following types:
Factory Schema: A document that categorizes and summarizes the assets used to build and maintain a system (such as XML documents, models, etc.) in an orderly way, and defines relationships between them.
Reference implementation: Provides an example of a realistic, finished product that the software factory helps developers build.
Architecture guidance and patterns: Help explain application design choices and the motivation for those choices.
How-to topics: Provide procedures and instructions for completing tasks.
Recipes: Automate procedures in How-to topics, either entirely or in specific steps. They can help developers complete routine tasks with minimal input.
Templates: Pre-made application elements with placeholders for arguments. They can be used for creating initial project items.
Designers: Provide information that developers can use to model applications at a higher level of abstraction.
Reusable code: Components that implement common functionality or mechanisms. Integration of reusable code in a software factory reduces the requirements for manually written code and encourages reuse across applications.
|
wikipedia
|
wiki_2113_chunk_9
|
Validity (statistics)
|
A test has content validity built into it by careful selection of which items to include (Anastasi & Urbina, 1997). Items are chosen so that they comply with the test specification which is drawn up through a thorough examination of the subject domain. Foxcroft, Paterson, le Roux & Herbst (2004, p. 49)<ref>Foxcroft, C., Paterson, H., le Roux, N., & Herbst, D. Human Sciences Research Council, (2004). 'Psychological assessment in South Africa: A needs analysis: The test use patterns and needs of psychological assessment practitioners: Final Report: July. Retrieved from website: http://www.hsrc.ac.za/research/output/outputDocuments/1716_Foxcroft_Psychologicalassessmentin%20SA.pdf</ref> note that by using a panel of experts to review the test specifications and the selection of items the content validity of a test can be improved. The experts will be able to review the items and comment on whether the items cover a representative sample of the behavior domain.
|
wikipedia
|
wiki_3849_chunk_5
|
Tiny Encryption Algorithm
|
void decrypt (uint32_t v[2], const uint32_t k[4]) {
uint32_t v0=v[0], v1=v[1], sum=0xC6EF3720, i; /* set up; sum is (delta << 5) & 0xFFFFFFFF */
uint32_t delta=0x9E3779B9; /* a key schedule constant */
uint32_t k0=k[0], k1=k[1], k2=k[2], k3=k[3]; /* cache key */
for (i=0; i<32; i++) { /* basic cycle start */
v1 -= ((v0<<4) + k2) ^ (v0 + sum) ^ ((v0>>5) + k3);
v0 -= ((v1<<4) + k0) ^ (v1 + sum) ^ ((v1>>5) + k1);
sum -= delta;
} /* end cycle */
v[0]=v0; v[1]=v1;
}
Note that the reference implementation acts on multi-byte numeric values. The original paper does not specify how to derive the numbers it acts on from binary or other content.
|
wikipedia
|
wiki_26097_chunk_2
|
Lesk algorithm
|
A frequently used example illustrating this algorithm is for the context "pine cone". The following dictionary definitions are used:
PINE
1. kinds of evergreen tree with needle-shaped leaves
2. waste away through sorrow or illness CONE
1. solid body which narrows to a point
2. something of this shape whether solid or hollow
3. fruit of certain evergreen trees
As can be seen, the best intersection is Pine #1 ⋂ Cone #3 = 2. Simplified Lesk algorithm
|
wikipedia
|
wiki_4506_chunk_3
|
De Casteljau's algorithm
|
An example implementation of De Casteljau's algorithm in Python:
def de_casteljau(t, coefs):
beta = [c for c in coefs] # values in this list are overridden
n = len(beta)
for j in range(1, n):
for k in range(n - j):
beta[k] = beta[k] * (1 - t) + beta[k + 1] * t
return beta[0] An example implementation of De Casteljau's algorithm in JavaScript:
|
wikipedia
|
wiki_16591_chunk_3
|
Pathfinder network
|
Example
Here is an example of an undirected pathfinder network derived from average similarity ratings of a group of biology graduate students. The students rated the relatedness of all pairs of the terms shown, and the mean rating for each pair was computed. The network shown is the PFnet(2, ∞).
|
wikipedia
|
wiki_8919_chunk_1
|
Computerworld Smithsonian Award
|
Winners
1989 - Inaugural winners, all listed: Bell & Howell's Image Plus Search System; Orangeburg School District 5, Orangeburg, South Carolina; Passaic River Basin Early Flood Warning System, Sierra-Micro Inc.; FIX and FAST, Fidelity Investments; The Missing Children Project, University of Illinois; BI Home Escort System; University of Iowa's National Advanced Driving Simulator; Live Aid, Uplinger Enterprise; The Eyegaze Computer, LC Technologies; American Airlines SABRE Reservation Service; The Innovis DesignCenter.
1992 — A Search for New Heroes
1993 — Pittsburgh Supercomputing Center, a joint project of Carnegie Mellon University and the University of Pittsburgh together with Westinghouse Electric Corporation, established in 1986 by a grant from the National Science Foundation with support from the Commonwealth of Pennsylvania. Its purpose is to develop and make available state-of-the-art high-performance computing for scientific researchers nationwide.
1994 — LOS ALAMOS NATIONAL LABORATORY Parallel Ocean Program (POP)
1995 — NEW YORK STOCK EXCHANGE, INC. Integrated Technology Plan
1996 — Carnegie Mellon FastLab, a multi-university real time financial trading simulator, for visionary use of information technology in the field of education and academia.
1997 — METROPOLITAN TORONTO POLICE, the "Metropolis" program, for technology innovations in policing, including the Computer Aided Dispatch (CAD) system, the automated 911 Emergency Response System, the Computer-Aided Scheduling of Courts system, the Repository of Integrated Computer Images (mugshot) system, the Criminals Information Processing System, the Computer Assisted Reconstruction Enhancement System, and many others
1998 — UNIVERSITY OF CALIFORNIA, BERKELEY'S SEARCH FOR EXTRATERRESTRIAL INTELLIGENCE (SETI) PROGRAM
1998 - William E. Kelvie, Fannie Mae, the first internet originated mortgage
1999 — Virtual Operating Room
2000 — EBay, Montgomery County Public Schools, Department of Primary Industry and Fisheries, Proton World, Independent Electoral Commission of South Africa, Danfoss Drives, National Marrow Donor Program, RealNetworks, Hawkes Ocean Technology, Delta Air Lines, Blackboard Inc., ROGER MAHABIR, CIO, ROYAL BANK OF CANADA DOMINION SECURITIES for advanced internet security techniques support the buying and selling of foreign currencies over the internet, supporting billions of dollars of business in the first year of operation.
|
wikipedia
|
wiki_6115_chunk_4
|
Royal Meteorological Society
|
Atmospheric Science Letters: a monthly magazine that provides a peer reviewed publication route for new shorter contributions in the field of atmospheric and closely related sciences.
Weather: a monthly magazine with many full colour illustrations and photos for specialists and general readers with an interest in meteorology. It uses a minimum of mathematics and technical language.
Quarterly Journal of the Royal Meteorological Society: as one of the world's leading journals for meteorology publishes original research in the atmospheric sciences. There are eight issues per year.
Meteorological Applications: this is a journal for applied meteorologists, forecasters and users of meteorological services and has been published since 1994. It is aimed at a general readership and authors are asked to take this into account when preparing papers.
International Journal of Climatology: has 15 issues a year and covers a broad spectrum of research in climatology.
WIREs Climate Change: a journal about climate change
Geoscience Data Journal: an online, open-access journal.
|
wikipedia
|
wiki_33081_chunk_7
|
DiaGrid (distributed computing network)
|
http://www.dia-grid.org
https://www.youtube.com/watch?v=CH_YHGYQl2g
http://campustechnology.com/articles/2009/07/22/campus-technology-innovators-awards-2009-high-performance-computing.aspx
http://markets.hpcwire.com/taborcomm.hpcwire/?GUID=10770002&Page=MediaViewer&ChannelID=3198
http://cloudcomputing.sys-con.com/node/1185883
http://news.uns.purdue.edu/x/2008b/081118McCartneyPool.html
https://web.archive.org/web/20110302201542/http://www.itap.purdue.edu/newsroom/detail.cfm?newsId=2298
http://www.cs.wisc.edu/htcondor/
http://www.itap.purdue.edu/
http://www.rcac.purdue.edu/
|
wikipedia
|
wiki_22091_chunk_5
|
Peter Baumann (computer scientist)
|
Awards and patents (source: Peter Baumann's homepage) Copernicus Masters Competition 2014: >Winner, Big Data Challenge
Open Geospatial Consortium Kenneth Gardels Award 2014
Geospatial World Forum Innovation Award 2013
Innovationspreis Mittelstand 2012, category: Best of Open Source
European IT Prize 1998
Jos Schepens Memorial Award 1998
Innovation Prize of the Bavarian State Government 1998
Founders Competition Multimedia 1998, German Association of Engineers / Electrical Engineering - IT Baumann holds international patents on array databases. Research interests
|
wikipedia
|
wiki_21685_chunk_9
|
Connected Mathematics
|
Research findings
Connected Mathematics has become the most widely used of middle school curriculum materials developed to implement the NCTM Standards. Effects of its use have been described in expository journal articles and evaluated in mathematics education research projects. Many of the research studies are masters or doctoral dissertation research projects focused on specific aspects of the CMP classroom experience and student learning. But there also have been a number of large-scale independent evaluations of results from use of the program.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.