id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_15588_chunk_32
|
N-body simulation
|
double r_mag = sqrt(r_vector.e[0] * r_vector.e[0] + r_vector.e[1] * r_vector.e[1] + r_vector.e[2] * r_vector.e[2]); double acceleration = -1.0 * BIG_G * (orbital_entities[m2_idx].e[6]) / pow(r_mag, 2.0);
|
wikipedia
|
wiki_8087_chunk_1
|
Booth's multiplication algorithm
|
The algorithm
Booth's algorithm examines adjacent pairs of bits of the 'N'-bit multiplier Y in signed two's complement representation, including an implicit bit below the least significant bit, y−1 = 0. For each bit yi, for i running from 0 to N − 1, the bits yi and yi−1 are considered. Where these two bits are equal, the product accumulator P is left unchanged. Where yi = 0 and yi−1 = 1, the multiplicand times 2i is added to P; and where yi = 1 and yi−1 = 0, the multiplicand times 2i is subtracted from P. The final value of P is the signed product.
|
wikipedia
|
wiki_2541_chunk_76
|
Fourier optics
|
where are the power spectral densities of the point-spread function, the object and the noise. Ragnarsson proposed a method to realize Wiener restoration filters optically by holographic technique like setup shown in the figure. The derivation of the function of the setup is described as follows. Assume there is a transparency as the recording plane and an impulse emitted from a point source S. The wave of impulse is collimated by lens L1, forming a distribution equal to the impulse response . Then the distribution is then split into two parts:
|
wikipedia
|
wiki_18384_chunk_5
|
Nicodemus Wilderness Project
|
Strategic Planning
The Nicodemus Wilderness Project has followed the 20-step process as outlined in "Strategic Planning for Nonprofit Organizations" by CompassPoint Nonprofit Services to create a strategic plan. In creating this plan, they surveyed members, board members, volunteers, and donors to incorporate their thoughts about the Nicodemus Wilderness Project and it environmental stewardship program into this plan. They used the "SWOT analysis" approach, where they had people provide input about the Strengths, Weaknesses, Opportunities, and Threats that characterize or affect the organization. In this strategic plan, they sought to: 1) achieve a renewed focus on those programs that help to fulfill their mission, 2) direct their resources in a way that builds programs and makes a positive difference to youth and the environment, 3) produce a planning document that serves as a roadmap for the future direction of their programs .
|
wikipedia
|
wiki_8379_chunk_1
|
Energy Information Administration
|
Background
The Department of Energy Organization Act of 1977 established EIA as the primary federal government authority on energy statistics and analysis, building upon systems and organizations first established in 1974 following the oil market disruption of 1973. EIA conducts a comprehensive data collection program that covers the full spectrum of energy sources, end uses, and energy flows; generates short- and long-term domestic and international energy projections; and performs informative energy analyses. EIA disseminates its data products, analyses, reports, and services to customers and stakeholders primarily through its website and the customer contact center.
|
wikipedia
|
wiki_21457_chunk_0
|
Atmospheric chemistry observational databases
|
Over the last two centuries many environmental chemical observations have been made from a variety of ground-based, airborne, and orbital platforms and deposited in databases. Many of these databases are publicly available. All of the instruments mentioned in this article give online public access to their data. These observations are critical in developing our understanding of the Earth's atmosphere and issues such as climate change, ozone depletion and air quality. Some of the external links provide repositories of many of these datasets in one place. For example, the Cambridge Atmospheric Chemical Database, is a large database in a uniform ASCII format. Each observation is augmented with the meteorological conditions such as the temperature, potential temperature, geopotential height, and equivalent PV latitude.
|
wikipedia
|
wiki_50_chunk_24
|
Binary-coded decimal
|
Fixed-point zoned decimal
Some languages (such as COBOL and PL/I) directly support fixed-point zoned decimal values, assigning an implicit decimal point at some location between the decimal digits of a number. For example, given a six-byte signed zoned decimal value with an implied decimal point to the right of the fourth digit, the hex bytes F1 F2 F7 F9 F5 C0 represent the value +1,279.50:
F1 F2 F7 F9 F5 C0
1 2 7 9. 5 +0 BCD in computers IBM
|
wikipedia
|
wiki_789_chunk_96
|
Simulation
|
Simulations are useful in modeling the flow of transactions through business processes, such as in the field of sales process engineering, to study and improve the flow of customer orders through various stages of completion (say, from an initial proposal for providing goods/services through order acceptance and installation). Such simulations can help predict the impact of how improvements in methods might impact variability, cost, labor time, and the number of transactions at various stages in the process. A full-featured computerized process simulator can be used to depict such models, as can simpler educational demonstrations using spreadsheet software, pennies being transferred between cups based on the roll of a die, or dipping into a tub of colored beads with a scoop.
|
wikipedia
|
wiki_20474_chunk_0
|
Sudoku solving algorithms
|
A standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first, middle, or last 3 columns. Each cell may contain a number from one to nine, and each number can only occur once in each row, column, and box. A Sudoku starts with some cells containing numbers (clues), and the goal is to solve the remaining cells. Proper Sudokus have one solution. Players and investigators use a wide range of computer algorithms to solve Sudokus, study their properties, and make new puzzles, including Sudokus with interesting symmetries and other properties.
|
wikipedia
|
wiki_26493_chunk_142
|
Comparison of programming languages (associative array)
|
Associative arrays that can use objects as keys, instead of strings and integers, can be implemented with the SplObjectStorage class from the Standard PHP Library (SPL). Pike
Pike has built-in support for associative arrays, which are referred to as mappings. Mappings are created as follows: mapping(string:string) phonebook = ([
"Sally Smart":"555-9999",
"John Doe":"555-1212",
"J. Random Hacker":"555-1337"
]);
|
wikipedia
|
wiki_2988_chunk_12
|
Pathological (mathematics)
|
The discovery of irrational numbers by the school of Pythagoras in ancient Greece; for example, the length of the diagonal of a unit square, that is .
The discovery of complex numbers in the 16th century in order to find the roots of cubic and quartic polynomial functions.
The rationals are countable. That is, every rational number can be mapped to a unique integer.
Some number fields have rings of integers that do not form a unique factorization domain, for example the field .
The discovery of fractals and other "rough" geometric objects (see Hausdorff dimension).
Weierstrass function, a real-valued function on the real line, that is continuous everywhere but differentiable nowhere.
Test functions in real analysis and distribution theory, which are infinitely differentiable functions on the real line that are 0 everywhere outside of a given limited interval. An example of such a function is the test function,
The Cantor set is a subset of the interval that has measure zero but is uncountable.
The fat Cantor set is nowhere dense but has positive measure.
The Fabius function is everywhere smooth but nowhere analytic.
Volterra's function is differentiable with bounded derivative everywhere, but the derivative is not Riemann-integrable.
The Peano space-filling curve is a continuous surjective function that maps the unit interval onto .
The Dirichlet function, which is the indicator function for rationals, is a bounded function that is not Riemann integrable.
The Cantor function is a monotonic continuous surjective function that maps onto , but has zero derivative almost everywhere.
Satisfaction classes containing "intuitively false" arithmetical statements can be constructed for countable, recursively saturated models of Peano arithmetic.
|
wikipedia
|
wiki_10209_chunk_27
|
General Schedule (US civil service pay scale)
|
List of other pay scale terms
AD: Administratively Determined
DB: Demonstration Army Engineers and Scientists External Link
DE: Demonstration Army Technical and Business Support External Link
DJ: Demonstration Army Administrative External Link
DK: Demonstration Army General Support External Link
DN: Defense Nuclear Facilities Safety Board External Link
DO: Demonstration Air Force Business Management and Professional External Link
DP: Scientific and Engineering (S&E) External Link (page 10)
DR: Demonstration Air Force Scientist and Engineer External Link
DS: Technical Specialist External Link (page 10)
DU: Demonstration Air Force Mission Support External Link
DX: Demonstration Air Force Technician External Link
ES: executive schedule
FO, FP, FS: Foreign Service (Department of State, USAID, Commerce, Agriculture)
FR: Federal Reserve System External Link
FV: Federal Aviation Administration
GG: General schedule, excepted service (except patent examiners)
GM, GL, GP, GR: e.g., see General Schedule Supervisory Guide and U.S. Personnel Management – Pay & Leave
HS: House Employee Schedule, governs salaries of employees of the United States House of Representatives and is maintained by the Committee on House Administration.
HWS: House Wage Schedule, similar to the House Employee Schedule but applies to certain House employees not employed by Member offices.
IA: Defense Civilian Intelligence Personnel System (DCIPS)—used by the Navy and others External link
IC: Incident Command – FEMA Exempted Service Intermittent Disaster Staff (FEMA Reservist)
IT: Incident Teams – FEMA Exempted Service Incident Management Staff (FEMA CORE) Pay Band I–V
JS: Judiciary Salary – U.S. Courts
NF: Non-Appropriated Fund
NH, NJ, NK: AcqDemo (DOD Civilian Acquisition Workforce Personnel Demonstration Project
NY: Corporation for National and Community Service
SK: United States Securities and Exchange Commission pay scale
SV: Department of Homeland Security excepted service (i.e., Transportation Security Administration)
VN: Federal medical careers
WG: Wage grade
WM: Wage Mariner. Operates government owned, government operated (GOGO) ships for National Oceanic and Atmospheric Administration (NOAA) and Military Sealift Command (MSC) among other agencies.
Y (National Security Personnel System): Formerly used for Department of Defense (DoD) civil service jobs (approx. 2006–2012) There are four Career Groups: (1) Standard: YA, YB, YC, YP, (2) Scientific and Engineering: YD, YE, YF, (3) Medical: YG, YH, YI, YJ, (4) Investigative and Protective Services: YK, YL, YM, YN (NSPS was repealed in 2009; see National Security Personnel System for more info)
Z: National Institute of Standards and Technology's Alternative Personnel Management System (APMS)
|
wikipedia
|
wiki_19365_chunk_14
|
List of PowerPC processors
|
IBM (now from AMCC)
401
403: MMU added in most advanced version 403GCX
405: MMU, Ethernet, serial, PCI, SRAM, SDRAM; NPe405 adds more network devices
440: A range of processors based on the Book E core.
440EP: 333–667 MHz, (2) 10/100 Ethernet, PCI, DDR, FPU, USB 1.1 or USB 2.0, 32k L1 Cache.
440GP: 400–500 MHz, (2) 10/100 Ethernet, PCI-X, DDR, 32k L1 Cache.
440GX: 533–800 MHz, (2) 10/100 Ethernet, (2) 10/100/1G Ethernet with TCP/IP hardware acceleration, PCI-X, DDR, 32k L1 Cache
|
wikipedia
|
wiki_7951_chunk_7
|
Network traffic simulation
|
When a simulation has been completed, the data needs to be analysed. The simulation's output data will only produce a likely estimate of real-world events. Methods to increase the accuracy of output data include: repeatedly performing simulations and comparing results, dividing events into batches and processing them individually, and checking that the results of simulations conducted in adjacent time periods “connect” to produce a coherent holistic view of the system. Random numbers
|
wikipedia
|
wiki_26316_chunk_5
|
Index of biological integrity
|
Development with volunteer and professional staff
It is possible to create IBIs for use by minimally trained monitoring personnel, however the precision obtainable is lower than that conducted by trained professionals. Safeguards to assure robustness in spite of potential misidentifications or protocol variations require careful testing. Ongoing quality control by established experts is needed to maintain data integrity, and the analysis of IBI results becomes more complex. Use of trained volunteers is being pioneered by government agencies responsible for monitoring large numbers of water bodies with limited resources, such as the Minnesota Pollution Control Agency (MPCA) and local volunteer stream monitoring programs supported by MPCA. EPA has published guidance to assist volunteer programs in formulating IBIs and related findings. While IBIs from such programs are legally admissible in US courts, defending the validity of conclusions based solely on such results is unlikely to be feasible.
|
wikipedia
|
wiki_12452_chunk_8
|
Optical proximity correction
|
OPC application today
Today, OPC is rarely practiced without the use of commercial packages from electronic design automation (EDA) vendors. Advances in algorithms, modeling techniques and the use of large compute farms has enabled the most critical patterning layers to be corrected overnight, starting from the 130 nm design rules (when model based OPC was first used) down to the most advanced design rules. The number of layers requiring sophisticated OPC has increased with advanced nodes, as previously non-critical layers now require compensation.
|
wikipedia
|
wiki_25967_chunk_11
|
Green Mountain Energy
|
See Also
Deregulation of the Texas Electricity Market
Electric Reliability Council of Texas
Wind power in the United States
Solar power in the United States
Green Energy
Brazos Wind Farm
Green Mountain Wind Energy Center, located in Pennsylvania
https://time.com/6082973/vermont-electric-grid/
https://pv-magazine-usa.com/2021/08/05/green-mountain-power-looks-to-give-arizonans-the-option-to-purchase-100-renewable-energy/
https://www.3blmedia.com/news/campaign/green-mountain-energy-sun-club
https://www.offsetguide.org/understanding-carbon-offsets/what-is-a-carbon-offset/
|
wikipedia
|
wiki_28150_chunk_6
|
Super-recursive algorithm
|
Examples of super-recursive algorithms include (Burgin 2005: 132):
limiting recursive functions and limiting partial recursive functions (E.M. Gold 1965)
trial and error predicates (Hilary Putnam 1965)
inductive inference machines (Carl Smith)
inductive Turing machines, which perform computations similar to computations of Turing machines and produce their results after a finite number of steps (Mark Burgin)
limit Turing machines, which perform computations similar to computations of Turing machines but their final results are limits of their intermediate results (Mark Burgin)
trial-and-error machines (Ja. Hintikka and A. Mutanen 1998)
general Turing machines (J. Schmidhuber)
Internet machines (van Leeuwen, J. and Wiedermann, J.)
evolutionary computers, which use DNA to produce the value of a function (Darko Roglic)
fuzzy computation (Jirí Wiedermann 2004)
evolutionary Turing machines (Eugene Eberbach 2005)
|
wikipedia
|
wiki_704_chunk_23
|
Convolutional code
|
For example, if we want to make a code with rate 2/3 using the appropriate matrix from the above table, we should take a basic encoder output and transmit every first bit from the first branch and every bit from the second one. The specific order of transmission is defined by the respective communication standard. Punctured convolutional codes are widely used in the satellite communications, for example, in INTELSAT systems and Digital Video Broadcasting. Punctured convolutional codes are also called "perforated". Turbo codes: replacing convolutional codes
|
wikipedia
|
wiki_7005_chunk_2
|
Xenobiology
|
Aims
Xenobiology has the potential to reveal fundamental knowledge about biology and the origin of life. In order to better understand the origin of life, it is necessary to know why life evolved seemingly via an early RNA world to the DNA-RNA-protein system and its nearly universal genetic code. Was it an evolutionary "accident" or were there constraints that ruled out other types of chemistries? By testing alternative biochemical "primordial soups", it is expected to better understand the principles that gave rise to life as we know it.
Xenobiology is an approach to develop industrial production systems with novel capabilities by means of biopolymer engineering and pathogen resistance. The genetic code encodes in all organisms 20 canonical amino acids that are used for protein biosynthesis. In rare cases, special amino acids such as selenocysteine, pyrrolysine or formylmethionine, can be incorporated by the translational apparatus in to proteins of some organisms. By using additional amino acids from among the over 700 known to biochemistry, the capabilities of proteins may be altered to give rise to more efficient catalytical or material functions. The EC-funded project Metacode, for example, aims to incorporate metathesis (a useful catalytical function so far not known in living organisms) into bacterial cells. Another reason why XB could improve production processes lies in the possibility to reduce the risk of virus or bacteriophage contamination in cultivations since XB cells would no longer provide suitable host cells, rendering them more resistant (an approach called semantic containment)
Xenobiology offers the option to design a "genetic firewall", a novel biocontainment system, which may help to strengthen and diversify current bio-containment approaches. One concern with traditional genetic engineering and biotechnology is horizontal gene transfer to the environment and possible risks to human health. One major idea in XB is to design alternative genetic codes and biochemistries so that horizontal gene transfer is no longer possible. Additionally alternative biochemistry also allows for new synthetic auxotrophies. The idea is to create an orthogonal biological system that would be incompatible with natural genetic systems.
|
wikipedia
|
wiki_353_chunk_3
|
Multivariate statistics
|
Multivariate analysis can be complicated by the desire to include physics-based analysis to calculate the effects of variables for a hierarchical "system-of-systems". Often, studies that wish to use multivariate analysis are stalled by the dimensionality of the problem. These concerns are often eased through the use of surrogate models, highly accurate approximations of the physics-based code. Since surrogate models take the form of an equation, they can be evaluated very quickly. This becomes an enabler for large-scale MVA studies: while a Monte Carlo simulation across the design space is difficult with physics-based codes, it becomes trivial when evaluating surrogate models, which often take the form of response-surface equations.
|
wikipedia
|
wiki_18628_chunk_1
|
New Journal of Chemistry
|
Article types
Research papers: which contain original scientific work that has not been published previously
Letters: original scientific work that is of an urgent nature and that has not been published previously
Perspectives: invited from younger prize-winning scientists who present their work and ideas, setting these in the context of the work of others
Interfaces: written by pairs of collaborating scientists from different disciplines on their common field of research, to demonstrate the benefits of collaborative research and facilitate dialogue between communities See also
List of scientific journals in chemistry References External links
New Journal of Chemistry CNRS website
|
wikipedia
|
wiki_25254_chunk_5
|
Research Institute for Advanced Computer Science
|
Examples of RIACS contributions to NASA Ames as part of the "Intelligent Systems Divisions" include leadership roles in developing and infusing:
Autoclass Bayesian discovery system – used probabilistic techniques to discover new classes of infra-red stars in the Low Resolution Spectral catalogue from the NASA IRAS mission as the first artificial intelligence program to make an astronomical discovery; also used to discover new classes proteins, introns, and other patterns in DNA/protein sequence data, and others;
Livingstone model-based diagnostic system – flown on Deep Space One as part of Remote Agent and on Earth Observing Mission EO-1 as the first artificial intelligence control system to control a spacecraft without human supervision;
MAPGEN tactical activity planner – a constraint-based planning system used everyday during the Mars Exploration Rover mission resulting in an estimated 20% increase in scientific return;
Clarissa voice-operated procedure browser – used on the International Space Station as the first spoken dialogue system used in space; and
Program Management Tool – used to manage billions of dollars of NASA programs and projects with case studies showing 85% reduction in financial reporting time, elimination of 40% discrepancy rates in non-advocate review milestone data, and elimination of 30% error rates in baseline project plans.
|
wikipedia
|
wiki_16962_chunk_3
|
List of Texas Civil War Confederate units
|
1st (McCulloch's) Mounted Riflemen
State service, March 4, 1861 - mid-April 1861.
Confederate service, mid-April 1861 - mid-April 1862 as the First Regiment, Texas Mounted Riflemen, also known as the First Texas Mounted Rifles (mustered out at the expiration of the enlistment period). Some of the men returned to frontier service, but most enlisted in the Eighth Texas Cavalry Battalion, which later became part of the First Texas Cavalry Regiment (Buchel's).
1st Texas Cavalry Regiment (Buchel's; Yager's 1st Mounted Rifles)
Company H (Rusk Co. Volunteers)
2nd Texas Cavalry Regiment (2nd Mounted Rifles; Chisum's Regiment; Partisan Rangers)
Company B (German Company; Gidding's Battalion; Carrington's Company)
Company E (Texas Rangers)
Company F (Mounted Riflemen; W.P. Lane Rangers)
Company K
Coopwood's Spy Company (attached)
3rd Texas Cavalry Regiment (Greer's Regiment; South Kansas-Texas Mounted Volunteers)
Company C (Lone Star Defenders)
Company G (Dead Shot Rangers)
Company K (Flora Legion)
4th Texas Cavalry Regiment (4th Mounted Volunteers; 1st Regiment, Sibley's Brigade)
Company A
Company B (Davis Guards; Dockwallopers)
Company C (Victoria Volunteers; Victoria Invincibles)
Company D (San Andres Light Horse Company)
Company E (Milam Co. Guards)
5th Texas Cavalry Regiment (5th Mounted Volunteers; 2nd Regiment, Sibley's Brigade)
Company I (Killough's Volunteer Company, Fayette County)
6th Texas Cavalry Regiment (Stone's Regiment; 2nd Cavalry)
Company A
Company B (Rockwall Cavalry)
Company F (Lancaster Guards)
7th Texas Cavalry Regiment (7th Mounted Volunteers; 3rd Regiment, Sibley's Brigade)
Company A
Company B (Comal Co.; Hoffmann's Company; German Company)
Company C (Williamson Co. Grays)
Company D (Angelina Troop)
Company E (Trinity Co. Cavalry)
Company F (New Salem Invincibles)
Company I (Anderson Co. Company of Cavalry)
8th Texas Cavalry Regiment (Terry's Texas Rangers)
Company B (Mounted Rangers)
Company F (Lone Star Rangers)
Company K (Tom Lubbock Guards)
Company L (Wharton Guards)
9th Texas Cavalry Regiment (Sims's 4th Cavalry)
Company I (Titus Grays)
10th Texas Cavalry Regiment (Locke's Regiment)
Company B (Wood Co. Rebels)
11th Texas Cavalry Regiment (Young's 3rd Cavalry)
Company B (Holford Cavalry)
Company E (Red River Dixie Boys)
12th Texas Cavalry Regiment (Parsons's 4th Mounted Dragoons)
13th Texas Cavalry Regiment (Burnett's Mounted Volunteers)
Company G (Dreadnaughts)
14th Texas Cavalry Regiment (Johnson's Mounted Volunteers; Camp's; 1st Regiment, Johnson's Brigade)
15th Texas Cavalry Regiment (Sweet's Regiment; 2nd Regiment, Johnson's Brigade; 1st Infantry, Consolidated)
16th Texas Cavalry Regiment (Fitzhugh's Regiment; 3rd Regiment, Johnson's Brigade)
Company G
17th Texas Cavalry Regiment (Moore's Regiment; 1st Infantry, Consolidated)
Company K (Clough Rangers)
17th (Consolidated) Dismounted Cavalry
18th Texas Cavalry Regiment (Darnell's Regiment; 1st Infantry, Consolidated)
19th Texas Cavalry Regiment (Burford's Regiment)
Company F
Company G
Company I
20th Texas Cavalry Regiment (Bass' Regiment)
Company B (Caldwell Co. Rangers)
Company G
Company H
21st Texas Cavalry Regiment (Carter's 1st Texas Lancers; 1st Regiment, Carter's Brigade)
22nd Texas Cavalry Regiment (1st Indian-Texas Cavalry)
Company D (Stephens Cavalry)
23rd Texas Cavalry Regiment (Gould's Regiment; 27th Cavalry)
24th Texas Cavalry Regiment (Wilkes's 2nd Lancers; 2nd Regiment, Carter's Brigade; 1st Infantry, Consolidated)
Company B (Caldwell Co. Rangers)
25th Texas Cavalry Regiment (Gillespie's 3rd Lancers; 3d Regiment, Carter's Brigade; 1st Infantry, Consolidated)
26th Texas Cavalry Regiment (Davis's Cavalry; Debray's Mounted Battalion)
Company A (Moore's Rebels)
Company B (Caldwell Co. Rangers)
Company C (Moore's Rangers)
Company E (Hebert Rangers)
Company G (Galveston Videttes)
Company H (Debray's Rangers)
27th Texas Cavalry Regiment (4th Battalion; Whitfield's Legion; 1st Legion)
Company A (Texas Fencibles; Titus Invincibles)
Company C (J.P. Henderson Rangers)
Company D (Whitfield Rifles)
Company E (Lone Star Rangers)
Company I (Titus Rangers)
28th Texas Cavalry Regiment (Randal's 1st Lancers)
Company L
29th Texas Cavalry Regiment (De Morse's Regiment)
31st Texas Cavalry Regiment (Hawpe's Regiment; Guess's Cavalry Battalion)
32nd Texas Cavalry Regiment (Andrews's 15th Cavalry; Crump's Battalion; Mounted Volunteers)
Company G (Lamar Cavalry)
Company K
35th Texas Cavalry Regiment (Rountree's Cavalry Battalion; Brown's Regiment)
Company A (Columbia Blues)
Company G (Brazoria Rangers)
Hargrove's Company (Hood's Guerillas)
35th Texas Cavalry Regiment (Likens' and Burns' Cavalry Battalions and three companies transferred from Terrell's Regiment; Likens's Regiment)
36th Texas Cavalry Regiment (Woods's 32nd Cavalry)
37th Texas Cavalry Regiment (Terrell's Cavalry Battalion; Terrell's 34th Cavalry)
Company A
46th Texas Cavalry Regiment
The Frontier Regiment (McCord's) was transferred to Confederate service on March 1, 1864 under this designation (see below).
|
wikipedia
|
wiki_12386_chunk_4
|
Amy Mathews
|
Filmography
{| class="wikitable plainrowheaders sortable"
|-
! scope="col" | Year
! scope="col" | Title
! scope="col" | Role
! class="unsortable" | Notes
|-
| 2001
| Head Start
| Louise
| Season 1 (guest, 1 episode)
|-
| 2002
| Always Greener
| T'ree
| Season 2 (guest, 1 episode)
|-
| 2003
| All Saints
| Mary Cowper
| Season 6 (guest, 1 episode)
|-
| 2003
| Jeopardy| Constable Tucker
| Season 2 (guest, 2 episodes)
|-
| 2004
| Love Bytes| Mel
| Season 1 (recurring, 4 episode)
|-
| 2004
| Blue Heelers| Tahnya West
| Season 11 (guest, 1 episode)
|-
| 2005
| All Saints| Cassie Anderson
| Season 8 (guest, 1 episode)
|-
| 2006–2010
| Home and Away| Rachel Armstrong
| Seasons 19–23 (regular, 331 episodes)
|-
| 2007
| Gabriel| Maggie
| Feature film
|-
| 2010
| Packed to the Rafters| Erin Moore
| Season 3 (guest, 2 episodes)
|-
| 2011
| Rescue: Special Ops| Claire Newell
| Season 3 (guest, 2 episodes)
|-
| 2011
| Crownies| Vanessa Kenay
| Season 1 (guest, 1 episode)
|-
| 2014
| A Place to Call Home| Amy Polson
| Season 2 (recurring, 7 episodes)
|-
| 2018
| Summer of the Seventeenth Doll
| Olive Leech
| Video (theatre performance)
|-
| 2020
| The Heights| Rima
| Season 2 (guest, 1 episode)
|-
| 2020
| I Met a Girl| Senior Constable Harrison
| Feature film
|}
|
wikipedia
|
wiki_938_chunk_12
|
Kruskal's algorithm
|
Filter-Kruskal lends itself better for parallelization as sorting, filtering, and partitioning can easily be performed in parallel by distributing the edges between the processors. Finally, other variants of a parallel implementation of Kruskal's algorithm have been explored. Examples include a scheme that uses helper threads to remove edges that are definitely not part of the MST in the background, and a variant which runs the sequential algorithm on p subgraphs, then merges those subgraphs until only one, the final MST, remains.
|
wikipedia
|
wiki_490_chunk_20
|
Quantum computing
|
The most well-known example of a problem admitting a polynomial quantum speedup is unstructured search, finding a marked item out of a list of items in a database. This can be solved by Grover's algorithm using queries to the database, quadratically fewer than the queries required for classical algorithms. In this case, the advantage is not only provable but also optimal: it has been shown that Grover's algorithm gives the maximal possible probability of finding the desired element for any number of oracle lookups.
|
wikipedia
|
wiki_17833_chunk_30
|
Boolean algebras canonically defined
|
A subalgebra of a power set algebra is called a field of sets; equivalently a field of sets is a set of subsets of some set including the empty set and and closed under finite union and complement with respect to (and hence also under finite intersection). Birkhoff's [1935] representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets. Now Birkhoff's HSP theorem for varieties can be stated as, every class of models of the equational theory of a class of algebras is the Homomorphic image of a Subalgebra of a direct Product of algebras of . Normally all three of H, S, and P are needed; what the first of these two Birkhoff theorems shows is that for the special case of the variety of Boolean algebras Homomorphism can be replaced by Isomorphism. Birkhoff's HSP theorem for varieties in general therefore becomes Birkhoff's ISP theorem for the variety of Boolean algebras.
|
wikipedia
|
wiki_33627_chunk_3
|
Pressure–volume loop experiments
|
Sonomicrometer method
A sonomicrometer system is composed of an electronic signal-processing unit that is connected to small ultrasonic transducers (crystals). A computer acting as a data acquisition and display device obtains data in real time from the signal processor unit, while the crystals are implanted in or on the left ventrical. As few as 2 or as many as 6 crystals can be used to perform 1-axis, 2-axis, or 3-axis length measurements of the axial planes of the heart, usually at a rate of 200 to 2000 times per second. A typical sonomicrometer system has a resolution of 12 micrometres, enabling high-resolution measurements of the axial lengths.
|
wikipedia
|
wiki_3472_chunk_68
|
List of important publications in computer science
|
Description: Brooks argues that "there is no single development, in either technology or management technique, which by itself promises even one order of magnitude [tenfold] improvement within a decade in productivity, in reliability, in simplicity." He also states that "we cannot expect ever to see two-fold gains every two years" in software development, as there is in hardware development (Moore's law). The Cathedral and the Bazaar
Raymond, E.S.
First Monday, 3, 3 (March 1998)
Online copy (HTML) Description: Open source methodology.
|
wikipedia
|
wiki_32681_chunk_6
|
Engineering informatics
|
The role informatics plays in engineering products and services has become significant in the past decades. Most of the development has happened in an ad hoc manner, as can be expected. Techniques appeared in computer science and in programming practice; these techniques get used in engineering as is. Early computing in engineering was limited due to the capacities of computers. Computational power and telecommunications systems have started to converge, resulting in the possibilities of untethered connections and exchange of information that was just a distant dream in the early computing days. These developments have made the problems of distance less onerous and allow for global design, manufacturing, and supply chains. However, the problem of managing a global supply chain still is a daunting task with numerous incompatibilities in information exchange and coordination.
|
wikipedia
|
wiki_39344_chunk_4
|
Selective serotonin reuptake inhibitor
|
Two meta-analyses published in 2008 (Kirsch) and 2010 (Fournier) found that in mild and moderate depression, the effect of SSRIs is small or none compared to placebo, while in very severe depression the effect of SSRIs is between "relatively small" and "substantial". The 2008 meta-analysis combined 35 clinical trials submitted to the Food and Drug Administration (FDA) before licensing of four newer antidepressants (including the SSRIs paroxetine and fluoxetine, the non-SSRI antidepressant nefazodone, and the serotonin and norepinephrine reuptake inhibitor (SNRI) venlafaxine). The authors attributed the relationship between severity and efficacy to a reduction of the placebo effect in severely depressed patients, rather than an increase in the effect of the medication. Some researchers have questioned the statistical basis of this study suggesting that it underestimates the effect size of antidepressants.
A 2012 meta-analysis of fluoxetine and venlafaxine concluded that statistically and clinically significant treatment effects were observed for each drug relative to placebo irrespective of baseline depression severity; some of the authors however disclosed substantial relationships with pharmaceutical industries.
A 2017 systematic review stated that "SSRIs versus placebo seem to have statistically significant effects on depressive symptoms, but the clinical significance of these effects seems questionable and all trials were at high risk of bias. Furthermore, SSRIs versus placebo significantly increase the risk of both serious and non-serious adverse events. Our results show that the harmful effects of SSRIs versus placebo for major depressive disorder seem to outweigh any potentially small beneficial effects". Fredrik Hieronymus et al. criticized the review as inaccurate and misleading, but they also disclosed multiple ties to pharmaceutical industries and receipt of speaker's fees.
|
wikipedia
|
wiki_18250_chunk_2
|
Electrologica X8
|
The system is most notable as the target processor for Edsger Dijkstra's implementation of the THE multiprogramming system. This includes the invention of semaphores, enabled by a specific instruction in the X8 instruction set. Semaphores were used not only as a synchronization mechanism within the THE operating system, but also in the request and response data structures for I/O requests processed by the CHARON coprocessor.
|
wikipedia
|
wiki_23470_chunk_2
|
List of solar thermal power stations
|
|-
|KaXu Solar One || || Pofadder, Northern Cape ||
| align="right" | 100 || Parabolic trough
|2.5|| with 2.5h heat storage
|-
|Xina Solar One || || Pofadder, Northern Cape ||
| align="right" | 100 || Parabolic trough
|5.5|| Commissioned in September 2017 with 5.5h heat storage
|-
|Manchasol Power Station || || Alcázar de San Juan ||
| align="right" |100|| Parabolic trough
|7.5|| Manchasol 1 and 2 completed in 2011, each with 7.5h heat storage
|-
|Valle Solar Power Station || || San José del Valle ||
| align="right" |100|| Parabolic trough
|7.5|| Completed December 2011, with 7.5h heat storage
|-
|Helioenergy Solar Power Station || || Écija ||
| align="right" |100|| Parabolic trough
| || Helioenergy 1 completed September 2011Helioenergy 2 completed January 2012
|-
|Aste Solar Power Station || || Alcázar de San Juan ||
| align="right" |100|| Parabolic trough
|8|| Aste 1A Completed January 2012, with 8h heat storage Aste 1B Completed January 2012, with 8h heat storage
|-
|Solacor Solar Power Station || || El Carpio ||
| align="right" |100|| Parabolic trough
| || Solacor 1 completed February 2012Solacor 2 completed March 2012
|-
|Helios Solar Power Station|| || Puerto Lápice ||
| align="right" |100|| Parabolic trough
| || Helios 1 completed May 2012Helios 2 completed August 2012
|-
|Shams solar power station || || Abu Dhabi Madinat Zayed ||
| align="right" | 100|| Parabolic trough
| || Shams 1 completed March 2013
|-
|Termosol Solar Power Station || || Navalvillar de Pela ||
| align="right" |100|| Parabolic trough
| || Both Termosol 1 and 2 completed in 2013
|-
| Palma del Río I & II || || Palma del Río ||
| align="right" |100|| Parabolic trough
| || Palma del Rio 2 completed December 2010Palma del Rio 1 completed July 2011
|-
| Ilanga 1 || || Northern Cape (Upington) ||
| align="right" |100|| Parabolic trough
|5|| With 5h heat storage. Operational since 2018
|-
| CSNP Royal Tech Urat CSP || || Urat Middle Banner, Inner Mongolia ||
| align="right" |100|| Parabolic trough || 10 || Completed in January 2020 with 10 hours of thermal storage
|-
|Martin Next Generation Solar Energy Center || || Indiantown, Florida ||
| align="right" |75||ISCC with parabolic trough
| || Completed December 2010
|-
|Nevada Solar One|| || Boulder City, Nevada ||
| align="right" |75|| Parabolic trough
| || Operational since 2007
|-
| Dacheng Dunhuang CSP || || Dunhuang, Gansu Province ||
| align="right" |60|| Fresnel reflector || 16 / 15 || 10 MW Phase 1 completed in 2016,
50 MW Phase 2 in December 2019 with 15 hours of thermal storage
|-
| Supcon Solar Delingha || || Delingha ||
| align="right" |60|| Solar power tower
| 2 / 7
| 10 MW Phase 1 completed in 2013, Phase 2 completed in December 2018 with 7 hours of thermal energy storage
|
wikipedia
|
wiki_10797_chunk_0
|
Lecture Notes in Computer Science
|
Lecture Notes in Computer Science is a series of computer science books published by Springer Science+Business Media since 1973. Overview
The series contains proceedings, post-proceedings, monographs, and Festschrifts. In addition, tutorials, state-of-the-art surveys, and "hot topics" are increasingly being included. The series is indexed by DBLP. See also
Monographiae Biologicae, another monograph series published by Springer Science+Business Media
Lecture Notes in Physics
Lecture Notes in Mathematics
Electronic Workshops in Computing, published by the British Computer Society References External links
|
wikipedia
|
wiki_13147_chunk_19
|
Tire code
|
"*": BMW-Mini original manufacturer fitment
030908: Approval number of the tire
"100T": Commonly appears after tire size. Meaning: standard load inflation table (100) & speed rating (T)
AMx: Aston Martin OE Fitments
"AO": Audi original manufacturer fitment
Arrows: Some tread designs are "directional", and designed to perform better when driven in a specific direction. Such tires will have an arrow showing which way the tire should rotate when the vehicle is moving forwards.
B: Bias belted; tires for motorcycles (Example: 150/70 B 17 69 H)diagonal construction with belt added under the tread
BSB: Broken serrated band
BSL: Black serrated letters
BSW: Black sidewall
C: Commercial; tires for light trucks (Example: 185 R14 C)
DOT code: All tires for use in the USA have the DOT code, as required by the Department of Transportation (DOT). It specifies the company, factory, mold, batch, and date of production (two digits for week of the year plus two digits for year; or two digits for week of the year plus one digit for year for tires made prior to 2000). Although not law, some tire manufacturers do not suggest using a "new" tire that has been sitting on the shelf for more than six years (Ford Motor Company) or 10 years (Cooper Tire citing a tire association recommendation). JATMA, the Japanese Automotive Tyre Manufacturers Association recommends that all tires be inspected at five years, and all tires that were manufactured more than ten years previous be replaced.
E4: Tire approved according to the ECE-regulations, the number indicating the country of approval.
"ELT": Pirelli Elect tyres, specific for electric car
"J": Jaguar original manufacturer fitment
LL: Light load; tires for light usage and loads
"M/C": Only for motorcycle fitment
M+S, or M&S: Mud and snow; A tire that meets the Rubber Manufacturers Association (RMA) and Rubber Association of Canada (RAC) all-season tire definition. These are commonly found on all-season tires, with self-cleaning tread and average traction in muddy or very snowy conditions, and for low temperatures. Spike tires have an additional letter, "E" (M+SE).
A/T or AT: All Terrain; Designed for all conditions on and off road, master of none
M+T or M&T: Mud and terrain; Designed to perform in mud or on other terrain that requires additional traction such as on rocks, in deeper snow, and in loose gravel.
M/T or MT: Mud Terrain; Designed for deep mud and rock crawl
Made in ...: Country of production
MO: Original tires for Mercedes-Benz
MOE: Mercedes-Benz original extended
Mountain snowflake pictograph: Winter passenger and light truck tires that meet the severe snow service requirements of Rubber Manufacturers Association (RMA) and Rubber Association of Canada (RAC).
N-x: Original tires for Porsche where "x" is a "0" for the first approved in that size, "1" the second, ...
"NHS": Not highway service
ORWL: Outlined raised white lettering
OWL: Outlined white lettering
RF: Reinforcedfor Euro-metric tires, the term 'reinforced' means the same thing as 'extra load'
RFT: Run-flat tire; Tires designed for vehicles without spare tires. Reinforced sidewalls allow the tire to be driven "flat" for a distance specified by the manufacturer (usually 50 miles)
RSC (inside a circle): BMW runflat system component
RWL: Raised white lettering
SFI, or Inner: side facing inward; inside of asymmetric tires
SFO, or Outer: side facing outward; outside of asymmetric tires
SL: Standard load; tire for normal usage and loads
Star: Original tires for BMW
TL: Tubeless
TPC: General Motors OE fitments
TT: Tube-type, tire must be used with an inner-tube
TWI: Tread wear indicator – a device, such as a triangle or a small Michelin Man icon, located where the tread meets the sidewall, and indicating the location of the raised wear bars in the tire tread channels – TWI is also used to refer to the raised wear bars themselves.
VSB: Vertical serrated band
WSW: White sidewall
XL: extra load; a tire that allows a higher inflation pressure than a standard load tire, which increases the tire's maximum load
ZP: zero-pressure; Michelin's branding for their run-flat models.
|
wikipedia
|
wiki_13962_chunk_7
|
Salome (software)
|
The modules only accessible in python are: MEDCoupling: mesh and field handling module, accessible through Python scripts only (without a graphical interface);
Melissa: in-situ statistical data post-treatment module oriented to sensitivity studies, accessible through Python scripts only (without a graphical interface); Available versions
SALOME is available for several UNIX operating systems and Windows. Specific versions are generated by EDF and CEA containing specific packages for their applications. All versions are available on the SALOME official website and the disciplinary platforms’ websites. References External links
|
wikipedia
|
wiki_3562_chunk_22
|
Pick operating system
|
Expertise and support
Companies looking to hire developers and support personnel for MultiValue-based (Pick-based) systems recognize that although developers typically do not learn the environment in college and university courses, developers can be productive quickly with some mentoring and training. Due to the efficient design and nature of the programming language (a variant of BASIC), the learning curve is generally considered low. Pick products such as D3, UniVerse, UniData, jBASE, Revelation, MVON, Caché, OpenQM, and Reality are still supported globally via well established distribution channels and resellers. The mvdbms Google Group is a useful place to start when looking for resources. (See mvdbms on Google Groups)
|
wikipedia
|
wiki_36657_chunk_5
|
Civil Support Team
|
Overview
The WMD-CSTs are National Guard units designed to provide a specialized capability to respond to a chemical, biological, radiological or nuclear (CBRN) incident primarily in a Title 32 operational status within the United States, the District of Columbia, its territories and possessions, as established by 10 USC §12310. Congress, the President, and DoD recognized that the WMD-CSTs, {responding under the authority of the Governor (Only for the National Guard)}, provide significant capabilities to assist local and state agencies that may be overwhelmed by a large-scale terrorist attack or where specific technical capabilities to identify CBRN materials are required. In October 1998, Congress authorized and funded the fielding of the first 10 WMD-CSTs. With this fielding began the development and evolution of new capabilities and concepts to ensure that DoD could support evolving interagency response plans. Since 1998, Congress has authorized and funded the fielding of WMD-CSTs in the remaining States and territories.
|
wikipedia
|
wiki_24003_chunk_4
|
LSE (programming language)
|
1 CHAINE A,B,BP
5 FAIRE
10 AFFICHER 'A = ' ;LIRE A ; SI A=’’ ALORS FINI IS
11 AFFICHER 'B = ' ;LIRE B ; BP ← B
12
15 R SI LGR(A) # LGR(B) ALORS .FAUX. SINON &ANAG(A,B) IS
20 SI R ALORS AFFICHER A, 'EST ANAGRAMME DE ',BP
21 SINON AFFICHER A, 'N’’EST PAS ANAGRAMME DE 1, BP
22 IS
25 BOUCLER
29
30 TERMINER
31
50 FONCTION &ANAG(U,V) LOCAL J {lgr(u)=lgr(v)}
51 SI U=' ' ALORS RESULTAT .VRAI. IS
52 SI J = 0 ALORS RESULTAT .FAUX. IS
54 RESULTAT &ANAG(SCH(U,2, ' '),MCH(V,J,l, ' '))
55 $&ANAG
99 $
|
wikipedia
|
wiki_32564_chunk_9
|
Construction estimating software
|
Calculations: Most estimating programs have built-in calculations ranging from simple length, area, and volume calculations to complex industry-specific calculations, such as electrical calculations, utility trench calculations, and earthwork cut and fill calculations.
Markups: Every program will allow for cost mark-ups ranging from flat overall mark-ups to resource-specific mark-ups, mark-ups for general administrative costs, and bonding costs.
Detailed Overhead: Indirect costs, such as permits, fees, and any other overall project costs can be spread to billable project items.
Closeout Window: Many estimating programs include a screen for manually adjusting bid prices from their calculated values.
Reporting: Project reports typically include proposals, detail reports, cost breakdown reports, and various charts and graphs.
Exporting: Most software programs can export project data to other applications, such as spreadsheets, accounting software, and project management software.
Job History: Storing past projects is a standard feature in most estimating programs.
|
wikipedia
|
wiki_39150_chunk_4
|
Brooks–Iyengar algorithm
|
Consider an example of 5 PEs, in which PE 5 () is sending wrong values to other PEs and they all exchange the values. The values received by are in the next Table. We draw a Weighted Region Diagram (WRD) of these intervals, then we can determine for PE 1 according to the Algorithm: which consists of intervals where at least 4(= = 5−1) measurements intersect. The output of PE 1 is equal to and the interval estimate is Similar, we could obtain all the inputs and results of the 5 PEs:
|
wikipedia
|
wiki_15926_chunk_0
|
List of MeSH codes (B01)
|
The following is a partial list of the "B" codes for Medical Subject Headings (MeSH), as defined by the United States National Library of Medicine (NLM). This list continues the information at List of MeSH codes (A17). Codes following these are found at List of MeSH codes (B02). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – animals – animal population groups – animals, domestic
|
wikipedia
|
wiki_22016_chunk_13
|
Localized molecular orbitals
|
Organic chemistry is often discussed in terms of localized molecular orbitals in a qualitative and informal sense. Historically, much of classical organic chemistry was built on the older valence bond / orbital hybridization models of bonding. To account for phenomena like aromaticity, this simple model of bonding is supplemented by semi-quantitative results from Hückel molecular orbital theory. However, the understanding of stereoelectronic effects requires the analysis of interactions between donor and acceptor orbitals between two molecules or different regions within the same molecule, and molecular orbitals must be considered. Because proper (symmetry-adapted) molecular orbitals are fully delocalized and do not admit a ready correspondence with the "bonds" of the molecule, as visualized by the practicing chemist, the most common approach is to instead consider the interaction between filled and unfilled localized molecular orbitals that correspond to σ bonds, π bonds, lone pairs, and their unoccupied counterparts. These orbitals and typically given the notation σ (sigma bonding), π (pi bonding), n (occupied nonbonding orbital, "lone pair"), p (unoccupied nonbonding orbital, "empty p orbital"; the symbol n* for unoccupied nonbonding orbital is seldom used), π* (pi antibonding), and σ* (sigma antibonding). (Woodward and Hoffmann use ω for nonbonding orbitals in general, occupied or unoccupied.) When comparing localized molecular orbitals derived from the same atomic orbitals, these classes generally follow the order σ < π < n < p (n*) < π* < σ* when ranked by increasing energy.
|
wikipedia
|
wiki_20911_chunk_40
|
Java performance
|
In programming contests
Programs in Java start slower than those in other compiled languages. Thus, some online judge systems, notably those hosted by Chinese universities, use longer time limits for Java programs to be fair to contestants using Java. See also Common Language Runtime
Performance analysis
Java processor, an embedded processor running Java bytecode natively (such as JStik)
Comparison of Java and C++
Java ConcurrentMap References External links
Site dedicated to Java performance information
Debugging Java performance problems
Sun's Java performance portal
The Mind-map based on presentations of engineers in the SPb Oracle branch (as big PNG image)
|
wikipedia
|
wiki_27196_chunk_5
|
High Energy Astronomy Observatory 3
|
The Isotopic Composition of Primary Cosmic Rays Experiment
The HEAO C-2 experiment measured the relative composition of the isotopes of the primary cosmic rays between beryllium and iron (Z from 4 to 26) and the elemental abundances up to tin (Z=50). Cerenkov counters and hodoscopes, together with the Earth's magnetic field, formed a spectrometer. They determined charge and mass of cosmic rays to a precision of 10% for the most abundant elements over the momentum range from 2 to 25 GeV/c (c=speed of light). Scientific direction was by Principal Investigators Prof. Bernard Peters and Dr. Lyoie Koch-Miramond. The primary data base has been archived at the Centre Etudes Nuclearires de Saclay and the Danish Space Research Institute. Information on the data products is given by Engelman et al. 1985.
|
wikipedia
|
wiki_540_chunk_25
|
Systems engineering
|
ANSI/EIA-632-1999: "An aggregation of end products and enabling products to achieve a given purpose."
DAU Systems Engineering Fundamentals: "an integrated composite of people, products, and processes that provide a capability to satisfy a stated need or objective."
IEEE Std 1220-1998: "A set or arrangement of elements and processes that are related and whose behavior satisfies customer/operational needs and provides for life cycle sustainment of the products."
INCOSE Systems Engineering Handbook: "homogeneous entity that exhibits predefined behavior in the real world and is composed of heterogeneous parts that do not individually exhibit that behavior and an integrated configuration of components and/or subsystems."
INCOSE: "A system is a construct or collection of different elements that together produce results not obtainable by the elements alone. The elements, or parts, can include people, hardware, software, facilities, policies, and documents; that is, all things required to produce systems-level results. The results include system level qualities, properties, characteristics, functions, behavior and performance. The value added by the system as a whole, beyond that contributed independently by the parts, is primarily created by the relationship among the parts; that is, how they are interconnected."
ISO/IEC 15288:2008: "A combination of interacting elements organized to achieve one or more stated purposes."
NASA Systems Engineering Handbook: "(1) The combination of elements that function together to produce the capability to meet a need. The elements include all hardware, software, equipment, facilities, personnel, processes, and procedures needed for this purpose. (2) The end product (which performs operational functions) and enabling products (which provide life-cycle support services to the operational end products) that make up a system."
|
wikipedia
|
wiki_13467_chunk_4
|
Atmospheric dispersion modeling
|
Many of the modern, advanced dispersion modeling programs include a pre-processor module for the input of meteorological and other data, and many also include a post-processor module for graphing the output data and/or plotting the area impacted by the air pollutants on maps. The plots of areas impacted may also include isopleths showing areas of minimal to high concentrations that define areas of the highest health risk. The isopleths plots are useful in determining protective actions for the public and responders.
|
wikipedia
|
wiki_10602_chunk_0
|
Spatial network analysis software
|
Spatial network analysis software packages are analytic software used to prepare graph-based analysis of spatial networks. They stem from research fields in transportation, architecture, and urban planning. The earliest examples of such software include the work of Garrison (1962), Kansky (1963), Levin (1964), Harary (1969), Rittel (1967), Tabor (1970) and others in the 1960s and 70s. Specific packages address to suit their domain-specific needs, including TransCAD for transportation, GIS for planning and geography, and Axman for Space syntax researchers.
|
wikipedia
|
wiki_8476_chunk_15
|
Network-centric warfare
|
Some architectural and design challenges
The complexity of the Joint Tactical Radio System (JTRS) offers insight into the challenges of integrating numerous different communications systems into a unified whole. It is intended to be a software-defined radio for battlefield communications that will be backwards compatible with a very large number of other military and civilian radio systems.
An April 10, 2008 GAO report (GAO FCS report) highlighted the scalability of the network as a major risk factor to the Network Centric FCS program. The proposed system will be unable to network all the units into one self-forming, self-healing network.
The problem of coordinating bandwidth usage in a battlespace is a significant challenge, when every piece of mobile equipment and human participant becomes a potential source or relay of RF emissions.
It is difficult to efficiently transfer information between networks having different levels of security classification. Although multi-level security systems provide part of the solution, human intervention and decision-making is still needed to determine what specific data can and cannot be transferred.
Accurate locational awareness is limited when maneuvering in areas where Global Positioning System (GPS) coverage is weak or non-existent. These areas include the inside of buildings, caves, etc. as well as built-up areas and urban canyons, which are also settings for many modern military operations. Much work on reliable fusion of positional data from multiple sensors remains to be done.
Providing secure communications in network-centric warfare/network-centric operations is difficult, since successful key management for encryption is typically the most difficult aspect of cryptography, especially with mobile systems. The problem is exacerbated with the need for speedy deployment and nimble reconfiguration of military teams, to respond to rapidly changing conditions in the modern battlespace.
|
wikipedia
|
wiki_36177_chunk_2
|
Hardware Trojan
|
One recent paper published in IEEE, explains how, a hardware design containing a Trojan could leak a cryptographic key leaked over an antenna or network connection, provided that the correct "easter egg" trigger is applied to activate the data leak. In high security governmental IT departments, hardware Trojans are a well known problem when buying hardware such as: a KVM switch, keyboards, mice, network cards, or other network equipment. This is especially the case when purchasing such equipment from non-reputable sources that could have placed hardware Trojans to leak keyboard passwords, or provide remote unauthorized entry. Background
|
wikipedia
|
wiki_13919_chunk_12
|
Useful conversions and formulas for air dispersion modeling
|
The following equation can be used to correct a measured pollutant concentration in an emitted gas (containing a measured CO2 content) to an equivalent pollutant concentration in an emitted gas containing a specified reference amount of CO2: Thus, a measured particulates concentration of 0.1 grain per dscf in a gas that has 8 volume % CO2 is
0.1 × ( 12 ÷ 8 ) = 0.15 grain per dscf when corrected to a gas having a specified reference CO2 content of 12 volume %.
|
wikipedia
|
wiki_1054_chunk_20
|
United States Department of Energy
|
1920 – Federal Power Act
1935 – Public Utility Holding Company Act of 1935
1946 – Atomic Energy Act PL 79-585 (created the Atomic Energy Commission) [Superseded by the Atomic Energy Act of 1954]
1954 – Atomic Energy Act of 1954, as Amended PL 83-703
1956 – Colorado River Storage Project PL 84-485
1957 – Atomic Energy Commission Acquisition of Property PL 85-162
1957 – Price-Anderson Nuclear Industries Indemnity Act PL 85-256
1968 – Natural Gas Pipeline Safety Act PL 90-481
1973 – Mineral Leasing Act Amendments (Trans-Alaska Oil Pipeline Authorization) PL 93-153
1974 – Energy Reorganization Act PL 93-438 (Split the AEC into the Energy Research and Development Administration and the Nuclear Regulatory Commission)
1975 – Energy Policy and Conservation Act PL 94-163
1977 – Department of Energy Organization Act PL 95-91 (Dismantled ERDA and replaced it with the Department of Energy)
1978 – National Energy Act PL 95-617, 618, 619, 620, 621
1980 – Energy Security Act PL 96-294
1989 – Natural Gas Wellhead Decontrol Act PL 101-60
1992 – Energy Policy Act of 1992 PL 102-486
2000 – National Nuclear Security Administration Act PL 106-65
2005 – Energy Policy Act of 2005 PL 109-58
2007 – Energy Independence and Security Act of 2007 PL 110-140
2008 – Food, Conservation, and Energy Act of 2008 PL 110-234
|
wikipedia
|
wiki_7104_chunk_7
|
Bridge (graph theory)
|
Chain decompositions are special ear decompositions depending on a DFS-tree T of G and can be computed very simply: Let every vertex be marked as unvisited. For each vertex v in ascending DFS-numbers 1...n, traverse every backedge (i.e. every edge not in the DFS tree) that is incident to v and follow the path of tree-edges back to the root of T, stopping at the first vertex that is marked as visited. During such a traversal, every traversed vertex is marked as visited. Thus, a traversal stops at the latest at v and forms either a directed path or cycle, beginning with v; we call this path
or cycle a chain. The ith chain found by this procedure is referred to as Ci. C=C1,C2,... is then a chain decomposition of G.
|
wikipedia
|
wiki_29273_chunk_1
|
List of National Geographic original programming
|
Other programs
* Hard Time
Hawaii: Rivers Of Fire
Health Secrets Behind Korean Cuisine
Helicopter Wars
Herod's Lost Tomb
Hijack El Al Flight 426
Hip Hop Nation
Hiroshima: The Next Day
Hiss of Death
History's Secrets
Hitler's G.I. Death Camp (2011)
Hitler's Lost Battle Ship
Hitler's Secret Attack on America
Hitler's Secret Bunkers
Hitler's Secret Weapon
Hong Kong To The World
Hong Kong's Big Bet
Hooked
How Big Can It Get
How Hard It Can Be?
How To Build A Beating Heart
How To Build A Volcano
How To Stop a Hurricane
Hubble's Final Frontier
Human Ape
Human Footprint
Hunt For The Abominable Snowman
Hunt for the Giant Squid
Hunter Hunted
Hyper Rescue Tokyo
I Came Away Alive
I Came Back From the Dead
I Didn't Know That
I Fell from the Sky
I Was Buried Alive
I Was Struck by Lightning
I Was Superhuman
Impossible Bridges
In The Womb
The Incredible Dr. Pol
Incredible Human Machine
The Indestructibles
Indy Motor Speedway
Insects From Hell
Inside 9/11
Inside the Green Berets
Inside Hurricane Katrina
Inside the Mafia
Inside Magic
Inside Nature's Giants
Inside SERIES
Interpol Investigates
Into The Crystal Cave
Into Iceland's Volcano
iPredator
Is It Real?
Islands
Jack Johnson: Kokua Concert
James Cameron
Japan Tsunami: How It Happened
Japanese Cowboy
Japan's Hidden Secret
Japan's Secret Weapon
Jean-Michel Cousteau-Ocean Ad
Jeju, Island Of A Thousand Face
Jellyfish Invasion
JFK: The Lost Bullet
Journey to the Edge of the Universe
Journey To Europa
Kenny And Zoltan's Venom Quest
Kick Fighters
Killing Hitler
Killing Kennedy
Killing Lincoln
Kimchi Chronicles
King Tut's Curse
Knights of Mayhem
The Known Earth
Known Universe
Korean Soul Food
Koxinga
The Kung Fu Dragons Of Wudang
Kung Fu Killers
Kung Fu Monk
Kung Fu Quest
LA Street Racers
Laden's Spy In America
The Last Days of Osama Bin Laden
Last Man Standing: The Human Race
Last Secrets of The Third Reich
Last War Heroes
A Leader's Legacy
Let it Ride
Lewis & Clark: Great Journey West
Light The Ocean
Lightning Reloaded
Lions Behaving Badly**
Liquid Bomb Plot
Live Do or Die
Live Like An Animal
The Living Edens
Lockdown
Locked Up Abroad
Lonely Planet
Lonely Planet: Roads Less Travelled
Long Way Down
The Lost City
Lost Continent of the Pacific
Lost in China
Lost World
Lucky Muckers
Machines Of War
Mad Labs
The Mafia
Make ME Superhuman
Malaysian Journey with Jason Scott Lee
Man Hunt
Man-Made
Man vs. Monster
Maneater Manhunt
Manta Mystery (a.k.a. Project Manta)
Mars
Marco Polo: The China Mystery Revealed
Mars
Medieval Fightbook
Meet The Natives
Mega Factories
Mega Mosque
The Megafalls Of Iguacu
Megafamilies
Megafish
Megaship
MegaStructures
MegaStructures Break Down
The Meadow
The Memory Masters
Mengele's Twins
Million Dollar Moon Rock Heist
Monkey Thieves
Monster Crocs**
Monster Fish Of The Congo
Monster Moves
More Amazing Moments
More Weddings And Another Funeral
Mother Warthog**
Mumbai Mega Flood
Mummy Road Show
Murder Dolls
Mystery 360
Mystery Files
Mystery Gorillas & Search for the Great Apes
Mystery of the Neanderthals: On Assignment
Mysteries Of The Moose**
My Brilliant Brain
My Dog Ate What?
Naked Earth
Naked Science
Narco Bling
Narrow Escapes of WWII
Nat Geo's Top 10 Photos
National Geographic: Frontline Diaries
National Geographic's Most Amazing Moments
National Geographic's Most Amazing Photos
National Geographic's Most Astonishing Moments
National Geographic's Most Astounding Moments
National Geographic's Most Dangerous Moments
National Geographic's Most Daring Moments
National Geographic's Most Extreme Moments
National Geographic's Most Outrageous Moments
National Geographic's Most Shocking Moments
National Geographic's Most Thrilling Moments
Nazi Death Squads
Nazi Megastructures
Nazi Scrapbooks From Hell
Need for Speed: Bikes
Need for Speed: Boats
Nefertiti's Odyssey
Night of the Lion
Night Shift
No Man Left Behind
Nomads
Nordic Wild
The Numbers Game
One Ocean
Orca Killing School
Outbreak Investigation
Paranatural
Paranormal?
Party Like
Perfect Swarm
Perfect Weapon
Perilous Journeys
Phobia
The Pigeon Game
Pirate Patrol
Planes
Planet Carnivore
Planet Mechanics
Plastiki
Pompeii Uncovered
The Power Game - Chiang Kai-Shek And His Families
Python Hunters
Quest For The Megafish Of The Amazon
Rape Of Europa
Rebuilding The Titanic
Redwoods: Anatomy Of A Giant
Reign Of Terror
Rescue Emergency
Restrepo
Return to Titanic
Reverse Exploration
Riddle of the Romanovs
Riddles of The Dead
The Rise Of Black Wolf
Rivers And Life*
Road To The London Olympics
Roads
Rock Stars
Rocket City Rednecks
Roman Homicide
Sailing The Treasure Ship
Salmon Wars
Salt Flat Speedway
Salvage Code Red
Samurai Bow
Samurai Spider
Savannah
Save the Titanic with Bob Ballard
Saved by the Lioness
Saxon Gold
Scam City
Science of Brick
Science of Concrete
Science of Interrogation
Sea Patrol
Sea Strikers
Seahorses: Wanted Dead Or Alive
Search For The Amazon Headshrinkers
Search For The Bushmen
Search For The Cannibals of The South Pacific
Search For The First Dog: A Quest To Find Our Original Best Friend
Search For The Giant Octopus
Search for the Living Cannibals
Search for the Submarine I-52
Seconds From Disaster
Secret Bible
The Secret Heart
Secret Shark Pits
Secrets of The 10 Plagues
Secrets of the Cross
Secrets of the First Emperor
Secrets of the King Cobra
Secrets of the Parthenon
Secrets of the Snow Ship
Secrets of Taj Mahal
Secrets of the Tang Treasure Ship
Secrets of the Viking Warriors
Seoul: Unlocking The Grid
Seoul's Got Soul
Sex and the Brain
The Scrap House
Shark Men
Sharks of Lost Island
Showreal Asia*
Sinking of The Belgrano
Situation Critical
Six Degrees Could Change the World
Skin
Sky Monsters
Slammed: Inside Indie Wrestling
Sleeping Beauties
Somewhere In China
Space Crab
Space Mysteries
Speed Nation
Spider Deadly Love
Spine Chillers
Spirit Talk
Stalking Hitler's Generals
Stonehenge Decoded
Street Genius
Strictly Asian Ballroom
Sudden Death
Sumatra's Last Tiger
Sumo Kids
Super Cyclone
Super Flu
Super Port
Supercarrier: USS Ronald Reagan
Supercell
SuperCroc
Superfish
Superhuman
Survive the Tribe
Surviving the Super Twisters
Stalking Hitler's Generals
Storm Stories
Storm Worlds
Street Food Around The World
Street Heat
Stuntmen of Bollywood
Swamp Troop
Taboo
Taiwan Medical Miracle*
Taiwan To The World*
Taiwan Wild*
Taming The Four Rivers
Templars: The Last Stand
Test Your Brain
That Shouldn't Fly
The '80s: The Decade that Made Us
The '90s: The Last Great Decade?(also entitled The '90s: The Decade that Connected Us)
The 2000s: The Decade We Saw It All
The Long Road Home
Through Their Eyes
Tiger Man
Titanic: 20 Years Later with James Cameron
Titanic: The Final Word with James Cameron
To Be Assigned
The Toilet Men
Tokyo Shock Boys
Tomb Raptor
Top 20 Asian Marvels
Total Riff Off
Totally Wild
Training for the Apocalypse
Trains
Trapped
A Traveler's Guide to the Planets
Travelogue
Trekking the Great Wall
Trekking Malaysia With Jason Scott Lee
T-Rex Walks Again
The Truth Behind
The Truth Behind Zombies
Truth Files
Tsunami Line
Tuna Cowboys
The Two Million Year Old Boy
Typhoon Hunters
UFOs
Ultimate Airport Dubai
Ultimate Disaster
Ultimate Explorer
Ultimate Factories
The Untold Truth About Supermokh
Valley of the Boom
Vatican
War Secrets
Warplanes
Warrior Bees
Warrior Graveyard
Warzone Gone Wild
What Would Happen If
When Continents Collide
When Crocs Ate Dinosaurs
When Rome Ruled
Who Knew?
Who Sank The Bismarck
Wicked Pirate City
Wild
Wild Amazon
Wild Case Files
Wild Japan
Wild Russia (in co-production with S4C and ZDF)
Wild Sex
The Witch Doctor Will See You Now
Witness
Witness Disaster
Womb Of The World
Word Travels
World's Creepiest Killers
World's Deadliest Animals
The World's Oldest Child
World's Tallest Bridge
World's Toughest Fixes
World's Worst Natural Disasters
World's Worst Weather
X-Ray Earth
Year of the Storm
Year Million
Yukon River Run
|
wikipedia
|
wiki_22228_chunk_2
|
Function (biology)
|
In physiology, a function is an activity or process carried out by a system in an organism, such as sensation or locomotion in an animal. This concept of function as opposed to form (respectively Aristotle's ergon and morphê) was central in biological explanations in classical antiquity. In more modern times it formed part of the 1830 Cuvier–Geoffroy debate, where Cuvier argued that an animal's structure was driven by its functional needs, while Geoffroy proposed that each animal's structure was modified from a common plan.<ref>{{cite book |author=Asma, S. T. |date=1996 |title=Following form and function: A philosophical archaeology of life science |publisher=Northwestern University Press |url=https://books.google.com/books?id=deLaAAAAMAAJ|isbn=9780810113978 }}</ref>
|
wikipedia
|
wiki_36363_chunk_24
|
Helitron (biology)
|
The atypical structure, lack of target site modification, and sequence heterogeneity of Helitrons have made automated identification of Helitrons difficult. For genome-wide analysis there are two approaches that have been applied to find canonical Helitrons: De novo repeat identification approaches which can be used to build consensus libraries of all repeated sequences, but De novo repeat finding approaches will only identify Helitrons that are present in multiple relatively homogeneous copies in the genome. Therefore, the low copy and older Helitrons will tend to be fragmented and have poorly defined ends. These approaches are limited by the quality of the genome assembly and the homogeneity of the repeats. Another approach is structure based which relies on the structural features of canonical Helitrons and utilizes programs such as Helitronfinder, HelSearch, Helraizer, and HelitronScanner. As these programs are trained on known Helitron elements, they may not be efficient at identifying divergent families and they generate many false positives. This approach does not create consensus sequences of the candidate Helitrons, resulting in large data sets.
|
wikipedia
|
wiki_11542_chunk_41
|
Robust statistics
|
Several choices of and have been proposed. The two figures below show four functions and their corresponding functions. For squared errors, increases at an accelerating rate, whilst for absolute errors, it increases at a constant rate. When Winsorizing is used, a mixture of these two effects is introduced: for small values of x, increases at the squared rate, but once the chosen threshold is reached (1.5 in this example), the rate of increase becomes constant. This Winsorised estimator is also known as the Huber loss function.
|
wikipedia
|
wiki_5176_chunk_19
|
Moscow Institute of Physics and Technology
|
Base organizations
As of 2005, MIPT had 103 base organizations. The following list of institutes is currently far from being complete:
Center for Arms Control, Energy and Environmental Studies (established 1991)
Engelhardt Institute of Molecular Biology RAS
Gromov Flight Research Institute
Institute for Information Transmission Problems RAS
Institute for Nuclear Research RAS
Institute for Physical Problems
Institute for High Energy Physics (1963)
Institute for Problems in Mechanics RAS
Institute for Spectroscopy Russian Academy of Sciences
Institute for Theoretical and Experimental Physics
Institute of Biochemical Physics RAS
Institute of Molecular Genetics RAS
Institute of Numerical Mathematics RAS
Institute of Problems of Chemical Physics RAS (1956)
Institute of Radio Engineering and Electronics of RAS
Institute of Solid State Physics RAS
Institute of Synthetic Polymer Materials RAS
Joint Institute for Nuclear Research
Kurchatov Institute (formerly Kurchatov Institute of Atomic Energy)
Landau Institute for Theoretical Physics
Lebedev Institute of Physics RAS (FIAN)
Lebedev Institute of Precision Mechanics and Computer Engineering
N.N. Andreyev Acoustics Institute
N.N. Semenov Institute of Chemical Physics, RAS
Nuclear Safety Institute of RAS (IBRAE)
Shirshov Institute of Oceanology
Shubnikov Institute of Crystallography RAS
Space Research Institute RAS (1965)
Steklov Institute of Mathematics
Zhukovsky Central Aerohydrodynamic Institute
and a number of OKBs (experimental design bureaux)
In addition, a number of Russian and Western companies act as base organizations of MIPT. These include:
|
wikipedia
|
wiki_6259_chunk_11
|
Viking lander biological experiments
|
Pyrolytic release
The pyrolytic release (PR) experiment (PI: Norman Horowitz, Caltech) consisted of the use of light, water, and a carbon-containing atmosphere of carbon monoxide (CO) and carbon dioxide (CO2), simulating that on Mars. The carbon-bearing gases were made with carbon-14 (14C), a heavy, radioactive isotope of carbon. If there were photosynthetic organisms present, it was believed that they would incorporate some of the carbon as biomass through the process of carbon fixation, just as plants and cyanobacteria on earth do. After several days of incubation, the experiment removed the gases, baked the remaining soil at 650 °C (1200 °F), and collected the products in a device which counted radioactivity. If any of the 14C had been converted to biomass, it would be vaporized during heating and the radioactivity counter would detect it as evidence for life. Should a positive response be obtained, a duplicate sample of the same soil would be heated to "sterilize" it. It would then be tested as a control and should it still show activity similar to the first response, that was evidence that the activity was chemical in nature. However, a nil, or greatly diminished response, was evidence for biology. This same control was to be used for any of the three life detection experiments that showed a positive initial result. The initial assessment of results from the Viking 1 PR experiment was that "analysis of the results shows that a small but significant formation of organic matter occurred" and that the sterilized control showed no evidence of organics, showing that the "findings could be attributed to biological activity." However, given the persistence of organic release at 90 °C, the inhibition of organics after injecting water vapor and, especially, the lack of detection of organics in the Martian soil by the GCMS experiment, the investigators concluded that a nonbiological explanation of the PR results was most likely. However, in subsequent years, as the GCMS results have come increasingly under scrutiny, the pyrolytic release experiment results have again come to be viewed as possibly consistent with biological activity, although "An explanation for the apparent small synthesis of organic matter in the pyrolytic release experiment remains obscure."
|
wikipedia
|
wiki_6207_chunk_16
|
Basic Linear Algebra Subprograms
|
Armadillo Armadillo is a C++ linear algebra library aiming towards a good balance between speed and ease of use. It employs template classes, and has optional links to BLAS/ATLAS and LAPACK. It is sponsored by NICTA (in Australia) and is licensed under a free license.
LAPACK LAPACK is a higher level Linear Algebra library built upon BLAS. Like BLAS, a reference implementation exists, but many alternatives like libFlame and MKL exist.
Mir An LLVM-accelerated generic numerical library for science and machine learning written in D. It provides generic linear algebra subprograms (GLAS). It can be built on a CBLAS implementation.
|
wikipedia
|
wiki_19329_chunk_19
|
Soft engineering
|
Mississippi
Beginning with British colonial establishment in 1819, Mississippi's coastline has undergone an extensive history of decline through alteration and land reclamation. Hilton and Manning found that from the period of 1922 to 1993, the area of mangroves, coral reefs, and intertidal mudflats decreased dramatically, the actual percentage of natural coastline dropping from 96 to 40%. In order to combat these deleterious anthropogenic effects, Mississippi's government came up with a Master Plan in 2008 which incorporated the modification of shorelines in accordance with the ecological principles of soft engineering. A study regarding the success of ecological engineering in Singapore found that the most effective way to introduce ecological principles into shoreline design and preservation is to implement a top down approach that coordinates and educates the multitude of agencies that are involved in coastal management. Mississippi's loss of natural coastline is just one example of the inevitable detriment of intensive human development and soft engineering techniques provide an effective way to balance shoreline conservation and restoration with the urban development that is sure to continue.
|
wikipedia
|
wiki_31956_chunk_3
|
Pharos network coordinates
|
Insights behind Pharos
Simple and effective, obtain significant improvement in prediction accuracy by introducing a straightforward hierarchical distance prediction
Fully compatible with Vivaldi, the most widely deployed NC system. For every host where the Vivaldi client has been deployed, it just needs to run classic Vivaldi NC algorithm to join global overlay and local cluster, without deploying another NC client.
The anchors in Pharos is different from landmarks in Global network positioning (GNP), which not only has to reply the ICMP ping but also need to reply the queries from all clients by sending their latest NCs. No requirement to deploy any extra software on the anchors.
|
wikipedia
|
wiki_27657_chunk_3
|
Escher (programming language)
|
FUNCTION Rel : (Person * Person -> Boolean) -> Boolean.
Rel(r) =>
PrimitiveRel(r) \/
(SOME [r1,r2]
(r = LAMBDA [u] (SOME [z] (r1(Fst(u),z) & r2(z,Snd(u)))) &
PrimitiveRel(r1) & PrimitiveRel(r2))). References
Declarative programming in Escher, JW Lloyd, University of Bristol, Bristol, UK, 1995
An implementation of Escher Functional languages
|
wikipedia
|
wiki_38829_chunk_7
|
Klumpenhouwer network
|
Five Rules for Isography of Klumpenhouwer Networks:
Klumpenhouwer Networks (a) and (b), sharing the same configuration of nodes and arrows, will be isographic under the circumstance that each T-number of Network (b) is the same as the corresponding T-number of Network (a), and each I-number of Network (b) is exactly j more than the corresponding I-number of Network (a). The pertinent automorphism of the T/I group is F(1,j): F(1,j)(Tn)=Tn; F(1,j)(In) = In+J.
Klumpenhouwer Networks (a) and (b), will be isographic under the circumstance that each T-number of Network (b) is the complement of the corresponding T-number in Network (a), and each I-number of Network (b) is exactly j more than the complement of the corresponding I-number in Network (a)...F(11,j): F(11,j)(Tn)=T−n; F(11,j)(In)=I−n+j."
Klumpenhouwer Networks (a) and (b), will be isographic under the circumstance each T-number of Network (b) is 5 times the corresponding T-number in Network (a), and each I-number of Network (b) is exactly j more than 5 times the corresponding I-number in Network (a)...F(5,j): F(5,j)(Tn)=T5n; F(5,j)(In)=I5n+j.
Klumpenhouwer Networks (a) and (b), will be isographic under the circumstance each T-number of Network (b) is 7 times the corresponding T-number in Network (a), and each I-number of Network (b) is exactly j more than 7 times the corresponding I-number in Network (a)...F(7,j): F(7,j)(Tn)=T7n; F(7,j)(In)=I7n+j.
"Klumpenhouwer Networks (a) and (b), even if sharing the same configuration of nodes and arrows, will not be isographic under any other circumstances."
|
wikipedia
|
wiki_13312_chunk_7
|
APT (programming language)
|
Further reading
Douglas T. Ross (1978). In: ACM SIGPLAN Notices, Vol. 13, No. 8, August 1978
MIT CADCAM http://www.designworldonline.com/50-years-of-cad/#_
https://web.archive.org/web/20131113032955/http://techtv.mit.edu/videos/10783-automatically-programmed-tools-1959-science-reporter-tv-series
https://archive.org/details/bitsavers_mitwhirlwie1GeneralDescriptionoftheAPTSystem1959_5339230
|
wikipedia
|
wiki_17070_chunk_1
|
Gordon's functional health patterns
|
The following areas are assessed through questions asked by the nurse and medical examinations to provide an overview of the individual's health status and health practices that are used to reach the current level of health or wellness.
Health Perception and Management
Nutritional metabolic
Elimination-excretion patterns and problems need to be evaluated (constipation, incontinence, diarrhea)
Activity exercise-whether one is able to do daily activities normally without any problem, self care activities
Sleep rest-do they have hypersomnia, insomnia, do they have normal sleeping patterns
Cognitive-perceptual-assessment of neurological function is done to assess, check the person's ability to comprehend information
Self perception/self concept
Role relationship
Sexuality reproductive
Coping-stress tolerance
Value-Belief Pattern
|
wikipedia
|
wiki_8345_chunk_5
|
Intrinsic function
|
Examples
uint64_t __rdtsc (); // return internal CPU clock counter
uint64_t __popcnt64 (uint64_t n); // count of bits set in n
uint64_t _umul128 (uint64_t Factor1, uint64_t Factor2, uint64_t* HighProduct); // 64 bit * 64 bit => 128 bit multiplication
__m512 _mm512_add_ps (__m512 a, __m512 b); // calculates a + b for two vectors of 16 floats
__m512 _mm512_fmadd_ps(__m512 a, __m512 b, __m512 c); // calculates a*b + c for three vectors of 16 floats
|
wikipedia
|
wiki_10647_chunk_5
|
Clinical ecology
|
Despite the confusion in the traditional medical establishment regarding the classification and treatment of MCS, MCS has achieved credibility in workers compensation claims, tort liability, and regulatory actions. The pragmatic determination of MCS includes four elements: (1) the syndrome is acquired after a documentable environmental exposure that may have caused objective evidence of health effects; (2) the symptoms are referable to multiple organ systems and vary predictably in response to environmental stimuli; (3) the symptoms occur in relation to measurable levels of chemicals, but the levels are below those known to harm health; and (4) no objective evidence of organ damage can be found.
|
wikipedia
|
wiki_2180_chunk_3
|
Algorithmics Inc.
|
A Program to Keep Tabs on Derivatives, The New York Times
PeopleSoft And Algorithmics Partner On Risk Management, Informationweek
Risk Vendor Algorithmics Acquired By Fitch, Informationweek
Risky Business, Fast Company
Countering The Domino Effect, US Banker: "According to this accepted view, the top-tier vendors are: Algorithmics Inc., Toronto; Infinity Financial Technology Inc., New York; and MKIRisk" External links
Company Site
Parent Company Page Software companies of Canada
Software companies established in 1989
Companies based in Toronto
Risk management companies
Information technology audit
2005 mergers and acquisitions
2011 mergers and acquisitions
IBM acquisitions
Canadian subsidiaries of foreign companies
|
wikipedia
|
wiki_30338_chunk_6
|
Regulation of nanotechnology
|
The International Council on Nanotechnology maintains a database and Virtual Journal of scientific papers on environmental, health and safety research on nanoparticles. The database currently has over 2000 entries indexed by particle type, exposure pathway and other criteria. The Project on Emerging Nanotechnologies (PEN) currently lists 807 products that manufacturers have voluntarily identified that use nanotechnology. No labeling is required by the FDA so that number could be significantly higher. "The use of nanotechnology in consumer products and industrial applications is growing rapidly, with the products listed in the PEN inventory showing just the tip of the iceberg" according to PEN Project Director David Rejeski . A list of those products that have been voluntarily disclosed by their manufacturers is located here .
|
wikipedia
|
wiki_4855_chunk_6
|
Combinatorial proof
|
gives an example of a combinatorial enumeration problem (counting the number of sequences of k subsets S1, S2, ... Sk, that can be formed from a set of n items such that the subsets have an empty common intersection) with two different proofs for its solution. The first proof, which is not combinatorial, uses mathematical induction and generating functions to find that the number of sequences of this type is (2k −1)n. The second proof is based on the observation that there are 2k −1 proper subsets of the set {1, 2, ..., k}, and (2k −1)n functions from the set {1, 2, ..., n} to the family of proper subsets of {1, 2, ..., k}. The sequences to be counted can be placed in one-to-one correspondence with these functions, where the function formed from a given sequence of subsets maps each element i to the set {j | i ∈ Sj}.
|
wikipedia
|
wiki_20804_chunk_1
|
NOS (software)
|
Time-sharing commands
ACCESS – selects the access subsystem
APL – selects APL programing language
ASCII – select fill 128-character ASCII
ATTACH – links to a permanent file
AUTO – automatically generate five-digit line numbers
BASIC – selects BASIC system
BATCH – selects the batch system
BEGIN – starts processing of CCL procedure (control language file)
BINARY – selects binary input mode
BRIEF – suppresses headers
BYE – log off the system
CALL – starts processing KCL procedure file (control language before CCL)
CATLIST – lists user's permanent files
CHANGE – changes parameters of a permanent file
CHARGE – set charge number and project number
CLEAR – releases all local files
CONVERT – converts character sets
(CR) – Carriage Return – requests terminal status if it is the first thing on a line
CSET – selects the terminal character-set mode
DAYFILE – lists a record of the user's activity
DEBUG – activates or terminates CYBER interactive Debug
DEFINE – create a direct-access permanent file
DIAL – sends a one-line message to another terminal
EDIT – Selects the text editor
ENQUIRE – Requests the current job status
EXECUTE – selects the Execute subsystem
FORTRAN – selects the FORTRAN subsystem (FORTRAN 5)
FTNTS – Selects the FORTRAN Extended Version 4 compiler (CDC's enhanced version of FORTRAN 4)
FULL – Selects full-duplex mode
GET – gets a copy of a permanent file
GOODBYE – same as BYE
HALF – clears full-duplex mode
HELLO – logs out and starts login
HELP – gets descriptions of NOS commands
LENGTH – requests the length of a file
LIB – get a copy of a permanent file
LIMITS – lists the user's limits
LIST – lists the contents of a file
LNH – same as LIST except no headers
LOGIN – same as HELLO
LOGOUT – same as BYE
MONITOR – connects to a terminal
NEW – creates a new primary file
NORMAL – clears modes set by ASCII, AUTO, BRIEF, NOSORT, CSET, PARITY, and TAPE
NOSORT – prevents the system from sorting the primary file on the subsequent command
NULL – selects the null subsystem.
OLD – gets a copy of a permanent file
P – proceed
PACK – compress a file with several logical records into one logical record
PACKNAM – direct subsequent file requests to an auxiliary device
PARITY – set terminal parity
PASSWOR – change user password
PERMIT – grants another user permission to access a file
PRIMARY – makes temporary file the new primary file
PURGE – removes permanent files
RECOVER – allows user to resume after terminal was disconnected
RENAME – changes file name
REPLACE – replace the contents of a permanent file with a temporary file
RESEQ – resequece or add line numbers to the primary file
SAVE – save a file permanently
SETASL – sets SRU account block limit (SRU = System Resurce Unit, on hard drive)
SETTL – set CPU time limit
SORT – sort the primary file
STATUS – same as ENQUIRE
STOP – terminates currently running programs
SUBMIT – submit a batch job deck image
TRAN – select NOS transaction subsystem
USER – get terminal number
X – process a time-sharing command as a batch command
XEDIT – select XEDIT editor
|
wikipedia
|
wiki_10876_chunk_6
|
Omega network
|
For example, if PE 001 wishes to send a message to PE 010, the XOR-tag will be 011 and the appropriate switch settings are: A2 straight, B3 crossed, C2 crossed. Applications
In multiprocessing, omega networks may be used as connectors between the CPUs and their shared memory, in order to decrease the probability that the CPU-to-memory connection becomes a bottleneck. This class of networks has been built into the Illinois Cedar Multiprocessor, into the IBM RP3, and into the NYU Ultracomputer. Examples Omega network simulation in c
|
wikipedia
|
wiki_17904_chunk_24
|
Fold (higher-order function)
|
λ> foldr (\x y -> concat ["(",x,"+",y,")"]) "0" (map show [1..13])
"(1+(2+(3+(4+(5+(6+(7+(8+(9+(10+(11+(12+(13+0)))))))))))))"
λ> foldl (\x y -> concat ["(",x,"+",y,")"]) "0" (map show [1..13])
"(((((((((((((0+1)+2)+3)+4)+5)+6)+7)+8)+9)+10)+11)+12)+13)"
λ> foldt (\x y -> concat ["(",x,"+",y,")"]) "0" (map show [1..13])
"(((((1+2)+(3+4))+((5+6)+(7+8)))+(((9+10)+(11+12))+13))+0)"
λ> foldi (\x y -> concat ["(",x,"+",y,")"]) "0" (map show [1..13])
"(1+((2+3)+(((4+5)+(6+7))+((((8+9)+(10+11))+(12+13))+0))))"
|
wikipedia
|
wiki_29313_chunk_22
|
Business models for open-source software
|
Selling required proprietary parts of a software product
A variant of the approach above is the keeping of required data content (for instance a video game's audio, graphic, and other art assets) of a software product proprietary while making the software's source code open-source. While this approach is completely legitimate and compatible with most open-source licenses, customers have to buy the content to have a complete and working software product. Restrictive licenses can then be applied on the content, which prevents the redistribution or re-selling of the complete software product. Examples for open-source developed software are Kot-in-Action Creative Artel video game Steel Storm, engine GPLv2 licensed while the artwork is CC-BY-NC-SA 3.0 licensed, and Frogatto & Friends with an own developed open-source engine and commercialization via the copyrighted game assets for iPhone, BlackBerry and MacOS.
|
wikipedia
|
wiki_15792_chunk_0
|
List of MeSH codes (K01)
|
The following is a list of "K" 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 (J02). Codes following these are found at List of MeSH codes (L01). For other MeSH codes, see List of MeSH codes. The source for this content is the set of 2006 MeSH Trees from the NLM. – humanities
|
wikipedia
|
wiki_23127_chunk_5
|
Ecogenetics
|
Respiratory diseases
There are three genetically-based respiratory diseases that can directly correspond with ecological functions and induce disease. These include lung cancer and the upper and lower respiratory tract associated with a serum Ig A deficiency. See also
Endocrine disruptor
Paraoxon
Paraoxonase
Pharmacogenetics
Xenobiotic
Xenoestrogen References van Zyl, Jay. Built to Thrive: Using Innovation to Make Your Mark in a Connected World. Chapter 5: Ecogenetics. San Francisco. 2011
|
wikipedia
|
wiki_1573_chunk_13
|
Cycle (graph theory)
|
class Program
{
// This method returns the cycle in the form A, B, C, ... as text.
public static string ToString(List<Node> cycle)
{
string text = "";
for (int i = 0; i < cycle.Count; i++) // for-loop, iterating the vertices
{
text += cycle[i].value + ", ";
}
text = text.Substring(0, text.Length - 2);
return text;
}
// Main method executing the program
public static void Main(string[] args)
{
// Declares and initialises 5 vertices
Node node1 = new Node{index = 0, value = "A"};
Node node2 = new Node{index = 1, value = "B"};
Node node3 = new Node{index = 2, value = "C"};
Node node4 = new Node{index = 3, value = "D"};
// Declares and initialises an array holding the vertices
Node[] nodes = {node1, node2, node3, node4};
// Creates an undirected graph
UndirectedGraph undirectedGraph = new UndirectedGraph();
int numberOfNodes = nodes.Length;
for (int i = 0; i < numberOfNodes; i++) // for-loop, iterating all vertices
{
undirectedGraph.nodes.Add(nodes[i]); // Adds the vertices to the graph
}
// Connects the vertices of the graph with each other
undirectedGraph.ConnectNodes(node1, node1);
undirectedGraph.ConnectNodes(node1, node2);
undirectedGraph.ConnectNodes(node2, node3);
undirectedGraph.ConnectNodes(node3, node1);
undirectedGraph.ConnectNodes(node3, node4);
undirectedGraph.ConnectNodes(node4, node1);
HashSet<Node> newNodes = new HashSet<Node>(nodes); // Set of new vertices to iterate
HashSet<List<Node>> paths = new HashSet<List<Node>>(); // Set of current paths
for (int i = 0; i < numberOfNodes; i++) // for-loop, iterating all vertices of the graph
{
Node node = nodes[i];
newNodes.Add(node); // Add the vertex to the set of new vertices to iterate
List<Node> path = new List<Node>();
path.Add(node);
paths.Add(path); // Adds a path for each node as a starting vertex
}
HashSet<List<Node>> shortestCycles = new HashSet<List<Node>>(); // Set of shortest cycles
int lengthOfCycles = 0; // Length of shortest cycles
bool cyclesAreFound = false; // Whether or not cycles were found at all
while (!cyclesAreFound && newNodes.Count > 0) // As long as we still had vertices to iterate
{
newNodes.Clear(); // Empties the set of nodes to iterate
HashSet<List<Node>> newPaths = new HashSet<List<Node>>(); // Set of newly found paths
foreach (List<Node> path in paths) // foreach-loop, iterating all current paths
{
Node lastNode = path[path.Count - 1];
newNodes.Add(lastNode); // Adds the final vertex of the path to the list of vertices to iterate
foreach (Node nextNode in lastNode.adjacentNodes) // foreach-loop, iterating all neighbours of the previous node
{
if (path.Count >= 3 && path[0] == nextNode) // If a cycle with length greater or equal 3 was found
{
cyclesAreFound = true;
shortestCycles.Add(path); // Adds the path to the set of cycles
lengthOfCycles = path.Count;
}
if (!path.Contains(nextNode)) // If the path doesn't contain the neighbour
{
newNodes.Add(nextNode); // Adds the neighbour to the set of vertices to iterate
// Creates a new path
List<Node> newPath = new List<Node>();
newPath.AddRange(path); // Adds the current path's vertex to the new path in the correct order
newPath.Add(nextNode); // Adds the neighbour to the new path
newPaths.Add(newPath); // Adds the path to the set of newly found paths
}
}
}
paths = newPaths; // Updates the set of current paths
}
if (shortestCycles.Count > 0) // If cycles were found
{
Console.WriteLine("The graph contains " + shortestCycles.Count + " cycles of length " + lengthOfCycles + "."); // Print to console
foreach (List<Node> cycle in shortestCycles) // foreach-loop, iterating all found cycles
{
Console.WriteLine(ToString(cycle)); // Print to console
}
}
else
{
Console.WriteLine("The graph contains no cycles."); // Print to console
}
Console.ReadLine();
}
}
|
wikipedia
|
wiki_1144_chunk_20
|
Electrical discharge machining
|
A framework to define and measure the electrical parameters during an EDM operation directly on inter-electrode volume with an oscilloscope external to the machine has been recently proposed by Ferri et al. These authors conducted their research in the field of μ-EDM, but the same approach can be used in any EDM operation. This would enable the user to estimate directly the electrical parameters that affect their operations without relying upon machine manufacturer's claims. When machining different materials in the same setup conditions, the actual electrical parameters of the process are significantly different. Material removal mechanism
|
wikipedia
|
wiki_22981_chunk_4
|
Python Paste
|
Subcomponents of Paste
Paste has been a long-running open source project, dating from at least 2005. As it has grown, it has unbundled several other utilities from the Paste core. These utilities are part of the Paste project, but form their own packages and have their own version numbers. They include:
Paste Deploy is a system for finding and configuring WSGI applications and servers.
Paste Script, ScriptType, INITools, Tempita, WaitForIt, WPHP, WSGIFilter, and WSGIProxy are other notable bundles.
WebTest
WebOb is a wrapper around the WSGI environment.
WebTest and WebOb have migrated and are now part of the Pylons project.
|
wikipedia
|
wiki_38356_chunk_0
|
List of power stations in Washington
|
This is a list of electricity-generating power stations in the U.S. state of Washington, sorted by type and name. These include facilities that are located in more than one state. In 2019, Washington had a total summer capacity of 30,927 MW through all of its power plants, and a net generation of 106,464 GWh. The corresponding electrical energy generation mix was 62.0% hydroelectric, 15.1% natural gas, 8.3% nuclear, 6.7% coal, 6.3% wind, and 1.5% biomass which includes most refuse-derived fuel. Petroleum and utility-scale solar facilities generated most of the remaining 0.1%. Small-scale photovoltaic installations generated an additional net 205 GWh to the state's electrical grid; an amount four times larger than Washington's utility-scale photovoltaic plants.
|
wikipedia
|
wiki_31884_chunk_1
|
Polyhedral combinatorics
|
Research in polyhedral combinatorics falls into two distinct areas. Mathematicians in this area study the combinatorics of polytopes; for instance, they seek inequalities that describe the relations between the numbers of vertices, edges, and faces of higher dimensions in arbitrary polytopes or in certain important subclasses of polytopes, and study other combinatorial properties of polytopes such as their connectivity and diameter (number of steps needed to reach any vertex from any other vertex). Additionally, many computer scientists use the phrase “polyhedral combinatorics” to describe research into precise descriptions of the faces of certain specific polytopes (especially 0-1 polytopes, whose vertices are subsets of a hypercube) arising from integer programming problems.
|
wikipedia
|
wiki_7662_chunk_17
|
Race and genetics
|
Current studies of population genetics
Researchers currently use genetic testing, which may involve hundreds (or thousands) of genetic markers or the entire genome. Structure Several methods to examine and quantify genetic subgroups exist, including cluster and principal components analysis. Genetic markers from individuals are examined to find a population's genetic structure. While subgroups overlap when examining variants of one marker only, when a number of markers are examined different subgroups have different average genetic structure. An individual may be described as belonging to several subgroups. These subgroups may be more or less distinct, depending on how much overlap there is with other subgroups.
|
wikipedia
|
wiki_30410_chunk_1
|
International Gemological Institute
|
Operations
IGI has a staff of over 650 gemologists, appraisers and professional office personnel. The International Gemological Institute "has been at the forefront of technology since its commencement in 1975". This characteristic can be seen in the actions that the IGI has taken recently towards creating an Online Data Retrieval program and its Registration and Recovery Service. The IGI is also perfecting methods to reliably distinguish between synthetic and natural diamonds.
|
wikipedia
|
wiki_7478_chunk_5
|
General Algebraic Modeling System
|
GAMS’s impetus for development arose from the frustrating experience of a large economic modeling group at the World Bank. In hindsight, one may call it a historic accident that in the 1970s mathematical economists and statisticians were assembled to address problems of development. They used the best techniques available at that time to solve multi-sector economy-wide models and large simulation and optimization models in agriculture, steel, fertilizer, power, water use, and other sectors. Although the group produced impressive research, initial success was difficult to reproduce outside their well functioning research environment. The existing techniques to construct, manipulate, and solve such models required several manual, time-consuming, and error-prone translations into different, problem-specific representations required by each solution method. During seminar presentations, modelers had to defend the existing versions of their models, sometimes quite irrationally, because of time and money considerations. Their models just could not be moved to other environments, because special programming knowledge was needed, and data formats and solution methods were not portable.
|
wikipedia
|
wiki_13893_chunk_58
|
Building information modeling
|
Nigeria
BIM has the potential to play a vital role in the Nigerian AEC sector. In addition to its potential clarity and transparency, it may help promote standardization across the industry. For instance, Utiome suggests that, in conceptualizing a BIM-based knowledge transfer framework from industrialized economies to urban construction projects in developing nations, generic BIM objects can benefit from rich building information within specification parameters in product libraries, and used for efficient, streamlined design and construction. Similarly, an assessment of the current 'state of the art' by Kori found that medium and large firms were leading the adoption of BIM in the industry. Smaller firms were less advanced with respect to process and policy adherence. There has been little adoption of BIM in the built environment due to construction industry resistance to changes or new ways of doing things. The industry is still working with conventional 2D CAD systems in services and structural designs, although production could be in 3D systems. There is virtually no utilisation of 4D and 5D systems.
|
wikipedia
|
wiki_9077_chunk_11
|
Polygonal modeling
|
Creations - Create new geometry from some other mathematical object
Loft - Generate a mesh by creating a shape along two or more profile curves
Extrude - Creates a surface by sweeping a profile curve or polygon surface along a straight or linear line
Revolve - Generate a mesh by revolving (rotating) a shape around an axis
Marching cubes - Algorithm to construct a mesh from an implicit function
Binary Creations - Create a new mesh from a binary operation of two other meshes
Add - Boolean addition of two or more meshes
Subtract - Boolean subtraction of two or more meshes
Intersect - Boolean intersection
Union - Boolean union of two or more meshes
Attach - Attach one mesh to another (removing the interior surfaces)
Chamfer - Create a beveled surface which smoothly connects two surfaces
Deformations - Move only the vertices of a mesh
Deform - Systematically move vertices (according to certain functions or rules)
Weighted Deform - Move vertices based on localized weights per vertex
Morph - Move vertices smoothly between a source and target mesh
Bend - Move vertices to "bend" the object
Twist - Move vertices to "twist" the object
Manipulations - Modify the geometry of the mesh, but not necessarily topology
Displace - Introduce additional geometry based on a "displacement map" from the surface
Simplify - Systematically remove and average vertices
Subdivide - Introduce new vertices into a mesh by subdividing each face. In the case of, for instance, Catmull-Clark, subdivision can also have a smoothing effect on the meshes it is applied to.
Convex Hull - Generate a convex mesh which minimally encloses a given mesh
Cut - Create a hole in a mesh surface
Stitch - Close a hole in a mesh surface
Measurements - Compute some value of the mesh
Volume - Compute the 3D volume of a mesh (discrete volumetric integral)
Surface Area - Compute the surface area of a mesh (discrete surface integral)
Collision Detection - Determine if two complex meshes in motion have collided
Fitting - Construct a parametric surface (NURBS, bicubic spline) by fitting it to a given mesh
Point-Surface Distance - Compute distance from a point to the mesh
Line-Surface Distance - Compute distance from a line to the mesh
Line-Surface Intersection - Compute intersection of line and the mesh
Cross Section - Compute the curves created by a cross-section of a plane through a mesh
Centroid - Compute the centroid, geometric center, of the mesh
Center-of-Mass - Compute the center of mass, balance point, of the mesh
Circumcenter - Compute the center of a circle or sphere enclosing an element of the mesh
Incenter - Compute the center of a circle or sphere enclosed by an element of the mesh
|
wikipedia
|
wiki_12531_chunk_11
|
Transversality (mathematics)
|
Smoothness of solution spaces
Using Sard's theorem, whose hypothesis is a special case of the transversality of maps, it can be shown that transverse intersections between submanifolds of a space of complementary dimensions or between submanifolds and maps to a space are themselves smooth submanifolds. For instance, if a smooth section of an oriented manifold's tangent bundle—i.e. a vector field—is viewed as a map from the base to the total space, and intersects the zero-section (viewed either as a map or as a submanifold) transversely, then the zero set of the section—i.e. the singularities of the vector field—forms a smooth 0-dimensional submanifold of the base, i.e. a set of signed points. The signs agree with the indices of the vector field, and thus the sum of the signs—i.e. the fundamental class of the zero set—is equal to the Euler characteristic of the manifold. More generally, for a vector bundle over an oriented smooth closed finite-dimensional manifold, the zero set of a section transverse to the zero section will be a submanifold of the base of codimension equal to the rank of the vector bundle, and its homology class will be Poincaré dual to the Euler class of the bundle.
|
wikipedia
|
wiki_21412_chunk_25
|
Scratch (programming language)
|
An * file is divided into four sections:
"header", this 10-byte header contains the ASCII string 'ScratchV02' in versions higher than Scratch 1.2, and 'ScratchV01' in Scratch 1.2 and below
"infoSize", encodes the length of the project's infoObjects. A 4-byte long, 32-bit, big-Endian integer.
"infoObjects", a dictionary-format data section. It contains: "thumbnail", a thumbnail of the project's stage; "author", the username of the project's creator; "comment", the Project Notes; "history", the save and upload log; "scratch-version", the version of Scratch used to save the file;
"contents", an object table with the Stage as the root. All objects in the program are stored here as references.
|
wikipedia
|
wiki_18556_chunk_18
|
Erioderma pedicellatum
|
Researchers are trying to understand the genetic differences between each segmented population of E. pedicellatum. Currently, initial genetic analysis hypothesizes that the Pacific populations of E. pedicellatum are more diverse than the Atlantic population. However, research is still needed on how the populations interact with one another, specifically through gene flow. Gallery References
|
wikipedia
|
wiki_10669_chunk_11
|
Wetware computer
|
Medical applications
"Brain-on-a-chip" devices have been developed that are "aimed at testing and predicting the effects of biological and chemical agents, disease or pharmaceutical drugs on the brain over time". Wetware computers may be useful for research about brain diseases and brain health/capacities (for testing therapies targeting the brain), for drug discovery, for testing genome edits and research about brain aging. Ethical and philosophical implications Wetware computers may have substantial ethical implications, for instance related to possible potentials to sentience and suffering and dual-use technology.
|
wikipedia
|
wiki_31510_chunk_14
|
New Energy Reform Act of 2008
|
External links
'Gang of 10' Introduces Bipartisan Energy Proposal, Sen. Lindsey O. Graham Press Release.
http://www.chron.com/disp/story.mpl/front/5920512.html Senate's Gang of 10 offers an offshore drilling plan
http://www.foxnews.com/story/0,2933,395942,00.html Senate 'Gang of 10' offers bipartisan energy plan
https://web.archive.org/web/20110721062507/http://conrad.senate.gov/pressroom/record.cfm?id=301684&Senate Kent Conrad- Full Text
https://web.archive.org/web/20080929124431/http://www.wpde.com/news/news_story.aspx?id=168741 Gang of 10 Introduces Bipartisan Energy Proposal
|
wikipedia
|
wiki_21263_chunk_0
|
Davide Simoncelli
|
{{Infobox alpine ski racer
|name = Davide Simoncelli
|image = Davide Simoncelli Hinterstoder 2011.jpg
|image_size = 180px
|caption = Simoncelli in February 2011
|disciplines = Giant Slalom
|club = G.S. Fiamme Oro
|birth_date =
|birth_place = Rovereto, Italy
|height = 175 cm
|wcdebut = December 13, 1999 (age 20)
|retired = March 21, 2015 (age 36)
|website =
|olympicteams = 2 – (2006–10)
|olympicmedals = 0
|olympicgolds =
|worldsteams = 5 – (2001–05, 2009–11)
|worldsmedals = 0
|worldsgolds =
|wcseasons = 13 – (2001–13)|wcwins = 2 – (2 GS)
|wcpodiums = 8 – (8 GS)
|wcoveralls = 0 – (22nd in 2010)|wctitles = 0 – (4th in GS: 2006, 2010)|medals =
|
wikipedia
|
wiki_27720_chunk_2
|
Mathieu group M12
|
M12 has a strictly 5-transitive permutation representation on 12 points, whose point stabilizer is the Mathieu group M11. Identifying the 12 points with the projective line over the field of 11 elements, M12 is generated by the permutations of PSL2(11) together with the permutation (2,10)(3,4)(5,9)(6,7). This permutation representation preserves a Steiner system S(5,6,12) of 132 special hexads, such that each pentad is contained in exactly 1 special hexad, and the hexads are the supports of the weight 6 codewords of the extended ternary Golay code. In fact M12 has two inequivalent actions on 12 points, exchanged by an outer automorphism; these are analogous to the two inequivalent actions of the symmetric group S6 on 6 points.
|
wikipedia
|
wiki_27099_chunk_1
|
Rademacher complexity
|
Rademacher complexity of a function class
Given a sample , and a class of real-valued functions defined on a domain space , where is the loss function of a classifier , the empirical Rademacher complexity of given is defined as: This can also be written using the previous definition: where denotes function composition, i.e.: Let be a probability distribution over .
The Rademacher complexity of the function class with respect to for sample size is: where the above expectation is taken over an identically independently distributed (i.i.d.) sample generated according to .
|
wikipedia
|
wiki_36596_chunk_9
|
Heisenberg's entryway to matrix mechanics
|
One of Heisenberg's seniors, Max Born explained how he took his strange "recipe" given above and discovered something ground breaking:
By consideration of ...examples...[Heisenberg] found this rule.... This was in the summer of 1925. Heisenberg...took leave of absence...and handed over his paper to me for publication....Heisenberg's rule of multiplication left me no peace, and after a week of intensive thought and trial, I suddenly remembered an algebraic theory....Such quadratic arrays are quite familiar to mathematicians and are called matrices, in association with a definite rule of multiplication. I applied this rule to Heisenberg's quantum condition and found that it agreed for the diagonal elements. It was easy to guess what the remaining elements must be, namely, null; and immediately there stood before me the strange formula
[The symbol Q is the matrix for displacement, P is the matrix for momentum, stands for the square root of negative one, and is Planck's constant.]
|
wikipedia
|
wiki_32226_chunk_0
|
Environmental and Engineering Geophysical Society
|
The Environmental and Engineering Geophysical Society (EEGS) is an international, applied scientific organization (not-for-profit corporation) that has 700 members. One of the society’s major activities is producing its annual meeting, the Application of Geophysics to Engineering and Environmental Problems (SAGEEP). It develops and distributes a peer-reviewed scientific journal, the Journal of Environmental and Engineering Geophysics (JEEG), as well as an electronic quarterly newsletter, FastTIMES. It publishes, markets, and distributes books and CD-ROMs on the application and use of near-surface geophysical technologies, both in print and electronically (EEGS Research Collection, is an online reference featuring the entire collection of the organization’s JEEGs and SAGEEP proceedings).
|
wikipedia
|
wiki_29371_chunk_11
|
Cartoon Network Arabic
|
Films
Ben 10: Race Against Time (premiered November 5, 2011)
Ben 10: Alien Swarm (premiered November 7, 2011)
Destination: Imagination (premiered November 6, 2011)
Codename: Kids Next Door: Operation: Z.E.R.O. (premiered August 20, 2012)
Ed, Edd n Eddy's Big Picture Show (premiered August 19, 2012)
Camp Lazlo: Where's Lazlo? (premiered August 19, 2012)
Batman Beyond: Return of the Joker (premiered May 8, 2013)
Scooby-Doo! and the Loch Ness Monster (premiered December 5, 2012)
Scooby-Doo and the Cyber Chase (premiered December 12, 2012)
Scooby-Doo! and the Witch's Ghost (premiered December 19, 2012)
Chill Out, Scooby-Doo! (premiered December 26, 2012)
Lego Star Wars: The Yoda Chronicles (premiered September 26, 2013)
Lego Star Wars: The Empire Strikes Out (premiered October 17, 2012)
Lego Star Wars: The Padawan Menace (premiered December 12, 2011)
Free Willy (premiered June 5, 2013)
Free Willy 2: The Adventure Home (premiered June 12, 2013)
Free Willy 3: The Rescue (premiered June 19, 2013)
Cats & Dogs (premiered April 24, 2013)
My Gym Partner's a Monkey: Animal School Musical (premiered October 14, 2013)
Transformers Prime Beast Hunters: Predacons Rising (premiered December 19, 2013)
Ben 10: Secret of the Omnitrix (premiered September 5, 2013)
Ben 10: Destroy All Aliens (premiered March 16, 2012)
Ben 10/Generator Rex: Heroes United (premiered September 26, 2012)
Level Up (premiered July 5, 2012)
Alpha and Omega 2: A Howl-iday Adventure (premiered November 13, 2014)
Alpha and Omega 3: The Great Wolf Games (premiered September 22, 2015)
Over the Garden Wall (premiered June 21, 2015 – July 2, 2015)
Teen Titans: Trouble in Tokyo (premiered April 28, 2016)
Miniseries Adventure Time Stakes Special (premiered May 1, 2016 – May 7, 2016)
Lego DC Comics: Batman Be-Leaguered (premiered December 5, 2014)
Firebreather (premiered December 22, 2011)
¡Mucha Lucha!: The Return of El Maléfico (premiered October 3, 2013)
Willy Wonka & the Chocolate Factory (premiered April 10, 2013)
Tom and Jerry: The Movie (premiered October 25, 2012)
Tom and Jerry: Robin Hood and His Merry Mouse (premiered October 25, 2012)
Tom and Jerry: Shiver Me Whiskers (premiered October 25, 2012)
Tom and Jerry: The Magic Ring (premiered October 25, 2012)
Tom and Jerry: Blast Off to Mars (premiered October 25, 2012)
The Bugs Bunny/Road Runner Movie (premiered July 10, 2013)
Bugs Bunny's 3rd Movie: 1001 Rabbit Tales (premiered July 17, 2013)
Daffy Duck's Fantastic Island (premiered July 24, 2013)
Tweety's High-Flying Adventure (premiered July 31, 2013)
Stuart Little (premiered May 2017)
Stuart Little 3: Call of the Wild (premiered July 2017)
Regular Show: The Movie (premiered July 5, 2020)
Barbie Princess Adventure (premiered December 6, 2020)
Barbie & Chelsea: The Lost Birthday (premiered April 16, 2021)
Ben 10: Innervasion (premiered January 29, 2021)
Ben 10 Versus the Universe: The Movie (premiered June 18, 2021)
Adventure Time: Distant Lands (premiered May 21, 2021)
We Bare Bears: The Movie (premiered July 4, 2021)
|
wikipedia
|
wiki_9323_chunk_5
|
Computational cognition
|
When computational models attempt to mimic human cognitive functioning, all the details of the function must be known for them to transfer and display properly through the models, allowing researchers to thoroughly understand and test an existing theory because no variables are vague and all variables are modifiable. Consider a model of memory built by Atkinson and Shiffrin in 1968, it showed how rehearsal leads to long-term memory, where the information being rehearsed would be stored. Despite the advancement it made in revealing the function of memory, this model fails to provide answers to crucial questions like: how much information can be rehearsed at a time? How long does it take for information to transfer from rehearsal to long-term memory? Similarly, other computational models raise more questions about cognition than they answer, making their contributions much less significant for the understanding of human cognition than other cognitive approaches. An additional shortcoming of computational modeling is its reported lack of objectivity.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.