id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_10480_chunk_37
|
List of programs broadcast by Seven Network
|
21 Jump Street (originally aired on Nine Network)
24
77 Sunset Strip
The Adventures of Sherlock Holmes
The Adventures of the Black Stallion
The Adventures of William Tell
Against the Wall
Agent Carter (2016)
Agents of S.H.I.E.L.D. (7flix)
Airwolf
Alias
All Creatures Great and Small
Ally McBeal
Alphas
Amazing Grace
American Dreams
The American Embassy
American Odyssey
Angel (later aired on Network Ten and Eleven)
Aquarius
Babylon 5
Bad Girls
Band of Gold
Bates Motel
The Bay
Beacon Hill
BeastMaster
Beggarman, Thief
Beggars and Choosers
Bergerac (in conjunction with the BBC)
The Best Times
Between the Lines
Big Shamus, Little Shamus
Billionaire Boys Club
Bionic Woman
Blindspot
Body of Proof (2011-2013)
Bodies of Evidence
Bones
Boomtown
Boston Legal
Boston Public
Boys from the Bush
Brotherhood of the Rose
Brothers & Sisters
Buffy the Vampire Slayer (later moved to Network Ten and Eleven)
Cagney and Lacey
Carbie
Castle
The Chase
Cheat
Chicago Hope
CHiPs
Circus Boy
City Central
Cleaning Up
Cobra
Code Black (7flix)
Codename: Kyril
Commander in Chief
Coronation Street (later aired on SBS)
Covert Affairs
Cover Up
Crossing Jordan
Cruel Doubt
The Cult
Dark Angel
Dark Justice
The Darling Buds of May
David Cassidy: Man Undercover
Day Break
Deadly Games
Dear John
Death of an Expert Witness
Dempsey & Makepeace
Department S
Desperate Housewives
Detective in the House
Detroit 1-8-7
Diamonds
Dirty Dancing
Disraeli
Double Dare (not to be confused with the Nickelodeon game show of the same name)
Downton Abbey
Due South
The Duke
Edward the Seventh
Eerie, Indiana
The Equalizer
The Event
F/X: The Series
Falcon Crest
Fame
Felicity
Flash Gordon
FlashForward
Fly by Night
Forever Knight
Fortune Dane
Freshman Dorm
GCB
Generations
Ghost Whisperer
Gideon's Crossing
Gormenghast
The Greatest American Hero (originally aired on Network Ten and ABC)
Grey's Anatomy (2005–2018 on Seven, 2018–2021 on 7flix, moved to Disney+)
Grimm
Hammer House of Horror
Hang Time
The Hardy Boys/Nancy Drew Mysteries
Hawaiian Eye
Heartbeat
Hearts Are Wild
Heroes
Heroes Reborn
Highlander: The Series
Hill Street Blues
Homefront
Homicide: Life on the Street
Hong Kong
Huff
Hung
Hunter
In the Heat of the Night
The Incredible Hulk (1978)
Inspector Morse
The Invisible Man (1958)
Ironside
Island Son
I Spy (1965)
Jack the Ripper
JAG (later moved to Network Ten and Eleven)
Jessie
Jungle Jim
Just Deal
Kay O'Brien
Key West
Knightwatch
Lady Blue
Largo Winch
Law & Order: Los Angeles
Leap Years
Lexx
Liar
The Life and Loves of a She-Devil
Lillie
Lime Street
The Lineup
Lois and Clark: The New Adventures of Superman
The Lone Gunmen
Lost
Lost in Space
Lucky Chances
MacGyver
Maigret
The Man from U.N.C.L.E.
Manhunt
Mancuso, F.B.I.
Mapp and Lucia
Martial Law
McMillan & Wife
Medical Center
Midnight Caller
Misfits of Science
Missing
Miss Marple (in conjunction with the BBC)
Mistresses
Mitch
Moody and Pegg
Motive (7flix)
Mrs. Biggs
Murder City
Mutant X
Nash Bridges
The New Untouchables
Night Heat
Nightmare Cafe
The Nightmare Years
Nowhere Man
The Oldest Rookie
One West Waikiki
Once & Again
Once Upon a Time (7flix)
Once Upon a Time in Wonderland (2016)
The Onedin Line
Our Family Honor
Our House
The Outer Limits
The Pallisers
The Passage
Peak Practice
Perry Mason
The Persuaders!
Peter Gunn
Phantom Agents
The Player
Police Woman
Popular
Poltergeist: The Legacy
The Practice
Private Practice
The Professionals
Profiler
Providence
Quantico (7flix)
Quincy, M.E.
Reckless
Red Widow
Rescue 8 (also airs on Nine Network in Victoria)
Resurrection
The Return of Sherlock Holmes
Return of the Saint
Revenge (2012-2015)
Rituals
The River
RoboCop: The Series
Room 222
The Rousters
Royal Pains
Rush Hour
The Saint
Shaft
Shannon's Deal
Sherlock Holmes
Sidekicks
Simon & Simon
The Six Million Dollar Man
Snoops
Space: Above and Beyond
Space Precinct
Special Branch
Spies
Standoff
Stargate SG1
State of Affairs
Stephen King's Kingdom Hospital
Stingray
Streets of San Francisco
Superior Court
The Sweeney
Sweet Valley High
T. and T.
T.J. Hooker
Tales from the Crypt
Tales of the Gold Monkey
Titanic miniseries
Thirtysomething
Threat Matrix
Thriller
Time of Your Life
Time Trax
A Touch of Frost
Tour of Duty
Trapper John, M.D.
The Troubleshooters
Tru Calling
UFO
Ultimate Force
Unsolved Mysteries
Vanished
Vera (Now on ABC)
The Village
The Wackiest Ship in the Army
When the Boat Comes In
The White Shadow
Whiz Kids
William and Mary
Windmills of the Gods
Wings
Wiseguy
Within These Walls
|
wikipedia
|
wiki_15125_chunk_2
|
Encyclopedia of Mathematics
|
Encyclopedia of Mathematics wiki
A new dynamic version of the encyclopedia is now available as a public wiki online. This new wiki is a collaboration between Springer and the European Mathematical Society. This new version of the encyclopedia includes the entire contents of the previous online version, but all entries can now be publicly updated to include the newest advancements in mathematics. All entries will be monitored for content accuracy by members of an editorial board selected by the European Mathematical Society. Versions
|
wikipedia
|
wiki_18473_chunk_9
|
NASA Exceptional Engineering Achievement Medal
|
Xin An
Jay Brandon
William M. Cirillo
Robert Fong
Charles E. Hall
David G. Johnson
Justin H. Kerr
Jeffrey L. Lindner
Fred G. Martwick
Bijan Nemati
Mark A. Stephen
Nathan C. Wood
Robert J. Black
Stephen T. Bryson
Anthony L. Cook
Bryan Fraser
Richard R. Hofer
Ira Katz
Denney J. Keys
Alok K. Majumdar
Ioannis G. Mikellides
Jeffrey R. Piepmeier
John S. Townsend
Ping Y. Yu
Kristin L. Bourkland
Hon M. Chan
Kimberly B. Demoret
Dan M. Goebel
Megan K. Jaunich
Sotirios Kellas
Todd Klaus
Gregory C. Marr
Kathleen Andreozzi Minear
Mark Schoenenberger
Albert C. Whittlesey
Randy R. Bowman
Steven R. Chesley
Thomas P. Flatley
Karen L. Gundy-Burlet
Wayne A. Jermstad
Daniel P. Kelly
Dzu K. Le
Dr. G. Patrick Martin
Nelson Morales
V. S. Scott
Donna V. Wilson
|
wikipedia
|
wiki_322_chunk_2
|
Logic programming
|
In ASP and Datalog, logic programs have only a declarative reading, and their execution is performed by means of a proof procedure or model generator whose behaviour is not meant to be controlled by the programmer. However, in the Prolog family of languages, logic programs also have a procedural interpretation as goal-reduction procedures: to solve H, solve B1, and ... and solve Bn. Consider the following clause as an example: fallible(X) :- human(X).
|
wikipedia
|
wiki_15125_chunk_0
|
Encyclopedia of Mathematics
|
The Encyclopedia of Mathematics (also EOM and formerly Encyclopaedia of Mathematics) is a large reference work in mathematics. Overview
The 2002 version contains more than 8,000 entries covering most areas of mathematics at a graduate level, and the presentation is technical in nature. The encyclopedia is edited by Michiel Hazewinkel and was published by Kluwer Academic Publishers until 2003, when Kluwer became part of Springer. The CD-ROM contains animations and three-dimensional objects.
|
wikipedia
|
wiki_5577_chunk_6
|
Biological small-angle scattering
|
In a scattering experiment, a solution of macromolecules is exposed to X-rays (with wavelength λ typically around 0.15 nm) or thermal neutrons (λ≈0.5 nm). The scattered intensity I(s) is recorded as a function of momentum transfer s (s=4πsinθ/λ, where 2θ is the angle between the incident and scattered radiation). From the intensity of the solution the scattering from only the solvent is subtracted. The random positions and orientations of particles result in an isotropic intensity distribution which, for monodisperse non-interacting particles, is proportional to the scattering from a single particle averaged over all orientations. The net particle scattering is proportional to the squared difference in scattering length density (electron density for X-rays and nuclear/spin density for neutrons) between particle and solvent – the so-called contrast. The contrast can be varied in neutron scattering using H2O/D2O mixtures or selective deuteration to yield additional information. The information content of SAS data is illustrated here in the figure on the right, which shows X-ray scattering patterns from proteins with different folds and molecular masses. At low angles (2-3 nm resolution) the curves are rapidly decaying functions of s essentially determined by the particle shape, which clearly differ. At medium resolution (2 to 0.5 nm) the differences are already less pronounced and above 0.5 nm resolution all curves are very similar. SAS thus contains information about the gross structural features – shape, quaternary and tertiary structure – but is not suitable for the analysis of the atomic structure.
|
wikipedia
|
wiki_16751_chunk_12
|
CODEN
|
Hammer, Donald P.: "A review of the ASTM CODEN for Periodical Titles". Library Resources & Technical Services (ISSN 0024-2527), Vol. 12, p. 359–365 (1968).
Saxl, Lea: "Some thoughts about CODEN". In: Special Libraries (ISSN 0038-6723), Vol. 59, p. 279–280 (1968).
Pflueger, Magaret: "A vote for CODEN". In: Special Libraries (ISSN 0038-6723), Vol. 60, p. 173 (1969).
Groot, Elizabeth H.: "Unique identifiers for serials: an annotated, comprehensive bibliography". In: The Serials Librarian (, CODEN SELID4), Vol. 1 (no. 1), p. 51–75 (1976).
Groot, Elizabeth H.: "Unique identifiers for serials: 1977 update". In: The Serials Librarian (, CODEN SELID4), Vol. 2 (no. 3), p. 247–255 (1978).
|
wikipedia
|
wiki_648_chunk_19
|
National Academies of Sciences, Engineering, and Medicine
|
Through this study process, the National Academies produce around 200 reports each year. Recent reports cover such topics as addressing the obesity epidemic, the use of forensics in the courtroom, invasive plants, pollinator collapse, underage drinking, the Hubble Telescope, vaccine safety, the hydrogen economy, transportation safety, climate change, and homeland security. Many reports influence policy decisions; some are instrumental in enabling new research programs; others provide independent program reviews. The National Academies Press is the publisher for the National Academies of Sciences, Engineering, and Medicine, and makes its publications available for free online reading, and the full book PDFs have been available for free download since 2011.
|
wikipedia
|
wiki_21652_chunk_10
|
Boolean network
|
Other updating schemes
Classical Boolean networks (sometimes called CRBN, i.e. Classic Random Boolean Network) are synchronously updated. Motivated by the fact that genes don't usually change their state simultaneously, different alternatives have been introduced. A common classification is the following:
Deterministic asynchronous updated Boolean networks (DRBNs) are not synchronously updated but a deterministic solution still exists. A node i will be updated when t ≡ Qi (mod Pi) where t is the time step.
The most general case is full stochastic updating (GARBN, general asynchronous random boolean networks). Here, one (or more) node(s) are selected at each computational step to be updated.
The Partially-Observed Boolean Dynamical System (POBDS) signal model differs from all previous deterministic and stochastic Boolean network models by removing the assumption of direct observability of the Boolean state vector and allowing uncertainty in the observation process, addressing the scenario encountered in practice.
Autonomous Boolean networks (ABNs) are updated in continuous time (t is a real number, not an integer), which leads to race conditions and complex dynamical behavior such as deterministic chaos.
|
wikipedia
|
wiki_2015_chunk_41
|
Computer Go
|
AlphaGo, the first computer program to win in even matches against a 9-dan human Go player
BaduGI, a program by Jooyoung Lee
Crazy Stone, by Rémi Coulom (sold as Saikyo no Igo in Japan)
Darkforest, by Facebook
Fine Art, by Tencent
Fuego, an open source Monte Carlo program
Goban, a Macintosh Go program by Sen:te (requires free Goban Extensions)
GNU Go, an open source classical Go program
Leela, the first Monte Carlo program for sale to the public
Leela Zero, a reimplementation of the system described in the AlphaGo Zero paper
The Many Faces of Go, by David Fotland (sold as AI Igo in Japan)
MyGoFriend, a program by Frank Karger
MoGo by Sylvain Gelly; parallel version by many people.
Pachi, an open source Monte Carlo program by Petr Baudiš
Smart Go, by Anders Kierulf, inventor of the Smart Game Format
Steenvreter, by Erik van der Werf
Zen, by Yoji Ojima aka Yamato (sold as Tencho no Igo in Japan); parallel version by Hideki Kato.
|
wikipedia
|
wiki_2471_chunk_60
|
Sid McMath
|
McMath's own account, Promises Kept, (University of Arkansas Press, 2003) contains a wealth of primary source material including, in addition to the author's personal recollections, photocopies of correspondence exchanged between him and President Truman and others. Citations in the Appendix refer readers interested in the details of some of McMath's more significant cases to state and federal appellate court reporters and to law review case notes and articles. However, due to their sheer number, many cases are not cited and some citations contain typographical errors. Online and back-issue index searches of Arkansas Reports, Southwestern Reporter, Federal Reports, Federal Supplement, the ATLA Law Reporter (formerly the NACCA Law Journal), TRIAL magazine, Matthew Bender's Art of Advocacy series (particularly Baldwin, "The Art of Direct Examination"), the Arkansas Law Review, UALR Law Review, Inside Litigation, Westlaw and Lexis would assist the reader in developing a more complete list of McMath's cases, their correct citations, and commentary. Indeed, one could trace the development of the American common law of torts over the second half of the 20th century with a chronological analysis of reported (or law-reviewed) cases in which the plaintiff was represented by McMath or a member of his firm. A rich source of historical and trial practice commentary would be the video archives of the School of Trial and Appellate Advocacy, Hastings College of the Law, University of California, San Francisco, the nation's earliest sustained CLE program and the model for many that followed, which McMath and Woods were instrumental in founding and on whose visiting faculty they or members of their firm served from its inception in 1971 until its closure in 2001.
|
wikipedia
|
wiki_12734_chunk_10
|
Form-based code
|
Recent developments
Although the Seaside code was commissioned by a private developer, most current codes are commissioned by counties and municipalities. Since Seaside, the scale of Form-Based Coding projects has grown. Form-Based Coding can be applied at many scales, from a two-block main street to a county-wide region. An early Form-Based Code was adopted for downtown West Palm Beach in 1995. A significant code for a major urban arterial, the Columbia Pike in Arlington County, Virginia, was adopted in 2003 (Ferrell Madden Associates). A regional FBC was adopted in 2006 by St. Lucie County, Florida (Spikowski Associates, Dover-Kohl Partners). Duany/Plater-Zyberk has drafted a model FBC that is also a transect-based code that can be calibrated for local needs—the SMARTCODE. Its first attempted customization was done for Vicksburg, Mississippi in 2001 (Mouzon & Greene). The lessons learned there led to the first California adoption of a citywide Form-Based Code for the City of Sonoma in March 2003 (Crawford Multari & Clark Associates, Moule & Polyzoides), followed on June 16, 2003, by the first SmartCode adopted in the U.S., for central Petaluma, California (Fisher and Hall Urban Design, Crawford Multari & Clark Associates). SmartCodes are now being calibrated for Miami, Florida and Hurricane Katrina ravaged communities in Mississippi and Louisiana, along with cities as diverse as Taos, NM, Michigan City, IN, Jamestown, RI, Lawrence, KS, New Castle, DE, and Bran, Romania. Planetary climate change that must be mitigated by changes in the human environment will no doubt be an inducement to form-based and transect-based coding in the future.
|
wikipedia
|
wiki_15580_chunk_46
|
Random permutation statistics
|
Marko Riedel et al., The difference of number of cycles of even and odd permutations
Marko Riedel et al., Keys inside closed boxes, a question on probability 100 prisoners
Anna Gál, Peter Bro Miltersen, The cell probe complexity of succinct data structures
Various authors, Permutations with a cycle > n/2
Various authors, A property of derangements
Various authors, Expected number of fixed points
Peter Winkler, Seven puzzles you think you must not have heard correctly
Various authors, Les-Mathematiques.net. Cent prisonniers Combinatorics
|
wikipedia
|
wiki_31569_chunk_1
|
Timeline of calculus and mathematical analysis
|
500BC to 1600
5th century BC - The Zeno's paradoxes,
5th century BC - Antiphon attempts to square the circle,
5th century BC - Democritus finds the volume of cone is 1/3 of volume of cylinder,
4th century BC - Eudoxus of Cnidus develops the method of exhaustion,
3rd century BC - Archimedes displays geometric series in The Quadrature of the Parabola,
3rd century - Liu Hui rediscovers the method of exhaustion in order to find the area of a circle,
4th century - The Pappus's centroid theorem,
5th century - Zu Chongzhi established a method that would later be called Cavalieri's principle to find the volume of a sphere,
600 - Liu Zhuo is the first person to use second-order interpolation for computing the positions of the sun and the moon,
665 - Brahmagupta discovers a second order Taylor interpolation for ,
862 - The Banu Musa brothers write the "Book on the Measurement of Plane and Spherical Figures",
9th century - Thābit ibn Qurra discusses the quadrature of the parabola and the volume of the paraboloid,
11th century - Ibn al-Haytham derived a formula for the sum of fourth powers which allowed him to calculate the volume of a paraboloid,
12th century - Sharaf al-Din al-Tusi finds the minimum and maximum values of cubic functions,
12th century - Bhāskara II discovers a rule equivalent to Rolle's theorem for ,
14th century - Nicole Oresme proves of the divergence of the harmonic series,
14th century - Madhava discovers the power series expansion for , , and ,
14th century - Parameshvara discovers a third order Taylor interpolation for ,
1445 - Nicholas of Cusa attempts to square the circle,
1501 - Nilakantha Somayaji writes the Tantrasamgraha, which contains the Madhava's discoveries,
1548 - Francesco Maurolico attemptes to calculate the barycenter of various bodies (pyramid, paraboloid, etc.),
1550 - Jyeshtadeva writes the Yuktibhāṣā, a commentary to Nilakantha's Tantrasamgraha,
1560 - Sankara Variar writes the Kriyakramakari,
1565 - Federico Commandino publishes De centro Gravitati,
1588 - Commandino's translation of Pappus' Collectio gets published,
1593 - François Viète discovers the first infinite product in the history of mathematics,
|
wikipedia
|
wiki_4012_chunk_1
|
List of software patents
|
This article lists patents relating to software which have been the subject of litigation or have achieved notoriety in other ways. Notable patent applications are also listed and comparisons made between corresponding patents and patent applications in different countries. The patents and patent applications are categorised according to the subject matter of the patent or the particular field in which the patent had an effect that brought it into the public view. Business methods Data compression
|
wikipedia
|
wiki_13849_chunk_2
|
Batavi (software)
|
Key Features (1.0 version)
Fully flexible template system, including pages/boxes groups layout and page access limitation
Full content management including menus, texts, mails, pages etc.
Robust architecture to process vast numbers of products, visitors, customers and orders
Customer/group specific pricing, payment or shipping modules
Related products for cross- and upselling
Unlimited product segmentation to present products
Product price rules for pricing vast numbers of products
Product group price rules to make selecting products easier for pricing purposes
Fully automated integration with product content providers: Open ICEcat interface available
Interface for multi warehouse and multi supplier (including stock and purchase prices) support
Possibilities to filter certain UNSPSC during import
Integration possibilities for Google Analytics
Integration possibilities with a number of payment providers (PayPal, iDeal, MrCash etc.)
Advanced batch price list import and order export & status feedback facilities (e.g. interfaces to ICEimport/ICEorder)
A big group of modules like: Product Tax Modules, Realtime modules, Order total modules, GeoIP modules, Coupons etc.
Automatic Brand pages
Standard Open Catalog Interface to Open ICEcat XML.
|
wikipedia
|
wiki_11702_chunk_0
|
Mathematica Inc.
|
Mathematica is an employee-owned company that works at the intersection of data, methods, policy, and practice. Mathematica's staff of more than 1,200 subject matter experts specialize in areas such as health, education, employment, justice, and disability research and are based in offices across the U.S: Princeton, New Jersey; Cambridge, Massachusetts; Chicago, Illinois; Washington, DC; Ann Arbor, Michigan; Seattle, Washington; Woodlawn, Maryland; Tucson, Arizona and Oakland, California. Mathematica's clients include federal agencies, state and local governments, foundations, universities, private-sector companies, and international organizations. In 2018, the company acquired EDI Global, a data research company based in the U.K. and Africa.
|
wikipedia
|
wiki_25973_chunk_21
|
Radiobiology
|
The exposure caused by potassium-40 present within a normal person.
The exposure to the ingestion of a soluble radioactive substance, such as 89Sr in cows' milk.
A person who is being treated for cancer by means of a radiopharmaceutical where a radioisotope is used as a drug (usually a liquid or pill). A review of this topic was published in 1999. Because the radioactive material becomes intimately mixed with the affected object it is often difficult to decontaminate the object or person in a case where internal exposure is occurring. While some very insoluble materials such as fission products within a uranium dioxide matrix might never be able to truly become part of an organism, it is normal to consider such particles in the lungs and digestive tract as a form of internal contamination which results in internal exposure.
Boron neutron capture therapy (BNCT) involves injecting a boron-10 tagged chemical that preferentially binds to tumor cells. Neutrons from a nuclear reactor are shaped by a neutron moderator to the neutron energy spectrum suitable for BNCT treatment. The tumor is selectively bombarded with these neutrons. The neutrons quickly slow down in the body to become low energy thermal neutrons. These thermal neutrons are captured by the injected boron-10, forming excited (boron-11) which breaks down into lithium-7 and a helium-4 alpha particle both of these produce closely spaced ionizing radiation. This concept is described as a binary system using two separate components for the therapy of cancer. Each component in itself is relatively harmless to the cells, but when combined for treatment they produce a highly cytocidal (cytotoxic) effect which is lethal (within a limited range of 5-9 micrometers or approximately one cell diameter). Clinical trials, with promising results, are currently carried out in Finland and Japan.
|
wikipedia
|
wiki_594_chunk_34
|
Tree (data structure)
|
Using this definition, dedicated terminology can be provided for generalizations of unordered trees that correspond to distinguished subsets of the listed conditions:
(1,2,3) – directed pseudotree,
(3) – directed pseudoforest,
(3,4) – unordered forest (whose components are unordered trees),
(4) – directed acyclic graph, assumed that is finite,
(1',4) – acyclic accessible pointed graph (then condition (2) holds implicitly).
|
wikipedia
|
wiki_4050_chunk_19
|
Position-independent code
|
TSS
In IBM S/360 Time Sharing System (TSS/360 and TSS/370) each procedure may have a read-only public CSECT and a writable private Prototype Section (PSECT). A caller loads a V-constant for the routine into General Register 15 (GR15) and copies an R-constant for the routine's PSECT into the 19th word of the save area pointed to be GR13. The Dynamic Loader does not load program pages or resolve address constants until the first page fault. Position-independent executables
|
wikipedia
|
wiki_36474_chunk_1
|
Infrastructure (number theory)
|
In 1972, D. Shanks first discovered the infrastructure of a real quadratic number field and applied his baby-step giant-step algorithm to compute the regulator of such a field in binary operations (for every ), where is the discriminant of the quadratic field; previous methods required binary operations. Ten years later, H. W. Lenstra published a mathematical framework describing the infrastructure of a real quadratic number field in terms of "circular groups". It was also described by R. Schoof and H. C. Williams, and later extended by H. C. Williams, G. W. Dueck and B. K. Schmid to certain cubic number fields of unit rank one and by J. Buchmann and H. C. Williams to all number fields of unit rank one. In his habilitation thesis, J. Buchmann presented a baby-step giant-step algorithm to compute the regulator of a number field of arbitrary unit rank. The first description of infrastructures in number fields of arbitrary unit rank was given by R. Schoof using Arakelov divisors in 2008.
|
wikipedia
|
wiki_13358_chunk_1
|
Famine Early Warning Systems Network
|
Aims
FEWS NET aims at providing information to governments, international relief agencies, NGOs, journalists, and researchers planning for, responding to, and reporting on humanitarian crises. With support from a technical team in Washington, D.C., FEWS NET staff based in more than 20 country offices collaborate with US government agencies, national government ministries and international partners to collect data and produce objective, forward-looking analysis on the world's most food-insecure countries. Using an integrated approach that considers climate, agriculture production, prices, trade, nutrition, and other factors, together with an understanding of local livelihoods, FEWS NET forecasts most likely outcomes and anticipates change six to twelve months in advance. To help decision-makers and relief agencies plan for food emergencies, FEWS NET publishes monthly reports (available on its web site) on current and projected food insecurity, up-to-the-minute alerts on emerging or likely crises, and specialized reports on weather hazards, crops, market prices, and food assistance.
|
wikipedia
|
wiki_19282_chunk_5
|
Cuneiform (Unicode block)
|
The following table allows matching of Borger's 1981 and 2003 numbering with Unicode characters
The "primary" transliteration column has the glyphs' Sumerian values as given by the official glyph name, slightly modified here for legibility by including traditional assyriological symbols such as "x" rather than "TIMES". The exact Unicode names can be unambiguously recovered by prefixing,
"CUNEIFORM [NUMERIC] SIGN", replacing "TIMES" for "x", "PLUS" for "+" and "OVER" for "/", "ASTERISK" for "*", "H" for "Ḫ", "SH" for "Š", and switching to uppercase.
|
wikipedia
|
wiki_6671_chunk_27
|
Large eddy simulation
|
Germano et al. identified a number of studies using the Smagorinsky model that each found different values for the Smagorinsky constant for different flow configurations. In an attempt to formulate a more universal approach to SGS models, Germano et al. proposed a dynamic Smagorinsky model, which utilized two filters: a grid LES filter, denoted , and a test LES filter, denoted for any turbulent field . The test filter is larger in size than the grid filter and adds an additional smoothing of the turbulence field over the already smoothed fields represented by the LES. Applying the test filter to the LES equations (which are obtained by applying the "grid" filter to Navier-Stokes equations) results in a new set of equations that are identical in form but with the SGS stress replaced by . Germano {\it et} al. noted that even though neither nor can be computed exactly because of the presence of unresolved scales, there is an exact relation connecting these two tensors. This relation, known as the Germano identity is
|
wikipedia
|
wiki_18228_chunk_27
|
Wireless ad hoc network
|
Implementation difficulties
With a time evolving network it is clear we should expect variations in network performance due to no fixed architecture (no fixed connections). Furthermore, since network topology determines interference and thus connectivity, the mobility pattern of devices within the network will impact on network performance, possibly resulting in data having to be resent a lot of times (increased delay) and finally allocation of network resources such as power remains unclear.
Finally, finding a model that accurately represents human mobility whilst remaining mathematically tractable remains an open problem due to the large range of factors that influence it.
Some typical models used include the random walk, random waypoint and levy flight models.
|
wikipedia
|
wiki_38561_chunk_18
|
Comparison of programming paradigms
|
See also
Comparison of programming languages
Comparison of programming languages (basic instructions)
Granularity#Computing
Message passing
Subroutine References Further reading
"A Memory Allocator" by Doug Lea
"Dynamic Memory Allocation and Linked Data Structures" by (Scottish Qualifications Authority)
"Inside A Storage Allocator" by Dr. Newcomer Ph.D
|
wikipedia
|
wiki_12856_chunk_33
|
Medical genetics
|
One area in which population categories can be important considerations in genetics research is in controlling for confounding between population substructure, environmental exposures, and health outcomes. Association studies can produce spurious results if cases and controls have differing allele frequencies for genes that are not related to the disease being studied, although the magnitude of this problem in genetic association studies is subject to debate. Various methods have been developed to detect and account for population substructure, but these methods can be difficult to apply in practice.
|
wikipedia
|
wiki_30521_chunk_53
|
Plancherel theorem for spherical functions
|
The many roles of Harish-Chandra's c-function in non-commutative harmonic analysis are surveyed in . Although it was originally introduced by Harish-Chandra in the asymptotic expansions of spherical functions, discussed above, it was also soon understood to be intimately related to intertwining operators between induced representations, first studied in this context by . These operators exhibit the unitary equivalence between πλ and πsλ for s in the Weyl group and a c-function cs(λ) can be attached to each such operator: namely the value at 1 of the intertwining operator applied to ξ0, the constant function 1, in L2(K/M). Equivalently, since ξ0 is up to scalar multiplication the unique vector fixed by K, it is an eigenvector of the intertwining operator with eigenvalue cs(λ).
These operators all act on the same space L2(K/M), which can be identified with the representation induced from
the 1-dimensional representation defined by λ on MAN. Once A has been chosen, the compact subgroup M is uniquely determined as the centraliser of A in K. The nilpotent subgroup N, however, depends on a choice of a Weyl chamber in , the various choices being permuted by the Weyl group W = M ' / M, where M ' is the normaliser of A in K. The standard intertwining operator corresponding to (s, λ) is defined on the induced representation by
|
wikipedia
|
wiki_4957_chunk_8
|
Strassen algorithm
|
The number of additions and multiplications required in the Strassen algorithm can be calculated as follows: let be the number of operations for a matrix. Then by recursive application of the Strassen algorithm, we see that , for some constant that depends on the number of additions performed at each application of the algorithm. Hence , i.e., the asymptotic complexity for multiplying matrices of size using the Strassen algorithm is . The reduction in the number of arithmetic operations however comes at the price of a somewhat reduced numerical stability, and the algorithm also requires significantly more memory compared to the naive algorithm. Both initial matrices must have their dimensions expanded to the next power of 2, which results in storing up to four times as many elements, and the seven auxiliary matrices each contain a quarter of the elements in the expanded ones.
|
wikipedia
|
wiki_19253_chunk_1
|
World Meteorological Organization squares
|
Each 10°x10° square is allocated a number between 1000 and 7817. The numbering system is based first on "global quadrant" numbers where 1=NE, 3=SE, 5=SW, 7=NW which gives the initial digit of any square code (1xxx, 3xxx, 5xxx, 7xxx). The second digit (x0xx through x8xx) indicates the number of tens of degrees latitude (north in global quadrants 1 and 7, south in global quadrants 3 and 5) of the 'minimum' square boundary (nearest to the Equator), i.e. a cell extending between 10°N and 20°N (or 10°S and 20°S) has this digit = 1, a cell extending between 20°N and 30°N has this digit = 2, etc. The third and fourth digits (xx00 through xx17) similarly indicate the number of tens of degrees of longitude of the 'minimum' square boundary, nearest to the Prime Meridian. By way of illustration, the square 1000 thus extends from 0°N to 10°N, 0°E to 10°E, and the square 7817 from 80°N to 90°N, 170°W to 180°W, adjacent to the major portion of the International Date Line. In this manner, reverse-engineering (decoding) the relevant square boundaries from any particular WMO Square identifier is straightforward, in contrast to some other similar systems e.g. Marsden squares.
|
wikipedia
|
wiki_7997_chunk_7
|
Advanced Idea Mechanics
|
Technology
A.I.M. has created three major implements of deadly potential which stand far above the rest of their accomplishments. The greatest of these was the Cosmic Cube, a device capable of altering reality. A.I.M. did not realize that the cube was merely a containment device, in which the real power was an entity accidentally drawn into this dimension. The Cosmic Cube eventually evolved into Kubik. Their second achievement was the Super-Adaptoid, an android capable of mimicking the appearance and superpowers of other beings. The Super-Adaptoid's powers were made possible by incorporating a sliver of the Cosmic Cube into its form. When Kubik repossessed the sliver after defeating the Adaptoid, the android was rendered inanimate. A.I.M.'s third and final major achievement was the creation of MODOK (Mental Organism Designed Only for Killing), an artificially mutated human with an enormous head and corresponding massive computational brain, and psionic abilities. MODOK was originally an ordinary A.I.M. scientist, George Tarleton, who was selected by A.I.M.'s leader at the time, the Scientist Supreme, to be the subject of the bionic and genetic experiments that turned him into MODOK. After his transformation, MODOK killed the Scientist Supreme and took control of A.I.M., and later took advantage of the organizational chaos following the destruction of HYDRA Island and the deaths of Baron Strucker and most of HYDRA's leading members to sever all of A.I.M.'s ties with HYDRA. A.I.M. has remained an independent organization ever since.
|
wikipedia
|
wiki_18985_chunk_32
|
Reader's Digest Select Editions
|
2019Volume 363 - #1 Don't Believe It - Charlie Donlea
Rainy Day Friends - Jill Shalvis
By His Own Hand - Neal Griffin
When the Men Were Gone - Marjorie Herrera LewisVolume 364 - #2 The Last Time I Lied - Riley Sager
A Borrowing of Bones - Paula Munier
Not Our Kind - Kitty Zeldis
A Gathering of Secrets - Linda CastilloVolume 365 - #3 Past Tense - Lee Child
Hope on the Inside - Marie Bostwick
Forever and a Day - Anthony Horowitz
The Last Road Trip - Gareth CrockerVolume 366 - #4 Judgment - Joseph Finder
The Military Wife - Laura Trentham
Desolation Mountain - William Kent Krueger
An Anonymous Girl - Greer Hendricks and Sarah PekkanenVolume 367 - #5 Long Road to Mercy - David Baldacci
The Lieutenant's Nurse - Sarah Ackerman
Things You Save in a Fire - Katherine Center
The Noel Stranger - Richard Paul EvansVolume 368 – #6 Dark Site – Patrick Lee
Dating By The Book – Mary Ann Marlowe
Wolf Pack – C.J Fox
Deck The Hounds – David Rosenfelt
|
wikipedia
|
wiki_31803_chunk_51
|
Dark energy
|
External links
"Report of the Dark Energy Task Force"
"HubbleSite.org – Dark Energy Website" Multimedia presentation explores the science of dark energy and Hubble's role in its discovery.
"Surveying the dark side"
"Dark energy and 3-manifold topology" Acta Physica Polonica 38 (2007), pp. 3633–3639
The Dark Energy Survey
The Joint Dark Energy Mission
Harvard: Dark Energy Found Stifling Growth in Universe, primary source
April 2010 Smithsonian Magazine Article
HETDEX Dark energy experiment
Dark Energy FAQ
"The Dark Universe" Erik Verlinde, Sabine Hossenfelder and Catherine Heymans debate whether theories of dark matter & dark energy are true
Euclid ESA Satellite, a mission to map the geometry of the dark universe
Dark Energy, What it could be?
|
wikipedia
|
wiki_29387_chunk_8
|
Words of estimative probability
|
Stochastic analysis
Since combining quantitative, probabilistic information with estimates is successful in business forecasting, marketing, medicine, and epidemiology it should be implemented by the intelligence community as well. These fields have used probability theory and Bayesian analysis as forecasting tools. Using probability theory and other stochastic methods are appealing because they rely on rationality and mathematical rigor, are less subject to analytical bias, and such findings appear to be unambiguous. As an opposing argument, it is indisputable that few analysts or intelligence consumers have the stomach for numerical calculation. Additionally, Bruce Blair, Director of the Center for Defense Information, a proponent of quantitative methods for the IC, points out; intelligence information from secret sources is often murky, and the application of advanced math is not sufficient to make it more reliable. However, he sees a place for stochastic analyses over a very long period, it “points to a fairly slow learning curve that also challenges the wisdom of making preemption a cornerstone of U.S. security strategy.”
The reservations stated are significant: Mathematical and statistical analyses require a lot of work without rapid and necessarily commensurate gains in accuracy, speed or comprehension.
|
wikipedia
|
wiki_490_chunk_18
|
Quantum computing
|
Identifying cryptographic systems that may be secure against quantum algorithms is an actively researched topic under the field of post-quantum cryptography. Some public-key algorithms are based on problems other than the integer factorization and discrete logarithm problems to which Shor's algorithm applies, like the McEliece cryptosystem based on a problem in coding theory. Lattice-based cryptosystems are also not known to be broken by quantum computers, and finding a polynomial time algorithm for solving the dihedral hidden subgroup problem, which would break many lattice based cryptosystems, is a well-studied open problem. It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2n/2 invocations of the underlying cryptographic algorithm, compared with roughly 2n in the classical case, meaning that symmetric key lengths are effectively halved: AES-256 would have the same security against an attack using Grover's algorithm that AES-128 has against classical brute-force search (see Key size).
|
wikipedia
|
wiki_5068_chunk_4
|
1979–80 United States network television schedule
|
Returning Series60 MinutesAliceThe Bad News BearsBarnaby JonesThe ChisholmsDallasThe Dukes of HazzardHawaii Five-OThe Incredible HulkThe JeffersonsLou GrantM*A*S*HOne Day at a TimeThe WaltonsThe White ShadowWKRP in CincinnatiNew SeriesArchie Bunker's Place Beyond Westworld *Big Shamus, Little ShamusCalifornia FeverThe Contender *Flo *Hagen *House Calls *Knots LandingThe Last ResortPalmerstown, U.S.A. *ParisPhyl & Mikhy *The Stockard Channing Show *Struck by LightningThat's My Line *The Tim Conway Show *Trapper John, M.D.Universe *Walter Cronkite's Universe *Working StiffsYoung MaverickNot returning from 1978–79:All in the FamilyThe Amazing Spider-ManThe American GirlsBillyDorothyFlatbushFlying HighGood TimesHanging InIn the BeginningJust FriendsKazMarried: The First YearMaryThe Mary Tyler Moore HourMiss Winslow and SonMoses the LawgiverThe New Adventures of Wonder WomanThe Paper ChaseRhodaTime ExpressNBC
|
wikipedia
|
wiki_2252_chunk_14
|
Dynamic mechanical analysis
|
Changing sample geometry and fixtures can make stress and strain analyzers virtually indifferent of one another except at the extreme ends of sample phases, i.e. really fluid or rigid materials. Common geometries and fixtures for axial analyzers include three-point and four-point bending, dual and single cantilever, parallel plate and variants, bulk, extension/tensile, and shear plates and sandwiches. Geometries and fixtures for torsional analyzers consist of parallel plates, cone-and-plate, couette, and torsional beam and braid. In order to utilize DMA to characterize materials, the fact that small dimensional changes can also lead to large inaccuracies in certain tests needs to be addressed. Inertia and shear heating can affect the results of either forced or free resonance analyzers, especially in fluid samples.
|
wikipedia
|
wiki_33355_chunk_2
|
Centre for Studies in Civilizations
|
Project of History of Indian Science, Philosophy and Culture (PHISPC) - supervised and administered by the center, entirely funded by the Ministry of Human Resources and Development. Coordinating efforts to publish fifty volumes of books and anthologies, thirty of which will be major volumes, and twenty of which are to be monographs. According to the last update on the projects website, seven volumes and eleven monographs have been published, and in the financial year 2001–02, 7-8 more volumes were to be published, and one monograph
Consciousness, Science, Society and Value (CONSSAV) - part of PHISPC - approved by the Department of Education, Ministry of Human Resources Development. According to its brief description, CONSSAV will "explore the role of consciousness in its various levels of awareness, in understanding and expounding the development of science, society and values. Consciousness as has been conceived and theorized in different traditions, or rather civilizations, will be studied and explored in detail." The project will consist of four volumes consisting of six parts.
Sandhan - interdisciplinary journal
|
wikipedia
|
wiki_6197_chunk_15
|
Human behaviour genetics
|
Also possible are the "children of twins" design (holding maternal genetic contributions equal across children with paternal genetics and family environments) and the "virtual twins" design - unrelated children adopted into a family who are very close or identical in age to biological children or other adopted children in the family. While the classical twin study has been criticized they continue to be of high utility. There are several dozen major studies ongoing, in countries as diverse as the USA, UK, Germany, France, the Netherlands, and Australia, and the method is used widely on phenotypes as diverse as dental caries, body mass index, ageing, substance abuse, sexuality, cognitive abilities, personality, values, and a wide range of psychiatric disorders. This is broad utility is reflected in several thousands of peer-review papers, and several dedicated societies and journals.
|
wikipedia
|
wiki_20232_chunk_9
|
Information-based complexity
|
An example: mathematical finance
Very high dimensional integrals are common in finance. For example, computing expected cash flows for a collateralized mortgage obligation (CMO) requires the calculation of a number of dimensional integrals, the being the number of months in years. Recall that if a worst case assurance is required the time is of order time units. Even if the error is not small, say this is time units. People in finance have long been using the Monte Carlo method (MC), an instance of a randomized algorithm. Then in 1994 a research group at Columbia University (Papageorgiou, Paskov, Traub, Woźniakowski) discovered that the quasi-Monte Carlo (QMC) method using low discrepancy sequences beat MC by one to three orders of magnitude. The results were reported to a number of Wall Street finance to considerable initial skepticism. The results were first published by Paskov and Traub, Faster Valuation of Financial Derivatives, Journal of Portfolio Management 22, 113-120. Today QMC is widely used in the financial sector to value financial derivatives.
|
wikipedia
|
wiki_34001_chunk_13
|
Streaming algorithm
|
Let A be the sequence of data stream of length M whose cardinality need to be determined. Let BITMAP [0...L − 1] be the
hash space where the (hashedvalues) are recorded. The below algorithm then determines approximate cardinality of A.Procedure FM-Sketch:
|
wikipedia
|
wiki_29866_chunk_8
|
Ecological study
|
The term “ecological fallacy” means that risk-associations apparent between different groups of people may not accurately reflect the true association between individuals within those groups. Ecological studies should include as many known risk-modifying factors for any outcome as possible, adding others if warranted. Then the results should be evaluated by other methods, using, for example, Hill’s criteria for causality in a biological system. References Epidemiology
Design of experiments
|
wikipedia
|
wiki_4004_chunk_2
|
Sorting network
|
Sorting networks can be implemented either in hardware or in software. Donald Knuth describes how the comparators for binary integers can be implemented as simple, three-state electronic devices. Batcher, in 1968, suggested using them to construct switching networks for computer hardware, replacing both buses and the faster, but more expensive, crossbar switches. Since the 2000s, sorting nets (especially bitonic mergesort) are used by the GPGPU community for constructing sorting algorithms to run on graphics processing units. Introduction
|
wikipedia
|
wiki_24793_chunk_22
|
Radio-frequency microelectromechanical system
|
Passive subarrays based on RF MEMS phase shifters may be used to lower the amount of T/R modules in an active electronically scanned array. The statement is illustrated with examples in Fig. 6: assume a one-by-eight passive subarray is used for transmit as well as receive, with following characteristics: f = 38 GHz, Gr = Gt = 10 dBi, BW = 2 GHz, Pt = 4 W. The low loss (6.75 ps/dB) and good power handling (500 mW) of the RF MEMS phase shifters allow an EIRP of 40 W and a Gr/T of 0.036 1/K. EIRP, also referred to as the power-aperture product, is the product of the transmit gain, Gt, and the transmit power, Pt. Gr/T is the quotient of the receive gain and the antenna noise temperature. A high EIRP and Gr/T are a prerequisite for long-range detection. The EIRP and Gr/T are a function of the number of antenna elements per subarray and of the maximum scanning angle. The number of antenna elements per subarray should be chosen in order to optimize the EIRP or the EIRP x Gr/T product, as shown in Fig. 7 and Fig. 8. The radar range equation can be used to calculate the maximum range for which targets can be detected with 10 dB of SNR at the input of the receiver.
|
wikipedia
|
wiki_2115_chunk_42
|
Software patents under the European Patent Convention
|
Further reading
Keith Beresford, Patenting Software Under the European Patent Convention, Sweet & Maxwell, 2000. .
: "Computer-implemented inventions"
European Patent Office, Examination of computer-implemented inventions at the European Patent Office with particular attention to computer-implemented business methods, Official Journal EPO, 11/2007, pp 594–600.
Philip Leith, Software and Patents in Europe, Cambridge University Press, UK, 2007, , pp. 212
|
wikipedia
|
wiki_4801_chunk_8
|
RMI (energy organization)
|
Advanced Energy, in partnership with RMI, has announced a Request for Information (RFI) for Electric Vehicle Supply Equipment (EVSE) specific to charging stations for plug-in electric vehicles (EV). Books Books published by RMI include: Winning the Oil Endgame: Innovation for Profit, Jobs and Security (2005) (Available Online in PDF)
Small is Profitable: The Hidden Economic Benefits of Making Electrical Resources the Right Size (2003)
Natural Capitalism: Creating the Next Industrial Revolution (2000)
Reinventing Fire: Bold Business Solutions for the New Energy Era (2011) .
|
wikipedia
|
wiki_1833_chunk_8
|
The Nine Chapters on the Mathematical Art
|
Major contributions Real number system
The Nine Chapters on the Mathematical Art does not discuss natural numbers, that is, positive integers and their operations, but they are widely used and written on the basis of natural numbers. Although it is not a book on fractions, the meaning, nature, and four operations of fractions are fully discussed. For example: combined division (addition), subtraction (subtraction), multiplication (multiplication), warp division (division), division (comparison size), reduction (simplified fraction), and bisector (average).
|
wikipedia
|
wiki_10056_chunk_1
|
Software package metrics
|
Number of classes and interfaces: The number of concrete and abstract classes (and interfaces) in the package is an indicator of the extensibility of the package.
Afferent couplings (Ca): The number of classes in other packages that depend upon classes within the package is an indicator of the package's responsibility. Afferent couplings signal inward.
Efferent couplings (Ce): The number of classes in other packages that the classes in a package depend upon is an indicator of the package's dependence on externalities. Efferent couplings signal outward.
Abstractness (A): The ratio of the number of abstract classes (and interfaces) in the analyzed package to the total number of classes in the analyzed package. The range for this metric is 0 to 1, with A=0 indicating a completely concrete package and A=1 indicating a completely abstract package.
Instability (I): The ratio of efferent coupling (Ce) to total coupling (Ce + Ca) such that I = Ce / (Ce + Ca). This metric is an indicator of the package's resilience to change. The range for this metric is 0 to 1, with I=0 indicating a completely stable package and I=1 indicating a completely unstable package.
Distance from the main sequence (D): The perpendicular distance of a package from the idealized line A + I = 1. D is calculated as D = | A + I - 1 |. This metric is an indicator of the package's balance between abstractness and stability. A package squarely on the main sequence is optimally balanced with respect to its abstractness and stability. Ideal packages are either completely abstract and stable (I=0, A=1) or completely concrete and unstable (I=1, A=0). The range for this metric is 0 to 1, with D=0 indicating a package that is coincident with the main sequence and D=1 indicating a package that is as far from the main sequence as possible.
Package dependency cycles: Package dependency cycles are reported along with the hierarchical paths of packages participating in package dependency cycles.
|
wikipedia
|
wiki_18429_chunk_3
|
Programming idiom
|
Examples of simple idioms Printing Hello World One of the most common starting points to learn to program or notice the syntax differences between a known language and a new one. It has several implementations, among them the code fragments for C++:
std::cout << "Hello World\n"; For Java:
System.out.println("Hello World"); Inserting an element in an array
This idiom helps developers understand how to manipulate collections in a given language, particularly inserting an element x at a position i in a list s and moving the elements to its right. Code fragments:
|
wikipedia
|
wiki_939_chunk_11
|
Ford–Fulkerson algorithm
|
Another non-terminating example based on the Euclidean algorithm is given by , where they also show that the worst case running-time of the Ford-Fulkerson algorithm on a network in ordinal numbers is . Python implementation of Edmonds–Karp algorithm
import collections class Graph:
"""This class represents a directed graph using adjacency matrix representation.""" def __init__(self, graph):
self.graph = graph # residual graph
self.row = len(graph)
|
wikipedia
|
wiki_2017_chunk_6
|
Scale-free network
|
On a theoretical level, refinements to the abstract definition of scale-free have been proposed. For example, Li et al. (2005) recently offered a potentially more precise "scale-free metric". Briefly, let G be a graph with edge set E, and denote the degree of a vertex (that is, the number of edges incident to ) by . Define This is maximized when high-degree nodes are connected to other high-degree nodes. Now define
|
wikipedia
|
wiki_20689_chunk_16
|
CSA (database company)
|
Health and Safety Science Abstracts
Authors are ProQuest - CSA Illumina and the University of Southern California. This database covers the relevant literature pertaining to public health, safety, and industrial hygiene. This also includes risks, hazards, and plausible solutions that affect individuals. Topical coverage includes aviation safety, aerospace safety, environmental safety, nuclear safety, medical safety, occupational safety, ergonomics, pollution, waste disposal, radiation, pesticides, epidemics, "and countless other phenomena having the potential to threaten the public, the environment, or the workplace itself...". The equivalent printed form is "Health and Safety Science Abstracts (1981 - 2003)".
|
wikipedia
|
wiki_3793_chunk_1
|
Geocode
|
Typical geocodes and entities represented by it:
Country code and subdivision code. Polygon of the administrative boundaries of a country or a subdivision. The main examples are ISO codes: ISO 3166-1 alpha-2 code (e.g. AF for Afghanistan or BR for Brazil), and its subdivision conventions, such as AF subdivision codes (e.g. AF-GHO for Ghor province) or BR subdivision codes (e.g. BR-AM for Amazonas state).
DGG cell ID. Identifier of a cell of a discrete global grid: a Geohash code (e.g. ~0.023 km² cell 6vjyngd at the Brazilian's center) or an OLC code (e.g. ~0.004 km² cell 58PJ642P+4 at the same point).
Postal code. Polygon of a postal area: a CEP code (e.g. 70040 represents a Brazilian's central area for postal distribution).
|
wikipedia
|
wiki_37947_chunk_8
|
Concurrent data structure
|
A key measure for performance is scalability, captured by the speedup of the implementation. Speedup is a measure of how
effectively the application is using the machine it is running
on. On a machine with P processors, the speedup is the ratio of the structures execution time on a single processor to its execution time on T processors. Ideally, we want linear speedup: we would like to achieve a
speedup of P when using P processors. Data structures whose
speedup grows with P are called scalable. The extent to which one can scale the performance of a concurrent data structure is captured by a formula known as Amdahl's law and
more refined versions of it such as Gustafson's law.
|
wikipedia
|
wiki_35610_chunk_3
|
IEEE Jack S. Kilby Signal Processing Medal
|
Recipients
The following people have received the IEEE Jack S. Kilby Signal Processing Medal:
2021: Emmanuel Candès, Justin Romberg and Terence Tao
2020: Ramalingam Chellappa
2019: Alan Willsky
2018: Bede Liu
2017: Martin Vetterli
2016: Louis Scharf
2015: Harry L. Van Trees
2014: Thomas P. Barnwell, III
2013: Bishnu S. Atal
2012: G. Clifford Carter
2011: Ingrid Daubechies
2010: Ronald W. Schafer
2009: Charles Sidney Burrus
2008: Robert M. Gray
2007: Alan V. Oppenheim
2006: Thomas Kailath
2005: Fumitada Itakura
2004: Thomas W. Parks and James H. McClellan
2003: Hans W. Schuessler
2002: James W. Cooley
2001: Thomas S. Huang and Arun N. Netravali
2000: James F. Kaiser
1999: Lawrence R. Rabiner
1998: Thomas G. Stockham
1997: Bernard Gold and Charles M. Rader
|
wikipedia
|
wiki_5992_chunk_5
|
Computer Professionals' Union
|
Free Information: CPU believes that information in all forms is the collective knowledge and experience of humankind. It believes that no one owns information; therefore, anyone can use and develop it for the benefit of mankind and development of society.
Privacy of Information: Computers and telecommunications networks have brought consumers many conveniences. But, the organization alleges, advanced technologies pose serious threats to privacy. CPU believes that information about us, our families, where we live, where we work, people we call, sites we surf, stores we shop in, etc., should be kept private.
Open Source: CPU fully supports the open source initiative. One of the group's aims is to convince fellow technology practitioners and the government to abandon the use of software by companies such as Microsoft and Oracle Corporation.
Right to organize: CPU members believe that as workers, they have the right to form labor unions and associations that will collectively fight for workers' rights and welfare.
Use of Appropriate Technology: CPU believes that technology alone cannot solve political and social problems. It aims to dispel myths about the infallibility of technological systems and neutrality of science and technology.
|
wikipedia
|
wiki_35987_chunk_12
|
Radioanalytical chemistry
|
Since small amounts of radionuclides are typically being analyzed, the mechanics of manipulating tiny quantities is challenging. This problem is classically addressed by the use of carrier ions. Thus, carrier addition involves the addition of a known mass of stable ion to radionuclide-containing sample solution. The carrier is of the identical element but is non-radioactive. The carrier and the radionuclide of interest have identical chemical properties. Typically the amount of carrier added is conventionally selected for the ease of weighing such that the accuracy of the resultant weight is within 1%. For alpha particles, special techniques must be applied to obtain the required thin sample sources. The use of carries was heavily used by Marie Curie and was employed in the first demonstration of nuclear fission.
|
wikipedia
|
wiki_33615_chunk_5
|
Demonstrations in Physics
|
Unit 3, Part I - Waves and Sound
Episode 31. Waves: Kinds and Properties
Episode 32. Sound Waves - Sources of Sound
Frequency, pitch, how they relate to each other and correspond to musical notes.
Vibrating systems cause sound, sound requires a medium to travel.
Flexing different metal plates to produce different pitches.
Rotating plate with drilled holes and air blown through them – difference in sound between symmetrically drilled ones (music) and asymmetrically drilled ones (noise).
Vibrating a meter stick at different frequencies when different lengths stick out past a table.
Varying frequencies rubbing a thumbnail across the milled edge of a coin, when tearing various pieces of cloth, using different files on wood, or riffling a deck of cards.
Human hearing range (16 Hz to 16 kHz)
Nodes in vibrating bars and tuning forks.
Notched stick with a spinning propeller.
Turing an orchestra – why they don’t use a piano.
Episode 33. Vibrating Bars and Strings
Bar mounted on a resonating chamber, mounted at 2 important places.
Second, "identical" bar, beats between two bars that are 1 Hz out of tune.
Beats between two tuning forks, one with rubber bands around the end of a prong to reduce its frequency.
Vibrations of a metal bar, shown on screen with a long pipe.
If a vibrating bar is grasped at the nodes it will keep vibrating, anywhere else it will stop.
Nodes on a vibrating bar are 0.224 of the bar length from each end.
Tuning forks on resonant boxes – transferring vibration from one to another (didn’t work).
Musical sticks.
Forming standing waves on a string, changing the number of nodes and antinodes at constant frequency and length by changing the tension.
Transferring vibrations from one vibrating bar to another through resonance.
Episode 34. Resonance - Forced Vibrations
Episode 35. Sounding Pipes
Episode 36. Vibrating Rods and Plates
Episode 37. Miscellaneous Adventures in Sound
|
wikipedia
|
wiki_17873_chunk_8
|
Organic photochemistry
|
The influence of the radiation on the reaction rate can often be represented by a power law based on the quantum flow density, i.e. the mole light quantum (previously measured in the unit Einstein) per area and time. One objective in the design of reactors is therefore to determine the economically most favorable dimensioning with regard to an optimization of the quantum current density. Case studies [2+2] Cycloadditions
Olefins dimerize upon UV-irradiation.
|
wikipedia
|
wiki_1012_chunk_18
|
Ionization energy
|
Ionization energy decreases when
Transitioning to a new period: an alkali metal easily loses one electron to leave an octet or pseudo-noble gas configuration, so those elements have only small values for IE.
Moving from the s-block to the p-block: a p-orbital loses an electron more easily. An example is beryllium to boron, with electron configuration 1s2 2s2 2p1. The 2s electrons shield the higher-energy 2p electron from the nucleus, making it slightly easier to remove. This also happens in magnesium to aluminum.
Occupying a p-subshell with its first electron with spin opposed to the other electrons: such as in nitrogen (: 14.5 eV) to oxygen (: 13.6 eV), as well as phosphorus (: 10.48 eV) to sulfur (: 10.36 eV). The reason for this is because oxygen, sulfur and selenium all have dipping ionization energies because of shielding effects. However, this discontinues starting from tellurium where the shielding is too small to produce a dip.
Moving from the d-block to the p-block: as in the case of zinc (: 9.4 eV) to gallium (: 6.0 eV)
Special case: decrease from lead (: 7.42 eV) to bismuth (: 7.29 eV). This cannot be attributed to size (the difference is minimal: lead has a covalent radius of 146 pm whereas bismuth's is 148 pm). Nor can it be attributed to relativistic stabilization of the 6s orbital, as this factor is very similar in the two adjacent elements. Other factors suggest contrary to fact that bismuth should have the higher IE, due to its half-filled orbital (adding stabilization), position in the periodic table (Bi is further right so it should be less metallic than Pb), and it has one more proton (contributes to the [effective] nuclear charge).
Special case: decrease from radium (: 5.27 eV) to actinium (: 5.17 eV) which is a switch from an s to a d orbital. However the analogous switch from barium (: 5.2 eV) to lanthanum (: 5.6 eV) does not show a downward change.
Lutetium () and lawrencium () both have ionization energies lower than the previous elements. In both cases the last electron added starts a new subshell: 5d for Lu with electron configuration [Xe] 4f14 5d1 6s2, and 7p for Lr with configuration [Rn] 5f4 7s2 7p1. These dips in ionization energies have since been used as evidence in the ongoing debate over whether Lu and Lr should be placed in Group 3 of the periodic table instead of lanthanum (La) and actinium (Ac).
|
wikipedia
|
wiki_14695_chunk_1
|
Kaleidoscope (programming language)
|
Compare the two code segments, both of which allow a user to drag the level of mercury in a simple graphical thermometer with the mouse. Without constraints: while mouse.button = down do
old <- mercury.top;
mercury.top <- mouse.location.y;
temperature <- mercury.height / scale;
if old < mercury.top then
delta_grey( old, mercury.top );
display_number( temperature );
elseif old > mercury.top then
delta_white( mercury.top, old );
display_number( temperature );
end if;
end while; With constraints:
|
wikipedia
|
wiki_5878_chunk_25
|
Computational sociology
|
Impact on science
In order for the study of computational sociology to be effective, there has to be valuable innovations. These innovation can be of the form of new data analytics tools, better models and algorithms. The advent of such innovation will be a boom for the scientific community in large. Impact on society
One of the major challenges of computational sociology is the modelling of social processes . Various law and policy makers would be able to see efficient and effective paths to issue new guidelines and the mass in general would be able to evaluate and gain fair understanding of the options presented in front of them enabling an open and well balanced decision process. .
|
wikipedia
|
wiki_29005_chunk_23
|
IUPAC nomenclature of inorganic chemistry 2005
|
Rings and chains
The recommendations describe three ways of assigning "parent" names to homonuclear monocyclic hydrides (i.e single rings consisting of one element):
the Hantzsch–Widman nomenclature (the method preferred for rings of size 3–10)
"skeletal replacement nomenclature"—specifying the replacement of carbon atoms in the corresponding carbon compound with atoms of another element (e.g. silicon becomes sila, germanium, germa) and a multiplicative prefix tri, tetra, penta etc)( the method preferred for rings greater than 10)
by adding the prefix cyclo to the name of the corresponding unbranched, unsubstituted chain
|
wikipedia
|
wiki_14_chunk_32
|
Ada (programming language)
|
for aWeekday in Weekday'Range loop -- loop over an enumeration
Put_Line ( Weekday'Image(aWeekday) ); -- output string representation of an enumeration
if aWeekday in Working_Day then -- check of a subtype of an enumeration
Put_Line ( " to work for " &
Working_Hours'Image (Work_Load(aWeekday)) ); -- access into a lookup table
end if;
end loop; Packages, procedures and functions
Among the parts of an Ada program are packages, procedures and functions.
|
wikipedia
|
wiki_15322_chunk_4
|
Advancing Physics
|
The IOP have produced and published two books and two CD-ROMs to support the course. There is one book and CD-ROM for both the AS section of the course and A2 section. The two books supposedly contain all theory and methods that will be required in the exam whilst the CD-ROM offers a more in depth look at every topic as well other resources such as diagrams for show on an interactive whiteboard. The main method of browsing the text and other data on the CD is via the Folio Views software. Also included on the CD are a number of software packages such as Modellus, a package to demonstrate the effects of mathematical models and Worldmaker, a package that can help students model situations and run simulations based on events occurring. The IOP have also created examples using these programmes linked to the course and these are included on the CD and also accessible through the main browser. In addition support materials are provided via. the IoP Advancing Physics website.
|
wikipedia
|
wiki_2938_chunk_22
|
Ring of symmetric functions
|
The set of monomial symmetric functions parametrized by partitions form a basis of ΛR as a graded R-module, those parametrized by partitions of d being homogeneous of degree d; the same is true for the set of Schur functions (also parametrized by partitions).
ΛR is isomorphic as a graded R-algebra to a polynomial ring R[Y1,Y2, ...] in infinitely many variables, where Yi is given degree i for all i > 0, one isomorphism being the one that sends Yi to ei ∈ ΛR for every i.
There is an involutory automorphism ω of ΛR that interchanges the elementary symmetric functions ei and the complete homogeneous symmetric function hi for all i. It also sends each power sum symmetric function pi to (−1)i−1pi, and it permutes the Schur functions among each other, interchanging sλ and sλt where λt is the transpose partition of λ.
|
wikipedia
|
wiki_19132_chunk_5
|
Automatically Tuned Linear Algebra Software
|
Optimization of the level 2 BLAS uses parameterization and multiple implementation
With data and operations to perform the function is usually limited by bandwidth to memory, and thus there is not much opportunity for optimization
All routines in the ATLAS level 2 BLAS are built from two Level 2 BLAS kernels:
GEMV—matrix by vector multiply update: GER—general rank 1 update from an outer product: Optimization of the level 3 BLAS uses code generation and the other two techniques
Since we have ops with only data, there are many opportunities for optimization
|
wikipedia
|
wiki_6057_chunk_11
|
List of 7400-series integrated circuits
|
Normal inputs / open-collector outputs
{| class="wikitable"
|-
! Configuration !! Buffer !! Inverter
|-
| Hex 1-input || 74x07 || 74x05
|}
{| class="wikitable"
|-
! Configuration !! AND !! NAND !! OR !! NOR !! XOR !! XNOR
|-
| Quad 2-input || 74x09 || 74x03 || style="background: grey; text-align: center;" | n/a || 74x33 || 74x136 || 74x266
|-
| Triple 3-input || 74x15 || 74x12 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|-
| Dual 4-input || style="background: grey; text-align: center;" | n/a || 74x22 || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a || style="background: grey; text-align: center;" | n/a
|}
|
wikipedia
|
wiki_22008_chunk_2
|
Oxbow code
|
Examples
(from
gnash/server/asobj/Global.cpp 1.46)
static void
as_global_escape(const fn_call& fn)
{
// List of chars we must convert to escape sequences
const string strHexDigits = "0123456789ABCDEF";
string strInput = fn.arg(0).to_string();
URL::encode(strInput);
fn.result->set_string(strInput.c_str());
}
In this, "strHexDigits" is oxbow code (or oxbow data).
|
wikipedia
|
wiki_34341_chunk_6
|
SPIKE algorithm
|
Postprocessing stage The two-partition case
In the two-partition case, i.e., when , the reduced system has the form An even smaller system can be extracted from the center: which can be solved using the block LU factorization Once and are found, and can be computed via ,
. The multiple-partition case
Assume that is a power of two, i.e., . Consider a block diagonal matrix where for . Notice that essentially consists of diagonal blocks of order extracted from . Now we factorize as . The new matrix has the form
|
wikipedia
|
wiki_35981_chunk_6
|
Control–feedback–abort loop
|
Figure 1 shows a model of the CFA loop. The CFA loop consists of three main elements – The Control element, the Feedback element and the Abort element. Within any system, the lack of any one of these three elements will result in the system failing at some point in time. The term ‘system’ used in this document can represent any environment, task, process, procedure or system in a physical, organizational or natural structure where an entity will respond to influences. It has been found, through experience, that even trees appear to follow the CFA model. The diagram in Figure 1 can be used as an analysis diagram by inserting functions of the controls, feedbacks and aborts in each of the related circles defining the system being analyzed. (Example: Control – Workflow requests, Feedback – Results of requests, Aborts – Requests that failed, workflow exception path)
|
wikipedia
|
wiki_23895_chunk_5
|
Total functional programming
|
qsort x = qsortSub x x
-- minimum case
qsortSub [] as = as -- shows termination
-- standard qsort cases
qsortSub (l:ls) [] = [] -- nonrecursive, so accepted
qsortSub (l:ls) [a] = [a] -- nonrecursive, so accepted
qsortSub (l:ls) (a:as) = let (lesser, greater) = partition (<a) as
-- recursive, but recurs on ls, which is a substructure of
-- its first input.
in qsortSub ls lesser ++ [a] ++ qsortSub ls greater
|
wikipedia
|
wiki_3994_chunk_8
|
Biopython
|
>>> # This script loads an annotated sequence from file and views some of its contents.
>>> from Bio import SeqIO
>>> seq_record = SeqIO.read('pTC2.gb', 'genbank')
>>> seq_record.name
'NC_019375'
>>> seq_record.description
'Providencia stuartii plasmid pTC2, complete sequence.'
>>> seq_record.features[14]
SeqFeature(FeatureLocation(ExactPosition(4516), ExactPosition(5336), strand=1), type='mobile_element')
>>> seq_record.seq
Seq('GGATTGAATATAACCGACGTGACTGTTACATTTAGGTGGCTAAACCCGTCAAGC...GCC', IUPACAmbiguousDNA())
|
wikipedia
|
wiki_4799_chunk_42
|
Page replacement algorithm
|
def simulate_aging(Rs: Sequence, k: int) -> None:
"""Simulate aging."""
print(' t | R-bits (0-{length}) | Counters for pages 0-{length}'.format(length=len(Rs)))
Vs = [0] * len(Rs[0])
for t, R in enumerate(Rs):
Vs[:] = [R[i] << k - 1 | V >> 1
for i, V in enumerate(Vs)]
print('{:02d} | {} | [{}]'.format(t, R,
', '.join(['{:0{}b}'.format(V, k)
for V in Vs])))
In the given example of R-bits for 6 pages over 5 clock ticks, the function prints the following output, which lists the R-bits for each clock tick and the individual counter values for each page in binary representation.
>>> Rs = [[1,0,1,0,1,1], [1,1,0,0,1,0], [1,1,0,1,0,1], [1,0,0,0,1,0], [0,1,1,0,0,0]]
>>> k = 8
>>> simulate_aging(Rs, k)
t | R-bits (0-5) | Counters for pages 0-5
00 | [1, 0, 1, 0, 1, 1] | [10000000, 00000000, 10000000, 00000000, 10000000, 10000000]
01 | [1, 1, 0, 0, 1, 0] | [11000000, 10000000, 01000000, 00000000, 11000000, 01000000]
02 | [1, 1, 0, 1, 0, 1] | [11100000, 11000000, 00100000, 10000000, 01100000, 10100000]
03 | [1, 0, 0, 0, 1, 0] | [11110000, 01100000, 00010000, 01000000, 10110000, 01010000]
04 | [0, 1, 1, 0, 0, 0] | [01111000, 10110000, 10001000, 00100000, 01011000, 00101000]
|
wikipedia
|
wiki_33363_chunk_3
|
Global Engineering Education
|
Organizations
These are some organizations around the world that focus on global engineering education
Purdue University, USA
International Engineering Program at the University of Rhode Island
RMIT University, Australia
Centre for Engineering Education, Universiti Teknologi Malaysia, Malaysia
Shanghai Jiao Tong University, China
Universität Karlsruhe, Germany
Worcester Polytechnic Institute, USA
Virginia Polytechnic Institute and State University, USA
University of Texas at Austin, Cockrell School of Engineering, USA
University of Wisconsin Madison, College of Engineering, USA
University of British Columbia, Canada
Spanish University of Distance Education - UNED, Electrical and Computer Engineering Department - DIEEC, Spain
Deccan Herald
Pforzheim University, Germany
Kogakuin University, Tokyo, Japan
Tokyo Global Engineering Corporation, Tokyo, Japan
Ben-Gurion University of the Negev, Israel
Texas A&M University, USA
|
wikipedia
|
wiki_15606_chunk_30
|
Molecular graphics
|
// Assume:
// Atoms with x, y, z coordinates (Angstrom) and elementSymbol
// bonds with pointers/references to atoms at ends
// table of colors for elementTypes
// find limits of molecule in molecule coordinates as xMin, yMin, xMax, yMax
scale = min(xScreenMax / (xMax − xMin), yScreenMax / (yMax − yMin))
xOffset = −xMin × scale
yOffset = −yMin × scale
for each bond in bonds do
atom0 = bond.getAtom(0)
atom1 = bond.getAtom(1)
x0 = xOffset + atom0.getX() × scale
y0 = yOffset + atom0.getY() × scale // (1)
x1 = xOffset + atom1.getX() × scale
y1 = yOffset + atom1.getY() × scale // (2)
x1 = atom1.getX()
y1 = atom1.getY()
xMid = (x0 + x1) / 2
yMid = (y0 + y1) / 2
color0 = ColorTable.getColor(atom0.getSymbol())
drawLine(color0, x0, y0, xMid, yMid)
color1 = ColorTable.getColor(atom1.getSymbol())
drawLine(color1, x1, y1, xMid, yMid)
|
wikipedia
|
wiki_30315_chunk_15
|
Multiple zeta function
|
For example with length k = 2 and weight n = 7: Euler sum with all possible alternations of sign
The Euler sum with alternations of sign appears in studies of the non-alternating Euler sum. Notation
with are the generalized harmonic numbers.
with with
with As a variant of the Dirichlet eta function we define
with Reflection formula
The reflection formula can be generalized as follows: if we have Other relations
Using the series definition it is easy to prove:
with
with
A further useful relation is: where and Note that must be used for all value for whom the argument of the factorials is Other results
|
wikipedia
|
wiki_38561_chunk_14
|
Comparison of programming paradigms
|
Allocation of dynamic memory for message and object storage
Uniquely, the object-oriented paradigm involves dynamic memory allocation from heap storage for both object creation and message passing. A 1994 benchmark - "Memory Allocation Costs in Large C and C++ Programs" conducted by Digital Equipment Corporation on a variety of software, using an instruction-level profiling tool, measured how many instructions were required per dynamic storage allocation. The results showed that the lowest absolute number of instructions executed averaged around 50 but others reached as high as 611. See also "Heap:Pleasures and pains" by Murali R. Krishnan that states "Heap implementations tend to stay general for all platforms, and hence have heavy overhead". The 1996 IBM paper "Scalability of Dynamic Storage Allocation Algorithms" by Arun Iyengar of IBM demonstrates various dynamic storage algorithms and their respective instruction counts. Even the recommended MFLF I algorithm (H.S. Stone, RC 9674) shows instruction counts in a range between 200 and 400. The above pseudocode example does not include a realistic estimate of this memory allocation pathlength or the memory prefix overheads involved and the subsequent associated garbage collection overheads. Suggesting strongly that heap allocation is a nontrivial task, one open-source software microallocator, by game developer John W. Ratcliff, consists of nearly 1,000 lines of code.
|
wikipedia
|
wiki_8618_chunk_2
|
Elementary mathematics
|
Elementary Focus
Abacus
LCM
Fractions and Decimals
Place Value & Face Value
Addition and subtraction
Multiplication and Division
Counting Money
Counting
Algebra
Representing and ordering numbers
Estimating
Problem Solving
To have a strong foundation in mathematics and to be able to succeed in the other strands students need to have a fundamental understanding of number sense and numeration. Spatial Sense
|
wikipedia
|
wiki_33342_chunk_16
|
Psychometric software
|
autopsych
autopsych
autopsych is an open-source software program for performing uni-dimensional Rasch analysis. The app can handle both dichotomous and polytomous data via the application of Master’s partial credit model. The app adopts marginal maximum likelihood estimation and leverages off a total 31 open-source R packages (including TAM, psych, knitr, etc.). Users upload item-response matrices (.csv files), customize settings for Rasch analysis, and the app automatically generates PDF with embedded narration for methodology and results. Excel files include outputs for all analyses performed including plausible values. Users can also perform basic many-facets Rasch analysis for an examination of item DIF, fixed anchor equating for two dichotomous matrices, an analysis of variance (ANOVA) of EAP theta estimates for examining the effect of group effects, and inter-rater reliability analysis for the examination of examiner consistency. A full exposition of the web app is provided in the journal, PLOS ONE SCIENCE.
|
wikipedia
|
wiki_8606_chunk_10
|
High-power rocketry
|
Performing a 3-sigma, 6-degree of freedom dispersion analysis on submitted projects.
Providing guidance and a review of the Class 3 waiver application package prior to FAA submittal.
Working with the FAA/AST to educate applicants and FAA personnel to the needs of Class 3 project teams in maintaining the viability and safety of the hobby now and in the future.
To work toward achieving a more efficient and meaningful opportunity for members to pursue Class 3 and beyond flight attempts.
|
wikipedia
|
wiki_30709_chunk_1
|
Saint-Petersburg State University of Architecture and Civil Engineering
|
During the 179-year period of its existence, SPbGASU has provided an excellent professional education for more than 60 000 architects and engineers including specialists who had come from over 50 foreign states. The graduates of the University have contributed a lot into the architectural outlook of Saint Petersburg and other cities of the world. Its academic staff has been well known thanks to such outstanding specialists - architects and designers - as D.I.Grimm, G.D.Grimm, V.A.Schröter, V.V.Evald, N.V.Sultanov, P.Yu.Suser, A.I.Gogen, A.I.Dmitriev, I.S.Kitner, G.P.Perederiy, K.V.Makovskiy, G.M.Maniser, to name just the few, as well as Senior Lecturers and Professors M.V.Ostrogradskiy, V.V.Ckobeltzin, E.H.Lentz, N.A.Belieliubskiy, N.A.Boguslavskiy, F.S.Yasinskiy, V.A.Gastev, C.N.Numerov, N.Ya.Panarin, P.I.Bozhenov, B.I.Dalmatov, L. М. Khidekel, S.M.Shifrin, N.F.Fiedorov and many others.
|
wikipedia
|
wiki_35806_chunk_9
|
Advanced Telescope for High Energy Astrophysics
|
X-ray Integral Field Unit (X-IFU)
The X-ray Integral Field Unit is the cryogenic X-ray spectrometer of Athena X-IFU will deliver spatially resolved X-ray spectroscopy, with a spectral resolution requirement of 2.5 eV up to 7 keV over a hexagonal field of view of 5 arc minutes (equivalent diameter). The prime detector of X-IFU is made of a large format array of Molybdenum Gold transition-edge sensors coupled to absorbers made of Au and Bi to provide the required stopping power. The pixel size corresponds to slightly less than 5 arc seconds on the sky, thus matching the angular resolution of the X-ray optics. A large part of the X-IFU related Athena science objectives relies on the observation of faint extended sources (e.g. hot gas in cluster of galaxies to measure bulk motions and turbulence or its chemical composition), imposing the lowest possible instrumental background. This is achieved by the addition of a second cryogenic detector underneath the prime focal plane array. This way non-X-ray events such as particles can be vetoed using the temporal coincidence of detecting energy in both detectors simultaneously. The focal plane array, the sensors and the cold front end electronics are cooled at a stable temperature less than 100 mK by a multi-stage cryogenic chain, assembled by a series of mechanical coolers, with interface temperatures at 15 K, 4 K and 2 K and 300 mK, pre-cooling a sub Kelvin cooler made of a 3He adsorption cooler coupled with an Adiabatic Demagnetization Refrigerator. Calibration data are acquired along with each observation from modulated X-ray sources to enable the energy calibration required to reach the targeted spectral resolution. Although an integral field unit where each and every pixel delivers a high resolution X-ray spectrum, the defocussing capability of the Athena mirror will enable the focal beam to be spread over hundreds of sensors. The X-IFU will thus be able to observe very bright X-ray sources. It will do so either with the nominal resolution, e.g. for detecting the baryons thought to reside in the Warm Hot Intergalactic Medium, using bright gamma-ray burst afterglows, as background sources shining through the cosmic web, or with a spectral resolution of 3–10 eV, e.g. for measuring the spins and characterizing the winds and outflows of bright X-ray binaries at energies where their spectral signatures are the strongest (above 5 keV).
|
wikipedia
|
wiki_10197_chunk_4
|
Power Lunch
|
Present segments
CNBC 101: Bob Pisani presents the "CNBC 101" segment on Thursdays.
News Update: News headlines from outside the world of business, broadcast at 2.30pm ET.
Econo Smackdown: Seen during the first hour with Steve Liesman (in studio) and Rick Santelli (in Chicago).
Trader Triple Play: Seen on Fridays during the second hour as three Wall Street traders join the program (either via satellite or in-studio) to talk about the three key economic diaries in which investors and viewers need to know for the coming week.
Markets Minute By Minute: A guest (or two guests) join the program to tell viewers and the show's anchors what is moving the markets.
Around the Watercooler: This is a segment in which the anchors talk about the day's biggest topics (inside and outside the business world) from behind their respective desks.
|
wikipedia
|
wiki_27723_chunk_10
|
Mathieu group M24
|
Applications The theory of umbral moonshine is a partly conjectural relationship between K3 surfaces and M24. The Conway group Co1, the Fischer group Fi24, and the Janko group J4 each have maximal subgroups that are an extension of the Mathieu group M24 by a group 211. (These extensions are not all the same.) Representations calculated the complex character table of M24.
|
wikipedia
|
wiki_2864_chunk_20
|
Magic number (programming)
|
In protocols
Examples
The OSCAR protocol, used in AIM/ICQ, prefixes requests with 2A.
In the RFB protocol used by VNC, a client starts its conversation with a server by sending "RFB" (52 46 42, for "Remote Frame Buffer") followed by the client's protocol version number.
In the SMB protocol used by Microsoft Windows, each SMB request or server reply begins with 'FF 53 4D 42', or "\xFFSMB" at the start of the SMB request.
In the MSRPC protocol used by Microsoft Windows, each TCP-based request begins with 05 at the start of the request (representing Microsoft DCE/RPC Version 5), followed immediately by a 00 or 01 for the minor version. In UDP-based MSRPC requests the first byte is always 04.
In COM and DCOM marshalled interfaces, called OBJREFs, always start with the byte sequence "MEOW" (4D 45 4F 57). Debugging extensions (used for DCOM channel hooking) are prefaced with the byte sequence "MARB" (4D 41 52 42).
Unencrypted BitTorrent tracker requests begin with a single byte containing the value 19 representing the header length, followed immediately by the phrase "BitTorrent protocol" at byte position 1.
eDonkey2000/eMule traffic begins with a single byte representing the client version. Currently E3 represents an eDonkey client, C5 represents eMule, and D4 represents compressed eMule.
The first 04 bytes of a block in the Bitcoin Blockchain contains a magic number which serves as the network identifier. The value is a constant 0xD9B4BEF9, which indicates the main network, while the constant 0xDAB5BFFA indicates the testnet.
SSL transactions always begin with a "client hello" message. The record encapsulation scheme used to prefix all SSL packets consists of two- and three- byte header forms. Typically an SSL version 2 client hello message is prefixed with a 80 and an SSLv3 server response to a client hello begins with 16 (though this may vary).
DHCP packets use a "magic cookie" value of '0x63 0x82 0x53 0x63' at the start of the options section of the packet. This value is included in all DHCP packet types.
HTTP/2 connections are opened with the preface '0x505249202a20485454502f322e300d0a0d0a534d0d0a0d0a', or "PRI * HTTP/2.0\r\n\r\nSM\r\n\r\n". The preface is designed to avoid the processing of frames by servers and intermediaries which support earlier versions of HTTP but not 2.0.
|
wikipedia
|
wiki_21442_chunk_10
|
Differential item functioning
|
Wald statistic
However, more common than not, a 2PL or 3PL model is more appropriate than fitting a 1PL model to the data and thus both the a and b parameters should be tested for DIF. Lord (1980) proposed another method for testing differences in both the a and b parameters, where c parameters are constrained to be equal across groups. This test yields a Wald statistic which follows a chi-square distribution. In this case the null hypothesis being tested is
H0: ar = af and br = bf.
First, a 2 x 2 covariance matrix of the parameter estimates is calculated for each group which are represented by Sr and Sf for the reference and focal groups. These covariance matrices are computed by inverting the obtained information matrices.
Next, the differences between estimated parameters are put into a 2 x 1 vector and is denoted by
V' = (ar - af, br - bf)
Next, covariance matrix S is estimated by summing Sr and Sf.
Using this information, the Wald statistic is computed as follows:
χ2 = V'S−1V
which is evaluated at 2 degrees of freedom.
|
wikipedia
|
wiki_1380_chunk_7
|
Homological algebra
|
On a philosophical level, homological algebra teaches us that certain chain complexes associated with algebraic or geometric objects (topological spaces, simplicial complexes, R-modules) contain a lot of valuable algebraic information about them, with the homology being only the most readily available part. On a technical level, homological algebra provides the tools for manipulating complexes and extracting this information. Here are two general illustrations.
Two objects X and Y are connected by a map f between them. Homological algebra studies the relation, induced by the map f, between chain complexes associated with X and Y and their homology. This is generalized to the case of several objects and maps connecting them. Phrased in the language of category theory, homological algebra studies the functorial properties of various constructions of chain complexes and of the homology of these complexes.
An object X admits multiple descriptions (for example, as a topological space and as a simplicial complex) or the complex is constructed using some 'presentation' of X, which involves non-canonical choices. It is important to know the effect of change in the description of X on chain complexes associated with X. Typically, the complex and its homology are functorial with respect to the presentation; and the homology (although not the complex itself) is actually independent of the presentation chosen, thus it is an invariant of X.
|
wikipedia
|
wiki_22923_chunk_3
|
List of Sinclair QL software
|
E
Easel (Business Graphics), Psion (Sinclair), 1984
EasyPTR, Albin Hessler
Eye-Q, Graphics System, Digital Precision
Eye-Q Special Edition, Graphics System, Digital Precision F
Ferret (File Search Utility), Sector Software
Fibu (Accounting), eTo soft
Flashback (Database), Sector Software
Forth, Computer One
Fortran 77, Prospero
Front Page, (Desktop Publisher), GAP Software
|
wikipedia
|
wiki_14081_chunk_6
|
Ukkonen's algorithm
|
Run time
The naive implementation for generating a suffix tree going forward requires or even time complexity in big O notation, where is the length of the string. By exploiting a number of algorithmic techniques, Ukkonen reduced this to (linear) time, for constant-size alphabets, and in general, matching the runtime performance of the earlier two algorithms. Ukkonen's algorithm example To better illustrate how a suffix tree using Ukkonen's algorithm is constructed, we can use the following example: S=xabxac
|
wikipedia
|
wiki_137_chunk_25
|
Code-division multiple access
|
In 2019, schemes to precisely estimate the required length of the codes in dependence of Doppler and delay characteristics have been developed. Soon after, machine learning based techniques that generate sequences of a desired length and spreading properties have been published as well. These are highly competitive with the classic Gold and Welch sequences. These are not generated by linear-feedback-shift-registers, but have to be stored in lookup tables. Advantages of asynchronous CDMA over other techniques
|
wikipedia
|
wiki_24205_chunk_34
|
Rod calculus
|
Algorithm:
Arrange the coefficients in tabular form, constant at shi, coeffienct of x at shang lian, the coeffiecnt of X^4 at yi yu;align the numbers at unit rank.
Advance shang lian two ranks
Advance yi yu three ranks
Estimate shang=20
let xia lian =shang * yi yu
let fu lian=shang *yi yu
merge fu lian with shang lian
let fang=shang * shang lian
subtract shang*fang from shi
add shang * yi yu to xia lian
retract xia lian 3 ranks, retract yi yu 4 ranks
The second digit of shang is 0
merge shang lian into fang
merge yi yu into xia lian
Add yi yu to fu lian, subtract the result from fang, let the result be denominator
find the highest common factor =25 and simplies the fraction
solution
|
wikipedia
|
wiki_204_chunk_18
|
Elementary algebra
|
Solving algebraic equations The following sections lay out examples of some of the types of algebraic equations that may be encountered. Linear equations with one variable Linear equations are so-called, because when they are plotted, they describe a straight line. The simplest equations to solve are linear equations that have only one variable. They contain only constant numbers and a single variable without an exponent. As an example, consider: Problem in words: If you double the age of a child and add 4, the resulting answer is 12. How old is the child? Equivalent equation: where represent the child's age
|
wikipedia
|
wiki_37696_chunk_2
|
Archaeological open-air museum
|
Museum – "A museum is a non-profit, permanent institution in the service of society and its development, open to the public, which acquires, conserves, researches, communicates and exhibits the tangible and intangible heritage of humanity and its environment for the purposes of education, study and enjoyment." Professional practice and performance in archaeological open-air museums should respect the ICOM Code of Ethics for Museums.
True to scale architectural reconstructions in the open air – Archaeological open-air museums deal with outdoor true-to-scale reconstructed buildings. These can be constructed and interpreted only under the condition that: "the original buildings of the type portrayed are no longer available (and) the copies or reconstructions are made according to the strictest scientific methods". The authenticity of materials and techniques used should be clearly accounted for through written and accessible records, quoting the sources of information on which the reconstructions are based. An honest assessment of each reconstruction should be feasible.
Collections of intangible heritage resources – The overall presentation of an archaeological open-air museum can be regarded (classified/defined) as a collection of intangible heritage resources which provides an interpretation of how people lived and acted with reference to a specific context of time and place.
Connected to scientific research – The connection between scientific research and any specific archaeological open-air museum is provided by the active role of a trained archaeologist among the staff or an archaeological counsellor belonging to an affiliated organisation.
Appropriate interpretation with organisation of activities for visitors – Depending on the nature and number of visitors, different kinds of interpretation can be appropriate. These activities can involve (but are not limited to) guided tours, educational programmes, presentation of experimental archaeology research, demonstrations of ancient crafts and techniques, live interpretation and living history activities.
|
wikipedia
|
wiki_3495_chunk_15
|
Pure mathematics
|
See also
Applied mathematics
Logic
Metalogic
Metamathematics References External links What is Pure Mathematics? – Department of Pure Mathematics, University of Waterloo
What is Pure Mathematics? by Professor P. J. Giblin The University of Liverpool
The Principles of Mathematics by Bertrand Russell
How to Become a Pure Mathematician (or Statistician), a list of undergraduate and basic graduate textbooks and lecture notes, with several comments and links to solutions, companion sites, data sets, errata pages, etc. Fields of mathematics
Abstraction
|
wikipedia
|
wiki_39396_chunk_12
|
Future of mathematics
|
Numerical analysis and scientific computing
On numerical analysis and scientific computing: In 2000, Lloyd N. Trefethen wrote "Predictions for scientific computing 50 years from now", which concluded with the theme that "Human beings will be removed from the loop" and writing in 2008 in The Princeton Companion to Mathematics predicted that by 2050 most numerical programs will be 99% intelligent wrapper and only 1% algorithm, and that the distinction between linear and non-linear problems, and between forward problems (one step) and inverse problems (iteration), and between algebraic and analytic problems, will fade as everything becomes solved by iterative methods inside adaptive intelligent systems that mix and match and combine algorithms as required.
|
wikipedia
|
wiki_15790_chunk_0
|
List of MeSH codes (M01)
|
The following is a list of "M" 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 (L01). Codes following these are found at List of MeSH codes (N01). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – persons – abortion applicants – adult children
|
wikipedia
|
wiki_27194_chunk_21
|
National University of Engineering (Nicaragua)
|
In scientific research efforts have been made to develop a culture of research in the university community. Mechanisms have been established for the purpose of involving greater number of teachers and students. These calls are designed to select projects that provide answers to the problems of Nicaragua and are funded through the budget allocated to UNI. A highlight fact is the creation of the Research and Development Vicechancellorship (VRIyD) in 1998.4 External links Official website of the Universidad Nacional de Ingeniería (UNI) References
http://www.uni.edu.ni/historia.php
|
wikipedia
|
wiki_28000_chunk_55
|
Differential geometry of surfaces
|
For any surface embedded in Euclidean space of dimension 3 or higher, it is possible to measure the length of a curve on the surface, the angle between two curves and the area of a region on the surface. This structure is encoded infinitesimally in a Riemannian metric on the surface through line elements and area elements. Classically in the nineteenth and early twentieth centuries only surfaces embedded in were considered and the metric was given as a 2×2 positive definite matrix varying smoothly from point to point in a local parametrization of the surface. The idea of local parametrization and change of coordinate was later formalized through the current abstract notion of a manifold, a topological space where the smooth structure is given by local charts on the manifold, exactly as the planet Earth is mapped by atlases today. Changes of coordinates between different charts of the same region are required to be smooth. Just as contour lines on real-life maps encode changes in elevation, taking into account local distortions of the Earth's surface to calculate true distances, so the Riemannian metric describes distances and areas "in the small" in each local chart. In each local chart a Riemannian metric is given by smoothly assigning a 2×2 positive definite matrix to each point; when a different chart is taken, the matrix is transformed according to the Jacobian matrix of the coordinate change. The manifold then has the structure of a 2-dimensional Riemannian manifold.
|
wikipedia
|
wiki_6308_chunk_15
|
Hypervalent molecule
|
Alternative definition
Durrant has proposed an alternative definition of hypervalency, based on the analysis of atomic charge maps obtained from atoms in molecules theory. This approach defines a parameter called the valence electron equivalent, γ, as “the formal shared electron count at a given atom, obtained by any combination of valid ionic and covalent resonance forms that reproduces the observed charge distribution”. For any particular atom X, if the value of γ(X) is greater than 8, that atom is hypervalent. Using this alternative definition, many species such as PCl5, , and XeF4, that are hypervalent by Musher's definition, are reclassified as hypercoordinate but not hypervalent, due to strongly ionic bonding that draws electrons away from the central atom. On the other hand, some compounds that are normally written with ionic bonds in order to conform to the octet rule, such as ozone O3, nitrous oxide NNO, and trimethylamine N-oxide , are found to be genuinely hypervalent. Examples of γ calculations for phosphate (γ(P) = 2.6, non-hypervalent) and orthonitrate (γ(N) = 8.5, hypervalent) are shown below.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.