id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_7936_chunk_3
|
North American Vexillological Association
|
NAVA honors achievement in the field with several honors and awards:
Captain William Driver Award: presented to the individual who presents the best paper at the association's annual meeting;
The Vexillonnaire Award: recognizing a flag scholar who becomes personally involved in a significant and successful act of creating, changing, or improving flag design, or promoting good flag usage or altering it for the better;
Kevin Harrington Award: presented to the individual who authors the best article to appear in a non-vexillological publication during the preceding year;
John Purcell Award: presented to an individual for an exemplary contribution that promotes public understanding of vexillology in North America;
Doreen Braverman Award: presented to an organizational member who supports the association's mission by making a significant contribution to the vexillological community;
Whitney Smith Fellow: an individual who makes an outstanding contribution to North American vexillology may be elected to this honor by NAVA's executive board. An honoree is entitled to use the postnominals "WSF"; and
Honorary membership: honors an individual who renders distinguished service to the association or vexillology.
|
wikipedia
|
wiki_38561_chunk_11
|
Comparison of programming paradigms
|
Pseudocode examples comparing various paradigms
A pseudocode comparison of imperative, procedural, and object oriented approaches used to calculate the area of a circle (πr²), assuming no subroutine inlining, no macro preprocessors, register arithmetic, and weighting each instruction 'step' as only 1 instruction – as a crude measure of instruction path length – is presented below. The instruction step that is conceptually performing the state change is highlighted in bold typeface in each case. The arithmetic operations used to compute the area of the circle are the same in all three paradigms, with the difference being that the procedural and object-oriented paradigms wrap those operations in a subroutine call that makes the computation general and reusable. The same effect could be achieved in a purely imperative program using a macro preprocessor at only the cost of increased program size (only at each macro invocation site) without a corresponding pro rata runtime cost (proportional to n invocations – that may be situated within an inner loop for instance). Conversely, subroutine inlining by a compiler could reduce procedural programs to something similar in size to the purely imperative code. However, for object-oriented programs, even with inlining, messages still must be built (from copies of the arguments) for processing by the object-oriented methods. The overhead of calls, virtual or otherwise, is not dominated by the control flow alteration – but by the surrounding calling convention costs, like prologue and epilogue code, stack setup and argument passing (see here for more realistic instruction path length, stack and other costs associated with calls on an x86 platform). See also here for a slide presentation by Eric S. Roberts ("The Allocation of Memory to Variables", chapter 7) – illustrating the use of stack and heap memory use when summing three rational numbers in the Java object-oriented language.
|
wikipedia
|
wiki_23321_chunk_5
|
Medical statistics
|
Related statistical theory
Survival analysis
Proportional hazards models
Active control trials: clinical trials in which a kind of new treatment is compared with some other active agent rather than a placebo.
ADLS(Activities of daily living scale): a scale designed to measure physical ability/disability that is used in investigations of a variety of chronic disabling conditions, such as arthritis. This scale is based on scoring responses to questions about self-care, grooming, etc.
Actuarial statistics: the statistics used by actuaries to calculate liabilities, evaluate risks and plan the financial course of insurance, pensions, etc.
|
wikipedia
|
wiki_13176_chunk_3
|
American Journal of Physics
|
Abstracting and indexing
This journal is indexed in the following databases:
Abstract Bulletin of the Institute of Paper Chemistry (PAPERCHEM in 1969)
Applied Science & Technology Index (H.W. Wilson Company)
Chemical Abstracts
Computer & Control Abstracts
Current Index to Journals in Education (CSA Illumina - ERIC database)
Current Physics Index
Electrical & Electronics Abstracts
Energy Research Abstracts
General Science Index ( H.W. Wilson Company)
International Aerospace Abstracts
Mathematical Reviews
Physics Abstracts. Science Abstracts. Series A
SPIN See also
European Journal of Physics
The Physics Teacher References External links
American Journal of Physics
American Journal of Physics editor's website
|
wikipedia
|
wiki_639_chunk_15
|
Supercomputer
|
As the price, performance and energy efficiency of general-purpose graphics processing units (GPGPUs) have improved, a number of petaFLOPS supercomputers such as Tianhe-I and Nebulae have started to rely on them. However, other systems such as the K computer continue to use conventional processors such as SPARC-based designs and the overall applicability of GPGPUs in general-purpose high-performance computing applications has been the subject of debate, in that while a GPGPU may be tuned to score well on specific benchmarks, its overall applicability to everyday algorithms may be limited unless significant effort is spent to tune the application to it. However, GPUs are gaining ground, and in 2012 the Jaguar supercomputer was transformed into Titan by retrofitting CPUs with GPUs.
|
wikipedia
|
wiki_19567_chunk_5
|
Herbert Power Stakes
|
2021 - Delphi
2020 - Chapada
2019 - The Chosen One
2018 - Yucatan
2017 - Lord Fandango
2016 - Assign
2015 - Amralah
2014 - Big Memory
2013 - Sea Moon
2012 - Shahwardi
2011 - Tanby
2010 - Linton
2009 - Alcopop
2008 - Dolphin Jo
2007 - Master O'Reilly
2006 - Growl
2005 - Leica Falcon
2004 - Rizon
2003 - Yakama
2002 - The Secondmortgage
2001 - Freemason
2000 - Majestic Avenue
1999 - Rogan Josh
1998 - Magneto
1997 - Bonsai Pipeline
1996 - The Bandette
1995 - Unsolved
1994 - Solo Show
1993 - Great Vintage
1992 - Aquidity
1991 - Princess Pushy
1990 - Just A Dancer
1989 - Nayrizi
1988 - Congressman
1987 - Cossack Warrior
1986 - Pharostan
1985 - Fil De Roi
1984 - Colonial Flag
1983 - Nostradamus
1982 - Carringbush
1981 - Flashing Light
1980 - Mr.Independent
1979 - Pigalle
1978 - Arwon
1977 - Impeller
1976 - Van der Hum
1975 - Suleiman
1974 - Big Angel
1973 - Gala Supreme
1972 - Scotch And Dry
1971 - Spectre
1970 - Beer Street
1969 - Alsop
1968 - Impetus
1967 - Padtheway
1966 - Gala Crest
1965 - Captain Blue
1964 - Sybeau
1963 - Straight Irish
1962 - Silver Pelt
1961 - Nilarco
1960 - Optic Prince
1959 - Mac
1958 - King Nero
1957 - Pandie Sun
1956 - Fighting Force
1955 - Rising Fast
1954 - Wodalla
1953 - My Hero
1952 - Durham
1951 - Durham
1950 - Dashing Beau
1949 - Dashing Beau
1948 - Howe
1947 - Riot
1946 - Sir Actor
1945 - Logical
1944 - Claudette
1943 - Mac Rob
1942 - † Portfolio / Colonus
1941 - Historian
1940 - Rex Felt
1939 - Respirator
1938 - Marauder
1937 - International
1936 - Desert Chief
1935 - Red Ray
1934 - Broad Arrow
1933 - Segati
1932 - Scalpel
1931 - Shadow King
1930 - Second Wind
1929 - Taisho
1928 - Strephon
1927 - Royal Charter
1926 - The Banker
1925 - Royal Charter
1924 - Easingwold
1923 - Easingwold
1922 - Purser
1921 - Eurythmic
1920 - Tangalooma
1919 - Eusebius
1918 - Outlook
1917 - Pah King
1916 - Cyklon
1915 - Burrabadeen
1914 - Anna Carlovna
1913 - Anna Carlovna
1912 - Lady Medallist
1911 - Comedy King
1910 - Master Soult
1909 - Alawa
1908 - Alawa
1907 - Poseidon
1906 - Poseidon
1905 - Marvel Loch
1904 - Nuncio
1903 - Wakeful
1902 - Wakeful
1901 - Bonnie Chiel
1900 - Kinglike
1899 - Australian Star
1898 - Cocos
|
wikipedia
|
wiki_22448_chunk_5
|
Difference-map algorithm
|
Example: logical satisfiability
Incomplete algorithms, such as stochastic local search, are widely used for finding satisfying truth assignments to boolean formulas. As an example of solving an instance of 2-SAT with the difference-map algorithm, consider the following formula (~ indicates NOT):
(q1 or q2) and (~q1 or q3) and (~q2 or ~q3) and (q1 or ~q2)
|
wikipedia
|
wiki_16888_chunk_9
|
1954–55 United States network television schedule
|
ABCReturning SeriesThe Adventures of Ozzie and Harriet
Bachelor Father
The Big Picture
Boxing from Eastern Parkway
Break the Bank
Cavalcade of America
Compass
Dollar a Second
The Dotty Mack Show
Enterprise
Fight Talk
Jamie
John Daly and the News
Kraft Television Theater
Kukla, Fran and Ollie
The Lone Ranger
Make Room for Daddy
The Martha Wright Show
Masquerade Party
The Name's the Same
The Pepsi-Cola Playhouse
The Ray Bolger Show
The Saturday Night Fights
So You Want to Lead a Band
Soldier Parade
Stop the Music
The Stork Club
The Stu Erwin Show
Treasury Men in Action
Twenty Questions
The United States Steel Hour
The Voice of Firestone
The Walter Winchell Show
You Asked For ItNew SeriesThe Adventures of Rin Tin Tin College Press ConferenceCome CloserDisneylandThe Elgin TV HourFlight No. 7The Jane Pickens ShowLet's See *The Mail StoryMr. Citizen *Ozark JubileeParis Precinct *Pond's Theater *So You Want to Lead a BandStar Tonight *TV Reader's Digest *The ViseWhat's Going On *Not returning from 1953–54:Answers for Americans
At Issue
Back That Fact
Billy Graham's Hour of Decision
Center Stage
The Comeback Story
Dr. I.Q.
The Ern Westmore Hollywood Glamour Show
The Frank Leahy Show
The George Jessel Show
Jukebox Jury
Junior Press Conference
Leave It to the Girls
Madison Square Garden Highlights
The Motorola Television Hour
Music at the Meadowbrook
The Name's the Same
Notre Dame Football
Of Many Things
The Orchid Award
Paul Whiteman's TV Teen Club
The Pride of the Family
Quick as a Flash
Showcase Theater
Sky King
Take It from Me
Talent Patrol
This is the Life
Through the Curtain
Wrestling from Rainbo Arena
|
wikipedia
|
wiki_1022_chunk_43
|
Abstraction (computer science)
|
See also
Abstraction principle (computer programming)
Abstraction inversion for an anti-pattern of one danger in abstraction
Abstract data type for an abstract description of a set of data
Algorithm for an abstract description of a computational procedure
Bracket abstraction for making a term into a function of a variable
Data modeling for structuring data independent of the processes that use it
Encapsulation for abstractions that hide implementation details
Greenspun's Tenth Rule for an aphorism about an (the?) optimum point in the space of abstractions
Higher-order function for abstraction where functions produce or consume other functions
Lambda abstraction for making a term into a function of some variable
List of abstractions (computer science)
Refinement for the opposite of abstraction in computing
Integer (computer science)
Heuristic (computer science)
|
wikipedia
|
wiki_33700_chunk_0
|
Game theory in communication networks
|
Game theory has been used as a tool for modeling and studying interactions between cognitive radios envisioned to operate in future communications systems. Such terminals will have the capability to adapt to the context they operate in, through possibly power and rate control as well as channel selection. Software agents embedded in these terminals will potentially be selfish, meaning they will only try to maximize the throughput/connectivity of the terminal they function for, as opposed to maximizing the welfare (total capacity) of the system they operate in. Thus, the potential interactions among them can be modeled through non-cooperative games. The researchers in this field often strive to determine the stable operating points of systems composed of such selfish terminals, and try to come up with a minimum set of rules (etiquette) so as to make sure that the optimality loss compared to a cooperative – centrally controlled setting – is kept at a minimum.
|
wikipedia
|
wiki_38029_chunk_5
|
La Suerte Biological Field School
|
The conservancy runs a primate field school at La Suerte which has such courses as "Primate Behavior and Ecology", "Advanced Primate Behavior and Ecology", and "Primate Conservation". The courses center on the two native primate species of the area: white-faced capuchin monkeys (Cebus capucinus) and Mantled Black Howler Monkeys (Alouatta palliata).
Daily lectures cover a variety of subjects in primatology. Students are divided into small groups to learn skills important to primate field research. Using the tropical rainforest of La Suerte as classrooms, students learn how to map a trail system; how to conduct vegetation sampling and analysis; methods of assessing food availability; and observation techniques to study the social, feeding, and ranging behavior of primates. Independent Research Projects After completing the field methods section of the class, students begin work on their own projects. Faculty members work closely with students as they undertake this portion of the course. First, each student develops a research proposal detailing the subject to be investigated and the methods to be used. Each student presents his or her proposal to the class. Next, each student must collect data for his or her project; data analysis follows. Finally, students write a final paper on their project and make an oral presentation to the class.
|
wikipedia
|
wiki_20963_chunk_6
|
Imperative logic
|
Mixed inferences The following is an example of a pure imperative inference: P1. Do both of the following: wash the dishes and clean your room!
C1. Therefore, clean your room! In this case, all the sentences making up the argument are imperatives. Not all imperative inferences are of this kind. Consider again: P1. Take all the books off the table!
P2. Foundations of Arithmetic is on the table.
C1. Therefore, take Foundations of Arithmetic off the table! Notice that this argument is composed of both imperatives and declaratives and has an imperative conclusion.
|
wikipedia
|
wiki_36396_chunk_3
|
The Redstone Acceleration & Innovation Network
|
References
Altevogt, Bruce, Sarah Hanson and Lori Nadig. Venture Philanthropy Strategies to Support Translational Research. Institute of Medicine of the National Academies. 2009 February 25.
Rimer, Skip. “Sumner M. Redstone Charitable Foundation Awards $35 Million Grant to FasterCures/The Center for Accelerating Medical Solutions.” Milken Institute. 2007 April 19. Retrieved 2009 July 1.
"Sumner M. Redstone Commits $105 Million to Fund Cancer and Burn Recovery Research and Patient Care." RedOrbit News. 18 April 2007. Retrieved 2009 July 1. http://www.redorbit.com/news/health/906598/sumner_m_redstone_commits_105_million_to_fund_cancer_and/index.html
"A 'Younger' Redstone Makes a Commitment." OnPhilanthropy News. April 25, 2007. Retrieved 2009 July 1. http://flip.onphilanthropy.com/news_onphilanthropy/2007/04/a_younger_redst.html
|
wikipedia
|
wiki_25973_chunk_4
|
Radiobiology
|
Quantitative data on the effects of ionizing radiation on human health is relatively limited compared to other medical conditions because of the low number of cases to date, and because of the stochastic nature of some of the effects. Stochastic effects can only be measured through large epidemiological studies where enough data has been collected to remove confounding factors such as smoking habits and other lifestyle factors. The richest source of high-quality data comes from the study of Japanese atomic bomb survivors. In vitro and animal experiments are informative, but radioresistance varies greatly across species.
|
wikipedia
|
wiki_8125_chunk_6
|
Alkane stereochemistry
|
The textbook explanation for the existence of the energy maximum for an eclipsed conformation in ethane is steric hindrance, but, with a C-C bond length of 154 pm and a Van der Waals radius for hydrogen of 120 pm, the hydrogen atoms in ethane are never in each other's way. The question of whether steric hindrance is responsible for the eclipsed energy maximum is a topic of debate to this day. One alternative to the steric hindrance explanation is based on hyperconjugation as analyzed within the Natural Bond Orbital framework. In the staggered conformation, one C-H sigma bonding orbital donates electron density to the antibonding orbital of the other C-H bond. The energetic stabilization of this effect is maximized when the two orbitals have maximal overlap, occurring in the staggered conformation. There is no overlap in the eclipsed conformation, leading to a disfavored energy maximum. On the other hand, an analysis within quantitative molecular orbital theory shows that 2-orbital-4-electron (steric) repulsions are dominant over hyperconjugation. A valence bond theory study also emphasizes the importance of steric effects.
|
wikipedia
|
wiki_1970_chunk_17
|
Bellman–Ford algorithm
|
described another improvement to the Bellman–Ford algorithm. His improvement first assigns some arbitrary linear order on all vertices and then partitions the set of all edges into two subsets. The first subset, Ef, contains all edges (vi, vj) such that i < j; the second, Eb, contains edges (vi, vj) such that i > j. Each vertex is visited in the order v1, v2, ..., v|V|, relaxing each outgoing edge from that vertex in Ef. Each vertex is then visited in the order v|V|, v|V|−1, ..., v1, relaxing each outgoing edge from that vertex in Eb. Each iteration of the main loop of the algorithm, after the first one, adds at least two edges to the set of edges whose relaxed distances match the correct shortest path distances: one from Ef and one from Eb. This modification reduces the worst-case number of iterations of the main loop of the algorithm from to .
|
wikipedia
|
wiki_38348_chunk_1
|
Simons Center for Geometry and Physics
|
Background
James H. Simons was the chair of the mathematics department at Stony Brook from 1968 to 1976. After deciding to leave academia, he then went on to make billions with his investment firm Renaissance Technologies. On February 27, 2008 he announced a donation totaling $60 million (including a $25 million gift two years prior) to the mathematics and physics departments. This was the largest single gift ever given to any of the SUNY schools. The gift came during Stony Brook's 50th anniversary and shortly after Gov. Spitzer announced his commitment to make Stony Brook a “flagship” of the SUNY system that would rival the nation’s most prestigious state research universities. During his announcement speech, Jim Simons said "From Archimedes to Newton to Einstein, much of the most profound work in physics has been deeply intertwined with the geometric side of mathematics. Since then, in particular with the advent of such areas as quantum field theory and string theory, developments in geometry and physics have become if anything more interrelated. The new Center will give many of the world's best mathematicians and physicists the opportunity to work and interact in an environment and an architecture carefully designed to enhance progress. We believe there is a chance that work accomplished at the Center will significantly change and deepen our understanding of the physical universe and of its basic mathematical structure." The Center results from extensive thought and planning between faculty, department chairs, and others, including Cumrun Vafa of Harvard, who directs the Simons Foundation-supported summer institutes on string theory at Stony Brook, and Isadore Singer of MIT.
|
wikipedia
|
wiki_32526_chunk_1
|
Journal of Computer-Mediated Communication
|
Editors
The following persons have been editor-in-chief of the journal:
2018–present Richard Ling (Nanyang Technological University)
2014–2017: Shyam Sundar (Pennsylvania State University)
2011–2013: Maria Bakardjieva (University of Calgary)
2008–2010: Kevin Wright (University of Oklahoma)
2005–2007: Susan Herring (Indiana University)
1994–2004: Founding Editors: Margaret McLaughlin (University of Southern California) and Sheizaf Rafaeli (Hebrew University of Jerusalem and University of Haifa) External links
|
wikipedia
|
wiki_25274_chunk_3
|
Flow computer
|
Algorithms one can expect to see implemented in a typical gas flow computer are AGA Report No. 3, AGA Report No. 7, AGA Report No. 8 in the U.S. market. Internationally, ISO 5167-1:2003 and other ISO gas standard equivalents are in widespread use. Additional to natural gas, some flow computers offer an array of density calculations for steam, oxygen, hydrogen, nitrogen, and ethylene. Complex algorithms and Equations of State for wide ranges of hydrocarbon fluids and petrochemicals can also be found in liquid flow computers. API MPMS Chapter 11.1 (2004), NIST 1045 and IUPAC for ethylene measurement, GPA TP-27 for LPGs and NGLs are amongst an array of calculations performed by liquid flow computers. Other corrections specific to particular types or manufacturers of flow meters may also be implemented. Flow computers can include meter viscosity linearization functions for various meter types such as helical turbine meters, and interface serially with ultrasonic meters to obtain flow and diagnostic data.
|
wikipedia
|
wiki_23321_chunk_3
|
Medical statistics
|
Basic concepts
For describing situations
Incidence (epidemiology) vs. Prevalence vs. Cumulative incidence
Many medical tests (such as pregnancy tests) have two possible results: positive or negative. However, tests will sometimes yield incorrect results in the form of false positives or false negatives. False positives and false negatives can be described by the statistical concepts of type I and type II errors, respectively, where the null hypothesis is that the patient will test negative. The precision of a medical test is usually calculated in the form of positive predictive values (PPVs) and negative predicted values (NPVs). PPVs and NPVs of medical tests depend on intrinsic properties of the test as well as the prevalence of the condition being tested for. For example, if any pregnancy test was administered to a population of individuals who were biologically incapable of becoming pregnant, then the test's PPV will be 0% and its NPV will be 100% simply because true positives and false negatives cannot exist in this population.
Transmission rate vs. force of infection
Mortality rate vs. standardized mortality ratio vs. age-standardized mortality rate
Pandemic vs. epidemic vs. endemic vs. syndemic
Serial interval vs. incubation period
Cancer cluster
Sexual network
Years of potential life lost
Maternal mortality rate
Perinatal mortality rate
Low birth weight ratio
|
wikipedia
|
wiki_16851_chunk_9
|
1955–56 United States network television schedule
|
Tuesday
{| class="wikitable" style="width:100%;margin-right:0;text-align:center"
|-
! colspan="2" style="background-color:#C0C0C0;text-align:center"| Network
! style="background-color:#C0C0C0;text-align:center"| 7:00 PM
! style="background-color:#C0C0C0;text-align:center"| 7:30 PM
! style="background-color:#C0C0C0;text-align:center"| 8:00 PM
! style="background-color:#C0C0C0;text-align:center"| 8:30 PM
! style="background-color:#C0C0C0;text-align:center"| 9:00 PM
! style="background-color:#C0C0C0;text-align:center"| 9:30 PM
! style="background-color:#C0C0C0;text-align:center"| 10:00 PM
! style="background-color:#C0C0C0;text-align:center"| 10:30 PM
|-
! colspan="2" | ABC
| bgcolor="#F0F0F0" | 7:00 Kukla, Fran and Ollie / 7:15 John Daly and the News
| bgcolor="#F0F0F0" colspan="2" | Warner Bros. Presents / Kings Row / Cheyenne / Casablanca| bgcolor="#F0F0F0" | The Life and Legend of Wyatt Earp| bgcolor="#F0F0F0" | Make Room for Daddy
| bgcolor="#F0F0F0" | Du Pont Cavalcade Theater
| bgcolor="#F0F0F0" | Talent Varieties| bgcolor="#abbfff" | Local Programming
|-
! rowspan="2" | CBS
! Fall
| bgcolor="#F0F0F0" rowspan="2" | 7:00 Local / 7:15 Douglas Edwards with the News
| bgcolor="#F0F0F0" rowspan="2" | Name That Tune
| bgcolor="#F0F0F0" | Navy Log| bgcolor="#FF22FF" | You'll Never Get Rich (30/28.1)
| bgcolor="#F0F0F0" rowspan="2" | Meet Millie
| bgcolor="#00FFFF" rowspan="2" | The Red Skelton Show (Color)(14/32.3)
| bgcolor="#FFFF00" rowspan="2" | The $64,000 Question (1/47.5)
| bgcolor="#F0F0F0" rowspan="2" | My Favorite Husband
|-
! Follow-up
| bgcolor="#F0F0F0" | The Phil Silvers Show
| bgcolor="F0F0F0" | Navy Log
|-
! rowspan="2" | NBC
! Fall
| bgcolor="#abbfff" rowspan="2" | Local
| bgcolor="#F0F0F0" rowspan="2" | 7:30 The Dinah Shore Show / 7:45 Plymouth News Caravan
| bgcolor="#F0F0F0" colspan="2" | The Milton Berle Show (Color)/ The Martha Raye Show / The Chevy Show (29/28.2)
| bgcolor="#FF00FF" | Fireside Theatre (24/29.0)
| bgcolor="#F0F0F0" colspan="2" | Armstrong Circle Theatre / Pontiac Presents Playwrights '56 (alternating)
| bgcolor="#F0F0F0" rowspan="2" | Big Town
|-
! Summer
| bgcolor="#F0F0F0" | Dear Phoebe
|
| bgcolor="#F0F0F0" | Sneak Preview| bgcolor="#F0F0F0" colspan="2" | The Kaiser Aluminum Hour|-
! colspan="2" | DMN
| colspan="8" bgcolor="#abbfff" | Local Programming
|}Notes: The Martha Raye Show and The Chevy Show appeared monthly. As of November 1, You'll Never Get Rich officially became The Phil Silvers Show, swapping time periods with Navy Log.
|
wikipedia
|
wiki_12925_chunk_2
|
EDA database
|
Mature design databases
Many instances of mature design databases exist in the EDA industry, both as a basis for commercial EDA tools as well as proprietary EDA tools developed by the CAD groups of major electronics companies.
IBM, Hewlett-Packard, SDA Systems and ECAD (now Cadence Design Systems), High Level Design Systems, and many other companies developed EDA specific databases over the last 20 years, and these continue to be the basis of IC-design systems today. Many of these systems took ideas from university research and successfully productized them. Most of the mature design databases have evolved to the point where they can represent netlist data, layout data, and the ties between the two. They are hierarchical to allow for reuse and smaller designs. They can support styles of layout from digital through pure analog and many styles of mixed-signal design.
|
wikipedia
|
wiki_3511_chunk_5
|
Reflexive operator algebra
|
In the case of a reflexive algebra of matrices with nonzero entries specified by a given pattern, the problem of finding the distance constant can be rephrased as a matrix-filling problem: if we fill the entries in the complement of the pattern with arbitrary entries, what choice of entries in the pattern gives the smallest operator norm? Examples
|
wikipedia
|
wiki_7809_chunk_2
|
Array of Low Energy X-ray Imaging Sensors
|
There were six EUV telescopes which were arranged in three co-aligned pairs which cover three overlapping 33° fields-of-view. At each rotation of the satellite, ALEXIS monitored the entire anti-solar hemisphere. Each telescope consisted of a spherical mirror with a Mo-Si layered synthetic microstructure (LSM) or Multilayer coating, a curved profile microchannel plate detector located at the telescope's prime focus, a UV background-rejecting filter, electron rejecting magnets at the telescope aperture, and image processing readout electronics. The geometric collecting area of each telescope was about 25 cm2, with spherical aberration limiting resolution to about 0.25°s. Analysis of the pre-flight x-ray throughput calibration data indicated that the peak on-axis effective collecting area for each telescope's response function ranges from 0.25 to 0.05 cm2. The peak area-solid angle product response function of each telescope ranged from 0.04 to 0.015 cm2-sr.
|
wikipedia
|
wiki_7395_chunk_56
|
History of chemistry
|
A Swedish chemist and disciple of Dalton, Jöns Jacob Berzelius embarked on a systematic program to try to make accurate and precise quantitative measurements and to ensure the purity of chemicals. Along with Lavoisier, Boyle, and Dalton, Berzelius is known as the father of modern chemistry. In 1828 he compiled a table of relative atomic weights, where oxygen was used as a standard, with its weight set at 100, and which included all of the elements known at the time. This work provided evidence in favor of Dalton's atomic theory - that inorganic chemical compounds are composed of atoms combined in whole number amounts. He determined the exact elementary constituents of a large number of compounds; the results strongly supported Proust's Law of Definite Proportions. In discovering that atomic weights are not integer multiples of the weight of hydrogen, Berzelius also disproved Prout's hypothesis that elements are built up from atoms of hydrogen.
Motivated by his extensive atomic weight determinations and in a desire to aid his experiments, he introduced the classical system of chemical symbols and notation with his 1808 publication Lärbok i Kemien, in which elements are abbreviated to one or two letters to make a distinct symbol from their Latin name. This system of chemical notation—in which the elements were given simple written labels, such as O for oxygen, or Fe for iron, with proportions denoted by numbers—is the same basic system used today. The only difference is that instead of the subscript number used today (e.g., H2O), Berzelius used a superscript (H2O). Berzelius is credited with identifying the chemical elements silicon, selenium, thorium, and cerium. Students working in Berzelius's laboratory also discovered lithium and vanadium.
|
wikipedia
|
wiki_31884_chunk_16
|
Polyhedral combinatorics
|
However, the Birkhoff polytope is unusual in that a complete description of its facets is available. For many other 0-1 polytopes, there are exponentially many or superexponentially many facets, and only partial descriptions of their facets are available. See also
Abstract polytope
Combinatorial commutative algebra
Matroid polytope
Order polytope
Simplicial sphere
Stable matching polytope Notes References .
.
.
.
. . In , pp. 105–110.
.
.
.
.
. .
.
.
. In . External links
.
|
wikipedia
|
wiki_29515_chunk_16
|
Edward Wright (mathematician)
|
While the first edition of Certaine Errors contained an abridged table six pages in length, in the second edition which appeared in 1610 Wright published a full table across 23 pages with figures for parallels at one-minute intervals. The table is remarkably accurate – American geography professor Mark Monmonier wrote a computer program to replicate Wright's calculations, and determined that for a Mercator map of the world wide, the greatest discrepancy between Wright's table and the program was only on the map. In the second edition Wright also incorporated various improvements, including proposals for determining the magnitude of the Earth and reckoning common linear measurements as a proportion of a degree on the Earth's surface "that they might not depend on the uncertain length of a barley-corn"; a correction of errors arising from the eccentricity of the eye when making observations using the cross-staff; amendments in tables of declinations and the positions of the sun and the stars, which were based on observations he had made together with Christopher Heydon using a quadrant; and a large table of the variation of the compass as observed in different parts of the world, to show that it is not caused by any magnetic pole. He also incorporated a translation of Rodrigo Zamorano's Compendio de la Arte de Navegar (Compendium of the Art of Navigation, Seville, 1581; 2nd ed., 1588).
|
wikipedia
|
wiki_4287_chunk_13
|
Max Planck Institute for Extraterrestrial Physics
|
Many experiments of the Max-Planck-Institut für extraterrestrische Physik (MPE) have to be carried out above the dense Earth's atmosphere using aircraft, rockets, satellites and space probes. In the early days experiments were also flown on balloons. To run advanced extraterrestrial physics and state-of-the-art experimental astrophysics, the institute continues to develop high-tech instrumentation in-house. This includes detectors, spectrometers, and cameras as well as telescopes and complete payloads (e.g. ROSAT and eROSITA) and even entire satellites (as in case of AMPTE and EQUATOR-S). For this purpose the technical and engineering departments are of particular importance for the institute's research work.
|
wikipedia
|
wiki_6686_chunk_2
|
Computational science
|
Computational science is now commonly considered a third mode of science , complementing and adding to experimentation/observation and theory (see image on the right). Here, one defines a system as a potential source of data, an experiment as a process of extracting data from a system by exerting it through its inputs and a model (M) for a system (S) and an experiment (E) as anything to which E can be applied in order to answer questions about S. A computational scientist should be capable of:
recognizing complex problems
adequately conceptualizing the system containing these problems
designing a framework of algorithms suitable for studying this system: the simulation
choosing a suitable computing infrastructure (parallel computing/grid computing/supercomputers)
hereby, maximizing the computational power of the simulation
assessing to what level the output of the simulation resembles the systems: the model is validated
adjusting the conceptualization of the system accordingly
repeat the cycle until a suitable level of validation is obtained: the computational scientist trusts that the simulation generates adequately realistic results for the system under the studied conditions
Substantial effort in computational sciences has been devoted to developing algorithms, efficient implementation in programming languages, and validating computational results. A collection of problems and solutions in computational science can be found in Steeb, Hardy, Hardy, and Stoop (2004).
|
wikipedia
|
wiki_10215_chunk_0
|
European Network for Training and Research in Electrical Engineering
|
Exchange programs for Electrical Engineering students between 18 universities in Europe. It is also known as Entree. Their members are:
Chalmers Lindholmen University College (Sweden)
University of Aalborg (Denmark)
Heriot-Watt University (United Kingdom)
Brunel University (United Kingdom)
Delft University of Technology (Netherlands)
Université Libre de Bruxelles (Belgium)
Technische Universität Dresden (Germany)
Karlsruhe Institute of Technology (Germany)
École Supérieure d'Ingénieurs en Électronique et Électrotechnique Paris (France)
École Supérieure d'Ingénieurs en Électronique et Électrotechnique Amiens (France)
École polytechnique fédérale de Lausanne (Switzerland)
Brno University of Technology (Czech Republic)
National Technical University of Athens (Greece)
Politecnico di Milano (Italy)
Pontifical Comillas University of Madrid (Spain)
University of Valladolid (Spain)
Institut Méditerranéen de Technologie (France)
Politecnico di Torino (Italy)
|
wikipedia
|
wiki_7091_chunk_5
|
Feature (machine learning)
|
Higher-level features can be obtained from already available features and added to the feature vector; for example, for the study of diseases the feature 'Age' is useful and is defined as Age = 'Year of death' minus 'Year of birth' . This process is referred to as feature construction. Feature construction is the application of a set of constructive operators to a set of existing features resulting in construction of new features. Examples of such constructive operators include checking for the equality conditions {=, ≠}, the arithmetic operators {+,−,×, /}, the array operators {max(S), min(S), average(S)} as well as other more sophisticated operators, for example count(S,C) that counts the number of features in the feature vector S satisfying some condition C or, for example, distances to other recognition classes generalized by some accepting device. Feature construction has long been considered a powerful tool for increasing both accuracy and understanding of structure, particularly in high-dimensional problems. Applications include studies of disease and emotion recognition from speech.
|
wikipedia
|
wiki_14184_chunk_10
|
Ottawa-Carleton Educational Space Simulation
|
Complete details regarding the EEP are available on the OCESS Website. Planetarium Program
The Planetarium Program involves transporting the OCESS's inflatable planetarium to elementary or high schools across the Ottawa region and delivering a presentation involving constellations, luminosity, temperature of stars, and a discussion about light pollution. The standard presentation is designed to complement the Grade 9 Ontario Science Curriculum, but the experience is equally suitable for a younger audience. Complete details regarding the Planetarium Program are available on the OCESS Website.
|
wikipedia
|
wiki_33072_chunk_12
|
Pleiades (supercomputer)
|
Gallery In popular culture
In the 2015 film The Martian, astrodynamicist Rich Purnell uses the Pleiades supercomputer to verify calculations for a gravity assist maneuver for a spacecraft, in order to rescue an astronaut stranded on Mars. Unlike what is shown in the movie, one need not be physically present inside the racks to run the computations; to submit jobs a user can connect from a remote location via ssh, while employing a SecurID. References External links NASA Pleiades homepage
NASA Advanced Supercomputing Division homepage
NASA's HECC Project homepage
NASA homepage
|
wikipedia
|
wiki_3058_chunk_13
|
Civil-military co-operation
|
Summary
"This CECIL-tool is ideal for the CIMIC branches to manage their information which assists to stabilize the mission area. Information sharing through one database is essential for civilian and military partners." CECIL is designed to focus on the most important issues. The Afghan Country Stability Picture gives operators at all levels the relevant facts in an efficient and convenient package. The output of the working group so far is quite promising. The working group will be mandated for another year to continue working on the new established CIMIC information-sharing platform. Additional information
|
wikipedia
|
wiki_372_chunk_3
|
Microcode
|
Overview
The lowest layer in a computer's software stack is traditionally raw machine code instructions for the processor. In microcoded processors, the microcode fetches and executes those instructions. To avoid confusion, each microprogram-related element is differentiated by the micro prefix: microinstruction, microassembler, microprogrammer, microarchitecture, etc.
|
wikipedia
|
wiki_14275_chunk_4
|
Business simulation game
|
Real-world applications
Because business simulations simulate real-world systems, they are often used in management, marketing, economics and hospitality education. Some benefits of business simulations are that they permit students to experience and test themselves in situations before encountering them in real life, they permit students to experiment and test hypotheses, and that subjects seem more real to them than when taught passively from the blackboard. They are also used extensively in the professional world to train workers in the financial industries, hospitality and management, and to study economic models (an association of professionals, ABSEL, exists for the sole purpose of promoting their use), with some simulations having in excess of 10,000 variables. Economic simulations have even been used in experiments, such as those done by Donald Broadbent on learning and cognition that revealed how people often have an aptitude for mastering systems without necessarily comprehending the underlying principles. Other games are used to study the behavior of consumers.
|
wikipedia
|
wiki_21524_chunk_6
|
Little man computer
|
The table below shows a typical numeric instruction set and the equivalent mnemonic codes. Examples Using Numeric Instruction Codes
This program (instruction 901 to instruction 000) is written just using numeric codes. The program takes two numbers as input and outputs the difference. Notice that execution starts at Mailbox 00 and finishes at Mailbox 07. The disadvantages of programming the LMC using numeric instruction codes are discussed below.
|
wikipedia
|
wiki_25966_chunk_1
|
Michael Meeks (software developer)
|
Meeks is a free software hacker who has contributed a lot of time to decreasing program load time. He created the direct binding, hashvals, and dynsort implementations for GNU Binutils and glibc. Most of this work was focused at making OpenOffice.org and now its fork LibreOffice start faster, and was later subsumed into the "-hash-style=gnu" linking optimization. His work on iogrind also allows applications to be profiled and optimized to first-time (or 'cold') start far more rapidly .
|
wikipedia
|
wiki_4695_chunk_1
|
Buchberger's algorithm
|
Input A set of polynomials F that generates I
Output A Gröbner basis G for I
G := F
For every fi, fj in G, denote by gi the leading term of fi with respect to the given ordering, and by aij the least common multiple of gi and gj.
Choose two polynomials in G and let Sij = (aij / gi) fi − (aij / gj) fj (Note that the leading terms here will cancel by construction).
Reduce Sij, with the multivariate division algorithm relative to the set G until the result is not further reducible. If the result is non-zero, add it to G.
Repeat steps 2-4 until all possible pairs are considered, including those involving the new polynomials added in step 4.
Output G
|
wikipedia
|
wiki_7997_chunk_37
|
Advanced Idea Mechanics
|
Ultimate Marvel
In the Ultimate Marvel reality, A.I.M. commissioned Mad Thinker to steal Cerebro from the X-Men and frame the Fantastic Four, as seen in the Ultimate X4 mini-series. Ultimate A.I.M.'s full purpose and function has yet to be revealed. The miniseries Ultimate Vision introduces A.I.M. as composed of several directorates spread across the globe, with George Tarleton as an A.I.M. leader on an orbital research facility. Tarleton and his team attempted to take control of a Gah Lak Tus module that was left behind in orbit after the swarm was driven away. Being unable to do so on their own, they lured Vision to the station to help them by claiming they would use the knowledge to order the Gah Lak Tus swarm to self-destruct. Once the cyborg Tarleton had connected to the module using Vision, he had the module fire an energy beam at her. Tarleton then incorporated the Gah Lak Tus' circuitry into his own body, but it has seemingly taken him over, transforming him more into a machine, with a monstrous appearance. He has since taken over the entire station remotely and has set it to plummet out of orbit, along with the Gah Lak Tus module, which he says has "unfinished business on Earth." Ultimately, Tarleton was broken free of the module's control and helped the Vision and the Falcon a.k.a. Dr. Samuel Wilson in destroying the module.
|
wikipedia
|
wiki_6927_chunk_4
|
Computational topology
|
SnapPea implements an algorithm to convert a planar knot or link diagram into a cusped triangulation. This algorithm has a roughly linear run-time in the number of crossings in the diagram, and low memory profile. The algorithm is similar to the Wirthinger algorithm for constructing presentations of the fundamental group of link complements given by planar diagrams. Similarly, SnapPea can convert surgery presentations of 3-manifolds into triangulations of the presented 3-manifold.
D. Thurston and F. Costantino have a procedure to construct a triangulated 4-manifold from a triangulated 3-manifold. Similarly, it can be used to construct surgery presentations of triangulated 3-manifolds, although the procedure is not explicitly written as an algorithm in principle it should have polynomial run-time in the number of tetrahedra of the given 3-manifold triangulation.
S. Schleimer has an algorithm which produces a triangulated 3-manifold, given input a word (in Dehn twist generators) for the mapping class group of a surface. The 3-manifold is the one that uses the word as the attaching map for a Heegaard splitting of the 3-manifold. The algorithm is based on the concept of a layered triangulation.
|
wikipedia
|
wiki_4937_chunk_5
|
Network theory
|
Since the 1970s, the empirical study of networks has played a central role in social science, and many of the mathematical and statistical tools used for studying networks have been first developed in sociology. Amongst many other applications, social network analysis has been used to understand the diffusion of innovations, news and rumors. Similarly, it has been used to examine the spread of both diseases and health-related behaviors. It has also been applied to the study of markets, where it has been used to examine the role of trust in exchange relationships and of social mechanisms in setting prices. It has been used to study recruitment into political movements, armed groups, and other social organizations. It has also been used to conceptualize scientific disagreements as well as academic prestige. More recently, network analysis (and its close cousin traffic analysis) has gained a significant use in military intelligence, for uncovering insurgent networks of both hierarchical and leaderless nature.
|
wikipedia
|
wiki_36759_chunk_0
|
Leiden Open Variation Database
|
The Leiden Open Variation Database (LOVD) is a free, flexible web-based open source database developed in the Leiden University Medical Center in the Netherlands, designed to collect and display variants in the DNA sequence. The focus of an LOVD is usually the combination between a gene and a genetic (heritable) disease. All sequence variants found in individuals are collected in the database, together with information about whether they could be causally connected to the disease (i.e. a disease-causing variant or mutation) or not (i.e. a non-disease causing variant). Specialized doctors (clinical geneticists) use LOVDs to diagnose and advise patients carrying a genetic disease. Ideally, if a patient has been screened for mutations and one has been found, information in LOVD can predict the progress of the disease.
|
wikipedia
|
wiki_33706_chunk_4
|
Domain-specific multimodeling
|
Enterprise systems based on multiple domain-specific languages are abundant. Languages with a metamodel defined in the Extensible Markup Language (XML) enjoy particularly widespread adoption. To illustrate development with multiple languages, we will draw an example from a case study: The Apache Open For Business (OFBiz) system. Briefly stated, OFBiz is an enterprise resource planning system that includes standard components such as inventory, accounting, e-commerce etc. These components are implemented by a mixture of XML-based languages and regular Java code. As an example, let us focus on the content management component, particularly a use case in which the administrative user creates an online web survey as shown in the screenshot below. We will refer to this example as the create survey example.
|
wikipedia
|
wiki_25185_chunk_5
|
Market engineering
|
Evaluation
Having designed the market, it is tested upon its technical and economic properties. The evaluation stage comprises functionality tests of a software prototype to ensure its correctness, economic tests to measure the outcome performance of the market, and an assessment of the business model. Functionality tests are made to ensure that the prototype system works as it is designed. In other words, these tests ensure that the system correctly reflects the institutional rules. The objective of the economic tests is to ascertain whether or not the electronic market attains the desired economic outcome. This phase is supported by analytical and experimental evaluation methods. Experimental methods consist of laboratory experiments, numerical simulations, or agent-based simulations. Tools for this kind of evaluation are e.g. ZTree, Repast, MES and AMASE as part of the meet2trade system and the simulation tool jCASE .
After functional and economic tests are performed, additional pilot runs with the software prototype are made. These runs provide information about the agents’ acceptance of the market and, if necessary, allow the engineer to adjust the underlying institutional rules or the prototype system.
|
wikipedia
|
wiki_5951_chunk_1
|
Irreducibility (mathematics)
|
A polynomial over a field may be an irreducible polynomial if it cannot be factored over that field.
In abstract algebra, irreducible can be an abbreviation for irreducible element of an integral domain; for example an irreducible polynomial.
In representation theory, an irreducible representation is a nontrivial representation with no nontrivial proper subrepresentations. Similarly, an irreducible module is another name for a simple module.
Absolutely irreducible is a term applied to mean irreducible, even after any finite extension of the field of coefficients. It applies in various situations, for example to irreducibility of a linear representation, or of an algebraic variety; where it means just the same as irreducible over an algebraic closure.
In commutative algebra, a commutative ring R is irreducible if its prime spectrum, that is, the topological space Spec R, is an irreducible topological space.
A matrix is irreducible if it is not similar via a permutation to a block upper triangular matrix (that has more than one block of positive size). (Replacing non-zero entries in the matrix by one, and viewing the matrix as the adjacency matrix of a directed graph, the matrix is irreducible if and only if such directed graph is strongly connected.) A detailed definition is given here.
Also, a Markov chain is irreducible if there is a non-zero probability of transitioning (even if in more than one step) from any state to any other state.
In the theory of manifolds, an n-manifold is irreducible if any embedded (n − 1)-sphere bounds an embedded n-ball. Implicit in this definition is the use of a suitable category, such as the category of differentiable manifolds or the category of piecewise-linear manifolds. The notions of irreducibility in algebra and manifold theory are related. An n-manifold is called prime, if it cannot be written as a connected sum of two n-manifolds (neither of which is an n-sphere). An irreducible manifold is thus prime, although the converse does not hold. From an algebraist's perspective, prime manifolds should be called "irreducible"; however, the topologist (in particular the 3-manifold topologist) finds the definition above more useful. The only compact, connected 3-manifolds that are prime but not irreducible are the trivial 2-sphere bundle over S1 and the twisted 2-sphere bundle over S1. See, for example, Prime decomposition (3-manifold).
A topological space is irreducible if it is not the union of two proper closed subsets. This notion is used in algebraic geometry, where spaces are equipped with the Zariski topology; it is not of much significance for Hausdorff spaces. See also irreducible component, algebraic variety.
In universal algebra, irreducible can refer to the inability to represent an algebraic structure as a composition of simpler structures using a product construction; for example subdirectly irreducible.
A 3-manifold is P²-irreducible if it is irreducible and contains no 2-sided (real projective plane).
An irreducible fraction (or fraction in lowest terms) is a vulgar fraction in which the numerator and denominator are smaller than those in any other equivalent fraction.
|
wikipedia
|
wiki_549_chunk_10
|
Search algorithm
|
Another important sub-class consists of algorithms for exploring the game tree of multiple-player games, such as chess or backgammon, whose nodes consist of all possible game situations that could result from the current situation. The goal in these problems is to find the move that provides the best chance of a win, taking into account all possible moves of the opponent(s). Similar problems occur when humans or machines have to make successive decisions whose outcomes are not entirely under one's control, such as in robot guidance or in marketing, financial, or military strategy planning. This kind of problem — combinatorial search — has been extensively studied in the context of artificial intelligence. Examples of algorithms for this class are the minimax algorithm, alpha–beta pruning, and the A* algorithm and its variants.
|
wikipedia
|
wiki_7184_chunk_0
|
Ihara zeta function
|
In mathematics, the Ihara zeta function is a zeta function associated with a finite graph. It closely resembles the Selberg zeta function, and is used to relate closed walks to the spectrum of the adjacency matrix. The Ihara zeta function was first defined by Yasutaka Ihara in the 1960s in the context of discrete subgroups of the two-by-two p-adic special linear group. Jean-Pierre Serre suggested in his book Trees that Ihara's original definition can be reinterpreted graph-theoretically. It was Toshikazu Sunada who put this suggestion into practice in 1985. As observed by Sunada, a regular graph is a Ramanujan graph if and only if its Ihara zeta function satisfies an analogue of the Riemann hypothesis.
|
wikipedia
|
wiki_2296_chunk_1
|
Resonance (chemistry)
|
Overview
Under the framework of valence bond theory, resonance is an extension of the idea that the bonding in a chemical species can be described by a Lewis structure. For many chemical species, a single Lewis structure, consisting of atoms obeying the octet rule, possibly bearing formal charges, and connected by bonds of positive integer order, is sufficient for describing the chemical bonding and rationalizing experimentally determined molecular properties like bond lengths, angles, and dipole moment. However, in some cases, more than one Lewis structure could be drawn, and experimental properties are inconsistent with any one structure. In order to address this type of situation, several contributing structures are considered together as an average, and the molecule is said to be represented by a resonance hybrid in which several Lewis structures are used collectively to describe its true structure. For instance, in NO2–, nitrite anion, the two N–O bond lengths are equal, even though no single Lewis structure has two N–O bonds with the same formal bond order. However, its measured structure is consistent with a description as a resonance hybrid of the two major contributing structures shown above: it has two equal N–O bonds of 125 pm, intermediate in length between a typical N–O single bond (145 pm in hydroxylamine, H2N–OH) and N–O double bond (115 pm in nitronium ion, [O=N=O]+). According to the contributing structures, each N–O bond is an average of a formal single and formal double bond, leading to a true bond order of 1.5. By virtue of this averaging, the Lewis description of the bonding in NO2– is reconciled with the experimental fact that the anion has equivalent N–O bonds.
|
wikipedia
|
wiki_1166_chunk_11
|
Maple (software)
|
Examples of Maple code
The following code, which computes the factorial of a nonnegative integer, is an example of an imperative programming construct within Maple: myfac := proc(n::nonnegint)
local out, i;
out := 1;
for i from 2 to n do
out := out * i
end do;
out
end proc;
Simple functions can also be defined using the "maps to" arrow notation:
myfac := n -> product(i, i = 1..n);
|
wikipedia
|
wiki_29312_chunk_45
|
Network science
|
Since the 1970s, the empirical study of networks has played a central role in social science, and many of the mathematical and statistical tools used for studying networks have been first developed in sociology. Amongst many other applications, social network analysis has been used to understand the diffusion of innovations, news and rumors. Similarly, it has been used to examine the spread of both diseases and health-related behaviors. It has also been applied to the study of markets, where it has been used to examine the role of trust in exchange relationships and of social mechanisms in setting prices. Similarly, it has been used to study recruitment into political movements and social organizations. It has also been used to conceptualize scientific disagreements as well as academic prestige. In the second language acquisition literature, it has an established history in study abroad research, revealing how peer learner interaction networks influence their language progress. More recently, network analysis (and its close cousin traffic analysis) has gained a significant use in military intelligence, for uncovering insurgent networks of both hierarchical and leaderless nature. In criminology, it is being used to identify influential actors in criminal gangs, offender movements, co-offending, predict criminal activities and make policies.
|
wikipedia
|
wiki_5854_chunk_3
|
British Aerospace EAP
|
Background
The origins of the EAP can be found within the Agile Combat Aircraft (ACA) programme performed by British Aerospace (BAe) during the late 1970s and early 1980s. It is known that ACA had involved the combining of several years of private venture research conducted by BAe, costed at around £25 million, together with similar contemporary studies that had been performed by West German aircraft manufacturer Messerschmitt-Bölkow-Blohm (MBB) (such as the TKF-90 project) and Italian aviation company Aeritalia. Seeking to develop a new generation of fighter aircraft to equip the various air forces of Western Europe, the three companies had recognised the benefits of cooperation and the sharing of critical technologies to achieve this goal. Technologies which became central to the ACA included full-authority digital fly-by-wire controls, which would enable a significantly aerodynamically unstable aircraft to be flown, and multiple advanced manufacturing processes.
|
wikipedia
|
wiki_12129_chunk_16
|
Chennai Mathematical Institute
|
Till 2006, students received their B.Sc. and M.Sc. degrees from MPBOU and their Ph.D. degrees from Madras University.
CMI conducts its academic programmes in conjunction with IMSc, so students from either institute can take courses at the other.
CMI has agreements with TIFR (Tata Institute of Fundamental Research) and with the Indian Statistical Institutes in Delhi, Bangalore, Chennai and Kolkata, for cooperation on the furtherance of mathematical sciences.
The physics programmes are run in conjunction with IMSc and IGCAR. The physics students spend one summer in HBCSE (under TIFR) in Mumbai and another in IGCAR, Kalpakkam, garnering practical experience.
CMI has a Memorandum of Understanding with the École Normale Supérieure in Paris. Under this memorandum, research scholars from the ENS spend a semester in CMI. In exchange, three B.Sc. Mathematics students, at the end of their third year, go to the ENS for two months.
The institute has a similar arrangement with École Polytechnique in Paris, whereby top-ranking senior B.Sc. Physics students spend the summer in Paris working with the faculty at École Polytechnique.
CMI has a Memorandum of Understanding with IFMR, the Institute of Financial Management and Research, located in Nungambakkam, Chennai. Students from CMI getting a CGPA of more than 8.50 are offered direct admission to IFMR's one-year programme in Financial Mathematics, which is sponsored by ICICI Bank. Faculty from CMI are involved in teaching this programme. In exchange, CMI gets its Economics professor from IFMR.
CMI is a part of ReLaX, an Indo-French joint research unit dedicated to research in theoretical computer science, its applications and its interactions with mathematics. This collaboration allows for collaborative work in computer science, academic visits for professors and graduate students, summer internship programs for students, and organizing conferences in the subject.
CMI has had two sponsored research projects with Honeywell Technology Solutions, Bangalore, both in the area of formal verification.
|
wikipedia
|
wiki_1964_chunk_11
|
James Gregory (mathematician)
|
Mathematics
The following excerpt is from the Pantologia. A new (cabinet) cyclopædia (1813)
Mr. James Gregory was a man of a very acute and penetrating genius. ...The most brilliant part of his character was that of his mathematical genius as an inventor, which was of the first order; as will appear by... his inventions and discoveries [which include] quadrature of the circle and hyperbola, by an infinite converging series; his method for the transformation of curves; a geometrical demonstration of Lord Brouncker's series for squaring the hyperbola—his demonstration that the meridian line is analogous to a scale of logarithmic tangents of the half complements of the latitude; he also invented and demonstrated geometrically, by help of the hyperbola, a very simple converging series for making the logarithms; he sent to Mr. Collins the solution of the famous Keplerian problem by an infinite series; he discovered a method of drawing Tangents to curves geometrically, without any previous calculations; a rule for the direct and inverse method of tangents, which stands upon the same principle (of exhaustions) with that of fluxions, and differs not much from it in the manner of application; a series for the length of the arc of a circle from the tangent, and vice versa; as also for the secant and logarithmic tangent and secant, and vice versa. These, with others, for measuring the length of the elliptic and hyperbolic curves, were sent to Mr. Collins, in return for some received from him of Newton's, in which he followed the elegant example of this author, in delivering his series in simple terms, independent of each other.
|
wikipedia
|
wiki_21428_chunk_4
|
Energy Biosciences Institute
|
Using a former industrial fermentation process, EBI scientists have developed a way to extract the acetone, butanol, and ethanol from a fermentation mixture and reformulate the products using chemical catalysts to produce diesel-like fuels.
Designing modified yeast strains that could simultaneously use 5-carbon and 6-carbon sugars, an important step toward creating a platform EBI yeast strain for metabolic engineering
Developing a series of chemical steps that convert sugars to diesel directly, without fermentation
Holding annual conferences on the global bioeconomy and biofuel law and regulation
Creating a 320-acre farm at the University of Illinois, where scientists monitor the gases emitted, the mineral content of water runoff, soil carbon, and plant and animal biodiversity
Sharing and collaborating with scientists and visitors from the United States and many other countries, including Brazil, Norway, Argentina, China, the Netherlands, Germany, and India, at EBI's headquarters in Berkeley and the University of Illinois at Urbana-Champaign.
|
wikipedia
|
wiki_6637_chunk_65
|
FOCAL (programming language)
|
External links
FOCAL source code, FOCAL source for several programs, including Lunar Lander, Sumer Game, and others
DEC's FOCAL 1969 Promotional Booklet
The Computer History Simulation Project (Focal is available as a free download here)
ftp://www.cozx.com/pub/langs/focal.tar.gz C-source version that runs under several operating systems, including Linux
the C-source for a modern DOS version suitable for teaching
Abramov V.A. Dialogue language FOCAL (in Russian)
Osetinsky L.G. FOCAL for mini-computers (in Russian)
Фокал снаружи и изнутри. (пишется) – FOCAL outside and inside. (in progress) (in Russian)
Файл справки к фокалу-1б – Help file for FOCAL-1B (in Russian)
|
wikipedia
|
wiki_5511_chunk_1
|
Topological sorting
|
Examples
The canonical application of topological sorting is in scheduling a sequence of jobs or tasks based on their dependencies. The jobs are represented by vertices, and there is an edge from x to y if job x must be completed before job y can be started (for example, when washing clothes, the washing machine must finish before we put the clothes in the dryer). Then, a topological sort gives an order in which to perform the jobs. A closely related application of topological sorting algorithms was first studied in the early 1960s in the context of the PERT technique for scheduling in project management. In this application, the vertices of a graph represent the milestones of a project, and the edges represent tasks that must be performed between one milestone and another. Topological sorting forms the basis of linear-time algorithms for finding the critical path of the project, a sequence of milestones and tasks that controls the length of the overall project schedule.
|
wikipedia
|
wiki_26493_chunk_162
|
Comparison of programming languages (associative array)
|
irb(main):007:0> ### iterate over keys and values
irb(main):008:0* phonebook.each {|key, value| puts key + " => " + value}
Sally Smart => 555-9999
John Doe => 555-1212
J. Random Hacker => 553-1337
=> {"Sally Smart"=>"555-9999", "John Doe"=>"555-1212", "J. Random Hacker"=>"553-1337"}
irb(main):009:0> ### iterate keys only
irb(main):010:0* phonebook.each_key {|key| puts key}
Sally Smart
John Doe
J. Random Hacker
=> {"Sally Smart"=>"555-9999", "John Doe"=>"555-1212", "J. Random Hacker"=>"553-1337"}
irb(main):011:0> ### iterate values only
irb(main):012:0* phonebook.each_value {|value| puts value}
555-9999
555-1212
553-1337
=> {"Sally Smart"=>"555-9999", "John Doe"=>"555-1212", "J. Random Hacker"=>"553-1337"}
|
wikipedia
|
wiki_16650_chunk_2
|
Programming the Universe
|
In the space of 221 dense, frequently thrilling and occasionally exasperating pages, … tackles computer logic, thermodynamics, chaos theory, complexity, quantum mechanics, cosmology, consciousness, sex and the origin of life — throwing in, for good measure, a heartbreaking afterword that repaints the significance of all that has come before. The source of all this intellectual mayhem is the kind of Big Idea so prevalent in popular science books these days. Lloyd, a professor of mechanical engineering at M.I.T., takes as his topic the fundamental workings of the universe…, which he thinks has been horribly misunderstood. Scientists have looked at it as a ragtag collection of particles and fields while failing to see what it is as a majestic whole: an enormous computer.
|
wikipedia
|
wiki_6604_chunk_5
|
Crime Writers of Canada Awards of Excellence
|
Best Juvenile or Young Adult Crime Book
1994 - John Dowd, Abalone Summer
1995 - James Heneghan, Torn Away
1996 - Norah McClintock, Mistaken Identity
1997 - Linda Bailey, How Can a Frozen Detective Stay Hot on the Trail?
1998 - Norah McClintock, The Body in the Basement
1999 - Norah McClintock, Sins of the Father
2000 - Linda Bailey, How Can a Brilliant Detective Shine in the Dark?
2001 - Tim Wynne-Jones, The Boy in the Burning House
2002 - Norah McClintock, Scared to Death
2003 - Norah McClintock, Break and Enter
2004 - Graham McNamee, Acceleration
2005 - Carrie Mac, The Beckoners
2006 - Vicki Grant, Quid Pro Quo
2007 - Sean Cullen, Hamish X and the Cheese Pirates
2008 - Shane Peacock, Eye of the Crow
2009 - Sharon E. McKay, War Brothers
2010 - Barbara Haworth-Attard, Haunted
2011 - Alice Kuipers, The Worst Thing She Ever Did
2012 - Tim Wynne-Jones, Blink & Caution
2013 - Shane Peacock, Becoming Holmes
2014 - Elizabeth MacLeod, Bones Never Lie
2015 - Sigmund Brouwer, Dead Man's Switch
2016 - Stephanie Tromly, Trouble Is a Friend of Mine
2017 - Gordon Korman, Masterminds
2018 - Linwood Barclay, Chase: Get Ready to Run
2019 - Linwood Barclay, Escape
2020 - Tom Ryan, Keep This to Yourself
2021 - Frances Greenslade, Red Fox Road
|
wikipedia
|
wiki_24026_chunk_5
|
Multiservice tactical brevity code
|
D
Dakota No air to ground (ATG) ordnance remaining.
Dash (#) Aircraft position within a flight. Use if specific call sign is unknown.
Data Standby for improved data modem (IDM) data message concerning (object) at stated location.
Datum Last known position of a submarine contact after contact was lost.
Deadeye Informative call by an airborne laser designator indicating the laser/IR system is inoperative.
Deadstick No propulsive power due to loss of the engine/s. - see Deadstick landing
Declare Inquiry as to the identification of a specified track(s), target(s), or correlated group.
Defensive/defending Aircraft is in a defensive position and maneuvering with reference to an active threat.
De-louse Directive to detect and identify unknown aircraft trailing friendly aircraft.
Deploy Directive to maneuver to briefed positioning.
Divert Proceed to alternate mission or base.
Dogbox Area within which units may interfere with or be endangered by ASW torpedoes
Dolly Tactical Digital Information Link C [Link-4A] (Link-4A/TADIL C).
Drag/dragging
(USAF) Target stabilized at 0 to 60 degrees aspect. (direction)
(Naval) Target stabilized at 120 to 180 degrees aspect.
Drop/dropping
Directive/informative call to stop monitoring a specified emitter/target and resume search responsibilities.
Remove the emitter/target from tactical picture/track stores.
Duck Tactical air-launched decoy (TALD).
Dustbin Nuclear ASW depth charge.
|
wikipedia
|
wiki_12037_chunk_18
|
Linear network coding
|
There are new methods emerging to use Network Coding in multiaccess systems to develop Software Defined Wire Area Networks (SD-WANs) that can offer lower delay, jitter and high robustness. The proposal mentions that the method is agnostic to underlying technologies like LTE, Ethernet, 5G. Maturity & Issues
Since this area is relatively new and the mathematical treatment of this subject is
currently limited to a handful of people, network coding has yet found its way to
commercialization in products and services. It is likely that this
subject will not prevail, and cease as a good mathematical exercise.
|
wikipedia
|
wiki_13442_chunk_3
|
Karmarkar's algorithm
|
Since the actual algorithm is rather complicated, researchers looked for a more intuitive version of it, and in 1985 developed affine scaling, a version of Karmarkar's algorithm that uses affine transformations where Karmarkar used projective ones, only to realize four years later that they had rediscovered an algorithm published by Soviet mathematician I. I. Dikin in 1967. The affine-scaling method can be described succinctly as follows. The affine-scaling algorithm, while applicable to small scale problems, is not a polynomial time algorithm.
stopping criterion, . return unbounded
end if
end do Example Consider the linear program
|
wikipedia
|
wiki_793_chunk_43
|
Linear programming
|
Simplex pivot methods preserve primal (or dual) feasibility. On the other hand, criss-cross pivot methods do not preserve (primal or dual) feasibilitythey may visit primal feasible, dual feasible or primal-and-dual infeasible bases in any order. Pivot methods of this type have been studied since the 1970s. Essentially, these methods attempt to find the shortest pivot path on the arrangement polytope under the linear programming problem. In contrast to polytopal graphs, graphs of arrangement polytopes are known to have small diameter, allowing the possibility of strongly polynomial-time criss-cross pivot algorithm without resolving questions about the diameter of general polytopes.
|
wikipedia
|
wiki_890_chunk_54
|
Gray code
|
We can formalize the concept of monotone Gray codes as follows: consider the partition of the hypercube into levels of vertices that have equal weight, i.e. for . These levels satisfy . Let be the subgraph of induced by , and let be the edges in . A monotonic Gray code is then a Hamiltonian path in such that whenever comes before in the path, then . An elegant construction of monotonic n-digit Gray codes for any n is based on the idea of recursively building subpaths of length having edges in . We define , whenever or , and
|
wikipedia
|
wiki_50_chunk_33
|
Binary-coded decimal
|
In more recent computers such capabilities are almost always implemented in software rather than the CPU's instruction set, but BCD numeric data are still extremely common in commercial and financial applications. There are tricks for implementing packed BCD and zoned decimal add–or–subtract operations using short but difficult to understand sequences of word-parallel logic and binary arithmetic operations. For example, the following code (written in C) computes an unsigned 8-digit packed BCD addition using 32-bit binary operations:
uint32_t BCDadd(uint32_t a, uint32_t b)
{
uint32_t t1, t2; // unsigned 32-bit intermediate values
|
wikipedia
|
wiki_2443_chunk_120
|
Quantitative genetics
|
To visualize the pattern in full cousin equations, start the series with the full sib equation re-written in iteration form: ft = (1/4)[2 f(t-1) + f(t-2) + 1 ]. Notice that this is the "essential plan" of the last term in each of the cousin iterative forms: with the small difference that the generation indices increment by "1" at each cousin "level". Now, define the cousin level as k = 1 (for First cousins), = 2 (for Second cousins), = 3 (for Third cousins), etc., etc.; and = 0 (for Full Sibs, which are "zero level cousins"). The last term can be written now as: (1/4) [ 2 f(t-(1+k)) + f(t-(2+k)) + 1] . Stacked in front of this last term are one or more iteration increments in the form (1/4) [ 3 f(t-j) + ... , where j is the iteration index and takes values from 1 ... k over the successive iterations as needed. Putting all this together provides a general formula for all levels of full cousin possible, including Full Sibs. For kth level full cousins, f{k}t = Ιterj = 1k { (1/4) [ 3 f(t-j) + }j + (1/4) [ 2 f(t-(1+k)) + f(t-(2+k)) + 1] . At the commencement of iteration, all f(t-x) are set at "0", and each has its value substituted as it is calculated through the generations. The graphs to the right show the successive inbreeding for several levels of Full Cousins.
|
wikipedia
|
wiki_3472_chunk_76
|
List of important publications in computer science
|
See also
DBLP (Digital Bibliography & Library Project in computer science)
List of open problems in computer science
List of computer science journals
List of computer science conferences
The Collection of Computer Science Bibliographies
Paris Kanellakis Award, a prize given to honor specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. References
|
wikipedia
|
wiki_3661_chunk_1
|
Homological conjectures in commutative algebra
|
The Zero Divisor Theorem. If has finite projective dimension and is not a zero divisor on , then is not a zero divisor on .
Bass's Question. If has a finite injective resolution then is a Cohen–Macaulay ring.
The Intersection Theorem. If has finite length, then the Krull dimension of N (i.e., the dimension of R modulo the annihilator of N) is at most the projective dimension of M.
The New Intersection Theorem. Let denote a finite complex of free R-modules such that has finite length but is not 0. Then the (Krull dimension) .
The Improved New Intersection Conjecture. Let denote a finite complex of free R-modules such that has finite length for and has a minimal generator that is killed by a power of the maximal ideal of R. Then .
The Direct Summand Conjecture. If is a module-finite ring extension with R regular (here, R need not be local but the problem reduces at once to the local case), then R is a direct summand of S as an R-module. The conjecture was proven by Yves André using a theory of perfectoid spaces.
The Canonical Element Conjecture. Let be a system of parameters for R, let be a free R-resolution of the residue field of R with , and let denote the Koszul complex of R with respect to . Lift the identity map to a map of complexes. Then no matter what the choice of system of parameters or lifting, the last map from is not 0.
Existence of Balanced Big Cohen–Macaulay Modules Conjecture. There exists a (not necessarily finitely generated) R-module W such that mRW ≠ W and every system of parameters for R is a regular sequence on W.
Cohen-Macaulayness of Direct Summands Conjecture. If R is a direct summand of a regular ring S as an R-module, then R is Cohen–Macaulay (R need not be local, but the result reduces at once to the case where R is local).
The Vanishing Conjecture for Maps of Tor. Let be homomorphisms where R is not necessarily local (one can reduce to that case however), with A, S regular and R finitely generated as an A-module. Let W be any A-module. Then the map is zero for all .
The Strong Direct Summand Conjecture. Let be a map of complete local domains, and let Q be a height one prime ideal of S lying over , where R and are both regular. Then is a direct summand of Q considered as R-modules.
Existence of Weakly Functorial Big Cohen-Macaulay Algebras Conjecture. Let be a local homomorphism of complete local domains. Then there exists an R-algebra BR that is a balanced big Cohen–Macaulay algebra for R, an S-algebra that is a balanced big Cohen-Macaulay algebra for S, and a homomorphism BR → BS such that the natural square given by these maps commutes.
Serre's Conjecture on Multiplicities. (cf. Serre's multiplicity conjectures.) Suppose that R is regular of dimension d and that has finite length. Then , defined as the alternating sum of the lengths of the modules is 0 if , and is positive if the sum is equal to d. (N.B. Jean-Pierre Serre proved that the sum cannot exceed d.)
Small Cohen–Macaulay Modules Conjecture. If R is complete, then there exists a finitely-generated R-module such that some (equivalently every) system of parameters for R is a regular sequence on M.
|
wikipedia
|
wiki_7838_chunk_20
|
GE Evolution Series
|
Cemex:
One ES44AC unit, numbered 81, built in March 2008 as an add-on to a CSXT order.
CSX Transportation:
550 ES44AH units, numbered 700–999 and 3000–3249. 847 and 963 have been wrecked and retired, 3112 renumbered to 1776.
Three units have special names and paint schemes: 911 Spirit of Our First Responders, 3112 renumbered to 1776 Spirit of Our Armed Forces and 3194 Spirit of Our Law Enforcement.
CSXT 3099 lettered "Spirit of West Springfield and Safety Train"; wrecked 2018 in Mexico and scrapped
225 ET44AH units, numbered 3250-3474. 3440 lettered "Spirit of Ravenna" along with L&N and KSHC markings after attending the announcement of Kentucky Steam buying the Ravenna yard property from CSX. 3438 and 3374 were involved in a derailment in Georgia. It is unknown whether CSX will repair the locomotives or send them for scrap.
302 ES40DC units, built as ES44DC units but were downgraded by 2010, numbered 5200–5501. 5488 was wrecked and retired.
CSXT 5500 lettered "Spirit of Cincinnati"
Ferromex:
100 ES44AC units, numbered 4600–4699.
50 ES44AC units, numbered 4800-4849. Delivery started on June 2016. Units numbered 4800-4818 were built at the GE plant in Erie, PA. Units numbered 4819-4849 were built at the GE plant in Fort Worth, Texas. 4815 was wrecked and retired in 2018. 4838 also wrecked and retired.
Ferrosur:
23 ES44AC units, numbered 4700-4722. Painted in Ferromex colors.
Florida East Coast Railway:
24 ES44C4 units, numbered 800-823, built in November–December 2014. All units have since been converted to use a combination of standard diesel fuel/liquid natural gas mixture, supplied from an external tender towed behind the locomotives.
GE Transportation
1 ES44DC unit, numbered 2011.
1 ES44AC unit, numbered 2012. Wears the same demonstration scheme as 2011, as well as GECX 2005 and UP 7605 (formerly).
1 ES44AC-H prototype, numbered 2010. This locomotive was rebuilt in 2007 as a hybrid from GECX ES44AC 2005.
1 ES44AC converted to operate on battery power, numbered 3000. Unit was rebuilt from former NextFuel (liquid natural gas/diesel mixture) demonstrator ES44AC 3000.
These locomotives are most often used in GE Transportation/Wabtec's small test fleet on a nearly 3 mile long test track in Erie, PA, to test new locomotives before delivery.
Iowa Interstate Railroad:
12 ES44AC units were delivered from 2008 to 2009, numbered 500–511. These are the first new units purchased by this railroad and were originally intended for CSX.
2 ES44AC units were delivered in early 2010, numbered 512 and 513. 513 is painted in a Chicago, Rock Island and Pacific Railroad heritage scheme in honor of this Iowa Interstate predecessor.
3 ES44AC units were delivered in 2015, numbered 514–516. 516 is painted in a Rock Island inspired 30th anniversary paint scheme.
3 ES44AC T4C units, numbered 517-519. Units were set for delivery in late 2019.
Kansas City Southern Railway:
135 ES44AC units, numbered 4680-4709 and 4765–4869 4700 was wrecked and retired.
25 ET44AC units, numbered 5000-5024
Kansas City Southern de México:
85 ES44AC units, numbered 4650–4679 and 4710–4764
25 ES44AC units, numbered 4870-4894 (Built 2015).
25 ES44AC units, numbered 4895-4919, units are equipped with steerable trucks (Built 2019).
Norfolk Southern Railway:
220 ES44DC units, numbered 7500–7719. Units were uprated from 4,000 to 4,400 HP in 2014.
166 ES44AC units, numbered 8000–8165. 8025, 8098-8105 and 8114 were painted in schemes of predecessor railroads as part of Norfolk Southern's 30th anniversary. 8120 has a Leslie RS5T instead of the Nathan Airchime K5HL found on most of Norfolk Southern’s GEVO locomotives.
3 ES44AC units, numbered 8166–8168 Tier 4 credit units, built concurrently with ET44AC's 3600-3646.
16 ES44AC units, numbered 8169-8184, tier 4 credit units.
47 ET44AC units, numbered 3600–3646 3633 wrecked in 2019.
34 ET44AC units, numbered 3647-3680.
Sava Transportation (Savatran) SVTX:
3 ES44AC units, numbered 1912, 1982, and 1986, delivered February 2012. Units are numbered for the years that Penn State University won national college football championships.
Union Pacific Railroad:
Five pre-production ES44AC (C45ACCTE) units, numbered 5695–5699 (renumbered 5348–5352), were built between January and February 2003.
938 production ES44AC (C45ACCTE) units, numbered 5248–5347, 5353-5553, 7345-7529, and 7600-8051. 5359, 5412, 5482, 7421 and 7914 were wrecked and retired.
296 ES44AH (C45AH) heavy units, numbered 8052-8267, 2520-2569 and 2740-2769. These units are compared to the ES-series standard , and are supplied with all required equipment and computer software to be classified as "AH" heavy units. UP's "AH" types are similar to CSXT's, except for their Hi-Ad trucks, and are designated C45AH's by U.P. 2520-2569 and 2740-2769 are Tier 4 Credit Units. 2542 wrecked in Texarkana, TX in 2015 and retired.
200 ET44AH (C45AH) units, numbered 2570-2769.
UP 7605 was delivered in GE Demonstrator colors, but has been repainted into the standard Building America scheme as of 01/05 2008.
UP 2010, an ES44AC Boy Scouts of America tribute unit, was unveiled on 31 March 2010, in Houston, Texas to commemorate 100 years of Boy Scouts. The unit was renumbered from 7469. However, in early 2022 it was repainted into the Union Pacific lettered scheme after months of sitting in storage. It kept its number of 2010.
In September 2010, UP 7400 was unveiled, featuring a pink ribbon on the side as a tribute to Susan G. Komen for the Cure.
UP 7964 is the 5,000th Evolution Series locomotive to be built, and it had decals on both sides. As of 30 August 2016, it had the decals removed and was repainted.
|
wikipedia
|
wiki_331_chunk_70
|
Lambda calculus
|
In 2014 it was shown that the number of β-reduction steps taken by normal order reduction to reduce a term is a reasonable time cost model, that is, the reduction can be simulated on a Turing machine in time polynomially proportional to the number of steps. This was a long-standing open problem, due to size explosion, the existence of lambda terms which grow exponentially in size for each β-reduction. The result gets around this by working with a compact shared representation. The result makes clear that the amount of space needed to evaluate a lambda term is not proportional to the size of the term during reduction. It is not currently known what a good measure of space complexity would be.
|
wikipedia
|
wiki_10754_chunk_2
|
International Design Excellence Awards
|
Innovation: (design, experience, manufacturing)
Benefit to User: (performance, comfort, safety, ease of use, usability, user interface, ergonomics, universal function and access, quality of life, affordability)
Responsibility: Benefit to society, environment, culture and economy (improved accessibility to a greater percentage of the population, improves education, meets basic needs of low income populations, reduces disease, improves competitiveness, raises wealth, improves the quality of life, supports cultural diversity, improves energy efficiency, durability, addresses product lifecycle effects on the environment, uses low impact materials and processes throughout lifecycle, designed for repair/reuse/recyclability, addresses issues of toxicity, reduced material usage and waste reduction
Benefit to the client (profitability, increased sales, brand reputation, employee morale)
Visual appeal and appropriate aesthetics
Design Research: (usability, emotional factors, unmet needs) testing rigor and reliability)
Design Strategy Category (internal factors and methods, strategic value and implementation)
|
wikipedia
|
wiki_13675_chunk_12
|
Word problem (mathematics)
|
The word problem for free lattices has some interesting aspects. Consider the case of bounded lattices, i.e. algebraic structures with the two binary operations ∨ and ∧ and the two constants (nullary operations) 0 and 1. The set of all well-formed expressions that can be formulated using these operations on elements from a given set of generators X will be called W(X). This set of words contains many expressions that turn out to denote equal values in every lattice. For example, if a is some element of X, then a ∨ 1 = 1 and a ∧ 1 =a. The word problem for free bounded lattices is the problem of determining which of these elements of W(X) denote the same element in the free bounded lattice FX, and hence in every bounded lattice.
|
wikipedia
|
wiki_11143_chunk_1
|
Computational epidemiology
|
Introduction
In contrast with traditional epidemiology, computational epidemiology looks for patterns in unstructured sources of data, such as social media. It can be thought of as the hypothesis-generating antecedent to hypothesis-testing methods such as national surveys and randomized controlled trials.
A mathematical model is developed which describes the observed behavior of the viruses, based on the available data. Then simulations of the model are performed to understand the possible outcomes given the model used. These simulations produce as results projections which can then be used to make predictions or verify the facts and then be used to plan interventions and meters towards the control of the disease's spread.
|
wikipedia
|
wiki_5691_chunk_4
|
Modular programming
|
Language support
Languages that formally support the module concept include Ada, Algol, BlitzMax, C++, C#, Clojure, COBOL, Common_Lisp, D, Dart, eC, Erlang, Elixir, Elm, F, F#, Fortran, Go, Haskell, IBM/360 Assembler, Control Language (CL), IBM RPG, Java, MATLAB, ML, Modula, Modula-2, Modula-3, Morpho, NEWP, Oberon, Oberon-2, Objective-C, OCaml, several derivatives of Pascal (Component Pascal, Object Pascal, Turbo Pascal, UCSD Pascal), Perl, PL/I, PureBasic, Python, R, Ruby, Rust, JavaScript, Visual Basic .NET and WebDNA.
|
wikipedia
|
wiki_12260_chunk_10
|
Microelectronics and Computer Technology Corporation
|
Evolutionary Technologies International, a company focused on developing database tools and data warehousing, was spun off from MCC in 1990. See also
Cyc
Sematech, a semiconductor-industry focused consortium, previously in Austin; moved to Albany, NY in 2010 Notes
Microelectronics and Computer Technology Corporation, entry from The Free On-line Dictionary of Computing.
David V. Gibson and Everett M. Rogers, R&D Collaborations On Trial, Harvard Business School Press, 1994, , Introduction, p. 15.
David V. Gibson and Everett M. Rogers (1994), Chapter 7. References
|
wikipedia
|
wiki_21485_chunk_1
|
Dynamic problem (algorithms)
|
Problems of this class have the following measures of complexity:
Space the amount of memory space required to store the data structure;
Initialization time time required for the initial construction of the data structure;
Insertion time time required for the update of the data structure when one more input element is added;
Deletion time time required for the update of the data structure when an input element is deleted;
Query time time required to answer a query;
Other operations specific to the problem in question The overall set of computations for a dynamic problem is called a dynamic algorithm.
|
wikipedia
|
wiki_25907_chunk_10
|
Balochistan University of Information Technology, Engineering & Management Sciences
|
Research and reputation
The institute's research activities are governed by the Office of Research, Innovation, and Commercialization (ORIC) led by Dr. Anayatullah Baloch. It is responsible for promoting and enhancing quality research activities and publications. The office assists in Board of studies and conducts Advanced Studies and Research Board (ASRB) meetings to review research projects and coordinate with the academic departments for holding research activities. Research funding are sponsored by different national and international sponsoring agencies including Higher Education Commission, ALP (Agricultural Linkage Program),Ministry of Science & Technology, Pakistan Science Foundation (PSF), International Science Foundation, World Health Organization (WHO), FAO / International Atomic Energy Agency (IAEA), International Fund for Agricultural Development (IFAD), and NIH USA. The Research Grants Program provides support for research projects in the following fields of Biotechnology and Informatics, Basic and Applied Sciences, Engineering, Information Technology, Administrative Sciences, and Arts. Projects funded by ORIC mainly focus national interest and funds both academic and industrial projects. In the 2012-2017 session, the university spent 10501691.63 RS in research.
|
wikipedia
|
wiki_5093_chunk_23
|
List of important publications in chemistry
|
Statistics for Experimenters: An Introduction to Design, Data Analysis, and Model Building
George E.P. Box, J. Stuart Hunter & William G. Hunter
John Wiley and Sons, Inc., 1st Edition 1978, 2nd Edition 2005 ()
Importance: Although almost devoid of classical chemistry, this is the definitive text for any experimentalist. This is particularly true for any chemist measuring or studying the properties or effects of chemical compounds, mixtures or other substances.
|
wikipedia
|
wiki_12501_chunk_6
|
Asymptotically optimal algorithm
|
An example of an asymptotically optimal algorithm not used in practice is Bernard Chazelle's linear-time algorithm for triangulation of a simple polygon. Another is the resizable array data structure published in "Resizable Arrays in Optimal Time and Space", which can index in constant time but on many machines carries a heavy practical penalty compared to ordinary array indexing.
|
wikipedia
|
wiki_15969_chunk_0
|
List of MeSH codes (V02)
|
The following is a partial list of the "V" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (V01). Codes following these are found at List of MeSH codes (V03). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – publication formats (publication type) – abbreviations (publication type) – abstracts (publication type) – academic dissertations (publication type)
|
wikipedia
|
wiki_3840_chunk_1
|
Lists of mathematics topics
|
The purpose of this list is not similar to that of the Mathematics Subject Classification formulated by the American Mathematical Society. Many mathematics journals ask authors of research papers and expository articles to list subject codes from the Mathematics Subject Classification in their papers. The subject codes so listed are used by the two major reviewing databases, Mathematical Reviews and Zentralblatt MATH. This list has some items that would not fit in such a classification, such as list of exponential topics and list of factorial and binomial topics, which may surprise the reader with the diversity of their coverage. Basic mathematics
|
wikipedia
|
wiki_19886_chunk_1
|
Mathematical Institute, University of Oxford
|
Overview
The Oxford Mathematical Institute includes both pure and applied mathematics (Statistics is a separate department) and is one of the largest and most respected mathematics departments in the UK with about 100 faculty members, and was ranked as the top mathematics department in the UK in the 2014 UK Research Evaluation Framework. Research at the Mathematical Institute covers all branches of mathematical sciences ranging from, for example, algebra, number theory, and geometry to the application of mathematics to a wide range of fields including industry, finance, climate modelling, networks and the brain. It has over 850 undergraduates, over 250 postgraduates and around 150 MSc students. History
|
wikipedia
|
wiki_9459_chunk_10
|
Reed–Muller code
|
A generator matrix for a Reed–Muller code of length can be constructed as follows. Let us write the set of all m-dimensional binary vectors as: We define in N-dimensional space the indicator vectors on subsets by: together with, also in , the binary operation referred to as the wedge product (not to be confused with the wedge product defined in exterior algebra). Here, and are points in (N-dimensional binary vectors), and the operation is the usual multiplication in the field . is an m-dimensional vector space over the field , so it is possible to write
|
wikipedia
|
wiki_7172_chunk_26
|
Semisimple Lie algebra
|
For applications, one is often interested in a finite-dimensional simple -module (a finite-dimensional irreducible representation). This is especially the case when is the Lie algebra of a Lie group (or complexification of such), since, via the Lie correspondence, a Lie algebra representation can be integrated to a Lie group representation when the obstructions are overcome. The next criterion then addresses this need: by the positive Weyl chamber , we mean the convex cone where is a unique vector such that . The criterion then reads:
if and only if, for each positive root , (1) is an integer and (2) lies in .
A linear functional satisfying the above equivalent condition is called a dominant integral weight. Hence, in summary, there exists a bijection between the dominant integral weights and the equivalence classes of finite-dimensional simple -modules, the result known as the theorem of the highest weight. The character of a finite-dimensional simple module in turns is computed by the Weyl character formula.
|
wikipedia
|
wiki_5878_chunk_28
|
Computational sociology
|
Academic programs, departments and degrees
University of Bristol "Mediapatterns" project
Carnegie Mellon University, PhD program in Computation, Organizations and Society (COS)
University of Chicago
Certificate, MA and PhD in Computational Social Sciences
George Mason University
PhD program in CSS (Computational Social Sciences)
MA program in Master's of Interdisciplinary Studies, CSS emphasis
Portland State, PhD program in Systems Science
Portland State, MS program in Systems Science
University College Dublin,
PhD Program in Complex Systems and Computational Social Science
MSc in Social Data Analytics
BSc in Computational Social Science
UCLA, Minor in Human Complex Systems
UCLA, Major in Computational & Systems Biology (including behavioral sciences)
Univ. of Michigan, Minor in Complex Systems
Systems Sciences Programs List, Portland State. List of other worldwide related programs.
|
wikipedia
|
wiki_163_chunk_27
|
Data Encryption Standard
|
The next confirmed DES cracker was the COPACOBANA machine built in 2006 by teams of the Universities of Bochum and Kiel, both in Germany. Unlike the EFF machine, COPACOBANA consists of commercially available, reconfigurable integrated circuits. 120 of these field-programmable gate arrays (FPGAs) of type XILINX Spartan-3 1000 run in parallel. They are grouped in 20 DIMM modules, each containing 6 FPGAs. The use of reconfigurable hardware makes the machine applicable to other code breaking tasks as well. One of the more interesting aspects of COPACOBANA is its cost factor. One machine can be built for approximately $10,000. The cost decrease by roughly a factor of 25 over the EFF machine is an example of the continuous improvement of digital hardware—see Moore's law. Adjusting for inflation over 8 years yields an even higher improvement of about 30x. Since 2007, SciEngines GmbH, a spin-off company of the two project partners of COPACOBANA has enhanced and developed successors of COPACOBANA. In 2008 their COPACOBANA RIVYERA reduced the time to break DES to less than one day, using 128 Spartan-3 5000's. SciEngines RIVYERA held the record in brute-force breaking DES, having utilized 128 Spartan-3 5000 FPGAs. Their 256 Spartan-6 LX150 model has further lowered this time.
|
wikipedia
|
wiki_10065_chunk_4
|
Complementary code keying
|
Mathematical description
The CCK modulation used by 802.11b transmits data in symbols of eight chips, where each chip is a complex QPSK bit-pair at a chip rate of 11Mchip/s. In 5.5 Mbit/s and 11 Mbit/s modes respectively 4 and 8 bits are modulated onto the eight chips of the symbol c0,...,c7, where and are determined by the bits being modulated.
|
wikipedia
|
wiki_15586_chunk_11
|
Smithy code
|
External links
The complete text of the judgment was formerly available at http://www.hmcourts-service.gov.uk/images/judgment-files/baigent_v_rhg_0406.pdf.
The archived copy of this text from 5 December 2006 can be found here
, text of the judgment without the italics that mark out the cyphertext.
Famous Unsolved Codes (lists the Smithy Code as solved)
Kryptos Group report - analyzes how the code is put together, and contains a link to a mirrored copy of the PDF of the original judgment Tool to crack the code
|
wikipedia
|
wiki_16506_chunk_4
|
Nuclear astrophysics
|
During cosmic times, nuclear reactions re-arrange the nucleons that were left behind from the big bang (in the form of isotopes of hydrogen and helium, and traces of lithium, beryllium, and boron) to other isotopes and elements as we find them today (see graph). The driver is a conversion of nuclear binding energy to exothermic energy, favoring nuclei with more binding of their nucleons - these are then lighter as their original components by the binding energy. The most tightly-bound nucleus from symmetric matter of neutrons and protons is 56Ni. The release of nuclear binding energy is what allows stars to shine for up to billions of years, and may disrupt stars in stellar explosions in case of violent reactions (such as 12C+12C fusion for thermonuclear supernova explosions). As matter is processed as such within stars and stellar explosions, some of the products are ejected from the nuclear-reaction site and end up in interstellar gas. Then, it may form new stars, and be processed further through nuclear reactions, in a cycle of matter. This results in compositional evolution of cosmic gas in and between stars and galaxies, enriching such gas with heavier elements. Nuclear astrophysics is the science to describe and understand the nuclear and astrophysical processes within such cosmic and galactic chemical evolution, linking it to knowledge from nuclear physics and astrophysics. Measurements are used to test our understanding: Astronomical constraints are obtained from stellar and interstellar abundance data of elements and isotopes, and other multi-messenger astronomical measurements of the cosmic object phenomena help to understand and model these. Nuclear properties can be obtained from terrestrial nuclear laboratories such as accelerators with their experiments. Theory and simulations are needed to understand and complement such data, providing models for nuclear reaction rates under the variety of cosmic conditions, and for the structure and dynamics of cosmic objects.
|
wikipedia
|
wiki_793_chunk_8
|
Linear programming
|
Uses
Linear programming is a widely used field of optimization for several reasons. Many practical problems in operations research can be expressed as linear programming problems. Certain special cases of linear programming, such as network flow problems and multicommodity flow problems are considered important enough to have generated much research on specialized algorithms for their solution. A number of algorithms for other types of optimization problems work by solving LP problems as sub-problems. Historically, ideas from linear programming have inspired many of the central concepts of optimization theory, such as duality, decomposition, and the importance of convexity and its generalizations. Likewise, linear programming was heavily used in the early formation of microeconomics and it is currently utilized in company management, such as planning, production, transportation, technology and other issues. Although the modern management issues are ever-changing, most companies would like to maximize profits and minimize costs with limited resources. Google uses linear programming to stabilize YouTube videos. Therefore, many issues can be characterized as linear programming problems.
|
wikipedia
|
wiki_36323_chunk_21
|
United States Geological Survey
|
While much less expensive to compile and produce, the revised digital U.S. topo maps have been criticized for a lack of accuracy and detail in comparison to older generation maps based on aerial photo surveys and field checks. As the digital databases were not designed for producing general-purpose maps, data integration can be a problem when retrieved from sources with different resolutions and collection dates. Man-made features once recorded by direct field observation are not in any public domain national database and are frequently omitted from the newest generation digital topo maps, including windmills, mines and mineshafts, water tanks, fence lines, survey marks, parks, recreational trails, buildings, boundaries, pipelines, telephone lines, power transmission lines, and even railroads. Additionally, the digital map's use of existing software may not properly integrate different feature classes or prioritize and organize text in areas of crowded features, obscuring important geographic details. As a result, some have noted that the U.S. Topo maps currently fall short of traditional topographic map presentation standards achieved in maps drawn from 1945 to 1992.
|
wikipedia
|
wiki_7690_chunk_22
|
DeCODE genetics
|
To understand the population that it is working in and to address broader questions few can in the same way, deCODE has also from its early days had its own genetic anthropology group. It has published pioneering work on mitochondrial and Y-chromosome mutation to trace the Norwegian and Celtic mix in the early population; sequenced ancient DNA from the settlement period; compared ancient and modern Icelandic genomes to see how genetic drift, epidemics and natural disasters have yielded a modern-day population genetically distinct from its forbears and source populations. and observed variants under positive natural selection in a present-day society. The company has also catalogued human knockouts - people missing certain genes - and reconstructed the genome of the first man of African descent to live in Iceland by analyzing the sequences of hundreds of his living descendants. These studies are avidly followed by foreign and Icelandic media alike, and constitute another type of return that deCODE renders to the society it studies and works within.
|
wikipedia
|
wiki_23637_chunk_4
|
Government database
|
France
Carnet B: Created in 1886, the Carnet B was, initially, a list of foreigners suspected of espionage. Prior to World War I, the list was gradually expanded to include all persons likely to disturb public order and antimilitarists who might oppose national mobilization. Those listed were to be arrested in the event of war. In July 1914 the list contained 2,481 names. However, after the assassination of socialist leader and committed antimilitarist Jean Jaurès a few days before the start of World War I, most of the left-wing rallied to the Union sacrée (Sacred Union) government and Carnet B was not used to detain individuals. The maintenance and use of Carnet B was discontinued on 18 July 1947.
Tulard database: In the interwar period, police officer André Tulard set up a database registering communists and others activists. The database was used under Vichy to register Jews. These files were given to Theodor Dannecker of the Gestapo and greatly assisted the French police in carrying out raids against Jews, who were then interned at Drancy camp before being deported to concentration camps in Nazi Germany.
INSEE code: During the World War II, René Carmille created what would become the INSEE code used as a national identification number for people, organizations, and administrative regions. INSEE is the acronym for the French National Institute for Statistics and Economic Studies.
Répertoire national d’identification des personnes physiques: a national directory for the identification of natural persons, maintained by INSEE since 1946. It is regularly updated through statistical bulletins on civil status changes, drawn up and sent to INSEE by municipalities and containing details of births, deaths, recognitions and marginal notes made in birth certificates for persons born in metropolitan France or its overseas departments. The directory serves four purposes: (i) to eliminate confusion arising from people sharing the same name; (ii) use by tax authorities and pension funds to verify the civil status of individuals; (iii) contributing to health monitoring by sending daily information on deaths to the Institute for Health Monitoring; and (iv) generating demographic statistics to assist in decision-making. It includes information on the civil status of citizens: family name, sometimes the usual name (or marital name), given names, gender, date and place of birth, number of birth certificate, date and place of death and death certificate number for the recently deceased, and national registration number. The National System of Management of the Identities managed by Caisse Nationale d'Assurance Vieillesse, the social security pension administrator, is a copy of this data.
Système Automatisé pour les Fichiers Administratifs et le Répertoire des Individus (SAFARI): an "Automated System for Administrative Files and Directories of Individuals" was to have been a centralized database of personal data collected from many administrative departments and connected using the INSEE code. The massive popular rejection of this project after it became known to the public promoted the creation of the Commission nationale de l'informatique et des libertés (CNiL) to ensure data privacy. Databases are to have the CNiL's approbation before being authorized. In 2006 more than half the police records overseen by the CNiL were found to contain mistakes which required correction.
Système de traitement des infractions constatées (STIC): a "Processing System for Recognized Offences" to register criminal offenders and plaintiffs was created in 1995 and legalized in 2001. In January 1997 it held the records of records of 2.5 million offenders and 2.7 million victims. In 2006 the STIC held 24.4 million records. Records are held for a maximum of 40 years. The STIC has sparked several controversies, as some people have not been able to find jobs because they were registered in the STIC (sometimes wrongly, others simply as victims). In 2005 the CNiL discovered errors in 47% of the records included in the STIC database.
JUDEX: a system to register criminal offenders and plaintiffs used by the Gendarmerie is similar to the STIC. JUDEX contained 2.2 million records in 2003.
Fichier national automatisé des empreintes génétiques (Automated National File of Genetic Prints) for registering DNA information, was created in 1998. First used to register sex offenders, it has since been extended to cover almost any crime, including protestors engaged in civil disobedience. It has grown from 2,807 profiles in 2003, to 330,000 in 2006, and 1.27 million in 2009."Written Question No.: 68468", , AssemblÈE Nationale, 6 April 2010. Retrieved 15 October 2013.
Fichier judiciaire automatisé des auteurs d'infractions sexuelles: The Automated Criminal File of Sex Offenders, is a sex offender database operated by the Justice Minister created in 2004. The database records the name, sex, date and place of birth, nationality, alias, address, nature of the offense, date and place where the offense was committed, nature and date of the decision, and penalties or measures imposed. In October 2008 the database contained records for some 43,408 people.
Base-élèves system: the Students-Base system, a database containing personal data on children age three and older and their families, including psychosocial data and information on competence, skills, and problems. Although initially accessed by educators and social actors, the new French law of March 2007 for the prevention of delinquency granted access to such information to Mayors for the purpose of preventing delinquency. However, after protests, data related to citizenship, language, and culture of origin were removed in October 2007. The Conseil d'État, the highest administrative jurisdiction, held in two decisions of 19 July 2010 that the "Base-élèves" and the computerised file of student identifiers ("Base nationale des identifiants des élèves") were not functioning in compliance with the Data Protection Act. Further, the Conseil déetat considered that the collection of health data in the "Base-élèves" relating to children was not relevant and reminded in its decisions that parents have a right to object to the collection and processing of their children's data. It also held that the retention period of 35 years for the children identifiers contained in the database was excessive.
ELOI index: short for l’éloignement (removal), the ELOI index is a register for foreigners and illegal aliens created by the Interior Minister in 2006 and subsequently declared illegal by the Conseil d'État.
Parafes: A 7 August 2007 decree generalized a voluntary biometric profiling program of travellers in airports using fingerprints. The new database would be interconnected with the Schengen Information System (SIS) as well as with a national database of wanted persons (Fichier des personnes recherchées). The CNiL protested against this new decree, opposing itself to the recording of fingerprints and to the interconnection between the two systems.
Loppsi II: In February 2010, the French Parliament adopted the Loppsi II "bill on direction and planning for the performance of domestic security", a far-reaching security bill that modernizes Internet laws, criminalizes online identity theft, allows police to tap Internet connections as well as phone lines during investigations, and targets child pornography by ordering ISPs to filter Internet connections. The law permits the creation of an informatic platform connecting numerous government databases."Le fichier Périclès, grand mix de données personnelles" (The Pericles file, a large aggregation of personal data), Olivier Dumons , Le Monde, 29 June 2009, . Previously, in 2004, the National Assembly voted the loi pour la confiance dans l'économie numérique to implement the Electronic Commerce EU directive. This law requires all Internet Service Providers (ISP), phone operators, webmasters, etc., to keep information on visitors (codewords, VISA cards numbers, pseudonyms, contributions on forums and blogs, etc.) for from one to three years. The information is to be made available for use by the RG domestic intelligence agency, counter-intelligence agencies, the judicial police (PJ) and investigative magistrates.
Fingerprints: In a decision delivered on 18 April 2013, the European Court of Human Rights found that a 1987 French Decree related to storing fingerprint data is a privacy violation because:
the scope of the Decree is not limited to certain serious crimes, such as sexual offences or organised crime, but includes all offences, even the minor ones;
the database did not distinguish between those data subjects who were convicted and those who were not, nor did it make a distinction on whether the data subjects had been officially charged; and
the maximum data retention period of 25 years was disproportionate to the legitimate purpose of the Decree.
|
wikipedia
|
wiki_11990_chunk_8
|
Anonymous recursion
|
This is illustrated below using Python. First, a standard named recursion:
def fact(n):
if n == 0:
return 1
return n * fact(n - 1)
Using a higher-order function so the top-level function recurses anonymously on an argument, but still needing the standard recursive function as an argument:
def fact0(n0):
if n0 == 0:
return 1
return n0 * fact0(n0 - 1)
fact1 = lambda f, n1: 1 if n1 == 0 else n1 * f(n1 - 1)
fact = lambda n: fact1(fact0, n)
We can eliminate the standard recursive function by passing the function argument into the call:
fact1 = lambda f, n1: 1 if n1 == 0 else n1 * f(f, n1 - 1)
fact = lambda n: fact1(fact1, n)
The second line can be replaced by a generic higher-order function called a combinator:F = lambda f: (lambda x: f(f, x))
fact1 = lambda f, n1: 1 if n1 == 0 else n1 * f(f, n1 - 1)
fact = F(fact1)
Written anonymously:
(lambda f: (lambda x: f(f, x))) \
(lambda g, n1: 1 if n1 == 0 else n1 * g(g, n1 - 1))
|
wikipedia
|
wiki_8587_chunk_3
|
Comprehensive School Mathematics Program
|
Overview
The CSMP project employs four non-verbal languages for the purpose of posing problems and representing mathematical concepts: the Papy Minicomputer (mental computation), Arrows (relations), Strings (classification), and Calculators (patterns). It was designed to teach mathematics as a problem-solving activity rather than simply teaching arithmetic skills, and uses the Socratic method, guiding students to figure out concepts on their own rather than directly lecturing or demonstrating the material. The curriculum uses a spiral structure and philosophy, providing students chances to learn materials at different times and rates. By giving students repeated exposure to a variety of content – even if all students may not initially fully understand – students may experience, assimilate, apply, and react to a variety of mathematical experiences, learning to master different concepts over time, at their own paces, rather than being presented with a single topic to study until mastered.
|
wikipedia
|
wiki_30776_chunk_2
|
Nanomorphic cell
|
The nanomorphic cell model was applied to analyze the capabilities of an autonomous integrated microsystem on the order of the size of a living cell, i.e. a cube of 10 micrometer on a side [1, 2]. The function of this microsystem is, for example, upon injection into the body, to interact with living cells, e.g. determine the state of the cell and to support certain “therapeutic” action. It must have the capability to collect data on the living cell, analyze the data, and make a decision on the state of the living cell. It must also communicate with an external controlling agent, and possibly, take corrective action. Such a cell would need its own energy sources, sensors, computers, and communication devices, integrated into a complete system whose structure is dictated by the intended nanomorphic cell function. The Nanomorphic Cell can be considered as an extreme example of a class of systems known generically as Autonomous Microsystems, for example WIMS (Wireless Integrated Microsystems), PicoNode, Lab-on-a-Pill and Smartdust.
|
wikipedia
|
wiki_1527_chunk_26
|
Generating function
|
Tools for processing and working with P-recursive sequences in Mathematica include the software packages provided for non-commercial use on the RISC Combinatorics Group algorithmic combinatorics software site. Despite being mostly closed-source, particularly powerful tools in this software suite are provided by the Guess package for guessing P-recurrences for arbitrary input sequences (useful for experimental mathematics and exploration) and the Sigma package which is able to find P-recurrences for many sums and solve for closed-form solutions to P-recurrences involving generalized harmonic numbers. Other packages listed on this particular RISC site are targeted at working with holonomic generating functions specifically.
(Depending on how in depth this article gets on the topic, there are many, many other examples of useful software tools that can be listed here or on this page in another section.)
|
wikipedia
|
wiki_32969_chunk_17
|
Energy policy of Morocco
|
The biggest CSP project in Morocco is Noor Solar, situated in the city of Ouarzazate, on the edge of the Sahara desert. The project comprises 3 phases: Noor I, Noor II and Noor III. This Noor project is supported by a BOOT (build, own, operate and transfer) basis of ACWA Power Ouarzazate, MASEN, Aries, and TSK. The first phase of the program - Noor I - was inaugurated in February 2016. Noor I employs 500,000 parabolic mirrors to eventually generate up to 160 MW of electricity, which makes it one of the largest solar power plants in the world. The program has two following phases - Noor II and Noor III - which were scheduled to operate by 2018. Besides the CSP project, Morocco is also developing the Noor PV 1 program and Noor Midelt phase 1, which essentially use photovoltaics to further increase the electricity generation from solar. The whole complex of the Noor Plant was scheduled to come online in 2018. The complex is supposed to have 582 MW of capacity, that could be utilized to provide electricity for 1.1 million houses. From 2010 until 2015, electricity generated by solar and wind has increased almost four times.
|
wikipedia
|
wiki_20870_chunk_4
|
One-pass algorithm
|
Given a list of numbers:
Find the median.
Find the modes (This is not the same as finding the most frequent symbol from a limited alphabet).
Sort the list.
Count the number of items greater than or less than the mean. However, this can be done in constant memory with two passes: Pass 1 finds the average and pass 2 does the counting. The two-pass algorithms above are still streaming algorithms but not one-pass algorithms. References Streaming algorithms
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.