id
stringlengths 14
20
| title
stringlengths 4
131
| text
stringlengths 52
43k
| source
stringclasses 1
value |
|---|---|---|---|
wiki_13913_chunk_14
|
Computational phylogenetics
|
Fitch–Margoliash method
The Fitch–Margoliash method uses a weighted least squares method for clustering based on genetic distance. Closely related sequences are given more weight in the tree construction process to correct for the increased inaccuracy in measuring distances between distantly related sequences. The distances used as input to the algorithm must be normalized to prevent large artifacts in computing relationships between closely related and distantly related groups. The distances calculated by this method must be linear; the linearity criterion for distances requires that the expected values of the branch lengths for two individual branches must equal the expected value of the sum of the two branch distances - a property that applies to biological sequences only when they have been corrected for the possibility of back mutations at individual sites. This correction is done through the use of a substitution matrix such as that derived from the Jukes-Cantor model of DNA evolution. The distance correction is only necessary in practice when the evolution rates differ among branches. Another modification of the algorithm can be helpful, especially in case of concentrated distances (please report to concentration of measure phenomenon and curse of dimensionality): that modification, described in, has been shown to improve the efficiency of the algorithm and its robustness.
|
wikipedia
|
wiki_18612_chunk_52
|
Bootstrapping (statistics)
|
Calculate the test statistic
Create two new data sets whose values are and where is the mean of the combined sample.
Draw a random sample () of size with replacement from and another random sample () of size with replacement from .
Calculate the test statistic
Repeat 3 and 4 times (e.g. ) to collect values of the test statistic.
Estimate the p-value as where when condition is true and 0 otherwise. Example applications
|
wikipedia
|
wiki_17920_chunk_3
|
Origin (data analysis software)
|
Recent versions of Origin have introduced and expanded on batch capabilities, with the goal of eliminating the need to program many routine operations. Instead the user relies on customizable graph templates, analysis dialog box Themes which save a particular suite of operations, auto recalculation on changes to data or analysis parameters, and Analysis Templates™ which save a collection of operations within the workbook.
|
wikipedia
|
wiki_13208_chunk_3
|
Cell (journal)
|
Contents and features
In addition to original research articles, 'another section publishes previews, reviews, analytical articles, commentaries, essays, correspondence, current nomenclature lists, glossaries, and schematic diagrams of cellular processes. Features include "PaperClips" (short conversations between a Cell editor and an author exploring the rationale and implications of research findings) and "PaperFlicks" (video summaries of a Cell paper). Availability
Content over 12 months old is freely accessible, starting from the January 1995 issue.
|
wikipedia
|
wiki_7997_chunk_36
|
Advanced Idea Mechanics
|
Marvel Adventures
In the Marvel Adventures version of Iron Man, A.I.M., through the use of dummy companies, acquired Stark International's hover platform and uni-beam technology in their invasion of Madripoor, a third world country. Gia-Bao Yinsen tried to tell the world about A.I.M.'s terrorist attacks on his country. However, his message is dismissed. During Tony Stark's test of his new solar-powered glider, A.I.M. causes Tony to crash on their artificial island. Tony's heart is damaged, and A.I.M. forces him to build an EMP weapon to allow A.I.M.'s forces to finish their conquest of Madripoor. In exchange, A.I.M. will repair his heart. Tony learns that Yinsen was also kidnapped, as A.I.M. wanted to prevent him from telling the world about their attacks on his country and to use his intellect to build technology for A.I.M.. Similar to Iron Man's main Marvel Universe origin, Yinsen and Tony both build armor to escape. However, Yinsen destroys the generator powering the island in order to save his homeland. The explosion kills Yinsen, but Tony Stark lives. Tony becomes Iron Man to prevent people like A.I.M. from committing evil against innocents. Here, the Supreme Scientist is a black-haired woman who is extremely brilliant. In addition, the uniforms that A.I.M. uses are basically NBC orange suits. However, the Supreme Scientist wears black clothing in a style similar to Darth Vader.
|
wikipedia
|
wiki_1941_chunk_17
|
Self-modifying code
|
Semi-automatic optimizing of a state-dependent loop.
Dynamic in-place code optimization for speed depending on load environment.
Run-time code generation, or specialization of an algorithm in runtime or loadtime (which is popular, for example, in the domain of real-time graphics) such as a general sort utility – preparing code to perform the key comparison described in a specific invocation.
Altering of inlined state of an object, or simulating the high-level construction of closures.
Patching of subroutine (pointer) address calling, usually as performed at load/initialization time of dynamic libraries, or else on each invocation, patching the subroutine's internal references to its parameters so as to use their actual addresses (i.e. indirect self-modification).
Evolutionary computing systems such as neuroevolution, genetic programming and other evolutionary algorithms.
Hiding of code to prevent reverse engineering (by use of a disassembler or debugger) or to evade detection by virus/spyware scanning software and the like.
Filling 100% of memory (in some architectures) with a rolling pattern of repeating opcodes, to erase all programs and data, or to burn-in hardware or perform RAM tests.
Compressing code to be decompressed and executed at runtime, e.g., when memory or disk space is limited.
Some very limited instruction sets leave no option but to use self-modifying code to perform certain functions. For example, a one instruction set computer (OISC) machine that uses only the subtract-and-branch-if-negative "instruction" cannot do an indirect copy (something like the equivalent of "*a = **b" in the C language) without using self-modifying code.
Booting. Early microcomputers often used self-modifying code in their bootloaders. Since the bootloader was keyed in via the front panel at every power-on, it did not matter if the bootloader modified itself. However, even today many bootstrap loaders are self-relocating, and a few are even self-modifying.
Altering instructions for fault-tolerance.
|
wikipedia
|
wiki_16464_chunk_7
|
The Three Laws of Robotics in popular culture
|
Webcomic author R. Stevens populates his Diesel Sweeties series with a mixture of humans and robots, most of whom are continually violating the Three Laws. In particular, Red Robot C-63 follows a self-appointed mandate to "crush all hu-mans". In strip 688, he references the Three Laws explicitly: humans are "all like, 'if you cut me, do I not bleed?' And we're all like, 'not able to injure a human being or let them come to harm'. What a bunch of drippy-ass hypocrites!" (See also The Merchant of Venice.)
In April 2004, the comic strip Piled Higher and Deeper ran a series entitled "I, Grad Student". Cast as a never-before-seen Asimov short story, this series of strips features a robotic grad student whose "procrastronic brain" malfunctions, leading it to violate the "First Law of Graduatics". In full, these Laws are the following:
A grad student may not delete data, or, through inaction, allow data to be deleted.
A grad student must obey orders given by its advisor, unless such orders conflict with the First Law.
A grad student must protect its (insignificant) existence, as long as such protection does not conflict with the First or Second Law.
Later in the story, a Zeroth Law is introduced: "A grad student may not harm its advisor's ego, or through inaction, allow that ego to come to harm." The strips feature a character named Susan Calvin, and their visual style parodies the I, Robot movie released that summer.
|
wikipedia
|
wiki_16245_chunk_24
|
Gadfly (database)
|
After installation, the created database can be interactively tested from the same directory using the interactive interpreter:
Python 2.1.3 (#1, Apr 30 2002, 19:37:40)
[GCC 2.96 20000731 (Red Hat Linux 7.1 2.96-96)] on linux2
Type "copyright", "credits" or "license" for more information.
>>>
>>> from gadfly import gadfly
>>> connection = gadfly("test", "dbtest")
>>> cursor = connection.cursor()
>>> cursor.execute("select * from frequents")
>>> cursor.description
(('DRINKER', None, None, None, None, None, None), ('PERWEEK', None, None,
None, None, None, None), ('BAR', None, None, None, None, None, None))
>>> print cursor.pp()
DRINKER | PERWEEK | BAR
============================
adam | 1 | lolas
woody | 5 | cheers
sam | 5 | cheers
norm | 3 | cheers
wilt | 2 | joes
norm | 1 | joes
lola | 6 | lolas
norm | 2 | lolas
woody | 1 | lolas
pierre | 0 | frankies
>>>
|
wikipedia
|
wiki_38790_chunk_44
|
Educational neuroscience
|
The Horizontal Problem: Translating research findings: While education theory and data are almost exclusively behavioral, findings from neuroscience research can take on many forms (e.g. electrical, chemical, spatial, temporal etc.). The most common form of data taken from neuroscience to education is the spatial mapping of brain activation to cognitive function. Willingham (2009) highlights the difficulty in applying such spatial information to educational theory. If a certain brain region is known to support a cognitive function relevant for education, what can actually be done with that information? Willingham suggests that this ‘horizontal problem’ can be solved only when a rich body of behavioral data and theories already exist, and points out that such methods have already been successful in identifying subtypes of dyslexia (e.g.).
|
wikipedia
|
wiki_2069_chunk_5
|
Dynamic programming language
|
Assembly, C, C++, early Java, and Fortran do not generally fit into this category. Example code
The following examples show dynamic features using the language Common Lisp and its Common Lisp Object System (CLOS). Computation of code at runtime and late binding
The example shows how a function can be modified at runtime from computed source code ; the source code is stored as data in a variable
CL-USER > (defparameter *best-guess-formula* '(lambda (x) (* x x 2.5)))
*BEST-GUESS-FORMULA*
|
wikipedia
|
wiki_38619_chunk_0
|
National Correct Coding Initiative
|
The National Correct Coding Initiative (NCCI) is a Centers for Medicare & Medicaid Services (CMS) program designed to prevent improper payment of procedures that should not be submitted together. There are two categories of edits:
Physician Edits: these code pair edits apply to physicians, non-physician practitioners, and Ambulatory Surgery Centers
Hospital Outpatient Prospective Payment System Edits (Outpatient Edits): these edits apply to the following types of bills: Hospitals (12X and 13X), Skilled Nursing Facilities (22X and 23X), Home Health Agencies Part B (34X), Outpatient Physical Therapy and Speech Language Pathology Providers (74X), and Comprehensive Outpatient Rehabilitation Facilities (75X).
Both the physician and outpatient edits can be split into two further code pair categories:
Column1/Column2 Code Pairs: these code pairs were created to identify unbundled services. The name is derived from the fact that the code pairs are separated into two columns; Column 1 contains the most comprehensive code, and Column 2 contains component services already covered by that more comprehensive code. These code pairs are further categorized into two sets:
Modifier: the appropriate use of a modifier allows these code pair to be reported together. In most cases, the -59 modifier is used, although there are other acceptable modifiers. These modifiers must be supported by documentation in the medical record.
No Modifiers: these code pairs should never be reported together, regardless of modifiers.
Mutually Exclusive Code Pairs (MEC): these code pairs should not be reported together because they are mutually exclusive of each other.
NCCI code pairs must match on member, provider, and date of service. CMS maintains tables of code pair edits and updates these tables on a quarterly basis.
|
wikipedia
|
wiki_29312_chunk_48
|
Network science
|
Link analysis
Link analysis is a subset of network analysis, exploring associations between objects. An example may be examining the addresses of suspects and victims, the telephone numbers they have dialed and financial transactions that they have partaken in during a given timeframe, and the familial relationships between these subjects as a part of police investigation. Link analysis here provides the crucial relationships and associations between very many objects of different types that are not apparent from isolated pieces of information. Computer-assisted or fully automatic computer-based link analysis is increasingly employed by banks and insurance agencies in fraud detection, by telecommunication operators in telecommunication network analysis, by medical sector in epidemiology and pharmacology, in law enforcement investigations, by search engines for relevance rating (and conversely by the spammers for spamdexing and by business owners for search engine optimization), and everywhere else where relationships between many objects have to be analyzed.
|
wikipedia
|
wiki_35185_chunk_1
|
Computer-assisted qualitative data analysis software
|
Project Exchange Format
In March 2019 the Rotterdam Exchange Format Initiative (REFI) launched a new open exchange standard for qualitative data called QDA-XML. The aim is to allow users to bring coded qualitative data from one software package to another. Initially support was included in Atlas.ti, QDA Miner, Quirkos and Transana, with implementation pledged from Dedoose, MAXQDA and NVivo. Although this was not the first standard to be proposed, it was the first to be implemented by more than one software package, and came as the result of a collaboration between vendors and community representatives from the research community. Previously there was very little capability to bring data in from other software packages.
|
wikipedia
|
wiki_3465_chunk_10
|
Neuromorphic engineering
|
A research project with implications for neuromorphic engineering is the Human Brain Project that is attempting to simulate a complete human brain in a supercomputer using biological data. It is made up of a group of researchers in neuroscience, medicine, and computing. Henry Markram, the project's co-director, has stated that the project proposes to establish a foundation to explore and understand the brain and its diseases, and to use that knowledge to build new computing technologies. The three primary goals of the project are to better understand how the pieces of the brain fit and work together, to understand how to objectively diagnose and treat brain diseases, and to use the understanding of the human brain to develop neuromorphic computers. That the simulation of a complete human brain will require a supercomputer a thousand times more powerful than today's encourages the current focus on neuromorphic computers. $1.3 billion has been allocated to the project by The European Commission.
|
wikipedia
|
wiki_35414_chunk_6
|
Mechanical systems drawing
|
Schematic drawing
The schematic is a line diagram, not necessarily to scale, that describes interconnection of components in a system. The main features of a schematic drawing show:
A two dimensional layout with divisions that show distribution of the system between building levels, or an isometric-style layout that shows distribution of systems across individual floor levels
All functional components that make up the system, i.e., plant items, pumps, fans, valves, strainers, terminals, electrical switchgear, distribution and components
Symbols and line conventions, in accordance with industry standard guidance
Labels for pipe, duct, and cable sizes where not shown elsewhere
Components that have a sensing and control function, and links between them—building management systems, fire alarms and HV controls
Major components, so their whereabouts in specifications and other drawings can be easily determined
|
wikipedia
|
wiki_16532_chunk_6
|
Computational visualistics
|
Algorithms from "not-image" to »image«
The investigation of possibilities gained by the operations that result in instances of the data type »image« but take as a starting point instances of non-pictorial data types is performed in particular in computer graphics and information visualization. The former deals with images in the closer sense, i.e., those pictures showing spatial configurations of objects (in the colloquial meaning of 'object') in a more or less naturalistic representation like, e.g., in virtual architecture. The starting point of the picture-generating algorithms in computer graphics is usually a data type that allows us to describe the geometry in three dimensions and the lighting of the scene to be depicted together with the important optical properties of the surfaces considered. Scientists in information visualization are interested in presenting pictorially any other data type, in particular those that consist of non-visual components in a "space" of states: in order to do so, a convention of visual presentation has firstly to be determined – e.g., a code of colors or certain icons. The well-known fractal images (e.g., of the Mandelbrot set) form a borderline case of information visualization since an abstract mathematical property has been visualized.
|
wikipedia
|
wiki_22471_chunk_6
|
Hirschberg's algorithm
|
function Hirschberg(X, Y)
Z = ""
W = ""
if length(X) == 0
for i = 1 to length(Y)
Z = Z + '-'
W = W + Yi
end
else if length(Y) == 0
for i = 1 to length(X)
Z = Z + Xi
W = W + '-'
end
else if length(X) == 1 or length(Y) == 1
(Z, W) = NeedlemanWunsch(X, Y)
else
xlen = length(X)
xmid = length(X) / 2
ylen = length(Y)
ScoreL = NWScore(X1:xmid, Y)
ScoreR = NWScore(rev(Xxmid+1:xlen), rev(Y))
ymid = arg max ScoreL + rev(ScoreR)
(Z,W) = Hirschberg(X1:xmid, y1:ymid) + Hirschberg(Xxmid+1:xlen, Yymid+1:ylen)
end
return (Z, W)
|
wikipedia
|
wiki_15398_chunk_9
|
Roxxon Energy Corporation
|
Staff
Bill - Helicopter pilot for Roxxon's Long Island division.
Carson - A security operative.
Chester - A floating oil refinery worker for Roxxon Oil.
Chief Compton - Supervisor of Roxxon's underground NYC facility.
Larry Curtiss - A security operative.
Davis - A scientist who is an assistant to Jonas Harrow.
Delvecchio - Member of Roxxon's underground NYC facility.
Jim Dworman - Former Cybertek programmer. He was in charge of Cybertek's shutdown.
Gail - Secretary to Carrington Pax.
Gordon - Member of Roxxon's underground NYC facility.
Grist - Member of Roxxon's underground NYC facility security.
Jake - A security guard at Roxxon's Denver division.
Joe - A floating oil refinery worker.
Juan - An executive assistant to Hale in Roxxon's San Francisco division.
Ms. Loring - A scientist under Hale and participator in the Nuform project.
Missy - A Roxxon agent.
Patrick Nestor - Roxxon's company spokesman.
Dr. Malachi Oz - A scientist.
Riki - A boardroom chair at One Roxxon Plaza.
Sepulchre / Jillian Woods - An agent for Roxxon Blackridge.
Cindy Shelton - Roxxon's lead researcher.
"Agger" - An assistant to Huck Petrie.
Raymond Sikorski - A recruiter with Roxxon Blackridge.
Miss Simpkins - A secretary at Hydropolis.
Dr. Ella Sterling - A scientist contractor of Roxxon. She took part in Roxxon's archaeological expedition which resulted in her colleague turned into a Wendigo but is saved by Hulkverine. Sterling is safe thanks to Hulkverine and Doctor Strange fighting the Wendigo, eventually killing the creature. Sterling later runs into Sonia Sung while looking for Hulkverine who throws Sonia and Sterling safely away from Roxxon's capture of Hulkverine. Sterling and Sonia infiltrates Roxxon's facility to help Hulkverine escape from Dario Agger's clutches.
Michael Thomas - A sleeper agent working at Stark International.
Ulik - Originally hired by Dario Agger to help level Broxton, hired to be a consultant on the "Inter-Realm Investment Division".
Walter - An executive assistant to President Gamelin.
Alvie Walton - Member at Roxxon's Snow Valley service station.
Chief Wyngard - Roxxon's underground NYC facility supervisor.
|
wikipedia
|
wiki_13000_chunk_13
|
Graduate Aptitude Test in Engineering
|
From GATE 2014 onward (and year 2014-15 of the 2-year validity period of GATE 2013 score), a candidate's GATE score is computed by the following new formula.
where,
S = Score (normalized) of a candidate,
M = Marks obtained by a candidate ("normalized marks" in case of multiple-session subjects CE, CS, EC, EE and ME),
Mq = Qualifying marks for general category candidates in that subject (usually 25 or μ + σ, whichever is higher),
μ = Average (i.e. arithmetic mean) of marks of all candidates in that subject,
σ = Standard deviation of marks of all candidates in that subject,
t = Average marks of top 0.1 % candidates (for subjects with 10000 or more appeared candidates) or top 10 candidates (for subjects with less than 10000 appeared candidates),
St = 900 = Score assigned to t,
Sq = 350 = Score assigned to Mq.
|
wikipedia
|
wiki_123_chunk_31
|
Military engineering vehicle
|
IMR-2 (Inzhenernaya Mashina Razgrashdeniya) - Combat engineering vehicle (CEV). It has a telescoping crane arm which can lift between 5 and 11 metric tons and utilizes a pincers for uprooting trees. Pivoted at the front of the vehicle is a dozer blade that can be used in a V-configuration or as a straight dozer blade. When not required it is raised clear of the ground. On the vehicle's rear, a mine-clearing system is mounted.
IMR-2M1 - Simplified model without the mine-clearing system. Entered service in 1987.
IMR-2M2 - Improved version that is better suited for operations in dangerous situations, for example in contaminated areas. It entered service in 1990 and has a modified crane arm with bucket instead off the pincers.
IMR-2MA - Latest version with bigger operator's cabin armed with a 12.7 mm machine gun NSV.
Klin-1 - Remote controlled IMR-2.
MTU-72 (Ob'yekt 632) (Tankovyj Mostoukladchik) - bridge layer based on T-72 chassis. The overall layout and operating method of the system are similar to those of the MTU-20 and MTU bridgelayers. The bridge, when laid, has an overall length of 20 meters. The bridge has a maximum capacity of 50,000 kg, is 3.3 meters wide, and can span a gap of 18 m. By itself, the bridge weighs 6400 kg. The time required to lay the bridge is 3 minutes, and 8 minutes for retrieval.
BLP 72 (Brückenlegepanzer) - The East-German army had plans to develop a new bridgelayer tank that should have been ready for series production from 1987 but after several difficulties the project was canceled.
|
wikipedia
|
wiki_22923_chunk_0
|
List of Sinclair QL software
|
This is a list of software titles produced for the Sinclair QL personal computer. Notation: Program name (purpose), publisher, first release Utilities #
3D Precision, High-Precision Imaging System, Digital Precision A
Abacus (Spreadsheet), Psion (Sinclair), 1984
APL Interpreter
ArcED, coWo
Archive (Database), Psion (Sinclair), 1984
Archivist database (Std and MP), A.R.K. (Richard Howe), 1984
Assembler and Linker, Computer One
Assembler, GST Computer Systems
Assembler, Metacomco
Assembler Workbench, Talent
|
wikipedia
|
wiki_33368_chunk_8
|
List of Valencia CF records and statistics
|
Overall seasons table in La Liga
{|class="wikitable"
|-bgcolor="#efefef"
! Pos.
! Club
! Season In D1
! Pl.
! W
! D
! L
! GS
! GA
! Dif.
! Pts
!Champion
!2nd place
!3rd place
!4th place
|-
|align=center|3|Valencia|align=center |80|align=center|2588
|align=center|1163
|align=center|598
|align=center|827
|align=center|4296
|align=center|3356
|align=center|940
|align=center|3296| align=center bgcolor=gold| 6| align=center bgcolor=silver| 6| align=center bgcolor=cc9966| 10| align=center | 11'|}
|
wikipedia
|
wiki_9316_chunk_16
|
Computer-aided audit tools
|
Comparison by analysis features
The following table compares features of specialized computer-aided audit tools. The table has several fields, as follows:Product Name: Product's name; sometime includes edition if a certain edition is targeted.Age analysis: Specifies whether the product supports making age analysis (stratification by date).Benford's law: Specifies whether the product supports finding abnormal distribution of specific digits accordingly to Benford's law.Calculated field: Specifies whether the product supports adding extra calculated fields into the table/file. Usually implies using an expression builder feature to build up expressions for defining the field calculation.Drill-down (Table): Specifies whether the product supports drill-down features by zooming in (filtering) on selected rows in the table.Drill-down (Pivot): Specifies whether the product supports drill-down features through pivot table.Matching: Specifies whether the product supports finding matching items for a specific field in a table/file. For example, this could be used to find duplicate billings of invoices within the sales ledger.Matching (Fuzzy): Specifies whether the product supports finding matching items for a specific field using fuzzy comparison. For instance, values compared are similar but not exactly the same (e.g., using Levenshtein matching).Sample (Random): Specifies whether the product supports selecting a random sample of rows from the table/file (population).Sample (Monetary unit): Specifies whether the product supports selecting a monetary unit sample of rows from the table/field (population). This is also known as dollar-unit sampling (when values are in U.S. currency).Sequence check (Gap): Specifies whether the product supports can find (identify) gabs (in sequences) for a specific field. For example, finding a broken sequence in an invoice number sequence.Sort field: Specifies whether the product supports sorting (indexing) by a specific field (column). Sorting helps identifying blank/empty values or excessive (out-of-band) values.Sort multiple fields: Specifies whether the product supports sorting by multiple fields (columns).Statistics: Specifies whether the product supports calculation and presentation of various statistics on a specific field (e.g., for a numeric fields values such as total number of positive numbers, total number negative numbers, average value (balance), etc.)Stratification: Specifies whether the product supports stratification on number (amount) values in specified intervals. Splits the population into strata (intervals) and aggregates (summarizes) values. Can be used to find largest, smallest and average amount transactions (rows).Total row: Specifies whether the products supports displaying a total row for the table/file, e.g. accumulated numerical value.
|
wikipedia
|
wiki_33714_chunk_24
|
Traditional ecological knowledge
|
The integration of TTL into the EPA's risk assessment paradigm is one example of how the EPA-Tribal Science Council has been able to enact change in EPA culture. The risk assessment paradigm is an "organizing framework for the scientific analysis of the potential for harmful impacts to human health and the environment as a result of exposure to contaminants or other environmental stressors." Risk assessment has been used by the EPA to establish "clean-up levels at hazardous waste sites, water quality and air quality criteria, fish advisories, and bans or restricted uses for pesticides and other toxic chemicals." Tribal people are concerned, however, that current risk assessment methodologies do not afford complete value to tribal culture, values, and/or life ways. The Tribal Science Council seeks to incorporate TTL into exposure assumptions existent in the EPA risk assessment model. A long-term goal for the EPA's Tribal Science Council, however, is a complete shift in decision-making assessments from risk to preserving a healthy people and environment. As stated above, tribal people do not accept a separation of the human and ecological condition when they characterize risk. Through EPA initiated seminar, workshops, and projects, tribes have been able to engage in dialogue about the integration of Tribal Traditional Lifeways into EPA risk assessment and decision-making. This has occurred in a number of ways: inclusion of unique tribal cultural activities such as native basketry, the importance of salmon and other fishes, native plant medicine, consumption of large amounts of fish and game, and sweat lodges as exposures for estimating potential risk to people or to communities. Although these types of tribal specific activities may be included in EPA's risk assessment, there is no assurance that they will be included nor is there consistency in how they may be applied at different sites across the country.
|
wikipedia
|
wiki_27730_chunk_1
|
List of Macintosh software published by Microsoft
|
Pre-Microsoft Macintosh Business Unit (1984-1998)
Microsoft BASIC Version 1.0 - Version 3.0 (1984–1986)
Microsoft Multiplan (1984)
Microsoft Excel Version 1.0 (1985), 1.5 (1988), 2.2 (1989), 3.0 (1990), 4.0 (1992), 5.0 (1993)
Microsoft Word Version 1.0 (1985), 3.0 (1987), 4.0 (1989), 5.x (1991), 6.0 (1993)
Microsoft Write 1.0 (1987)
Microsoft Works Versions 1.0 to 4.0 (1986–1994)
Microsoft Flight Simulator Version 1.0 (1986), 4.0 (1991)
Microsoft PowerPoint Version 1.0 (1987), 2.0 (1988), 3.0 (1992), 4.0 (1994)
QuickBASIC Version 1.0 (1988)
Microsoft Office Version 1.0 (1989)
Microsoft Project Versions 1.0 to 4.0 (1991–1993)
Microsoft Art Gallery (1993)
Microsoft Dinosaurs (1993)
Microsoft FoxPro 2 Version 2.6 (1994)
Microsoft Bookshelf Version 4.0 (1994)
Ghostwriter Mysteries for Creative Writer: The Case of the Blue Makva (1994)
Microsoft Cinemania Version '94, '95, '96, '97 (1994–1996)
Microsoft Creative Writer (1994)
Microsoft Dangerous Creatures (1994)
Microsoft Fine Artist (1994)
Microsoft Musical Instruments (1994)
Microsoft Arcade (1995)
Microsoft Dogs (1995)
Microsoft Encarta Version '95 (1995), 97 (1996)
The Magic School Bus (1995)
Explores Bugs
Explores in the Age of the Dinosaurs
Explores inside the Earth
Explores the Human Body
Explores the Ocean
Explores the Rainforest
Explores the Solar System
Microsoft Visual C++ Pro Cross Development for Mac 4.0 (1995)
Microsoft Wine Guide (1995)
Internet Explorer for Mac Versions 2.0-5.2.3 (1996–2003)
Microsoft Music Central 96 (1996)
Microsoft Music Central 97 (1996)
Microsoft Visual FoxPro Version 3.0 (1996)
|
wikipedia
|
wiki_3414_chunk_28
|
Interaction (statistics)
|
Examples
Real-world examples of interaction include:
Interaction between adding sugar to coffee and stirring the coffee. Neither of the two individual variables has much effect on sweetness but a combination of the two does.
Interaction between adding carbon to steel and quenching. Neither of the two individually has much effect on strength but a combination of the two has a dramatic effect.
Interaction between smoking and inhaling asbestos fibres: Both raise lung carcinoma risk, but exposure to asbestos multiplies the cancer risk in smokers and non-smokers. Here, the joint effect of inhaling asbestos and smoking is higher than the sum of both effects.
Interaction between genetic risk factors for type 2 diabetes and diet (specifically, a "western" dietary pattern). The western dietary pattern was shown to increase diabetes risk for subjects with a high "genetic risk score", but not for other subjects.
Interaction between education and political orientation, affecting general-public perceptions about climate change. For example, US surveys often find that acceptance of the reality of anthropogenic climate change rises with education among moderate or liberal survey respondents, but declines with education among the most conservative. Similar interactions have been observed to affect some non-climate science or environmental perceptions, and to operate with science literacy or other knowledge indicators in place of education.
|
wikipedia
|
wiki_17624_chunk_7
|
Well-known text representation of geometry
|
Format variations
EWKT and EWKB – Extended Well-Known Text/Binary A PostGIS-specific format that includes the spatial reference system identifier (SRID) and up to 4 ordinate values (XYZM). For example: SRID=4326;POINT(-44.3 60.1) to locate a longitude/latitude coordinate using the WGS 84 reference coordinate system. It also supports circular curves, following elements named (but not fully defined) within the original WKT: CircularString, CompoundCurve, CurvePolygon and CompoundSurface.
AGF Text – Autodesk Geometry Format An extension to OGC's Standard (at the time), to include curved elements; most notably used in MapGuide.
|
wikipedia
|
wiki_3372_chunk_15
|
MIT Computer Science and Artificial Intelligence Laboratory
|
Notable researchers
(Including members and alumni of CSAIL's predecessor laboratories)
MacArthur Fellows Tim Berners-Lee, Erik Demaine, Dina Katabi, Daniela L. Rus, Regina Barzilay, Peter Shor, Richard Stallman, and Joshua Tenenbaum
Turing Award recipients Leonard M. Adleman, Fernando J. Corbató, Shafi Goldwasser, Butler W. Lampson, John McCarthy, Silvio Micali, Marvin Minsky, Ronald L. Rivest, Adi Shamir, Barbara Liskov, Michael Stonebraker, and Tim Berners-Lee
IJCAI Computers and Thought Award recipients Terry Winograd, Patrick Winston, David Marr, Gerald Jay Sussman, Rodney Brooks
Rolf Nevanlinna Prize recipients Madhu Sudan, Peter Shor, Constantinos Daskalakis
Gödel Prize recipients Shafi Goldwasser (two-time recipient), Silvio Micali, Maurice Herlihy, Charles Rackoff, Johan Håstad, Peter Shor, and Madhu Sudan
Grace Murray Hopper Award recipients Robert Metcalfe, Shafi Goldwasser, Guy L. Steele, Jr., Richard Stallman, and W. Daniel Hillis
Textbook authors Harold Abelson and Gerald Jay Sussman, Richard Stallman, Thomas H. Cormen, Charles E. Leiserson, Patrick Winston, Ronald L. Rivest, Barbara Liskov, John Guttag, Jerome H. Saltzer, Frans Kaashoek, Clifford Stein, and Nancy Lynch
David D. Clark, former chief protocol architect for the Internet; co-author with Jerome H. Saltzer (also a CSAIL member) and David P. Reed of the influential paper "End-to-End Arguments in Systems Design"
Eric Grimson, expert on computer vision and its applications to medicine, appointed Chancellor of MIT March 2011
Bob Frankston, co-developer of VisiCalc, the first computer spreadsheet
Seymour Papert, inventor of the Logo programming language
Joseph Weizenbaum, creator of the ELIZA computer-simulated therapist
|
wikipedia
|
wiki_246_chunk_52
|
Geotechnical engineering
|
The observational method was proposed by Karl Terzaghi and discussed in a paper by Ralph B. Peck (1969) in an effort to reduce the costs during construction incurred by designing earth structures based on the most-unfavorable assumptions (in other words, geological conditions, soil engineering properties and so on). Instead, the design is based on the most-probable conditions rather than the most-unfavorable. Gaps in the available information are filled by observations: geotechnical-instrumentation measurements (for example, inclinometers and piezometers) and geotechnical site investigation (for example, borehole drilling and a CPT). These observations aid in assessing the behavior of the structure during construction, which can then be modified in accordance with the findings. The method may be described as "learn-as-you-go".
|
wikipedia
|
wiki_1970_chunk_4
|
Bellman–Ford algorithm
|
function BellmanFord(list vertices, list edges, vertex source) is
// This implementation takes in a graph, represented as
// lists of vertices (represented as integers [0..n-1]) and edges,
// and fills two arrays (distance and predecessor) holding
// the shortest path from the source to each vertex
distance := list of size n
predecessor := list of size n
// Step 1: initialize graph
for each vertex v in vertices do
distance[v] := inf // Initialize the distance to all vertices to infinity
predecessor[v] := null // And having a null predecessor
distance[source] := 0 // The distance from the source to itself is, of course, zero
// Step 2: relax edges repeatedly
repeat |V|−1 times:
for each edge (u, v) with weight w in edges do
if distance[u] + w < distance[v] then
distance[v] := distance[u] + w
predecessor[v] := u
// Step 3: check for negative-weight cycles for each edge (u, v) with weight w in edges do
if distance[u] + w < distance[v] then
error "Graph contains a negative-weight cycle"
return distance, predecessor
|
wikipedia
|
wiki_25565_chunk_1
|
Catalyst Code
|
Catalyst Code is the first full-length book to examine the unique strategic problems faced by economic catalysts (or multi-sided platform businesses), enterprises that add value by facilitating interactions between two or more groups of customers who need each other in some way. Some familiar examples of economic catalysts are matchmakers old and new, auction houses, securities markets, magazines, search engines, shopping centers, credit and debit cards, and software platforms. (The authors analyzed the last two of these in the books Paying with Plastic and Invisible Engines, respectively.)
|
wikipedia
|
wiki_8869_chunk_37
|
Indian mathematics
|
The surviving manuscript has seventy leaves, some of which are in fragments. Its mathematical content consists of rules and examples, written in verse, together with prose commentaries, which include solutions to the examples. The topics treated include arithmetic (fractions, square roots, profit and loss, simple interest, the rule of three, and regula falsi) and algebra (simultaneous linear equations and quadratic equations), and arithmetic progressions. In addition, there is a handful of geometric problems (including problems about volumes of irregular solids). The Bakhshali manuscript also "employs a decimal place value system with a dot for zero." Many of its problems are of a category known as 'equalisation problems' that lead to systems of linear equations. One example from Fragment III-5-3v is the following:
|
wikipedia
|
wiki_25182_chunk_5
|
Sawzall (programming language)
|
Sawzall code
This complete Sawzall program will read the input and produce three results: the number of records, the sum of the values,
and the sum of the squares of the values. count: table sum of int;
total: table sum of float;
sum_of_squares: table sum of float;
x: float = input;
emit count <- 1;
emit total <- x;
emit sum_of_squares <- x * x; See also
Pig – similar tool and language for use with Apache Hadoop
Sawmill (software) References
|
wikipedia
|
wiki_238_chunk_11
|
Functional decomposition
|
Characteristics of hierarchy and modularity
In natural or artificial systems that require components to be integrated in some fashion, but where the number of components exceeds what could reasonably be fully interconnected (due to square wise growth in number of connections (= n over two or = n * (n - 1) / 2)), one often finds that some degree of hierarchicality must be employed in the solution. The general advantages of sparse hierarchical systems over densely connected systems—and quantitative estimates of these advantage—are presented by . In prosaic terms, a hierarchy is "a collection of elements that combine lawfully into complex wholes which depend for their properties upon those of their constituent parts," and wherein novelty is "fundamentally combinatorial, iterative, and transparent" .
|
wikipedia
|
wiki_38219_chunk_3
|
Powercfg
|
Parameters
{| class="wikitable sortable"
|-
! rowspan=2 | Parameter
! rowspan=2 | Description
! colspan=2 | OS
|-
! XP
! Other
|-
|style="vertical-align:top"|/l[ist]
|style="vertical-align:top"|Lists all power schemes in the current user's environment.
|style="background:#90ff90;color:black;vertical-align:middle;text-align:center" class="table-yes"|
|style="background:#90ff90;color:black;vertical-align:middle;text-align:center" class="table-yes"|
|-
|style="vertical-align:top"|/q[uery] [scheme_name] (XP)/q[uery] [Scheme_GUID] [Sub_GUID]
|style="vertical-align:top"|Displays the contents of the specified power scheme.
|
wikipedia
|
wiki_5524_chunk_10
|
FP (programming language)
|
FP84's semantics are embodied in an underlying algebra of programs, a set of function-level equalities that may be used to manipulate and reason about programs. References Sacrificing simplicity for convenience: Where do you draw the line?, John H. Williams and Edward L. Wimmers, IBM Almaden Research Center, Proceedings of the FIfteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Diego, CA, January 1988. External links
Interactive FP (requires Java), Help page
FP trivia (German)
|
wikipedia
|
wiki_7027_chunk_11
|
Best practicable environmental option
|
Critique
The ideology behind the BPEO expresses concern for social improvements—in addition to the focus on economic viability, a reduction in overall resource consumption, and its associated environmental impacts—though, in reality, the methodology and practical resources used to determine the BPEO, by way of Life Cycle Assessment (LCA) and economic auditing tools, rely on strategic tools with little regard for the determining or monitoring of the practicality of social impacts. In fact, doctoral candidates from the Open University conducted a BPEO review that reinforces the aforementioned thinking—their findings support “the idea that LCA would allow a systematic examination of a waste management option and its environmental impacts both up-stream and down-stream of the waste disposal unit” though “there is little, if any, literature that considers the combination of LCA with financial and social modelling techniques” in determining the BPEO. These scholars go on to highlight the importance of considering the “international obligations, the national policy framework, and policy guidance at a local level” to effectively determine the BPEO—noting the fact that “none of these [social] factors can be considered by a financial model or LCA alone”.
|
wikipedia
|
wiki_22627_chunk_1
|
Network for Earthquake Engineering Simulation
|
Description
The NEES network features 14 geographically distributed, shared-use laboratories that support several types of experimental work: geotechnical centrifuge research, shake table tests, large-scale structural testing, tsunami wave basin experiments, and field site research. Participating universities include: Cornell University; Lehigh University;Oregon State University; Rensselaer Polytechnic Institute; University at Buffalo, SUNY; University of California, Berkeley; University of California, Davis; University of California, Los Angeles; University of California, San Diego; University of California, Santa Barbara; University of Illinois at Urbana-Champaign; University of Minnesota; University of Nevada, Reno; and the University of Texas, Austin.
|
wikipedia
|
wiki_19370_chunk_4
|
Geological Association of Canada
|
Membership
Membership in the Geological Association of Canada is open to all geoscientists and those interested in geoscience. Membership can be renewed annually with members receiving many benefits including:
Reduced rates on Subscription to Geoscience Canada, GAC’s Flagship Journal
Free Online Subscription to GEOLOG, GAC’s informative, provocative and entertaining newsmagazine
45% Discount on GAC publications - Shop our Bookstore
Savings of >$300 on Canadian Journal of Earth Sciences online subscription
Savings of >$150 on Canadian Geotechnical Journal online subscription
Savings of >$75 on Environmental Reviews online subscription
Greatly reduced registration fee at GAC-MAC annual meetings
Networking opportunities with 13 Specialist Divisions and 6 Regional Sections (see below)
Networking opportunities with leading experts around the world
Publishing opportunity with your own professional publishing house
Members are granted voting privileges and have the opportunity to choose their representation in GAC at the annual general meeting; and
plus a multitude of Website resources at www.gac.ca
|
wikipedia
|
wiki_1325_chunk_3
|
World Network of Biosphere Reserves
|
Criteria and periodic review process
Article 4 of the defines general criteria for an area to be qualified for designation as a biosphere reserve as follows:
It should encompass a mosaic of ecological systems representative of major biogeographic regions, including a gradation of human interventions.
It should be of significance for biological diversity conservation.
It should provide an opportunity to explore and demonstrate approaches to sustainable development on a regional scale.
It should have an appropriate size to serve the three functions of biosphere reserves — conservation, development, logistic support.
It should include these functions through appropriate zonation, recognizing core, buffer, and outer transition areas.
Organizational arrangements should be provided for the involvement and participation of a suitable range of inter alia public authorities, local communities and private interests in the design and carrying out the functions of a biosphere reserve.
In addition, provisions should be made for:
mechanisms to manage human use and activities in the buffer zone or zones;
a management policy or plan for the area as a biosphere reserve;
a designated authority or mechanism to implement this policy or plan;
programmes for research, monitoring, education and training.
|
wikipedia
|
wiki_20887_chunk_24
|
Wind power forecasting
|
There are a number of questions that have still yet to be answered, according to a report from a coalition of researchers from universities, industry, and government, supported by the Atkinson Center for a Sustainable Future at Cornell University. They include:
How do wind farms with their multiple wakes interact with the atmospheric boundary layer to determine the net power that can be produced?
How do uneven terrain, roughness of the land or sea surface, and turbulence above the boundary layer and turbine wakes affect unsteady loading of downstream wind turbine blades?
What is the effect of the atmospheric stability (convective, neutral, or stably stratified) on the performance and loading characteristics throughout a typical daily cycle?
What is the optimal placement of wind turbines in an array, so that the kinetic energy capture can be maximized and unsteady loading be minimized?
|
wikipedia
|
wiki_7488_chunk_1
|
Triangulation (geometry)
|
Types
Different types of triangulations may be defined, depending both on what geometric object is to be subdivided and on how the subdivision is determined.
A triangulation of is a subdivision of into -dimensional simplices such that any two simplices in intersect in a common face (a simplex of any lower dimension) or not at all, and any bounded set in intersects only finitely many simplices in . That is, it is a locally finite simplicial complex that covers the entire space.
A point-set triangulation, i.e., a triangulation of a discrete set of points , is a subdivision of the convex hull of the points into simplices such that any two simplices intersect in a common face of any dimension or not at all and such that the set of vertices of the simplices are contained in . Frequently used and studied point set triangulations include the Delaunay triangulation (for points in general position, the set of simplices that are circumscribed by an open ball that contains no input points) and the minimum-weight triangulation (the point set triangulation minimizing the sum of the edge lengths).
In cartography, a triangulated irregular network is a point set triangulation of a set of two-dimensional points together with elevations for each point. Lifting each point from the plane to its elevated height lifts the triangles of the triangulation into three-dimensional surfaces, which form an approximation of a three-dimensional landform.
A polygon triangulation is a subdivision of a given polygon into triangles meeting edge-to-edge, again with the property that the set of triangle vertices coincides with the set of vertices of the polygon. Polygon triangulations may be found in linear time and form the basis of several important geometric algorithms, including a simple approximate solution to the art gallery problem. The constrained Delaunay triangulation is an adaptation of the Delaunay triangulation from point sets to polygons or, more generally, to planar straight-line graphs.
A triangulation of a surface consists of a net of triangles with points on a given surface covering the surface partly or totally.
In the finite element method, triangulations are often used as the mesh (in this case, a triangle mesh) underlying a computation. In this case, the triangles must form a subdivision of the domain to be simulated, but instead of restricting the vertices to input points, it is allowed to add additional Steiner points as vertices. In order to be suitable as finite element meshes, a triangulation must have well-shaped triangles, according to criteria that depend on the details of the finite element simulation (see mesh quality); for instance, some methods require that all triangles be right or acute, forming nonobtuse meshes. Many meshing techniques are known, including Delaunay refinement algorithms such as Chew's second algorithm and Ruppert's algorithm.
In more general topological spaces, triangulations of a space generally refer to simplicial complexes that are homeomorphic to the space.
|
wikipedia
|
wiki_5268_chunk_16
|
Process calculus
|
Developing new process calculi for better modeling of computational phenomena.
Finding well-behaved subcalculi of a given process calculus. This is valuable because (1) most calculi are fairly wild in the sense that they are rather general and not much can be said about arbitrary processes; and (2) computational applications rarely exhaust the whole of a calculus. Rather they use only processes that are very constrained in form. Constraining the shape of processes is mostly studied by way of type systems.
Logics for processes that allow one to reason about (essentially) arbitrary properties of processes, following the ideas of Hoare logic.
Behavioural theory: what does it mean for two processes to be the same? How can we decide whether two processes are different or not? Can we find representatives for equivalence classes of processes? Generally, processes are considered to be the same if no context, that is other processes running in parallel, can detect a difference. Unfortunately, making this intuition precise is subtle and mostly yields unwieldy characterisations of equality (which in most cases must also be undecidable, as a consequence of the halting problem). Bisimulations are a technical tool that aids reasoning about process equivalences.
Expressivity of calculi. Programming experience shows that certain problems are easier to solve in some languages than in others. This phenomenon calls for a more precise characterisation of the expressivity of calculi modeling computation than that afforded by the Church-Turing thesis. One way of doing this is to consider encodings between two formalisms and see what properties encodings can potentially preserve. The more properties can be preserved, the more expressive the target of the encoding is said to be. For process calculi, the celebrated results are that the synchronous π-calculus is more expressive than its asynchronous variant, has the same expressive power as the higher-order π-calculus, but is less than the ambient calculus.
Using process calculus to model biological systems (stochastic π-calculus, BioAmbients, Beta Binders, BioPEPA, Brane calculus). It is thought by some that the compositionality offered by process-theoretic tools can help biologists to organise their knowledge more formally.
|
wikipedia
|
wiki_26603_chunk_1
|
Computers and Intractability
|
Open problems
Another appendix of the book featured problems for which it was not known whether they were NP-complete or in P (or neither). The problems (with their original names) are:
Graph isomorphism
This problem is known to be in NP, but it is unknown if it is NP-complete.
Subgraph homeomorphism (for a fixed graph H)
Graph genus
Chordal graph completion
Chromatic index
Spanning tree parity problem
Partial order dimension
Precedence constrained 3-processor scheduling
This problem was still open as of 2016.
Linear programming
Total unimodularity
Composite number
Testing for compositeness is known to be in P, but the complexity of the closely related integer factorization problem remains open.
Minimum length triangulation
Problem 12 is known to be NP-hard, but it is unknown if it is in NP.
|
wikipedia
|
wiki_20232_chunk_10
|
Information-based complexity
|
These results are empirical; where does computational complexity come in? QMC is not a panacea for all high dimensional integrals. What is special about financial derivatives? Here's a possible explanation. The dimensions in the CMO represent monthly future times. Due to the discounted value of money variables representing times for in the future are less important than the variables representing nearby times. Thus the integrals are non-isotropic. Sloan and Woźniakowski introduced the very powerful idea of weighted spaces, which is a formalization of the above observation. They were able to show that with this additional domain knowledge high dimensional integrals satisfying certain conditions were tractable even in the worst case! In contrast the Monte Carlo method gives only a stochastic assurance. See Sloan and Woźniakowski When are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integration? J. Complexity 14, 1-33, 1998. For which classes of integrals is QMC superior to MC? This continues to be a major research problem.
|
wikipedia
|
wiki_20481_chunk_6
|
Abundance (ecology)
|
Measurement
There are several methods for measuring abundance. An example of this is Semi-Quantitive Abundance ratings. These are measurement methods which involve estimation based on viewing a specific area of a designated size. The two Semi-Quantitive Abundance ratings used are known as the D.A.F.O.R, and the A.C.F.O.R.
The A.C.F.O.R. scale is as follows:
A – Species observed is "Abundant" within the given area.
C – Species observed is "Common" within the given area.
F – Species observed is "Frequent" within the given area.
O – Species observed is "Occasional" within the given area
R – Species observed is "Rare" within the given area.
|
wikipedia
|
wiki_22746_chunk_9
|
Dearborn Center for Math, Science and Technology
|
Field trips
Many of the field trips taken at DCMST do not include all students, as some have a limited number of spaces that are given out on a first-come, first-served basis.
A handful to local colleges and universities such as University of Michigan–Dearborn, Henry Ford Community College, and Wayne State University (Yearly)
The Michigan High School Math and Science Symposium - MHSMSS (Spring; Yearly)
Sponsored by the Regional Math and Science Center at Grand Valley State University and Southwest Michigan Alliance of Mathematics, Science and Technology Centers
The NCSSSMST Student Conference (Fall; Yearly)
New York, New York (2003)
DCMST hosted the 2004 NCSSSMST Student Conference
Atlanta, Georgia (2005)
Salt Lake City, Utah (2006)
Washington, D.C./Virginia (2007)
Rochester, New York (2008)
Melbourne, Florida (2008)
Philadelphia, Pennsylvania (2009)
Detroit Science Center (Depending on current special exhibit)
Physics Day at Cedar Point (Yearly; Juniors Only)
The NCSSSMST Student Research Symposium (June; Yearly)
|
wikipedia
|
wiki_35987_chunk_14
|
Radioanalytical chemistry
|
As this is an analytical chemistry technique quality control is an important factor to maintain. A laboratory must produce trustworthy results. This can be accomplished by a laboratories continual effort to maintain instrument calibration, measurement reproducibility, and applicability of analytical methods. In all laboratories there must be a quality assurance plan. This plan describes the quality system and procedures in place to obtain consistent results. Such results must be authentic, appropriately documented, and technically defensible." Such elements of quality assurance include organization, personnel training, laboratory operating procedures, procurement documents, chain of custody records, standard certificates, analytical records, standard procedures, QC sample analysis program and results, instrument testing and maintenance records, results of performance demonstration projects, results of data assessment, audit reports, and record retention policies.
|
wikipedia
|
wiki_27985_chunk_13
|
Bees algorithm
|
%% GBA's automatic parameter settings
k = 3 * n / ((nGroups+1)^3 - 1); % GBA's parameter to set the number of scout bees in each group
groups = zeros(1,nGroups); % An array to keep the number of scout bees for each group
recruited_bees = zeros(1,nGroups); % An array to keep the number of recruited bees for each group
a = (((max - min) ./ 2) - R_ngh) ./ (nGroups^2 - 1); % GBA's parameter for setting neighborhood radiuses
b = R_ngh - a; % GBA's parameter for setting neighborhood radiuses
for i=1:nGroups % For each group
groups(i) = floor(k*i^2); % determine the number of scout bees in each group
if groups(i) == 0
groups(i) = 1; % there has to be at least one scout bee per each group
end
recruited_bees = (nGroups+1-i)^2; % set the number of recruited bees for each group
ngh(i) = a * i*i + b; % set the radius patch for each group
end
group_random = n - sum(groups); % assign the remainder bees (if any) to random search
group_random = max(group_random,0); % make sure it is not a negative number
|
wikipedia
|
wiki_21579_chunk_9
|
Computer Arts Society
|
There is a related Computer Arts Archive which is based in Leicester UK. The Computer Arts Archive is a not-for-profit company that collects, exhibits and promotes computer arts for the benefit of artists, audiences, curators, educators and researchers. Includes the CAS50 Collection (50 years since the founding of the CAS, 24 artists, inc. Sean Clark, Stephen Bell, Paul Brown, Sue Gollifer et al), and The Micro Arts Group Collection (1984 digital art group, data cassettes and Prestel, Quantel, inc. Geoff Davis, Michel Gaultier Carr-Brown et al). References
|
wikipedia
|
wiki_5974_chunk_19
|
Needleman–Wunsch algorithm
|
Advanced presentation of algorithm
Scores for aligned characters are specified by a similarity matrix. Here, is the similarity of characters a and b. It uses a linear gap penalty, here called . For example, if the similarity matrix was then the alignment:
AGACTAGTTAC
CGA---GACGT
with a gap penalty of −5, would have the following score: = −3 + 7 + 10 − (3 × 5) + 7 + (−4) + 0 + (−1) + 0 = 1
|
wikipedia
|
wiki_13592_chunk_11
|
Glossary of Unified Modeling Language terms
|
M
Merge - a point in an Activity diagram marking the end of the optional behavior started by a Decision
Message - a signal from one object (or similar entity) to another, often with parameters. Often implemented as a call to a Method, including the Constructor and Destructor, of an Object in a Sequence diagram.
Metadata -
Metamodel -
Metamodeling -
Metamodeling technique -
Meta-Object Facility -
Method -
Modeling -
Domain - the representation of real world conceptual entities
Design - the representation of software Classes and Interfaces
Dynamic - use of Interaction diagrams to describe collaborations and behavior
model -
Model-driven architecture (MDA) -
Multiplicity - 1. A specification of the number of possible occurrences of a property, or the number of allowable elements that may participate in a given relationship. In UML 1.x, it was also possible to have a discrete list of values, but this was eliminated in UML 2.0. 2. It specifies how many objects may be connected across an instance of an association which is written as a range of values (like 1..*).
Mandatory - A required multiplicity, the lower bound is at least one, usually 1..1 or 1
Optional - The lower bound is at most zero, usually, 0..1
Many - A multiplicity with no upper limit, either 0..* or *
Forbidden - No elements allowed, 0..0 (in UML 2.2)
|
wikipedia
|
wiki_33004_chunk_10
|
Nuclear magnetic resonance spectra database
|
ChemGate
A database that was developed and maintained by the publisher John Wiley & Sons. This database included more than 700,000 NMR, IR and MS Spectra, statistics specific to the NMR spectra are not listed. The NMR data includes 1H,13C, 11B, 15N, 17O, 19F, 29Si, and 31P. The data were in the form of graphically displayed line lists. Access to the database could be purchased piecemeal or leased as the entire library through individual or group contracts. These data are now made available through Wiley Online Library.
|
wikipedia
|
wiki_26493_chunk_173
|
Comparison of programming languages (associative array)
|
The library of the popular Standard ML of New Jersey (SML/NJ) implementation provides a signature (somewhat like an "interface"), ORD_MAP, which defines a common interface for ordered functional (immutable) associative arrays. There are several general functors—BinaryMapFn, ListMapFn, RedBlackMapFn, and SplayMapFn—that allow you to create the corresponding type of ordered map (the types are a self-balancing binary search tree, sorted association list, red–black tree, and splay tree, respectively) using a user-provided structure to describe the key type and comparator. The functor returns a structure in accordance with the ORD_MAP interface. In addition, there are two pre-defined modules for associative arrays that employ integer keys: IntBinaryMap and IntListMap.
|
wikipedia
|
wiki_20629_chunk_0
|
Lazar Mathew
|
Prof (Dr). T. LAZAR MATHEW, B. V.Sc; M.Sc. (Med); Ph.D; D.Sc; FABMS., FIMSA., FISI., FAMS (born ) is currently Senior Advisor at Manipal University. He has over 5 decades of experience in teaching, research and technology management. He worked as Director of 3 establishments (Life Sciences, DEBEL & INMAS) of Defence Research & Development Organization. After retirement, he was Director of a mission hospital at Ajmer and Dean and Director at VIT, Vellore. He was Sr.Advisor at PSG Institute of Advanced Studies, IIT Bombay and IIEST Kolkata; and was Pro Vice Chancellor, Karunya Institute of Technology and Sciences. He was instrumental to establish High Altitude Medical Research Centre at Leh, Society for Biomedical Technology, an internationally recognised Rural AIDS Facility and Centre for Biomedical Research, at varying periods. The document, ‘Indian Medical Devices Regulatory Authority ‘prepared by him formed the basis for the Parliamentary Act. He has 205 research Publications, 3 technical books, 12 patents and several awards to his credit. He has been Chairman of various scientific Committees of Govt, of India and represented our country as leader/member of various technical delegations abroad. He has been a respected teacher and examiner for M.B.B.S., B.D.S., B.Tech., M.Sc., M.Tech, Ph.D. for 5 Universities. He has delivered several keynote lectures, inaugural and convocation addresses. He has been a Visiting Professor in 3 Universities abroad in the area of Medical Technology and Biotechnology for Brief Periods. He is passionate about indigenous development of medical devices.
|
wikipedia
|
wiki_30110_chunk_27
|
GEORGE (operating system)
|
21.21.35← mk hellodir 21.28.10← dy hellodirThe system macro NEWCOPYIN is used to read from the tape serial number 123457. As the NEWCOPYIN macro loads a program the session becomes fully started (if the system was heavily loaded it might wait at this point).
21.28.16← newcopyin (123457) 21.28.32 JOB IS NOW FULLY STARTED
21.28.32 0.03 CORE GIVEN 4736
WAITING FOR MT 123457
Apparently the system operator couldn't find the tape and used the CANTDO command to refuse to load it, the NEWCOPYIN fails.
ERROR IN PARAMETER 2 IN OL IN NEWCOPYIN: MT (123457) CORRECTLY IDENTIFI
ED BUT NOT AVAILABLE
DISPLAY: ERROR IN NEWCOPYIN . MACRO ABANDONED
21.28.58 FREE *CR0, 0 TRANSFERS
21.28.58 0.05 DELETED,CLOCKED 0.00
0.05 :DELETED
END OF MACRO
The user tries again with the correct serial number this time. When the tape becomes available he is prompted for the file to load. The list of files is terminated by "****".
21.28.58← newcopyin (123456) 21.32.21 0.06 CORE GIVEN 4736
WAITING FOR MT 123456
21.32.34 USED U31 AS *MT0, MT (123456,HELLOTAPE(0/0))
← hello,hello(/plan) ← **** 21.32.52 FREE *CR0, 2 TRANSFERS
DISPLAY : 1 PARAMETER ACCEPTED
DISPLAY
0.08: MONITOR
DISPLAY : INPUT TAPE * 123456.
DISPLAY
0.08: MONITOR
21.32.52 FREE *FH0, 1 TRANSFERS
21.32.52 FREE U31,8 TRANSFERS
0.10 :DELETED : OK
21.32.52 0.10 DELETED,CLOCKED 0.00
END OF MACRO
The file has been loaded from tape. The LISTFILE (LF) command is used to examine its contents
21.32.52← lf hello #PRO HWLD40/TEST
#LOW
MESS 12HHELLO WRLD
#PRO
#ENT 0
DISTY '11/MESS'
DEL 2HOK
#END
There seems to be an error, so the user uses the EDIT (ED) command to fix it. The editor subcommand TC is used to position to the line containing "WRLD", the R command replaces "WRLD" by "WORLD", then the E command writes out the file.
21.33.01← ed hello EDITOR IS READY
|
wikipedia
|
wiki_1513_chunk_9
|
Evaluation function
|
Example
An example handcrafted evaluation function for chess might look like the following:
c1 * material + c2 * mobility + c3 * king safety + c4 * center control + c5 * pawn structure + c6 * king tropism + ... Each of the terms is a weight multiplied by a difference factor: the value of white's material or positional terms minus black's.
|
wikipedia
|
wiki_34222_chunk_1
|
The Last One (software)
|
Example
An example of a program to sort the names in a Christmas Card list in alphabetical order: 1. OPEN FILE <XMASLIST>
2. SET POINTER TO START OF FILE
3. SORT FILE
4. INPUT FROM FILE
5. IF END OF FILE REACHED BRANCH TO 8
6. OUTPUT DATA
7. UNCONDITIONAL BRANCH TO 4
8. TERMINATE References Notes
THE LAST ONE Trademark - Registration Number 1218969 - Serial Number 73318733 :: Justia Trademarks BASIC interpreters
|
wikipedia
|
wiki_11271_chunk_11
|
Single-molecule experiment
|
Single-molecule experiments versus ensemble experiments
When looking at data related to individual molecules, one usually can construct propagators, and jumping time probability density functions, of the first order, the second order and so on, whereas from bulk experiments, one usually obtains the decay of a correlation function. From the information contained in these unique functions (obtained from individual molecules), one can extract a relatively clear picture on the way the system behaves; e.g. its kinetic scheme, or its potential of activity, or its reduced dimensions form. In particular, one can construct (many properties of) the reaction pathway of an enzyme when monitoring the activity of an individual enzyme. Additionally, significant aspects regarding the analysis of single molecule data—such as fitting methods and tests for homogeneous populations—have been described by several authors. On the other hand, there are several issues with the analysis of single molecule data including construction of a low noise environment and insulated pipet tips, filtering some of the remaining unwanted components (noise) found in recordings, and the length of time required for data analysis (pre-processing, unambiguous event detection, plotting data, fitting kinetic schemes, etc.).
|
wikipedia
|
wiki_31423_chunk_18
|
Neural modeling fields
|
Example of dynamic logic operations
Finding patterns below noise can be an exceedingly complex problem. If an exact pattern shape is not known and depends on unknown parameters, these parameters should be found by fitting the pattern model to the data. However, when the locations and orientations of patterns are not known, it is not clear which subset of the data points should be selected for fitting. A standard approach for solving this kind of problem is multiple hypothesis testing (Singer et al. 1974). Since all combinations of subsets and models are exhaustively searched, this method faces the problem of combinatorial complexity. In the current example, noisy 'smile' and 'frown' patterns are sought. They are shown in Fig.1a without noise, and in Fig.1b with the noise, as actually measured. The true number of patterns is 3, which is not known. Therefore, at least 4 patterns should be fit to the data, to decide that 3 patterns fit best. The image size in this example is 100x100 = 10,000 points. If one attempts to fit 4 models to all subsets of 10,000 data points, computation of complexity, MN ~ 106000. An alternative computation by searching through the parameter space, yields lower complexity: each pattern is characterized by a 3-parameter parabolic shape. Fitting 4x3=12 parameters to 100x100 grid by a brute-force testing would take about 1032 to 1040 operations, still a prohibitive computational complexity.
To apply NMF and dynamic logic to this problem one needs to develop parametric adaptive models of expected patterns. The models and conditional partial similarities for this case are described in details in: a uniform model for noise, Gaussian blobs for highly-fuzzy, poorly resolved patterns, and parabolic models for 'smiles' and 'frowns'. The number of computer operations in this example was about 1010. Thus, a problem that was not solvable due to combinatorial complexity becomes solvable using dynamic logic.
|
wikipedia
|
wiki_73_chunk_49
|
Calculus
|
Calculus is used in every branch of the physical sciences, actuarial science, computer science, statistics, engineering, economics, business, medicine, demography, and in other fields wherever a problem can be mathematically modeled and an optimal solution is desired. It allows one to go from (non-constant) rates of change to the total change or vice versa, and many times in studying a problem we know one and are trying to find the other. Calculus can be used in conjunction with other mathematical disciplines. For example, it can be used with linear algebra to find the "best fit" linear approximation for a set of points in a domain. Or, it can be used in probability theory to determine the expectation value of a continuous random variable given a probability density function. In analytic geometry, the study of graphs of functions, calculus is used to find high points and low points (maxima and minima), slope, concavity and inflection points. Calculus is also used to find approximate solutions to equations; in practice it is the standard way to solve differential equations and do root finding in most applications. Examples are methods such as Newton's method, fixed point iteration, and linear approximation. For instance, spacecraft use a variation of the Euler method to approximate curved courses within zero gravity environments.
|
wikipedia
|
wiki_2903_chunk_64
|
Second Industrial Revolution
|
replacing rule-of-thumb work methods with methods based on a scientific study of the tasks
scientifically selecting, training, and developing each employee rather than passively leaving them to train themselves
providing "detailed instruction and supervision of each worker in the performance of that worker's discrete task"
dividing work nearly equally between managers and workers, such that the managers apply scientific-management principles to planning the work and the workers actually perform the tasks
|
wikipedia
|
wiki_5467_chunk_6
|
Mathematical statistics
|
Special distributions
Normal distribution, the most common continuous distribution
Bernoulli distribution, for the outcome of a single Bernoulli trial (e.g. success/failure, yes/no)
Binomial distribution, for the number of "positive occurrences" (e.g. successes, yes votes, etc.) given a fixed total number of independent occurrences
Negative binomial distribution, for binomial-type observations but where the quantity of interest is the number of failures before a given number of successes occurs
Geometric distribution, for binomial-type observations but where the quantity of interest is the number of failures before the first success; a special case of the negative binomial distribution, where the number of successes is one.
Discrete uniform distribution, for a finite set of values (e.g. the outcome of a fair die)
Continuous uniform distribution, for continuously distributed values
Poisson distribution, for the number of occurrences of a Poisson-type event in a given period of time
Exponential distribution, for the time before the next Poisson-type event occurs
Gamma distribution, for the time before the next k Poisson-type events occur
Chi-squared distribution, the distribution of a sum of squared standard normal variables; useful e.g. for inference regarding the sample variance of normally distributed samples (see chi-squared test)
Student's t distribution, the distribution of the ratio of a standard normal variable and the square root of a scaled chi squared variable; useful for inference regarding the mean of normally distributed samples with unknown variance (see Student's t-test)
Beta distribution, for a single probability (real number between 0 and 1); conjugate to the Bernoulli distribution and binomial distribution
|
wikipedia
|
wiki_10188_chunk_2
|
Profiling (computer programming)
|
A statistical summary of the events observed (a profile)
Summary profile information is often shown annotated against the source code statements where the events occur, so the size of measurement data is linear to the code size of the program. /* ------------ source------------------------- count */
0001 IF X = "A" 0055
0002 THEN DO
0003 ADD 1 to XCOUNT 0032
0004 ELSE
0005 IF X = "B" 0055
|
wikipedia
|
wiki_10502_chunk_16
|
Encoded Archival Description
|
<eadheader audience="internal" countryencoding="iso3166-1"
dateencoding="iso8601" langencoding="iso639-2b"
relatedencoding="DC" repositoryencoding="iso15511"
scriptencoding="iso15924">
<eadid countrycode="us" identifier="bachrach_lf" mainagencycode="NSyU">bachrach_lf</eadid>
<filedesc>
<titlestmt>
<titleproper encodinganalog="Title">Louis Fabian Bachrach Papers</titleproper>
<subtitle>An inventory of his papers at Blank University</subtitle>
<author encodinganalog="Creator">Mary Smith</author>
</titlestmt>
<publicationstmt>
<publisher encodinganalog="Publisher">Blank University</publisher>
<date encodinganalog="Date" normal="1981">1981</date>
</publicationstmt>
</filedesc>
<profiledesc>
<creation>John Jones
<date normal="2006-09-13">13 Sep 2006</date>
</creation>
<langusage>
<language encodinganalog="Language" langcode="eng">English</language>
</langusage>
</profiledesc>
</eadheader>
|
wikipedia
|
wiki_37811_chunk_40
|
Go (programming language)
|
where "fmt" is the package for formatted I/O, similar to C's C file input/output. Concurrency
The following simple program demonstrates Go's concurrency features to implement an asynchronous program. It launches two lightweight threads ("goroutines"): one waits for the user to type some text, while the other implements a timeout. The statement waits for either of these goroutines to send a message to the main routine, and acts on the first message to arrive (example adapted from David Chisnall's book). package main
|
wikipedia
|
wiki_39201_chunk_0
|
Cantor (software)
|
Cantor is a free software mathematics application for scientific statistics and analysis. It is part of the KDE Software Compilation 4, and was introduced with the 4.4 release as part of the KDE Education Project's kdeedu package. Features
Cantor is a graphical user interface that delegates its mathematical operations to one of several backends. Its plugin-based structure allows adding different backends. It can make use of Julia, KAlgebra, Lua, Maxima, Octave, Python, Qalculate!, R, SageMath, and Scilab.
|
wikipedia
|
wiki_30059_chunk_49
|
Topological data analysis
|
Persistence landscapes, introduced by Peter Bubenik, are a different way to represent barcodes, more amenable to statistical analysis. The persistence landscape of a persistent module is defined as a function , , where denotes the extended real line and . The space of persistence landscapes is very nice: it inherits all good properties of barcode representation (stability, easy representation, etc.), but statistical quantities can be readily defined, and some problems in Y. Mileyko et al.'s work, such as the non-uniqueness of expectations, can be overcome. Effective algorithms for computation with persistence landscapes are available. Another approach is to use revised persistence, which is image, kernel and cokernel persistence.
|
wikipedia
|
wiki_2834_chunk_4
|
Programming Language for Business
|
IF (DF_EDIT[ITEM] = "PHYS")
STATESAVE MYSTATE
IF (C_F07B != 2)
DISPLAY *SETSWALL 1:1:1:80:
*BGCOLOR=2,*COLOR=15:
*P49:1," 7-Find "
ELSE
DISPLAY *SETSWALL 1:1:1:80:
*BGCOLOR=7,*COLOR=0:
*P49:1," 7-Find "
ENDIF
STATEREST MYSTATE
TRAP GET_PRO NORESET IF F7
ENDIF
IF (SHOW_FILTER AND THIS_FILTER AND C_CUSTNO <> "MAG")
LOADMOD "filter"
PACK PASS_ID WITH "QED ",QED_ID1,BLANKS
MOVE " FILTER DISPLAY (F6) " TO PASS_DESC
SET C_BIGFLT
CALL RUN_FILT USING PASS_ID,PASS_DESC,"432"
UNLOAD "filter"
CLEAR THIS_FILTER
ENDIF
|
wikipedia
|
wiki_36186_chunk_0
|
SOFA Statistics
|
SOFA Statistics is an open-source statistical package. The name stands for Statistics Open For All. It has a graphical user interface and can connect directly to MySQL, PostgreSQL, SQLite, MS Access (map), and Microsoft SQL Server. Data can also be imported from CSV and Tab-Separated files or spreadsheets (Microsoft Excel, OpenOffice.org Calc, Numeric, Google Docs). The main statistical tests available are Independent and Paired t-tests, Wilcoxon signed ranks, Mann–Whitney U, Pearson's chi squared, Kruskal Wallis H, one-way ANOVA, Spearman's R, and Pearson's R. Nested tables can be produced with row and column percentages, totals, Sd, mean, median, lower and upper quartiles, and sum.
|
wikipedia
|
wiki_19916_chunk_4
|
Software blueprint
|
Languages such as the Concurrent Description Language (CDL) separate an application's macroscopic logic (communication, synchronization and arbitration) from complex multi-threaded and/or multi-process applications into a single contiguous visual representation. The prescriptive nature of this description means that it can be machine translated into an executable framework that may be tested for structural integrity (detection of race conditions, deadlocks etc.) before the microscopic logic is available. Class designers
|
wikipedia
|
wiki_16734_chunk_4
|
Pure function
|
Compiler optimizations
Functions that have just the above property 2 allow for compiler optimization techniques such as common subexpression elimination and loop optimization similar to arithmetic operators. A C++ example is the length method, returning the size of a string, which depends on the memory contents where the string points to, therefore lacking the above property 1. Nevertheless, in a single-threaded environment, the following C++ code
std::string s = "Hello, world!";
int a[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int l = 0;
|
wikipedia
|
wiki_15588_chunk_27
|
N-body simulation
|
orbital_entities[0] = { 0.0,0.0,0.0, 0.0,0.0,0.0, 1.989e30 }; // a star similar to the sun
orbital_entities[1] = { 57.909e9,0.0,0.0, 0.0,47.36e3,0.0, 0.33011e24 }; // a planet similar to mercury
orbital_entities[2] = { 108.209e9,0.0,0.0, 0.0,35.02e3,0.0, 4.8675e24 }; // a planet similar to venus
orbital_entities[3] = { 149.596e9,0.0,0.0, 0.0,29.78e3,0.0, 5.9724e24 }; // a planet similar to earth
orbital_entities[4] = { 227.923e9,0.0,0.0, 0.0,24.07e3,0.0, 0.64171e24 }; // a planet similar to mars
orbital_entities[5] = { 778.570e9,0.0,0.0, 0.0,13e3,0.0, 1898.19e24 }; // a planet similar to jupiter
orbital_entities[6] = { 1433.529e9,0.0,0.0, 0.0,9.68e3,0.0, 568.34e24 }; // a planet similar to saturn
orbital_entities[7] = { 2872.463e9,0.0,0.0, 0.0,6.80e3,0.0, 86.813e24 }; // a planet similar to uranus
orbital_entities[8] = { 4495.060e9,0.0,0.0, 0.0,5.43e3,0.0, 102.413e24 }; // a planet similar to neptunewhere is a variable which will remain at 0 temporarily, but allows for future inclusion of significant numbers of asteroids, at the users discretion. A critical step for the configuration of simulations is to establish the time ranges of the simulation, to , as well as the incremental time step which will progress the simulation forward:double t_0 = 0;
double t = t_0;
double dt = 86400;
double t_end = 86400 * 365 * 10; // approximately a decade in seconds
double BIG_G = 6.67e-11; // gravitational constantThe positions and velocities established above are interpreted to be correct for .
|
wikipedia
|
wiki_3817_chunk_13
|
Air America (radio network)
|
Original network programming for weekends included:
Marc Sussman's Money Message (9–10a.m. ET Saturday)
State of Belief with Rev. Dr. C. Welton Gaddy (10–11a.m. Saturday; rebroadcast 7–8p.m. ET Sunday)Freethought Radio with Dan Barker and Annie Laurie Gaylor (1–2p.m. ET Saturday)Go Vegan with Bob Linden (2–3p.m. ET Saturday)
Ring of Fire with Robert F. Kennedy Jr. and Mike Papantonio (3–6p.m. ET Saturday)
7 Days in America with Carlos Watson and Arianna Huffington (6–7p.m. ET Saturday; rebroadcast 9–10a.m. ET Sunday)
Radio Nation with Laura Flanders (1–2p.m. ET Sunday)
Politically Direct with David Bender (4–7p.m. ET Sunday)
The Steve Earle Show with Steve Earle (10–11p.m. ET Sunday)
On The Real with Chuck D and Gia'na Garel (11p.m.–1a.m. ET Sunday)
|
wikipedia
|
wiki_34784_chunk_4
|
OPTICS algorithm
|
function OPTICS(DB, eps, MinPts) is
for each point p of DB do
p.reachability-distance = UNDEFINED
for each unprocessed point p of DB do
N = getNeighbors(p, eps)
mark p as processed
output p to the ordered list
if core-distance(p, eps, MinPts) != UNDEFINED then
Seeds = empty priority queue
update(N, p, Seeds, eps, MinPts)
for each next q in Seeds do
N' = getNeighbors(q, eps)
mark q as processed
output q to the ordered list
if core-distance(q, eps, MinPts) != UNDEFINED do
update(N', q, Seeds, eps, MinPts)
|
wikipedia
|
wiki_34910_chunk_41
|
Watson (computer)
|
In healthcare, Watson's natural language, hypothesis generation, and evidence-based learning capabilities are being investigated to see how Watson may contribute to clinical decision support systems and the increase in artificial intelligence in healthcare for use by medical professionals. To aid physicians in the treatment of their patients, once a physician has posed a query to the system describing symptoms and other related factors, Watson first parses the input to identify the most important pieces of information; then mines patient data to find facts relevant to the patient's medical and hereditary history; then examines available data sources to form and test hypotheses; and finally provides a list of individualized, confidence-scored recommendations. The sources of data that Watson uses for analysis can include treatment guidelines, electronic medical record data, notes from healthcare providers, research materials, clinical studies, journal articles and patient information. Despite being developed and marketed as a "diagnosis and treatment advisor", Watson has never been actually involved in the medical diagnosis process, only in assisting with identifying treatment options for patients who have already been diagnosed.
|
wikipedia
|
wiki_13539_chunk_5
|
Defense Manpower Data Center
|
Description The mission of DMDC can be summarized as follows: Collect and maintain an archive of automated manpower, personnel, training, and other databases for the Department of Defense,
Support the information requirements of the OUSD (P&R) and other members of the DoD manpower, personnel, and training communities with accurate, timely, and consistent data,
Operate DoD-wide personnel programs and conduct research and analysis as directed by the OUSD (P&R). Incidents
|
wikipedia
|
wiki_16591_chunk_10
|
Pathfinder network
|
(The two variants by Quirin et al. are significantly faster. While the former can be applied with q = 2 or q = n − 1 and any value for r, the latter can only be applied in cases where q = n − 1 and r = ∞.) External links
List of papers using Pathfinder
Pathfinder Software Download Site
Implementation of the original, Binary, Fast and MST variants of the algorithm in C Psychometrics
|
wikipedia
|
wiki_7660_chunk_11
|
Circuit rank
|
Parametrized complexity
Some computational problems on graphs are NP-hard in general, but can be solved in polynomial time for graphs with a small circuit rank. An example is the path reconfiguration problem. Related concepts
Other numbers defined in terms of deleting things from graphs are:
|
wikipedia
|
wiki_2656_chunk_3
|
Ethnomathematics
|
"The mathematics which is practiced among identifiable cultural groups such as national-tribe societies, labour groups, children of certain age brackets and professional classes".
"The mathematics implicit in each practice".
"The study of mathematical ideas of a non-literate culture".
"The codification which allows a cultural group to describe, manage and understand reality".
"Mathematics…is conceived as a cultural product which has developed as a result of various activities".
"The study and presentation of mathematical ideas of traditional peoples".
"Any form of cultural knowledge or social activity characteristic of a social group and/or cultural group that can be recognized by other groups such as Western anthropologists, but not necessarily by the group of origin, as mathematical knowledge or mathematical activity".
"The mathematics of cultural practice".
"The investigation of the traditions, practices and mathematical concepts of a subordinated social group".
"I have been using the word ethnomathematics as modes, styles, and techniques (tics) of explanation, of understanding, and of coping with the natural and cultural environment (mathema) in distinct cultural systems (ethnos)".
"What is the difference between ethnomathematics and the general practice of creating a mathematical model of a cultural phenomenon (e.g., the "mathematical anthropology" of Paul Kay [1971] and others)? The essential issue is the relation between intentionality and epistemological status. A single drop of water issuing from a watering can, for example, can be modeled mathematically, but we would not attribute knowledge of that mathematics to the average gardener. Estimating the increase in seeds required for an increased garden plot, on the other hand, would qualify".
"N.C. Ghosh included Ethnomathematics in the list of Folk Mathematics" Vide : Lokdarpan- a Journal of the Department of Folklore, Kalyani University and Rabindra Bharati Patrika- a Journal of Rabindra Bharati University, Kolkata, India. Lokashruti - a Journal of Govt. of West Bengal, India.
|
wikipedia
|
wiki_2827_chunk_31
|
Simplex algorithm
|
Efficiency in the worst case
The simplex method is remarkably efficient in practice and was a great improvement over earlier methods such as Fourier–Motzkin elimination. However, in 1972, Klee and Minty gave an example, the Klee–Minty cube, showing that the worst-case complexity of simplex method as formulated by Dantzig is exponential time. Since then, for almost every variation on the method, it has been shown that there is a family of linear programs for which it performs badly. It is an open question if there is a variation with polynomial time, although sub-exponential pivot rules are known.
|
wikipedia
|
wiki_31769_chunk_1
|
Mathurapur (Lok Sabha constituency)
|
|-
! style="background-color:#E9E9E9;text-align:left;" width=225 |Party
! style="background-color:#E9E9E9;text-align:right;" |Seats won
! style="background-color:#E9E9E9;text-align:right;" |Seat change
! style="background-color:#E9E9E9;text-align:right;" |Vote percentage
|-
| style="text-align:left;" |Trinamool Congress
| style="text-align:center;" | 19
| style="text-align:center;" | 18
| style="text-align:center;" | 31.8
|-
| style="text-align:left;" |Indian National Congress
| style="text-align:center;" | 6
| style="text-align:center;" | 0
| style="text-align:center;" | 13.45
|-
| style="text-align:left;" |Socialist Unity Centre of India (Communist)
| style="text-align:center;" | 1
| style="text-align:center;" | 1
| style="text-align:center;" | NA
|-
|-
| style="text-align:left;" |Communist Party of India (Marxist)
| style="text-align:center;" | 9
| style="text-align:center;" | 17
| style="text-align:center;" | 33.1
|-
| style="text-align:left;" |Communist Party of India
| style="text-align:center;" | 2
| style="text-align:center;" | 1
| style="text-align:center;" | 3.6
|-
| style="text-align:left;" |Revolutionary Socialist Party
| style="text-align:center;" | 2
| style="text-align:center;" | 1
| style="text-align:center;" | 3.56
|-
| style="text-align:left;" |Forward bloc
| style="text-align:center;" | 2
| style="text-align:center;" | 1
| style="text-align:center;" | 3.04
|-
| style="text-align:left;" |Bharatiya Janata Party
| style="text-align:center;" | 1
| style="text-align:center;" | 1
| style="text-align:center;" | 6.14
|-
|}
|
wikipedia
|
wiki_20745_chunk_2
|
Coded Arms: Contagion
|
Story Special forces major Grant is part of an elite unit brought in to test and analyze the effectiveness of the reconfigured A.I.D.A. combat simulation program. After spreading aggressively through Earth's networks, and absorbing all the information it encountered, it turned into a program that required users to completely digitize their personalities to jack in, risking their lives for access to the rich cache of data. After a massive undertaking, A.I.D.A. has finally been contained.
|
wikipedia
|
wiki_6059_chunk_12
|
Code page 437
|
Internationalization
Code page 437 has a series of international characters, mainly values 128 to 175 (80hex to AFhex). However, it only covers a few major Western European languages in full, including English, German and Swedish, and so lacks several characters (mostly capital letters) important to many major Western European languages:
Spanish: Á, É, Í, Ó, Ú, Ü, á, é, í, ó, ú, ü, Ñ, ñ, ª, º, ¿ and ¡
French: À, Â, È, Ê, Ë, Î, Ï, Ô, Œ, œ, Ù, Û, and Ÿ
Portuguese: Á, À, Â, Ã, ã, Ê, Í, Ó, Ô, Õ, õ, and Ú
Catalan: À, È, Í, Ï, Ò, Ó, and Ú
Italian: À, È, Ì, Ò, and Ù
Icelandic: Á, Ð, ð, Í, Ó, Ú, Ý, ý, Þ, and þ
Danish/Norwegian: Ø and ø. Character number 237 (EDhex), the small phi (closed form), could be used as a surrogate even though it may not render well (furthermore, it tends to map to Unicode, and/or render in Unicode fonts, as the open-form phi or the closed-vertical-form phi, which are even further from the O with stroke). To compensate, the Danish/Norwegian and Icelandic code pages (865 and 861) replaced cent sign (¢) with ø and the yen sign (¥) with Ø.
Most Greek alphabet symbols were omitted, beyond the basic math symbols. (They were included in the Greek-language code pages 737 and 869. Some of the Greek symbols that were already in code page 437 had their glyphs changed from mathematical or scientific forms to match the actual use in Greek.)
|
wikipedia
|
wiki_13672_chunk_32
|
Computational electromagnetics
|
Answering this question involves three steps: comparison between simulation results and analytical formulation, cross-comparison between codes, and comparison of simulation results with measurement. Comparison between simulation results and analytical formulation
For example, assessing the value of the radar cross section of a plate with the analytical formula: where A is the surface of the plate and is the wavelength. The next curve presenting the RCS of a plate computed at 35 GHz can be used as reference example. Cross-comparison between codes
One example is the cross comparison of results from method of moments and asymptotic methods in their validity domains.
|
wikipedia
|
wiki_30004_chunk_1
|
Navigational Algorithms
|
Comparison between manual calculation methods and the use of calculators The traditional methods require bulky and expensive nautical tables (which must be updated), pencil and paper, and calculation time, following the working algorithms.
Calculators (and the like) do not need books (they have tables and ephemeris integrated) and, with their own algorithms, allow quick and error-free calculation of navigation problems.
|
wikipedia
|
wiki_26351_chunk_8
|
Purdue University College of Engineering
|
American Institute of Chemical Engineers (AIChE)
American Society of Agricultural Biological Engineers (ASABE)
Biomedical Engineering Society (BMES)
Construction Engineers of the Future (CEF)
Electrical and Computer Engineering Student Society (ECESS)
Institute of Electrical and Electronic Engineers (IEEE)
Eta Kappa Nu (ECE Honor Society)
National Society of Black Engineers (NSBE)
Omega Chi Epsilon (CHE Honor Society)
Purdue Engineering Student Council (PESC)
Purdue iGEM
Purdue Mechanical Engineering Ambassadors (PMEA)
Purdue Society of Professional Engineers (PSPE)
Society for Biological Engineering (SBE)
Society of Environmental & Ecological Engineers (SEEE)
Society of Women Engineers (SWE)
Students for the Exploration & Development of Space (SEDS)
The list of clubs and student organizations at Purdue is always growing. There are many other organizations apart from these actively running on campus that help enrich the social, cultural, and educational experiences of Purdue students and help enhance the overall diversity at the University.
|
wikipedia
|
wiki_2278_chunk_1
|
Epidemiological method
|
Outline of the process of an epidemiological study
Establish that a problem exists
Full epidemiological studies are expensive and laborious undertakings. Before any study is started, a case must be made for the importance of the research.
Confirm the homogeneity of the events
Any conclusions drawn from inhomogeneous cases will be suspicious. All events or occurrences of the disease must be true cases of the disease.
Collect all the events
It is important to collect as much information as possible about each event in order to inspect a large number of possible risk factors. The events may be collected from varied methods of epidemiological study or from censuses or hospital records.
The events can be characterized by Incidence rates and prevalence rates.
Often, occurrence of a single disease entity is set as an event.
Given inherent heterogeneous nature of any given disease (i.e., the unique disease principle), a single disease entity may be treated as disease subtypes. This framework is well conceptualized in the interdisciplinary field of molecular pathological epidemiology (MPE).
Characterize the events as to epidemiological factors
Predisposing factors
Non-environmental factors that increase the likelihood of getting a disease. Genetic history, age, and gender are examples.
Enabling/disabling factors
Factors relating to the environment that either increase or decrease the likelihood of disease. Exercise and good diet are examples of disabling factors. A weakened immune system and poor nutrition are examples of enabling factors.
Precipitation factors
This factor is the most important in that it identifies the source of exposure. It may be a germ, toxin or gene.
Reinforcing factors
These are factors that compound the likelihood of getting a disease. They may include repeated exposure or excessive environmental stresses.
Look for patterns and trends
Here one looks for similarities in the cases which may identify major risk factors for contracting the disease. Epidemic curves may be used to identify such risk factors.
Formulate a hypothesis
If a trend has been observed in the cases, the researcher may postulate as to the nature of the relationship between the potential disease-causing agent and the disease.
Test the hypothesis
Because epidemiological studies can rarely be conducted in a laboratory the results are often polluted by uncontrollable variations in the cases. This often makes the results difficult to interpret. Two methods have evolved to assess the strength of the relationship between the disease causing agent and the disease.
Koch's postulates were the first criteria developed for epidemiological relationships. Because they only work well for highly contagious bacteria and toxins, this method is largely out of favor.
Bradford-Hill Criteria are the current standards for epidemiological relationships. A relationship may fill all, some, or none of the criteria and still be true.
Publish the results.
|
wikipedia
|
wiki_554_chunk_6
|
Simplified molecular-input line-entry system
|
The original paper that described the CANGEN algorithm claimed to generate unique SMILES strings for graphs representing molecules, but the algorithm fails for a number of simple cases (e.g. cuneane, 1,2-dicyclopropylethane) and cannot be considered a correct method for representing a graph canonically. There is currently no systematic comparison across commercial software to test if such flaws exist in those packages.
|
wikipedia
|
wiki_28251_chunk_42
|
Functional hypothalamic amenorrhea
|
Improving energy balance status, often through behavioral change, is the recommended means for restoring HPO function, and this commonly requires the adoption of behaviors which promote weight gain. Avoidance of chronic stressors and modification of the stress-response with cognitive behavioral therapy (CBT) may also help in cases of FHA associated with significant stress. For while the obvious solution to this problem appears to be a natural return to menses through restoration of energy balance and reduction in external stressors, the fact that FHA often presents in women who suffer from patterns of disordered eating and display concerns about body image and/or athletic performance, increased caloric consumption and decreased physical activity may be rejected. In this population, where success in sport is highly emphasized, decreasing training intensity is typically not an option. Parents and legal guardians should be made aware of the long-term risk factors for osteoporosis and infertility which underlie this condition when deciding on a treatment plan. A multi-disciplinary team approach in management that includes a medical doctor, dietitian, and a psychiatrist or psychologist to provide psychological support is recommended.
|
wikipedia
|
wiki_15470_chunk_15
|
The Mechanical Universe
|
Classroom use continued into the 1990s. A minority education program at the University of California, Berkeley employed Mechanical Universe episode segments (on LaserDisc) as part of group discussions. In a 1993 review of the series, a science historian stated that he had used episodes in his classes for several years, naming "Kepler's Three Laws" and "The Michelson–Morley Experiment" as his personal favorites.The highlight of the Kepler film is a segment in which we are shown an exquisite graphical realization of the way in which Kepler actually figured out that the orbits of the planets are elliptical rather than circular. The sheer difficulty of the problem he faced and the elegance of the method he applied to solve it are abundantly clear. I cannot imagine a better way to present this magnificent discovery, which can easily appear so trivial.A 2005 column in The Physics Teacher suggested The Mechanical Universe as preparatory viewing for instructors attempting to teach physics for the first time. The Physics Teacher has also recommended the series "as enrichment or a makeup assignment for high-ability students". Writing for Wired magazine's web site, Rhett Allain cited the series as an example of videos that could replace some functions of traditional lectures.
|
wikipedia
|
wiki_21162_chunk_2
|
Power to the edge
|
Achieving situational awareness rather than creating a single operational picture
Self-synchronizing operations instead of autonomous operations
Information "pull" rather than broadcast information "push"
Collaborative efforts rather than individual efforts
Communities of Interest (COIs) rather than stovepipes
"Task, post, process, use" rather than "task, process, exploit, disseminate"
Handling information once rather than handling multiple data calls
Sharing data rather than maintaining private data
Persistent, continuous information assurance rather than perimeter, one-time security
Bandwidth on demand rather than bandwidth limitations
IP-based transport rather than circuit-based transport
Net-Ready KPP rather than interoperability KPP
Enterprise services rather than separate infrastructures
COTS based, net-centric capabilities rather than customized, platform-centric IT
|
wikipedia
|
wiki_15231_chunk_10
|
Computer user satisfaction
|
Future developments
Currently, some scholars and practitioners are experimenting with other measurement methods and further refinements of the definition for satisfaction and user satisfaction. Others are replacing structured questionnaires by unstructured ones, where the respondent is asked simply to write down or dictate all the factors about a system which either satisfies or dissatisfies them. One problem with this approach, however, is that the instruments tend not to yield quantitative results, making comparisons and statistical analysis difficult. Also, if scholars cannot agree on the precise meaning of the term satisfaction, respondents will be highly unlikely to respond consistently to such instruments. Some newer instruments contain a mix of structured and unstructured items.
|
wikipedia
|
wiki_14913_chunk_7
|
FAUST (programming language)
|
Using the sequential composition operator : the output of + can be routed to the input of abs to compute the absolute value of the signal:
process = + : abs;
Here is an example of parallel composition using the , operator that arranges its left and right expressions in parallel. This is analogous to a stereo cable.
process = _,_;
These operators can be arbitrarily combined. The following code multiplies an input signal with 0.5:
process = _,0.5 : *;
The above may be rewritten in curried form:
process = *(0.5);
The recursive composition operator ~ can be used to create block diagrams with cycles (that include an implicit one-sample delay). Here is an example of an integrator that takes an input signal X and computes an output signal Y such that Y(t) = X(t) + Y(t−1):
process = + ~ _;
|
wikipedia
|
wiki_4516_chunk_14
|
Geologic map
|
Although BGS maps show the British national grid reference system and employ an OS base map, sheet boundaries are not based on the grid. The 1:50,000 sheets originate from earlier 'one inch to the mile' (1:63,360) coverage utilising the pre-grid Ordnance Survey One Inch Third Edition as the base map. Current sheets are a mixture of modern field mapping at 1:10,000 redrawn at the 1:50,000 scale and older 1:63,360 maps reproduced on a modern base map at 1:50,000. In both cases the original OS Third Edition sheet margins and numbers are retained. The 1:250,000 sheets are defined using lines of latitude and longitude, each extending 1° north-south and 2° east-west.
|
wikipedia
|
wiki_10859_chunk_8
|
Lloyd's algorithm
|
Integration of a cell and computation of its centroid (center of mass) is now given as a weighted combination of its simplices' centroids (in the following called ).
Two dimensions:
For a triangle the centroid can be easily computed, e.g. using cartesian coordinates.
Weighting computes as simplex-to-cell area ratios.
Three dimensions:
The centroid of a tetrahedron is found as the intersection of three bisector planes and can be expressed as a matrix-vector product.
Weighting computes as simplex-to-cell volume ratios.
|
wikipedia
|
wiki_15536_chunk_6
|
Parks–McClellan filter design algorithm
|
The algorithm
The Parks–McClellan Algorithm is implemented using the following steps:
Initialization: Choose an extremal set of frequences {ωi(0)}.
Finite Set Approximation: Calculate the best Chebyshev approximation on the present extremal set, giving a value δ(m) for the min-max error on the present extremal set.
Interpolation: Calculate the error function E(ω) over the entire set of frequencies Ω using (2).
Look for local maxima of |E(m)(ω)| on the set Ω.
If max(ω∈Ω)|E(m)(ω)| > δ(m), then update the extremal set to {ωi(m+1)} by picking new frequencies where |E(m)(ω)| has its local maxima. Make sure that the error alternates on the ordered set of frequencies as described in (4) and (5). Return to Step 2 and iterate.
If max(ω∈Ω)|E(m)(ω)| ≤ δ(m), then the algorithm is complete. Use the set {ωi(0)} and the interpolation formula to compute an inverse discrete Fourier transform to obtain the filter coefficients.
|
wikipedia
|
wiki_13613_chunk_31
|
Civilian Public Service
|
The following chart lists the unit numbers, facility, type of project, capacity of CPS assignees, and dates of many experiments done on COs that were approved by the OSRD and CMR as reported by Selective Service. The numbers reported may be slightly inaccurate as some COs and experiments were not properly recorded. Specific Experiments
|
wikipedia
|
wiki_39344_chunk_33
|
Selective serotonin reuptake inhibitor
|
Adults
It is unclear whether SSRIs affect the risk of suicidal behavior in adults.
A 2005 meta-analysis of drug company data found no evidence that SSRIs increased the risk of suicide; however, important protective or hazardous effects could not be excluded.
A 2005 review observed that suicide attempts are increased in those who use SSRIs as compared to placebo and compared to therapeutic interventions other than tricyclic antidepressants. No difference risk of suicide attempts was detected between SSRIs versus tricyclic antidepressants.
On the other hand, a 2006 review suggests that the widespread use of antidepressants in the new "SSRI-era" appears to have led to a highly significant decline in suicide rates in most countries with traditionally high baseline suicide rates. The decline is particularly striking for women who, compared with men, seek more help for depression. Recent clinical data on large samples in the US too have revealed a protective effect of antidepressant against suicide.
A 2006 meta-analysis of random controlled trials suggests that SSRIs increase suicide ideation compared with placebo. However, the observational studies suggest that SSRIs did not increase suicide risk more than older antidepressants. The researchers stated that if SSRIs increase suicide risk in some patients, the number of additional deaths is very small because ecological studies have generally found that suicide mortality has declined (or at least not increased) as SSRI use has increased.
An additional meta-analysis by the FDA in 2006 found an age-related effect of SSRI's. Among adults younger than 25 years, results indicated that there was a higher risk for suicidal behavior. For adults between 25 and 64, the effect appears neutral on suicidal behavior but possibly protective for suicidal behavior for adults between the ages of 25 and 64. For adults older than 64, SSRI's seem to reduce the risk of both suicidal behavior.
In 2016 a study criticized the effects of the FDA Black Box suicide warning inclusion in the prescription. The authors discussed the suicide rates might increase also as a consequence of the warning.
|
wikipedia
|
wiki_12999_chunk_4
|
Integrated Encryption Scheme
|
Required information
To send an encrypted message to Bob using ECIES, Alice needs the following information:
The cryptography suite to be used, including a key derivation function (e.g., ANSI-X9.63-KDF with SHA-1 option), a message authentication code (e.g., HMAC-SHA-1-160 with 160-bit keys or HMAC-SHA-1-80 with 80-bit keys) and a symmetric encryption scheme (e.g., TDEA in CBC mode or XOR encryption scheme) — noted .
The elliptic curve domain parameters: for a curve over a prime field or for a curve over a binary field.
Bob's public key , which Bob generates it as follows: , where is the private key he chooses at random.
Some optional shared information: and
which denotes the point at infinity.
|
wikipedia
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.