text
stringlengths
14
4.79k
source
stringlengths
13
304
tokens
float64
75
1.06k
char_length
float64
106
4.79k
article_title
stringlengths
16
300
In 1976, a CRREL researcher was instrumental in the moving of a 10-story-high, 2,900 t (3,200-short-ton) DEW Line facility on the Greenland Ice Cap from a foundation that had been compromised by the movement of the ice on which it was built to a new foundation. This required the measurement of in-situ snow strength and...
Wikipedia - Snow science
null
null
null
It is designed accommodate approximately 60 annual sorties of heavy, wheeled transport aircraft. The compacted snow runway was designed and constructed to service a Boeing C-17 weighing more than 230,000 kg (500,000 lb).
Wikipedia - Snow science
null
null
null
This required engineering knowledge of the properties of mechanically-hardened snow. Snow tires – Snow tires perform three functions: compaction, shear bonding and bearing. On roadways they compact the snow in front of them and provide a shear bond between the treads and the compacted snow.
Wikipedia - Snow science
null
null
null
Off-road, they also provide bearing on the compacted snow. The bearing contact must be low enough for the tires not to sink too deeply for forward progress to become impeded by compacting the snow in front of them. Tread design is critical to snow tires used on roads and represent a tradeoff between on-snow traction an...
Wikipedia - Snow science
null
null
null
Snow sliders – The ability of a ski or other runner to slide over snow depends on both the properties of the snow and the ski to result in an optimum amount of lubrication from melting the snow by friction with the ski—too little and the ski interacts with solid snow crystals, too much and capillary attraction of meltw...
Wikipedia - Snow science
null
null
null
Knowledge graph completion (KGC) is a collection of techniques to infer knowledge from an embedded knowledge graph representation. In particular, this technique completes a triple inferring the missing entity or relation. The corresponding sub-tasks are named link or entity prediction (i.e., guessing an entity from the...
Wikipedia - Knowledge graph embedding
null
null
null
Knowledge management is the definition of the knowledge that employees and systems use to perform their functions and maintaining it in a format that can be accessed by others. The Duhon and the Gartner Group have defined it as "a discipline that promotes an integrated approach to identifying, capturing, evaluating, re...
Wikipedia - Business engineering
null
null
null
Customer Service Customer Service is a key component to an effective business and business plan. Customer service in the 21st century is always evolving, and it is important to grow with your customer base. Not only does a social media presence matter, but also clear communication, clear expectation setting, speed, and...
Wikipedia - Business engineering
null
null
null
Knowledge management plays an important part in quality engineering. The quality engineering knowledge base comprises manifold structured and unstructured data, ranging from code repositories via requirements specifications, standards, test reports, enterprise architecture models to system configurations and runtime lo...
Wikipedia - Quality engineering
null
null
null
Of prime importance is the focus on quality assurance tasks, early recognition of risks, and appropriate support for the collaboration of actors. This results in the following requirements for a quality engineering knowledge base: Knowledge is available in a quality as required. Important quality criteria include that ...
Wikipedia - Quality engineering
null
null
null
Knowledge is interconnected and traceable in order to support interaction between the actors and to facilitate analysis of data. Such traceability relates not only to interconnectedness of data across different levels of abstraction (e.g. connection of requirements with the services realizing them) but also to their tr...
Wikipedia - Quality engineering
null
null
null
Information has to be available in a form that is consistent with the domain knowledge of the appropriate actors. Therefore, the knowledge base has to provide adequate mechanisms for information transformation (e.g. aggregation) and visualization. The RACI concept is an example of an appropriate model for assigning act...
Wikipedia - Quality engineering
null
null
null
Knowledge of arithmetic progressions is also evident from the mathematical sources. == References ==
Wikipedia - Egyptian algebra
null
null
null
Knowledge of human stiffness variation and stiffness selection has influenced robotic designs as researchers attempt to design robots that act more like biological systems. In order for robots to act more like biological systems, work is being done to attempt to implement stiffness modulation in robots so that they may...
Wikipedia - Neural control of limb stiffness
null
null
null
Additionally, robotic exoskeletons have attempted to implement similar adjustable stiffness in their devices. These robots implement stiffness control for multiple reasons.
Wikipedia - Neural control of limb stiffness
null
null
null
The robots must be able to interact efficiently with the external environment but they must also be able to interact safely with their human user. Stiffness modulation and impedance control can be leveraged to accomplish both of these goals. These devices achieve variable stiffness in various ways. Some devices use con...
Wikipedia - Neural control of limb stiffness
null
null
null
Knowledge of the huge ruins of Teotihuacan was never completely lost. After the fall of the city, various squatters lived on the site. During Aztec times, the city was a place of pilgrimage and identified with the myth of Tollan, the place where the sun was created. Today, Teotihuacan is one of the most noted archeolog...
Wikipedia - Teotihuacan
null
null
null
Knowledge of volatility is often useful in the separation of components from a mixture. When a mixture of condensed substances contains multiple substances with different levels of volatility, its temperature and pressure can be manipulated such that the more volatile components change to a vapor while the less volatil...
Wikipedia - Volatile liquids
null
null
null
Crude oil entering a refinery is composed of many useful chemicals that need to be separated. The crude oil flows into a distillation tower and is heated up, which allows the more volatile components such as butane and kerosene to vaporize. These vapors move up the tower and eventually come in contact with cold surface...
Wikipedia - Volatile liquids
null
null
null
The most volatile chemical condense at the top of the column while the least volatile chemicals to vaporize condense in the lowest portion. On the right is a picture illustrating the design of a distillation tower. The difference in volatility between water and ethanol has traditionally been used in the refinement of d...
Wikipedia - Volatile liquids
null
null
null
Knowledge, for Popper, was objective, both in the sense that it is objectively true (or truthlike), and also in the sense that knowledge has an ontological status (i.e., knowledge as object) independent of the knowing subject (Objective Knowledge: An Evolutionary Approach, 1972). He proposed three worlds: World One, be...
Wikipedia - Karl Popper
null
null
null
In other words, the knowledge held by a given individual mind owes at least as much to the total, accumulated, wealth of human knowledge made manifest, comparably to the world of direct experience. As such, the growth of human knowledge could be said to be a function of the independent evolution of World Three. Many co...
Wikipedia - Karl Popper
null
null
null
Knowledge-based engineering at the Norwegian University of Science and Technology (NTNU) Aircraft Design & Design Methodologies department at the Faculty of Aerospace Engineering of the Delft University of Technology See Webliography for AI in Design hosted by Worcester Polytechnic Institute and the NSF Report "Researc...
Wikipedia - Knowledge-based engineering
null
null
null
Known applications of many-valued logic can be roughly classified into two groups. The first group uses many-valued logic to solve binary problems more efficiently. For example, a well-known approach to represent a multiple-output Boolean function is to treat its output part as a single many-valued variable and convert...
Wikipedia - Multi-valued logic
null
null
null
The second group targets the design of electronic circuits that employ more than two discrete levels of signals, such as many-valued memories, arithmetic circuits, and field programmable gate arrays (FPGAs). Many-valued circuits have a number of theoretical advantages over standard binary circuits. For example, the int...
Wikipedia - Multi-valued logic
null
null
null
In memory design, storing two instead of one bit of information per memory cell doubles the density of the memory in the same die size. Applications using arithmetic circuits often benefit from using alternatives to binary number systems. For example, residue and redundant number systems can reduce or eliminate the rip...
Wikipedia - Multi-valued logic
null
null
null
These number systems have a natural implementation using many-valued circuits. However, the practicality of these potential advantages heavily depends on the availability of circuit realizations, which must be compatible or competitive with present-day standard technologies.
Wikipedia - Multi-valued logic
null
null
null
In addition to aiding in the design of electronic circuits, many-valued logic is used extensively to test circuits for faults and defects. Basically all known automatic test pattern generation (ATG) algorithms used for digital circuit testing require a simulator that can resolve 5-valued logic (0, 1, x, D, D'). The add...
Wikipedia - Multi-valued logic
null
null
null
Known as ENGLISH, ACCESS, AQL, UniQuery, Retrieve, CMQL, and by many other names over the years, corresponding to the different MultiValue implementations, the MultiValue query language differs from SQL in several respects. Each query is issued against a single dictionary within the schema, which could be understood as...
Wikipedia - MultiValue database
null
null
null
Known as a click detection process, the cetacean detector algorithm was originally implemented in analog electronics to test different dolphins and porpoises in containment and in freedom. The center frequency is 130 kilohertz with a 30 kilohertz bandwidth. The pulse's envelope is tracked through a sequence of short cl...
Wikipedia - Autonomous recording unit
null
null
null
This helps humans understand the acoustic behavior. In between clicks, acoustic behavior can be observed. Behavioral interpolation of the mammals can be inferred between inter-click periods. The system has implemented the SDA14 platform alongside DSP to get full bandwidth waveforms that holds large advantages cetacean ...
Wikipedia - Autonomous recording unit
null
null
null
Known as the idea of Nested Simulations: the existence of simulated reality is seen to be unprovable (and also unfalsifiable) in any concrete sense as there is an infinite regress problem with the argument: any evidence that is directly observed could be another simulation itself. Even if we are a simulated reality, th...
Wikipedia - Simulation hypothesis
null
null
null
Known converters for mzData to mzXML: Hermes: A Java "mzData, mzXML, mzML" converter to all directions: publicly available, runs with a graphical user interface, by the Institute of Molecular Systems Biology, ETH Zurich FileConverter: A command line tool that converts to/from various mass spectrometry formats, part of ...
Wikipedia - MzXML
null
null
null
Users are now redirected by the TPP development team to use the msConvert software (see above). FileConverter: A command line tool that converts to/from various mass spectrometry formats, part of TOPPConverters for proprietary formats: msConvert: A command line tool converting to/from various mass spectrometry formats ...
Wikipedia - MzXML
null
null
null
CompassXport, Bruker's free tool generating mzXML (and now mzData) files for many of their native file formats (.baf). MASSTransit, a software to change data between proprietary formats, by Palisade Corporation and distributed by Scientific Instrument Services, Inc and PerkinElmer. Purchased from Palisade by John Wiley...
Wikipedia - MzXML
null
null
null
Known convex hull algorithms are listed below, ordered by the date of first publication. Time complexity of each algorithm is stated in terms of the number of inputs points n and the number of points on the hull h. Note that in the worst case h may be as large as n. Gift wrapping, a.k.a. Jarvis march — O(nh) One of the...
Wikipedia - Convex hull algorithms
null
null
null
It has O(nh) time complexity, where n is the number of points in the set, and h is the number of points in the hull. In the worst case the complexity is Θ(n2). Graham scan — O(n log n) A slightly more sophisticated, but much more efficient algorithm, published by Ronald Graham in 1972.
Wikipedia - Convex hull algorithms
null
null
null
If the points are already sorted by one of the coordinates or by the angle to a fixed vector, then the algorithm takes O(n) time. Quickhull Created independently in 1977 by W. Eddy and in 1978 by A. Bykat. Just like the quicksort algorithm, it has the expected time complexity of O(n log n), but may degenerate to O(n2) ...
Wikipedia - Convex hull algorithms
null
null
null
Divide and conquer — O(n log n) Another O(n log n) algorithm, published in 1977 by Preparata and Hong. This algorithm is also applicable to the three dimensional case.
Wikipedia - Convex hull algorithms
null
null
null
Monotone chain, a.k.a. Andrew's algorithm— O(n log n) Published in 1979 by A. M. Andrew. The algorithm can be seen as a variant of Graham scan which sorts the points lexicographically by their coordinates.
Wikipedia - Convex hull algorithms
null
null
null
When the input is already sorted, the algorithm takes O(n) time. Incremental convex hull algorithm — O(n log n) Published in 1984 by Michael Kallay. Kirkpatrick–Seidel algorithm — O(n log h) The first optimal output-sensitive algorithm.
Wikipedia - Convex hull algorithms
null
null
null
It modifies the divide and conquer algorithm by using the technique of marriage-before-conquest and low-dimensional linear programming. Published by Kirkpatrick and Seidel in 1986. Chan's algorithm — O(n log h) A simpler optimal output-sensitive algorithm created by Chan in 1996. It combines gift wrapping with the exec...
Wikipedia - Convex hull algorithms
null
null
null
Known mathematical texts show that scribes used (least) common multiples to turn problems with fractions into problems using integers. The multiplicative factors were often recorded in red ink and are referred to as Red auxiliary numbers.
Wikipedia - Egyptian algebra
null
null
null
Known versions by DataPac Australasia Pty Limited include: Datapac Multiuser DOS 5.0 Datapac Multiuser DOS 5.1 (BDOS 6.6) Datapac System Manager 7.0 (1996-08-22)In 1997, Datapac was bought by Citrix Systems, Inc., and System Manager was abandoned soon after. In 2002 the Sydney-based unit was spun out into Citrix' Advan...
Wikipedia - DR Multiuser DOS
null
null
null
Knox CJ and Gavan Duffy J noted that the impossibility of obedience test (see R v Licensing Court of Brisbane; Ex parte Daniell) may not be appropriate in all circumstances. They formulated a new test: where one statute confers a right, and the other takes away the right, even if the right may be waived or abandoned, t...
Wikipedia - Clyde Engineering Co Ltd v Cowburn
null
null
null
"Isaacs and Starke JJ also concluded an inconsistency based on the covering the field test. An inconsistency may arise where the Commonwealth law, expressly or impliedly, intends to cover the field completely, and supersede or exclude any other laws in that area. If the State law then enters that field, or the part of ...
Wikipedia - Clyde Engineering Co Ltd v Cowburn
null
null
null
Knus, Max-Albert (1991), Quadratic and Hermitian forms over rings, Grundlehren der Mathematischen Wissenschaften, vol. 294, Berlin etc.: Springer-Verlag, ISBN 3-540-52117-8, Zbl 0756.11008 Saltman, David J. (1999). Lectures on division algebras.
Wikipedia - Azumaya algebra
null
null
null
Regional Conference Series in Mathematics. Vol. 94.
Wikipedia - Azumaya algebra
null
null
null
Providence, RI: American Mathematical Society. ISBN 0-8218-0979-2. Zbl 0934.16013.
Wikipedia - Azumaya algebra
null
null
null
Knuth (1968, 1973) has given a list of five properties that are widely accepted as requirements for an algorithm: Finiteness: "An algorithm must always terminate after a finite number of steps ... a very finite number, a reasonable number" Definiteness: "Each step of an algorithm must be precisely defined; the actions ...
Wikipedia - Algorithm characterization
null
null
null
Knuth admits that, while his description of an algorithm may be intuitively clear, it lacks formal rigor, since it is not exactly clear what "precisely defined" means, or "rigorously and unambiguously specified" means, or "sufficiently basic", and so forth. He makes an effort in this direction in his first volume where...
Wikipedia - Algorithm characterization
null
null
null
Many of the algorithms in his books are written in the MIX language. He also uses tree diagrams, flow diagrams and state diagrams. "Goodness" of an algorithm, "best" algorithms: Knuth states that "In practice, we not only want algorithms, we want good algorithms...." He suggests that some criteria of an algorithm's goo...
Wikipedia - Algorithm characterization
null
null
null
He calls this sort of inquiry "algorithmic analysis: given an algorithm, to determine its performance characteristcis" (all quotes this paragraph: Knuth Vol. 1 p. 7)
Wikipedia - Algorithm characterization
null
null
null
Knuth describes it as follows: We introduced a simple procedure called the “TPK algorithm,” and gave the flavor of each language by expressing TPK in each particular style. The TPK algorithm inputs eleven numbers a 0 , a 1 , … , a 10 {\displaystyle a_{0},a_{1},\ldots ,a_{10}} ; then it outputs a sequence of eleven pair...
Wikipedia - TPK algorithm
null
null
null
Knuth supplies the following triangle of numbers summarizing pairs of n {\displaystyle n} and k {\displaystyle k} for which the exact number of comparisons needed by an optimal selection algorithm is known. The n {\displaystyle n} th row of the triangle (starting with n = 1 {\displaystyle n=1} in the top row) gives the...
Wikipedia - Median search
null
null
null
Knuth's main purpose in describing Algorithm X was to demonstrate the utility of dancing links. Knuth showed that Algorithm X can be implemented efficiently on a computer using dancing links in a process Knuth calls "DLX". DLX uses the matrix representation of the exact cover problem, implemented as doubly linked lists...
Wikipedia - Algorithm X
null
null
null
(Technically, because the lists are circular, this forms a torus). Because exact cover problems tend to be sparse, this representation is usually much more efficient in both size and processing time required. DLX then uses dancing links to quickly select permutations of rows as possible solutions and to efficiently bac...
Wikipedia - Algorithm X
null
null
null
Knuth–Bendix completion algorithm Root-finding algorithms Symbolic integration via e.g. Risch algorithm or Risch–Norman algorithm Hypergeometric summation via e.g. Gosper's algorithm Limit computation via e.g. Gruntz's algorithm Polynomial factorization via e.g., over finite fields, Berlekamp's algorithm or Cantor–Zass...
Wikipedia - Computer algebra systems
null
null
null
Knuth–Morris–Pratt computes a DFA that recognizes inputs with the string to search for as a suffix, Boyer–Moore starts searching from the end of the needle, so it can usually jump ahead a whole needle-length at each step. Baeza–Yates keeps track of whether the previous j characters were a prefix of the search string, a...
Wikipedia - Substring search
null
null
null
Kobayashi et al. compared American-English monolingual and Japanese-English bilingual children's brain responses in understanding others' intentions through false-belief story and cartoon tasks. They found universal activation of the region bilateral ventromedial prefrontal cortex in theory of mind tasks. However, Amer...
Wikipedia - Cognitive development
null
null
null
Kober reviewed 162 neuroimaging studies published between 1990 and 2005 in order to determine if specific brain regions were activated when experiencing an emotion directly and (indirectly) through the experience of someone else. According to the study, six different functional groups showed similar activation patterns...
Wikipedia - Affective neuroscience
null
null
null
Kodi has the built-in optional function to automatically download metadata information, cover art and other related media artwork online through its web scrapers that looks for media in the user's audio and video folders and their sub-directories. These "scrapers" are used as importers to obtain detailed information fr...
Wikipedia - XBMC Media Center
null
null
null
XBMCGUI then provides a rich display for audio and video files that the scrapers have identified. Scrapers use sites like The Movie Database (TMDb) or IMDb.com to obtain thumbnails and information on movies, thetvdb.com for TV show posters and episode plots, CDDB for audio CD track listings, and Allmusic (AMG) and Musi...
Wikipedia - XBMC Media Center
null
null
null
Koecher's arguments apply for finite-dimensional Jordan algebras over the real or complex numbers.
Wikipedia - Quadratic Jordan algebra
null
null
null
Koegas lies in the Northern Cape province of South Africa, some 71 kilometres (44 mi) north-west of the town of Prieska. Before 1910 it was part of Griqualand West and between then and 1995 it was part of Cape Province. Koegas lies at the southern end of the Cape Province crocidolite (blue asbestos) deposit (also known...
Wikipedia - Koegas mine
null
null
null
The folding has practically eliminated any deposits to the west of the site.The Westerberg deposit fibres are in seams of 3–102 millimetres (1⁄8–4 in) thickness (which determines the maximum individual fibre length). Many seams are located close to one another in "reefs" separated by bands of plain ironstone of 1.2–10....
Wikipedia - Koegas mine
null
null
null
Nine reefs are present at Koegas, with the overall deposit being 46 metres (150 ft) thick, and they yield particularly high quality asbestos fibres. The fibres, which are blue in colour because of their iron protoxide content, have been noted to be stronger than those of chrysotile (white asbestos) deposits. The deposi...
Wikipedia - Koegas mine
null
null
null
Koide formula – an unexplained empirical equation remarked upon by Yoshio Koide in 1981, and later by others. It relates the masses of the three charged leptons: Q = m e + m μ + m τ ( m e + m μ + m τ ) 2 = 0.666661 ( 7 ) ≈ 2 3 {\displaystyle Q={\frac {m_{e}+m_{\mu }+m_{\tau }}{{\big (}{\sqrt {m_{e}}}+{\sqrt {m_{\mu }}}...
Wikipedia - Physics beyond the Standard Model
null
null
null
The CKM matrix, if interpreted as a rotation matrix in a 3-dimensional vector space, "rotates" a vector composed of square roots of down-type quark masses ( m d , m s , m b ) {\displaystyle ({\sqrt {m_{d}}},{\sqrt {m_{s}}},{\sqrt {m_{b}}}{\big )}} into a vector of square roots of up-type quark masses ( m u , m c , m t ...
Wikipedia - Physics beyond the Standard Model
null
null
null
Kolmogorov randomness defines a string (usually of bits) as being random if and only if every computer program that can produce that string is at least as long as the string itself. To make this precise, a universal computer (or universal Turing machine) must be specified, so that "program" means a program for this uni...
Wikipedia - Chaitin's incompleteness theorem
null
null
null
Whether a particular string is random, however, depends on the specific universal computer that is chosen. This is because a universal computer can have a particular string hard-coded in itself, and a program running on this universal computer can then simply refer to this hard-coded string using a short sequence of bi...
Wikipedia - Chaitin's incompleteness theorem
null
null
null
This definition can be extended to define a notion of randomness for infinite sequences from a finite alphabet. These algorithmically random sequences can be defined in three equivalent ways. One way uses an effective analogue of measure theory; another uses effective martingales. The third way defines an infinite sequ...
Wikipedia - Chaitin's incompleteness theorem
null
null
null
Kolmogorov's Invariance theorem clarifies that the Kolmogorov Complexity, or Minimal Description Length, of a dataset is invariant to the choice of Turing-Complete language used to simulate a Universal Turing Machine: ∀ x ∈ { 0 , 1 } ∗ , | K U ( x ) − K U ′ ( x ) | ≤ O ( 1 ) {\displaystyle \forall x\in \{0,1\}^{*},|K_{...
Wikipedia - Algorithmic probability
null
null
null
Kolmogorov-Arnol'd-Moser papers.See classical mechanics section.Fermi, E.; Pasta, J.; Ulam, S. (1955)See computational physics section.Lorenz, Edward N. (1963).
Wikipedia - List of important publications in physics
null
null
null
"Deterministic Nonperiodic Flow". Journal of the Atmospheric Sciences. 20 (2): 130–141.
Wikipedia - List of important publications in physics
null
null
null
Bibcode:1963JAtS...20..130L. doi:10.1175/1520-0469(1963)020<0130:DNF>2.0.CO;2. ISSN 1520-0469.A finite system of deterministic nonlinear ordinary differential equations is introduced to represent forced dissipative hydrodynamic flow, simulating simple phenomena in the real atmosphere.
Wikipedia - List of important publications in physics
null
null
null
All of the solutions are found to be unstable, and most of them nonperiodic, thus forcing to reevaluate the feasibility of long-term weather prediction. In this paper the Lorenz attractor is presented for the first time, and gave the first hint of what is now known as butterfly effect.Li, Tien-Yien; Yorke, James A. (19...
Wikipedia - List of important publications in physics
null
null
null
"Period Three Implies Chaos". The American Mathematical Monthly. 82 (10): 985–992.
Wikipedia - List of important publications in physics
null
null
null
Bibcode:1975AmMM...82..985L. CiteSeerX 10.1.1.329.5038. doi:10.2307/2318254. JSTOR 2318254.
Wikipedia - List of important publications in physics
null
null
null
Komar, A. B. (1956). "Necessity of Singularities in the Solution of the Field Equations of General Relativity". Physical Review.
Wikipedia - Arthur Komar
null
null
null
104 (2): 544–546. Bibcode:1956PhRv..104..544K. doi:10.1103/PhysRev.104.544.
Wikipedia - Arthur Komar
null
null
null
Komatiite can be classified according to the following geochemical criteria; SiO2; typically 40–45% MgO greater than 18% Low K2O (<0.5%) Low CaO and Na2O (<2% combined) Low Ba, Cs, Rb (incompatible element) enrichment; ΣLILE <1,000 ppm High Ni (>400 ppm), Cr (>800 ppm), Co (>150 ppm)The above geochemical classification...
Wikipedia - Komatiite
null
null
null
Komatiite tends to fractionate from high-magnesium compositions in the flow bases where olivine cumulates dominate, to lower magnesium compositions higher up in the flow. Thus, the current metamorphic mineralogy of a komatiite will reflect the chemistry, which in turn represents an inference as to its volcanological fa...
Wikipedia - Komatiite
null
null
null
Kondo model (s-d model) Minimal model (Virasoro minimal model)
Wikipedia - List of quantum field theories
null
null
null
Kononenko et al. propose a number of updates to Relief. Firstly, they find the near-hit and near-miss instances using the Manhattan (L1) norm rather than the Euclidean (L2) norm, although the rationale is not specified. Furthermore, they found taking the absolute differences between xi and near-hiti, and xi and near-mi...
Wikipedia - Relief (feature selection)
null
null
null
Konrad Lorenz argued in 1949 that infantile features triggered nurturing responses in adults and that this was an evolutionary adaptation which helped ensure that adults cared for their children, ultimately securing the survival of the species. Some later scientific studies have provided further evidence for Lorenz's t...
Wikipedia - Cuteness
null
null
null
Konstanz Information Miner (KNIME) Pentaho
Wikipedia - List of free and open-source software packages
null
null
null
Kontsevich proposed a model for Landau–Ginzburg models which was worked out to the following definition: a Landau–Ginzburg model is a smooth variety X {\displaystyle X} together with a morphism W: X → A 1 {\displaystyle W:X\to \mathbb {A} ^{1}} which is flat. There are three associated categories which can be used to a...
Wikipedia - Derived noncommutative algebraic geometry
null
null
null
Kopelman, Weber, & Messick (2002), in a review of the experimental research on cooperation in commons dilemmas, identify nine classes of independent variables that influence cooperation in commons dilemmas: social motives, gender, payoff structure, uncertainty, power and status, group size, communication, causes, and f...
Wikipedia - Inverse commons
null
null
null
Korber oversees the HIV Database and Analysis Project at Los Alamos. She and her team have built a global HIV database of more than 840,000 sequences from publications of the viral genome. In addition, the database focuses on the small regions (called epitopes) within the virus that can be recognized by antibodies, and...
Wikipedia - Bette Korber
null
null
null
There is also data on the immunological profiles of individuals resistant to HIV. Korber and many other researchers have applied the data to devise possible treatments and vaccines against HIV. Her work has resulted in design of vaccines now being tested in clinical trials.
Wikipedia - Bette Korber
null
null
null
Korea Foundation for the Science and Creativity, LG Chem, and Korea Dow Chemical Company supports the KChO.
Wikipedia - Korean Chemistry Olympiad
null
null
null
Korean: 기하와 벡터 Gihawa Begteo Plane Curves (평면곡선 pyung-myun-gog-seon) Vectors in the Plane (평면 벡터 pyung-myun beg-teo) Graphs and Vectors in Space (공간의 그래프와 벡터 gong-gan-eui geu-re-pu-wa beg-teo)
Wikipedia - The Art of Mathematics
null
null
null
Korean: 미적분 I mijuckboon I Limits of Sequences (수열의 극한 soo-yeul-eui geuk-han) Limits and Continuity (극한과 연속성 geuk-han-gwa yeon-sok-sung) Differentiation of Polynomial Functions (다항식의 미분 da-hang-sik-eui mi-boon) Integration of Polynomial Functions (다항식의 적분 da-hang-sik-eui juck-boon)
Wikipedia - The Art of Mathematics
null
null
null
Korean: 미적분 II mijuckboon II Exponential and Logarithmic Functions (지수와 로그 함수 ji-soo-wa lo-geu-ham-soo) Trigonometric Functions (삼각함수 sam-gak-ham-soo) Differentiation (미분 mi-boon) Integration (적분 juck-boon)
Wikipedia - The Art of Mathematics
null
null
null
Korean: 수학 I suhak I Polynomials (다항식 da-hang-sik) Equations and Inequalities (방정식과 부등식 bang-jeong-sik-gwa boo-deung-sik) Graphs of Equations (방정식의 그래프 bang-jeong-sik-eui geu-re-pu)
Wikipedia - The Art of Mathematics
null
null
null
Korean: 수학 II suhak II Sets and Propositions (집합과 명제 jib-hab-gwa myung-jeh) Functions (함수 ham-soo) Sequences (수열 soo-yeul) Exponents and Logarithms (지수와 로그함수 ji-soo-wa lo-geu-ham-soo)
Wikipedia - The Art of Mathematics
null
null
null
Korean: 확률과 통계 hwanglyulgwa tonggye Permutations and Combinations (순열과 조합 soon-yeul-gwa jo-hab) Probability (확률 hwang-lyul) Statistics (통계 tong-gye)
Wikipedia - The Art of Mathematics
null
null
null
Korepin has made contributions to several fields of theoretical physics. Although he is best known for his involvement in condensed matter physics and mathematical physics, he significantly contributed to quantum gravity as well. In recent years, his work has focused on aspects of condensed matter physics relevant for ...
Wikipedia - Vladimir Korepin
null
null
null
Koročun or Kračun was a pagan Slavic holiday. It was considered the day when the Black God and other spirits associated with decay and darkness were most potent. The first recorded usage of the term was in 1143, when the author of the Novgorod First Chronicle referred to the winter solstice as "Koročun".It was celebrat...
Wikipedia - Korochun
null
null
null